Home
last modified time | relevance | path

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

12345678910>>...24

/net/tipc/
Dtrace.c55 int i = 0; in tipc_skb_dump() local
61 i += scnprintf(buf, sz, "msg: (null)\n"); in tipc_skb_dump()
62 return i; in tipc_skb_dump()
69 i += scnprintf(buf, sz, "msg: %u", msg_user(hdr)); in tipc_skb_dump()
70 i += scnprintf(buf + i, sz - i, " %u", msg_type(hdr)); in tipc_skb_dump()
71 i += scnprintf(buf + i, sz - i, " %u", msg_hdr_sz(hdr)); in tipc_skb_dump()
72 i += scnprintf(buf + i, sz - i, " %u", msg_data_sz(hdr)); in tipc_skb_dump()
73 i += scnprintf(buf + i, sz - i, " %x", msg_orignode(hdr)); in tipc_skb_dump()
74 i += scnprintf(buf + i, sz - i, " %x", msg_destnode(hdr)); in tipc_skb_dump()
75 i += scnprintf(buf + i, sz - i, " %u", msg_seqno(hdr)); in tipc_skb_dump()
[all …]
/net/sctp/
Dstream.c75 int i; in sctp_stream_outq_migrate() local
85 for (i = 0; i < outcnt; i++) { in sctp_stream_outq_migrate()
86 sctp_stream_free_ext(new, i); in sctp_stream_outq_migrate()
87 SCTP_SO(new, i)->ext = SCTP_SO(stream, i)->ext; in sctp_stream_outq_migrate()
88 SCTP_SO(stream, i)->ext = NULL; in sctp_stream_outq_migrate()
92 for (i = outcnt; i < stream->outcnt; i++) in sctp_stream_outq_migrate()
93 sctp_stream_free_ext(stream, i); in sctp_stream_outq_migrate()
134 int i, ret = 0; in sctp_stream_init() local
153 for (i = 0; i < stream->outcnt; i++) in sctp_stream_init()
154 SCTP_SO(stream, i)->state = SCTP_STREAM_OPEN; in sctp_stream_init()
[all …]
/net/ceph/
Dpagevec.c15 int i; in ceph_put_page_vector() local
17 for (i = 0; i < num_pages; i++) { in ceph_put_page_vector()
19 set_page_dirty_lock(pages[i]); in ceph_put_page_vector()
20 put_page(pages[i]); in ceph_put_page_vector()
28 int i; in ceph_release_page_vector() local
30 for (i = 0; i < num_pages; i++) in ceph_release_page_vector()
31 __free_pages(pages[i], 0); in ceph_release_page_vector()
42 int i; in ceph_alloc_page_vector() local
47 for (i = 0; i < num_pages; i++) { in ceph_alloc_page_vector()
48 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 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/mac80211/
Drate.c315 u8 i; in rc_send_low_basicrate() local
331 for (i = rate->idx + 1; i <= sband->n_bitrates; i++) { in rc_send_low_basicrate()
332 if (basic_rates & (1 << i)) { in rc_send_low_basicrate()
333 rate->idx = i; in rc_send_low_basicrate()
347 int i; in __rate_control_send_low() local
362 for (i = 0; i < sband->n_bitrates; i++) { in __rate_control_send_low()
363 if (!(rate_mask & BIT(i))) in __rate_control_send_low()
366 if ((rate_flags & sband->bitrates[i].flags) != rate_flags) in __rate_control_send_low()
369 if (!rate_supported(sta, sband->band, i)) in __rate_control_send_low()
372 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_avg) <= 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.c31 int i; in ieee80211_apply_vhtcap_overrides() local
88 for (i = 0; i < 8; i++) { in ieee80211_apply_vhtcap_overrides()
91 m = (rxmcs_mask >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
92 n = (rxmcs_n >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
93 c = (rxmcs_cap >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
97 rxmcs_cap &= ~(3 << 2*i); in ieee80211_apply_vhtcap_overrides()
98 rxmcs_cap |= (rxmcs_n & (3 << 2*i)); in ieee80211_apply_vhtcap_overrides()
101 m = (txmcs_mask >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
102 n = (txmcs_n >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
103 c = (txmcs_cap >> 2*i) & IEEE80211_VHT_MCS_NOT_SUPPORTED; in ieee80211_apply_vhtcap_overrides()
[all …]
/net/ipv4/
Dproc.c321 int i, count; in icmpmsg_put() local
327 for (i = 0; i < ICMPMSG_MIB_MAX; i++) { in icmpmsg_put()
328 val = atomic_long_read(&net->mib.icmpmsg_statistics->mibs[i]); in icmpmsg_put()
330 type[count] = i; in icmpmsg_put()
345 int i; in icmp_put() local
350 for (i = 0; icmpmibmap[i].name; i++) in icmp_put()
351 seq_printf(seq, " In%s", icmpmibmap[i].name); in icmp_put()
353 for (i = 0; icmpmibmap[i].name; i++) in icmp_put()
354 seq_printf(seq, " Out%s", icmpmibmap[i].name); in icmp_put()
359 for (i = 0; icmpmibmap[i].name; i++) in icmp_put()
[all …]
Dudp_tunnel_nic.c133 unsigned int i, j; in udp_tunnel_nic_is_empty() local
135 for (i = 0; i < utn->n_tables; i++) in udp_tunnel_nic_is_empty()
136 for (j = 0; j < info->tables[i].n_entries; j++) in udp_tunnel_nic_is_empty()
137 if (!udp_tunnel_nic_entry_is_free(&utn->entries[i][j])) in udp_tunnel_nic_is_empty()
146 unsigned int i, j; in udp_tunnel_nic_should_replay() local
151 for (i = 0; i < utn->n_tables; i++) { in udp_tunnel_nic_should_replay()
152 table = &dev->udp_tunnel_nic_info->tables[i]; in udp_tunnel_nic_should_replay()
153 if (!test_bit(i, &utn->missed)) in udp_tunnel_nic_should_replay()
157 if (udp_tunnel_nic_entry_is_free(&utn->entries[i][j])) in udp_tunnel_nic_should_replay()
242 unsigned int i, j; in udp_tunnel_nic_device_sync_by_port() local
[all …]
/net/netfilter/
Dnf_conntrack_ftp.c125 u_int32_t i, len; in try_number() local
130 for (i = 0, len = 0; len < dlen && i < array_size; len++, data++) { in try_number()
132 array[i] = array[i]*10 + *data - '0'; in try_number()
135 i++; in try_number()
140 if ((*data == term || !term) && i == array_size - 1) in try_number()
144 len, i, *data); in try_number()
185 int i; in try_rfc1123() local
186 for (i = 0; i < dlen; i++) in try_rfc1123()
187 if (isdigit(data[i])) in try_rfc1123()
190 if (i == dlen) in try_rfc1123()
[all …]
Dnft_byteorder.c34 unsigned int i; in nft_byteorder_eval() local
46 for (i = 0; i < priv->len / 8; i++) { in nft_byteorder_eval()
47 src64 = nft_reg_load64(&src[i]); in nft_byteorder_eval()
48 nft_reg_store64(&dst64[i], be64_to_cpu(src64)); in nft_byteorder_eval()
52 for (i = 0; i < priv->len / 8; i++) { in nft_byteorder_eval()
54 cpu_to_be64(nft_reg_load64(&src[i])); in nft_byteorder_eval()
55 nft_reg_store64(&dst64[i], src64); in nft_byteorder_eval()
64 for (i = 0; i < priv->len / 4; i++) in nft_byteorder_eval()
65 dst[i] = ntohl((__force __be32)src[i]); in nft_byteorder_eval()
68 for (i = 0; i < priv->len / 4; i++) in nft_byteorder_eval()
[all …]
Dnft_set_pipapo.c373 int i = k * BITS_PER_LONG + r; in pipapo_refill() local
375 if (unlikely(i >= rules)) { in pipapo_refill()
381 bitmap_clear(map, i, 1); in pipapo_refill()
382 return i; in pipapo_refill()
387 bitmap_set(dst, mt[i].to, mt[i].n); in pipapo_refill()
419 int i; in nft_pipapo_lookup() local
437 nft_pipapo_for_each_field(f, i, m) { in nft_pipapo_lookup()
438 bool last = i == m->field_count - 1; in nft_pipapo_lookup()
523 int i; in pipapo_get() local
539 nft_pipapo_for_each_field(f, i, m) { in pipapo_get()
[all …]
Dnf_log.c31 int i; in __find_logger() local
33 for (i = 0; i < NF_LOG_TYPE_MAX; i++) { in __find_logger()
34 if (loggers[pf][i] == NULL) in __find_logger()
37 log = nft_log_dereference(loggers[pf][i]); in __find_logger()
65 int i; in nf_log_unset() local
69 for (i = 0; i < NFPROTO_NUMPROTO; i++) { in nf_log_unset()
70 log = nft_log_dereference(net->nf.nf_loggers[i]); in nf_log_unset()
72 RCU_INIT_POINTER(net->nf.nf_loggers[i], NULL); in nf_log_unset()
81 int i; in nf_log_register() local
90 for (i = NFPROTO_UNSPEC; i < NFPROTO_NUMPROTO; i++) { in nf_log_register()
[all …]
/net/sunrpc/auth_gss/
Dgss_mech_switch.c36 int i; in gss_mech_free() local
38 for (i = 0; i < gm->gm_pf_num; i++) { in gss_mech_free()
39 pf = &gm->gm_pfs[i]; in gss_mech_free()
66 int i, status; in gss_mech_svc_setup() local
68 for (i = 0; i < gm->gm_pf_num; i++) { in gss_mech_svc_setup()
69 pf = &gm->gm_pfs[i]; in gss_mech_svc_setup()
189 int i; in mech_supports_pseudoflavor() local
191 for (i = 0; i < gm->gm_pf_num; i++) { in mech_supports_pseudoflavor()
192 if (gm->gm_pfs[i].pseudoflavor == pseudoflavor) in mech_supports_pseudoflavor()
239 int i; in gss_svc_to_pseudoflavor() 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()
248 int i; in mit_des_fixup_key_parity() local
[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/sched/
Dsch_gred.c94 int i; in gred_wred_mode_check() local
97 for (i = 0; i < table->DPs; i++) { in gred_wred_mode_check()
98 struct gred_sched_data *q = table->tab[i]; in gred_wred_mode_check()
104 for (n = i + 1; n < table->DPs; n++) in gred_wred_mode_check()
153 unsigned int i; in gred_per_vq_red_flags_used() local
158 for (i = 0; i < MAX_DPs; i++) in gred_per_vq_red_flags_used()
159 if (table->tab[i] && table->tab[i]->red_flags) in gred_per_vq_red_flags_used()
195 int i; in gred_enqueue() local
197 for (i = 0; i < t->DPs; i++) { in gred_enqueue()
198 if (t->tab[i] && t->tab[i]->prio < q->prio && in gred_enqueue()
[all …]
Dsch_mqprio.c64 int i, j; in mqprio_parse_opt() local
71 for (i = 0; i < TC_BITMASK + 1; i++) { in mqprio_parse_opt()
72 if (qopt->prio_tc_map[i] >= qopt->num_tc) in mqprio_parse_opt()
91 for (i = 0; i < qopt->num_tc; i++) { in mqprio_parse_opt()
92 unsigned int last = qopt->offset[i] + qopt->count[i]; in mqprio_parse_opt()
97 if (qopt->offset[i] >= dev->real_num_tx_queues || in mqprio_parse_opt()
98 !qopt->count[i] || in mqprio_parse_opt()
103 for (j = i + 1; j < qopt->num_tc; j++) { in mqprio_parse_opt()
140 int i, rem, err; in mqprio_parse_nlattr() local
169 i = 0; in mqprio_parse_nlattr()
[all …]
Dsch_hhf.c254 int i; in hhf_classify() local
261 for (i = 0; i < HHF_ARRAYS_CNT; i++) in hhf_classify()
262 bitmap_zero(q->hhf_valid_bits[i], HHF_ARRAYS_LEN); in hhf_classify()
280 for (i = 0; i < HHF_ARRAYS_CNT - 1; i++) { in hhf_classify()
282 filter_pos[i] = tmp_hash & HHF_BIT_MASK; in hhf_classify()
283 xorsum ^= filter_pos[i]; in hhf_classify()
291 for (i = 0; i < HHF_ARRAYS_CNT; i++) { in hhf_classify()
294 if (!test_bit(filter_pos[i], q->hhf_valid_bits[i])) { in hhf_classify()
295 q->hhf_arrays[i][filter_pos[i]] = 0; in hhf_classify()
296 __set_bit(filter_pos[i], q->hhf_valid_bits[i]); in hhf_classify()
[all …]
/net/mptcp/
Dcrypto.c49 int i; in mptcp_crypto_hmac_sha() local
59 for (i = 0; i < 8; i++) in mptcp_crypto_hmac_sha()
60 input[i] ^= key1be[i]; in mptcp_crypto_hmac_sha()
61 for (i = 0; i < 8; i++) in mptcp_crypto_hmac_sha()
62 input[i + 8] ^= key2be[i]; in mptcp_crypto_hmac_sha()
73 for (i = 0; i < 8; i++) in mptcp_crypto_hmac_sha()
74 input[i] ^= key1be[i]; in mptcp_crypto_hmac_sha()
75 for (i = 0; i < 8; i++) in mptcp_crypto_hmac_sha()
76 input[i + 8] ^= key2be[i]; in mptcp_crypto_hmac_sha()
/net/ethtool/
Dstrset.c200 unsigned int i; in strset_cleanup_data() local
202 for (i = 0; i < ETH_SS_COUNT; i++) in strset_cleanup_data()
203 if (data->sets[i].free_strings) { in strset_cleanup_data()
204 kfree(data->sets[i].strings); in strset_cleanup_data()
205 data->sets[i].strings = NULL; in strset_cleanup_data()
206 data->sets[i].free_strings = false; in strset_cleanup_data()
257 unsigned int i; in strset_prepare_data() local
264 for (i = 0; i < ETH_SS_COUNT; i++) { in strset_prepare_data()
265 if ((req_info->req_ids & (1U << i)) && in strset_prepare_data()
266 data->sets[i].per_dev) { in strset_prepare_data()
[all …]
/net/core/
Dscm.c71 int i, num; in scm_fp_copy() local
100 for (i=0; i< num; i++) in scm_fp_copy()
102 int fd = fdp[i]; in scm_fp_copy()
125 int i; in __scm_destroy() local
129 for (i=fpl->count-1; i>=0; i--) in __scm_destroy()
130 fput(fpl->fp[i]); in __scm_destroy()
264 int i; in put_cmsg_scm_timestamping64() local
266 for (i = 0; i < ARRAY_SIZE(tss.ts); i++) { in put_cmsg_scm_timestamping64()
267 tss.ts[i].tv_sec = tss_internal->ts[i].tv_sec; in put_cmsg_scm_timestamping64()
268 tss.ts[i].tv_nsec = tss_internal->ts[i].tv_nsec; in put_cmsg_scm_timestamping64()
[all …]
/net/smc/
Dsmc_core.c112 int i, j; in smcr_lgr_conn_assign_link() local
115 for (i = 0; i < SMC_LINKS_PER_LGR_MAX; i++) { in smcr_lgr_conn_assign_link()
116 struct smc_link *lnk = &conn->lgr->lnk[i]; in smcr_lgr_conn_assign_link()
125 for (j = i + 1; j < SMC_LINKS_PER_LGR_MAX; j++) { in smcr_lgr_conn_assign_link()
224 int i; in smcr_lgr_link_deactivate_all() local
226 for (i = 0; i < SMC_LINKS_PER_LGR_MAX; i++) { in smcr_lgr_link_deactivate_all()
227 struct smc_link *lnk = &lgr->lnk[i]; in smcr_lgr_link_deactivate_all()
286 int i; in smcr_next_link_id() local
293 for (i = 0; i < SMC_LINKS_PER_LGR_MAX; i++) { in smcr_next_link_id()
294 if (smc_link_usable(&lgr->lnk[i]) && in smcr_next_link_id()
[all …]
/net/xfrm/
Dxfrm_algo.c646 int i, status; in xfrm_find_algo() local
648 for (i = 0; i < algo_list->entries; i++) { in xfrm_find_algo()
649 if (!match(list + i, data)) in xfrm_find_algo()
652 if (list[i].available) in xfrm_find_algo()
653 return &list[i]; in xfrm_find_algo()
658 status = crypto_has_alg(list[i].name, algo_list->type, in xfrm_find_algo()
663 list[i].available = status; in xfrm_find_algo()
664 return &list[i]; in xfrm_find_algo()
778 int i, status; in xfrm_probe_algs() local
782 for (i = 0; i < aalg_entries(); i++) { in xfrm_probe_algs()
[all …]

12345678910>>...24