cmpterms.v

openaccess与verilog互相转化时所用的源代码

// This test produces a database with a variety of terminals and instTerms
// to test the comparision operator on terms and instTerms.  The terms and
// instTerms are broken into two groups: low and high. Elements in the low
// group should always appear before elements in the high group. The low
// group elements must be alphabetically less than the group elements of the 
// high group and their positions must be set such that the high group 
// elements come after the low group elements in the module port list.

module leaf(a, b, c, d, e, f, g, .h({i,j}),
	    z, y, x, w, v, u, t, .s({r,q}));
    inout	    a;
    inout   [0:1]   b;
    inout   [2:0]   c;
    inout   [0:1]   d;
    inout   [0:0]   e;
    inout   [0:0]   f;
    inout   [0:0]   g;
    inout	    i;
    inout	    j;
    
    inout	    z;
    inout   [0:1]   y;
    inout   [2:0]   x;
    inout   [0:1]   w;
    inout   [0:0]   v;
    inout   [0:0]   u;
    inout   [0:0]   t;
    inout	    r;
    inout	    q;
endmodule


module top(a,b[0:1],c[2:0],d[0:1],e[0],f[0],g[0],{i,j},
	   z,y[0:1],x[2:0],w[0:1],v[0],u[0],t[0],{r,q});
	    
    inout	    a;
    inout   [0:1]   b;
    inout   [2:0]   c;
    inout   [0:1]   d;
    inout   [0:1]   e;
    inout   [1:0]   f;
    inout   [0:1]   g;
    inout	    i;
    inout	    j;
    
    inout	    z;
    inout   [0:1]   y;
    inout   [2:0]   x;
    inout   [0:1]   w;
    inout   [0:1]   v;
    inout   [1:0]   u;
    inout   [0:1]   t;
    inout	    r;
    inout	    q;

    leaf byPos(A,B[0:1],C[2:0],D[0:1],E[0],F[0],G[0],{I,J},
	       Z,Y[0:1],X[2:0],W[0:1],V[0],U[0],T[0],{S,R});
	   
    leaf byName(.a(A), .b(B), .c(C), .d(D), .e(E), .f(F), .g(G), .h({I,J}),
	        .z(Z), .y(Y), .x(X), .w(W), .v(V), .u(U), .t(T), .s({R,Q}));
endmodule