multipliers.h File Reference

#include "read_xml_arch_file.h"
#include "util.h"

Include dependency graph for multipliers.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	s_multiplier
Typedefs
typedef struct s_multiplier	t_multiplier
Functions
void	init_mult_distribution ()
void	report_mult_distribution ()
void	declare_hard_multiplier (nnode_t *node)
void	instantiate_hard_multiplier (nnode_t *node, short mark, netlist_t *netlist)
void	instantiate_simple_soft_multiplier (nnode_t *node, short mark, netlist_t *netlist)
void	find_hard_multipliers ()
void	add_the_blackbox_for_mults (FILE *out)
void	define_mult_function (nnode_t *node, short type, FILE *out)
void	split_multiplier (nnode_t *node, int a0, int b0, int a1, int b1)
void	iterate_multipliers (netlist_t *netlist)
void	clean_multipliers ()
Variables
t_model *	hard_multipliers
struct s_linked_vptr *	mult_list
int	min_mult

---

Typedef Documentation

typedef struct s_multiplier t_multiplier

---

Function Documentation

void add_the_blackbox_for_mults

(

FILE *

out

)

Here is the caller graph for this function:

void clean_multipliers

(

)

Here is the caller graph for this function:

void declare_hard_multiplier

(

nnode_t *

node

)

void define_mult_function	(	nnode_t *	node,
		short	type,
		FILE *	out
	)

Here is the caller graph for this function:

void find_hard_multipliers

(

)

Here is the caller graph for this function:

void init_mult_distribution

(

)

void instantiate_hard_multiplier	(	nnode_t *	node,
		short	mark,
		netlist_t *	netlist
	)

Here is the caller graph for this function:

void instantiate_simple_soft_multiplier	(	nnode_t *	node,
		short	mark,
		netlist_t *	netlist
	)

Definition at line 61 of file multipliers.c.

{
        int width_a;
        int width_b;
        int width;
        int multiplier_width;
        int multiplicand_width;
        nnode_t **adders_for_partial_products;
        nnode_t ***partial_products;
        int multiplicand_offset_index;
        int multiplier_offset_index;
        int current_index;
        int i, j;

        /* need for an carry-ripple-adder for each of the bits of port B. */
        /* good question of which is better to put on the bottom of multiplier.  Larger means more smaller adds, or small is 
         * less large adds */
        oassert(node->num_output_pins > 0);
        oassert(node->num_input_pins > 0);
        oassert(node->num_input_port_sizes == 2);
        oassert(node->num_output_port_sizes == 1);
        width_a = node->input_port_sizes[0];
        width_b = node->input_port_sizes[1];
        width = node->output_port_sizes[0];
        multiplicand_width = width_b;
        multiplier_width = width_a;
        /* offset is related to which multport is chosen as the multiplicand */
        multiplicand_offset_index = width_a;
        multiplier_offset_index = 0;

        adders_for_partial_products = (nnode_t**)malloc(sizeof(nnode_t*)*multiplicand_width-1);

        /* need to generate partial products for each bit in width B. */
        partial_products = (nnode_t***)malloc(sizeof(nnode_t**)*multiplicand_width);

        /* generate the AND partial products */
        for (i = 0; i < multiplicand_width; i++)
        {
                /* create the memory for each AND gate needed for the levels of partial products */
                partial_products[i] = (nnode_t**)malloc(sizeof(nnode_t*)*multiplier_width);
                
                if (i < multiplicand_width - 1)
                {
                        adders_for_partial_products[i] = make_2port_gate(ADD, multiplier_width+1, multiplier_width+1, multiplier_width+1, node, mark);
                }

                for (j = 0; j < multiplier_width; j++)
                {
                        /* create each one of the partial products */
                        partial_products[i][j] = make_1port_logic_gate(LOGICAL_AND, 2, node, mark);
                }
        }

        /* generate the coneections to the AND gates */
        for (i = 0; i < multiplicand_width; i++)
        {
                for (j = 0; j < multiplier_width; j++)
                {
                        /* hookup the input of B to each AND gate */
                        if (j == 0)
                        {
                                /* IF - this is the first time we are mapping multiplicand port then can remap */ 
                                remap_pin_to_new_node(node->input_pins[i+multiplicand_offset_index], partial_products[i][j], 0);
                        }
                        else
                        {
                                /* ELSE - this needs to be a new ouput of the multiplicand port */
                                add_a_input_pin_to_node_spot_idx(partial_products[i][j], copy_input_npin(partial_products[i][0]->input_pins[0]), 0);
                        }

                        /* hookup the input of the multiplier to each AND gate */
                        if (i == 0)
                        {
                                /* IF - this is the first time we are mapping multiplier port then can remap */ 
                                remap_pin_to_new_node(node->input_pins[j+multiplier_offset_index], partial_products[i][j], 1);
                        }
                        else
                        {
                                /* ELSE - this needs to be a new ouput of the multiplier port */
                                add_a_input_pin_to_node_spot_idx(partial_products[i][j], copy_input_npin(partial_products[0][j]->input_pins[1]), 1);
                        }
                }
        }

        /* hookup each of the adders */
        for (i = 0; i < multiplicand_width-1; i++) // -1 since the first stage is a combo of partial products while all others are part of tree
        {
                for (j = 0; j < multiplier_width+1; j++) // +1 since adders are one greater than multwidth to pass carry
                {
                        /* join to port 1 of the add one of the partial products.  */
                        if (i == 0)
                        {
                                /* IF - this is the first addition row, then adding two sets of partial products and first set is from the c0* */
                                if (j < multiplier_width-1)
                                {
                                        /* IF - we just take an element of the first list c[0][j+1]. */
                                        connect_nodes(partial_products[i][j+1], 0, adders_for_partial_products[i], j);
                                }
                                else
                                {
                                        /* ELSE - this is the last input to the first adder, then we pass in 0 since no carry yet */
                                        add_a_input_pin_to_node_spot_idx(adders_for_partial_products[i], get_a_zero_pin(netlist), j);
                                }
                        }
                        else if (j < multiplier_width)
                        {
                                /* ELSE - this is the standard situation when we need to hookup this adder with a previous adder, r[i-1][j+1] */
                                connect_nodes(adders_for_partial_products[i-1], j+1, adders_for_partial_products[i], j);
                        }
                        else
                        {
                                add_a_input_pin_to_node_spot_idx(adders_for_partial_products[i], get_a_zero_pin(netlist), j);
                        }
                        
                        if (j < multiplier_width)
                        {
                                /* IF - this is not most significant bit then just add current partial product */
                                connect_nodes(partial_products[i+1][j], 0, adders_for_partial_products[i], j+multiplier_width+1);
                        }
                        else
                        {
                                add_a_input_pin_to_node_spot_idx(adders_for_partial_products[i], get_a_zero_pin(netlist), j+multiplier_width+1);
                        }
                }
        }

        current_index = 0;
        /* hookup the outputs */
        for (i = 0; i < width; i++)
        {
                if (multiplicand_width == 1)
                {
                        oassert(FALSE); // this is undealt with
                }
                else if (i == 0)
                {
                        /* IF - this is the LSbit, then we use a pass through from the partial product */
                        remap_pin_to_new_node(node->output_pins[i], partial_products[0][0], 0);
                }
                else if (i < multiplicand_width - 1)
                {
                        /* ELSE IF - these are the middle values that come from the LSbit of partial adders */
                        remap_pin_to_new_node(node->output_pins[i], adders_for_partial_products[i-1], 0);
                }
                else 
                {
                        /* ELSE - the final outputs are straight from the outputs of the last adder */
                        remap_pin_to_new_node(node->output_pins[i], adders_for_partial_products[multiplicand_width-2], current_index);
                        current_index++;
                }
        }

        /* soft map the adders if they need to be mapped */
        for (i = 0; i < multiplicand_width - 1; i++)
        {
                instantiate_add_w_carry(adders_for_partial_products[i], mark, netlist);
        }

        /* Cleanup everything */
        if (adders_for_partial_products != NULL)
        {
                free(adders_for_partial_products);
        }
        /* generate the AND partial products */
        for (i = 0; i < multiplicand_width; i++)
        {
                /* create the memory for each AND gate needed for the levels of partial products */
                if (partial_products[i] != NULL)
                {
                        free(partial_products[i]);
                }
        }
        if (partial_products != NULL)
        {
                free(partial_products);
        }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void iterate_multipliers

(

netlist_t *

netlist

)

Here is the caller graph for this function:

void report_mult_distribution

(

)

Here is the caller graph for this function:

void split_multiplier	(	nnode_t *	node,
		int	a0,
		int	b0,
		int	a1,
		int	b1
	)

---

Variable Documentation

t_model* hard_multipliers

Definition at line 36 of file multipliers.c.

int min_mult

Definition at line 38 of file multipliers.c.

struct s_linked_vptr* mult_list

Definition at line 37 of file multipliers.c.