Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 453) sorted by relevance

12345678910>>...19

/linux-2.4.37.9/lib/
Drbtree.c25 static void __rb_rotate_left(rb_node_t * node, rb_root_t * root) in __rb_rotate_left() argument
27 rb_node_t * right = node->rb_right; in __rb_rotate_left()
29 if ((node->rb_right = right->rb_left)) in __rb_rotate_left()
30 right->rb_left->rb_parent = node; in __rb_rotate_left()
31 right->rb_left = node; in __rb_rotate_left()
33 if ((right->rb_parent = node->rb_parent)) in __rb_rotate_left()
35 if (node == node->rb_parent->rb_left) in __rb_rotate_left()
36 node->rb_parent->rb_left = right; in __rb_rotate_left()
38 node->rb_parent->rb_right = right; in __rb_rotate_left()
42 node->rb_parent = right; in __rb_rotate_left()
[all …]
/linux-2.4.37.9/arch/sparc/prom/
Dtree.c24 int __prom_getchild(int node) in __prom_getchild() argument
30 cnode = prom_nodeops->no_child(node); in __prom_getchild()
40 int prom_getchild(int node) in prom_getchild() argument
44 if (node == -1) in prom_getchild()
47 cnode = __prom_getchild(node); in prom_getchild()
55 int __prom_getsibling(int node) in __prom_getsibling() argument
61 cnode = prom_nodeops->no_nextnode(node); in __prom_getsibling()
71 int prom_getsibling(int node) in prom_getsibling() argument
75 if (node == -1) in prom_getsibling()
78 sibnode = __prom_getsibling(node); in prom_getsibling()
[all …]
Dsun4prom.c33 struct node { struct
46 struct node nodes[] = { argument
53 static int no_nextnode(int node) in no_nextnode() argument
55 if (nodes[node].level == nodes[node+1].level) in no_nextnode()
56 return node+1; in no_nextnode()
60 static int no_child(int node) in no_child() argument
62 if (nodes[node].level == nodes[node+1].level-1) in no_child()
63 return node+1; in no_child()
67 static struct property *find_property(int node,char *name) in find_property() argument
69 struct property *prop = &nodes[node].properties[0]; in find_property()
[all …]
/linux-2.4.37.9/fs/hfsplus/
Dbnode.c43 void hfsplus_bnode_readbytes(hfsplus_bnode *node, void *buf, in hfsplus_bnode_readbytes() argument
49 off += node->page_offset; in hfsplus_bnode_readbytes()
50 pagep = node->page + (off >> PAGE_CACHE_SHIFT); in hfsplus_bnode_readbytes()
65 u16 hfsplus_bnode_read_u16(hfsplus_bnode *node, unsigned long off) in hfsplus_bnode_read_u16() argument
69 hfsplus_bnode_readbytes(node, &data, off, 2); in hfsplus_bnode_read_u16()
73 void hfsplus_bnode_read_key(hfsplus_bnode *node, void *key, unsigned long off) in hfsplus_bnode_read_key() argument
78 tree = node->tree; in hfsplus_bnode_read_key()
79 if (node->kind == HFSPLUS_NODE_LEAF || in hfsplus_bnode_read_key()
81 key_len = hfsplus_bnode_read_u16(node, off) + 2; in hfsplus_bnode_read_key()
85 hfsplus_bnode_readbytes(node, key, off, key_len); in hfsplus_bnode_read_key()
[all …]
Dbtree.c21 hfsplus_bnode *node; in hfsplus_close_btree() local
28 while ((node = tree->node_hash[i])) { in hfsplus_close_btree()
29 tree->node_hash[i] = node->next_hash; in hfsplus_close_btree()
30 if (atomic_read(&node->refcnt)) in hfsplus_close_btree()
32 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfsplus_close_btree()
33 hfsplus_bnode_free(node); in hfsplus_close_btree()
143 hfsplus_bnode *node; in hfsplus_write_btree() local
146 node = hfsplus_find_bnode(tree, 0); in hfsplus_write_btree()
147 if (!node) in hfsplus_write_btree()
151 page = node->page[0]; in hfsplus_write_btree()
[all …]
Dbrec.c15 u16 hfsplus_brec_lenoff(hfsplus_bnode *node, u16 rec, u16 *off) in hfsplus_brec_lenoff() argument
20 dataoff = node->tree->node_size - (rec + 2) * 2; in hfsplus_brec_lenoff()
21 hfsplus_bnode_readbytes(node, retval, dataoff, 4); in hfsplus_brec_lenoff()
27 u16 hfsplus_brec_keylen(hfsplus_bnode *node, u16 rec) in hfsplus_brec_keylen() argument
32 if ((node->kind != HFSPLUS_NODE_NDX)&&(node->kind != HFSPLUS_NODE_LEAF)) in hfsplus_brec_keylen()
35 klsz = (node->tree->attributes & HFSPLUS_TREE_BIGKEYS) ? 2 : 1; in hfsplus_brec_keylen()
36 if ((node->kind == HFSPLUS_NODE_NDX) && in hfsplus_brec_keylen()
37 !(node->tree->attributes & HFSPLUS_TREE_VAR_NDXKEY_SIZE)) { in hfsplus_brec_keylen()
38 retval = node->tree->max_key_len; in hfsplus_brec_keylen()
40 recoff = hfsplus_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfsplus_brec_keylen()
[all …]
/linux-2.4.37.9/drivers/hotplug/
Dacpiphp_res.c171 struct pci_resource *node; in acpiphp_get_io_resource() local
184 for (node = *head; node; node = node->next) { in acpiphp_get_io_resource()
185 if (node->length < size) in acpiphp_get_io_resource()
188 if (node->base & (size - 1)) { in acpiphp_get_io_resource()
191 temp_qword = (node->base | (size-1)) + 1; in acpiphp_get_io_resource()
194 if ((node->length - (temp_qword - node->base)) < size) in acpiphp_get_io_resource()
197 split_node = acpiphp_make_resource(node->base, temp_qword - node->base); in acpiphp_get_io_resource()
202 node->base = temp_qword; in acpiphp_get_io_resource()
203 node->length -= split_node->length; in acpiphp_get_io_resource()
206 split_node->next = node->next; in acpiphp_get_io_resource()
[all …]
/linux-2.4.37.9/arch/sparc64/prom/
Dtree.c21 __prom_getchild(int node) in __prom_getchild() argument
23 return p1275_cmd ("child", P1275_INOUT(1, 1), node); in __prom_getchild()
27 prom_getchild(int node) in prom_getchild() argument
31 if(node == -1) return 0; in prom_getchild()
32 cnode = __prom_getchild(node); in prom_getchild()
38 prom_getparent(int node) in prom_getparent() argument
42 if(node == -1) return 0; in prom_getparent()
43 cnode = p1275_cmd ("parent", P1275_INOUT(1, 1), node); in prom_getparent()
52 __prom_getsibling(int node) in __prom_getsibling() argument
54 return p1275_cmd ("peer", P1275_INOUT(1, 1), node); in __prom_getsibling()
[all …]
/linux-2.4.37.9/drivers/acpi/namespace/
Dnsobject.c75 struct acpi_namespace_node *node, in acpi_ns_attach_object() argument
90 if (!node) { in acpi_ns_attach_object()
104 if (ACPI_GET_DESCRIPTOR_TYPE (node) != ACPI_DESC_TYPE_NAMED) { in acpi_ns_attach_object()
108 node, acpi_ut_get_descriptor_name (node))); in acpi_ns_attach_object()
114 if (node->object == object) { in acpi_ns_attach_object()
116 object, node)); in acpi_ns_attach_object()
155 obj_desc, node, acpi_ut_get_node_name (node))); in acpi_ns_attach_object()
159 if (node->object) { in acpi_ns_attach_object()
160 acpi_ns_detach_object (node); in acpi_ns_attach_object()
181 last_obj_desc->common.next_object = node->object; in acpi_ns_attach_object()
[all …]
Dnsalloc.c69 struct acpi_namespace_node *node; in acpi_ns_create_node() local
75 node = ACPI_MEM_CALLOCATE (sizeof (struct acpi_namespace_node)); in acpi_ns_create_node()
76 if (!node) { in acpi_ns_create_node()
82 node->name.integer = name; in acpi_ns_create_node()
83 node->reference_count = 1; in acpi_ns_create_node()
84 ACPI_SET_DESCRIPTOR_TYPE (node, ACPI_DESC_TYPE_NAMED); in acpi_ns_create_node()
86 return_PTR (node); in acpi_ns_create_node()
104 struct acpi_namespace_node *node) in acpi_ns_delete_node() argument
111 ACPI_FUNCTION_TRACE_PTR ("ns_delete_node", node); in acpi_ns_delete_node()
114 parent_node = acpi_ns_get_parent_node (node); in acpi_ns_delete_node()
[all …]
Dnseval.c87 struct acpi_namespace_node *node = NULL; in acpi_ns_evaluate_relative() local
130 scope_info->scope.node = prefix_node; in acpi_ns_evaluate_relative()
133 &node); in acpi_ns_evaluate_relative()
148 pathname, node, acpi_ns_get_attached_object (node))); in acpi_ns_evaluate_relative()
150 status = acpi_ns_evaluate_by_handle (node, params, return_object); in acpi_ns_evaluate_relative()
191 struct acpi_namespace_node *node = NULL; in acpi_ns_evaluate_by_name() local
214 &node); in acpi_ns_evaluate_by_name()
229 pathname, node, acpi_ns_get_attached_object (node))); in acpi_ns_evaluate_by_name()
231 status = acpi_ns_evaluate_by_handle (node, params, return_object); in acpi_ns_evaluate_by_name()
274 struct acpi_namespace_node *node; in acpi_ns_evaluate_by_handle() local
[all …]
Dnssearch.c83 struct acpi_namespace_node *node, in acpi_ns_search_node() argument
97 scope_name = acpi_ns_get_external_pathname (node); in acpi_ns_search_node()
100 scope_name, node, (char *) &target_name, acpi_ut_get_type_name (type))); in acpi_ns_search_node()
111 next_node = node->child; in acpi_ns_search_node()
128 next_node, acpi_ut_get_node_name (node), node)); in acpi_ns_search_node()
154 acpi_ut_get_node_name (node), node, node->child)); in acpi_ns_search_node()
188 struct acpi_namespace_node *node, in acpi_ns_search_parent_tree() argument
199 parent_node = acpi_ns_get_parent_node (node); in acpi_ns_search_parent_tree()
280 struct acpi_namespace_node *node, in acpi_ns_search_and_enter() argument
295 if (!node || !target_name || !return_node) { in acpi_ns_search_and_enter()
[all …]
Dnsxfobj.c71 struct acpi_namespace_node *node; in acpi_get_type() local
97 node = acpi_ns_map_handle_to_node (handle); in acpi_get_type()
98 if (!node) { in acpi_get_type()
103 *ret_type = node->type; in acpi_get_type()
130 struct acpi_namespace_node *node; in acpi_get_parent() local
151 node = acpi_ns_map_handle_to_node (handle); in acpi_get_parent()
152 if (!node) { in acpi_get_parent()
160 acpi_ns_convert_entry_to_handle (acpi_ns_get_parent_node (node)); in acpi_get_parent()
164 if (!acpi_ns_get_parent_node (node)) { in acpi_get_parent()
202 struct acpi_namespace_node *node; in acpi_get_next_object() local
[all …]
/linux-2.4.37.9/arch/ia64/mm/
Ddiscontig.c32 #define BOOT_NODE_DATA(node) pg_data_ptr[node] argument
38 #define NODEDATA_ALIGN(addr, node) ((((addr) + 1024*1024-1) & ~(1024*1024-1)) + (node)*PAGE_SIZE) argument
62 build_maps(unsigned long start, unsigned long end, int node) in build_maps() argument
67 bdp = &bdata[node]; in build_maps()
90 count_cpus(int node) in count_cpus() argument
95 if (node == node_cpuid[cpu].nid) in count_cpus()
109 find_pernode_space(unsigned long start, unsigned long end, int node) in find_pernode_space() argument
120 bdp = &bdata[node]; in find_pernode_space()
125 if (!boot_pernode[node]) { in find_pernode_space()
126 cpus = count_cpus(node); in find_pernode_space()
[all …]
/linux-2.4.37.9/arch/mips/sgi-ip27/
Dip27-memory.c59 pfn_t slot_getsize(cnodeid_t node, int slot) in slot_getsize() argument
61 return (pfn_t) slot_psize_cache[node][slot]; in slot_getsize()
67 int node_getlastslot(cnodeid_t node) in node_getlastslot() argument
69 return (int) slot_lastfilled_cache[node]; in node_getlastslot()
75 pfn_t node_getmaxclick(cnodeid_t node) in node_getmaxclick() argument
84 for (slot = (node_getnumslots(node) - 1); slot >= 0; slot--) { in node_getmaxclick()
85 if ((slot_psize = slot_getsize(node, slot))) { in node_getmaxclick()
89 return slot_getbasepfn(node, slot) + slot_psize - 1; in node_getmaxclick()
100 static pfn_t slot_psize_compute(cnodeid_t node, int slot) in slot_psize_compute() argument
107 nasid = COMPACT_TO_NASID_NODEID(node); in slot_psize_compute()
[all …]
/linux-2.4.37.9/arch/m68k/mac/
Dmacints.c275 static inline void mac_insert_irq(irq_node_t **list, irq_node_t *node) in mac_insert_irq() argument
280 if (!node->dev_id) in mac_insert_irq()
282 __FUNCTION__, node->devname); in mac_insert_irq()
289 if (node->flags & IRQ_FLG_FAST) { in mac_insert_irq()
290 node->flags &= ~IRQ_FLG_SLOW; in mac_insert_irq()
295 } else if (node->flags & IRQ_FLG_SLOW) { in mac_insert_irq()
307 node->next = cur; in mac_insert_irq()
308 *list = node; in mac_insert_irq()
316 irq_node_t *node; in mac_delete_irq() local
321 for (node = *list; node; list = &node->next, node = *list) { in mac_delete_irq()
[all …]
/linux-2.4.37.9/arch/sparc/kernel/
Dauxio.c25 int node, auxio_nd; in auxio_probe() local
36 node = prom_getchild(prom_root_node); in auxio_probe()
37 auxio_nd = prom_searchsiblings(node, "auxiliary-io"); in auxio_probe()
39 node = prom_searchsiblings(node, "obio"); in auxio_probe()
40 node = prom_getchild(node); in auxio_probe()
41 auxio_nd = prom_searchsiblings(node, "auxio"); in auxio_probe()
47 if(prom_searchsiblings(node, "leds")) { in auxio_probe()
112 int node; in auxio_power_probe() local
116 node = prom_getchild(prom_root_node); in auxio_power_probe()
117 node = prom_searchsiblings(node, "obio"); in auxio_power_probe()
[all …]
/linux-2.4.37.9/arch/arm/mm/
Dinit.c116 int shared = 0, cached = 0, slab = 0, node; in show_mem() local
122 for (node = 0; node < numnodes; node++) { in show_mem()
125 page = NODE_MEM_MAP(node); in show_mem()
126 end = page + NODE_DATA(node)->node_size; in show_mem()
179 find_bootmap_pfn(int node, struct meminfo *mi, unsigned int bootmap_pages) in find_bootmap_pfn() argument
189 if (mi->bank[bank].node != node) in find_bootmap_pfn()
237 int node; in find_memend_and_nodes() local
243 mi->bank[i].node = -1; in find_memend_and_nodes()
247 node = mi->bank[i].node; in find_memend_and_nodes()
249 if (node >= numnodes) { in find_memend_and_nodes()
[all …]
/linux-2.4.37.9/drivers/net/wan/
Dhd64570.h130 #define DSR_RX(node) (DSR + (node ? DMAC1RX_OFFSET : DMAC0RX_OFFSET)) argument
131 #define DSR_TX(node) (DSR + (node ? DMAC1TX_OFFSET : DMAC0TX_OFFSET)) argument
133 #define DMR_RX(node) (DMR + (node ? DMAC1RX_OFFSET : DMAC0RX_OFFSET)) argument
134 #define DMR_TX(node) (DMR + (node ? DMAC1TX_OFFSET : DMAC0TX_OFFSET)) argument
136 #define FCT_RX(node) (FCT + (node ? DMAC1RX_OFFSET : DMAC0RX_OFFSET)) argument
137 #define FCT_TX(node) (FCT + (node ? DMAC1TX_OFFSET : DMAC0TX_OFFSET)) argument
139 #define DIR_RX(node) (DIR + (node ? DMAC1RX_OFFSET : DMAC0RX_OFFSET)) argument
140 #define DIR_TX(node) (DIR + (node ? DMAC1TX_OFFSET : DMAC0TX_OFFSET)) argument
142 #define DCR_RX(node) (DCR + (node ? DMAC1RX_OFFSET : DMAC0RX_OFFSET)) argument
143 #define DCR_TX(node) (DCR + (node ? DMAC1TX_OFFSET : DMAC0TX_OFFSET)) argument
/linux-2.4.37.9/drivers/acpi/dispatcher/
Ddswload.c126 struct acpi_namespace_node *node; in acpi_ds_load1_begin_op() local
157 if (op->common.node) { in acpi_ds_load1_begin_op()
181 ACPI_IMODE_EXECUTE, ACPI_NS_SEARCH_PARENT, walk_state, &(node)); in acpi_ds_load1_begin_op()
191 switch (node->type) { in acpi_ds_load1_begin_op()
216 path, acpi_ut_get_type_name (node->type))); in acpi_ds_load1_begin_op()
218 node->type = ACPI_TYPE_ANY; in acpi_ds_load1_begin_op()
227 acpi_ut_get_type_name (node->type), path)); in acpi_ds_load1_begin_op()
254 node = walk_state->deferred_node; in acpi_ds_load1_begin_op()
277 ACPI_IMODE_LOAD_PASS1, flags, walk_state, &(node)); in acpi_ds_load1_begin_op()
299 op->named.name = node->name.integer; in acpi_ds_load1_begin_op()
[all …]
/linux-2.4.37.9/fs/jffs2/
Dnodelist.c104 union jffs2_node_union node; in jffs2_get_inode_nodes() local
121 …td->read(c->mtd, (ref->flash_offset & ~3), min(ref->totlen, sizeof(node)), &retlen, (void *)&node); in jffs2_get_inode_nodes()
129 if (retlen < min(ref->totlen, sizeof(node.u))) { in jffs2_get_inode_nodes()
135 switch (node.u.nodetype) { in jffs2_get_inode_nodes()
138 if (retlen < sizeof(node.d)) { in jffs2_get_inode_nodes()
143 if (node.d.version > *highest_version) in jffs2_get_inode_nodes()
144 *highest_version = node.d.version; in jffs2_get_inode_nodes()
149 fd = jffs2_alloc_full_dirent(node.d.nsize+1); in jffs2_get_inode_nodes()
154 memset(fd,0,sizeof(struct jffs2_full_dirent) + node.d.nsize+1); in jffs2_get_inode_nodes()
156 fd->version = node.d.version; in jffs2_get_inode_nodes()
[all …]
/linux-2.4.37.9/arch/m68k/amiga/
Damiints.c120 static inline int amiga_insert_irq(irq_node_t **list, irq_node_t *node) in amiga_insert_irq() argument
125 if (!node->dev_id) in amiga_insert_irq()
127 __FUNCTION__, node->devname); in amiga_insert_irq()
134 if (node->flags & SA_INTERRUPT) { in amiga_insert_irq()
135 if (node->flags & SA_SHIRQ) in amiga_insert_irq()
151 node->next = cur; in amiga_insert_irq()
152 *list = node; in amiga_insert_irq()
161 irq_node_t *node; in amiga_delete_irq() local
166 for (node = *list; node; list = &node->next, node = *list) { in amiga_delete_irq()
167 if (node->dev_id == dev_id) { in amiga_delete_irq()
[all …]
/linux-2.4.37.9/fs/befs/
Dbtree.c100 befs_btree_node * node, befs_off_t node_off);
102 static int befs_leafnode(befs_btree_node * node);
104 static u16 *befs_bt_keylen_index(befs_btree_node * node);
106 static befs_off_t *befs_bt_valarray(befs_btree_node * node);
108 static char *befs_bt_keydata(befs_btree_node * node);
110 static int befs_find_key(struct super_block *sb, befs_btree_node * node,
113 static char *befs_bt_get_key(struct super_block *sb, befs_btree_node * node,
194 befs_btree_node * node, befs_off_t node_off) in befs_bt_read_node() argument
200 if (node->bh) in befs_bt_read_node()
201 brelse(node->bh); in befs_bt_read_node()
[all …]
/linux-2.4.37.9/drivers/acpi/events/
Devxfregn.c81 struct acpi_namespace_node *node; in acpi_install_address_space_handler() local
103 node = acpi_ns_map_handle_to_node (device); in acpi_install_address_space_handler()
104 if (!node) { in acpi_install_address_space_handler()
114 if ((node->type != ACPI_TYPE_DEVICE) && in acpi_install_address_space_handler()
115 (node->type != ACPI_TYPE_PROCESSOR) && in acpi_install_address_space_handler()
116 (node->type != ACPI_TYPE_THERMAL) && in acpi_install_address_space_handler()
117 (node != acpi_gbl_root_node)) { in acpi_install_address_space_handler()
170 obj_desc = acpi_ns_get_attached_object (node); in acpi_install_address_space_handler()
207 "Creating object on Device %p while installing handler\n", node)); in acpi_install_address_space_handler()
211 if (node->type == ACPI_TYPE_ANY) { in acpi_install_address_space_handler()
[all …]
/linux-2.4.37.9/drivers/acpi/executer/
Dexresnte.c93 struct acpi_namespace_node *node; in acpi_ex_resolve_node_to_value() local
104 node = *object_ptr; in acpi_ex_resolve_node_to_value()
105 source_desc = acpi_ns_get_attached_object (node); in acpi_ex_resolve_node_to_value()
106 entry_type = acpi_ns_get_type ((acpi_handle) node); in acpi_ex_resolve_node_to_value()
109 node, source_desc, acpi_ut_get_type_name (entry_type))); in acpi_ex_resolve_node_to_value()
115 node = ACPI_CAST_PTR (struct acpi_namespace_node, node->object); in acpi_ex_resolve_node_to_value()
116 source_desc = acpi_ns_get_attached_object (node); in acpi_ex_resolve_node_to_value()
117 entry_type = acpi_ns_get_type ((acpi_handle) node); in acpi_ex_resolve_node_to_value()
118 *object_ptr = node; in acpi_ex_resolve_node_to_value()
127 (node->flags & (ANOBJ_METHOD_ARG | ANOBJ_METHOD_LOCAL))) { in acpi_ex_resolve_node_to_value()
[all …]

12345678910>>...19