119 	for (i = 0; i < a->reg_classes; i++) {  in p2p_channels_intersect()
121 		for (j = 0; j < b->reg_classes; j++) {  in p2p_channels_intersect()
127 				&res->reg_class[res->reg_classes]);  in p2p_channels_intersect()
128 			if (res->reg_class[res->reg_classes].channels) {  in p2p_channels_intersect()
129 				res->reg_classes++;  in p2p_channels_intersect()
130 				if (res->reg_classes == P2P_MAX_REG_CLASSES)  in p2p_channels_intersect()
167 	for (i = 0; i < res->reg_classes; i++) {  in p2p_channels_union_inplace()
169 		for (j = 0; j < b->reg_classes; j++) {  in p2p_channels_union_inplace()
177 	for (j = 0; j < b->reg_classes; j++) {  in p2p_channels_union_inplace()
180 		for (i = 0; i < res->reg_classes; i++) {  in p2p_channels_union_inplace()
186 		if (i == res->reg_classes) {  in p2p_channels_union_inplace()
187 			if (res->reg_classes == P2P_MAX_REG_CLASSES)  in p2p_channels_union_inplace()
189 			os_memcpy(&res->reg_class[res->reg_classes++],  in p2p_channels_union_inplace()
220 	while (o < chan->reg_classes) {  in p2p_channels_remove_freqs()
237 			chan->reg_classes--;  in p2p_channels_remove_freqs()
239 				   (chan->reg_classes - o) *  in p2p_channels_remove_freqs()
258 	for (i = 0; i < channels->reg_classes; i++) {  in p2p_channels_includes()
275 	for (i = 0; i < channels->reg_classes; i++) {  in p2p_channels_includes_freq()
351 	for (i = 0; i < chan->reg_classes; i++) {  in p2p_channels_dump()
390 		for (i = 0; i < chans->reg_classes; i++) {  in p2p_channel_select()
467 	for (i = 0, idx = 0; i < channels->reg_classes; i++) {  in p2p_channels_to_freqs()
511 	for (i = 0, j = 0; i < src->reg_classes; i++) {  in p2p_copy_channels()
518 	dst->reg_classes = j;  in p2p_copy_channels()
590 	for (i = 0; i < p2p_chan->reg_classes; i++) {  in p2p_pref_channel_filter()
610 		res->reg_classes++;  in p2p_pref_channel_filter()