tree_node (reference) in projects: OK3568_Linux_fs

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:tree_node (Results 1 – 25 of 35) sorted by relevance

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A D	print-tree.h	`24 extern void debug_raw (const tree_node &ref); 25 extern void debug_raw (const tree_node ptr); 26 extern void debug (const tree_node &ref); 27 extern void debug (const tree_node ptr); 28 extern void debug_verbose (const tree_node &ref); 29 extern void debug_verbose (const tree_node ptr); 30 extern void debug_head (const tree_node &ref); 31 extern void debug_head (const tree_node ptr); 32 extern void debug_body (const tree_node &ref); 33 extern void debug_body (const tree_node *ptr);`
H A D	ggc.h	`306 inline union tree_node * 309 return (union tree_node ) ggc_internal_alloc (s PASS_MEM_STAT); in ggc_alloc_tree_node_stat() 312 inline union tree_node 315 return (union tree_node *) ggc_internal_cleared_alloc (s PASS_MEM_STAT); in ggc_alloc_cleared_tree_node_stat()`
H A D	coretypes.h	`96 union tree_node; 97 typedef union tree_node tree; 98 typedef const union tree_node const_tree;`
H A D	treestruct.def	`27 union tree_node. 30 union tree_node for garbage collection purposes, as well as`
H A D	tree-hash-traits.h	`24 struct tree_operand_hash : ggc_ptr_hash <tree_node>`
H A D	cpplib.h	`219 GTY ((nested_ptr (union tree_node, 229 GTY ((nested_ptr (union tree_node, 235 GTY ((nested_ptr (union tree_node, 765 nested_ptr (union tree_node,`
H A D	gimple-ssa.h	`50 struct ssa_name_hasher : ggc_ptr_hash<tree_node>`
H A D	line-map.h	`469 GTY ((nested_ptr (union tree_node,`
H A D	system.h	`1141 #define CONST_CAST_TREE(X) CONST_CAST (union tree_node *, (X))`
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A D	print-tree.h	`24 extern void debug_raw (const tree_node &ref); 25 extern void debug_raw (const tree_node ptr); 26 extern void debug (const tree_node &ref); 27 extern void debug (const tree_node ptr); 28 extern void debug_verbose (const tree_node &ref); 29 extern void debug_verbose (const tree_node ptr); 30 extern void debug_head (const tree_node &ref); 31 extern void debug_head (const tree_node ptr); 32 extern void debug_body (const tree_node &ref); 33 extern void debug_body (const tree_node *ptr);`
H A D	ggc.h	`306 inline union tree_node * 309 return (union tree_node ) ggc_internal_alloc (s PASS_MEM_STAT); in ggc_alloc_tree_node_stat() 312 inline union tree_node 315 return (union tree_node *) ggc_internal_cleared_alloc (s PASS_MEM_STAT); in ggc_alloc_cleared_tree_node_stat()`
H A D	coretypes.h	`96 union tree_node; 97 typedef union tree_node tree; 98 typedef const union tree_node const_tree;`
H A D	treestruct.def	`27 union tree_node. 30 union tree_node for garbage collection purposes, as well as`
H A D	tree-hash-traits.h	`24 struct tree_operand_hash : ggc_ptr_hash <tree_node>`
H A D	cpplib.h	`219 GTY ((nested_ptr (union tree_node, 229 GTY ((nested_ptr (union tree_node, 235 GTY ((nested_ptr (union tree_node, 765 nested_ptr (union tree_node,`
H A D	gimple-ssa.h	`50 struct ssa_name_hasher : ggc_ptr_hash<tree_node>`
H A D	line-map.h	`469 GTY ((nested_ptr (union tree_node,`
H A D	system.h	`1141 #define CONST_CAST_TREE(X) CONST_CAST (union tree_node *, (X))`
H A D	tree-core.h	`1970 desc ("tree_node_structure (&%h)"), variable_size)) tree_node { union`
/OK3568_Linux_fs/kernel/net/tipc/
H A D	group.c	63 struct rb_node tree_node; member 203 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_join() 219 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_delete() 239 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_member() 269 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_node() 285 tmp = container_of(*n, struct tipc_member, tree_node); in tipc_group_add_to_tree() 287 tmp = container_of(parent, struct tipc_member, tree_node); in tipc_group_add_to_tree() 296 rb_link_node(&m->tree_node, parent, n); in tipc_group_add_to_tree() 297 rb_insert_color(&m->tree_node, &grp->members); in tipc_group_add_to_tree() 339 rb_erase(&m->tree_node, &grp->members); in tipc_group_delete_member() [all …]
H A D	name_table.c	64 struct rb_node tree_node; member 92 struct service_range, tree_node, u32, max, in RB_DECLARE_CALLBACKS_MAX() argument 96 (container_of(rbtree_node, struct service_range, tree_node)) in RB_DECLARE_CALLBACKS_MAX() 113 sr = service_range_match_next(&(sr)->tree_node, \ 312 rb_link_node(&sr->tree_node, parent, n); in tipc_service_create_range() 313 rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_service_create_range() 515 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_nametbl_remove_publ() 710 sr = container_of(n, struct service_range, tree_node); in tipc_nametbl_build_group() 881 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) { in tipc_service_delete() 886 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_service_delete() [all …]
/OK3568_Linux_fs/buildroot/package/odb/
H A D	0006-Adapt-to-changes-in-GCC-8.patch	`84 + tree tree_node ( 86 + scope_->tree_node (), get_identifier (n.c_str ()))); 88 tree tree_node ( 90 get_identifier (n.c_str ()), scope_->tree_node ())); 93 namespace_& node (unit_->new_node<namespace_> (f, l, c, tree_node));`
/OK3568_Linux_fs/u-boot/scripts/dtc/libfdt/
H A D	fdt_overlay.c	`215 int tree_node, in overlay_update_local_node_references() argument 239 tree_val = fdt_getprop(fdto, tree_node, name, &tree_len); in overlay_update_local_node_references() 264 tree_node, in overlay_update_local_node_references() 283 tree_child = fdt_subnode_offset(fdto, tree_node, in overlay_update_local_node_references()`
/OK3568_Linux_fs/kernel/scripts/dtc/libfdt/
H A D	fdt_overlay.c	`221 int tree_node, in overlay_update_local_node_references() argument 246 tree_val = fdt_getprop(fdto, tree_node, name, &tree_len); in overlay_update_local_node_references() 271 tree_node, in overlay_update_local_node_references() 290 tree_child = fdt_subnode_offset(fdto, tree_node, in overlay_update_local_node_references()`
/OK3568_Linux_fs/kernel/mm/
H A D	memcontrol.c	623 tree_node); in __mem_cgroup_insert_exceeded() 638 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded() 640 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded() 641 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded() 651 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded() 652 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded() 654 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded() 742 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()