/linux-6.6.21/drivers/scsi/elx/libefc/ |
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 …]
|
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 …]
|
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-6.6.21/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 25 off += node->page_offset; in hfs_bnode_read() 30 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read() 32 page = node->page[pagenum]; in hfs_bnode_read() 42 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument 46 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16() 50 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument 54 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8() 58 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument 63 tree = node->tree; 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 …]
|
/linux-6.6.21/fs/dlm/ |
D | midcomms.c | 200 struct midcomms_node *node; member 206 void (*ack_rcv)(struct midcomms_node *node); 255 const char *dlm_midcomms_state(struct midcomms_node *node) in dlm_midcomms_state() argument 257 return dlm_state_str(node->state); in dlm_midcomms_state() 260 unsigned long dlm_midcomms_flags(struct midcomms_node *node) in dlm_midcomms_flags() argument 262 return node->flags; in dlm_midcomms_flags() 265 int dlm_midcomms_send_queue_cnt(struct midcomms_node *node) in dlm_midcomms_send_queue_cnt() argument 267 return atomic_read(&node->send_queue_cnt); in dlm_midcomms_send_queue_cnt() 270 uint32_t dlm_midcomms_version(struct midcomms_node *node) in dlm_midcomms_version() argument 272 return node->version; in dlm_midcomms_version() [all …]
|
/linux-6.6.21/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 …]
|
/linux-6.6.21/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 …]
|
/linux-6.6.21/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() 41 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument 45 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16() 49 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument 53 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8() 57 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument 62 tree = node->tree; in hfs_bnode_read_key() 63 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key() [all …]
|
D | brec.c | 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() 44 recoff = hfs_bnode_read_u16(node, in hfs_brec_keylen() [all …]
|
/linux-6.6.21/kernel/gcov/ |
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-6.6.21/lib/ |
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 …]
|
D | bootconfig.c | 130 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument 132 return node - &xbc_nodes[0]; in xbc_node_index() 142 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node) in xbc_node_get_parent() argument 144 return node->parent == XBC_NODE_MAX ? NULL : &xbc_nodes[node->parent]; in xbc_node_get_parent() 154 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node) in xbc_node_get_child() argument 156 return node->child ? &xbc_nodes[node->child] : NULL; in xbc_node_get_child() 168 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node) in xbc_node_get_next() argument 170 return node->next ? &xbc_nodes[node->next] : NULL; in xbc_node_get_next() 180 const char * __init xbc_node_get_data(struct xbc_node *node) in xbc_node_get_data() argument 182 int offset = node->data & ~XBC_VALUE; in xbc_node_get_data() [all …]
|
D | btree.c | 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() 153 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() argument 155 return (void *)node[geo->no_longs + n]; in bval() 158 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey() argument [all …]
|
/linux-6.6.21/drivers/net/wireguard/ |
D | allowedips.c | 23 static void copy_and_assign_cidr(struct allowedips_node *node, const u8 *src, in copy_and_assign_cidr() argument 26 node->cidr = cidr; in copy_and_assign_cidr() 27 node->bit_at_a = cidr / 8U; in copy_and_assign_cidr() 29 node->bit_at_a ^= (bits / 8U - 1U) % 8U; in copy_and_assign_cidr() 31 node->bit_at_b = 7U - (cidr % 8U); in copy_and_assign_cidr() 32 node->bitlen = bits; in copy_and_assign_cidr() 33 memcpy(node->bits, src, bits / 8U); in copy_and_assign_cidr() 36 static inline u8 choose(struct allowedips_node *node, const u8 *key) in choose() argument 38 return (key[node->bit_at_a] >> node->bit_at_b) & 1; in choose() 58 struct allowedips_node *node, *stack[MAX_ALLOWEDIPS_DEPTH] = { in root_free_rcu() local [all …]
|
/linux-6.6.21/include/linux/ |
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)) 59 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument 62 node->__rb_parent_color = (unsigned long)parent; in rb_link_node() 63 node->rb_left = node->rb_right = NULL; in rb_link_node() 65 *rb_link = node; in rb_link_node() 68 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, in rb_link_node_rcu() argument 71 node->__rb_parent_color = (unsigned long)parent; in rb_link_node_rcu() [all …]
|
/linux-6.6.21/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 READ_ONCE(node->ref); in bpf_lru_node_is_ref() 47 static void bpf_lru_node_clear_ref(struct bpf_lru_node *node) in bpf_lru_node_clear_ref() argument 49 WRITE_ONCE(node->ref, 0); in bpf_lru_node_clear_ref() 67 struct bpf_lru_node *node, in __bpf_lru_node_move_to_free() argument 71 if (WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(node->type))) in __bpf_lru_node_move_to_free() 77 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move_to_free() 80 bpf_lru_list_count_dec(l, node->type); in __bpf_lru_node_move_to_free() 82 node->type = tgt_free_type; in __bpf_lru_node_move_to_free() 83 list_move(&node->list, free_list); in __bpf_lru_node_move_to_free() [all …]
|
D | lpm_trie.c | 166 const struct lpm_trie_node *node, in longest_prefix_match() argument 169 u32 limit = min(node->prefixlen, key->prefixlen); in longest_prefix_match() 181 u64 diff = be64_to_cpu(*(__be64 *)node->data ^ in longest_prefix_match() 194 u32 diff = be32_to_cpu(*(__be32 *)&node->data[i] ^ in longest_prefix_match() 206 u16 diff = be16_to_cpu(*(__be16 *)&node->data[i] ^ in longest_prefix_match() 218 prefixlen += 8 - fls(node->data[i] ^ key->data[i]); in longest_prefix_match() 231 struct lpm_trie_node *node, *found = NULL; in trie_lookup_elem() local 239 for (node = rcu_dereference_check(trie->root, rcu_read_lock_bh_held()); in trie_lookup_elem() 240 node;) { in trie_lookup_elem() 248 matchlen = longest_prefix_match(trie, node, key); in trie_lookup_elem() [all …]
|
/linux-6.6.21/tools/include/linux/ |
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-6.6.21/drivers/net/ethernet/marvell/octeontx2/nic/ |
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-6.6.21/drivers/gpu/drm/i915/gt/ |
D | intel_gt_buffer_pool.c | 30 static void node_free(struct intel_gt_buffer_pool_node *node) in node_free() argument 32 i915_gem_object_put(node->obj); in node_free() 33 i915_active_fini(&node->active); in node_free() 34 kfree_rcu(node, rcu); in node_free() 39 struct intel_gt_buffer_pool_node *node, *stale = NULL; in pool_free_older_than() local 57 node = list_entry(pos, typeof(*node), link); in pool_free_older_than() 59 age = READ_ONCE(node->age); in pool_free_older_than() 64 if (!xchg(&node->age, 0)) in pool_free_older_than() 67 node->free = stale; in pool_free_older_than() 68 stale = node; in pool_free_older_than() [all …]
|
/linux-6.6.21/drivers/gpu/drm/ |
D | drm_mm.c | 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 127 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks() 128 if (!node->stack) { in show_leaks() 130 node->start, node->size); in show_leaks() 134 stack_depot_snprint(node->stack, buf, BUFSZ, 0); in show_leaks() 136 node->start, node->size, buf); in show_leaks() 145 static void save_stack(struct drm_mm_node *node) { } in save_stack() argument 149 #define START(node) ((node)->start) argument [all …]
|
/linux-6.6.21/drivers/net/ethernet/mellanox/mlx5/core/en/ |
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-6.6.21/tools/lib/ |
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 …]
|