node (full) in projects: linux - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched full:node (Results 1 – 25 of 4893) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...196

/linux/drivers/scsi/elx/libefc/
H A 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() 27 / Find an FC node structure given the FC port ID / in efc_node_find() 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 53 efc_log_debug(efc, "node allocation when shutting down %06x", in efc_node_alloc() 58 node = mempool_alloc(efc->node_pool, GFP_ATOMIC); in efc_node_alloc() [all …]
H A D	efc_device.c	8 * device_sm Node State Machine: Remote Device States 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() [all …]
H A D	efc_fabric.c	8 * This file implements remote node state machines for: 16 * fabric_sm Node State Machine: Fabric States 17 * ns_sm Node State Machine: Name/Directory Services States 18 * p2p_sm Node State Machine: Point-to-Point Node States 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() 33 /* issue hw node free; don't care if succeeds right away in efc_fabric_initiate_shutdown() 34 * or sometime later, will check node->attached later in in efc_fabric_initiate_shutdown() [all …]
/linux/fs/hfs/
H A 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 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 [all …]
H A 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/scripts/gdb/linux/
H A D	rbtree.py	13 def inorder(node): 14 if node: 15 yield from inorder(node['rb_left']) 16 yield node 17 yield from inorder(node['rb_right']) 22 for node in rb_inorder_for_each(root): 23 yield utils.container_of(node, gdbtype, member) 27 node = root.address.cast(rb_root_type.get_type().pointer()) 31 node = root['rb_node'] 32 if node 45 rb_parent(node) global() argument 50 rb_empty_node(node) global() argument 54 rb_next(node) global() argument 77 rb_prev(node) global() argument 149 invoke(self, node) global() argument 169 invoke(self, node) global() argument [all...]
/linux/scripts/dtc/
H A 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 in check_msg() 120 FAIL(c,dti,node,...) global() argument 127 FAIL_PROP(c,dti,node,prop,...) global() argument 135 check_nodes_props(struct check c,struct dt_info * dti,struct node * node) check_nodes_props() argument 201 check_always_fail(struct check * c,struct dt_info * dti,struct node * node) check_always_fail() argument 208 check_is_string(struct check * c,struct dt_info * dti,struct node * node) check_is_string() argument 226 check_is_string_list(struct check * c,struct dt_info * dti,struct node * node) check_is_string_list() argument 255 check_is_cell(struct check * c,struct dt_info * dti,struct node * node) check_is_cell() argument 277 check_duplicate_node_names(struct check * c,struct dt_info * dti,struct node * node) check_duplicate_node_names() argument 291 check_duplicate_property_names(struct check * c,struct dt_info * dti,struct node * node) check_duplicate_property_names() argument 314 check_node_name_chars(struct check * c,struct dt_info * dti,struct node * node) check_node_name_chars() argument 325 check_node_name_chars_strict(struct check * c,struct dt_info * dti,struct node * node) check_node_name_chars_strict() argument 336 check_node_name_format(struct check * c,struct dt_info * dti,struct node * node) check_node_name_format() argument 345 check_node_name_vs_property_name(struct check * c,struct dt_info * dti,struct node * node) check_node_name_vs_property_name() argument 358 check_unit_address_vs_reg(struct check * c,struct dt_info * dti,struct node * node) check_unit_address_vs_reg() argument 385 check_property_name_chars(struct check * c,struct dt_info * dti,struct node * node) check_property_name_chars() argument 401 check_property_name_chars_strict(struct check * c,struct dt_info * dti,struct node * node) check_property_name_chars_strict() argument 432 DESCLABEL_ARGS(node,prop,mark) global() argument 439 check_duplicate_label(struct check * c,struct dt_info * dti,const char * label,struct node * node,struct property * prop,struct marker * mark) check_duplicate_label() argument 466 check_duplicate_label_node(struct check * c,struct dt_info * dti,struct node * node) check_duplicate_label_node() argument 487 check_phandle_prop(struct check * c,struct dt_info * dti,struct node * node,const char * propname) check_phandle_prop() argument 534 check_explicit_phandles(struct check * c,struct dt_info * dti,struct node * node) check_explicit_phandles() argument 570 check_name_properties(struct check * c,struct dt_info * dti,struct node * node) check_name_properties() argument 604 fixup_phandle_references(struct check * c,struct dt_info * dti,struct node * node) fixup_phandle_references() argument 639 fixup_path_references(struct check * c,struct dt_info * dti,struct node * node) fixup_path_references() argument 670 fixup_omit_unused_nodes(struct check * c,struct dt_info * dti,struct node * node) fixup_omit_unused_nodes() argument 693 check_names_is_string_list(struct check * c,struct dt_info * dti,struct node * node) check_names_is_string_list() argument 708 check_alias_paths(struct check * c,struct dt_info * dti,struct node * node) check_alias_paths() argument 733 fixup_addr_size_cells(struct check * c,struct dt_info * dti,struct node * node) fixup_addr_size_cells() argument 757 check_reg_format(struct check * c,struct dt_info * dti,struct node * node) check_reg_format() argument 786 check_ranges_format(struct check * c,struct dt_info * dti,struct node * node) check_ranges_format() argument 833 check_pci_bridge(struct check * c,struct dt_info * dti,struct node * node) check_pci_bridge() argument 874 check_pci_device_bus_num(struct check * c,struct dt_info * dti,struct node * node) check_pci_device_bus_num() argument 904 check_pci_device_reg(struct check * c,struct dt_info * dti,struct node * node) check_pci_device_reg() argument 951 node_is_compatible(struct node * node,const char * compat) node_is_compatible() argument 968 check_simple_bus_bridge(struct check * c,struct dt_info * dti,struct node * node) check_simple_bus_bridge() argument 976 check_simple_bus_reg(struct check * c,struct dt_info * dti,struct node * node) check_simple_bus_reg() argument 1019 check_i2c_bus_bridge(struct check * c,struct dt_info * dti,struct node * node) check_i2c_bus_bridge() argument 1048 check_i2c_bus_reg(struct check * c,struct dt_info * dti,struct node * node) check_i2c_bus_reg() argument 1097 check_spi_bus_bridge(struct check * c,struct dt_info * dti,struct node * node) check_spi_bus_bridge() argument 1138 check_spi_bus_reg(struct check * c,struct dt_info * dti,struct node * node) check_spi_bus_reg() argument 1170 check_unit_address_format(struct check * c,struct dt_info * dti,struct node * node) check_unit_address_format() argument 1195 check_avoid_default_addr_size(struct check * c,struct dt_info * dti,struct node * node) check_avoid_default_addr_size() argument 1218 check_avoid_unnecessary_addr_size(struct check * c,struct dt_info * dti,struct node * node) check_avoid_unnecessary_addr_size() argument 1241 node_is_disabled(struct node * node) node_is_disabled() argument 1257 check_unique_unit_address_common(struct check * c,struct dt_info * dti,struct node * node,bool disable_check) check_unique_unit_address_common() argument 1293 check_unique_unit_address(struct check * c,struct dt_info * dti,struct node * node) check_unique_unit_address() argument 1300 check_unique_unit_address_if_enabled(struct check * c,struct dt_info * dti,struct node * node) check_unique_unit_address_if_enabled() argument 1309 check_obsolete_chosen_interrupt_controller(struct check * c,struct dt_info * dti,struct node * node) check_obsolete_chosen_interrupt_controller() argument 1332 check_chosen_node_is_root(struct check * c,struct dt_info * dti,struct node * node) check_chosen_node_is_root() argument 1343 check_chosen_node_bootargs(struct check * c,struct dt_info * dti,struct node * node) check_chosen_node_bootargs() argument 1360 check_chosen_node_stdout_path(struct check * c,struct dt_info * dti,struct node * node) check_chosen_node_stdout_path() argument 1388 check_property_phandle_args(struct check * c,struct dt_info * dti,struct node * node,struct property * prop,const struct provider * provider) check_property_phandle_args() argument 1468 check_provider_cells_property(struct check * c,struct dt_info * dti,struct node * node) check_provider_cells_property() argument 1518 check_gpios_property(struct check * c,struct dt_info * dti,struct node * node) check_gpios_property() argument 1543 check_deprecated_gpio_property(struct check * c,struct dt_info * dti,struct node * node) check_deprecated_gpio_property() argument 1561 node_is_interrupt_provider(struct node * node) node_is_interrupt_provider() argument 1578 check_interrupt_provider(struct check * c,struct dt_info * dti,struct node * node) check_interrupt_provider() argument 1600 check_interrupt_map(struct check * c,struct dt_info * dti,struct node * node) check_interrupt_map() argument 1688 check_interrupts_property(struct check * c,struct dt_info * dti,struct node * node) check_interrupts_property() argument 1765 check_graph_nodes(struct check * c,struct dt_info * dti,struct node * node) check_graph_nodes() argument 1793 check_graph_reg(struct check * c,struct dt_info * dti,struct node * node) check_graph_reg() argument 1824 check_graph_port(struct check * c,struct dt_info * dti,struct node * node) check_graph_port() argument 1840 struct node node; get_remote_endpoint() local 1860 check_graph_endpoint(struct check c,struct dt_info * dti,struct node * node) check_graph_endpoint() argument 1883 check_graph_child_address(struct check * c,struct dt_info * dti,struct node * node) check_graph_child_address() argument [all...]
H A 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, const char name) in name_node() argument 121 assert(node->name == NULL); in name_node() 123 node->name = xstrdup(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/fs/hfsplus/
H A 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() 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 [all …]
H A 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/include/linux/
H A D	bootconfig.h	50 /* XBC tree node / 67 / Node tree access raw APIs / 69 int __init xbc_node_index(struct xbc_node node); 70 struct xbc_node * __init xbc_node_get_parent(struct xbc_node node); 71 struct xbc_node __init xbc_node_get_child(struct xbc_node node); 72 struct xbc_node __init xbc_node_get_next(struct xbc_node node); 73 const char __init xbc_node_get_data(struct xbc_node node); 76 xbc_node_is_value() - Test the node is a value node 77 * @node: An XBC node. 79 * Test the @node is a value node and return true if a value node, false if not. [all …]
H A 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)) 53 /* Fast replacement of a single node without remove/rebalance/add/rebalance / 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 in rb_link_node() 68 rb_link_node_rcu(struct rb_node node,struct rb_node * parent,struct rb_node ** rb_link) rb_link_node_rcu() argument 108 rb_insert_color_cached(struct rb_node * node,struct rb_root_cached * root,bool leftmost) rb_insert_color_cached() argument 119 rb_erase_cached(struct rb_node * node,struct rb_root_cached * root) rb_erase_cached() argument 165 rb_add_cached(struct rb_node * node,struct rb_root_cached * tree,bool (* less)(struct rb_node ,const struct rb_node )) rb_add_cached() argument 195 rb_add(struct rb_node * node,struct rb_root * tree,bool (* less)(struct rb_node ,const struct rb_node )) rb_add() argument 223 rb_find_add(struct rb_node * node,struct rb_root * tree,int (* cmp)(struct rb_node ,const struct rb_node )) rb_find_add() argument 259 struct rb_node node = tree->rb_node; rb_find() local 287 struct rb_node node = tree->rb_node; rb_find_first() local 314 rb_next_match(const void * key,struct rb_node * node,int (* cmp)(const void * key,const struct rb_node *)) rb_next_match() argument 330 rb_for_each(node,key,tree,cmp) global() argument [all...]
/linux/lib/
H A D	bootconfig.c	40 * xbc_parse() parses the text to build a simple tree. Each tree node is 41 * simply a key word or a value. A key node may have a next key node or/and 42 * a child node (both key and value). A value node may have a next value 43 * node (for array). 112 * xbc_root_node() - Get the root node of extended boot config 114 * Return the address of root node of extended boot config. If the 126 * xbc_node_index() - Get the index of XBC node 127 * @node: A target node of getting index. 129 * Return the index number of @node in XBC node list. 131 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument [all …]
H A D	radix-tree.c	33 * Radix tree node cache. 45 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared. 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() 149 Returns 1 if any slot in the node has this tag set. 152 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument [all …]
/linux/fs/dlm/
H A D	midcomms.c	29 * Due the fact that dlm has pre-configured node addresses on every side 35 * application layer. The version field of every node will be set on these RCOM 36 * messages as soon as they arrived and the node isn't yet part of the nodes 47 * compatibility. A node cannot send anything to another node when a DLM_FIN 51 * manager removed the node from internal lists, at this point DLM does not 52 * send any message to the other node. There exists two cases: 160 * We could send a fence signal for a specific node to the cluster 185 /* counts how many lockspaces are using this node 187 * node wants to disconnect. 200 struct midcomms_node *node; member [all …]
/linux/drivers/net/ethernet/mellanox/mlx5/core/en/
H A 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/drivers/net/wireguard/
H A 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/kernel/bpf/
H A 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() 74 / If the removing node is the next_inactive_rotation candidate, 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() [all …]
H A D	lpm_trie.c	19 /* Intermediate node / 49 lead to more nodes containing more specific matches. Each node also stores 59 * As the trie is empty initially, the new node (1) will be places as root 60 * node, denoted as (R) in the example below. As there are no other node, both 70 * Next, let's add a new node (2) matching 192.168.0.0/24. As there is already 71 * a node with the same data and a smaller prefix (ie, a less specific one), 72 * node (2) will become a child of (1). In child index depends on the next bit 90 * The child[1] slot of (1) could be filled with another node which has bit #17 108 * Let's add another node (4) to the game for 192.168.1.0/24. In order to place 109 * it, node (1) is looked at first, and because (4) of the semantics laid out [all …]
/linux/kernel/gcov/
H A D	fs.c	34 * @list: list head for child node list 37 * @parent: parent node 251 * Return a profiling data set associated with the given node. This is 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() 265 * all profiling data associated with the given node. 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() [all …]
/linux/fs/ocfs2/cluster/
H A D	quorum.c	12 * that a node is broken and should be recovered. They can't both recover each 17 * So we declare that a node which has given up on connecting to a majority 20 * There are huge opportunities for races here. After we give up on a node's 22 * to declare the node as truly dead. We also need to be careful with the 23 * race between when we see a node start heartbeating and when we connect 83 * go away as our node would be fenced externally before other nodes 115 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision() 126 * the lowest numbered node */ in o2quo_make_decision() 129 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision() 138 mlog(ML_ERROR, "fencing this node because it is " in o2quo_make_decision() [all …]
/linux/tools/include/linux/
H A 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)) 62 /* Fast replacement of a single node without remove/rebalance/add/rebalance / 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() 112 * We do not cache the rightmost node based on footprint [all …]
/linux/drivers/gpu/drm/i915/gt/
H A 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() 63 /* Check we are the first to claim this node */ 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() [all …]
/linux/drivers/base/
H A 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 cpumap_read() 55 struct node node_dev = to_node(dev); in cpulist_read() 75 * @list_node: List element in the node's access list 113 static void node_remove_accesses(struct node node) in node_remove_accesses() argument 117 list_for_each_entry_safe(c, cnext, &node->access_list, list_node) { in node_remove_accesses() 128 static struct node_access_nodes node_init_node_access(struct node *node, in node_init_node_access() argument [all …]
/linux/drivers/gpu/drm/
H A 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 127 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks() 128 if (!node->stack) { in show_leaks() 129 DRM_ERROR("node [%08llx + %08llx]: unknown owner\n", in show_leaks() 130 node->start, node->size); in show_leaks() 134 stack_depot_snprint(node->stack, buf, BUFSZ, 0); in show_leaks() 135 DRM_ERROR("node [%08llx + %08llx]: inserted at\n%s", in show_leaks() [all …]

12 3 4 5 6 7 8 9 10 >>...196