Lines Matching refs:len
131 allocate_phi_node (int len)
136 + (len - 1) * sizeof (struct phi_arg_d));
139 for (bucket = len - 2; bucket < NUM_BUCKETS - 2; bucket++)
145 && PHI_ARG_CAPACITY (free_phinodes[bucket]) >= len)
178 ideal_phi_node_len (int len)
184 if (len < 2)
185 len = 2;
188 size = sizeof (struct tree_phi_node) + (len - 1) * sizeof (struct phi_arg_d);
196 new_len = len + (new_size - size) / sizeof (struct phi_arg_d);
204 make_phi_node (tree var, int len)
209 capacity = ideal_phi_node_len (len);
217 + sizeof (struct phi_arg_d) * len));
219 PHI_NUM_ARGS (phi) = len;
245 int len = PHI_ARG_CAPACITY (phi);
255 bucket = len > NUM_BUCKETS - 1 ? NUM_BUCKETS - 1 : len;
266 resize_phi_node (tree *phi, int len)
271 gcc_assert (len > PHI_ARG_CAPACITY (*phi));
279 new_phi = allocate_phi_node (len);
292 PHI_ARG_CAPACITY (new_phi) = len;
294 for (i = PHI_NUM_ARGS (new_phi); i < len; i++)
314 int len = EDGE_COUNT (bb->preds);
315 int cap = ideal_phi_node_len (len + 4);
321 if (len > PHI_ARG_CAPACITY (*loc))
340 SET_PHI_ARG_DEF (*loc, len - 1, NULL_TREE);