Lines Matching refs:newtree
210 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in performance_shuffle() argument
217 partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups); in performance_shuffle()
229 if (DECL_BIT_FIELD_TYPE(newtree[i])) in performance_shuffle()
233 if (DECL_BIT_FIELD_TYPE(newtree[randnum])) in performance_shuffle()
235 tmp = newtree[i]; in performance_shuffle()
236 newtree[i] = newtree[randnum]; in performance_shuffle()
237 newtree[randnum] = tmp; in performance_shuffle()
242 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in full_shuffle() argument
249 tmp = newtree[i]; in full_shuffle()
250 newtree[i] = newtree[randnum]; in full_shuffle()
251 newtree[randnum] = tmp; in full_shuffle()
256 static void shuffle(const_tree type, tree *newtree, unsigned long length) in shuffle() argument
285 performance_shuffle(newtree, length, &prng_state); in shuffle()
287 full_shuffle(newtree, length, &prng_state); in shuffle()
325 tree newtree[num_fields]; in relayout_struct() local
360 newtree[i] = field; in relayout_struct()
368 if (is_flexible_array(newtree[num_fields - 1])) { in relayout_struct()
373 shuffle(type, (tree *)newtree, shuffle_length); in relayout_struct()
380 TREE_CHAIN(list) = newtree[0]; in relayout_struct()
392 TREE_CHAIN(newtree[i]) = newtree[i+1]; in relayout_struct()
393 TREE_CHAIN(newtree[num_fields - 1]) = NULL_TREE; in relayout_struct()