/Linux-v5.4/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 …]
|
/Linux-v5.4/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 …]
|
/Linux-v5.4/scripts/gdb/linux/ |
D | rbtree.py | 15 node = node.address.cast(rb_root_type.get_type().pointer()) 19 node = root['rb_node'] 20 if node is 0: 23 while node['rb_left']: 24 node = node['rb_left'] 26 return node 31 node = node.address.cast(rb_root_type.get_type().pointer()) 35 node = root['rb_node'] 36 if node is 0: 39 while node['rb_right']: [all …]
|
/Linux-v5.4/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 …]
|
D | dtc.h | 150 struct node { struct 154 struct node *children; argument 156 struct node *parent; argument 157 struct node *next_sibling; argument 202 struct node *build_node(struct property *proplist, struct node *children, 204 struct node *build_node_delete(struct srcpos *srcpos); 205 struct node *name_node(struct node *node, char *name); 206 struct node *omit_node_if_unused(struct node *node); 207 struct node *reference_node(struct node *node); 208 struct node *chain_node(struct node *first, struct node *list); [all …]
|
/Linux-v5.4/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 …]
|
/Linux-v5.4/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 …]
|
/Linux-v5.4/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 …]
|
D | lpm_trie.c | 18 /* Intermediate node */ 48 * lead to more nodes containing more specific matches. Each node also stores 58 * As the trie is empty initially, the new node (1) will be places as root 59 * node, denoted as (R) in the example below. As there are no other node, both 69 * Next, let's add a new node (2) matching 192.168.0.0/24. As there is already 70 * a node with the same data and a smaller prefix (ie, a less specific one), 71 * node (2) will become a child of (1). In child index depends on the next bit 89 * The child[1] slot of (1) could be filled with another node which has bit #17 107 * Let's add another node (4) to the game for 192.168.1.0/24. In order to place 108 * it, node (1) is looked at first, and because (4) of the semantics laid out [all …]
|
/Linux-v5.4/arch/ia64/mm/ |
D | discontig.c | 34 * Track per-node information needed to setup the boot memory allocator, the 35 * per-node areas, and the real VM. 51 * To prevent cache aliasing effects, align per-node structures so that they 52 * start at addresses that are strided by node number. 55 #define NODEDATA_ALIGN(addr, node) \ argument 57 (((node)*PERCPU_PAGE_SIZE) & (MAX_NODE_ALIGN_OFFSET - 1))) 60 * build_node_maps - callback to setup mem_data structs for each node 63 * @node: node where this range resides 66 * treat as a virtually contiguous block (i.e. each node). Each such block 72 int node) in build_node_maps() argument [all …]
|
/Linux-v5.4/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() 48 WARN_ONCE(1, "HSR: No self node\n"); 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() [all …]
|
/Linux-v5.4/drivers/base/ |
D | node.c | 3 * Basic Node interface support 12 #include <linux/node.h> 25 .name = "node", 26 .dev_name = "node", 34 struct node *node_dev = to_node(dev); in node_read_cpumap() 67 * @list_node: List element in the node's access list 105 static void node_remove_accesses(struct node *node) in node_remove_accesses() argument 109 list_for_each_entry_safe(c, cnext, &node->access_list, list_node) { in node_remove_accesses() 120 static struct node_access_nodes *node_init_node_access(struct node *node, in node_init_node_access() argument 126 list_for_each_entry(access_node, &node->access_list, list_node) in node_init_node_access() [all …]
|
/Linux-v5.4/lib/ |
D | radix-tree.c | 32 * Radix tree node cache. 44 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared. 71 /* nodes->parent points to next preallocated node */ 109 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument 112 __set_bit(offset, node->tags[tag]); in tag_set() 115 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument 118 __clear_bit(offset, node->tags[tag]); in tag_clear() 121 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument 124 return test_bit(offset, node->tags[tag]); in tag_get() 158 * Returns 1 if any slot in the node has this tag set. [all …]
|
D | btree.c | 16 * well is that access to a random tree node is much faster than a large number 17 * of operations within each node. 35 * values are to the right, not to the left. All used slots within a node 95 unsigned long *node; in btree_node_alloc() local 97 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc() 98 if (likely(node)) in btree_node_alloc() 99 memset(node, 0, NODESIZE); in btree_node_alloc() 100 return node; in btree_node_alloc() 148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument 150 return &node[n * geo->keylen]; in bkey() [all …]
|
/Linux-v5.4/fs/ocfs2/cluster/ |
D | quorum.c | 14 * that a node is broken and should be recovered. They can't both recover each 19 * So we declare that a node which has given up on connecting to a majority 22 * There are huge opportunities for races here. After we give up on a node's 24 * to declare the node as truly dead. We also need to be careful with the 25 * race between when we see a node start heartbeating and when we connect 85 * go away as our node would be fenced externally before other nodes 117 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision() 128 * the lowest numbered node */ in o2quo_make_decision() 131 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision() 140 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision() [all …]
|
/Linux-v5.4/include/drm/ |
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 void drm_vma_node_revoke(struct drm_vma_offset_node *node, 79 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node, 83 * drm_vma_offset_exact_lookup_locked() - Look up node by exact address 88 * Same as drm_vma_offset_lookup_locked() but does not allow any offset into the node. 92 * Node at exact start address @start. 99 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local 101 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked() [all …]
|
/Linux-v5.4/arch/sparc/prom/ |
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() 37 /* Return the child of node 'node' or zero if no this node has no 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() 69 /* Return the next sibling of node 'node' or zero if no more siblings 72 phandle prom_getsibling(phandle node) in prom_getsibling() argument [all …]
|
D | tree_64.c | 20 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() 35 /* Return the child of node 'node' or zero if no this node has no 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() [all …]
|
/Linux-v5.4/drivers/gpu/drm/ |
D | drm_mm.c | 79 * steep cliff not a real concern. Removing a node again is O(1). 107 static noinline void save_stack(struct drm_mm_node *node) in save_stack() argument 115 node->stack = stack_depot_save(entries, n, GFP_NOWAIT); in save_stack() 120 struct drm_mm_node *node; in show_leaks() local 129 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks() 130 if (!node->stack) { in show_leaks() 131 DRM_ERROR("node [%08llx + %08llx]: unknown owner\n", in show_leaks() 132 node->start, node->size); in show_leaks() 136 nr_entries = stack_depot_fetch(node->stack, &entries); in show_leaks() 138 DRM_ERROR("node [%08llx + %08llx]: inserted at\n%s", in show_leaks() [all …]
|
/Linux-v5.4/drivers/gpu/drm/i915/gt/ |
D | intel_engine_pool.c | 35 static void node_free(struct intel_engine_pool_node *node) in node_free() argument 37 i915_gem_object_put(node->obj); in node_free() 38 i915_active_fini(&node->active); in node_free() 39 kfree(node); in node_free() 44 struct intel_engine_pool_node *node = in pool_active() local 45 container_of(ref, typeof(*node), active); in pool_active() 46 struct dma_resv *resv = node->obj->base.resv; in pool_active() 54 err = i915_gem_object_pin_pages(node->obj); in pool_active() 59 i915_gem_object_make_unshrinkable(node->obj); in pool_active() 66 struct intel_engine_pool_node *node = in pool_retire() local [all …]
|
/Linux-v5.4/include/linux/ |
D | interval_tree_generic.h | 19 * ITSTART(n): start endpoint of ITSTRUCT node n 20 * ITLAST(n): last endpoint of ITSTRUCT node n 38 ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, \ 42 ITTYPE start = ITSTART(node), last = ITLAST(node); \ 59 node->ITSUBTREE = last; \ 60 rb_link_node(&node->ITRB, rb_parent, link); \ 61 rb_insert_augmented_cached(&node->ITRB, root, \ 65 ITSTATIC void ITPREFIX ## _remove(ITSTRUCT *node, \ 68 rb_erase_augmented_cached(&node->ITRB, root, &ITPREFIX ## _augment); \ 74 * Note that a node's interval intersects [start;last] iff: \ [all …]
|
/Linux-v5.4/tools/lib/ |
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's uncle is red (color flips). in __rb_insert() [all …]
|