@@ -32,7 +32,7 @@ def mult_t_base(self, len_a, len_b):
32
32
m_prod , m_done = multipliers .simple_mult (a , b , reset )
33
33
product <<= m_prod
34
34
done <<= m_done
35
- self .assertEquals (len (product ), len_a + len_b )
35
+ self .assertEqual (len (product ), len_a + len_b )
36
36
37
37
xvals = [int (random .uniform (0 , 2 ** len_a - 1 )) for i in range (20 )]
38
38
yvals = [int (random .uniform (0 , 2 ** len_b - 1 )) for i in range (20 )]
@@ -89,7 +89,7 @@ def mult_t_base(self, len_a, len_b, shifts):
89
89
m_prod , m_done = multipliers .complex_mult (a , b , shifts , reset )
90
90
product <<= m_prod
91
91
done <<= m_done
92
- self .assertEquals (len (product ), len_a + len_b )
92
+ self .assertEqual (len (product ), len_a + len_b )
93
93
94
94
xvals = [int (random .uniform (0 , 2 ** len_a - 1 )) for i in range (20 )]
95
95
yvals = [int (random .uniform (0 , 2 ** len_b - 1 )) for i in range (20 )]
@@ -129,7 +129,7 @@ def mult_t_base(self, len_a, len_b, **mult_args):
129
129
product = pyrtl .Output (name = "product" )
130
130
product <<= multipliers .tree_multiplier (a , b , ** mult_args )
131
131
132
- self .assertEquals (len (product ), len_a + len_b )
132
+ self .assertEqual (len (product ), len_a + len_b )
133
133
134
134
# creating the testing values and the correct results
135
135
xvals = [int (random .uniform (0 , 2 ** len_a - 1 )) for i in range (20 )]
@@ -143,7 +143,7 @@ def mult_t_base(self, len_a, len_b, **mult_args):
143
143
sim .step ({a : xvals [cycle ], b : yvals [cycle ]})
144
144
145
145
# Extracting the values and verifying correctness
146
- multiplier_result = sim_trace .trace [product ]
146
+ multiplier_result = sim_trace .trace [product . name ]
147
147
self .assertEqual (multiplier_result , true_result )
148
148
149
149
def test_trivial_case (self ):
@@ -211,7 +211,7 @@ def mult_t_base(self, len_a, len_b, **mult_args):
211
211
product = pyrtl .Output (name = "product" )
212
212
product <<= multipliers .signed_tree_multiplier (a , b , ** mult_args )
213
213
214
- self .assertEquals (len (product ), len_a + len_b )
214
+ self .assertEqual (len (product ), len_a + len_b )
215
215
216
216
# creating the testing values and the correct results
217
217
bound_a = 2 ** (len_a - 1 ) - 1
@@ -231,7 +231,7 @@ def mult_t_base(self, len_a, len_b, **mult_args):
231
231
232
232
# Extracting the values and verifying correctness
233
233
multiplier_result = [libutils .rev_twos_comp_repr (p , len (product ))
234
- for p in sim_trace .trace [product ]]
234
+ for p in sim_trace .trace [product . name ]]
235
235
self .assertEqual (multiplier_result , true_result )
236
236
237
237
def test_small_bitwidth_error (self ):
0 commit comments