192 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)  in performance_shuffle()  argument
199 	partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups);  in performance_shuffle()
215 			if (DECL_BIT_FIELD_TYPE(newtree[i]))  in performance_shuffle()
220 			if (DECL_BIT_FIELD_TYPE(newtree[randnum]))  in performance_shuffle()
222 			tmp = newtree[i];  in performance_shuffle()
223 			newtree[i] = newtree[randnum];  in performance_shuffle()
224 			newtree[randnum] = tmp;  in performance_shuffle()
229 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)  in full_shuffle()  argument
236 		tmp = newtree[i];  in full_shuffle()
237 		newtree[i] = newtree[randnum];  in full_shuffle()
238 		newtree[randnum] = tmp;  in full_shuffle()
243 static void shuffle(const_tree type, tree *newtree, unsigned long length)  in shuffle()  argument
272 		performance_shuffle(newtree, length, &prng_state);  in shuffle()
274 		full_shuffle(newtree, length, &prng_state);  in shuffle()
302 	tree newtree[num_fields];  in relayout_struct()  local
337 		newtree[i] = field;  in relayout_struct()
344 	if (is_flexible_array(newtree[num_fields - 1])) {  in relayout_struct()
349 	shuffle(type, (tree *)newtree, shuffle_length);  in relayout_struct()
356 	TREE_CHAIN(list) = newtree[0];  in relayout_struct()
368 		TREE_CHAIN(newtree[i]) = newtree[i+1];  in relayout_struct()
369 	TREE_CHAIN(newtree[num_fields - 1]) = NULL_TREE;  in relayout_struct()