Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 3767) sorted by relevance

12345678910>>...151

/linux/drivers/scsi/elx/libefc/
H A Defc_device.c16 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()
40 efc_node_post_event(node, EFC_EVT_NODE_SESS_REG_OK, NULL); in efc_d_send_prli_rsp()
[all …]
H A Defc_node.c14 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()
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
58 node = mempool_alloc(efc->node_pool, GFP_ATOMIC); in efc_node_alloc()
59 if (!node) { in efc_node_alloc()
63 memset(node, 0, sizeof(*node)); in efc_node_alloc()
[all …]
H A Defc_fabric.c24 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()
37 rc = efc_cmd_node_detach(efc, &node->rnode); in efc_fabric_initiate_shutdown()
39 node_printf(node, "Failed freeing HW node, rc=%d\n", in efc_fabric_initiate_shutdown()
47 efc_node_initiate_cleanup(node); in efc_fabric_initiate_shutdown()
54 struct efc_node *node = NULL; in __efc_fabric_common() local
56 node = ctx->app; in __efc_fabric_common()
62 node->shutdown_reason = EFC_NODE_SHUTDOWN_DEFAULT; in __efc_fabric_common()
[all …]
/linux/tools/net/sunrpc/xdrgen/generators/
H A Dtypedef.py18 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, _XdrString):
32 template = get_jinja2_template(environment, "declaration", node.template)
33 print(template.render(name=node.name))
[all …]
H A Dunion.py15 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/fs/hfs/
H A Dbnode.c19 bool is_bnode_offset_valid(struct hfs_bnode *node, u32 off) in is_bnode_offset_valid() argument
21 bool is_valid = off < node->tree->node_size; in is_bnode_offset_valid()
27 node->this, node->type, node->height, in is_bnode_offset_valid()
28 node->tree->node_size, off); in is_bnode_offset_valid()
35 u32 check_and_correct_requested_length(struct hfs_bnode *node, u32 off, u32 len) in check_and_correct_requested_length() argument
39 if (!is_bnode_offset_valid(node, off)) in check_and_correct_requested_length()
42 node_size = node->tree->node_size; in check_and_correct_requested_length()
51 node->this, node->type, node->height, in check_and_correct_requested_length()
52 node->tree->node_size, off, len, new_len); in check_and_correct_requested_length()
60 void hfs_bnode_read(struct hfs_bnode *node, void *buf, u32 off, u32 len) in hfs_bnode_read() argument
[all …]
H A Dbrec.c19 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()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
[all …]
/linux/fs/dlm/
H A Dmidcomms.c200 struct midcomms_node *node; member
206 void (*ack_rcv)(struct midcomms_node *node);
254 const char *dlm_midcomms_state(struct midcomms_node *node) in dlm_midcomms_state() argument
256 return dlm_state_str(node->state); in dlm_midcomms_state()
259 unsigned long dlm_midcomms_flags(struct midcomms_node *node) in dlm_midcomms_flags() argument
261 return node->flags; in dlm_midcomms_flags()
264 int dlm_midcomms_send_queue_cnt(struct midcomms_node *node) in dlm_midcomms_send_queue_cnt() argument
266 return atomic_read(&node->send_queue_cnt); in dlm_midcomms_send_queue_cnt()
269 uint32_t dlm_midcomms_version(struct midcomms_node *node) in dlm_midcomms_version() argument
271 return node->version; in dlm_midcomms_version()
[all …]
/linux/scripts/dtc/
H A Dchecks.c29 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 …]
H A Dlivetree.c88 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/scripts/gdb/linux/
H A Drbtree.py13 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/fs/hfsplus/
H A Dbnode.c23 void hfs_bnode_read(struct hfs_bnode *node, void *buf, u32 off, u32 len) in hfs_bnode_read() argument
28 if (!is_bnode_offset_valid(node, off)) in hfs_bnode_read()
35 node->this, node->type, node->height, in hfs_bnode_read()
36 node->tree->node_size, off, len); in hfs_bnode_read()
40 len = check_and_correct_requested_length(node, off, len); in hfs_bnode_read()
42 off += node->page_offset; in hfs_bnode_read()
43 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bnode_read()
56 u16 hfs_bnode_read_u16(struct hfs_bnode *node, u32 off) in hfs_bnode_read_u16() argument
60 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
64 u8 hfs_bnode_read_u8(struct hfs_bnode *node, u32 off) in hfs_bnode_read_u8() argument
[all …]
H A Dbrec.c20 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()
44 recoff = hfs_bnode_read_u16(node, in hfs_brec_keylen()
[all …]
/linux/lib/
H A Dradix-tree.c100 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
103 __set_bit(offset, node->tags[tag]); in tag_set()
106 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
109 __clear_bit(offset, node->tags[tag]); in tag_clear()
112 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument
115 return test_bit(offset, node->tags[tag]); in tag_get()
152 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument
157 if (node->tags[tag][idx]) in any_tag_set()
163 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set() argument
165 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE); in all_tag_set()
[all …]
H A Dbootconfig.c131 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
133 return node - &xbc_nodes[0]; in xbc_node_index()
143 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node) in xbc_node_get_parent() argument
145 return node->parent == XBC_NODE_MAX ? NULL : &xbc_nodes[node->parent]; in xbc_node_get_parent()
155 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node) in xbc_node_get_child() argument
157 return node->child ? &xbc_nodes[node->child] : NULL; in xbc_node_get_child()
169 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node) in xbc_node_get_next() argument
171 return node->next ? &xbc_nodes[node->next] : NULL; in xbc_node_get_next()
181 const char * __init xbc_node_get_data(struct xbc_node *node) in xbc_node_get_data() argument
183 int offset = node->data & ~XBC_VALUE; in xbc_node_get_data()
[all …]
/linux/kernel/gcov/
H A Dfs.c255 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()
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()
273 info = gcov_info_dup(node->unloaded_info); in get_accumulated_info()
275 info = gcov_info_dup(node->loaded_info[i++]); in get_accumulated_info()
278 for (; i < node->num_loaded; i++) in get_accumulated_info()
279 gcov_info_add(info, node->loaded_info[i]); in get_accumulated_info()
[all …]
/linux/include/linux/
H A Drbtree.h33 #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))
87 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
90 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
91 node->rb_left = node->rb_right = NULL; in rb_link_node()
93 *rb_link = node; in rb_link_node()
96 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, in rb_link_node_rcu() argument
99 node->__rb_parent_color = (unsigned long)parent; in rb_link_node_rcu()
[all …]
/linux/drivers/phy/
H A Dphy-common-props-test.c18 struct fwnode_handle *node; in phy_test_rx_polarity_is_missing() local
22 node = fwnode_create_software_node(entries, NULL); in phy_test_rx_polarity_is_missing()
23 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, node); in phy_test_rx_polarity_is_missing()
25 ret = phy_get_manual_rx_polarity(node, "sgmii", &val); in phy_test_rx_polarity_is_missing()
29 fwnode_remove_software_node(node); in phy_test_rx_polarity_is_missing()
42 struct fwnode_handle *node; in phy_test_rx_polarity_more_values_than_names() local
46 node = fwnode_create_software_node(entries, NULL); in phy_test_rx_polarity_more_values_than_names()
47 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, node); in phy_test_rx_polarity_more_values_than_names()
49 ret = phy_get_manual_rx_polarity(node, "sgmii", &val); in phy_test_rx_polarity_more_values_than_names()
52 fwnode_remove_software_node(node); in phy_test_rx_polarity_more_values_than_names()
[all …]
/linux/drivers/net/wireguard/
H A Dallowedips.c23 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/drivers/gpu/drm/
H A Ddrm_mm.c108 static noinline void save_stack(struct drm_mm_node *node) in save_stack() argument
116 node->stack = stack_depot_save(entries, n, GFP_NOWAIT); in save_stack()
121 struct drm_mm_node *node; in show_leaks() local
128 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks()
129 if (!node->stack) { in show_leaks()
131 node->start, node->size); in show_leaks()
135 stack_depot_snprint(node->stack, buf, BUFSZ, 0); in show_leaks()
137 node->start, node->size, buf); in show_leaks()
146 static void save_stack(struct drm_mm_node *node) { } in save_stack() argument
150 #define START(node) ((node)->start) argument
[all …]
/linux/kernel/bpf/
H A Dbpf_lru_list.c34 static bool bpf_lru_node_is_ref(const struct bpf_lru_node *node) in bpf_lru_node_is_ref() argument
36 return READ_ONCE(node->ref); in bpf_lru_node_is_ref()
39 static void bpf_lru_node_clear_ref(struct bpf_lru_node *node) in bpf_lru_node_clear_ref() argument
41 WRITE_ONCE(node->ref, 0); in bpf_lru_node_clear_ref()
59 struct bpf_lru_node *node, in __bpf_lru_node_move_to_free() argument
63 if (WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(node->type))) in __bpf_lru_node_move_to_free()
69 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move_to_free()
72 bpf_lru_list_count_dec(l, node->type); in __bpf_lru_node_move_to_free()
74 node->type = tgt_free_type; in __bpf_lru_node_move_to_free()
75 list_move(&node->list, free_list); in __bpf_lru_node_move_to_free()
[all …]
/linux/rust/syn/gen/
H A Dvisit_mut.rs958 pub fn visit_abi_mut<V>(v: &mut V, node: &mut crate::Abi) in visit_abi_mut()
962 skip!(node.extern_token); in visit_abi_mut()
963 if let Some(it) = &mut node.name { in visit_abi_mut()
971 node: &mut crate::AngleBracketedGenericArguments, in visit_angle_bracketed_generic_arguments_mut()
976 skip!(node.colon2_token); in visit_angle_bracketed_generic_arguments_mut()
977 skip!(node.lt_token); in visit_angle_bracketed_generic_arguments_mut()
978 for mut el in Punctuated::pairs_mut(&mut node.args) { in visit_angle_bracketed_generic_arguments_mut()
982 skip!(node.gt_token); in visit_angle_bracketed_generic_arguments_mut()
986 pub fn visit_arm_mut<V>(v: &mut V, node: &mut crate::Arm) in visit_arm_mut()
990 v.visit_attributes_mut(&mut node.attrs); in visit_arm_mut()
[all …]
H A Dfold.rs1030 pub fn fold_abi<F>(f: &mut F, node: crate::Abi) -> crate::Abi in fold_abi()
1035 extern_token: node.extern_token, in fold_abi()
1036 name: (node.name).map(|it| f.fold_lit_str(it)), in fold_abi()
1043 node: crate::AngleBracketedGenericArguments, in fold_angle_bracketed_generic_arguments()
1049 colon2_token: node.colon2_token, in fold_angle_bracketed_generic_arguments()
1050 lt_token: node.lt_token, in fold_angle_bracketed_generic_arguments()
1051 args: crate::punctuated::fold(node.args, f, F::fold_generic_argument), in fold_angle_bracketed_generic_arguments()
1052 gt_token: node.gt_token, in fold_angle_bracketed_generic_arguments()
1057 pub fn fold_arm<F>(f: &mut F, node: crate::Arm) -> crate::Arm in fold_arm()
1062 attrs: f.fold_attributes(node.attrs), in fold_arm()
[all …]
/linux/drivers/net/ethernet/marvell/octeontx2/nic/
H A Dqos.c44 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/tools/include/linux/
H A Drbtree.h42 #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))
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()
129 static inline void rb_insert_color_cached(struct rb_node *node, in rb_insert_color_cached() argument
134 root->rb_leftmost = node; in rb_insert_color_cached()
[all …]

12345678910>>...151