Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 534) sorted by relevance

12345678910>>...22

/net/sctp/
Dstream.c41 int i; in sctp_stream_init() local
58 for (i = 0; i < stream->outcnt; i++) in sctp_stream_init()
59 stream->out[i].state = SCTP_STREAM_OPEN; in sctp_stream_init()
85 int i; in sctp_stream_clear() local
87 for (i = 0; i < stream->outcnt; i++) in sctp_stream_clear()
88 stream->out[i].ssn = 0; in sctp_stream_clear()
90 for (i = 0; i < stream->incnt; i++) in sctp_stream_clear()
91 stream->in[i].ssn = 0; in sctp_stream_clear()
124 __u16 i, str_nums, *str_list; in sctp_send_reset_streams() local
149 for (i = 0; i < str_nums; i++) in sctp_send_reset_streams()
[all …]
/net/mac80211/
Drate.c312 u8 i; in rc_send_low_basicrate() local
321 for (i = *idx + 1; i <= sband->n_bitrates; i++) { in rc_send_low_basicrate()
322 if (basic_rates & (1 << i)) { in rc_send_low_basicrate()
323 *idx = i; in rc_send_low_basicrate()
337 int i; in __rate_control_send_low() local
346 for (i = 0; i < sband->n_bitrates; i++) { in __rate_control_send_low()
347 if (!(rate_mask & BIT(i))) in __rate_control_send_low()
350 if ((rate_flags & sband->bitrates[i].flags) != rate_flags) in __rate_control_send_low()
353 if (!rate_supported(sta, sband->band, i)) in __rate_control_send_low()
356 info->control.rates[0].idx = i; in __rate_control_send_low()
[all …]
Dethtool.c75 int i, q; in ieee80211_get_stats() local
82 data[i++] += sta->rx_stats.packets; \ in ieee80211_get_stats()
83 data[i++] += sta->rx_stats.bytes; \ in ieee80211_get_stats()
84 data[i++] += sta->rx_stats.num_duplicates; \ in ieee80211_get_stats()
85 data[i++] += sta->rx_stats.fragments; \ in ieee80211_get_stats()
86 data[i++] += sta->rx_stats.dropped; \ in ieee80211_get_stats()
88 data[i++] += sinfo.tx_packets; \ in ieee80211_get_stats()
89 data[i++] += sinfo.tx_bytes; \ in ieee80211_get_stats()
90 data[i++] += sta->status_stats.filtered; \ in ieee80211_get_stats()
91 data[i++] += sta->status_stats.retry_failed; \ in ieee80211_get_stats()
[all …]
Drc80211_minstrel.c65 int i = rix; in rix_to_ndx() local
66 for (i = rix; i >= 0; i--) in rix_to_ndx()
67 if (mi->r[i].rix == rix) in rix_to_ndx()
69 return i; in rix_to_ndx()
93 minstrel_sort_best_tp_rates(struct minstrel_sta_info *mi, int i, u8 *tp_list) in minstrel_sort_best_tp_rates() argument
97 struct minstrel_rate_stats *cur_mrs = &mi->r[i].stats; in minstrel_sort_best_tp_rates()
101 if (minstrel_get_tp_avg(&mi->r[i], cur_mrs->prob_ewma) <= in minstrel_sort_best_tp_rates()
109 tp_list[j] = i; in minstrel_sort_best_tp_rates()
128 int i = 0; in minstrel_update_rates() local
135 minstrel_set_rate(mi, ratetbl, i++, mi->max_tp_rate[0]); in minstrel_update_rates()
[all …]
Dvht.c33 int i; in ieee80211_apply_vhtcap_overrides() local
90 for (i = 0; i < 8; i++) { in ieee80211_apply_vhtcap_overrides()
93 m = (rxmcs_mask >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
94 n = (rxmcs_n >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
95 c = (rxmcs_cap >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
99 rxmcs_cap &= ~(3 << 2*i); in ieee80211_apply_vhtcap_overrides()
100 rxmcs_cap |= (rxmcs_n & (3 << 2*i)); in ieee80211_apply_vhtcap_overrides()
103 m = (txmcs_mask >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
104 n = (txmcs_n >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
105 c = (txmcs_cap >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
[all …]
/net/ceph/
Dpagevec.c48 int i; in ceph_put_page_vector() local
50 for (i = 0; i < num_pages; i++) { in ceph_put_page_vector()
52 set_page_dirty_lock(pages[i]); in ceph_put_page_vector()
53 put_page(pages[i]); in ceph_put_page_vector()
61 int i; in ceph_release_page_vector() local
63 for (i = 0; i < num_pages; i++) in ceph_release_page_vector()
64 __free_pages(pages[i], 0); in ceph_release_page_vector()
75 int i; in ceph_alloc_page_vector() local
80 for (i = 0; i < num_pages; i++) { in ceph_alloc_page_vector()
81 pages[i] = __page_cache_alloc(flags); in ceph_alloc_page_vector()
[all …]
Ddebugfs.c36 int i; in monmap_show() local
43 for (i = 0; i < client->monc.monmap->num_mon; i++) { in monmap_show()
45 &client->monc.monmap->mon_inst[i]; in monmap_show()
56 int i; in osdmap_show() local
79 for (i = 0; i < map->max_osd; i++) { in osdmap_show()
80 struct ceph_entity_addr *addr = &map->osd_addr[i]; in osdmap_show()
81 u32 state = map->osd_state[i]; in osdmap_show()
85 i, ceph_pr_addr(&addr->in_addr), in osdmap_show()
86 ((map->osd_weight[i]*100) >> 16), in osdmap_show()
88 ((ceph_get_primary_affinity(map, i)*100) >> 16)); in osdmap_show()
[all …]
/net/ipv4/
Dproc.c327 int i, count; in icmpmsg_put() local
333 for (i = 0; i < ICMPMSG_MIB_MAX; i++) { in icmpmsg_put()
334 val = atomic_long_read(&net->mib.icmpmsg_statistics->mibs[i]); in icmpmsg_put()
336 type[count] = i; in icmpmsg_put()
351 int i; in icmp_put() local
356 for (i = 0; icmpmibmap[i].name; i++) in icmp_put()
357 seq_printf(seq, " In%s", icmpmibmap[i].name); in icmp_put()
359 for (i = 0; icmpmibmap[i].name; i++) in icmp_put()
360 seq_printf(seq, " Out%s", icmpmibmap[i].name); in icmp_put()
365 for (i = 0; icmpmibmap[i].name; i++) in icmp_put()
[all …]
/net/netfilter/
Dnf_conntrack_ftp.c126 u_int32_t i, len; in try_number() local
131 for (i = 0, len = 0; len < dlen && i < array_size; len++, data++) { in try_number()
133 array[i] = array[i]*10 + *data - '0'; in try_number()
136 i++; in try_number()
141 if ((*data == term || !term) && i == array_size - 1) in try_number()
145 len, i, *data); in try_number()
186 int i; in try_rfc1123() local
187 for (i = 0; i < dlen; i++) in try_rfc1123()
188 if (isdigit(data[i])) in try_rfc1123()
191 if (i == dlen) in try_rfc1123()
[all …]
Dcore.c104 unsigned int i, alloc_entries, nhooks, old_entries; in nf_hook_entries_grow() local
116 for (i = 0; i < old_entries; i++) { in nf_hook_entries_grow()
117 if (orig_ops[i] != &dummy_ops) in nf_hook_entries_grow()
131 i = 0; in nf_hook_entries_grow()
133 while (i < old_entries) { in nf_hook_entries_grow()
134 if (orig_ops[i] == &dummy_ops) { in nf_hook_entries_grow()
135 ++i; in nf_hook_entries_grow()
138 if (inserted || reg->priority > orig_ops[i]->priority) { in nf_hook_entries_grow()
139 new_ops[nhooks] = (void *)orig_ops[i]; in nf_hook_entries_grow()
140 new->hooks[nhooks] = old->hooks[i]; in nf_hook_entries_grow()
[all …]
Dnft_byteorder.c37 unsigned int i; in nft_byteorder_eval() local
48 for (i = 0; i < priv->len / 8; i++) { in nft_byteorder_eval()
49 src64 = get_unaligned((u64 *)&src[i]); in nft_byteorder_eval()
50 put_unaligned_be64(src64, &dst[i]); in nft_byteorder_eval()
54 for (i = 0; i < priv->len / 8; i++) { in nft_byteorder_eval()
55 src64 = get_unaligned_be64(&src[i]); in nft_byteorder_eval()
56 put_unaligned(src64, (u64 *)&dst[i]); in nft_byteorder_eval()
65 for (i = 0; i < priv->len / 4; i++) in nft_byteorder_eval()
66 d[i].u32 = ntohl((__force __be32)s[i].u32); in nft_byteorder_eval()
69 for (i = 0; i < priv->len / 4; i++) in nft_byteorder_eval()
[all …]
Dnf_log.c30 int i; in __find_logger() local
32 for (i = 0; i < NF_LOG_TYPE_MAX; i++) { in __find_logger()
33 if (loggers[pf][i] == NULL) in __find_logger()
36 log = nft_log_dereference(loggers[pf][i]); in __find_logger()
64 int i; in nf_log_unset() local
68 for (i = 0; i < NFPROTO_NUMPROTO; i++) { in nf_log_unset()
69 log = nft_log_dereference(net->nf.nf_loggers[i]); in nf_log_unset()
71 RCU_INIT_POINTER(net->nf.nf_loggers[i], NULL); in nf_log_unset()
80 int i; in nf_log_register() local
89 for (i = NFPROTO_UNSPEC; i < NFPROTO_NUMPROTO; i++) { in nf_log_register()
[all …]
Dnf_conntrack_proto.c197 static int kill_l3proto(struct nf_conn *i, void *data) in kill_l3proto() argument
199 return nf_ct_l3num(i) == ((const struct nf_conntrack_l3proto *)data)->l3proto; in kill_l3proto()
202 static int kill_l4proto(struct nf_conn *i, void *data) in kill_l4proto() argument
206 return nf_ct_protonum(i) == l4proto->l4proto && in kill_l4proto()
207 nf_ct_l3num(i) == l4proto->l3proto; in kill_l4proto()
323 int i; in nf_ct_l4proto_register_one() local
333 for (i = 0; i < MAX_NF_CT_PROTO; i++) in nf_ct_l4proto_register_one()
334 RCU_INIT_POINTER(proto_array[i], in nf_ct_l4proto_register_one()
431 unsigned int i; in nf_ct_l4proto_register() local
433 for (i = 0; i < num_proto; i++) { in nf_ct_l4proto_register()
[all …]
/net/sunrpc/auth_gss/
Dgss_mech_switch.c60 int i; in gss_mech_free() local
62 for (i = 0; i < gm->gm_pf_num; i++) { in gss_mech_free()
63 pf = &gm->gm_pfs[i]; in gss_mech_free()
87 int i, status; in gss_mech_svc_setup() local
89 for (i = 0; i < gm->gm_pf_num; i++) { in gss_mech_svc_setup()
90 pf = &gm->gm_pfs[i]; in gss_mech_svc_setup()
206 int i; in mech_supports_pseudoflavor() local
208 for (i = 0; i < gm->gm_pf_num; i++) { in mech_supports_pseudoflavor()
209 if (gm->gm_pfs[i].pseudoflavor == pseudoflavor) in mech_supports_pseudoflavor()
258 int j, i = 0; in gss_mech_list_pseudoflavors() local
[all …]
Dgss_krb5_keys.c77 int byte, i, msbit; in krb5_nfold() local
95 for (i = ulcm-1; i >= 0; i--) { in krb5_nfold()
103 + (((inbits << 3) + 13) * (i/inbits)) in krb5_nfold()
106 + ((inbits - (i % inbits)) << 3) in krb5_nfold()
115 byte += out[i % outbits]; in krb5_nfold()
116 out[i % outbits] = byte & 0xff; in krb5_nfold()
125 for (i = outbits - 1; i >= 0; i--) { in krb5_nfold()
127 byte += out[i]; in krb5_nfold()
128 out[i] = byte & 0xff; in krb5_nfold()
252 int i; in mit_des_fixup_key_parity() local
[all …]
/net/sched/
Dsch_mqprio.c52 int i, j; in mqprio_parse_opt() local
59 for (i = 0; i < TC_BITMASK + 1; i++) { in mqprio_parse_opt()
60 if (qopt->prio_tc_map[i] >= qopt->num_tc) in mqprio_parse_opt()
79 for (i = 0; i < qopt->num_tc; i++) { in mqprio_parse_opt()
80 unsigned int last = qopt->offset[i] + qopt->count[i]; in mqprio_parse_opt()
85 if (qopt->offset[i] >= dev->real_num_tx_queues || in mqprio_parse_opt()
86 !qopt->count[i] || in mqprio_parse_opt()
91 for (j = i + 1; j < qopt->num_tc; j++) { in mqprio_parse_opt()
106 int i, err = -EOPNOTSUPP; in mqprio_init() local
131 for (i = 0; i < dev->num_tx_queues; i++) { in mqprio_init()
[all …]
Dsch_hhf.c253 int i; in hhf_classify() local
260 for (i = 0; i < HHF_ARRAYS_CNT; i++) in hhf_classify()
261 bitmap_zero(q->hhf_valid_bits[i], HHF_ARRAYS_LEN); in hhf_classify()
279 for (i = 0; i < HHF_ARRAYS_CNT - 1; i++) { in hhf_classify()
281 filter_pos[i] = tmp_hash & HHF_BIT_MASK; in hhf_classify()
282 xorsum ^= filter_pos[i]; in hhf_classify()
290 for (i = 0; i < HHF_ARRAYS_CNT; i++) { in hhf_classify()
293 if (!test_bit(filter_pos[i], q->hhf_valid_bits[i])) { in hhf_classify()
294 q->hhf_arrays[i][filter_pos[i]] = 0; in hhf_classify()
295 __set_bit(filter_pos[i], q->hhf_valid_bits[i]); in hhf_classify()
[all …]
Dem_canid.c59 int i; in em_canid_sff_match_add() local
85 for (i = 0; i < (1 << CAN_SFF_ID_BITS); i++) { in em_canid_sff_match_add()
86 if ((i & can_mask) == can_id) in em_canid_sff_match_add()
87 set_bit(i, cm->match_sff); in em_canid_sff_match_add()
102 int i; in em_canid_match() local
108 for (i = 0, lp = cm->rules_raw; in em_canid_match()
109 i < cm->eff_rules_count; i++, lp++) { in em_canid_match()
128 int i; in em_canid_change() local
156 for (i = 0; i < cm->rules_count; i++) { in em_canid_change()
157 if (conf[i].can_id & CAN_EFF_FLAG) { in em_canid_change()
[all …]
/net/ceph/crush/
Dmapper.c44 __u32 i; in crush_find_rule() local
46 for (i = 0; i < map->max_rules; i++) { in crush_find_rule()
47 if (map->rules[i] && in crush_find_rule()
48 map->rules[i]->mask.ruleset == ruleset && in crush_find_rule()
49 map->rules[i]->mask.type == type && in crush_find_rule()
50 map->rules[i]->mask.min_size <= size && in crush_find_rule()
51 map->rules[i]->mask.max_size >= size) in crush_find_rule()
52 return i; in crush_find_rule()
79 unsigned int i, s; in bucket_perm_choose() local
95 for (i = 0; i < bucket->size; i++) in bucket_perm_choose()
[all …]
/net/bridge/netfilter/
Debtables.c106 int i = 0; in ebt_dev_check() local
115 while (entry[i] != '\0' && entry[i] != 1 && entry[i] == devname[i]) in ebt_dev_check()
116 i++; in ebt_dev_check()
117 return devname[i] != entry[i] && entry[i] != 1; in ebt_dev_check()
182 int i, nentries; in ebt_do_table() local
210 i = 0; in ebt_do_table()
211 while (i < nentries) { in ebt_do_table()
223 (*(counter_base + i)).pcnt++; in ebt_do_table()
224 (*(counter_base + i)).bcnt += skb->len; in ebt_do_table()
258 i = cs[sp].n; in ebt_do_table()
[all …]
/net/smc/
Dsmc_wr.c55 u32 i; in smc_wr_tx_find_pending_index() local
57 for (i = 0; i < link->wr_tx_cnt; i++) { in smc_wr_tx_find_pending_index()
58 if (link->wr_tx_pends[i].wr_id == wr_id) in smc_wr_tx_find_pending_index()
59 return i; in smc_wr_tx_find_pending_index()
69 int i; in smc_wr_tx_process_cqe() local
97 for_each_set_bit(i, link->wr_tx_mask, link->wr_tx_cnt) { in smc_wr_tx_process_cqe()
99 memset(&link->wr_tx_pends[i], 0, in smc_wr_tx_process_cqe()
100 sizeof(link->wr_tx_pends[i])); in smc_wr_tx_process_cqe()
101 memset(&link->wr_tx_bufs[i], 0, in smc_wr_tx_process_cqe()
102 sizeof(link->wr_tx_bufs[i])); in smc_wr_tx_process_cqe()
[all …]
/net/xfrm/
Dxfrm_algo.c650 int i, status; in xfrm_find_algo() local
652 for (i = 0; i < algo_list->entries; i++) { in xfrm_find_algo()
653 if (!match(list + i, data)) in xfrm_find_algo()
656 if (list[i].available) in xfrm_find_algo()
657 return &list[i]; in xfrm_find_algo()
662 status = crypto_has_alg(list[i].name, algo_list->type, in xfrm_find_algo()
667 list[i].available = status; in xfrm_find_algo()
668 return &list[i]; in xfrm_find_algo()
782 int i, status; in xfrm_probe_algs() local
786 for (i = 0; i < aalg_entries(); i++) { in xfrm_probe_algs()
[all …]
/net/dsa/
Dlegacy.c104 int i, ret; in dsa_switch_setup_one() local
109 for (i = 0; i < ds->num_ports; i++) { in dsa_switch_setup_one()
112 name = cd->port_names[i]; in dsa_switch_setup_one()
122 dst->cpu_dp = &ds->ports[i]; in dsa_switch_setup_one()
124 ds->cpu_port_mask |= 1 << i; in dsa_switch_setup_one()
126 ds->dsa_port_mask |= 1 << i; in dsa_switch_setup_one()
128 ds->enabled_port_mask |= 1 << i; in dsa_switch_setup_one()
133 if (!valid_name_found && i == ds->num_ports) in dsa_switch_setup_one()
190 for (i = 0; i < ds->num_ports; i++) { in dsa_switch_setup_one()
191 ds->ports[i].dn = cd->port_dn[i]; in dsa_switch_setup_one()
[all …]
/net/wireless/
Dwext-spy.c53 int i; in iw_handler_set_spy() local
56 for (i = 0; i < wrqu->data.length; i++) in iw_handler_set_spy()
57 memcpy(spydata->spy_address[i], address[i].sa_data, in iw_handler_set_spy()
81 int i; in iw_handler_get_spy() local
90 for (i = 0; i < spydata->spy_number; i++) { in iw_handler_get_spy()
91 memcpy(address[i].sa_data, spydata->spy_address[i], ETH_ALEN); in iw_handler_get_spy()
92 address[i].sa_family = AF_UNIX; in iw_handler_get_spy()
100 for (i = 0; i < spydata->spy_number; i++) in iw_handler_get_spy()
101 spydata->spy_stat[i].updated &= ~IW_QUAL_ALL_UPDATED; in iw_handler_get_spy()
197 int i; in wireless_spy_update() local
[all …]
/net/netfilter/ipset/
Dip_set_hash_gen.h87 #define hbucket(h, i) ((h)->bucket[i]) argument
134 #define __CIDR(cidr, i) (cidr[i]) argument
136 #define __CIDR(cidr, i) (cidr) argument
146 #define DCIDR_GET(cidr, i) (__CIDR(cidr, i) + 1) argument
149 #define DCIDR_GET(cidr, i) __CIDR(cidr, i) argument
307 int i, j; in mtype_add_cidr() local
310 for (i = 0, j = -1; i < NLEN && h->nets[i].cidr[n]; i++) { in mtype_add_cidr()
313 } else if (h->nets[i].cidr[n] < cidr) { in mtype_add_cidr()
314 j = i; in mtype_add_cidr()
315 } else if (h->nets[i].cidr[n] == cidr) { in mtype_add_cidr()
[all …]

12345678910>>...22