| /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 | 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
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
[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 …]
|
| /kernel/linux/linux-4.19/fs/hfs/ |
| D | bnode.c | 9 * Handle basic btree node operations
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()
[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 …]
|
| /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 | 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 …]
|
| 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 …]
|
| /kernel/linux/linux-4.19/scripts/dtc/ |
| 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 …]
|
| 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 …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | bootconfig.h | 19 /* XBC tree node */
36 /* Node tree access raw APIs */
38 int __init xbc_node_index(struct xbc_node *node);
39 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node);
40 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node);
41 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node);
42 const char * __init xbc_node_get_data(struct xbc_node *node);
45 * xbc_node_is_value() - Test the node is a value node
46 * @node: An XBC node.
48 * Test the @node is a value node and return true if a value node, false if not.
[all …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | bootconfig.c | 21 * xbc_parse() parses the text to build a simple tree. Each tree node is
22 * simply a key word or a value. A key node may have a next key node or/and
23 * a child node (both key and value). A value node may have a next value
24 * node (for array).
46 * xbc_root_node() - Get the root node of extended boot config
48 * Return the address of root node of extended boot config. If the
60 * xbc_node_index() - Get the index of XBC node
61 * @node: A target node of getting index.
63 * Return the index number of @node in XBC node list.
65 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
[all …]
|
| /kernel/linux/linux-4.19/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()
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
[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 …]
|
| /kernel/linux/linux-5.10/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()
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
[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 …]
|
| /kernel/linux/linux-5.10/kernel/gcov/ |
| D | fs.c | 33 * @list: list head for child node list
36 * @parent: parent node
141 * Return a profiling data set associated with the given node. This is
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()
155 * all profiling data associated with the given node.
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()
[all …]
|
| /kernel/linux/linux-4.19/kernel/gcov/ |
| D | fs.c | 33 * @list: list head for child node list
36 * @parent: parent node
142 * Return a profiling data set associated with the given node. This is
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()
156 * all profiling data associated with the given node.
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()
[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-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-4.19/arch/ia64/mm/ |
| D | discontig.c | 35 * Track per-node information needed to setup the boot memory allocator, the
36 * per-node areas, and the real VM.
52 * To prevent cache aliasing effects, align per-node structures so that they
53 * start at addresses that are strided by node number.
56 #define NODEDATA_ALIGN(addr, node) \ argument
58 (((node)*PERCPU_PAGE_SIZE) & (MAX_NODE_ALIGN_OFFSET - 1)))
61 * build_node_maps - callback to setup mem_data structs for each node
64 * @node: node where this range resides
67 * treat as a virtually contiguous block (i.e. each node). Each such block
73 int node) in build_node_maps() 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()
72 /* If the removing node is the next_inactive_rotation candidate, 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
[all …]
|
| /kernel/linux/linux-5.10/arch/ia64/mm/ |
| D | discontig.c | 33 * Track per-node information needed to setup the boot memory allocator, the
34 * per-node areas, and the real VM.
50 * To prevent cache aliasing effects, align per-node structures so that they
51 * start at addresses that are strided by node number.
54 #define NODEDATA_ALIGN(addr, node) \ argument
56 (((node)*PERCPU_PAGE_SIZE) & (MAX_NODE_ALIGN_OFFSET - 1)))
59 * build_node_maps - callback to setup mem_data structs for each node
62 * @node: node where this range resides
65 * treat as a virtually contiguous block (i.e. each node). Each such block
71 int node) in build_node_maps() argument
[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()
69 /* If the removing node is the next_inactive_rotation candidate, 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
[all …]
|