Lines Matching refs:newtree
188 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in performance_shuffle() argument
195 partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups); in performance_shuffle()
211 if (DECL_BIT_FIELD_TYPE(newtree[i])) in performance_shuffle()
216 if (DECL_BIT_FIELD_TYPE(newtree[randnum])) in performance_shuffle()
218 tmp = newtree[i]; in performance_shuffle()
219 newtree[i] = newtree[randnum]; in performance_shuffle()
220 newtree[randnum] = tmp; in performance_shuffle()
225 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in full_shuffle() argument
232 tmp = newtree[i]; in full_shuffle()
233 newtree[i] = newtree[randnum]; in full_shuffle()
234 newtree[randnum] = tmp; in full_shuffle()
239 static void shuffle(const_tree type, tree *newtree, unsigned long length) in shuffle() argument
268 performance_shuffle(newtree, length, &prng_state); in shuffle()
270 full_shuffle(newtree, length, &prng_state); in shuffle()
298 tree newtree[num_fields]; in relayout_struct() local
333 newtree[i] = field; in relayout_struct()
340 if (is_flexible_array(newtree[num_fields - 1])) { in relayout_struct()
345 shuffle(type, (tree *)newtree, shuffle_length); in relayout_struct()
352 TREE_CHAIN(list) = newtree[0]; in relayout_struct()
364 TREE_CHAIN(newtree[i]) = newtree[i+1]; in relayout_struct()
365 TREE_CHAIN(newtree[num_fields - 1]) = NULL_TREE; in relayout_struct()