| /linux-6.12.1/tools/net/sunrpc/xdrgen/generators/ |
| D | typedef.py | 18 def emit_typedef_declaration(environment: Environment, node: _XdrDeclaration) -> None:
20 if node.name not in public_apis:
22 if isinstance(node, _XdrBasic):
23 template = get_jinja2_template(environment, "declaration", node.template)
26 name=node.name,
27 type=kernel_c_type(node.spec),
28 classifier=node.spec.c_classifier,
31 elif isinstance(node, _XdrVariableLengthString):
32 template = get_jinja2_template(environment, "declaration", node.template)
33 print(template.render(name=node.name))
[all …]
|
| D | union.py | 15 def emit_union_declaration(environment: Environment, node: _XdrUnion) -> None:
17 if node.name in public_apis:
19 print(template.render(name=node.name))
23 environment: Environment, node: _XdrDeclaration
26 assert isinstance(node, _XdrBasic)
30 name=node.name,
31 type=node.spec.type_name,
32 classifier=node.spec.c_classifier,
38 environment: Environment, node: _XdrDeclaration
41 if isinstance(node.arm, _XdrVoid):
[all …]
|
| /linux-6.12.1/drivers/scsi/elx/libefc/ |
| D | efc_node.c | 14 struct efc_node *node = rnode->node; in efc_remote_node_cb() local
18 efc_node_post_event(node, event, NULL); in efc_remote_node_cb()
27 /* Find an FC node structure given the FC port ID */ in efc_node_find()
34 struct efc_node *node = container_of(arg, struct efc_node, ref); in _efc_node_free() local
35 struct efc *efc = node->efc; in _efc_node_free()
38 dma = &node->sparm_dma_buf; in _efc_node_free()
41 mempool_free(node, efc->node_pool); in _efc_node_free()
48 struct efc_node *node = NULL; in efc_node_alloc() local
53 efc_log_debug(efc, "node allocation when shutting down %06x", in efc_node_alloc()
58 node = mempool_alloc(efc->node_pool, GFP_ATOMIC); in efc_node_alloc()
[all …]
|
| D | efc_device.c | 8 * device_sm Node State Machine: Remote Device States
16 efc_d_send_prli_rsp(struct efc_node *node, u16 ox_id) in efc_d_send_prli_rsp() argument
19 struct efc *efc = node->efc; in efc_d_send_prli_rsp()
21 node->ls_acc_oxid = ox_id; in efc_d_send_prli_rsp()
22 node->send_ls_acc = EFC_NODE_SEND_LS_ACC_PRLI; in efc_d_send_prli_rsp()
29 if (node->init) { in efc_d_send_prli_rsp()
31 node->display_name, node->wwpn, node->wwnn); in efc_d_send_prli_rsp()
32 if (node->nport->enable_tgt) in efc_d_send_prli_rsp()
33 rc = efc->tt.scsi_new_node(efc, node); in efc_d_send_prli_rsp()
37 efc_node_post_event(node, EFC_EVT_NODE_SESS_REG_FAIL, NULL); in efc_d_send_prli_rsp()
[all …]
|
| D | efc_fabric.c | 8 * This file implements remote node state machines for:
16 * fabric_sm Node State Machine: Fabric States
17 * ns_sm Node State Machine: Name/Directory Services States
18 * p2p_sm Node State Machine: Point-to-Point Node States
24 efc_fabric_initiate_shutdown(struct efc_node *node) in efc_fabric_initiate_shutdown() argument
26 struct efc *efc = node->efc; in efc_fabric_initiate_shutdown()
28 node->els_io_enabled = false; in efc_fabric_initiate_shutdown()
30 if (node->attached) { in efc_fabric_initiate_shutdown()
33 /* issue hw node free; don't care if succeeds right away in efc_fabric_initiate_shutdown()
34 * or sometime later, will check node->attached later in in efc_fabric_initiate_shutdown()
[all …]
|
| /linux-6.12.1/fs/hfs/ |
| D | bnode.c | 9 * Handle basic btree node operations
18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
25 off += node->page_offset; in hfs_bnode_read()
30 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
32 page = node->page[pagenum]; in hfs_bnode_read()
42 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
46 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
50 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
54 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
58 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
[all …]
|
| D | brec.c | 18 /* Get the length and offset of the given record in the given node */
19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
25 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
38 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
40 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
[all …]
|
| /linux-6.12.1/scripts/gdb/linux/ |
| D | rbtree.py | 13 def inorder(node): argument
14 if node:
15 yield from inorder(node['rb_left'])
16 yield node
17 yield from inorder(node['rb_right'])
22 for node in rb_inorder_for_each(root):
23 yield utils.container_of(node, gdbtype, member)
27 node = root.address.cast(rb_root_type.get_type().pointer())
31 node = root['rb_node']
32 if node == 0:
[all …]
|
| /linux-6.12.1/scripts/dtc/ |
| D | checks.c | 29 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
62 struct node *node, in check_msg() argument
76 else if (node && node->srcpos) in check_msg()
77 pos = node->srcpos; in check_msg()
92 if (node) { in check_msg()
94 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name); in check_msg()
96 xasprintf_append(&str, "%s: ", node->fullpath); in check_msg()
106 pos = node->srcpos; in check_msg()
120 #define FAIL(c, dti, node, ...) \ argument
124 check_msg((c), dti, node, NULL, __VA_ARGS__); \
[all …]
|
| D | livetree.c | 88 struct node *build_node(struct property *proplist, struct node *children, in build_node()
91 struct node *new = xmalloc(sizeof(*new)); in build_node()
92 struct node *child; in build_node()
107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
119 struct node *name_node(struct node *node, const char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = xstrdup(name); in name_node()
125 return node; in name_node()
128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
[all …]
|
| /linux-6.12.1/include/linux/ |
| D | bootconfig.h | 50 /* XBC tree node */
67 /* Node tree access raw APIs */
69 int __init xbc_node_index(struct xbc_node *node);
70 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node);
71 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node);
72 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node);
73 const char * __init xbc_node_get_data(struct xbc_node *node);
76 * xbc_node_is_value() - Test the node is a value node
77 * @node: An XBC node.
79 * Test the @node is a value node and return true if a value node, false if not.
[all …]
|
| D | rbtree.h | 33 #define RB_EMPTY_NODE(node) \ argument
34 ((node)->__rb_parent_color == (unsigned long)(node))
35 #define RB_CLEAR_NODE(node) \ argument
36 ((node)->__rb_parent_color = (unsigned long)(node))
53 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
59 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
62 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
63 node->rb_left = node->rb_right = NULL; in rb_link_node()
65 *rb_link = node; in rb_link_node()
68 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, in rb_link_node_rcu() argument
[all …]
|
| /linux-6.12.1/fs/hfsplus/ |
| D | bnode.c | 9 * Handle basic btree node operations
21 /* Copy a specified range of bytes from the raw data of a node */
22 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
27 off += node->page_offset; in hfs_bnode_read()
28 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bnode_read()
41 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
45 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
49 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
53 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
57 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
[all …]
|
| D | brec.c | 19 /* Get the length and offset of the given record in the given node */
20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
25 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
26 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
39 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
[all …]
|
| /linux-6.12.1/lib/ |
| D | bootconfig.c | 40 * xbc_parse() parses the text to build a simple tree. Each tree node is
41 * simply a key word or a value. A key node may have a next key node or/and
42 * a child node (both key and value). A value node may have a next value
43 * node (for array).
112 * xbc_root_node() - Get the root node of extended boot config
114 * Return the address of root node of extended boot config. If the
126 * xbc_node_index() - Get the index of XBC node
127 * @node: A target node of getting index.
129 * Return the index number of @node in XBC node list.
131 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
[all …]
|
| /linux-6.12.1/fs/dlm/ |
| D | midcomms.c | 29 * Due the fact that dlm has pre-configured node addresses on every side
35 * application layer. The version field of every node will be set on these RCOM
36 * messages as soon as they arrived and the node isn't yet part of the nodes
47 * compatibility. A node cannot send anything to another node when a DLM_FIN
51 * manager removed the node from internal lists, at this point DLM does not
52 * send any message to the other node. There exists two cases:
160 * We could send a fence signal for a specific node to the cluster
185 /* counts how many lockspaces are using this node
187 * node wants to disconnect.
200 struct midcomms_node *node; member
[all …]
|
| /linux-6.12.1/drivers/net/ethernet/marvell/octeontx2/nic/ |
| D | qos.c | 44 static void otx2_qos_get_regaddr(struct otx2_qos_node *node, in otx2_qos_get_regaddr() argument
48 if (node->level == NIX_TXSCH_LVL_SMQ) { in otx2_qos_get_regaddr()
49 cfg->reg[index++] = NIX_AF_MDQX_PARENT(node->schq); in otx2_qos_get_regaddr()
50 cfg->reg[index++] = NIX_AF_MDQX_SCHEDULE(node->schq); in otx2_qos_get_regaddr()
51 cfg->reg[index++] = NIX_AF_MDQX_PIR(node->schq); in otx2_qos_get_regaddr()
52 cfg->reg[index] = NIX_AF_MDQX_CIR(node->schq); in otx2_qos_get_regaddr()
53 } else if (node->level == NIX_TXSCH_LVL_TL4) { in otx2_qos_get_regaddr()
54 cfg->reg[index++] = NIX_AF_TL4X_PARENT(node->schq); in otx2_qos_get_regaddr()
55 cfg->reg[index++] = NIX_AF_TL4X_SCHEDULE(node->schq); in otx2_qos_get_regaddr()
56 cfg->reg[index++] = NIX_AF_TL4X_PIR(node->schq); in otx2_qos_get_regaddr()
[all …]
|
| /linux-6.12.1/drivers/net/ethernet/mellanox/mlx5/core/en/ |
| D | htb.c | 36 struct mlx5e_qos_node *node = NULL; in mlx5e_htb_enumerate_leaves() local
39 hash_for_each(htb->qos_tc2node, bkt, node, hnode) { in mlx5e_htb_enumerate_leaves()
40 if (node->qid == MLX5E_QOS_QID_INNER) in mlx5e_htb_enumerate_leaves()
42 err = callback(data, node->qid, node->hw_id); in mlx5e_htb_enumerate_leaves()
73 struct mlx5e_qos_node *node; in mlx5e_htb_node_create_leaf() local
75 node = kzalloc(sizeof(*node), GFP_KERNEL); in mlx5e_htb_node_create_leaf()
76 if (!node) in mlx5e_htb_node_create_leaf()
79 node->parent = parent; in mlx5e_htb_node_create_leaf()
81 node->qid = qid; in mlx5e_htb_node_create_leaf()
84 node->classid = classid; in mlx5e_htb_node_create_leaf()
[all …]
|
| /linux-6.12.1/drivers/net/wireguard/ |
| D | allowedips.c | 23 static void copy_and_assign_cidr(struct allowedips_node *node, const u8 *src, in copy_and_assign_cidr() argument
26 node->cidr = cidr; in copy_and_assign_cidr()
27 node->bit_at_a = cidr / 8U; in copy_and_assign_cidr()
29 node->bit_at_a ^= (bits / 8U - 1U) % 8U; in copy_and_assign_cidr()
31 node->bit_at_b = 7U - (cidr % 8U); in copy_and_assign_cidr()
32 node->bitlen = bits; in copy_and_assign_cidr()
33 memcpy(node->bits, src, bits / 8U); in copy_and_assign_cidr()
36 static inline u8 choose(struct allowedips_node *node, const u8 *key) in choose() argument
38 return (key[node->bit_at_a] >> node->bit_at_b) & 1; in choose()
58 struct allowedips_node *node, *stack[MAX_ALLOWEDIPS_DEPTH] = { in root_free_rcu() local
[all …]
|
| /linux-6.12.1/kernel/bpf/ |
| D | bpf_lru_list.c | 42 static bool bpf_lru_node_is_ref(const struct bpf_lru_node *node) in bpf_lru_node_is_ref() argument
44 return READ_ONCE(node->ref); in bpf_lru_node_is_ref()
47 static void bpf_lru_node_clear_ref(struct bpf_lru_node *node) in bpf_lru_node_clear_ref() argument
49 WRITE_ONCE(node->ref, 0); in bpf_lru_node_clear_ref()
67 struct bpf_lru_node *node, in __bpf_lru_node_move_to_free() argument
71 if (WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(node->type))) in __bpf_lru_node_move_to_free()
74 /* If the removing node is the next_inactive_rotation candidate, in __bpf_lru_node_move_to_free()
77 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move_to_free()
80 bpf_lru_list_count_dec(l, node->type); in __bpf_lru_node_move_to_free()
82 node->type = tgt_free_type; in __bpf_lru_node_move_to_free()
[all …]
|
| D | lpm_trie.c | 19 /* Intermediate node */
49 * lead to more nodes containing more specific matches. Each node also stores
59 * As the trie is empty initially, the new node (1) will be places as root
60 * node, denoted as (R) in the example below. As there are no other node, both
70 * Next, let's add a new node (2) matching 192.168.0.0/24. As there is already
71 * a node with the same data and a smaller prefix (ie, a less specific one),
72 * node (2) will become a child of (1). In child index depends on the next bit
90 * The child[1] slot of (1) could be filled with another node which has bit #17
108 * Let's add another node (4) to the game for 192.168.1.0/24. In order to place
109 * it, node (1) is looked at first, and because (4) of the semantics laid out
[all …]
|
| /linux-6.12.1/fs/ocfs2/cluster/ |
| D | quorum.c | 12 * that a node is broken and should be recovered. They can't both recover each
17 * So we declare that a node which has given up on connecting to a majority
20 * There are huge opportunities for races here. After we give up on a node's
22 * to declare the node as truly dead. We also need to be careful with the
23 * race between when we see a node start heartbeating and when we connect
83 * go away as our node would be fenced externally before other nodes
115 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision()
126 * the lowest numbered node */ in o2quo_make_decision()
129 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision()
138 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision()
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/i915/gt/ |
| D | intel_gt_buffer_pool.c | 30 static void node_free(struct intel_gt_buffer_pool_node *node) in node_free() argument
32 i915_gem_object_put(node->obj); in node_free()
33 i915_active_fini(&node->active); in node_free()
34 kfree_rcu(node, rcu); in node_free()
39 struct intel_gt_buffer_pool_node *node, *stale = NULL; in pool_free_older_than() local
57 node = list_entry(pos, typeof(*node), link); in pool_free_older_than()
59 age = READ_ONCE(node->age); in pool_free_older_than()
63 /* Check we are the first to claim this node */ in pool_free_older_than()
64 if (!xchg(&node->age, 0)) in pool_free_older_than()
67 node->free = stale; in pool_free_older_than()
[all …]
|
| /linux-6.12.1/kernel/gcov/ |
| D | fs.c | 34 * @list: list head for child node list
37 * @parent: parent node
251 * Return a profiling data set associated with the given node. This is
255 static struct gcov_info *get_node_info(struct gcov_node *node) in get_node_info() argument
257 if (node->num_loaded > 0) in get_node_info()
258 return node->loaded_info[0]; in get_node_info()
260 return node->unloaded_info; in get_node_info()
265 * all profiling data associated with the given node.
267 static struct gcov_info *get_accumulated_info(struct gcov_node *node) in get_accumulated_info() argument
272 if (node->unloaded_info) in get_accumulated_info()
[all …]
|
| /linux-6.12.1/tools/include/linux/ |
| D | rbtree.h | 42 #define RB_EMPTY_NODE(node) \ argument
43 ((node)->__rb_parent_color == (unsigned long)(node))
44 #define RB_CLEAR_NODE(node) \ argument
45 ((node)->__rb_parent_color = (unsigned long)(node))
62 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
66 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
69 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
72 *rb_link = node; in rb_link_node()
112 * We do not cache the rightmost node based on footprint
[all …]
|