Home
last modified time | relevance | path

Searched full:chain (Results 1 – 25 of 1408) sorted by relevance

12345678910>>...57

/linux-6.12.1/drivers/net/ethernet/huawei/hinic/
Dhinic_hw_api_cmd.c49 #define MASKED_IDX(chain, idx) ((idx) & ((chain)->num_cells - 1)) argument
89 static void set_prod_idx(struct hinic_api_cmd_chain *chain) in set_prod_idx() argument
91 enum hinic_api_cmd_chain_type chain_type = chain->chain_type; in set_prod_idx()
92 struct hinic_hwif *hwif = chain->hwif; in set_prod_idx()
100 prod_idx |= HINIC_API_CMD_PI_SET(chain->prod_idx, IDX); in set_prod_idx()
105 static u32 get_hw_cons_idx(struct hinic_api_cmd_chain *chain) in get_hw_cons_idx() argument
109 addr = HINIC_CSR_API_CMD_STATUS_ADDR(chain->chain_type); in get_hw_cons_idx()
110 val = hinic_hwif_read_reg(chain->hwif, addr); in get_hw_cons_idx()
115 static void dump_api_chain_reg(struct hinic_api_cmd_chain *chain) in dump_api_chain_reg() argument
119 addr = HINIC_CSR_API_CMD_STATUS_ADDR(chain->chain_type); in dump_api_chain_reg()
[all …]
/linux-6.12.1/drivers/net/ethernet/qlogic/qed/
Dqed_chain.c10 static void qed_chain_init(struct qed_chain *chain, in qed_chain_init() argument
14 memset(chain, 0, sizeof(*chain)); in qed_chain_init()
16 chain->elem_size = params->elem_size; in qed_chain_init()
17 chain->intended_use = params->intended_use; in qed_chain_init()
18 chain->mode = params->mode; in qed_chain_init()
19 chain->cnt_type = params->cnt_type; in qed_chain_init()
21 chain->elem_per_page = ELEMS_PER_PAGE(params->elem_size, in qed_chain_init()
23 chain->usable_per_page = USABLE_ELEMS_PER_PAGE(params->elem_size, in qed_chain_init()
26 chain->elem_unusable = UNUSABLE_ELEMS_PER_PAGE(params->elem_size, in qed_chain_init()
29 chain->elem_per_page_mask = chain->elem_per_page - 1; in qed_chain_init()
[all …]
/linux-6.12.1/drivers/dma-buf/
Ddma-fence-chain.c3 * fence-chain: chain fences together in a timeline
10 #include <linux/dma-fence-chain.h>
16 * @chain: chain node to get the previous node from
19 * chain node.
21 static struct dma_fence *dma_fence_chain_get_prev(struct dma_fence_chain *chain) in dma_fence_chain_get_prev() argument
26 prev = dma_fence_get_rcu_safe(&chain->prev); in dma_fence_chain_get_prev()
32 * dma_fence_chain_walk - chain walking function
33 * @fence: current chain node
35 * Walk the chain to the next node. Returns the next fence or NULL if we are at
36 * the end of the chain. Garbage collects chain nodes which are already
[all …]
/linux-6.12.1/tools/testing/selftests/net/forwarding/
Dtc_chains.sh38 tc filter add dev $h2 ingress chain 1 protocol ip pref 1 handle 1101 \
45 check_fail $? "matched on filter in unreachable chain"
47 tc filter del dev $h2 ingress chain 1 protocol ip pref 1 handle 1101 \
50 log_test "unreachable chain ($tcflags)"
57 tc filter add dev $h2 ingress chain 1 protocol ip pref 1 handle 1101 \
62 $tcflags dst_mac $h2mac action goto chain 1
71 check_err $? "Did not match on correct filter with goto chain action"
74 check_err $? "Did not match on correct filter in chain 1"
78 tc filter del dev $h2 ingress chain 1 protocol ip pref 1 handle 1101 \
81 log_test "gact goto chain ($tcflags)"
[all …]
/linux-6.12.1/drivers/net/ethernet/mellanox/mlx5/core/lib/
Dfs_chains.c43 u32 chain; member
55 u32 chain; member
68 struct fs_chain *chain; member
77 .key_offset = offsetof(struct fs_chain, chain),
78 .key_len = sizeof_field(struct fs_chain, chain),
153 u32 chain, u32 prio, u32 level) in mlx5_chains_create_table() argument
164 sz = (chain == mlx5_chains_get_nf_ft_chain(chains)) ? FT_TBL_SZ : POOL_NEXT_SIZE; in mlx5_chains_create_table()
173 /* The root table(chain 0, prio 1, level 0) is required to be in mlx5_chains_create_table()
179 (chain == 0 && prio == 1 && level == 0)) { in mlx5_chains_create_table()
183 mlx5_get_fdb_sub_ns(chains->dev, chain) : in mlx5_chains_create_table()
[all …]
/linux-6.12.1/drivers/net/wireless/ath/ath9k/
Dar9003_rtt.c29 * There is an internal table (i.e. the rtt) for each chain (or bank).
72 static void ar9003_hw_rtt_load_hist_entry(struct ath_hw *ah, u8 chain, in ar9003_hw_rtt_load_hist_entry() argument
78 REG_WRITE(ah, AR_PHY_RTT_TABLE_SW_INTF_1_B(chain), val); in ar9003_hw_rtt_load_hist_entry()
83 REG_WRITE(ah, AR_PHY_RTT_TABLE_SW_INTF_B(chain), val); in ar9003_hw_rtt_load_hist_entry()
87 REG_WRITE(ah, AR_PHY_RTT_TABLE_SW_INTF_B(chain), val); in ar9003_hw_rtt_load_hist_entry()
90 if (!ath9k_hw_wait(ah, AR_PHY_RTT_TABLE_SW_INTF_B(chain), in ar9003_hw_rtt_load_hist_entry()
96 REG_WRITE(ah, AR_PHY_RTT_TABLE_SW_INTF_B(chain), val); in ar9003_hw_rtt_load_hist_entry()
99 ath9k_hw_wait(ah, AR_PHY_RTT_TABLE_SW_INTF_B(chain), in ar9003_hw_rtt_load_hist_entry()
106 int chain, i; in ar9003_hw_rtt_load_hist() local
108 for (chain = 0; chain < AR9300_MAX_CHAINS; chain++) { in ar9003_hw_rtt_load_hist()
[all …]
/linux-6.12.1/net/netfilter/
Dnft_immediate.c74 struct nft_chain *chain = priv->data.verdict.chain; in nft_immediate_init() local
79 err = nf_tables_bind_chain(ctx, chain); in nft_immediate_init()
101 struct nft_chain *chain; in nft_immediate_activate() local
108 chain = data->verdict.chain; in nft_immediate_activate()
109 if (!nft_chain_binding(chain)) in nft_immediate_activate()
113 chain_ctx.chain = chain; in nft_immediate_activate()
115 list_for_each_entry(rule, &chain->rules, list) in nft_immediate_activate()
118 nft_clear(ctx->net, chain); in nft_immediate_activate()
129 struct nft_chain *chain, in nft_immediate_chain_deactivate() argument
136 chain_ctx.chain = chain; in nft_immediate_chain_deactivate()
[all …]
/linux-6.12.1/drivers/crypto/marvell/cesa/
Dtdma.c51 writel_relaxed(dreq->chain.first->cur_dma, in mv_cesa_dma_step()
62 for (tdma = dreq->chain.first; tdma;) { in mv_cesa_dma_cleanup()
75 dreq->chain.first = NULL; in mv_cesa_dma_cleanup()
76 dreq->chain.last = NULL; in mv_cesa_dma_cleanup()
84 for (tdma = dreq->chain.first; tdma; tdma = tdma->next) { in mv_cesa_dma_prepare()
99 if (engine->chain.first == NULL && engine->chain.last == NULL) { in mv_cesa_tdma_chain()
100 engine->chain.first = dreq->chain.first; in mv_cesa_tdma_chain()
101 engine->chain.last = dreq->chain.last; in mv_cesa_tdma_chain()
105 last = engine->chain.last; in mv_cesa_tdma_chain()
106 last->next = dreq->chain.first; in mv_cesa_tdma_chain()
[all …]
/linux-6.12.1/net/batman-adv/
Dfragmentation.c31 * batadv_frag_clear_chain() - delete entries in the fragment buffer chain
32 * @head: head of chain with entries.
33 * @dropped: whether the chain is cleared because all fragments are dropped
62 struct batadv_frag_table_entry *chain; in batadv_frag_purge_orig() local
66 chain = &orig_node->fragments[i]; in batadv_frag_purge_orig()
67 spin_lock_bh(&chain->lock); in batadv_frag_purge_orig()
69 if (!check_cb || check_cb(chain)) { in batadv_frag_purge_orig()
70 batadv_frag_clear_chain(&chain->fragment_list, true); in batadv_frag_purge_orig()
71 chain->size = 0; in batadv_frag_purge_orig()
74 spin_unlock_bh(&chain->lock); in batadv_frag_purge_orig()
[all …]
/linux-6.12.1/net/sched/
Dcls_api.c54 const struct tcf_chain *chain; member
91 n->chain_index = tp->chain->index; in tcf_exts_miss_cookie_base_alloc()
92 n->chain = tp->chain; in tcf_exts_miss_cookie_base_alloc()
174 return jhash_3words(tp->chain->index, tp->prio, in destroy_obj_hashfn()
178 static void tcf_proto_signal_destroying(struct tcf_chain *chain, in tcf_proto_signal_destroying() argument
181 struct tcf_block *block = chain->block; in tcf_proto_signal_destroying()
192 return tp1->chain->index == tp2->chain->index && in tcf_proto_cmp()
197 static bool tcf_proto_exists_destroying(struct tcf_chain *chain, in tcf_proto_exists_destroying() argument
205 hash_for_each_possible_rcu(chain->block->proto_destroy_ht, iter, in tcf_proto_exists_destroying()
218 tcf_proto_signal_destroyed(struct tcf_chain *chain, struct tcf_proto *tp) in tcf_proto_signal_destroyed() argument
[all …]
/linux-6.12.1/kernel/
Dnotifier.c21 * Notifier chain core routines. The exported routines below
63 * @nl: Pointer to head of the blocking notifier chain
110 * @nl: Pointer to head of the blocking notifier chain
116 * NOTE: It is important the @nl chain doesn't change between the two
136 * Atomic notifier chain routines. Registration and unregistration
141 * atomic_notifier_chain_register - Add notifier to an atomic notifier chain
142 * @nh: Pointer to head of the atomic notifier chain
143 * @n: New entry in notifier chain
145 * Adds a notifier to an atomic notifier chain.
163 * atomic_notifier_chain_register_unique_prio - Add notifier to an atomic notifier chain
[all …]
/linux-6.12.1/include/linux/qed/
Dqed_chain.h22 /* Chain is a single page (next ptr) is not required */
30 QED_CHAIN_USE_TO_PRODUCE, /* Chain starts empty */
31 QED_CHAIN_USE_TO_CONSUME, /* Chain starts full */
32 QED_CHAIN_USE_TO_CONSUME_PRODUCE, /* Chain starts empty */
36 /* The chain's size/prod/cons are kept in 16-bit variables */
39 /* The chain's size/prod/cons are kept in 32-bit variables */
76 /* Fastpath portion of the chain - required for commands such
88 * chain pages, respectively to the physical addresses
120 /* Slowpath of the chain - required for initialization and destruction,
133 /* Address of first page of the chain - the address is required
[all …]
/linux-6.12.1/drivers/s390/cio/
Dcrw.c66 unsigned int chain; in crw_collect_info() local
73 chain = 0; in crw_collect_info()
77 if (unlikely(chain > 1)) { in crw_collect_info()
90 "chain\n", __func__, chain); in crw_collect_info()
93 chain = tmp_crw.chn ? chain + 1 : 0; in crw_collect_info()
96 ccode = stcrw(&crw[chain]); in crw_collect_info()
101 crw[chain].slct, crw[chain].oflw, crw[chain].chn, in crw_collect_info()
102 crw[chain].rsc, crw[chain].anc, crw[chain].erc, in crw_collect_info()
103 crw[chain].rsid); in crw_collect_info()
105 if (crw[chain].oflw) { in crw_collect_info()
[all …]
Dvfio_ccw_cp.c34 /* Guest physical address of the current chain. */
36 /* Count of the valid ccws in chain. */
294 * @head: address of the beginning of a CCW chain
295 * @len: number of CCWs within the chain
297 * Determine whether the address of a CCW (whether a new chain,
320 struct ccwchain *chain; in ccwchain_alloc() local
322 chain = kzalloc(sizeof(*chain), GFP_KERNEL); in ccwchain_alloc()
323 if (!chain) in ccwchain_alloc()
326 chain->ch_ccw = kcalloc(len, sizeof(*chain->ch_ccw), GFP_DMA | GFP_KERNEL); in ccwchain_alloc()
327 if (!chain->ch_ccw) in ccwchain_alloc()
[all …]
/linux-6.12.1/include/linux/
Ddma-fence-chain.h3 * fence-chain: chain fences together in a timeline
18 * struct dma_fence_chain - fence to represent an node of a fence chain
20 * @prev: previous fence of the chain
35 * complection of the fence chain. Never used at the same time
74 * inside the chain object, otherwise it returns the fence itself.
79 struct dma_fence_chain *chain = to_dma_fence_chain(fence); in dma_fence_chain_contained() local
81 return chain ? chain->fence : fence; in dma_fence_chain_contained()
98 * @chain: chain node to free
105 static inline void dma_fence_chain_free(struct dma_fence_chain *chain) in dma_fence_chain_free() argument
107 kfree(chain); in dma_fence_chain_free()
[all …]
/linux-6.12.1/fs/minix/
Ditree_common.c33 Indirect chain[DEPTH], in get_branch()
37 Indirect *p = chain; in get_branch()
42 add_chain (chain, NULL, i_data(inode) + *offsets); in get_branch()
50 if (!verify_chain(chain, p)) in get_branch()
116 Indirect chain[DEPTH], in splice_branch()
125 if (!verify_chain(chain, where-1) || *where->p) in splice_branch()
157 Indirect chain[DEPTH]; in get_block() local
166 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
171 map_bh(bh, inode->i_sb, block_to_cpu(chain[depth-1].key)); in get_block()
173 partial = chain+depth-1; /* the whole chain */ in get_block()
[all …]
/linux-6.12.1/drivers/media/usb/uvc/
Duvc_ctrl.c499 struct uvc_video_chain *chain, struct uvc_control *ctrl) in uvc_ctrl_filter_plf_mapping() argument
512 ret = uvc_query_ctrl(chain->dev, UVC_GET_CUR, ctrl->entity->id, in uvc_ctrl_filter_plf_mapping()
513 chain->dev->intfnum, ctrl->info.selector, in uvc_ctrl_filter_plf_mapping()
522 ret = uvc_query_ctrl(chain->dev, UVC_SET_CUR, ctrl->entity->id, in uvc_ctrl_filter_plf_mapping()
523 chain->dev->intfnum, ctrl->info.selector, in uvc_ctrl_filter_plf_mapping()
529 if (chain->dev->uvc_version < 0x150) in uvc_ctrl_filter_plf_mapping()
534 ret = uvc_query_ctrl(chain->dev, UVC_SET_CUR, ctrl->entity->id, in uvc_ctrl_filter_plf_mapping()
535 chain->dev->intfnum, ctrl->info.selector, in uvc_ctrl_filter_plf_mapping()
543 uvc_query_ctrl(chain->dev, UVC_SET_CUR, ctrl->entity->id, in uvc_ctrl_filter_plf_mapping()
544 chain->dev->intfnum, ctrl->info.selector, in uvc_ctrl_filter_plf_mapping()
[all …]
Duvc_entity.c17 static int uvc_mc_create_links(struct uvc_video_chain *chain, in uvc_mc_create_links() argument
39 remote = uvc_entity_by_id(chain->dev, entity->baSourceID[i]); in uvc_mc_create_links()
70 static int uvc_mc_init_entity(struct uvc_video_chain *chain, in uvc_mc_init_entity() argument
122 ret = v4l2_device_register_subdev(&chain->dev->vdev, in uvc_mc_init_entity()
135 int uvc_mc_register_entities(struct uvc_video_chain *chain) in uvc_mc_register_entities() argument
140 list_for_each_entry(entity, &chain->entities, chain) { in uvc_mc_register_entities()
141 ret = uvc_mc_init_entity(chain, entity); in uvc_mc_register_entities()
143 dev_info(&chain->dev->udev->dev, in uvc_mc_register_entities()
150 list_for_each_entry(entity, &chain->entities, chain) { in uvc_mc_register_entities()
151 ret = uvc_mc_create_links(chain, entity); in uvc_mc_register_entities()
[all …]
/linux-6.12.1/drivers/net/ethernet/mscc/
Docelot_flower.c13 * into the chain number. This is UAPI.
24 /* PSFP chain and block ID */
28 static int ocelot_chain_to_block(int chain, bool ingress) in ocelot_chain_to_block() argument
33 if (chain == 0) in ocelot_chain_to_block()
38 /* Backwards compatibility with older, single-chain tc-flower in ocelot_chain_to_block()
41 if (chain == 0) in ocelot_chain_to_block()
45 if (chain == VCAP_IS1_CHAIN(lookup)) in ocelot_chain_to_block()
50 if (chain == VCAP_IS2_CHAIN(lookup, pag)) in ocelot_chain_to_block()
53 if (chain == OCELOT_PSFP_CHAIN) in ocelot_chain_to_block()
59 /* Caller must ensure this is a valid IS1 or IS2 chain first,
[all …]
/linux-6.12.1/fs/xfs/
Dxfs_hooks.c15 /* Initialize a notifier chain. */
18 struct xfs_hooks *chain) in xfs_hooks_init() argument
20 BLOCKING_INIT_NOTIFIER_HEAD(&chain->head); in xfs_hooks_init()
26 struct xfs_hooks *chain, in xfs_hooks_add() argument
32 return blocking_notifier_chain_register(&chain->head, &hook->nb); in xfs_hooks_add()
38 struct xfs_hooks *chain, in xfs_hooks_del() argument
41 blocking_notifier_chain_unregister(&chain->head, &hook->nb); in xfs_hooks_del()
47 struct xfs_hooks *chain, in xfs_hooks_call() argument
51 return blocking_notifier_call_chain(&chain->head, val, priv); in xfs_hooks_call()
/linux-6.12.1/tools/testing/selftests/tc-testing/tc-tests/infra/
Dfilter.json4 … "name": "Soft lockup alarm will be not generated after delete the prio 0 filter of the chain",
7 "chain"
14 "$TC chain add dev $DUMMY",
15 "$TC filter del dev $DUMMY chain 0 parent 1: prio 0"
17 "cmdUnderTest": "$TC filter add dev $DUMMY chain 0 parent 1:",
19 "verifyCmd": "$TC chain ls dev $DUMMY",
20 "matchPattern": "chain parent 1: chain 0",
/linux-6.12.1/tools/testing/selftests/drivers/net/ocelot/
Dtc_flower_chains.sh19 # Helpers to map a VCAP IS1 and VCAP IS2 lookup and policy to a chain number
93 # separate chain number. For correct rule offloading, it is mandatory that each
97 # A chain can only be used if there is a GOTO action correctly set up from the
117 tc filter add dev $eth ingress chain 0 pref 49152 flower \
118 skip_sw action goto chain $(IS1 0)
119 tc filter add dev $eth ingress chain $(IS1 0) pref 49152 \
120 flower skip_sw action goto chain $(IS1 1)
121 tc filter add dev $eth ingress chain $(IS1 1) pref 49152 \
122 flower skip_sw action goto chain $(IS1 2)
123 tc filter add dev $eth ingress chain $(IS1 2) pref 49152 \
[all …]
/linux-6.12.1/drivers/mtd/
Dnftlcore.c188 * when the give Virtual Unit Chain
192 /* For a given Virtual Unit Chain: find or create a free block and in NFTL_findfreeblock()
193 add it to the chain */ in NFTL_findfreeblock()
194 /* We're passed the number of the last EUN in the chain, to save us from in NFTL_findfreeblock()
252 "Virtual Unit Chain %d!\n", thisVUC); in NFTL_foldchain()
257 512-byte block within the Chain. in NFTL_foldchain()
295 "in Virtual Unit Chain %d for block %d\n", in NFTL_foldchain()
304 "in Virtual Unit Chain %d for block %d\n", in NFTL_foldchain()
317 printk(KERN_WARNING "Infinite loop in Virtual Unit Chain 0x%x\n", in NFTL_foldchain()
360 pr_debug("Cannot fold Virtual Unit Chain %d in place. " in NFTL_foldchain()
[all …]
/linux-6.12.1/fs/sysv/
Ditree.c89 Indirect chain[], in get_branch() argument
93 Indirect *p = chain; in get_branch()
97 add_chain(chain, NULL, SYSV_I(inode)->i_data + *offsets); in get_branch()
106 if (!verify_chain(chain, p)) in get_branch()
174 Indirect chain[], in splice_branch() argument
182 if (!verify_chain(chain, where-1) || *where->p) in splice_branch()
212 Indirect chain[DEPTH]; in get_block() local
222 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
228 chain[depth-1].key)); in get_block()
230 partial = chain+depth-1; /* the whole chain */ in get_block()
[all …]
/linux-6.12.1/drivers/net/ethernet/toshiba/
Dspider_net.c59 "in tx chain");
270 * spider_net_free_chain - free descriptor chain
272 * @chain: address of chain
277 struct spider_net_descr_chain *chain) in spider_net_free_chain() argument
281 descr = chain->ring; in spider_net_free_chain()
286 } while (descr != chain->ring); in spider_net_free_chain()
288 dma_free_coherent(&card->pdev->dev, chain->num_desc * sizeof(struct spider_net_hw_descr), in spider_net_free_chain()
289 chain->hwring, chain->dma_addr); in spider_net_free_chain()
293 * spider_net_init_chain - alloc and link descriptor chain
295 * @chain: address of chain
[all …]

12345678910>>...57