| /kernel/linux/linux-4.19/arch/mips/include/asm/netlogic/xlp-hal/ |
| D | iomap.h | 50 #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 …]
|
| /kernel/linux/linux-5.10/arch/mips/include/asm/netlogic/xlp-hal/ |
| D | iomap.h | 50 #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 …]
|
| /kernel/linux/linux-5.10/fs/hfs/ |
| D | bnode.c | 18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
26 off += node->page_offset; in hfs_bnode_read()
31 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
33 page = node->page[pagenum]; in hfs_bnode_read()
45 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
49 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
53 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
57 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
61 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
66 tree = node->tree; in hfs_bnode_read_key()
[all …]
|
| /kernel/linux/linux-4.19/fs/hfs/ |
| D | bnode.c | 18 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 …]
|
| D | brec.c | 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()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
[all …]
|
| /kernel/linux/linux-5.10/scripts/gdb/linux/ |
| D | rbtree.py | 15 node = root.address.cast(rb_root_type.get_type().pointer())
19 node = root['rb_node']
20 if node == 0:
23 while node['rb_left']:
24 node = node['rb_left']
26 return node
31 node = root.address.cast(rb_root_type.get_type().pointer())
35 node = root['rb_node']
36 if node == 0:
39 while node['rb_right']:
[all …]
|
| /kernel/linux/linux-5.10/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()
119 #define FAIL(c, dti, node, ...) \ argument
123 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, char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = 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 …]
|
| /kernel/linux/linux-4.19/scripts/dtc/ |
| D | checks.c | 43 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 …]
|
| D | livetree.c | 100 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 …]
|
| /kernel/linux/linux-4.19/kernel/gcov/ |
| D | fs.c | 146 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 …]
|
| /kernel/linux/linux-5.10/kernel/gcov/ |
| D | fs.c | 145 static struct gcov_info *get_node_info(struct gcov_node *node) in get_node_info() argument
147 if (node->num_loaded > 0) in get_node_info()
148 return node->loaded_info[0]; in get_node_info()
150 return node->unloaded_info; in get_node_info()
157 static struct gcov_info *get_accumulated_info(struct gcov_node *node) in get_accumulated_info() argument
162 if (node->unloaded_info) in get_accumulated_info()
163 info = gcov_info_dup(node->unloaded_info); in get_accumulated_info()
165 info = gcov_info_dup(node->loaded_info[i++]); in get_accumulated_info()
168 for (; i < node->num_loaded; i++) in get_accumulated_info()
169 gcov_info_add(info, node->loaded_info[i]); in get_accumulated_info()
[all …]
|
| /kernel/linux/linux-4.19/fs/hfsplus/ |
| D | bnode.c | 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()
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 …]
|
| /kernel/linux/linux-5.10/fs/hfsplus/ |
| D | bnode.c | 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()
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 …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | radix-tree.c | 98 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
101 __set_bit(offset, node->tags[tag]); in tag_set()
104 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
107 __clear_bit(offset, node->tags[tag]); in tag_clear()
110 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument
113 return test_bit(offset, node->tags[tag]); in tag_get()
150 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument
155 if (node->tags[tag][idx]) in any_tag_set()
161 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set() argument
163 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE); in all_tag_set()
[all …]
|
| D | bootconfig.c | 65 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
67 return node - &xbc_nodes[0]; in xbc_node_index()
77 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node) in xbc_node_get_parent() argument
79 return node->parent == XBC_NODE_MAX ? NULL : &xbc_nodes[node->parent]; in xbc_node_get_parent()
89 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node) in xbc_node_get_child() argument
91 return node->child ? &xbc_nodes[node->child] : NULL; in xbc_node_get_child()
103 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node) in xbc_node_get_next() argument
105 return node->next ? &xbc_nodes[node->next] : NULL; in xbc_node_get_next()
115 const char * __init xbc_node_get_data(struct xbc_node *node) in xbc_node_get_data() argument
117 int offset = node->data & ~XBC_VALUE; in xbc_node_get_data()
[all …]
|
| /kernel/linux/linux-5.10/drivers/net/wireguard/ |
| D | allowedips.c | 21 static void copy_and_assign_cidr(struct allowedips_node *node, const u8 *src, in copy_and_assign_cidr() argument
24 node->cidr = cidr; in copy_and_assign_cidr()
25 node->bit_at_a = cidr / 8U; in copy_and_assign_cidr()
27 node->bit_at_a ^= (bits / 8U - 1U) % 8U; in copy_and_assign_cidr()
29 node->bit_at_b = 7U - (cidr % 8U); in copy_and_assign_cidr()
30 node->bitlen = bits; in copy_and_assign_cidr()
31 memcpy(node->bits, src, bits / 8U); in copy_and_assign_cidr()
34 static inline u8 choose(struct allowedips_node *node, const u8 *key) in choose() argument
36 return (key[node->bit_at_a] >> node->bit_at_b) & 1; in choose()
55 struct allowedips_node *node, *stack[128] = { in root_free_rcu() local
[all …]
|
| /kernel/linux/linux-4.19/lib/ |
| D | radix-tree.c | 106 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 …]
|
| /kernel/linux/linux-4.19/net/hsr/ |
| D | hsr_framereg.c | 62 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 …]
|
| /kernel/linux/linux-5.10/fs/hmdfs/comm/ |
| D | connection.c | 81 body->case_sensitive = conn_impl->node->sbi->s_case_sensitive; in hs_fill_case_sense_data()
88 __u8 sensitive = conn_impl->node->sbi->s_case_sensitive ? 1 : 0; in hs_parse_case_sense_data()
111 body->features = cpu_to_le64(conn_impl->node->sbi->s_features); in hs_fill_feature_data()
125 conn_impl->node->features = le64_to_cpu(body->features); in hs_parse_feature_data()
286 data_len, conn_impl->node->device_id); in hs_proc_msg_data()
295 req_len, data_len, conn_impl->node->device_id); in hs_proc_msg_data()
306 ops, data_len, conn_impl->node->device_id, hs_req->len); in hs_proc_msg_data()
365 (conn_impl->node->version >= DFS_2_0)) { in do_send_handshake()
383 (conn_impl->node->version >= DFS_2_0)) { in do_send_handshake()
411 static int hmdfs_node_waiting_evt_sum(const struct hmdfs_peer *node) in hmdfs_node_waiting_evt_sum() argument
[all …]
|
| /kernel/linux/linux-4.19/kernel/bpf/ |
| D | bpf_lru_list.c | 45 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 …]
|
| D | lpm_trie.c | 168 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 …]
|
| /kernel/linux/linux-5.10/drivers/block/zram/zram_group/ |
| D | zlist.c | 25 static inline void zlist_node_lock(struct zlist_node *node) in zlist_node_lock() argument
27 bit_spin_lock(ZLIST_LOCK_BIT, (unsigned long *)node); in zlist_node_lock()
30 static inline void zlist_node_unlock(struct zlist_node *node) in zlist_node_unlock() argument
32 bit_spin_unlock(ZLIST_LOCK_BIT, (unsigned long *)node); in zlist_node_unlock()
37 struct zlist_node *prev, struct zlist_node *node, in zlist_before_add_check() argument
42 assert(idx2node(node->prev, tab) == node); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
47 struct zlist_node *prev, struct zlist_node *node, in zlist_after_add_check() argument
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
[all …]
|
| /kernel/linux/linux-5.10/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 node->ref; in bpf_lru_node_is_ref()
62 struct bpf_lru_node *node, in __bpf_lru_node_move_to_free() argument
66 if (WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(node->type))) in __bpf_lru_node_move_to_free()
72 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move_to_free()
75 bpf_lru_list_count_dec(l, node->type); in __bpf_lru_node_move_to_free()
77 node->type = tgt_free_type; in __bpf_lru_node_move_to_free()
78 list_move(&node->list, free_list); in __bpf_lru_node_move_to_free()
83 struct bpf_lru_node *node, in __bpf_lru_node_move_in() argument
86 if (WARN_ON_ONCE(!IS_LOCAL_LIST_TYPE(node->type)) || in __bpf_lru_node_move_in()
[all …]
|
| /kernel/linux/linux-5.10/net/hsr/ |
| D | hsr_framereg.c | 43 struct hsr_node *node; in hsr_addr_is_self() local
45 node = list_first_or_null_rcu(&hsr->self_node_db, struct hsr_node, in hsr_addr_is_self()
47 if (!node) { in hsr_addr_is_self()
52 if (ether_addr_equal(addr, node->macaddress_A)) in hsr_addr_is_self()
54 if (ether_addr_equal(addr, node->macaddress_B)) in hsr_addr_is_self()
65 struct hsr_node *node; in find_node_by_addr_A() local
67 list_for_each_entry_rcu(node, node_db, mac_list) { in find_node_by_addr_A()
68 if (ether_addr_equal(node->macaddress_A, addr)) in find_node_by_addr_A()
69 return node; in find_node_by_addr_A()
83 struct hsr_node *node, *oldnode; in hsr_create_self_node() local
[all …]
|