Lines Matching defs:channels
61 /* channels 1..13 */
70 case 83: /* channels 1..9; 40 MHz */
71 case 84: /* channels 5..13; 40 MHz */
75 case 115: /* channels 36,40,44,48; indoor only */
76 case 118: /* channels 52,56,60,64; dfs */
80 case 124: /* channels 149,153,157,161 */
81 case 125: /* channels 149,153,157,161,165,169 */
85 case 116: /* channels 36,44; 40 MHz; indoor only */
86 case 117: /* channels 40,48; 40 MHz; indoor only */
87 case 119: /* channels 52,60; 40 MHz; dfs */
88 case 120: /* channels 56,64; 40 MHz; dfs */
92 case 126: /* channels 149,157; 40 MHz */
93 case 127: /* channels 153,161; 40 MHz */
101 case 180: /* 60 GHz band, channels 1..4 */
123 *op_class = 81; /* 2.407 GHz, channels 1..13 */
138 *op_class = 115; /* 5 GHz, channels 36..48 */
147 *op_class = 124; /* 5 GHz, channels 149..161 */
156 *op_class = 180; /* 60 GHz, channels 1..4 */
173 for (i = 0; i < a->channels; i++) {
174 for (j = 0; j < b->channels; j++) {
177 res->channel[res->channels] = a->channel[i];
178 res->channels++;
179 if (res->channels == P2P_MAX_REG_CLASS_CHANNELS)
188 * @a: First set of supported channels
189 * @b: Second set of supported channels
190 * @res: Data structure for returning the intersection of support channels
192 * This function can be used to find a common set of supported channels. Both
193 * input channels sets are assumed to use the same country code. If different
214 if (res->reg_class[res->reg_classes].channels) {
229 for (i = 0; i < b_cl->channels; i++) {
230 for (j = 0; j < cl->channels; j++) {
234 if (j == cl->channels) {
235 if (cl->channels == P2P_MAX_REG_CLASS_CHANNELS)
237 cl->channel[cl->channels++] = b_cl->channel[i];
245 * @a: First set of channels
246 * @b: Second set of channels
247 * @res: Data structure for returning the union of channels
300 while (c < op->channels) {
304 op->channels--;
307 op->channels - c);
312 if (op->channels == 0) {
325 * @channels: List of supported channels
330 int p2p_channels_includes(const struct p2p_channels *channels, u8 reg_class,
334 for (i = 0; i < channels->reg_classes; i++) {
335 const struct p2p_reg_class *reg = &channels->reg_class[i];
338 for (j = 0; j < reg->channels; j++) {
347 int p2p_channels_includes_freq(const struct p2p_channels *channels,
351 for (i = 0; i < channels->reg_classes; i++) {
352 const struct p2p_reg_class *reg = &channels->reg_class[i];
353 for (j = 0; j < reg->channels; j++) {
368 return p2p_channels_includes(&p2p->cfg->channels, op_reg_class,
378 return p2p_channels_includes(&p2p->cfg->channels, op_reg_class,
389 return p2p_channels_includes(&p2p->cfg->channels, op_reg_class,
397 const struct p2p_channels *channels)
401 const struct p2p_channels *tmpc = channels ?
402 channels : &p2p->cfg->channels;
435 for (j = 0; j < c->channels; j++) {
450 static u8 p2p_channel_pick_random(const u8 *channels, unsigned int num_channels)
456 return channels[r];
469 if (c->channels == 0)
474 * Pick one of the available channels in the
479 c->channel, c->channels);
497 /* Try to find available social channels from 2.4 GHz */
505 /* Try to find available social channels from 60 GHz */