node 79 arch/x86/include/asm/amd_nb.h static inline struct amd_northbridge *node_to_amd_nb(int node) node 81 arch/x86/include/asm/amd_nb.h return (node < amd_northbridges.num) ? &amd_northbridges.nb[node] : NULL; node 196 arch/x86/include/asm/io_apic.h extern int mp_set_gsi_attr(u32 gsi, int trigger, int polarity, int node); node 36 arch/x86/include/asm/numa.h static inline void set_apicid_to_node(int apicid, s16 node) node 38 arch/x86/include/asm/numa.h __apicid_to_node[apicid] = node; node 44 arch/x86/include/asm/numa.h static inline void set_apicid_to_node(int apicid, s16 node) node 59 arch/x86/include/asm/numa.h extern void numa_set_node(int cpu, int node); node 65 arch/x86/include/asm/numa.h static inline void numa_set_node(int cpu, int node) { } node 73 arch/x86/include/asm/numa.h void debug_cpumask_set_cpu(int cpu, int node, bool enable); node 45 arch/x86/include/asm/numachip/numachip_csr.h static inline void *gcsr_address(int node, unsigned long offset) node 48 arch/x86/include/asm/numachip/numachip_csr.h CSR_NODE_BITS(node & CSR_NODE_MASK) | (offset & CSR_OFFSET_MASK)); node 57 arch/x86/include/asm/numachip/numachip_csr.h static inline unsigned int read_gcsr(int node, unsigned long offset) node 59 arch/x86/include/asm/numachip/numachip_csr.h return swab32(readl(gcsr_address(node, offset))); node 62 arch/x86/include/asm/numachip/numachip_csr.h static inline void write_gcsr(int node, unsigned long offset, unsigned int val) node 64 arch/x86/include/asm/numachip/numachip_csr.h writel(swab32(val), gcsr_address(node, offset)); node 16 arch/x86/include/asm/pci.h int node; /* NUMA node */ node 129 arch/x86/include/asm/pci.h return sd->node; node 135 arch/x86/include/asm/pci.h int node; node 137 arch/x86/include/asm/pci.h node = __pcibus_to_node(bus); node 138 arch/x86/include/asm/pci.h return (node == -1) ? cpu_online_mask : node 139 arch/x86/include/asm/pci.h cpumask_of_node(node); node 76 arch/x86/include/asm/topology.h extern const struct cpumask *cpumask_of_node(int node); node 79 arch/x86/include/asm/topology.h static inline const struct cpumask *cpumask_of_node(int node) node 81 arch/x86/include/asm/topology.h return node_to_cpumask_map[node]; node 91 arch/x86/include/asm/topology.h #define parent_node(node) (node) node 142 arch/x86/include/asm/x86_init.h void (*fixup_cpu_id)(struct cpuinfo_x86 *c, int node); node 336 include/acpi/acpi_bus.h struct list_head node; node 347 include/acpi/acpi_bus.h struct list_head node; node 402 include/acpi/acpi_bus.h struct list_head node; node 152 include/asm-generic/gpio.h struct list_head node; node 38 include/asm-generic/topology.h #define set_numa_node(node) node 41 include/asm-generic/topology.h #define set_cpu_numa_node(cpu, node) node 48 include/asm-generic/topology.h #define parent_node(node) ((void)(node),0) node 51 include/asm-generic/topology.h #define cpumask_of_node(node) ((void)node, cpu_online_mask) node 68 include/asm-generic/topology.h #define set_numa_mem(node) node 71 include/asm-generic/topology.h #define set_cpu_numa_mem(cpu, node) node 25 include/drm/bridge/ptn3460.h struct i2c_client *client, struct device_node *node); node 30 include/drm/bridge/ptn3460.h struct device_node *node) node 93 include/drm/drm_mm.h void (*color_adjust)(struct drm_mm_node *node, unsigned long color, node 107 include/drm/drm_mm.h static inline bool drm_mm_node_allocated(struct drm_mm_node *node) node 109 include/drm/drm_mm.h return node->allocated; node 221 include/drm/drm_mm.h int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node); node 224 include/drm/drm_mm.h struct drm_mm_node *node, node 247 include/drm/drm_mm.h struct drm_mm_node *node, node 252 include/drm/drm_mm.h return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags, node 257 include/drm/drm_mm.h struct drm_mm_node *node, node 284 include/drm/drm_mm.h struct drm_mm_node *node, node 291 include/drm/drm_mm.h return drm_mm_insert_node_in_range_generic(mm, node, size, alignment, node 296 include/drm/drm_mm.h void drm_mm_remove_node(struct drm_mm_node *node); node 314 include/drm/drm_mm.h bool drm_mm_scan_add_block(struct drm_mm_node *node); node 315 include/drm/drm_mm.h bool drm_mm_scan_remove_block(struct drm_mm_node *node); node 64 include/drm/drm_vma_manager.h struct drm_vma_offset_node *node, unsigned long pages); node 66 include/drm/drm_vma_manager.h struct drm_vma_offset_node *node); node 68 include/drm/drm_vma_manager.h int drm_vma_node_allow(struct drm_vma_offset_node *node, struct file *filp); node 69 include/drm/drm_vma_manager.h void drm_vma_node_revoke(struct drm_vma_offset_node *node, struct file *filp); node 70 include/drm/drm_vma_manager.h bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node, node 90 include/drm/drm_vma_manager.h struct drm_vma_offset_node *node; node 92 include/drm/drm_vma_manager.h node = drm_vma_offset_lookup(mgr, start, pages); node 93 include/drm/drm_vma_manager.h return (node && node->vm_node.start == start) ? node : NULL; node 145 include/drm/drm_vma_manager.h static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) node 147 include/drm/drm_vma_manager.h memset(node, 0, sizeof(*node)); node 148 include/drm/drm_vma_manager.h node->vm_files = RB_ROOT; node 149 include/drm/drm_vma_manager.h rwlock_init(&node->vm_lock); node 166 include/drm/drm_vma_manager.h static inline unsigned long drm_vma_node_start(struct drm_vma_offset_node *node) node 168 include/drm/drm_vma_manager.h return node->vm_node.start; node 183 include/drm/drm_vma_manager.h static inline unsigned long drm_vma_node_size(struct drm_vma_offset_node *node) node 185 include/drm/drm_vma_manager.h return node->vm_node.size; node 196 include/drm/drm_vma_manager.h static inline bool drm_vma_node_has_offset(struct drm_vma_offset_node *node) node 198 include/drm/drm_vma_manager.h return drm_mm_node_allocated(&node->vm_node); node 213 include/drm/drm_vma_manager.h static inline __u64 drm_vma_node_offset_addr(struct drm_vma_offset_node *node) node 215 include/drm/drm_vma_manager.h return ((__u64)node->vm_node.start) << PAGE_SHIFT; node 230 include/drm/drm_vma_manager.h static inline void drm_vma_node_unmap(struct drm_vma_offset_node *node, node 233 include/drm/drm_vma_manager.h if (drm_vma_node_has_offset(node)) node 235 include/drm/drm_vma_manager.h drm_vma_node_offset_addr(node), node 236 include/drm/drm_vma_manager.h drm_vma_node_size(node) << PAGE_SHIFT, 1); node 251 include/drm/drm_vma_manager.h static inline int drm_vma_node_verify_access(struct drm_vma_offset_node *node, node 254 include/drm/drm_vma_manager.h return drm_vma_node_is_allowed(node, filp) ? 0 : -EACCES; node 293 include/linux/acpi.h struct list_head node; node 36 include/linux/alarmtimer.h struct timerqueue_node node; node 44 include/linux/async_tx.h struct list_head node; node 70 include/linux/atmel_tc.h struct list_head node; node 18 include/linux/attribute_container.h struct list_head node; node 161 include/linux/backlight.h struct backlight_device *of_find_backlight_by_node(struct device_node *node); node 164 include/linux/backlight.h of_find_backlight_by_node(struct device_node *node) node 35 include/linux/btree.h unsigned long *node; node 50 include/linux/ceph/mon_client.h struct rb_node node; node 182 include/linux/ceph/osd_client.h struct rb_node node; node 30 include/linux/ceph/osdmap.h struct rb_node node; node 73 include/linux/ceph/osdmap.h struct rb_node node; node 415 include/linux/cgroup.h struct list_head node; /* anchored at ss->cfts */ node 414 include/linux/clk-provider.h void of_fixed_factor_clk_setup(struct device_node *node); node 521 include/linux/clk-provider.h void of_gpio_clk_gate_setup(struct device_node *node); node 61 include/linux/clk.h struct list_head node; node 13 include/linux/clk/clk-conf.h int of_clk_set_defaults(struct device_node *node, bool clk_supplier); node 15 include/linux/clk/clk-conf.h static inline int of_clk_set_defaults(struct device_node *node, node 138 include/linux/clk/ti.h struct list_head node; node 292 include/linux/clk/ti.h void __iomem *ti_clk_get_reg_addr(struct device_node *node, int index); node 297 include/linux/clk/ti.h int ti_clk_retry_init(struct device_node *node, struct clk_hw *hw, node 299 include/linux/clk/ti.h int of_ti_clk_autoidle_setup(struct device_node *node); node 300 include/linux/clk/ti.h int ti_clk_add_component(struct device_node *node, struct clk_hw *hw, int type); node 21 include/linux/clkdev.h struct list_head node; node 136 include/linux/compaction.h extern int compaction_register_node(struct node *node); node 137 include/linux/compaction.h extern void compaction_unregister_node(struct node *node); node 141 include/linux/compaction.h static inline int compaction_register_node(struct node *node) node 146 include/linux/compaction.h static inline void compaction_unregister_node(struct node *node) node 349 include/linux/cper.h __u16 node; node 369 include/linux/cper.h __u16 node; node 682 include/linux/cpumask.h bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node); node 684 include/linux/cpumask.h bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node); node 701 include/linux/cpumask.h int node) node 713 include/linux/cpumask.h int node) node 51 include/linux/cpuset.h extern int __cpuset_node_allowed_softwall(int node, gfp_t gfp_mask); node 52 include/linux/cpuset.h extern int __cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask); node 54 include/linux/cpuset.h static inline int cpuset_node_allowed_softwall(int node, gfp_t gfp_mask) node 57 include/linux/cpuset.h __cpuset_node_allowed_softwall(node, gfp_mask); node 60 include/linux/cpuset.h static inline int cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask) node 63 include/linux/cpuset.h __cpuset_node_allowed_hardwall(node, gfp_mask); node 182 include/linux/cpuset.h static inline int cpuset_node_allowed_softwall(int node, gfp_t gfp_mask) node 187 include/linux/cpuset.h static inline int cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask) node 36 include/linux/dca.h struct list_head node; node 43 include/linux/dca.h struct list_head node; node 28 include/linux/debugobjects.h struct hlist_node node; node 111 include/linux/devfreq.h struct list_head node; node 153 include/linux/devfreq.h struct list_head node; node 311 include/linux/device.h struct list_head node; node 469 include/linux/device.h struct list_head node; node 826 include/linux/device.h static inline void set_dev_node(struct device *dev, int node) node 828 include/linux/device.h dev->numa_node = node; node 835 include/linux/device.h static inline void set_dev_node(struct device *dev, int node) node 86 include/linux/dio.h struct list_head node; node 161 include/linux/dma-buf.h struct list_head node; node 202 include/linux/elevator.h #define rb_entry_rq(node) rb_entry((node), struct request, rb_node) node 99 include/linux/enclosure.h struct list_head node; node 450 include/linux/fb.h int node; node 798 include/linux/fb.h pr_err("fb%d: " fmt, (fb_info)->node, ##__VA_ARGS__) node 800 include/linux/fb.h pr_notice("fb%d: " fmt, (fb_info)->node, ##__VA_ARGS__) node 802 include/linux/fb.h pr_warn("fb%d: " fmt, (fb_info)->node, ##__VA_ARGS__) node 804 include/linux/fb.h pr_info("fb%d: " fmt, (fb_info)->node, ##__VA_ARGS__) node 806 include/linux/fb.h pr_debug("fb%d: " fmt, (fb_info)->node, ##__VA_ARGS__) node 101 include/linux/fence.h struct list_head node; node 184 include/linux/firewire.h struct fw_node *node; node 50 include/linux/gameport.h struct list_head node; node 340 include/linux/gfp.h int node); node 344 include/linux/gfp.h #define alloc_pages_vma(gfp_mask, order, vma, addr, node) \ node 350 include/linux/gfp.h #define alloc_page_vma_node(gfp_mask, vma, addr, node) \ node 351 include/linux/gfp.h alloc_pages_vma(gfp_mask, 0, vma, addr, node) node 55 include/linux/hashtable.h #define hash_add(hashtable, node, key) \ node 56 include/linux/hashtable.h hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))]) node 64 include/linux/hashtable.h #define hash_add_rcu(hashtable, node, key) \ node 65 include/linux/hashtable.h hlist_add_head_rcu(node, &hashtable[hash_min(key, HASH_BITS(hashtable))]) node 71 include/linux/hashtable.h static inline bool hash_hashed(struct hlist_node *node) node 73 include/linux/hashtable.h return !hlist_unhashed(node); node 100 include/linux/hashtable.h static inline void hash_del(struct hlist_node *node) node 102 include/linux/hashtable.h hlist_del_init(node); node 109 include/linux/hashtable.h static inline void hash_del_rcu(struct hlist_node *node) node 111 include/linux/hashtable.h hlist_del_init_rcu(node); node 47 include/linux/hid-debug.h struct list_head node; node 41 include/linux/hidraw.h struct list_head node; node 109 include/linux/hrtimer.h struct timerqueue_node node; node 200 include/linux/hrtimer.h timer->node.expires = time; node 207 include/linux/hrtimer.h timer->node.expires = ktime_add_safe(time, delta); node 213 include/linux/hrtimer.h timer->node.expires = ktime_add_safe(time, ns_to_ktime(delta)); node 218 include/linux/hrtimer.h timer->node.expires.tv64 = tv64; node 224 include/linux/hrtimer.h timer->node.expires = ktime_add_safe(timer->node.expires, time); node 230 include/linux/hrtimer.h timer->node.expires = ktime_add_ns(timer->node.expires, ns); node 236 include/linux/hrtimer.h return timer->node.expires; node 246 include/linux/hrtimer.h return timer->node.expires.tv64; node 255 include/linux/hrtimer.h return ktime_to_ns(timer->node.expires); node 260 include/linux/hrtimer.h return ktime_sub(timer->node.expires, timer->base->get_time()); node 562 include/linux/i2c.h extern struct i2c_client *of_find_i2c_device_by_node(struct device_node *node); node 565 include/linux/i2c.h extern struct i2c_adapter *of_find_i2c_adapter_by_node(struct device_node *node); node 569 include/linux/i2c.h static inline struct i2c_client *of_find_i2c_device_by_node(struct device_node *node) node 574 include/linux/i2c.h static inline struct i2c_adapter *of_find_i2c_adapter_by_node(struct device_node *node) node 90 include/linux/init_task.h .node = { \ node 186 include/linux/input.h struct list_head node; node 309 include/linux/input.h struct list_head node; node 340 include/linux/intel-iommu.h int node; node 14 include/linux/interval_tree.h interval_tree_insert(struct interval_tree_node *node, struct rb_root *root); node 17 include/linux/interval_tree.h interval_tree_remove(struct interval_tree_node *node, struct rb_root *root); node 24 include/linux/interval_tree.h interval_tree_iter_next(struct interval_tree_node *node, node 45 include/linux/interval_tree_generic.h static inline ITTYPE ITPREFIX ## _compute_subtree_last(ITSTRUCT *node) \ node 47 include/linux/interval_tree_generic.h ITTYPE max = ITLAST(node), subtree_last; \ node 48 include/linux/interval_tree_generic.h if (node->ITRB.rb_left) { \ node 49 include/linux/interval_tree_generic.h subtree_last = rb_entry(node->ITRB.rb_left, \ node 54 include/linux/interval_tree_generic.h if (node->ITRB.rb_right) { \ node 55 include/linux/interval_tree_generic.h subtree_last = rb_entry(node->ITRB.rb_right, \ node 68 include/linux/interval_tree_generic.h ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, struct rb_root *root) \ node 71 include/linux/interval_tree_generic.h ITTYPE start = ITSTART(node), last = ITLAST(node); \ node 85 include/linux/interval_tree_generic.h node->ITSUBTREE = last; \ node 86 include/linux/interval_tree_generic.h rb_link_node(&node->ITRB, rb_parent, link); \ node 87 include/linux/interval_tree_generic.h rb_insert_augmented(&node->ITRB, root, &ITPREFIX ## _augment); \ node 90 include/linux/interval_tree_generic.h ITSTATIC void ITPREFIX ## _remove(ITSTRUCT *node, struct rb_root *root) \ node 92 include/linux/interval_tree_generic.h rb_erase_augmented(&node->ITRB, root, &ITPREFIX ## _augment); \ node 105 include/linux/interval_tree_generic.h ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \ node 112 include/linux/interval_tree_generic.h if (node->ITRB.rb_left) { \ node 113 include/linux/interval_tree_generic.h ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \ node 124 include/linux/interval_tree_generic.h node = left; \ node 128 include/linux/interval_tree_generic.h if (ITSTART(node) <= last) { /* Cond1 */ \ node 129 include/linux/interval_tree_generic.h if (start <= ITLAST(node)) /* Cond2 */ \ node 130 include/linux/interval_tree_generic.h return node; /* node is leftmost match */ \ node 131 include/linux/interval_tree_generic.h if (node->ITRB.rb_right) { \ node 132 include/linux/interval_tree_generic.h node = rb_entry(node->ITRB.rb_right, \ node 134 include/linux/interval_tree_generic.h if (start <= node->ITSUBTREE) \ node 145 include/linux/interval_tree_generic.h ITSTRUCT *node; \ node 149 include/linux/interval_tree_generic.h node = rb_entry(root->rb_node, ITSTRUCT, ITRB); \ node 150 include/linux/interval_tree_generic.h if (node->ITSUBTREE < start) \ node 152 include/linux/interval_tree_generic.h return ITPREFIX ## _subtree_search(node, start, last); \ node 156 include/linux/interval_tree_generic.h ITPREFIX ## _iter_next(ITSTRUCT *node, ITTYPE start, ITTYPE last) \ node 158 include/linux/interval_tree_generic.h struct rb_node *rb = node->ITRB.rb_right, *prev; \ node 177 include/linux/interval_tree_generic.h rb = rb_parent(&node->ITRB); \ node 180 include/linux/interval_tree_generic.h prev = &node->ITRB; \ node 181 include/linux/interval_tree_generic.h node = rb_entry(rb, ITSTRUCT, ITRB); \ node 182 include/linux/interval_tree_generic.h rb = node->ITRB.rb_right; \ node 186 include/linux/interval_tree_generic.h if (last < ITSTART(node)) /* !Cond1 */ \ node 188 include/linux/interval_tree_generic.h else if (start <= ITLAST(node)) /* Cond2 */ \ node 189 include/linux/interval_tree_generic.h return node; \ node 150 include/linux/iocontext.h gfp_t gfp_flags, int node); node 24 include/linux/iova.h struct rb_node node; node 150 include/linux/irq.h unsigned int node; node 598 include/linux/irq.h int __irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node, node 602 include/linux/irq.h #define irq_alloc_descs(irq, from, cnt, node) \ node 603 include/linux/irq.h __irq_alloc_descs(irq, from, cnt, node, THIS_MODULE) node 605 include/linux/irq.h #define irq_alloc_desc(node) \ node 606 include/linux/irq.h irq_alloc_descs(-1, 0, 1, node) node 608 include/linux/irq.h #define irq_alloc_desc_at(at, node) \ node 609 include/linux/irq.h irq_alloc_descs(at, at, 1, node) node 611 include/linux/irq.h #define irq_alloc_desc_from(from, node) \ node 612 include/linux/irq.h irq_alloc_descs(-1, from, 1, node) node 614 include/linux/irq.h #define irq_alloc_descs_from(from, cnt, node) \ node 615 include/linux/irq.h irq_alloc_descs(-1, from, cnt, node) node 624 include/linux/irq.h unsigned int irq_alloc_hwirqs(int cnt, int node); node 625 include/linux/irq.h static inline unsigned int irq_alloc_hwirq(int node) node 627 include/linux/irq.h return irq_alloc_hwirqs(1, node); node 634 include/linux/irq.h int arch_setup_hwirq(unsigned int irq, int node); node 33 include/linux/irqchip/arm-vic.h u32 vic_sources, u32 resume_sources, struct device_node *node); node 9 include/linux/irqchip/versatile-fpga.h struct device_node *node); node 10 include/linux/irqchip/versatile-fpga.h int fpga_irq_of_init(struct device_node *node, node 61 include/linux/irqdomain.h int (*match)(struct irq_domain *d, struct device_node *node); node 64 include/linux/irqdomain.h int (*xlate)(struct irq_domain *d, struct device_node *node, node 129 include/linux/irqdomain.h extern struct irq_domain *irq_find_host(struct device_node *node); node 27 include/linux/irqnr.h #define irq_node(irq) (irq_get_irq_data(irq)->node) node 11 include/linux/kmemcheck.h void kmemcheck_alloc_shadow(struct page *page, int order, gfp_t flags, int node); node 93 include/linux/kmemcheck.h kmemcheck_alloc_shadow(struct page *page, int order, gfp_t flags, int node) node 10 include/linux/kthread.h int node, node 74 include/linux/kthread.h struct list_head node; node 85 include/linux/kthread.h .node = LIST_HEAD_INIT((work).node), \ node 120 include/linux/kthread.h INIT_LIST_HEAD(&(work)->node); \ node 68 include/linux/leds.h struct list_head node; /* LED Device list */ node 32 include/linux/list_lru.h struct list_lru_node *node; node 104 include/linux/llist.h #define llist_for_each(pos, node) \ node 105 include/linux/llist.h for ((pos) = (node); pos; (pos) = (pos)->next) node 122 include/linux/llist.h #define llist_for_each_entry(pos, node, member) \ node 123 include/linux/llist.h for ((pos) = llist_entry((node), typeof(*(pos)), member); \ node 144 include/linux/llist.h #define llist_for_each_entry_safe(pos, n, node, member) \ node 145 include/linux/llist.h for (pos = llist_entry((node), typeof(*pos), member); \ node 163 include/linux/llist.h static inline struct llist_node *llist_next(struct llist_node *node) node 165 include/linux/llist.h return node->next; node 85 include/linux/mailbox_controller.h struct list_head node; node 89 include/linux/mfd/ipaq-micro.h struct list_head node; node 87 include/linux/mfd/mc13xxx.h struct device_node *node; node 139 include/linux/mfd/ucb1x00.h struct list_head node; node 155 include/linux/mfd/ucb1x00.h struct list_head node; node 82 include/linux/migrate.h struct vm_area_struct *vma, int node); node 83 include/linux/migrate.h extern bool migrate_ratelimited(int node); node 93 include/linux/migrate.h struct vm_area_struct *vma, int node) node 97 include/linux/migrate.h static inline bool migrate_ratelimited(int node) node 108 include/linux/migrate.h struct page *page, int node); node 114 include/linux/migrate.h struct page *page, int node) node 880 include/linux/mlx4/device.h int mlx4_bf_alloc(struct mlx4_dev *dev, struct mlx4_bf *bf, int node); node 760 include/linux/mm.h return zone->node; node 912 include/linux/mm.h static inline void set_page_node(struct page *page, unsigned long node) node 915 include/linux/mm.h page->flags |= (node & NODES_MASK) << NODES_PGSHIFT; node 919 include/linux/mm.h unsigned long node, unsigned long pfn) node 922 include/linux/mm.h set_page_node(page, node); node 1748 include/linux/mm.h void vma_interval_tree_insert(struct vm_area_struct *node, node 1750 include/linux/mm.h void vma_interval_tree_insert_after(struct vm_area_struct *node, node 1753 include/linux/mm.h void vma_interval_tree_remove(struct vm_area_struct *node, node 1757 include/linux/mm.h struct vm_area_struct *vma_interval_tree_iter_next(struct vm_area_struct *node, node 1770 include/linux/mm.h void anon_vma_interval_tree_insert(struct anon_vma_chain *node, node 1772 include/linux/mm.h void anon_vma_interval_tree_remove(struct anon_vma_chain *node, node 1777 include/linux/mm.h struct anon_vma_chain *node, unsigned long start, unsigned long last); node 1779 include/linux/mm.h void anon_vma_interval_tree_verify(struct anon_vma_chain *node); node 2102 include/linux/mm.h pgd_t *vmemmap_pgd_populate(unsigned long addr, int node); node 2103 include/linux/mm.h pud_t *vmemmap_pud_populate(pgd_t *pgd, unsigned long addr, int node); node 2104 include/linux/mm.h pmd_t *vmemmap_pmd_populate(pud_t *pud, unsigned long addr, int node); node 2105 include/linux/mm.h pte_t *vmemmap_pte_populate(pmd_t *pmd, unsigned long addr, int node); node 2106 include/linux/mm.h void *vmemmap_alloc_block(unsigned long size, int node); node 2107 include/linux/mm.h void *vmemmap_alloc_block_buf(unsigned long size, int node); node 2110 include/linux/mm.h int node); node 2111 include/linux/mm.h int vmemmap_populate(unsigned long start, unsigned long end, int node); node 512 include/linux/mmc/card.h #define mmc_list_to_card(l) container_of(l, struct mmc_card, node) node 344 include/linux/mmzone.h int node; node 962 include/linux/mmzone.h return zoneref->zone->node; node 587 include/linux/netdevice.h static inline void netdev_queue_numa_node_write(struct netdev_queue *q, int node) node 590 include/linux/netdevice.h q->numa_node = node; node 30 include/linux/node.h extern struct node *node_devices[]; node 31 include/linux/node.h typedef void (*node_registration_func_t)(struct node *); node 33 include/linux/node.h extern void unregister_node(struct node *node); node 82 include/linux/node.h #define to_node(device) container_of(device, struct node, dev) node 110 include/linux/nodemask.h #define node_set(node, dst) __node_set((node), &(dst)) node 111 include/linux/nodemask.h static __always_inline void __node_set(int node, volatile nodemask_t *dstp) node 113 include/linux/nodemask.h set_bit(node, dstp->bits); node 116 include/linux/nodemask.h #define node_clear(node, dst) __node_clear((node), &(dst)) node 117 include/linux/nodemask.h static inline void __node_clear(int node, volatile nodemask_t *dstp) node 119 include/linux/nodemask.h clear_bit(node, dstp->bits); node 135 include/linux/nodemask.h #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) node 137 include/linux/nodemask.h #define node_test_and_set(node, nodemask) \ node 138 include/linux/nodemask.h __node_test_and_set((node), &(nodemask)) node 139 include/linux/nodemask.h static inline int __node_test_and_set(int node, nodemask_t *addr) node 141 include/linux/nodemask.h return test_and_set_bit(node, addr->bits); node 257 include/linux/nodemask.h static inline void init_nodemask_of_node(nodemask_t *mask, int node) node 260 include/linux/nodemask.h node_set(node, *mask); node 263 include/linux/nodemask.h #define nodemask_of_node(node) \ node 267 include/linux/nodemask.h m.bits[0] = 1UL << (node); \ node 269 include/linux/nodemask.h init_nodemask_of_node(&m, (node)); \ node 370 include/linux/nodemask.h #define for_each_node_mask(node, mask) \ node 371 include/linux/nodemask.h for ((node) = first_node(mask); \ node 372 include/linux/nodemask.h (node) < MAX_NUMNODES; \ node 373 include/linux/nodemask.h (node) = next_node((node), (mask))) node 375 include/linux/nodemask.h #define for_each_node_mask(node, mask) \ node 377 include/linux/nodemask.h for ((node) = 0; (node) < 1; (node)++) node 409 include/linux/nodemask.h static inline int node_state(int node, enum node_states state) node 411 include/linux/nodemask.h return node_isset(node, node_states[state]); node 414 include/linux/nodemask.h static inline void node_set_state(int node, enum node_states state) node 416 include/linux/nodemask.h __node_set(node, &node_states[state]); node 419 include/linux/nodemask.h static inline void node_clear_state(int node, enum node_states state) node 421 include/linux/nodemask.h __node_clear(node, &node_states[state]); node 460 include/linux/nodemask.h static inline int node_state(int node, enum node_states state) node 462 include/linux/nodemask.h return node == 0; node 465 include/linux/nodemask.h static inline void node_set_state(int node, enum node_states state) node 469 include/linux/nodemask.h static inline void node_clear_state(int node, enum node_states state) node 478 include/linux/nodemask.h #define for_each_node_state(node, __state) \ node 479 include/linux/nodemask.h for ( (node) = 0; (node) == 0; (node) = 1) node 487 include/linux/nodemask.h #define node_set_online(node) node_set_state((node), N_ONLINE) node 488 include/linux/nodemask.h #define node_set_offline(node) node_clear_state((node), N_ONLINE) node 506 include/linux/nodemask.h #define node_online(node) node_state((node), N_ONLINE) node 507 include/linux/nodemask.h #define node_possible(node) node_state((node), N_POSSIBLE) node 509 include/linux/nodemask.h #define for_each_node(node) for_each_node_state(node, N_POSSIBLE) node 510 include/linux/nodemask.h #define for_each_online_node(node) for_each_node_state(node, N_ONLINE) node 72 include/linux/nvme.h struct list_head node; node 137 include/linux/nvme.h struct list_head node; node 79 include/linux/of.h static inline void of_node_init(struct device_node *node) node 81 include/linux/of.h kobject_init(&node->kobj, &of_node_ktype); node 85 include/linux/of.h static inline int of_node_is_initialized(struct device_node *node) node 87 include/linux/of.h return node && node->kobj.state_initialized; node 91 include/linux/of.h static inline int of_node_is_attached(struct device_node *node) node 93 include/linux/of.h return node && node->kobj.state_in_sysfs; node 97 include/linux/of.h extern struct device_node *of_node_get(struct device_node *node); node 98 include/linux/of.h extern void of_node_put(struct device_node *node); node 101 include/linux/of.h static inline struct device_node *of_node_get(struct device_node *node) node 103 include/linux/of.h return node; node 105 include/linux/of.h static inline void of_node_put(struct device_node *node) { } node 122 include/linux/of.h static inline bool of_node_is_root(const struct device_node *node) node 124 include/linux/of.h return node && (node->parent == NULL); node 233 include/linux/of.h extern struct device_node *of_get_parent(const struct device_node *node); node 234 include/linux/of.h extern struct device_node *of_get_next_parent(struct device_node *node); node 235 include/linux/of.h extern struct device_node *of_get_next_child(const struct device_node *node, node 238 include/linux/of.h const struct device_node *node, struct device_node *prev); node 240 include/linux/of.h extern struct device_node *of_get_child_by_name(const struct device_node *node, node 279 include/linux/of.h extern const void *of_get_property(const struct device_node *node, node 289 include/linux/of.h const struct of_device_id *matches, const struct device_node *node); node 290 include/linux/of.h extern int of_modalias_node(struct device_node *node, char *modalias, int len); node 388 include/linux/of.h static inline struct device_node *of_get_parent(const struct device_node *node) node 394 include/linux/of.h const struct device_node *node, struct device_node *prev) node 400 include/linux/of.h const struct device_node *node, struct device_node *prev) node 417 include/linux/of.h const struct device_node *node, node 494 include/linux/of.h static inline const void *of_get_property(const struct device_node *node, node 861 include/linux/of.h struct list_head node; node 8 include/linux/of_address.h struct device_node *node; node 52 include/linux/of_address.h struct device_node *node); node 80 include/linux/of_address.h struct device_node *node) node 107 include/linux/of_address.h void __iomem *of_iomap(struct device_node *node, int index); node 30 include/linux/of_fdt.h unsigned long node, node 34 include/linux/of_fdt.h unsigned long node, node 36 include/linux/of_fdt.h extern int of_fdt_match(const void *blob, unsigned long node, node 50 include/linux/of_fdt.h extern int of_scan_flat_dt(int (*it)(unsigned long node, const char *uname, node 53 include/linux/of_fdt.h extern const void *of_get_flat_dt_prop(unsigned long node, const char *name, node 55 include/linux/of_fdt.h extern int of_flat_dt_is_compatible(unsigned long node, const char *name); node 56 include/linux/of_fdt.h extern int of_flat_dt_match(unsigned long node, const char *const *matches); node 60 include/linux/of_fdt.h extern int early_init_dt_scan_chosen(unsigned long node, const char *uname, node 62 include/linux/of_fdt.h extern int early_init_dt_scan_memory(unsigned long node, const char *uname, node 72 include/linux/of_fdt.h extern int early_init_dt_scan_root(unsigned long node, const char *uname, node 30 include/linux/of_graph.h int of_graph_parse_endpoint(const struct device_node *node, node 35 include/linux/of_graph.h const struct device_node *node); node 36 include/linux/of_graph.h struct device_node *of_graph_get_remote_port(const struct device_node *node); node 39 include/linux/of_graph.h static inline int of_graph_parse_endpoint(const struct device_node *node, node 53 include/linux/of_graph.h const struct device_node *node) node 59 include/linux/of_graph.h const struct device_node *node) node 70 include/linux/of_irq.h extern unsigned int irq_of_parse_and_map(struct device_node *node, int index); node 17 include/linux/of_pci.h int of_pci_parse_bus_range(struct device_node *node, struct resource *res); node 18 include/linux/of_pci.h int of_get_pci_domain_nr(struct device_node *node); node 43 include/linux/of_pci.h of_pci_parse_bus_range(struct device_node *node, struct resource *res) node 49 include/linux/of_pci.h of_get_pci_domain_nr(struct device_node *node) node 22 include/linux/of_pdt.h int (*nextprop)(phandle node, char *prev, char *buf); node 25 include/linux/of_pdt.h int (*getproplen)(phandle node, const char *prop); node 26 include/linux/of_pdt.h int (*getproperty)(phandle node, const char *prop, char *buf, node 31 include/linux/of_pdt.h phandle (*getsibling)(phandle node); node 34 include/linux/of_pdt.h int (*pkg2path)(phandle node, char *buf, const int buflen, int *len); node 35 include/linux/of_reserved_mem.h void fdt_reserved_mem_save_node(unsigned long node, const char *uname, node 45 include/linux/of_reserved_mem.h static inline void fdt_reserved_mem_save_node(unsigned long node, node 444 include/linux/pci.h struct list_head node; /* node in list of buses */ node 642 include/linux/pci.h struct list_head node; node 161 include/linux/phy/phy.h struct phy *phy_create(struct device *dev, struct device_node *node, node 164 include/linux/phy/phy.h struct phy *devm_phy_create(struct device *dev, struct device_node *node, node 303 include/linux/phy/phy.h struct device_node *node, node 311 include/linux/phy/phy.h struct device_node *node, node 71 include/linux/pid.h struct hlist_node node; node 179 include/linux/pid.h &(pid)->tasks[type], pids[type].node) { node 60 include/linux/pinctrl/pinctrl.h struct list_head node; node 18 include/linux/platform_data/gpio-dwapb.h struct device_node *node; node 112 include/linux/plist.h #define PLIST_NODE_INIT(node, __prio) \ node 115 include/linux/plist.h .prio_list = LIST_HEAD_INIT((node).prio_list), \ node 116 include/linux/plist.h .node_list = LIST_HEAD_INIT((node).node_list), \ node 134 include/linux/plist.h static inline void plist_node_init(struct plist_node *node, int prio) node 136 include/linux/plist.h node->prio = prio; node 137 include/linux/plist.h INIT_LIST_HEAD(&node->prio_list); node 138 include/linux/plist.h INIT_LIST_HEAD(&node->node_list); node 141 include/linux/plist.h extern void plist_add(struct plist_node *node, struct plist_head *head); node 142 include/linux/plist.h extern void plist_del(struct plist_node *node, struct plist_head *head); node 144 include/linux/plist.h extern void plist_requeue(struct plist_node *node, struct plist_head *head); node 221 include/linux/plist.h static inline int plist_node_empty(const struct plist_node *node) node 223 include/linux/plist.h return list_empty(&node->node_list); node 46 include/linux/pm_qos.h struct plist_node node; node 52 include/linux/pm_qos.h struct list_head node; node 118 include/linux/pm_qos.h int pm_qos_update_target(struct pm_qos_constraints *c, struct plist_node *node, node 87 include/linux/posix-timers.h unsigned int node; node 148 include/linux/power/smartreflex.h struct list_head node; node 84 include/linux/powercap.h struct list_head node; node 182 include/linux/pxa2xx_ssp.h struct list_head node; node 271 include/linux/radix-tree.h struct radix_tree_node *node); node 55 include/linux/rbtree.h #define RB_EMPTY_NODE(node) \ node 56 include/linux/rbtree.h ((node)->__rb_parent_color == (unsigned long)(node)) node 57 include/linux/rbtree.h #define RB_CLEAR_NODE(node) \ node 58 include/linux/rbtree.h ((node)->__rb_parent_color = (unsigned long)(node)) node 79 include/linux/rbtree.h static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, node 82 include/linux/rbtree.h node->__rb_parent_color = (unsigned long)parent; node 83 include/linux/rbtree.h node->rb_left = node->rb_right = NULL; node 85 include/linux/rbtree.h *rb_link = node; node 39 include/linux/rbtree_augmented.h void (*propagate)(struct rb_node *node, struct rb_node *stop); node 44 include/linux/rbtree_augmented.h extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, node 57 include/linux/rbtree_augmented.h rb_insert_augmented(struct rb_node *node, struct rb_root *root, node 60 include/linux/rbtree_augmented.h __rb_insert_augmented(node, root, augment->rotate); node 69 include/linux/rbtree_augmented.h rbstruct *node = rb_entry(rb, rbstruct, rbfield); \ node 70 include/linux/rbtree_augmented.h rbtype augmented = rbcompute(node); \ node 71 include/linux/rbtree_augmented.h if (node->rbaugmented == augmented) \ node 73 include/linux/rbtree_augmented.h node->rbaugmented = augmented; \ node 74 include/linux/rbtree_augmented.h rb = rb_parent(&node->rbfield); \ node 137 include/linux/rbtree_augmented.h __rb_erase_augmented(struct rb_node *node, struct rb_root *root, node 140 include/linux/rbtree_augmented.h struct rb_node *child = node->rb_right, *tmp = node->rb_left; node 152 include/linux/rbtree_augmented.h pc = node->__rb_parent_color; node 154 include/linux/rbtree_augmented.h __rb_change_child(node, child, parent, root); node 163 include/linux/rbtree_augmented.h tmp->__rb_parent_color = pc = node->__rb_parent_color; node 165 include/linux/rbtree_augmented.h __rb_change_child(node, tmp, parent, root); node 183 include/linux/rbtree_augmented.h augment->copy(node, successor); node 207 include/linux/rbtree_augmented.h augment->copy(node, successor); node 211 include/linux/rbtree_augmented.h successor->rb_left = tmp = node->rb_left; node 214 include/linux/rbtree_augmented.h pc = node->__rb_parent_color; node 216 include/linux/rbtree_augmented.h __rb_change_child(node, successor, tmp, root); node 234 include/linux/rbtree_augmented.h rb_erase_augmented(struct rb_node *node, struct rb_root *root, node 237 include/linux/rbtree_augmented.h struct rb_node *rebalance = __rb_erase_augmented(node, root, augment); node 373 include/linux/rculist.h #define hlist_next_rcu(node) (*((struct hlist_node __rcu **)(&(node)->next))) node 374 include/linux/rculist.h #define hlist_pprev_rcu(node) (*((struct hlist_node __rcu **)((node)->pprev))) node 43 include/linux/rculist_nulls.h #define hlist_nulls_next_rcu(node) \ node 44 include/linux/rculist_nulls.h (*((struct hlist_nulls_node __rcu __force **)&(node)->next)) node 19 include/linux/regulator/of_regulator.h struct device_node *node); node 20 include/linux/regulator/of_regulator.h extern int of_regulator_match(struct device *dev, struct device_node *node, node 26 include/linux/regulator/of_regulator.h struct device_node *node) node 32 include/linux/regulator/of_regulator.h struct device_node *node, node 323 include/linux/remoteproc.h struct list_head node; node 409 include/linux/remoteproc.h struct klist_node node; node 475 include/linux/remoteproc.h struct list_head node; node 37 include/linux/reset.h struct reset_control *of_reset_control_get(struct device_node *node, node 83 include/linux/reset.h struct device_node *node, const char *id) node 99 include/linux/rhashtable.h void rhashtable_insert(struct rhashtable *ht, struct rhash_head *node, gfp_t); node 100 include/linux/rhashtable.h bool rhashtable_remove(struct rhashtable *ht, struct rhash_head *node, gfp_t); node 102 include/linux/rio.h struct list_head node; node 224 include/linux/rio.h struct list_head node; node 259 include/linux/rio.h struct list_head node; /* node in global list of ports */ node 308 include/linux/rio.h struct list_head node; /* node in list of networks */ node 388 include/linux/rio.h struct list_head node; node 474 include/linux/rio.h struct list_head node; node 77 include/linux/rtc.h struct timerqueue_node node; node 1675 include/linux/sched.h extern void task_numa_fault(int last_node, int node, int pages, int flags); node 1682 include/linux/sched.h static inline void task_numa_fault(int last_node, int node, int pages, node 50 include/linux/serio.h struct list_head node; node 38 include/linux/sh_clk.h struct list_head node; node 50 include/linux/shdma-base.h struct list_head node; node 774 include/linux/skbuff.h int node); node 823 include/linux/skbuff.h struct sk_buff *__alloc_skb_head(gfp_t priority, int node); node 294 include/linux/slab.h void *__kmalloc_node(size_t size, gfp_t flags, int node); node 295 include/linux/slab.h void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node); node 297 include/linux/slab.h static __always_inline void *__kmalloc_node(size_t size, gfp_t flags, int node) node 302 include/linux/slab.h static __always_inline void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t flags, int node) node 314 include/linux/slab.h int node, size_t size); node 319 include/linux/slab.h int node, size_t size) node 335 include/linux/slab.h int node, size_t size) node 337 include/linux/slab.h return kmem_cache_alloc_node(s, gfpflags, node); node 452 include/linux/slab.h static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) node 463 include/linux/slab.h flags, node, size); node 466 include/linux/slab.h return __kmalloc_node(size, flags, node); node 558 include/linux/slab.h #define kmalloc_node_track_caller(size, flags, node) \ node 559 include/linux/slab.h __kmalloc_node_track_caller(size, flags, node, \ node 564 include/linux/slab.h #define kmalloc_node_track_caller(size, flags, node) \ node 593 include/linux/slab.h static inline void *kzalloc_node(size_t size, gfp_t flags, int node) node 595 include/linux/slab.h return kmalloc_node(size, flags | __GFP_ZERO, node); node 76 include/linux/slab_def.h struct kmem_cache_node *node[MAX_NUMNODES]; node 101 include/linux/slub_def.h struct kmem_cache_node *node[MAX_NUMNODES]; node 430 include/linux/sunrpc/svc.h struct svc_pool *pool, int node); node 117 include/linux/svga.h int svga_compute_pll(const struct svga_pll *pll, u32 f_wanted, u16 *m, u16 *n, u16 *r, int node); node 118 include/linux/svga.h int svga_check_timings(const struct svga_timing_regs *tm, struct fb_var_screeninfo *var, int node); node 119 include/linux/svga.h void svga_set_timings(void __iomem *regbase, const struct svga_timing_regs *tm, struct fb_var_screeninfo *var, u32 hmul, u32 hdiv, u32 vmul, u32 vdiv, u32 hborder, int node); node 265 include/linux/swap.h static inline unsigned int workingset_node_pages(struct radix_tree_node *node) node 267 include/linux/swap.h return node->count & RADIX_TREE_COUNT_MASK; node 270 include/linux/swap.h static inline void workingset_node_pages_inc(struct radix_tree_node *node) node 272 include/linux/swap.h node->count++; node 275 include/linux/swap.h static inline void workingset_node_pages_dec(struct radix_tree_node *node) node 277 include/linux/swap.h node->count--; node 280 include/linux/swap.h static inline unsigned int workingset_node_shadows(struct radix_tree_node *node) node 282 include/linux/swap.h return node->count >> RADIX_TREE_COUNT_SHIFT; node 285 include/linux/swap.h static inline void workingset_node_shadows_inc(struct radix_tree_node *node) node 287 include/linux/swap.h node->count += 1U << RADIX_TREE_COUNT_SHIFT; node 290 include/linux/swap.h static inline void workingset_node_shadows_dec(struct radix_tree_node *node) node 292 include/linux/swap.h node->count -= 1U << RADIX_TREE_COUNT_SHIFT; node 800 include/linux/syscalls.h asmlinkage long sys_getcpu(unsigned __user *cpu, unsigned __user *node, struct getcpu_cache __user *cache); node 15 include/linux/syscore_ops.h struct list_head node; node 119 include/linux/sysctl.h struct rb_node node; node 141 include/linux/sysctl.h struct ctl_node *node; node 81 include/linux/tc.h struct list_head node; /* Node in list of all TC devices. */ node 105 include/linux/tc.h struct list_head node; node 157 include/linux/thermal.h struct list_head node; node 223 include/linux/thermal.h struct list_head node; node 9 include/linux/timerqueue.h struct rb_node node; node 20 include/linux/timerqueue.h struct timerqueue_node *node); node 22 include/linux/timerqueue.h struct timerqueue_node *node); node 24 include/linux/timerqueue.h struct timerqueue_node *node); node 40 include/linux/timerqueue.h static inline void timerqueue_init(struct timerqueue_node *node) node 42 include/linux/timerqueue.h RB_CLEAR_NODE(&node->node); node 42 include/linux/topology.h #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node)) node 45 include/linux/topology.h #define for_each_node_with_cpus(node) \ node 46 include/linux/topology.h for_each_online_node(node) \ node 47 include/linux/topology.h if (nr_cpus_node(node)) node 89 include/linux/topology.h static inline void set_numa_node(int node) node 91 include/linux/topology.h this_cpu_write(numa_node, node); node 96 include/linux/topology.h static inline void set_cpu_numa_node(int cpu, int node) node 98 include/linux/topology.h per_cpu(numa_node, cpu) = node; node 125 include/linux/topology.h static inline void set_numa_mem(int node) node 127 include/linux/topology.h this_cpu_write(_numa_mem_, node); node 128 include/linux/topology.h _node_numa_mem_[numa_node_id()] = node; node 133 include/linux/topology.h static inline int node_to_mem_node(int node) node 135 include/linux/topology.h return _node_numa_mem_[node]; node 155 include/linux/topology.h static inline void set_cpu_numa_mem(int cpu, int node) node 157 include/linux/topology.h per_cpu(_numa_mem_, cpu) = node; node 158 include/linux/topology.h _node_numa_mem_[cpu_to_node(cpu)] = node; node 173 include/linux/topology.h static inline int node_to_mem_node(int node) node 175 include/linux/topology.h return node; node 115 include/linux/udp.h #define udp_portaddr_for_each_entry(__sk, node, list) \ node 116 include/linux/udp.h hlist_nulls_for_each_entry(__sk, node, list, __sk_common.skc_portaddr_node) node 118 include/linux/udp.h #define udp_portaddr_for_each_entry_rcu(__sk, node, list) \ node 119 include/linux/udp.h hlist_nulls_for_each_entry_rcu(__sk, node, list, __sk_common.skc_portaddr_node) node 976 include/linux/usb.h struct list_head node; node 78 include/linux/usb/isp1301.h struct i2c_client *isp1301_get_client(struct device_node *node); node 454 include/linux/uwb.h struct list_head node; node 42 include/linux/vexpress.h int vexpress_config_get_topo(struct device_node *node, u32 *site, node 56 include/linux/vmalloc.h int node, pgprot_t prot); node 70 include/linux/vmalloc.h extern void *vmalloc_node(unsigned long size, int node); node 71 include/linux/vmalloc.h extern void *vzalloc_node(unsigned long size, int node); node 78 include/linux/vmalloc.h pgprot_t prot, int node, const void *caller); node 108 include/linux/vme.h struct list_head node; node 169 include/linux/vmstat.h static inline unsigned long node_page_state(int node, node 172 include/linux/vmstat.h struct zone *zones = NODE_DATA(node)->node_zones; node 192 include/linux/vmstat.h #define node_page_state(node, item) global_page_state(item) node 81 include/linux/xattr.h struct simple_xattr *xattr, *node; node 83 include/linux/xattr.h list_for_each_entry_safe(xattr, node, &xattrs->head, list) { node 55 include/linux/zorro.h struct list_head node; node 88 include/media/media-device.h #define to_media_device(node) container_of(node, struct media_device, devnode) node 44 include/media/v4l2-async.h const struct device_node *node; node 165 include/media/v4l2-ctrls.h struct list_head node; node 224 include/media/v4l2-ctrls.h struct list_head node; node 114 include/media/v4l2-event.h struct list_head node; node 70 include/media/v4l2-of.h int v4l2_of_parse_endpoint(const struct device_node *node, node 74 include/media/v4l2-of.h static inline int v4l2_of_parse_endpoint(const struct device_node *node, node 151 include/net/caif/caif_layer.h struct list_head node; node 15 include/net/datalink.h struct list_head node; node 79 include/net/garp.h struct rb_node node; node 87 include/net/inet_hashtables.h struct hlist_node node; node 97 include/net/inet_hashtables.h hlist_for_each_entry(tb, head, node) node 172 include/net/inet_timewait_sock.h #define inet_twsk_for_each(tw, node, head) \ node 173 include/net/inet_timewait_sock.h hlist_nulls_for_each_entry(tw, node, head, tw_node) node 217 include/net/ip6_fib.h struct fib6_node *root, *node; node 20 include/net/ipx.h __u8 node[IPX_NODE_LEN]; node 71 include/net/ipx.h struct list_head node; /* node in ipx_interfaces list */ node 79 include/net/ipx.h struct list_head node; /* node in ipx_routes list */ node 102 include/net/ipx.h unsigned char node[IPX_NODE_LEN]; node 144 include/net/ipx.h int ipxitf_send(struct ipx_interface *intrfc, struct sk_buff *skb, char *node); node 147 include/net/ipx.h unsigned char *node); node 82 include/net/lapb.h struct list_head node; node 64 include/net/llc.h struct list_head node; node 90 include/net/mrp.h struct rb_node node; node 23 include/net/ping.h #define ping_portaddr_for_each_entry(__sk, node, list) \ node 24 include/net/ping.h hlist_nulls_for_each_entry(__sk, node, list, sk_nulls_node) node 14 include/net/pkt_cls.h int (*fn)(struct tcf_proto *, unsigned long node, struct tcf_walker *); node 539 include/net/sctp/sctp.h hlist_for_each_entry(epb, head, node) node 96 include/net/sctp/structs.h struct hlist_node node; node 1147 include/net/sctp/structs.h struct hlist_node node; node 478 include/net/sock.h static inline struct sock *sk_entry(const struct hlist_node *node) node 480 include/net/sock.h return hlist_entry(node, struct sock, sk_node); node 527 include/net/sock.h static inline void sk_node_init(struct hlist_node *node) node 529 include/net/sock.h node->pprev = NULL; node 532 include/net/sock.h static inline void sk_nulls_node_init(struct hlist_nulls_node *node) node 534 include/net/sock.h node->pprev = NULL; node 649 include/net/sock.h #define sk_nulls_for_each(__sk, node, list) \ node 650 include/net/sock.h hlist_nulls_for_each_entry(__sk, node, list, sk_nulls_node) node 651 include/net/sock.h #define sk_nulls_for_each_rcu(__sk, node, list) \ node 652 include/net/sock.h hlist_nulls_for_each_entry_rcu(__sk, node, list, sk_nulls_node) node 655 include/net/sock.h #define sk_nulls_for_each_from(__sk, node) \ node 656 include/net/sock.h if (__sk && ({ node = &(__sk)->sk_nulls_node; 1; })) \ node 657 include/net/sock.h hlist_nulls_for_each_entry_from(__sk, node, sk_nulls_node) node 1035 include/net/sock.h struct list_head node; node 1255 include/net/tcp.h struct hlist_node node; node 128 include/net/x25.h struct list_head node; node 136 include/net/x25.h struct list_head node; node 170 include/net/x25.h struct list_head node; node 69 include/scsi/scsi_device.h struct list_head node; node 68 include/trace/events/kmem.h int node), node 70 include/trace/events/kmem.h TP_ARGS(call_site, ptr, bytes_req, bytes_alloc, gfp_flags, node), node 78 include/trace/events/kmem.h __field( int, node ) node 87 include/trace/events/kmem.h __entry->node = node; node 96 include/trace/events/kmem.h __entry->node) node 103 include/trace/events/kmem.h gfp_t gfp_flags, int node), node 105 include/trace/events/kmem.h TP_ARGS(call_site, ptr, bytes_req, bytes_alloc, gfp_flags, node) node 112 include/trace/events/kmem.h gfp_t gfp_flags, int node), node 114 include/trace/events/kmem.h TP_ARGS(call_site, ptr, bytes_req, bytes_alloc, gfp_flags, node) node 49 include/uapi/linux/tipc.h __u32 node; node 65 include/uapi/linux/tipc.h unsigned int node) node 67 include/uapi/linux/tipc.h return (zone << 24) | (cluster << 12) | node; node 186 include/video/mmp_disp.h struct list_head node; node 224 include/video/mmp_disp.h struct list_head node; node 921 include/video/omapdss.h struct omap_dss_device *omap_dss_find_output_by_node(struct device_node *node); node 1040 include/video/omapdss.h omapdss_of_find_source_for_first_ep(struct device_node *node); node 55 include/xen/xenbus.h const char *node; node 132 include/xen/xenbus.h const char *dir, const char *node, unsigned int *num); node 134 include/xen/xenbus.h const char *dir, const char *node, unsigned int *len); node 136 include/xen/xenbus.h const char *dir, const char *node, const char *string); node 138 include/xen/xenbus.h const char *dir, const char *node); node 140 include/xen/xenbus.h const char *dir, const char *node); node 141 include/xen/xenbus.h int xenbus_rm(struct xenbus_transaction t, const char *dir, const char *node); node 148 include/xen/xenbus.h const char *dir, const char *node, const char *fmt, ...); node 153 include/xen/xenbus.h const char *dir, const char *node, const char *fmt, ...); node 43 scripts/dtc/checks.c typedef void (*tree_check_fn)(struct check *c, struct node *dt); node 44 scripts/dtc/checks.c typedef void (*node_check_fn)(struct check *c, struct node *dt, struct node *node); node 45 scripts/dtc/checks.c typedef void (*prop_check_fn)(struct check *c, struct node *dt, node 46 scripts/dtc/checks.c struct node *node, struct property *prop); node 125 scripts/dtc/checks.c static void check_nodes_props(struct check *c, struct node *dt, struct node *node) node 127 scripts/dtc/checks.c struct node *child; node 130 scripts/dtc/checks.c TRACE(c, "%s", node->fullpath); node 132 scripts/dtc/checks.c c->node_fn(c, dt, node); node 135 scripts/dtc/checks.c for_each_property(node, prop) { node 136 scripts/dtc/checks.c TRACE(c, "%s\t'%s'", node->fullpath, prop->name); node 137 scripts/dtc/checks.c c->prop_fn(c, dt, node, prop); node 140 scripts/dtc/checks.c for_each_child(node, child) node 144 scripts/dtc/checks.c static int run_check(struct check *c, struct node *dt) node 191 scripts/dtc/checks.c static inline void check_always_fail(struct check *c, struct node *dt) node 197 scripts/dtc/checks.c static void check_is_string(struct check *c, struct node *root, node 198 scripts/dtc/checks.c struct node *node) node 203 scripts/dtc/checks.c prop = get_property(node, propname); node 209 scripts/dtc/checks.c propname, node->fullpath); node 216 scripts/dtc/checks.c static void check_is_cell(struct check *c, struct node *root, node 217 scripts/dtc/checks.c struct node *node) node 222 scripts/dtc/checks.c prop = get_property(node, propname); node 228 scripts/dtc/checks.c propname, node->fullpath); node 239 scripts/dtc/checks.c static void check_duplicate_node_names(struct check *c, struct node *dt, node 240 scripts/dtc/checks.c struct node *node) node 242 scripts/dtc/checks.c struct node *child, *child2; node 244 scripts/dtc/checks.c for_each_child(node, child) node 254 scripts/dtc/checks.c static void check_duplicate_property_names(struct check *c, struct node *dt, node 255 scripts/dtc/checks.c struct node *node) node 259 scripts/dtc/checks.c for_each_property(node, prop) { node 265 scripts/dtc/checks.c prop->name, node->fullpath); node 276 scripts/dtc/checks.c static void check_node_name_chars(struct check *c, struct node *dt, node 277 scripts/dtc/checks.c struct node *node) node 279 scripts/dtc/checks.c int n = strspn(node->name, c->data); node 281 scripts/dtc/checks.c if (n < strlen(node->name)) node 283 scripts/dtc/checks.c node->name[n], node->fullpath); node 287 scripts/dtc/checks.c static void check_node_name_format(struct check *c, struct node *dt, node 288 scripts/dtc/checks.c struct node *node) node 290 scripts/dtc/checks.c if (strchr(get_unitname(node), '@')) node 292 scripts/dtc/checks.c node->fullpath); node 296 scripts/dtc/checks.c static void check_property_name_chars(struct check *c, struct node *dt, node 297 scripts/dtc/checks.c struct node *node, struct property *prop) node 303 scripts/dtc/checks.c prop->name[n], prop->name, node->fullpath); node 308 scripts/dtc/checks.c #define DESCLABEL_ARGS(node,prop,mark) \ node 312 scripts/dtc/checks.c ((prop) ? "' in " : ""), (node)->fullpath node 314 scripts/dtc/checks.c static void check_duplicate_label(struct check *c, struct node *dt, node 315 scripts/dtc/checks.c const char *label, struct node *node, node 318 scripts/dtc/checks.c struct node *othernode = NULL; node 333 scripts/dtc/checks.c if ((othernode != node) || (otherprop != prop) || (othermark != mark)) node 336 scripts/dtc/checks.c label, DESCLABEL_ARGS(node, prop, mark), node 340 scripts/dtc/checks.c static void check_duplicate_label_node(struct check *c, struct node *dt, node 341 scripts/dtc/checks.c struct node *node) node 345 scripts/dtc/checks.c for_each_label(node->labels, l) node 346 scripts/dtc/checks.c check_duplicate_label(c, dt, l->label, node, NULL, NULL); node 348 scripts/dtc/checks.c static void check_duplicate_label_prop(struct check *c, struct node *dt, node 349 scripts/dtc/checks.c struct node *node, struct property *prop) node 355 scripts/dtc/checks.c check_duplicate_label(c, dt, l->label, node, prop, NULL); node 358 scripts/dtc/checks.c check_duplicate_label(c, dt, m->ref, node, prop, m); node 363 scripts/dtc/checks.c static void check_explicit_phandles(struct check *c, struct node *root, node 364 scripts/dtc/checks.c struct node *node, struct property *prop) node 367 scripts/dtc/checks.c struct node *other; node 376 scripts/dtc/checks.c node->fullpath, prop->val.len, prop->name); node 383 scripts/dtc/checks.c if (node != get_node_by_ref(root, m->ref)) node 388 scripts/dtc/checks.c prop->name, node->fullpath); node 403 scripts/dtc/checks.c node->fullpath, phandle, prop->name); node 407 scripts/dtc/checks.c if (node->phandle && (node->phandle != phandle)) node 409 scripts/dtc/checks.c node->fullpath, prop->name); node 412 scripts/dtc/checks.c if (other && (other != node)) { node 414 scripts/dtc/checks.c node->fullpath, phandle, other->fullpath); node 418 scripts/dtc/checks.c node->phandle = phandle; node 422 scripts/dtc/checks.c static void check_name_properties(struct check *c, struct node *root, node 423 scripts/dtc/checks.c struct node *node) node 427 scripts/dtc/checks.c for (pp = &node->proplist; *pp; pp = &((*pp)->next)) node 436 scripts/dtc/checks.c if ((prop->val.len != node->basenamelen+1) node 437 scripts/dtc/checks.c || (memcmp(prop->val.val, node->name, node->basenamelen) != 0)) { node 439 scripts/dtc/checks.c " of base node name)", node->fullpath, prop->val.val); node 456 scripts/dtc/checks.c static void fixup_phandle_references(struct check *c, struct node *dt, node 457 scripts/dtc/checks.c struct node *node, struct property *prop) node 460 scripts/dtc/checks.c struct node *refnode; node 480 scripts/dtc/checks.c static void fixup_path_references(struct check *c, struct node *dt, node 481 scripts/dtc/checks.c struct node *node, struct property *prop) node 484 scripts/dtc/checks.c struct node *refnode; node 516 scripts/dtc/checks.c static void fixup_addr_size_cells(struct check *c, struct node *dt, node 517 scripts/dtc/checks.c struct node *node) node 521 scripts/dtc/checks.c node->addr_cells = -1; node 522 scripts/dtc/checks.c node->size_cells = -1; node 524 scripts/dtc/checks.c prop = get_property(node, "#address-cells"); node 526 scripts/dtc/checks.c node->addr_cells = propval_cell(prop); node 528 scripts/dtc/checks.c prop = get_property(node, "#size-cells"); node 530 scripts/dtc/checks.c node->size_cells = propval_cell(prop); node 540 scripts/dtc/checks.c static void check_reg_format(struct check *c, struct node *dt, node 541 scripts/dtc/checks.c struct node *node) node 546 scripts/dtc/checks.c prop = get_property(node, "reg"); node 550 scripts/dtc/checks.c if (!node->parent) { node 556 scripts/dtc/checks.c FAIL(c, "\"reg\" property in %s is empty", node->fullpath); node 558 scripts/dtc/checks.c addr_cells = node_addr_cells(node->parent); node 559 scripts/dtc/checks.c size_cells = node_size_cells(node->parent); node 565 scripts/dtc/checks.c node->fullpath, prop->val.len, addr_cells, size_cells); node 569 scripts/dtc/checks.c static void check_ranges_format(struct check *c, struct node *dt, node 570 scripts/dtc/checks.c struct node *node) node 575 scripts/dtc/checks.c prop = get_property(node, "ranges"); node 579 scripts/dtc/checks.c if (!node->parent) { node 584 scripts/dtc/checks.c p_addr_cells = node_addr_cells(node->parent); node 585 scripts/dtc/checks.c p_size_cells = node_size_cells(node->parent); node 586 scripts/dtc/checks.c c_addr_cells = node_addr_cells(node); node 587 scripts/dtc/checks.c c_size_cells = node_size_cells(node); node 594 scripts/dtc/checks.c node->fullpath, c_addr_cells, node->parent->fullpath, node 599 scripts/dtc/checks.c node->fullpath, c_size_cells, node->parent->fullpath, node 604 scripts/dtc/checks.c "#size-cells == %d)", node->fullpath, prop->val.len, node 613 scripts/dtc/checks.c static void check_avoid_default_addr_size(struct check *c, struct node *dt, node 614 scripts/dtc/checks.c struct node *node) node 618 scripts/dtc/checks.c if (!node->parent) node 621 scripts/dtc/checks.c reg = get_property(node, "reg"); node 622 scripts/dtc/checks.c ranges = get_property(node, "ranges"); node 627 scripts/dtc/checks.c if ((node->parent->addr_cells == -1)) node 629 scripts/dtc/checks.c node->fullpath); node 631 scripts/dtc/checks.c if ((node->parent->size_cells == -1)) node 633 scripts/dtc/checks.c node->fullpath); node 638 scripts/dtc/checks.c struct node *dt) node 640 scripts/dtc/checks.c struct node *chosen; node 738 scripts/dtc/checks.c struct node *dt = bi->dt; node 55 scripts/dtc/dtc-parser.y struct node *node; node 56 scripts/dtc/dtc-parser.y struct node *nodelist; node 86 scripts/dtc/dtc-parser.y %type <node> devicetree node 87 scripts/dtc/dtc-parser.y %type <node> nodedef node 88 scripts/dtc/dtc-parser.y %type <node> subnode node 150 scripts/dtc/dtc-parser.y struct node *target = get_node_by_ref($1, $2); node 160 scripts/dtc/dtc-parser.y struct node *target = get_node_by_ref($1, $3); node 33 scripts/dtc/dtc.c static void fill_fullpaths(struct node *tree, const char *prefix) node 35 scripts/dtc/dtc.c struct node *child; node 149 scripts/dtc/dtc.h struct node *children; node 151 scripts/dtc/dtc.h struct node *parent; node 152 scripts/dtc/dtc.h struct node *next_sibling; node 192 scripts/dtc/dtc.h struct node *build_node(struct property *proplist, struct node *children); node 193 scripts/dtc/dtc.h struct node *build_node_delete(void); node 194 scripts/dtc/dtc.h struct node *name_node(struct node *node, char *name); node 195 scripts/dtc/dtc.h struct node *chain_node(struct node *first, struct node *list); node 196 scripts/dtc/dtc.h struct node *merge_nodes(struct node *old_node, struct node *new_node); node 198 scripts/dtc/dtc.h void add_property(struct node *node, struct property *prop); node 199 scripts/dtc/dtc.h void delete_property_by_name(struct node *node, char *name); node 201 scripts/dtc/dtc.h void add_child(struct node *parent, struct node *child); node 202 scripts/dtc/dtc.h void delete_node_by_name(struct node *parent, char *name); node 203 scripts/dtc/dtc.h void delete_node(struct node *node); node 205 scripts/dtc/dtc.h const char *get_unitname(struct node *node); node 206 scripts/dtc/dtc.h struct property *get_property(struct node *node, const char *propname); node 208 scripts/dtc/dtc.h struct property *get_property_by_label(struct node *tree, const char *label, node 209 scripts/dtc/dtc.h struct node **node); node 210 scripts/dtc/dtc.h struct marker *get_marker_label(struct node *tree, const char *label, node 211 scripts/dtc/dtc.h struct node **node, struct property **prop); node 212 scripts/dtc/dtc.h struct node *get_subnode(struct node *node, const char *nodename); node 213 scripts/dtc/dtc.h struct node *get_node_by_path(struct node *tree, const char *path); node 214 scripts/dtc/dtc.h struct node *get_node_by_label(struct node *tree, const char *label); node 215 scripts/dtc/dtc.h struct node *get_node_by_phandle(struct node *tree, cell_t phandle); node 216 scripts/dtc/dtc.h struct node *get_node_by_ref(struct node *tree, const char *ref); node 217 scripts/dtc/dtc.h cell_t get_node_phandle(struct node *root, struct node *node); node 219 scripts/dtc/dtc.h uint32_t guess_boot_cpuid(struct node *tree); node 240 scripts/dtc/dtc.h struct node *dt; /* the device tree */ node 245 scripts/dtc/dtc.h struct node *tree, uint32_t boot_cpuid_phys); node 122 scripts/dtc/fdtget.c static int list_properties(const void *blob, int node) node 128 scripts/dtc/fdtget.c prop = fdt_first_property_offset(blob, node); node 150 scripts/dtc/fdtget.c static int list_subnodes(const void *blob, int node) node 159 scripts/dtc/fdtget.c tag = fdt_next_tag(blob, node, &nextoffset); node 162 scripts/dtc/fdtget.c pathp = fdt_get_name(blob, node, NULL); node 191 scripts/dtc/fdtget.c node = nextoffset; node 207 scripts/dtc/fdtget.c int node, const char *property) node 214 scripts/dtc/fdtget.c err = list_properties(blob, node); node 218 scripts/dtc/fdtget.c err = list_subnodes(blob, node); node 223 scripts/dtc/fdtget.c value = fdt_getprop(blob, node, property, &len); node 255 scripts/dtc/fdtget.c int i, node; node 262 scripts/dtc/fdtget.c node = fdt_path_offset(blob, arg[i]); node 263 scripts/dtc/fdtget.c if (node < 0) { node 268 scripts/dtc/fdtget.c report_error(arg[i], node); node 274 scripts/dtc/fdtget.c if (show_data_for_item(blob, disp, node, prop)) node 137 scripts/dtc/fdtput.c int node; node 140 scripts/dtc/fdtput.c node = fdt_path_offset(blob, node_name); node 141 scripts/dtc/fdtput.c if (node < 0) { node 142 scripts/dtc/fdtput.c report_error(node_name, -1, node); node 146 scripts/dtc/fdtput.c err = fdt_setprop(blob, node, property, buf, len); node 168 scripts/dtc/fdtput.c int node, offset = 0; node 174 scripts/dtc/fdtput.c for (sep = path; *sep; path = sep + 1, offset = node) { node 180 scripts/dtc/fdtput.c node = fdt_subnode_offset_namelen(blob, offset, path, node 182 scripts/dtc/fdtput.c if (node == -FDT_ERR_NOTFOUND) { node 183 scripts/dtc/fdtput.c node = fdt_add_subnode_namelen(blob, offset, path, node 186 scripts/dtc/fdtput.c if (node < 0) { node 187 scripts/dtc/fdtput.c report_error(path, sep - path, node); node 208 scripts/dtc/fdtput.c int node = 0; node 219 scripts/dtc/fdtput.c node = fdt_path_offset(blob, node_name); node 220 scripts/dtc/fdtput.c if (node < 0) { node 221 scripts/dtc/fdtput.c report_error(node_name, -1, node); node 226 scripts/dtc/fdtput.c node = fdt_add_subnode(blob, node, p + 1); node 227 scripts/dtc/fdtput.c if (node < 0) { node 228 scripts/dtc/fdtput.c report_error(p + 1, -1, node); node 258 scripts/dtc/flattree.c static void flatten_tree(struct node *tree, struct emitter *emit, node 263 scripts/dtc/flattree.c struct node *child; node 743 scripts/dtc/flattree.c static struct node *unflatten_tree(struct inbuf *dtbuf, node 747 scripts/dtc/flattree.c struct node *node; node 751 scripts/dtc/flattree.c node = build_node(NULL, NULL); node 756 scripts/dtc/flattree.c node->name = nodename_from_path(parent_flatname, flatname); node 758 scripts/dtc/flattree.c node->name = flatname; node 762 scripts/dtc/flattree.c struct node *child; node 767 scripts/dtc/flattree.c if (node->children) node 771 scripts/dtc/flattree.c add_property(node, prop); node 776 scripts/dtc/flattree.c add_child(node, child); node 800 scripts/dtc/flattree.c return node; node 817 scripts/dtc/flattree.c struct node *tree; node 26 scripts/dtc/fstree.c static struct node *read_fstree(const char *dirname) node 31 scripts/dtc/fstree.c struct node *tree; node 68 scripts/dtc/fstree.c struct node *newchild; node 84 scripts/dtc/fstree.c struct node *tree; node 100 scripts/dtc/livetree.c struct node *build_node(struct property *proplist, struct node *children) node 102 scripts/dtc/livetree.c struct node *new = xmalloc(sizeof(*new)); node 103 scripts/dtc/livetree.c struct node *child; node 117 scripts/dtc/livetree.c struct node *build_node_delete(void) node 119 scripts/dtc/livetree.c struct node *new = xmalloc(sizeof(*new)); node 128 scripts/dtc/livetree.c struct node *name_node(struct node *node, char *name) node 130 scripts/dtc/livetree.c assert(node->name == NULL); node 132 scripts/dtc/livetree.c node->name = name; node 134 scripts/dtc/livetree.c return node; node 137 scripts/dtc/livetree.c struct node *merge_nodes(struct node *old_node, struct node *new_node) node 140 scripts/dtc/livetree.c struct node *new_child, *old_child; node 219 scripts/dtc/livetree.c struct node *chain_node(struct node *first, struct node *list) node 227 scripts/dtc/livetree.c void add_property(struct node *node, struct property *prop) node 233 scripts/dtc/livetree.c p = &node->proplist; node 240 scripts/dtc/livetree.c void delete_property_by_name(struct node *node, char *name) node 242 scripts/dtc/livetree.c struct property *prop = node->proplist; node 259 scripts/dtc/livetree.c void add_child(struct node *parent, struct node *child) node 261 scripts/dtc/livetree.c struct node **p; node 273 scripts/dtc/livetree.c void delete_node_by_name(struct node *parent, char *name) node 275 scripts/dtc/livetree.c struct node *node = parent->children; node 277 scripts/dtc/livetree.c while (node) { node 278 scripts/dtc/livetree.c if (!strcmp(node->name, name)) { node 279 scripts/dtc/livetree.c delete_node(node); node 282 scripts/dtc/livetree.c node = node->next_sibling; node 286 scripts/dtc/livetree.c void delete_node(struct node *node) node 289 scripts/dtc/livetree.c struct node *child; node 291 scripts/dtc/livetree.c node->deleted = 1; node 292 scripts/dtc/livetree.c for_each_child(node, child) node 294 scripts/dtc/livetree.c for_each_property(node, prop) node 296 scripts/dtc/livetree.c delete_labels(&node->labels); node 339 scripts/dtc/livetree.c struct node *tree, uint32_t boot_cpuid_phys) node 355 scripts/dtc/livetree.c const char *get_unitname(struct node *node) node 357 scripts/dtc/livetree.c if (node->name[node->basenamelen] == '\0') node 360 scripts/dtc/livetree.c return node->name + node->basenamelen + 1; node 363 scripts/dtc/livetree.c struct property *get_property(struct node *node, const char *propname) node 367 scripts/dtc/livetree.c for_each_property(node, prop) node 380 scripts/dtc/livetree.c struct property *get_property_by_label(struct node *tree, const char *label, node 381 scripts/dtc/livetree.c struct node **node) node 384 scripts/dtc/livetree.c struct node *c; node 386 scripts/dtc/livetree.c *node = tree; node 397 scripts/dtc/livetree.c prop = get_property_by_label(c, label, node); node 402 scripts/dtc/livetree.c *node = NULL; node 406 scripts/dtc/livetree.c struct marker *get_marker_label(struct node *tree, const char *label, node 407 scripts/dtc/livetree.c struct node **node, struct property **prop) node 411 scripts/dtc/livetree.c struct node *c; node 413 scripts/dtc/livetree.c *node = tree; node 424 scripts/dtc/livetree.c m = get_marker_label(c, label, node, prop); node 430 scripts/dtc/livetree.c *node = NULL; node 434 scripts/dtc/livetree.c struct node *get_subnode(struct node *node, const char *nodename) node 436 scripts/dtc/livetree.c struct node *child; node 438 scripts/dtc/livetree.c for_each_child(node, child) node 445 scripts/dtc/livetree.c struct node *get_node_by_path(struct node *tree, const char *path) node 448 scripts/dtc/livetree.c struct node *child; node 471 scripts/dtc/livetree.c struct node *get_node_by_label(struct node *tree, const char *label) node 473 scripts/dtc/livetree.c struct node *child, *node; node 483 scripts/dtc/livetree.c node = get_node_by_label(child, label); node 484 scripts/dtc/livetree.c if (node) node 485 scripts/dtc/livetree.c return node; node 491 scripts/dtc/livetree.c struct node *get_node_by_phandle(struct node *tree, cell_t phandle) node 493 scripts/dtc/livetree.c struct node *child, *node; node 504 scripts/dtc/livetree.c node = get_node_by_phandle(child, phandle); node 505 scripts/dtc/livetree.c if (node) node 506 scripts/dtc/livetree.c return node; node 512 scripts/dtc/livetree.c struct node *get_node_by_ref(struct node *tree, const char *ref) node 520 scripts/dtc/livetree.c cell_t get_node_phandle(struct node *root, struct node *node) node 524 scripts/dtc/livetree.c if ((node->phandle != 0) && (node->phandle != -1)) node 525 scripts/dtc/livetree.c return node->phandle; node 530 scripts/dtc/livetree.c node->phandle = phandle; node 532 scripts/dtc/livetree.c if (!get_property(node, "linux,phandle") node 534 scripts/dtc/livetree.c add_property(node, node 538 scripts/dtc/livetree.c if (!get_property(node, "phandle") node 540 scripts/dtc/livetree.c add_property(node, node 548 scripts/dtc/livetree.c return node->phandle; node 551 scripts/dtc/livetree.c uint32_t guess_boot_cpuid(struct node *tree) node 553 scripts/dtc/livetree.c struct node *cpus, *bootcpu; node 633 scripts/dtc/livetree.c static void sort_properties(struct node *node) node 638 scripts/dtc/livetree.c for_each_property_withdel(node, prop) node 646 scripts/dtc/livetree.c for_each_property_withdel(node, prop) node 651 scripts/dtc/livetree.c node->proplist = tbl[0]; node 661 scripts/dtc/livetree.c const struct node *a, *b; node 663 scripts/dtc/livetree.c a = *((const struct node * const *)ax); node 664 scripts/dtc/livetree.c b = *((const struct node * const *)bx); node 669 scripts/dtc/livetree.c static void sort_subnodes(struct node *node) node 672 scripts/dtc/livetree.c struct node *subnode, **tbl; node 674 scripts/dtc/livetree.c for_each_child_withdel(node, subnode) node 682 scripts/dtc/livetree.c for_each_child_withdel(node, subnode) node 687 scripts/dtc/livetree.c node->children = tbl[0]; node 695 scripts/dtc/livetree.c static void sort_node(struct node *node) node 697 scripts/dtc/livetree.c struct node *c; node 699 scripts/dtc/livetree.c sort_properties(node); node 700 scripts/dtc/livetree.c sort_subnodes(node); node 701 scripts/dtc/livetree.c for_each_child_withdel(node, c) node 101 scripts/dtc/srcpos.c struct search_path *node; node 111 scripts/dtc/srcpos.c for (node = search_path_head; !*fp && node; node = node->next) node 112 scripts/dtc/srcpos.c fullname = try_open(node->dirname, fname, fp); node 185 scripts/dtc/srcpos.c struct search_path *node; node 188 scripts/dtc/srcpos.c node = xmalloc(sizeof(*node)); node 189 scripts/dtc/srcpos.c node->next = NULL; node 190 scripts/dtc/srcpos.c node->dirname = xstrdup(dirname); node 194 scripts/dtc/srcpos.c *search_path_tail = node; node 196 scripts/dtc/srcpos.c search_path_head = node; node 197 scripts/dtc/srcpos.c search_path_tail = &node->next; node 236 scripts/dtc/treesource.c static void write_tree_source_node(FILE *f, struct node *tree, int level) node 239 scripts/dtc/treesource.c struct node *child; node 335 scripts/genksyms/genksyms.c void free_node(struct string_list *node) node 337 scripts/genksyms/genksyms.c free(node->string); node 338 scripts/genksyms/genksyms.c free(node); node 379 scripts/genksyms/genksyms.c struct string_list *copy_node(struct string_list *node) node 384 scripts/genksyms/genksyms.c newnode->string = xstrdup(node->string); node 385 scripts/genksyms/genksyms.c newnode->tag = node->tag; node 423 scripts/genksyms/genksyms.c struct string_list node = { node 430 scripts/genksyms/genksyms.c if (node.string == buffer) node 434 scripts/genksyms/genksyms.c if (node.string == buffer) node 439 scripts/genksyms/genksyms.c if (node.string >= buffer + sizeof(buffer) - 1) { node 443 scripts/genksyms/genksyms.c *node.string++ = c; node 445 scripts/genksyms/genksyms.c if (node.string == buffer) node 447 scripts/genksyms/genksyms.c *node.string = 0; node 448 scripts/genksyms/genksyms.c node.string = buffer; node 450 scripts/genksyms/genksyms.c if (node.string[1] == '#') { node 454 scripts/genksyms/genksyms.c if (node.string[0] == symbol_types[n].n) { node 455 scripts/genksyms/genksyms.c node.tag = n; node 456 scripts/genksyms/genksyms.c node.string += 2; node 457 scripts/genksyms/genksyms.c return copy_node(&node); node 460 scripts/genksyms/genksyms.c fprintf(stderr, "Unknown type %c\n", node.string[0]); node 463 scripts/genksyms/genksyms.c return copy_node(&node); node 41 scripts/genksyms/parse.y struct string_list *node = *p; node 42 scripts/genksyms/parse.y *p = node->next; node 43 scripts/genksyms/parse.y free_node(node); node 76 scripts/kconfig/gconf.c static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row); node 1186 scripts/kconfig/gconf.c static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) node 1199 scripts/kconfig/gconf.c gtk_tree_store_set(tree, node, node 1225 scripts/kconfig/gconf.c GtkTreeIter *node = parents[indent]; node 1227 scripts/kconfig/gconf.c gtk_tree_store_append(tree, node, parent); node 1228 scripts/kconfig/gconf.c set_node(node, menu, row); node 181 scripts/kconfig/lxdialog/dialog.h struct dialog_item node; node 619 scripts/kconfig/lxdialog/util.c vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); node 628 scripts/kconfig/lxdialog/util.c avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); node 631 scripts/kconfig/lxdialog/util.c vsnprintf(item_cur->node.str + strlen(item_cur->node.str), node 633 scripts/kconfig/lxdialog/util.c item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; node 639 scripts/kconfig/lxdialog/util.c item_cur->node.tag = tag; node 643 scripts/kconfig/lxdialog/util.c item_cur->node.data = ptr; node 648 scripts/kconfig/lxdialog/util.c item_cur->node.selected = val; node 661 scripts/kconfig/lxdialog/util.c return item_cur->node.data; node 666 scripts/kconfig/lxdialog/util.c return item_cur->node.tag; node 702 scripts/kconfig/lxdialog/util.c return item_cur->node.str; node 707 scripts/kconfig/lxdialog/util.c return (item_cur->node.selected != 0); node 712 scripts/kconfig/lxdialog/util.c return (item_cur->node.tag == tag);