aboutsummaryrefslogtreecommitdiffstats
path: root/techlibs/common/abc9_model.v
blob: 4fee60f752a9ab8aa196d7b0ce8c9a17f9eaaac4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
(* abc9_box *)
module $__ABC9_DELAY (input I, output O);
  parameter DELAY = 0;
  specify
    (I => O) = DELAY;
  endspecify
endmodule

(* abc9_flop, abc9_box, lib_whitebox *)
module $__DFF_N__$abc9_flop (input C, D, Q, output n1);
  assign n1 = D;
  specify
    $setup(D, posedge C, 0);
    (posedge C => (n1:D)) = 0;
  endspecify
endmodule

(* abc9_flop, abc9_box, lib_whitebox *)
module $__DFF_P__$abc9_flop (input C, D, Q, output n1);
  assign n1 = D;
  specify
    $setup(D, posedge C, 0);
    (posedge C => (n1:D)) = 0;
  endspecify
endmodule
">--- a/sis/pld/act_bdd.c +++ b/sis/pld/act_bdd.c @@ -141,6 +141,8 @@ char *name; return p_vertex; } +static int compare(); + /* Or 2 ACT's*/ act_t * my_or_act_F(array_b,cover, array) @@ -148,7 +150,6 @@ array_t *array_b; array_t *array; sm_row *cover; { - static int compare(); int i; act_t *up_vertex, *down_vertex, *vertex; sm_element *p; diff --git a/sis/pld/act_ite.c b/sis/pld/act_ite.c index a35f2fb..7b824df 100644 --- a/sis/pld/act_ite.c +++ b/sis/pld/act_ite.c @@ -125,6 +125,8 @@ node_t *fanin; and the minimum column cover variables in cover, generates an ite for the original function. */ +static int compare(); + ite_vertex * my_or_ite_F(array_b, cover, array, network) array_t *array_b; @@ -132,7 +134,6 @@ array_t *array; sm_row *cover; network_t *network; { - static int compare(); int i; ite_vertex *vertex; sm_element *p; diff --git a/sis/pld/xln_merge.c b/sis/pld/xln_merge.c index 075e6c5..16f4d61 100644 --- a/sis/pld/xln_merge.c +++ b/sis/pld/xln_merge.c @@ -284,6 +284,7 @@ array_t *match1_array, *match2_array; } +static sm_row *xln_merge_find_neighbor_of_row1_with_minimum_neighbors(); /*---------------------------------------------------------------------------------------------------- An alternate to lindo option. Uses greedy merging. A node with minimum mergeable nodes is picked @@ -296,7 +297,6 @@ xln_merge_nodes_without_lindo(coeff, cand_node_array, match1_array, match2_array { node_t *n1, *n2; sm_row *row1, *row2; - static sm_row *xln_merge_find_neighbor_of_row1_with_minimum_neighbors(); while (TRUE) { row1 = sm_shortest_row(coeff); diff --git a/sis/pld/xln_part_dec.c b/sis/pld/xln_part_dec.c index 1c856bd..b78828a 100644 --- a/sis/pld/xln_part_dec.c +++ b/sis/pld/xln_part_dec.c @@ -49,13 +49,14 @@ int size; +static int kernel_value(); + int split_node(network, node, size) network_t *network; node_t *node; int size; { - static int kernel_value(); int i, value = 1; kern_node *sorted; divisor_t *div, *best_div; diff --git a/xsis/Makefile.am b/xsis/Makefile.am index 196d98b..686fdf4 100644 --- a/xsis/Makefile.am +++ b/xsis/Makefile.am @@ -1,8 +1,8 @@ xsis_SOURCES_local = NetPlot.c NetPlot.h NetPlotP.h main.c xastg.c \ xblif.c xcmd.c xhelp.c xsis.c xsis.h xutil.c \ blif50.px ghost.px help50.px sis50.px -AM_CPPFLAGS = -I../sis/include -I@SIS_X_INCLUDES@ -AM_LDFLAGS = -L@SIS_X_LIBRARIES@ +AM_CPPFLAGS = -I../sis/include +AM_LDFLAGS = LDADD = ../sis/libsis.a -lXaw -lXmu -lXt -lXext -lX11 -lm if SIS_COND_X