Home
last modified time | relevance | path

Searched +full:child +full:- +full:node (Results 1 – 25 of 814) sorted by relevance

12345678910>>...33

/linux/kernel/bpf/
H A Dlpm_trie.c1 // SPDX-License-Identifier: GPL-2.0-only
21 /* Intermediate node */
27 struct lpm_trie_node __rcu *child[2];
51 * lead to more nodes containing more specific matches. Each node also stores
58 * [0xc0, 0xa8, 0x00, 0x00] in big-endian notation. This documentation will
59 * stick to IP-address notation for readability though.
61 * As the trie is empty initially, the new node (
26 struct lpm_trie_node __rcu *child[2]; global() member
168 __longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) __longest_prefix_match() argument
230 longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) longest_prefix_match() argument
240 struct lpm_trie_node *node, *found = NULL; trie_lookup_elem() local
294 struct lpm_trie_node *node; lpm_trie_node_alloc() local
325 struct lpm_trie_node *node, *im_node, *new_node; trie_update_elem() local
461 struct lpm_trie_node *node, *parent; trie_delete_elem() local
614 struct lpm_trie_node *node; trie_free() local
655 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; trie_get_next_key() local
[all...]
/linux/tools/include/linux/
H A Drbtree_augmented.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
22 * Please note - only struct rb_augment_callbacks and the prototypes for
26 * See Documentation/core-api/rbtree.rst for documentation and samples.
30 void (*propagate)(struct rb_node *node, struct rb_node *stop);
35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
42 * leading to the inserted node, the
49 rb_insert_augmented(struct rb_node * node,struct rb_root * root,const struct rb_augment_callbacks * augment) rb_insert_augmented() argument
56 rb_insert_augmented_cached(struct rb_node * node,struct rb_root_cached * root,bool newleft,const struct rb_augment_callbacks * augment) rb_insert_augmented_cached() argument
187 __rb_erase_augmented(struct rb_node * node,struct rb_root * root,const struct rb_augment_callbacks * augment) __rb_erase_augmented() argument
190 struct rb_node *child = node->rb_right; __rb_erase_augmented() local
291 rb_erase_augmented(struct rb_node * node,struct rb_root * root,const struct rb_augment_callbacks * augment) rb_erase_augmented() argument
300 rb_erase_augmented_cached(struct rb_node * node,struct rb_root_cached * root,const struct rb_augment_callbacks * augment) rb_erase_augmented_cached() argument
[all...]
/linux/include/linux/
H A Drbtree_augmented.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
20 * Please note - only struct rb_augment_callbacks and the prototypes for
24 * See Documentation/core-api/rbtree.rst for documentation and samples.
28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
40 * leading to the inserted node, then call rb_link_node() as usual and
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
50 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
54 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached() argument
59 root->rb_leftmost = node; in rb_insert_augmented_cached()
[all …]
H A Dproperty.h1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * property.h - Unified device property interface.
85 if (fwnode_property_present(fwnode, "big-endian")) in fwnode_device_is_big_endian()
88 fwnode_property_present(fwnode, "native-endian")) in fwnode_device_is_big_endian()
100 * device_is_big_endian - check if a device has BE registers
103 * Returns: true if the device has a "big-endian" property, or if the kernel
104 * was compiled for BE *and* the device has a "native-endia
167 fwnode_for_each_child_node(fwnode,child) global() argument
171 fwnode_for_each_named_child_node(fwnode,child,name) global() argument
175 fwnode_for_each_available_child_node(fwnode,child) global() argument
182 device_for_each_child_node(dev,child) global() argument
186 device_for_each_named_child_node(dev,child,name) global() argument
190 device_for_each_child_node_scoped(dev,child) global() argument
195 device_for_each_named_child_node_scoped(dev,child,name) global() argument
353 const struct software_node *node; global() member
520 fwnode_graph_for_each_endpoint(fwnode,child) global() argument
[all...]
/linux/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dhtb.c1 // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
16 u32 classid; /* 16-bit, except root. */
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()
53 last = find_last_bit(htb->qos_used_qids, mlx5e_qos_max_leaf_nodes(htb->mdev)); in mlx5e_htb_cur_leaf_nodes()
54 return last == mlx5e_qos_max_leaf_nodes(htb->mdev) ? 0 : last + 1; in mlx5e_htb_cur_leaf_nodes()
59 int size = mlx5e_qos_max_leaf_nodes(htb->mdev); in mlx5e_htb_find_unused_qos_qid()
60 struct mlx5e_priv *priv = htb->priv; in mlx5e_htb_find_unused_qos_qid()
[all …]
/linux/lib/
H A Dbootconfig.c1 // SPDX-License-Identifier: GPL-2.0
25 /* embedded_bootconfig_data is defined in bootconfig-data.S */
31 *size = embedded_bootconfig_data_end - embedded_bootconfig_data; in xbc_get_embedded_bootconfig()
38 * Extra Boot Config (XBC) is given as tree-structured ascii text of
39 * key-value pairs on memory.
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).
83 * xbc_get_info() - Get the information of loaded boot config
[all …]
H A Dradix-tree.c1 // SPDX-License-Identifier: GPL-2.0-or-later
24 #include <linux/radix-tree.h>
30 #include "radix-tree.h"
33 * Radix tree node cache.
38 * The radix tree is variable-height, so an insert operation not only has
45 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared.
48 #define RADIX_TREE_PRELOAD_SIZE (RADIX_TREE_MAX_PATH * 2 - 1)
54 #define IDR_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(int) - 1)
57 #define IDR_PRELOAD_SIZE (IDR_MAX_PATH * 2 - 1)
60 * Per-cpu pool of preloaded nodes
[all …]
H A Dbtree.c1 // SPDX-License-Identifier: GPL-2.0-only
3 * lib/btree.c - Simple In-memory B+Tree
5 * Copyright (c) 2007-2008 Joern Engel <joern@purestorage.com>
9 * see http://programming.kicks-ass.net/kernel-patches/vma_lookup/btree.patch
16 * well is that access to a random tree node is much faster than a large number
17 * of operations within each node.
27 * ~98% pointers - hard to beat. Very sparse radix trees contain only ~2%
35 * values are to the right, not to the left. All used slots within a node
94 unsigned long *node; in btree_node_alloc() local
96 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
[all …]
/linux/drivers/acpi/acpica/
H A Dnsalloc.c1 // SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0
4 * Module Name: nsalloc - Namespace allocation and deletion utilities
19 * PARAMETERS: name - Name of the new node (4 char ACPI name)
21 * RETURN: New namespace node (Null on failure)
23 * DESCRIPTION: Create a namespace node
28 struct acpi_namespace_node *node; in acpi_ns_create_node() local
35 node = acpi_os_acquire_object(acpi_gbl_namespace_cache); in acpi_ns_create_node()
36 if (!node) { in acpi_ns_create_node()
40 ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_allocated++); in acpi_ns_create_node()
43 temp = acpi_gbl_ns_node_list->total_allocated - in acpi_ns_create_node()
[all …]
H A Dnswalk.c1 // SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0
4 * Module Name: nswalk - Functions for walking the ACPI namespace
6 * Copyright (C) 2000 - 2025, Intel Corp.
21 * PARAMETERS: parent_node - Parent node whose children we are
23 * child_node - Previous child that was found.
24 * The NEXT child will be returned
26 * RETURN: struct acpi_namespace_node - Pointer to the NEXT child or NULL if
29 * DESCRIPTION: Return the next peer node within the namespace. If Handle
30 * is valid, Scope is ignored. Otherwise, the first node
45 return (parent_node->child); in acpi_ns_get_next_node()
[all …]
/linux/drivers/usb/core/
H A Dof.c1 // SPDX-License-Identifier: GPL-2.0
15 * usb_of_get_device_node() - get a USB device node
17 * @port1: one-based index of port
19 * Look up the node of a USB device given its parent hub device and one-based
22 * Return: A pointer to the node with incremented refcount if found, or
27 struct device_node *node; in usb_of_get_device_node() local
30 for_each_child_of_node(hub->dev.of_node, node) { in usb_of_get_device_node()
31 if (of_property_read_u32(node, "reg", &reg)) in usb_of_get_device_node()
35 return node; in usb_of_get_device_node()
43 * usb_of_has_combined_node() - determine whether a device has a combined node
[all …]
/linux/scripts/dtc/
H A Dlivetree.c1 // SPDX-License-Identifier: GPL-2.0-or-later
19 if (streq(new->label, label)) { in add_label()
20 new->deleted = 0; in add_label()
26 new->label = label; in add_label()
27 new->next = *labels; in add_label()
36 label->delete in delete_labels()
92 struct node *child; build_node() local
119 name_node(struct node * node,const char * name) name_node() argument
128 omit_node_if_unused(struct node * node) omit_node_if_unused() argument
135 reference_node(struct node * node) reference_node() argument
231 struct node *node; add_orphan_node() local
267 add_property(struct node * node,struct property * prop) add_property() argument
280 delete_property_by_name(struct node * node,char * name) delete_property_by_name() argument
299 add_child(struct node * parent,struct node * child) add_child() argument
315 struct node *node = parent->children; delete_node_by_name() local
326 delete_node(struct node * node) delete_node() argument
329 struct node *child; delete_node() local
339 append_to_property(struct node * node,char * name,const void * data,int len,enum markertype type) append_to_property() argument
417 get_unitname(struct node * node) get_unitname() argument
425 get_property(struct node * node,const char * propname) get_property() argument
449 get_property_by_label(struct node * tree,const char * label,struct node ** node) get_property_by_label() argument
475 get_marker_label(struct node * tree,const char * label,struct node ** node,struct property ** prop) get_marker_label() argument
502 get_subnode(struct node * node,const char * nodename) get_subnode() argument
504 struct node *child; get_subnode() local
516 struct node *child; get_node_by_path() local
541 struct node *child, *node; get_node_by_label() local
561 struct node *child, *node; get_node_by_phandle() local
620 add_phandle_property(struct node * node,const char * name,int format) add_phandle_property() argument
636 get_node_phandle(struct node * root,struct node * node) get_node_phandle() argument
740 sort_properties(struct node * node) sort_properties() argument
776 sort_subnodes(struct node * node) sort_subnodes() argument
802 sort_node(struct node * node) sort_node() argument
821 struct node *node; build_and_name_child_node() local
844 any_label_tree(struct dt_info * dti,struct node * node) any_label_tree() argument
859 generate_label_tree_internal(struct dt_info * dti,struct node * an,struct node * node,bool allocph) generate_label_tree_internal() argument
899 any_fixup_tree(struct dt_info * dti,struct node * node) any_fixup_tree() argument
922 add_fixup_entry(struct dt_info * dti,struct node * fn,struct node * node,struct property * prop,struct marker * m) add_fixup_entry() argument
949 generate_fixups_tree_internal(struct dt_info * dti,struct node * fn,struct node * node) generate_fixups_tree_internal() argument
970 any_local_fixup_tree(struct dt_info * dti,struct node * node) any_local_fixup_tree() argument
993 add_local_fixup_entry(struct dt_info * dti,struct node * lfn,struct node * node,struct property * prop,struct marker * m,struct node * refnode) add_local_fixup_entry() argument
1030 generate_local_fixups_tree_internal(struct dt_info * dti,struct node * lfn,struct node * node) generate_local_fixups_tree_internal() argument
[all...]
/linux/tools/verification/rvgen/rvgen/
H A Dltl2ba.py2 # SPDX-License-Identifier: GPL-2.0-only
6 # Simple On-the-fly Automatic Verification of Linear Temporal Logic.
7 # https://doi.org/10.1007/978-0-387-34892-6_1
17 # true, false, user-defined names
55 t_VARIABLE = r'[A-Z_0-9]+'
120 def expand(self, node, node_set): argument
121 return self.op.expand(self, node, node_set)
132 # - ALWAYS
133 # - EVENTUALLY
134 # - IMPLY
[all …]
/linux/tools/perf/util/
H A Dcallchain.c1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2009-2011, Frederic Weisbecker <fweisbec@gmail.com>
5 * Handle the callchains from the stream in an ad-hoc radix tree and then
53 * -e cycles/call-graph=dwarf/
61 /* Used for thread-local struct callchain_cursor. */
87 return -1; in parse_callchain_mode()
102 return - in parse_callchain_order()
420 __sort_chain_flat(struct rb_root * rb_root,struct callchain_node * node,u64 min_hit) __sort_chain_flat() argument
424 struct callchain_node *child; __sort_chain_flat() local
450 __sort_chain_graph_abs(struct callchain_node * node,u64 min_hit) __sort_chain_graph_abs() argument
454 struct callchain_node *child; __sort_chain_graph_abs() local
478 __sort_chain_graph_rel(struct callchain_node * node,double min_percent) __sort_chain_graph_rel() argument
482 struct callchain_node *child; __sort_chain_graph_rel() local
548 struct callchain_node *child; create_child() local
573 fill_node(struct callchain_node * node,struct callchain_cursor * cursor) fill_node() argument
728 match_chain(struct callchain_cursor_node * node,struct callchain_list * cnode) match_chain() argument
851 struct callchain_cursor_node *node; split_add_child() local
898 struct callchain_cursor_node *node; append_chain_children() local
957 struct callchain_cursor_node *node; append_chain() local
1029 struct callchain_node *child; merge_chain_branch() local
1085 struct callchain_cursor_node *node = *cursor->last; callchain_cursor_append() local
1141 fill_callchain_info(struct addr_location * al,struct callchain_cursor_node * node,bool hide_unresolved) fill_callchain_info() argument
1214 callchain_node__scnprintf_value(struct callchain_node * node,char * bf,size_t bfsize,u64 total) callchain_node__scnprintf_value() argument
1243 callchain_node__fprintf_value(struct callchain_node * node,FILE * fp,u64 total) callchain_node__fprintf_value() argument
1269 callchain_counts_value(struct callchain_node * node,u64 * branch_count,u64 * predicted_count,u64 * abort_count,u64 * cycles_count) callchain_counts_value() argument
1290 callchain_node_branch_counts_cumul(struct callchain_node * node,u64 * branch_count,u64 * predicted_count,u64 * abort_count,u64 * cycles_count) callchain_node_branch_counts_cumul() argument
1296 struct callchain_node *child; callchain_node_branch_counts_cumul() local
1487 free_callchain_node(struct callchain_node * node) free_callchain_node() argument
1490 struct callchain_node *child; free_callchain_node() local
1526 decay_callchain_node(struct callchain_node * node) decay_callchain_node() argument
1528 struct callchain_node *child; decay_callchain_node() local
1554 callchain_node__make_parent_list(struct callchain_node * node) callchain_node__make_parent_list() argument
1598 struct callchain_cursor_node *node, *next; callchain_cursor__delete() local
1641 struct callchain_cursor_node *node; callchain_cursor__copy() local
1667 struct callchain_cursor_node *node; callchain_cursor_reset() local
1760 struct callchain_node *node; count_callchain_hits() local
1822 struct callchain_cursor_node *node = callchain_cursor_current(cursor); sample__for_each_callchain_node() local
[all...]
/linux/drivers/powercap/
H A Ddtpm.c1 // SPDX-License-Identifier: GPL-2.0-only
12 * parent node is a virtual description of the aggregation of the
42 return -ENOSYS; in get_time_window_us()
47 return -ENOSYS; in set_time_window_us()
54 *max_power_uw = dtpm->power_max - dtpm->power_min; in get_max_power_range_uw()
61 struct dtpm *child; in __get_power_uw() local
65 if (dtpm->ops) { in __get_power_uw()
66 *power_uw = dtpm->ops->get_power_uw(dtpm); in __get_power_uw()
72 list_for_each_entry(child, &dtpm->children, sibling) { in __get_power_uw()
73 ret = __get_power_uw(child, &power); in __get_power_uw()
[all …]
/linux/drivers/mtd/
H A Dmtdpart.c1 // SPDX-License-Identifier: GPL-2.0-or-later
7 * Copyright © 2000-2010 David Woodhouse <dwmw2@infradead.org>
31 kfree(mtd->name); in free_partition()
37 WARN_ON(!list_empty(&mtd->part.node)); in release_mtd_partition()
46 int wr_alignment = (parent->flags & MTD_NO_ERASE) ? in allocate_partition()
47 master->writesize : master->erasesize; in allocate_partition()
49 parent->part.size : parent->size; in allocate_partition()
50 struct mtd_info *child; in allocate_partition() local
56 child = kzalloc(sizeof(*child), GFP_KERNEL); in allocate_partition()
57 name = kstrdup(part->name, GFP_KERNEL); in allocate_partition()
[all …]
/linux/Documentation/networking/
H A Dfib_trie.rst1 .. SPDX-License-Identifier: GPL-2.0
4 LC-trie implementation notes
7 Node types
8 ----------
10 An end node with data. This has a copy of the relevant key, along
14 trie node or tnode
15 An internal node, holding an array of child (leaf or tnode) pointers,
19 ------------------------
22 child array - the "child index". See Level Compression.
26 the child array. See Path Compression.
[all …]
/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dobject.c36 spin_lock_irqsave(&client->obj_lock, flags); in nvkm_object_search()
37 struct rb_node *node = client->objroot.rb_node; in nvkm_object_search() local
38 while (node) { in nvkm_object_search()
39 object = rb_entry(node, typeof(*object), node); in nvkm_object_search()
40 if (handle < object->object) in nvkm_object_search()
41 node = node->rb_left; in nvkm_object_search()
43 if (handle > object->object) in nvkm_object_search()
44 node = node->rb_right; in nvkm_object_search()
46 spin_unlock_irqrestore(&client->obj_lock, flags); in nvkm_object_search()
50 spin_unlock_irqrestore(&client->obj_lock, flags); in nvkm_object_search()
[all …]
/linux/drivers/md/persistent-data/
H A Ddm-btree-remove.c1 // SPDX-License-Identifier: GPL-2.0-only
8 #include "dm-btree.h"
9 #include "dm-btree-internal.h"
10 #include "dm-transaction-manager.h"
13 #include <linux/device-mapper.h>
21 * A very important constraint for our btree is that no node, except the
29 * Each node may have a left or right sibling. When decending the spine,
30 * if a node contains only MIN_ENTRIES then we try and increase this to at
33 * [A] No siblings => this can only happen if the node is the root, in which
37 * ==> rebalance(node, right sibling)
[all …]
/linux/drivers/of/
H A Dof_reserved_mem.c1 // SPDX-License-Identifier: GPL-2.0+
28 #include <linux/dma-map-ops.h>
48 return -ENOMEM; in early_init_dt_alloc_reserved_memory_arch()
64 * alloc_reserved_mem_array() - allocate memory for the reserved_mem
81 pr_err("Failed to allocate memory for reserved_mem array with err: %d", -EOVERFLOW); in alloc_reserved_mem_array()
87 pr_err("Failed to allocate memory for reserved_mem array with err: %d", -ENOMEM); in alloc_reserved_mem_array()
95 pr_err("Failed to allocate memory for reserved_mem array with err: %d", -EOVERFLOW); in alloc_reserved_mem_array()
99 memset_size = alloc_size - copy_size; in alloc_reserved_mem_array()
109 * fdt_reserved_mem_save_node() - save fdt node for second pass initialization
111 static void __init fdt_reserved_mem_save_node(unsigned long node, const char *uname, in fdt_reserved_mem_save_node() argument
[all …]
H A Dfdt.c1 // SPDX-License-Identifier: GPL-2.0
43 * of_fdt_limit_memory - limit the number of regions in the /memory node
47 * memory entries in the /memory node. This function may be called
69 bool of_fdt_device_is_available(const void *blob, unsigned long node) in of_fdt_device_is_available() argument
71 const char *status = fdt_getprop(blob, node, "status", NULL); in of_fdt_device_is_available()
105 pprev = &np->properties; in populate_properties()
133 * ePAPR-style "phandle" properties, or the in populate_properties()
140 if (!np->phandle) in populate_properties()
141 np->phandle = be32_to_cpup(val); in populate_properties()
149 np->phandle = be32_to_cpup(val); in populate_properties()
[all …]
/linux/drivers/net/ethernet/mellanox/mlx5/core/ipoib/
H A Dipoib_vlan.c14 * - Redistributions of source code must retain the above
18 * - Redistributions in binary form must reproduce the above
56 return -ENOMEM; in mlx5i_pkey_qpn_ht_init()
58 ipriv->qpn_htbl = qpn_htbl; in mlx5i_pkey_qpn_ht_init()
59 spin_lock_init(&qpn_htbl->ht_lock); in mlx5i_pkey_qpn_ht_init()
68 kfree(ipriv->qpn_htbl); in mlx5i_pkey_qpn_ht_cleanup()
75 struct qpn_to_netdev *node; in mlx5i_find_qpn_to_netdev_node() local
77 hlist_for_each_entry(node, h, hlist) { in mlx5i_find_qpn_to_netdev_node()
78 if (node->underlay_qpn == qpn) in mlx5i_find_qpn_to_netdev_node()
79 return node; in mlx5i_find_qpn_to_netdev_node()
[all …]
/linux/Documentation/devicetree/bindings/dma/xilinx/
H A Dxilinx_dma.txt11 Xilinx AXI CDMA engine, it does transfers between memory-mapped source
12 address and a memory-mapped destination address.
19 - compatible: Should be one of-
20 "xlnx,axi-vdma-1.00.a"
21 "xlnx,axi-dma-1.00.a"
22 "xlnx,axi-cdma-1.00.a"
23 "xlnx,axi-mcdma-1.00.a"
24 - #dma-cells: Should be <1>, see "dmas" property below
25 - reg: Should contain VDMA registers location and length.
26 - xlnx,addrwidth: Should be the vdma addressing size in bits(ex: 32 bits).
[all …]
/linux/drivers/cpuidle/
H A Ddt_idle_genpd.c1 // SPDX-License-Identifier: GPL-2.0-only
12 #define pr_fmt(fmt) "dt-idle-genpd: " fmt
38 ret = -ENOMEM; in pd_parse_state_nodes()
48 i--; in pd_parse_state_nodes()
49 for (; i >= 0; i--) in pd_parse_state_nodes()
86 pd_free_states(pd->states, pd->state_count); in dt_idle_pd_free()
87 kfree(pd->name); in dt_idle_pd_free()
102 pd->name = kasprintf(GFP_KERNEL, "%pOF", np); in dt_idle_pd_alloc()
103 if (!pd->name) in dt_idle_pd_alloc()
108 * for those being compatible with "domain-idle-state". in dt_idle_pd_alloc()
[all …]
/linux/kernel/sched/
H A Dtopology.c1 // SPDX-License-Identifier: GPL-2.0
46 struct sched_group *group = sd->groups; in sched_domain_debug_one()
47 unsigned long flags = sd->flags; in sched_domain_debug_one()
52 printk(KERN_DEBUG "%*s domain-%d: ", level, "", level); in sched_domain_debug_one()
54 cpumask_pr_args(sched_domain_span(sd)), sd->name); in sched_domain_debug_one()
57 printk(KERN_ERR "ERROR: domain->span does not contain CPU%d\n", cpu); in sched_domain_debug_one()
60 printk(KERN_ERR "ERROR: domain->groups does not contain CPU%d\n", cpu); in sched_domain_debug_one()
67 if ((meta_flags & SDF_SHARED_CHILD) && sd->child && in sched_domain_debug_one()
68 !(sd->child->flags & flag)) in sched_domain_debug_one()
69 printk(KERN_ERR "ERROR: flag %s set here but not in child\n", in sched_domain_debug_one()
[all …]

12345678910>>...33