Home
last modified time | relevance | path

Searched refs:idx (Results 1 – 25 of 722) sorted by relevance

12345678910>>...29

/f-stack/dpdk/drivers/net/hinic/base/
H A Dhinic_csr.h28 #define HINIC_CSR_DMA_ATTR_TBL_ADDR(idx) \ argument
30 + (idx) * HINIC_CSR_DMA_ATTR_TBL_STRIDE)
43 #define HINIC_CSR_MSIX_CTRL_ADDR(idx) \ argument
46 #define HINIC_CSR_MSIX_CNT_ADDR(idx) \ argument
80 #define HINIC_CSR_AEQ_CTRL_0_ADDR(idx) \ argument
83 #define HINIC_CSR_AEQ_CTRL_1_ADDR(idx) \ argument
86 #define HINIC_CSR_AEQ_CONS_IDX_ADDR(idx) \ argument
89 #define HINIC_CSR_AEQ_PROD_IDX_ADDR(idx) \ argument
115 #define HINIC_CSR_API_CMD_CHAIN_PI_ADDR(idx) \ argument
121 #define HINIC_CSR_API_CMD_STATUS_0_ADDR(idx) \ argument
[all …]
/f-stack/dpdk/lib/librte_ring/
H A Drte_ring_elem.h143 for (i = 0; idx < size; i++, idx++) in __rte_ring_enqueue_elems_32()
146 for (idx = 0; i < n; i++, idx++) in __rte_ring_enqueue_elems_32()
176 for (i = 0; idx < size; i++, idx++) in __rte_ring_enqueue_elems_64()
179 for (idx = 0; i < n; i++, idx++) in __rte_ring_enqueue_elems_64()
203 for (i = 0; idx < size; i++, idx++) in __rte_ring_enqueue_elems_128()
207 for (idx = 0; i < n; i++, idx++) in __rte_ring_enqueue_elems_128()
277 for (i = 0; idx < size; i++, idx++) in __rte_ring_dequeue_elems_32()
280 for (idx = 0; i < n; i++, idx++) in __rte_ring_dequeue_elems_32()
310 for (i = 0; idx < size; i++, idx++) in __rte_ring_dequeue_elems_64()
313 for (idx = 0; i < n; i++, idx++) in __rte_ring_dequeue_elems_64()
[all …]
/f-stack/dpdk/lib/librte_graph/
H A Drte_graph_worker.h275 const uint16_t idx = node->idx; in rte_node_enqueue() local
280 node->idx = idx + nb_objs; in rte_node_enqueue()
302 uint16_t idx = node->idx; in rte_node_enqueue_x1() local
307 node->idx = idx; in rte_node_enqueue_x1()
332 uint16_t idx = node->idx; in rte_node_enqueue_x2() local
338 node->idx = idx; in rte_node_enqueue_x2()
368 uint16_t idx = node->idx; in rte_node_enqueue_x4() local
376 node->idx = idx; in rte_node_enqueue_x4()
431 const uint16_t idx = node->idx; in rte_node_next_stream_get() local
468 node->idx += idx; in rte_node_next_stream_put()
[all …]
/f-stack/dpdk/drivers/net/bnxt/tf_ulp/
H A Dulp_mark_mgr.c31 uint32_t idx = 0, hashtype = 0; in ulp_mark_db_idx_get() local
35 TF_GET_HASH_INDEX_FROM_GFID(fid, idx); in ulp_mark_db_idx_get()
38 idx &= mtbl->gfid_mask; in ulp_mark_db_idx_get()
40 idx |= mtbl->gfid_type_bit; in ulp_mark_db_idx_get()
42 idx = fid; in ulp_mark_db_idx_get()
44 return idx; in ulp_mark_db_idx_get()
179 uint32_t idx = 0; in ulp_mark_db_mark_get() local
230 uint32_t idx = 0; in ulp_mark_db_mark_add() local
252 mtbl->gfid_tbl[idx].mark_id = mark; in ulp_mark_db_mark_add()
288 uint32_t idx = 0; in ulp_mark_db_mark_del() local
[all …]
H A Dulp_flow_db.c232 for (idx = 0; idx < flow_tbl->num_resources; idx++) in ulp_flow_db_alloc_resource()
347 for (idx = 0 ; idx < p_db->entries_count; idx++) { in ulp_flow_db_parent_tbl_init()
464 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_tun_idx_get()
1304 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_flow_alloc()
1348 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_flow_free()
1397 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_child_flow_set()
1438 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_flow_idx_get()
1567 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_flow_count_accum_get()
1796 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_flow_count_update()
1837 for (idx = 0; idx < p_pdb->entries_count; idx++) { in ulp_flow_db_parent_flow_count_get()
[all …]
H A Dulp_mapper.c177 free_parms.idx = aparms.idx; in ulp_mapper_resource_index_tbl_alloc()
805 idx = tfp_be_to_cpu_16(idx); in ulp_mapper_result_field_process()
849 idx = tfp_be_to_cpu_16(idx); in ulp_mapper_result_field_process()
1457 sparms.idx = idx; in ulp_mapper_tcam_tbl_entry_write()
1516 for (idx = 0; idx < mode_len; idx++) in ulp_mapper_wc_tcam_tbl_post_process()
1641 idx = aparms.idx; in ulp_mapper_tcam_tbl_process()
1669 idx = searchparms.idx; in ulp_mapper_tcam_tbl_process()
1752 free_parms.idx = idx; in ulp_mapper_tcam_tbl_process()
2366 iftbl_params.idx = idx; in ulp_mapper_if_tbl_process()
2400 for (idx = 0; idx < num_glb_res_ids; idx++) { in ulp_mapper_glb_resource_info_init()
[all …]
/f-stack/dpdk/lib/librte_lpm/
H A Drte_lpm_altivec.h25 uint64_t idx, pt, pt2; in rte_lpm_lookupx4() local
52 idx = (uint32_t)i24[0]; in rte_lpm_lookupx4()
53 idx = idx < (1<<24) ? idx : (1<<24)-1; in rte_lpm_lookupx4()
54 ptbl = (const uint32_t *)&lpm->tbl24[idx]; in rte_lpm_lookupx4()
57 idx = (uint32_t) i24[1]; in rte_lpm_lookupx4()
58 idx = idx < (1<<24) ? idx : (1<<24)-1; in rte_lpm_lookupx4()
59 ptbl = (const uint32_t *)&lpm->tbl24[idx]; in rte_lpm_lookupx4()
62 idx = (uint32_t) i24[2]; in rte_lpm_lookupx4()
63 idx = idx < (1<<24) ? idx : (1<<24)-1; in rte_lpm_lookupx4()
67 idx = (uint32_t) i24[3]; in rte_lpm_lookupx4()
[all …]
/f-stack/dpdk/lib/librte_eal/common/
H A Deal_common_options.c620 for (; idx < RTE_MAX_LCORE; idx++) in eal_parse_service_coremask()
640 for (idx = 0; idx < RTE_MAX_LCORE; idx++) { in eal_service_cores_parsed()
682 for (idx = 0; idx < RTE_MAX_LCORE; idx++) in eal_parse_coremask()
762 for (idx = min; idx <= max; idx++) { in eal_parse_service_corelist()
807 for (idx = 0; idx < RTE_MAX_LCORE; idx++) in eal_parse_corelist()
835 for (idx = min; idx <= max; idx++) { in eal_parse_corelist()
1005 for (idx = 0; idx < CPU_SETSIZE; idx++) { in check_cpuset()
1057 for (idx = 0; idx < RTE_MAX_LCORE; idx++) { in eal_parse_lcores()
1115 for (idx = 0; idx < RTE_MAX_LCORE; idx++) { in eal_parse_lcores()
1396 for (idx = 0; idx < RTE_MAX_LCORE; idx++) { in available_cores()
[all …]
/f-stack/dpdk/drivers/net/mlx5/
H A Dmlx5_utils.h119 uint32_t idx; /* Table index. */ member
129 uint32_t idx; /* Table index. */ member
139 uint32_t idx; /* Table index. */ member
216 uint32_t idx; /* Trunk id. */ member
855 *(head) = (idx); \
875 if (*(head) == (idx)) \
881 (idx) ? mlx5_ipool_get(pool, (idx)) : NULL; (elem); \
883 (idx) ? mlx5_ipool_get(pool, idx) : NULL)
895 *(head) = (idx); \
900 (idx) ? mlx5_ipool_get(pool, (idx)) : NULL; (elem); \
[all …]
H A Dmlx5_txq.c337 if (idx >= priv->txqs_n) { in mlx5_tx_queue_pre_setup()
346 dev->data->port_id, idx); in mlx5_tx_queue_pre_setup()
349 mlx5_txq_release(dev, idx); in mlx5_tx_queue_pre_setup()
386 dev->data->port_id, idx); in mlx5_tx_queue_setup()
390 dev->data->port_id, idx); in mlx5_tx_queue_setup()
460 dev->data->port_id, idx); in mlx5_tx_hairpin_queue_setup()
595 txq->port_id, txq->idx); in txq_uar_init_secondary()
1130 tmpl->txq.idx = idx; in mlx5_txq_new()
1185 tmpl->txq.idx = idx; in mlx5_txq_hairpin_new()
1235 if (!(*priv->txqs)[idx]) in mlx5_txq_release()
[all …]
/f-stack/dpdk/drivers/net/axgbe/
H A Daxgbe_rxtx_vec_sse.c40 int idx, i; in axgbe_xmit_cleanup_vec() local
44 desc = &txq->desc[idx]; in axgbe_xmit_cleanup_vec()
51 rte_pktmbuf_free_seg(txq->sw_ring[idx]); in axgbe_xmit_cleanup_vec()
65 uint16_t idx, nb_commit, loop, i; in axgbe_xmit_pkts_vec() local
76 idx = AXGBE_GET_DESC_IDX(txq, txq->cur); in axgbe_xmit_pkts_vec()
77 loop = txq->nb_desc - idx; in axgbe_xmit_pkts_vec()
80 axgbe_vec_tx(&txq->desc[idx], *tx_pkts); in axgbe_xmit_pkts_vec()
81 txq->sw_ring[idx] = *tx_pkts; in axgbe_xmit_pkts_vec()
84 idx = 0; in axgbe_xmit_pkts_vec()
87 axgbe_vec_tx(&txq->desc[idx], *tx_pkts); in axgbe_xmit_pkts_vec()
[all …]
/f-stack/dpdk/examples/l3fwd/
H A Dl3fwd_common.h85 .idx = 4,
91 .idx = 4,
97 .idx = 4,
103 .idx = 4,
109 .idx = 4,
115 .idx = 4,
121 .idx = 4,
127 .idx = 4,
133 .idx = 3,
139 .idx = 3,
[all …]
/f-stack/dpdk/drivers/bus/dpaa/include/
H A Ddpaa_bits.h13 #define BITS_MASK(idx) (1UL << ((idx) & (BITS_PER_ULONG - 1))) argument
14 #define BITS_IDX(idx) ((idx) >> SHIFT_PER_ULONG) argument
22 static inline void dpaa_set_bit(int idx, volatile unsigned long *bits) in dpaa_set_bit() argument
24 dpaa_set_bits(BITS_MASK(idx), bits + BITS_IDX(idx)); in dpaa_set_bit()
33 static inline void dpaa_clear_bit(int idx, in dpaa_clear_bit() argument
36 dpaa_clear_bits(BITS_MASK(idx), bits + BITS_IDX(idx)); in dpaa_clear_bit()
/f-stack/app/redis-5.0.5/utils/lru/
H A Dlfu-simulation.c100 long idx; in main() local
111 idx = 1; in main()
112 while((rand() % 21) != 0 && idx < keyspace_size) idx *= 2; in main()
113 if (idx > keyspace_size) idx = keyspace_size; in main()
114 idx = rand() % idx; in main()
117 idx = rand() % keyspace_size; in main()
127 if ((idx < 10 || idx > 14) && (idx < keyspace_size-5)) in main()
128 access_entry(entries+idx); in main()
133 idx = 10+(rand()%10); in main()
136 entries[idx].hits = 0; in main()
[all …]
/f-stack/dpdk/drivers/net/octeontx2/
H A Dotx2_lookup.c101 uint32_t idx; in nix_create_non_tunnel_ptype_array() local
103 for (idx = 0; idx < PTYPE_NON_TUNNEL_ARRAY_SZ; idx++) { in nix_create_non_tunnel_ptype_array()
104 lb = idx & 0xF; in nix_create_non_tunnel_ptype_array()
200 ptype[idx] = val; in nix_create_non_tunnel_ptype_array()
210 uint32_t idx; in nix_create_tunnel_ptype_array() local
215 for (idx = 0; idx < PTYPE_TUNNEL_ARRAY_SZ; idx++) { in nix_create_tunnel_ptype_array()
216 lf = idx & 0xF; in nix_create_tunnel_ptype_array()
250 ptype[idx] = val; in nix_create_tunnel_ptype_array()
263 for (idx = 0; idx < BIT(ERRCODE_ERRLEN_WIDTH); idx++) { in nix_create_rx_ol_flags_array()
264 errlev = idx & 0xf; in nix_create_rx_ol_flags_array()
[all …]
H A Dotx2_flow_utils.c100 int idx; in flow_prep_mcam_ldata() local
102 for (idx = 0; idx < len; idx++) in flow_prep_mcam_ldata()
103 ptr[idx] = data[len - 1 - idx]; in flow_prep_mcam_ldata()
261 for (idx = 0; idx < len ; idx++) in flow_update_extraction_data()
705 for (idx = 0; idx < rsp->count; idx++) in flow_validate_and_shift_prio_ent()
706 rsp->entry_list[idx] = rsp->entry + idx; in flow_validate_and_shift_prio_ent()
786 for (idx = 0; idx < rsp->count; idx++) in flow_fill_entry_cache()
787 rsp->entry_list[idx] = rsp->entry + idx; in flow_fill_entry_cache()
794 for (idx = 0; idx < rsp->count; idx++) { in flow_fill_entry_cache()
920 for (idx = 0; idx < OTX2_MAX_MCAM_WIDTH_DWORDS; idx++) { in otx2_flow_mcam_alloc_and_write()
[all …]
/f-stack/freebsd/net/route/
H A Dnhop_utils.c54 if (idx != NULL) in bitmask_init()
59 bh->idx = (u_long *)idx; in bitmask_init()
105 u_long *idx = (u_long *)_idx; in _bitmask_init_idx() local
108 memset(idx, 0xFF, size); in _bitmask_init_idx()
141 old_ptr = bh->idx; in bitmask_swap()
143 bh->idx = (u_long *)new_idx; in bitmask_swap()
161 mask = &bi->idx[off]; in bitmask_alloc_idx()
192 if (idx == 0) in bitmask_free_idx()
195 i = idx / BLOCK_ITEMS; in bitmask_free_idx()
196 v = idx % BLOCK_ITEMS; in bitmask_free_idx()
[all …]
/f-stack/dpdk/examples/vm_power_manager/guest_cli/
H A Dparse.c22 unsigned int idx; in parse_set() local
52 idx = strtoul(str, &end, 10); in parse_set()
53 if (errno || end == NULL || idx >= num) in parse_set()
61 min = idx; in parse_set()
65 max = idx; in parse_set()
68 min = idx; in parse_set()
70 for (idx = RTE_MIN(min, max); in parse_set()
71 idx <= RTE_MAX(min, max); idx++) { in parse_set()
72 set[idx] = 1; in parse_set()
/f-stack/app/redis-5.0.5/deps/lua/src/
H A Dlapi.c50 if (idx > 0) { in index2adr()
57 api_check(L, idx != 0 && -idx <= L->top - L->base); in index2adr()
58 return L->top + idx; in index2adr()
70 idx = LUA_GLOBALSINDEX - idx; in index2adr()
166 if (idx >= 0) { in lua_settop()
183 p = index2adr(L, idx); in lua_remove()
195 p = index2adr(L, idx); in lua_insert()
210 o = index2adr(L, idx); in lua_replace()
537 t = index2adr(L, idx); in lua_gettable()
548 t = index2adr(L, idx); in lua_getfield()
[all …]
H A Dlua.h121 LUA_API void (lua_settop) (lua_State *L, int idx);
122 LUA_API void (lua_pushvalue) (lua_State *L, int idx);
123 LUA_API void (lua_remove) (lua_State *L, int idx);
124 LUA_API void (lua_insert) (lua_State *L, int idx);
125 LUA_API void (lua_replace) (lua_State *L, int idx);
177 LUA_API void (lua_gettable) (lua_State *L, int idx);
179 LUA_API void (lua_rawget) (lua_State *L, int idx);
184 LUA_API void (lua_getfenv) (lua_State *L, int idx);
192 LUA_API void (lua_rawset) (lua_State *L, int idx);
195 LUA_API int (lua_setfenv) (lua_State *L, int idx);
[all …]
/f-stack/freebsd/libkern/
H A Dstrspn.c49 int idx; in strspn() local
57 for (idx = 0; idx < sizeof(tbl) / sizeof(tbl[0]); idx++) in strspn()
58 tbl[idx] = 0; in strspn()
61 idx = IDX(*charset); in strspn()
63 tbl[idx] |= bit; in strspn()
67 idx = IDX(*s1); in strspn()
69 if ((tbl[idx] & bit) == 0) in strspn()
H A Dstrcspn.c49 int idx; in strcspn() local
58 for (tbl[0] = idx = 1; idx < sizeof(tbl) / sizeof(tbl[0]); idx++) in strcspn()
59 tbl[idx] = 0; in strcspn()
62 idx = IDX(*charset); in strcspn()
64 tbl[idx] |= bit; in strcspn()
68 idx = IDX(*s1); in strcspn()
70 if ((tbl[idx] & bit) != 0) in strcspn()
/f-stack/freebsd/contrib/openzfs/include/sys/lua/
H A Dlua.h144 LUA_API int (lua_absindex) (lua_State *L, int idx);
146 LUA_API void (lua_settop) (lua_State *L, int idx);
147 LUA_API void (lua_pushvalue) (lua_State *L, int idx);
148 LUA_API void (lua_remove) (lua_State *L, int idx);
149 LUA_API void (lua_insert) (lua_State *L, int idx);
150 LUA_API void (lua_replace) (lua_State *L, int idx);
224 LUA_API void (lua_gettable) (lua_State *L, int idx);
226 LUA_API void (lua_rawget) (lua_State *L, int idx);
241 LUA_API void (lua_rawset) (lua_State *L, int idx);
303 LUA_API int (lua_next) (lua_State *L, int idx);
[all …]
/f-stack/freebsd/contrib/openzfs/module/lua/
H A Dlapi.c54 if (idx > 0) { in index2addr()
61 api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); in index2addr()
62 return L->top + idx; in index2addr()
67 idx = LUA_REGISTRYINDEX - idx; in index2addr()
73 return (idx <= func->nupvalues) ? &func->upvalue[idx-1] : NONVALIDVALUE; in index2addr()
151 return (idx > 0 || ispseudo(idx)) in lua_absindex()
152 ? idx in lua_absindex()
165 if (idx >= 0) { in lua_settop()
182 p = index2addr(L, idx); in lua_remove()
194 p = index2addr(L, idx); in lua_insert()
[all …]
/f-stack/dpdk/examples/vm_power_manager/
H A Dparse.c21 unsigned int idx; in parse_set() local
51 idx = strtoul(str, &end, 10); in parse_set()
52 if (errno || end == NULL || idx >= num) in parse_set()
60 min = idx; in parse_set()
64 max = idx; in parse_set()
67 min = idx; in parse_set()
69 for (idx = RTE_MIN(min, max); in parse_set()
70 idx <= RTE_MAX(min, max); idx++) { in parse_set()
71 set[idx] = 1; in parse_set()

12345678910>>...29