Lines Matching refs:newtree
191 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in performance_shuffle() argument
198 partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups); in performance_shuffle()
214 if (DECL_BIT_FIELD_TYPE(newtree[i])) in performance_shuffle()
219 if (DECL_BIT_FIELD_TYPE(newtree[randnum])) in performance_shuffle()
221 tmp = newtree[i]; in performance_shuffle()
222 newtree[i] = newtree[randnum]; in performance_shuffle()
223 newtree[randnum] = tmp; in performance_shuffle()
228 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in full_shuffle() argument
235 tmp = newtree[i]; in full_shuffle()
236 newtree[i] = newtree[randnum]; in full_shuffle()
237 newtree[randnum] = tmp; in full_shuffle()
242 static void shuffle(const_tree type, tree *newtree, unsigned long length) in shuffle() argument
271 performance_shuffle(newtree, length, &prng_state); in shuffle()
273 full_shuffle(newtree, length, &prng_state); in shuffle()
301 tree newtree[num_fields]; in relayout_struct() local
336 newtree[i] = field; in relayout_struct()
343 if (is_flexible_array(newtree[num_fields - 1])) { in relayout_struct()
348 shuffle(type, (tree *)newtree, shuffle_length); in relayout_struct()
351 TREE_CHAIN(newtree[i]) = newtree[i+1]; in relayout_struct()
352 TREE_CHAIN(newtree[num_fields - 1]) = NULL_TREE; in relayout_struct()
361 TYPE_FIELDS(variant) = newtree[0]; in relayout_struct()