Home
last modified time | relevance | path

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

12345678910>>...120

/Linux-v4.19/arch/mips/include/asm/netlogic/xlp-hal/
Diomap.h50 #define XLP_IO_DEV(node, dev) ((dev) + (node) * 8) argument
53 #define XLP_HDR_OFFSET(node, bus, dev, fn) \ argument
54 XLP_IO_PCI_OFFSET(bus, XLP_IO_DEV(node, dev), fn)
56 #define XLP_IO_BRIDGE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 0) argument
58 #define XLP_IO_CIC0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 1) argument
59 #define XLP_IO_CIC1_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 2) argument
60 #define XLP_IO_CIC2_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 3) argument
61 #define XLP_IO_PIC_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 4) argument
63 #define XLP_IO_PCIE_OFFSET(node, i) XLP_HDR_OFFSET(node, 0, 1, i) argument
64 #define XLP_IO_PCIE0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 1, 0) argument
[all …]
/Linux-v4.19/fs/hfs/
Dbnode.c18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, in hfs_bnode_read() argument
23 off += node->page_offset; in hfs_bnode_read()
24 page = node->page[0]; in hfs_bnode_read()
30 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
34 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
38 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
42 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
46 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
51 tree = node->tree; in hfs_bnode_read_key()
52 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
[all …]
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-v4.19/scripts/dtc/
Dchecks.c43 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
76 struct node *node, in check_msg() argument
88 if (node) { in check_msg()
89 fprintf(stderr, "%s", node->fullpath); in check_msg()
100 #define FAIL(c, dti, node, ...) \ argument
104 check_msg((c), dti, node, NULL, __VA_ARGS__); \
107 #define FAIL_PROP(c, dti, node, prop, ...) \ argument
111 check_msg((c), dti, node, prop, __VA_ARGS__); \
115 static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) in check_nodes_props() argument
117 struct node *child; in check_nodes_props()
[all …]
Dlivetree.c100 struct node *build_node(struct property *proplist, struct node *children) in build_node()
102 struct node *new = xmalloc(sizeof(*new)); in build_node()
103 struct node *child; in build_node()
117 struct node *build_node_delete(void) in build_node_delete()
119 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
128 struct node *name_node(struct node *node, char *name) in name_node() argument
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
134 return node; in name_node()
137 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
[all …]
Ddtc.h154 struct node { struct
158 struct node *children; argument
160 struct node *parent; argument
161 struct node *next_sibling; argument
204 struct node *build_node(struct property *proplist, struct node *children);
205 struct node *build_node_delete(void);
206 struct node *name_node(struct node *node, char *name);
207 struct node *omit_node_if_unused(struct node *node);
208 struct node *reference_node(struct node *node);
209 struct node *chain_node(struct node *first, struct node *list);
[all …]
/Linux-v4.19/kernel/gcov/
Dfs.c146 static struct gcov_info *get_node_info(struct gcov_node *node) in get_node_info() argument
148 if (node->num_loaded > 0) in get_node_info()
149 return node->loaded_info[0]; in get_node_info()
151 return node->unloaded_info; in get_node_info()
158 static struct gcov_info *get_accumulated_info(struct gcov_node *node) in get_accumulated_info() argument
163 if (node->unloaded_info) in get_accumulated_info()
164 info = gcov_info_dup(node->unloaded_info); in get_accumulated_info()
166 info = gcov_info_dup(node->loaded_info[i++]); in get_accumulated_info()
169 for (; i < node->num_loaded; i++) in get_accumulated_info()
170 gcov_info_add(info, node->loaded_info[i]); in get_accumulated_info()
[all …]
/Linux-v4.19/fs/hfsplus/
Dbnode.c22 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()
43 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
47 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
51 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
55 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
59 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
64 tree = node->tree; in hfs_bnode_read_key()
65 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
[all …]
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-v4.19/lib/
Dradix-tree.c106 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() argument
108 void __rcu **ptr = node; in is_sibling_entry()
114 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() argument
152 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
155 __set_bit(offset, node->tags[tag]); in tag_set()
158 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
161 __clear_bit(offset, node->tags[tag]); in tag_clear()
164 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument
167 return test_bit(offset, node->tags[tag]); in tag_get()
204 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument
[all …]
Dtimerqueue.c40 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add() argument
47 WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node)); in timerqueue_add()
51 ptr = rb_entry(parent, struct timerqueue_node, node); in timerqueue_add()
52 if (node->expires < ptr->expires) in timerqueue_add()
57 rb_link_node(&node->node, parent, p); in timerqueue_add()
58 rb_insert_color(&node->node, &head->head); in timerqueue_add()
60 if (!head->next || node->expires < head->next->expires) { in timerqueue_add()
61 head->next = node; in timerqueue_add()
77 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del() argument
79 WARN_ON_ONCE(RB_EMPTY_NODE(&node->node)); in timerqueue_del()
[all …]
Dbtree.c97 unsigned long *node; in btree_node_alloc() local
99 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
100 if (likely(node)) in btree_node_alloc()
101 memset(node, 0, NODESIZE); in btree_node_alloc()
102 return node; in btree_node_alloc()
150 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
152 return &node[n * geo->keylen]; in bkey()
155 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() argument
157 return (void *)node[geo->no_longs + n]; in bval()
160 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey() argument
[all …]
Drbtree.c97 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
101 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
104 *leftmost = node; in __rb_insert()
116 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
149 node = gparent; in __rb_insert()
150 parent = rb_parent(node); in __rb_insert()
151 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
156 if (node == tmp) { in __rb_insert()
170 tmp = node->rb_left; in __rb_insert()
172 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
[all …]
/Linux-v4.19/net/hsr/
Dhsr_framereg.c62 struct hsr_node *node; in hsr_addr_is_self() local
64 node = list_first_or_null_rcu(&hsr->self_node_db, struct hsr_node, in hsr_addr_is_self()
66 if (!node) { in hsr_addr_is_self()
71 if (ether_addr_equal(addr, node->MacAddressA)) in hsr_addr_is_self()
73 if (ether_addr_equal(addr, node->MacAddressB)) in hsr_addr_is_self()
84 struct hsr_node *node; in find_node_by_AddrA() local
86 list_for_each_entry_rcu(node, node_db, mac_list) { in find_node_by_AddrA()
87 if (ether_addr_equal(node->MacAddressA, addr)) in find_node_by_AddrA()
88 return node; in find_node_by_AddrA()
102 struct hsr_node *node, *oldnode; in hsr_create_self_node() local
[all …]
/Linux-v4.19/kernel/bpf/
Dbpf_lru_list.c45 static bool bpf_lru_node_is_ref(const struct bpf_lru_node *node) in bpf_lru_node_is_ref() argument
47 return node->ref; in bpf_lru_node_is_ref()
65 struct bpf_lru_node *node, in __bpf_lru_node_move_to_free() argument
69 if (WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(node->type))) in __bpf_lru_node_move_to_free()
75 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move_to_free()
78 bpf_lru_list_count_dec(l, node->type); in __bpf_lru_node_move_to_free()
80 node->type = tgt_free_type; in __bpf_lru_node_move_to_free()
81 list_move(&node->list, free_list); in __bpf_lru_node_move_to_free()
86 struct bpf_lru_node *node, in __bpf_lru_node_move_in() argument
89 if (WARN_ON_ONCE(!IS_LOCAL_LIST_TYPE(node->type)) || in __bpf_lru_node_move_in()
[all …]
Dlpm_trie.c168 const struct lpm_trie_node *node, in longest_prefix_match() argument
177 b = 8 - fls(node->data[i] ^ key->data[i]); in longest_prefix_match()
180 if (prefixlen >= node->prefixlen || prefixlen >= key->prefixlen) in longest_prefix_match()
181 return min(node->prefixlen, key->prefixlen); in longest_prefix_match()
194 struct lpm_trie_node *node, *found = NULL; in trie_lookup_elem() local
199 for (node = rcu_dereference(trie->root); node;) { in trie_lookup_elem()
207 matchlen = longest_prefix_match(trie, node, key); in trie_lookup_elem()
209 found = node; in trie_lookup_elem()
217 if (matchlen < node->prefixlen) in trie_lookup_elem()
223 if (!(node->flags & LPM_TREE_NODE_FLAG_IM)) in trie_lookup_elem()
[all …]
/Linux-v4.19/arch/ia64/mm/
Ddiscontig.c56 #define NODEDATA_ALIGN(addr, node) \ argument
58 (((node)*PERCPU_PAGE_SIZE) & (MAX_NODE_ALIGN_OFFSET - 1)))
73 int node) in build_node_maps() argument
80 if (!mem_data[node].min_pfn) { in build_node_maps()
81 mem_data[node].min_pfn = spfn; in build_node_maps()
82 mem_data[node].max_pfn = epfn; in build_node_maps()
84 mem_data[node].min_pfn = min(spfn, mem_data[node].min_pfn); in build_node_maps()
85 mem_data[node].max_pfn = max(epfn, mem_data[node].max_pfn); in build_node_maps()
99 static int __meminit early_nr_cpus_node(int node) in early_nr_cpus_node() argument
104 if (node == node_cpuid[cpu].nid) in early_nr_cpus_node()
[all …]
/Linux-v4.19/drivers/gpu/drm/
Ddrm_mm.c106 static noinline void save_stack(struct drm_mm_node *node) in save_stack() argument
121 node->stack = depot_save_stack(&trace, GFP_NOWAIT); in save_stack()
126 struct drm_mm_node *node; in show_leaks() local
134 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks()
140 if (!node->stack) { in show_leaks()
142 node->start, node->size); in show_leaks()
146 depot_fetch_stack(node->stack, &trace); in show_leaks()
149 node->start, node->size, buf); in show_leaks()
158 static void save_stack(struct drm_mm_node *node) { } in save_stack() argument
162 #define START(node) ((node)->start) argument
[all …]
/Linux-v4.19/tools/lib/
Drbtree.c72 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
75 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
86 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
111 node = gparent; in __rb_insert()
112 parent = rb_parent(node); in __rb_insert()
113 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
118 if (node == tmp) { in __rb_insert()
131 parent->rb_right = tmp = node->rb_left; in __rb_insert()
132 node->rb_left = parent; in __rb_insert()
136 rb_set_parent_color(parent, node, RB_RED); in __rb_insert()
[all …]
/Linux-v4.19/tools/perf/tests/
Dhists_output.c96 struct rb_node *node; in del_hist_entries() local
106 node = rb_first(root_out); in del_hist_entries()
108 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
109 rb_erase(node, root_out); in del_hist_entries()
130 struct rb_node *node; in test1() local
165 node = rb_first(root); in test1()
166 he = rb_entry(node, struct hist_entry, rb_node); in test1()
171 node = rb_next(node); in test1()
172 he = rb_entry(node, struct hist_entry, rb_node); in test1()
177 node = rb_next(node); in test1()
[all …]
/Linux-v4.19/arch/sparc/prom/
Dtree_32.c24 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 …]
Dtree_64.c20 static phandle prom_node_to_node(const char *type, phandle node) in prom_node_to_node() argument
27 args[3] = (unsigned int) node; in prom_node_to_node()
38 inline phandle __prom_getchild(phandle node) in __prom_getchild() argument
40 return prom_node_to_node("child", node); in __prom_getchild()
43 phandle prom_getchild(phandle node) in prom_getchild() argument
47 if ((s32)node == -1) in prom_getchild()
49 cnode = __prom_getchild(node); in prom_getchild()
56 inline phandle prom_getparent(phandle node) in prom_getparent() argument
60 if ((s32)node == -1) in prom_getparent()
62 cnode = prom_node_to_node("parent", node); in prom_getparent()
[all …]
/Linux-v4.19/include/linux/
Dinterval_tree_generic.h45 static inline ITTYPE ITPREFIX ## _compute_subtree_last(ITSTRUCT *node) \
47 ITTYPE max = ITLAST(node), subtree_last; \
48 if (node->ITRB.rb_left) { \
49 subtree_last = rb_entry(node->ITRB.rb_left, \
54 if (node->ITRB.rb_right) { \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
68 ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, \
72 ITTYPE start = ITSTART(node), last = ITLAST(node); \
89 node->ITSUBTREE = last; \
90 rb_link_node(&node->ITRB, rb_parent, link); \
[all …]
/Linux-v4.19/include/drm/
Ddrm_vma_manager.h60 struct drm_vma_offset_node *node, unsigned long pages);
62 struct drm_vma_offset_node *node);
64 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
65 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
67 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
87 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
89 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
90 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
135 static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) in drm_vma_node_reset() argument
137 memset(node, 0, sizeof(*node)); in drm_vma_node_reset()
[all …]
/Linux-v4.19/arch/x86/platform/olpc/
Dolpc_dt.c27 static phandle __init olpc_dt_getsibling(phandle node) in olpc_dt_getsibling() argument
29 const void *args[] = { (void *)node }; in olpc_dt_getsibling()
30 void *res[] = { &node }; in olpc_dt_getsibling()
32 if ((s32)node == -1) in olpc_dt_getsibling()
35 if (olpc_ofw("peer", args, res) || (s32)node == -1) in olpc_dt_getsibling()
38 return node; in olpc_dt_getsibling()
41 static phandle __init olpc_dt_getchild(phandle node) in olpc_dt_getchild() argument
43 const void *args[] = { (void *)node }; in olpc_dt_getchild()
44 void *res[] = { &node }; in olpc_dt_getchild()
46 if ((s32)node == -1) in olpc_dt_getchild()
[all …]

12345678910>>...120