| /linux/drivers/scsi/elx/libefc/ |
| H A D | efc_device.c | 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()
40 efc_node_post_event(node, EFC_EVT_NODE_SESS_REG_OK, NULL); in efc_d_send_prli_rsp()
[all …]
|
| H A 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()
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 D | efc_fabric.c | 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()
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/scripts/gdb/linux/ |
| H A 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/fs/dlm/ |
| H A D | midcomms.c | 200 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/kernel/gcov/ |
| H A D | fs.c | 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()
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/lib/ |
| H A D | radix-tree.c | 100 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 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
131 xbc_node_index(struct xbc_node * node) xbc_node_index() argument
143 xbc_node_get_parent(struct xbc_node * node) xbc_node_get_parent() argument
155 xbc_node_get_child(struct xbc_node * node) xbc_node_get_child() argument
169 xbc_node_get_next(struct xbc_node * node) xbc_node_get_next() argument
181 xbc_node_get_data(struct xbc_node * node) xbc_node_get_data() argument
192 xbc_node_match_prefix(struct xbc_node * node,const char ** prefix) xbc_node_match_prefix() argument
222 struct xbc_node *node; xbc_node_find_subkey() local
260 struct xbc_node *node = xbc_node_find_subkey(parent, key); xbc_node_find_value() local
292 xbc_node_compose_key_after(struct xbc_node * root,struct xbc_node * node,char * buf,size_t size) xbc_node_compose_key_after() argument
341 xbc_node_find_next_leaf(struct xbc_node * root,struct xbc_node * node) xbc_node_find_next_leaf() argument
410 xbc_init_node(struct xbc_node * node,char * data,uint32_t flag) xbc_init_node() argument
426 struct xbc_node *node; xbc_add_node() local
438 xbc_last_sibling(struct xbc_node * node) xbc_last_sibling() argument
446 xbc_last_child(struct xbc_node * node) xbc_last_child() argument
456 struct xbc_node *sib, *node = xbc_add_node(data, flag); __xbc_add_sibling() local
493 struct xbc_node *node = xbc_add_sibling(data, flag); xbc_add_child() local
612 struct xbc_node *node; xbc_parse_array() local
635 find_match_node(struct xbc_node * node,char * k) find_match_node() argument
647 struct xbc_node *node, *child; __xbc_add_key() local
[all...] |
| H A D | btree.c | 94 unsigned long *node; in btree_node_alloc() local
96 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
97 if (likely(node)) in btree_node_alloc()
98 memset(node, 0, NODESIZE); in btree_node_alloc()
99 return node; in btree_node_alloc()
147 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
149 return &node[n * geo->keylen]; in bkey()
152 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() argument
154 return (void *)node[geo->no_longs + n]; in bval()
157 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey() argument
[all …]
|
| H A D | rbtree.c | 85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
100 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
133 node = gparent; in __rb_insert()
134 parent = rb_parent(node); in __rb_insert()
135 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
140 if (node == tmp) { in __rb_insert()
154 tmp = node->rb_left; in __rb_insert()
156 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
160 rb_set_parent_color(parent, node, RB_RED); in __rb_insert()
[all …]
|
| /linux/include/linux/ |
| H A 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))
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/tools/net/sunrpc/xdrgen/generators/ |
| H A 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
[all...] |
| /linux/tools/include/linux/ |
| H A 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))
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 …]
|
| /linux/drivers/net/ethernet/marvell/octeontx2/nic/ |
| H A 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/rust/syn/gen/ |
| H A D | visit_mut.rs | 958 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 D | fold.rs | 1030 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 …]
|
| H A D | visit.rs | 950 pub fn visit_abi<'ast, V>(v: &mut V, node: &'ast crate::Abi) in visit_abi()
954 skip!(node.extern_token); in visit_abi()
955 if let Some(it) = &node.name { in visit_abi()
963 node: &'ast crate::AngleBracketedGenericArguments, in visit_angle_bracketed_generic_arguments()
968 skip!(node.colon2_token); in visit_angle_bracketed_generic_arguments()
969 skip!(node.lt_token); in visit_angle_bracketed_generic_arguments()
970 for el in Punctuated::pairs(&node.args) { in visit_angle_bracketed_generic_arguments()
974 skip!(node.gt_token); in visit_angle_bracketed_generic_arguments()
978 pub fn visit_arm<'ast, V>(v: &mut V, node: &'ast crate::Arm) in visit_arm()
982 for it in &node.attrs { in visit_arm()
[all …]
|
| /linux/net/hsr/ |
| H A D | hsr_framereg.c | 39 WARN_ONCE(1, "HSR: No self node\n");
56 struct hsr_node *node; in hsr_addr_is_self()
58 list_for_each_entry_rcu(node, node_db, mac_list) { in hsr_addr_is_self()
59 if (ether_addr_equal(node->macaddress_A, addr)) in hsr_addr_is_self()
60 return node; in hsr_addr_is_self()
66 /* Check if node for a given MAC address is already present in data base in hsr_addr_is_self()
112 static void hsr_free_node(struct hsr_node *node) in hsr_create_self_node()
114 xa_destroy(&node->seq_blocks); in hsr_create_self_node()
115 kfree(node->block_buf); in hsr_create_self_node()
116 kfree(node);
73 struct hsr_node *node; find_node_by_addr_A() local
131 struct hsr_node *node; hsr_del_nodes() local
139 prp_handle_san_frame(bool san,enum hsr_port_type port,struct hsr_node * node) prp_handle_san_frame() argument
161 struct hsr_node *new_node, *node; hsr_add_node() local
206 prp_update_san_info(struct hsr_node * node,bool is_sup) prp_update_san_info() argument
222 struct hsr_node *node; hsr_get_node() local
416 hsr_addr_subst_source(struct hsr_node * node,struct sk_buff * skb) hsr_addr_subst_source() argument
466 hsr_register_frame_in(struct hsr_node * node,struct hsr_port * port,u16 sequence_nr) hsr_register_frame_in() argument
491 struct hsr_node *node = frame->node_src; hsr_register_frame_out() local
531 struct hsr_node *node; prp_register_frame_out() local
596 get_late_port(struct hsr_priv * hsr,struct hsr_node * node) get_late_port() argument
621 struct hsr_node *node; hsr_prune_nodes() local
690 struct hsr_node *node; hsr_prune_proxy_nodes() local
724 struct hsr_node *node; hsr_get_next_node() local
752 struct hsr_node *node; hsr_get_node_data() local
[all...] |
| /linux/drivers/net/ethernet/mellanox/mlx5/core/en/ |
| H A 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/kernel/bpf/ |
| H A D | lpm_trie.c | 21 /* Intermediate node */
51 * lead to more nodes containing more specific matches. Each node also stores
61 * As the trie is empty initially, the new node (1) will be places as root
62 * node, denoted as (R) in the example below. As there are no other node, both
72 * Next, let's add a new node (2) matching 192.168.0.0/24. As there is already
73 * a node with the same data and a smaller prefix (ie, a less specific one),
74 * node (2) will become a child of (1). In child index depends on the next bit
92 * The child[1] slot of (1) could be filled with another node which has bit #17
110 * Let's add another node (
168 __longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) __longest_prefix_match() argument
230 longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) longest_prefix_match() argument
240 struct lpm_trie_node *node, *found = NULL; trie_lookup_elem() local
294 struct lpm_trie_node *node; lpm_trie_node_alloc() local
325 struct lpm_trie_node *node, *im_node, *new_node; trie_update_elem() local
461 struct lpm_trie_node *node, *parent; trie_delete_elem() local
614 struct lpm_trie_node *node; trie_free() local
655 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; trie_get_next_key() local
[all...] |
| /linux/tools/lib/ |
| H A D | rbtree.c | 18 * 1) A node is either red or black
21 * 4) Both children of every red node are black
26 * consecutive red nodes in a path and every red node is therefore followed by
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
92 * Loop invariant: node is red. in __rb_insert()
96 * The inserted node is root. Either this is the in __rb_insert()
97 * first node, or we recursed at Case 1 below and in __rb_insert()
100 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
119 * Case 1 - node' in __rb_insert()
230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; ____rb_erase_color() local
423 dummy_propagate(struct rb_node * node,struct rb_node * stop) dummy_propagate() argument
433 rb_insert_color(struct rb_node * node,struct rb_root * root) rb_insert_color() argument
438 rb_erase(struct rb_node * node,struct rb_root * root) rb_erase() argument
453 __rb_insert_augmented(struct rb_node * node,struct rb_root * root,void (* augment_rotate)(struct rb_node * old,struct rb_node * new)) __rb_insert_augmented() argument
486 rb_next(const struct rb_node * node) rb_next() argument
517 rb_prev(const struct rb_node * node) rb_prev() argument
561 rb_left_deepest_node(const struct rb_node * node) rb_left_deepest_node() argument
573 rb_next_postorder(const struct rb_node * node) rb_next_postorder() argument
[all...] |
| /linux/drivers/base/test/ |
| H A D | property-entry-test.c | 20 struct fwnode_handle *node; in pe_test_uints() local
27 node = fwnode_create_software_node(entries, NULL); in pe_test_uints()
28 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, node); in pe_test_uints()
30 error = fwnode_property_count_u8(node, "prop-u8"); in pe_test_uints()
33 error = fwnode_property_read_u8(node, "prop-u8", &val_u8); in pe_test_uints()
37 error = fwnode_property_read_u8_array(node, "prop-u8", array_u8, 1); in pe_test_uints()
41 error = fwnode_property_read_u8_array(node, "prop-u8", array_u8, 2); in pe_test_uints()
44 error = fwnode_property_read_u8(node, "no-prop-u8", &val_u8); in pe_test_uints()
47 error = fwnode_property_read_u8_array(node, "no-prop-u8", array_u8, 1); in pe_test_uints()
50 error = fwnode_property_read_u16(node, "prop-u16", &val_u16); in pe_test_uints()
[all …]
|
| /linux/drivers/gpu/drm/amd/amdkfd/ |
| H A D | kfd_interrupt.c | 53 int kfd_interrupt_init(struct kfd_node *node) in kfd_interrupt_init() argument
57 r = kfifo_alloc(&node->ih_fifo, in kfd_interrupt_init()
58 KFD_IH_NUM_ENTRIES * node->kfd->device_info.ih_ring_entry_size, in kfd_interrupt_init()
61 dev_err(node->adev->dev, "Failed to allocate IH fifo\n"); in kfd_interrupt_init()
65 if (!node->kfd->ih_wq) { in kfd_interrupt_init()
66 node->kfd->ih_wq = alloc_workqueue("KFD IH", WQ_HIGHPRI | WQ_UNBOUND, in kfd_interrupt_init()
67 node->kfd->num_nodes); in kfd_interrupt_init()
68 if (unlikely(!node->kfd->ih_wq)) { in kfd_interrupt_init()
69 kfifo_free(&node->ih_fifo); in kfd_interrupt_init()
70 dev_err(node->adev->dev, "Failed to allocate KFD IH workqueue\n"); in kfd_interrupt_init()
[all …]
|
| /linux/arch/sparc/prom/ |
| H A D | tree_32.c | 24 static phandle __prom_getchild(phandle node) in __prom_getchild() argument
30 cnode = prom_nodeops->no_child(node); in __prom_getchild()
40 phandle prom_getchild(phandle node) in prom_getchild() argument
44 if ((s32)node == -1) in prom_getchild()
47 cnode = __prom_getchild(node); in prom_getchild()
56 static phandle __prom_getsibling(phandle node) in __prom_getsibling() argument
62 cnode = prom_nodeops->no_nextnode(node); in __prom_getsibling()
72 phandle prom_getsibling(phandle node) in prom_getsibling() argument
76 if ((s32)node == -1) in prom_getsibling()
79 sibnode = __prom_getsibling(node); in prom_getsibling()
[all …]
|
| /linux/include/drm/ |
| H A D | drm_vma_manager.h | 72 struct drm_vma_offset_node *node, unsigned long pages);
74 struct drm_vma_offset_node *node);
76 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
77 int drm_vma_node_allow_once(struct drm_vma_offset_node *node, struct drm_file *tag);
78 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
80 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
100 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
102 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
103 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
148 static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) in drm_vma_node_reset() argument
[all …]
|