153 	unsigned long length;  member
156 static void partition_struct(tree *fields, unsigned long length, struct partition_group *size_group…  in partition_struct()  argument
163 	gcc_assert(length < INT_MAX);  in partition_struct()
165 	memset(size_groups, 0, sizeof(struct partition_group) * length);  in partition_struct()
167 	for (i = 0; i < length; i++) {  in partition_struct()
177 			size_groups[group_idx].length = accum_length;  in partition_struct()
184 	    !size_groups[group_idx].length) {  in partition_struct()
185 		size_groups[group_idx].length = accum_length;  in partition_struct()
192 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)  in performance_shuffle()  argument
195 	struct partition_group size_group[length];  in performance_shuffle()
199 	partition_struct(newtree, length, (struct partition_group *)&size_group, &num_groups);  in performance_shuffle()
211 		for (index = size_group[x].length - 1; index > 0; index--) {  in performance_shuffle()
229 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state)  in full_shuffle()  argument
233 	for (i = length - 1; i > 0; i--) {  in full_shuffle()
243 static void shuffle(const_tree type, tree *newtree, unsigned long length)  in shuffle()  argument
250 	if (length == 0)  in shuffle()
272 		performance_shuffle(newtree, length, &prng_state);  in shuffle()
274 		full_shuffle(newtree, length, &prng_state);  in shuffle()