Lines Matching defs:num_gates
187 int num_gates = (int) (log(F) / log(fopt));
189 // check if num_gates is odd. if so, add 1 to make it even
190 num_gates += (num_gates % 2) ? 1 : 0;
191 num_gates = MAX(num_gates, num_gates_min);
194 double f = pow(F, 1.0 / num_gates);
195 int i = num_gates - 1;
204 num_gates = (int) (log(F) / log(fopt)) + 1;
205 num_gates += (num_gates % 2) ? 1 : 0;
206 num_gates = MAX(num_gates, num_gates_min);
207 f = pow(F, 1.0 / (num_gates - 1));
208 i = num_gates - 1;
213 for (i = num_gates - 2; i >= 1; i--) {
218 assert(num_gates <= MAX_NUMBER_GATES_STAGE);
219 return num_gates;