| tag | line | file | source code |
|---|
| node | 15 | arch/sparc/kernel/auxio.c | int node, auxio_nd; |
| node | 18 | arch/sparc/kernel/auxio.c | node = prom_getchild(prom_root_node); |
| node | 19 | arch/sparc/kernel/auxio.c | auxio_nd = prom_searchsiblings(node, "auxiliary-io"); |
| node | 21 | arch/sparc/kernel/auxio.c | node = prom_searchsiblings(node, "obio"); |
| node | 22 | arch/sparc/kernel/auxio.c | node = prom_getchild(node); |
| node | 23 | arch/sparc/kernel/auxio.c | auxio_nd = prom_searchsiblings(node, "auxio"); |
| node | 262 | arch/sparc/kernel/probe.c | register int node, type; |
| node | 269 | arch/sparc/kernel/probe.c | node = 0; |
| node | 274 | arch/sparc/kernel/probe.c | if(sparc_cpu_model == sun4c) node=prom_getchild(prom_root_node); |
| node | 277 | arch/sparc/kernel/probe.c | node=prom_getchild(prom_searchsiblings(prom_getchild(prom_root_node), "obio")); |
| node | 281 | arch/sparc/kernel/probe.c | prom_getstring(node, "model", node_str, sizeof(node_str)); |
| node | 284 | arch/sparc/kernel/probe.c | if(prom_getproperty(node, "reg", (char *) clk_reg, sizeof(clk_reg)) == -1) { |
| node | 300 | arch/sparc/kernel/probe.c | if(prom_getproperty(node, "reg", (char *) clk_reg, |
| node | 316 | arch/sparc/kernel/probe.c | node = prom_getsibling(node); |
| node | 317 | arch/sparc/kernel/probe.c | if(node == 0) { |
| node | 387 | arch/sparc/kernel/probe.c | int node, auxio_nd; |
| node | 390 | arch/sparc/kernel/probe.c | node = prom_getchild(prom_root_node); |
| node | 391 | arch/sparc/kernel/probe.c | auxio_nd = prom_searchsiblings(node, "auxiliary-io"); |
| node | 393 | arch/sparc/kernel/probe.c | node = prom_searchsiblings(node, "obio"); |
| node | 394 | arch/sparc/kernel/probe.c | node = prom_getchild(node); |
| node | 395 | arch/sparc/kernel/probe.c | auxio_nd = prom_searchsiblings(node, "auxio"); |
| node | 97 | arch/sparc/kernel/time.c | register int node, type; |
| node | 104 | arch/sparc/kernel/time.c | node = 0; |
| node | 109 | arch/sparc/kernel/time.c | if(sparc_cpu_model == sun4c) node=prom_getchild(prom_root_node); |
| node | 112 | arch/sparc/kernel/time.c | node=prom_getchild(prom_searchsiblings(prom_getchild(prom_root_node), "obio")); |
| node | 116 | arch/sparc/kernel/time.c | prom_getstring(node, "model", node_str, sizeof(node_str)); |
| node | 119 | arch/sparc/kernel/time.c | if(prom_getproperty(node, "reg", (char *) clk_reg, sizeof(clk_reg)) == -1) { |
| node | 135 | arch/sparc/kernel/time.c | if(prom_getproperty(node, "reg", (char *) clk_reg, |
| node | 151 | arch/sparc/kernel/time.c | node = prom_getsibling(node); |
| node | 152 | arch/sparc/kernel/time.c | if(node == 0) { |
| node | 36 | arch/sparc/prom/devtree.c | int node; |
| node | 69 | arch/sparc/prom/memory.c | int node = 0; |
| node | 109 | arch/sparc/prom/memory.c | node = prom_getchild(prom_root_node); |
| node | 110 | arch/sparc/prom/memory.c | node = prom_searchsiblings(node, "memory"); |
| node | 111 | arch/sparc/prom/memory.c | num_regs = prom_getproperty(node, "available", |
| node | 125 | arch/sparc/prom/memory.c | num_regs = prom_getproperty(node, "reg", |
| node | 139 | arch/sparc/prom/memory.c | node = prom_getchild(prom_root_node); |
| node | 140 | arch/sparc/prom/memory.c | node = prom_searchsiblings(node, "virtual-memory"); |
| node | 141 | arch/sparc/prom/memory.c | num_regs = prom_getproperty(node, "available", |
| node | 74 | arch/sparc/prom/ranges.c | int node, obio_node, sbus_node; |
| node | 81 | arch/sparc/prom/ranges.c | node = prom_getchild(prom_root_node); |
| node | 82 | arch/sparc/prom/ranges.c | obio_node = prom_searchsiblings(node, "obio"); |
| node | 83 | arch/sparc/prom/ranges.c | sbus_node = prom_searchsiblings(node, "iommu"); |
| node | 19 | arch/sparc/prom/tree.c | prom_getchild(int node) |
| node | 23 | arch/sparc/prom/tree.c | if(node == -1) return 0; |
| node | 24 | arch/sparc/prom/tree.c | cnode = prom_nodeops->no_child(node); |
| node | 33 | arch/sparc/prom/tree.c | prom_getsibling(int node) |
| node | 37 | arch/sparc/prom/tree.c | if(node == -1) return 0; |
| node | 38 | arch/sparc/prom/tree.c | sibnode = prom_nodeops->no_nextnode(node); |
| node | 47 | arch/sparc/prom/tree.c | prom_getproplen(int node, char *prop) |
| node | 49 | arch/sparc/prom/tree.c | if((!node) || (!prop)) return -1; |
| node | 50 | arch/sparc/prom/tree.c | return prom_nodeops->no_proplen(node, prop); |
| node | 58 | arch/sparc/prom/tree.c | prom_getproperty(int node, char *prop, char *buffer, int bufsize) |
| node | 62 | arch/sparc/prom/tree.c | plen = prom_getproplen(node, prop); |
| node | 66 | arch/sparc/prom/tree.c | return prom_nodeops->no_getprop(node, prop, buffer); |
| node | 73 | arch/sparc/prom/tree.c | prom_getint(int node, char *prop) |
| node | 77 | arch/sparc/prom/tree.c | if(prom_getproperty(node, prop, (char *) &intprop, sizeof(int)) != -1) |
| node | 88 | arch/sparc/prom/tree.c | prom_getintdefault(int node, char *property, int deflt) |
| node | 92 | arch/sparc/prom/tree.c | retval = prom_getint(node, property); |
| node | 100 | arch/sparc/prom/tree.c | prom_getbool(int node, char *prop) |
| node | 104 | arch/sparc/prom/tree.c | retval = prom_getproplen(node, prop); |
| node | 114 | arch/sparc/prom/tree.c | prom_getstring(int node, char *prop, char *user_buf, int ubuf_size) |
| node | 118 | arch/sparc/prom/tree.c | len = prom_getproperty(node, prop, user_buf, ubuf_size); |
| node | 129 | arch/sparc/prom/tree.c | prom_nodematch(int node, char *name) |
| node | 132 | arch/sparc/prom/tree.c | prom_getproperty(node, "name", namebuf, sizeof(namebuf)); |
| node | 160 | arch/sparc/prom/tree.c | prom_firstprop(int node) |
| node | 162 | arch/sparc/prom/tree.c | if(node == -1) return ""; |
| node | 163 | arch/sparc/prom/tree.c | return prom_nodeops->no_nextprop(node, (char *) 0x0); |
| node | 171 | arch/sparc/prom/tree.c | prom_nextprop(int node, char *oprop) |
| node | 173 | arch/sparc/prom/tree.c | if(node == -1) return ""; |
| node | 174 | arch/sparc/prom/tree.c | return prom_nodeops->no_nextprop(node, oprop); |
| node | 178 | arch/sparc/prom/tree.c | prom_node_has_property(int node, char *prop) |
| node | 183 | arch/sparc/prom/tree.c | current_property = prom_nextprop(node, current_property); |
| node | 194 | arch/sparc/prom/tree.c | prom_setprop(int node, char *pname, char *value, int size) |
| node | 198 | arch/sparc/prom/tree.c | return prom_nodeops->no_setprop(node, pname, value, size); |
| node | 162 | drivers/char/mem.c | static int read_null(struct inode * node, struct file * file, char * buf, int count) |
| node | 172 | drivers/char/mem.c | static int read_zero(struct inode * node, struct file * file, char * buf, int count) |
| node | 192 | drivers/char/mem.c | static int read_full(struct inode * node, struct file * file, char * buf,int count) |
| node | 56 | include/asm-sparc/dma.h | int node; /* Prom node for this DMA device */ |
| node | 175 | include/asm-sparc/openprom.h | int (*no_nextnode)(int node); |
| node | 176 | include/asm-sparc/openprom.h | int (*no_child)(int node); |
| node | 177 | include/asm-sparc/openprom.h | int (*no_proplen)(int node, char *name); |
| node | 178 | include/asm-sparc/openprom.h | int (*no_getprop)(int node, char *name, char *val); |
| node | 179 | include/asm-sparc/openprom.h | int (*no_setprop)(int node, char *name, char *val, int len); |
| node | 180 | include/asm-sparc/openprom.h | char * (*no_nextprop)(int node, char *name); |
| node | 218 | include/asm-sparc/oplib.h | extern int prom_getsibling(int node); |
| node | 232 | include/asm-sparc/oplib.h | extern int prom_getint(int node, char *property); |
| node | 235 | include/asm-sparc/oplib.h | extern int prom_getintdefault(int node, char *property, int defval); |
| node | 238 | include/asm-sparc/oplib.h | extern int prom_getbool(int node, char *prop); |
| node | 241 | include/asm-sparc/oplib.h | extern void prom_getstring(int node, char *prop, char *buf, int bufsize); |
| node | 254 | include/asm-sparc/oplib.h | extern char *prom_firstprop(int node); |
| node | 259 | include/asm-sparc/oplib.h | extern char *prom_nextprop(int node, char *prev_property); |
| node | 262 | include/asm-sparc/oplib.h | extern int prom_node_has_property(int node, char *property); |
| node | 267 | include/asm-sparc/oplib.h | extern int prom_setprop(int node, char *prop_name, char *prop_value, |
| node | 11 | include/linux/lists.h | #define DNODE_SINGLE(node) {(node),(node)} |
| node | 21 | include/linux/lists.h | #define DLIST_INSERT_AFTER(node, new, listnam) do { \ |
| node | 22 | include/linux/lists.h | (new)->listnam.dl_prev = (node); \ |
| node | 23 | include/linux/lists.h | (new)->listnam.dl_next = (node)->listnam.dl_next; \ |
| node | 24 | include/linux/lists.h | (node)->listnam.dl_next->listnam.dl_prev = (new); \ |
| node | 25 | include/linux/lists.h | (node)->listnam.dl_next = (new); \ |
| node | 28 | include/linux/lists.h | #define DLIST_INSERT_BEFORE(node, new, listnam) do { \ |
| node | 29 | include/linux/lists.h | (new)->listnam.dl_next = (node); \ |
| node | 30 | include/linux/lists.h | (new)->listnam.dl_prev = (node)->listnam.dl_prev; \ |
| node | 31 | include/linux/lists.h | (node)->listnam.dl_prev->listnam.dl_next = (new); \ |
| node | 32 | include/linux/lists.h | (node)->listnam.dl_prev = (new); \ |
| node | 35 | include/linux/lists.h | #define DLIST_DELETE(node, listnam) do { \ |
| node | 36 | include/linux/lists.h | node->listnam.dl_prev->listnam.dl_next = \ |
| node | 37 | include/linux/lists.h | node->listnam.dl_next; \ |
| node | 38 | include/linux/lists.h | node->listnam.dl_next->listnam.dl_prev = \ |
| node | 39 | include/linux/lists.h | node->listnam.dl_prev; \ |
| node | 68 | include/linux/ncp.h | __u8 node[IPX_NODE_LEN] __attribute__ ((packed)); |
| node | 22 | include/net/ipx.h | unsigned char node[IPX_NODE_LEN]; |
| node | 107 | include/net/sock.h | unsigned char node[IPX_NODE_LEN]; |
| node | 248 | mm/mmap.c | static inline void avl_neighbours (struct vm_area_struct * node, struct vm_area_struct * tree, struct vm_area_struct ** to_the_left, struct vm_area_struct ** to_the_right) |
| node | 250 | mm/mmap.c | vm_avl_key_t key = node->vm_avl_key; |
| node | 268 | mm/mmap.c | if (tree != node) { |
| node | 273 | mm/mmap.c | struct vm_area_struct * node; |
| node | 274 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
| node | 276 | mm/mmap.c | *to_the_left = node; |
| node | 279 | mm/mmap.c | struct vm_area_struct * node; |
| node | 280 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
| node | 282 | mm/mmap.c | *to_the_right = node; |
| node | 284 | mm/mmap.c | if ((*to_the_left && ((*to_the_left)->vm_next != node)) || (node->vm_next != *to_the_right)) |
| node | 298 | mm/mmap.c | struct vm_area_struct * node = *nodeplace; |
| node | 299 | mm/mmap.c | struct vm_area_struct * nodeleft = node->vm_avl_left; |
| node | 300 | mm/mmap.c | struct vm_area_struct * noderight = node->vm_avl_right; |
| node | 320 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
| node | 321 | mm/mmap.c | nodeleft->vm_avl_height = 1 + (node->vm_avl_height = 1 + heightleftright); |
| node | 334 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
| node | 336 | mm/mmap.c | nodeleftright->vm_avl_right = node; |
| node | 337 | mm/mmap.c | nodeleft->vm_avl_height = node->vm_avl_height = heightleftright; |
| node | 348 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
| node | 349 | mm/mmap.c | noderight->vm_avl_height = 1 + (node->vm_avl_height = 1 + heightrightleft); |
| node | 353 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
| node | 355 | mm/mmap.c | noderightleft->vm_avl_left = node; |
| node | 356 | mm/mmap.c | noderight->vm_avl_height = node->vm_avl_height = heightrightleft; |
| node | 363 | mm/mmap.c | if (height == node->vm_avl_height) |
| node | 365 | mm/mmap.c | node->vm_avl_height = height; |
| node | 379 | mm/mmap.c | struct vm_area_struct * node = *nodeplace; |
| node | 380 | mm/mmap.c | if (node == avl_empty) |
| node | 383 | mm/mmap.c | if (key < node->vm_avl_key) |
| node | 384 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
| node | 386 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
| node | 408 | mm/mmap.c | struct vm_area_struct * node = *nodeplace; |
| node | 409 | mm/mmap.c | if (node == avl_empty) |
| node | 412 | mm/mmap.c | if (key < node->vm_avl_key) { |
| node | 413 | mm/mmap.c | *to_the_right = node; |
| node | 414 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
| node | 416 | mm/mmap.c | *to_the_left = node; |
| node | 417 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
| node | 437 | mm/mmap.c | struct vm_area_struct * node = *nodeplace; |
| node | 438 | mm/mmap.c | if (node == avl_empty) { |
| node | 444 | mm/mmap.c | if (key == node->vm_avl_key) |
| node | 446 | mm/mmap.c | if (key < node->vm_avl_key) |
| node | 447 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
| node | 449 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
| node | 459 | mm/mmap.c | struct vm_area_struct * node; |
| node | 461 | mm/mmap.c | node = *nodeplace; |
| node | 462 | mm/mmap.c | if (node->vm_avl_right == avl_empty) |
| node | 465 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
| node | 467 | mm/mmap.c | *nodeplace = node->vm_avl_left; |
| node | 469 | mm/mmap.c | node->vm_avl_left = node_to_delete->vm_avl_left; |
| node | 470 | mm/mmap.c | node->vm_avl_right = node_to_delete->vm_avl_right; |
| node | 471 | mm/mmap.c | node->vm_avl_height = node_to_delete->vm_avl_height; |
| node | 472 | mm/mmap.c | *nodeplace_to_delete = node; /* replace node_to_delete */ |
| node | 473 | mm/mmap.c | *stack_ptr_to_delete = &node->vm_avl_left; /* replace &node_to_delete->vm_avl_left */ |
| node | 490 | net/appletalk/ddp.c | static struct atalk_iface *atalk_find_anynet(int node, struct device *dev) |
| node | 497 | net/appletalk/ddp.c | if ( node == ATADDR_BCAST || iface->address.s_node == node ) |
| node | 507 | net/appletalk/ddp.c | static struct atalk_iface *atalk_find_interface(int net, int node) |
| node | 512 | net/appletalk/ddp.c | if((node==ATADDR_BCAST || iface->address.s_node==node) |
| node | 126 | net/bridge/br_tree.c | struct fdb * node = *nodeplace; |
| node | 127 | net/bridge/br_tree.c | struct fdb * nodeleft = node->fdb_avl_left; |
| node | 128 | net/bridge/br_tree.c | struct fdb * noderight = node->fdb_avl_right; |
| node | 148 | net/bridge/br_tree.c | node->fdb_avl_left = nodeleftright; |
| node | 149 | net/bridge/br_tree.c | nodeleft->fdb_avl_right = node; |
| node | 150 | net/bridge/br_tree.c | nodeleft->fdb_avl_height = 1 + (node->fdb_avl_height = 1 + heightleftright); |
| node | 163 | net/bridge/br_tree.c | node->fdb_avl_left = nodeleftright->fdb_avl_right; |
| node | 165 | net/bridge/br_tree.c | nodeleftright->fdb_avl_right = node; |
| node | 166 | net/bridge/br_tree.c | nodeleft->fdb_avl_height = node->fdb_avl_height = heightleftright; |
| node | 176 | net/bridge/br_tree.c | node->fdb_avl_right = noderightleft; |
| node | 177 | net/bridge/br_tree.c | noderight->fdb_avl_left = node; |
| node | 178 | net/bridge/br_tree.c | noderight->fdb_avl_height = 1 + (node->fdb_avl_height = 1 + heightrightleft); |
| node | 182 | net/bridge/br_tree.c | node->fdb_avl_right = noderightleft->fdb_avl_left; |
| node | 184 | net/bridge/br_tree.c | noderightleft->fdb_avl_left = node; |
| node | 185 | net/bridge/br_tree.c | noderight->fdb_avl_height = node->fdb_avl_height = heightrightleft; |
| node | 191 | net/bridge/br_tree.c | if (height == node->fdb_avl_height) |
| node | 193 | net/bridge/br_tree.c | node->fdb_avl_height = height; |
| node | 212 | net/bridge/br_tree.c | struct fdb *node; |
| node | 214 | net/bridge/br_tree.c | node = *nodeplace; |
| node | 215 | net/bridge/br_tree.c | if (node == avl_br_empty) |
| node | 218 | net/bridge/br_tree.c | if (addr_cmp(new_node->ula, node->ula) == 0) { /* update */ |
| node | 219 | net/bridge/br_tree.c | node->flags = new_node->flags; |
| node | 220 | net/bridge/br_tree.c | node->timer = new_node->timer; |
| node | 223 | net/bridge/br_tree.c | if (addr_cmp(new_node->ula, node->ula) < 0) { |
| node | 224 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_left; |
| node | 226 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_right; |
| node | 264 | net/bridge/br_tree.c | struct fdb * node = *nodeplace; |
| node | 265 | net/bridge/br_tree.c | if (node == avl_br_empty) { |
| node | 271 | net/bridge/br_tree.c | if (addr_cmp(node_to_delete->ula, node->ula) == 0) |
| node | 273 | net/bridge/br_tree.c | if (addr_cmp(node_to_delete->ula, node->ula) < 0) |
| node | 274 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_left; |
| node | 276 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_right; |
| node | 286 | net/bridge/br_tree.c | struct fdb * node; |
| node | 288 | net/bridge/br_tree.c | node = *nodeplace; |
| node | 289 | net/bridge/br_tree.c | if (node->fdb_avl_right == avl_br_empty) |
| node | 292 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_right; |
| node | 294 | net/bridge/br_tree.c | *nodeplace = node->fdb_avl_left; |
| node | 296 | net/bridge/br_tree.c | node->fdb_avl_left = node_to_delete->fdb_avl_left; |
| node | 297 | net/bridge/br_tree.c | node->fdb_avl_right = node_to_delete->fdb_avl_right; |
| node | 298 | net/bridge/br_tree.c | node->fdb_avl_height = node_to_delete->fdb_avl_height; |
| node | 299 | net/bridge/br_tree.c | *nodeplace_to_delete = node; /* replace node_to_delete */ |
| node | 300 | net/bridge/br_tree.c | *stack_ptr_to_delete = &node->fdb_avl_left; /* replace &node_to_delete->fdb_avl_left */ |
| node | 276 | net/ipx/af_ipx.c | unsigned char *node, unsigned short port) |
| node | 283 | net/ipx/af_ipx.c | && (memcmp(node, s->protinfo.af_ipx.node, IPX_NODE_LEN) == 0)) |
| node | 389 | net/ipx/af_ipx.c | int is_broadcast = (memcmp(ipx->ipx_dest.node, ipx_broadcast_node, |
| node | 398 | net/ipx/af_ipx.c | || (memcmp(ipx->ipx_dest.node, s->protinfo.af_ipx.node, |
| node | 573 | net/ipx/af_ipx.c | static int ipxitf_send(ipx_interface *intrfc, struct sk_buff *skb, char *node) |
| node | 602 | net/ipx/af_ipx.c | if (memcmp(intrfc->if_node, node, IPX_NODE_LEN) == 0) |
| node | 620 | net/ipx/af_ipx.c | if (memcmp(ipx_broadcast_node, node, IPX_NODE_LEN) == 0) |
| node | 664 | net/ipx/af_ipx.c | if (memcmp(ipx_broadcast_node, node, IPX_NODE_LEN) == 0) |
| node | 667 | net/ipx/af_ipx.c | memcpy(dest_node, &(node[IPX_NODE_LEN-addr_len]), addr_len); |
| node | 779 | net/ipx/af_ipx.c | if ((memcmp(ipx_broadcast_node, ipx->ipx_dest.node, IPX_NODE_LEN) == 0) |
| node | 780 | net/ipx/af_ipx.c | || (memcmp(intrfc->if_node, ipx->ipx_dest.node, IPX_NODE_LEN) == 0)) |
| node | 1101 | net/ipx/af_ipx.c | ipxrtr_add_route(unsigned long network, ipx_interface *intrfc, unsigned char *node) |
| node | 1119 | net/ipx/af_ipx.c | if (node == NULL) { |
| node | 1123 | net/ipx/af_ipx.c | memcpy(rt->ir_router_node, node, IPX_NODE_LEN); |
| node | 1290 | net/ipx/af_ipx.c | memcpy(ipx->ipx_source.node, sk->protinfo.af_ipx.node, IPX_NODE_LEN); |
| node | 1296 | net/ipx/af_ipx.c | memcpy(ipx->ipx_source.node, intrfc->if_node, IPX_NODE_LEN); |
| node | 1301 | net/ipx/af_ipx.c | memcpy(ipx->ipx_source.node, sk->protinfo.af_ipx.intrfc->if_node, IPX_NODE_LEN); |
| node | 1306 | net/ipx/af_ipx.c | memcpy(ipx->ipx_dest.node,usipx->sipx_node,IPX_NODE_LEN); |
| node | 1329 | net/ipx/af_ipx.c | rt->ir_router_node : ipx->ipx_dest.node); |
| node | 1347 | net/ipx/af_ipx.c | r->ir_router_node : ipx->ipx_dest.node); |
| node | 1482 | net/ipx/af_ipx.c | s->protinfo.af_ipx.node[0], |
| node | 1483 | net/ipx/af_ipx.c | s->protinfo.af_ipx.node[1], |
| node | 1484 | net/ipx/af_ipx.c | s->protinfo.af_ipx.node[2], |
| node | 1485 | net/ipx/af_ipx.c | s->protinfo.af_ipx.node[3], |
| node | 1486 | net/ipx/af_ipx.c | s->protinfo.af_ipx.node[4], |
| node | 1487 | net/ipx/af_ipx.c | s->protinfo.af_ipx.node[5], |
| node | 1500 | net/ipx/af_ipx.c | s->protinfo.af_ipx.dest_addr.node[0], |
| node | 1501 | net/ipx/af_ipx.c | s->protinfo.af_ipx.dest_addr.node[1], |
| node | 1502 | net/ipx/af_ipx.c | s->protinfo.af_ipx.dest_addr.node[2], |
| node | 1503 | net/ipx/af_ipx.c | s->protinfo.af_ipx.dest_addr.node[3], |
| node | 1504 | net/ipx/af_ipx.c | s->protinfo.af_ipx.dest_addr.node[4], |
| node | 1505 | net/ipx/af_ipx.c | s->protinfo.af_ipx.dest_addr.node[5], |
| node | 1806 | net/ipx/af_ipx.c | memcpy(sk->protinfo.af_ipx.node, intrfc->if_node, |
| node | 1811 | net/ipx/af_ipx.c | memcpy(sk->protinfo.af_ipx.node, addr->sipx_node, IPX_NODE_LEN); |
| node | 1814 | net/ipx/af_ipx.c | sk->protinfo.af_ipx.node, |
| node | 1830 | net/ipx/af_ipx.c | memcpy(sk->protinfo.af_ipx.node, intrfc->if_node, |
| node | 1896 | net/ipx/af_ipx.c | memcpy(sk->protinfo.af_ipx.dest_addr.node, |
| node | 1934 | net/ipx/af_ipx.c | memcpy(sipx.sipx_node,addr->node,IPX_NODE_LEN); |
| node | 1940 | net/ipx/af_ipx.c | memcpy(sipx.sipx_node, sk->protinfo.af_ipx.node, IPX_NODE_LEN); |
| node | 1996 | net/ipx/af_ipx.c | str,ntohl(p->net),p->node[0],p->node[1],p->node[2], |
| node | 1997 | net/ipx/af_ipx.c | p->node[3],p->node[4],p->node[5],ntohs(p->sock)); |
| node | 2104 | net/ipx/af_ipx.c | memcpy(usipx->sipx_node,sk->protinfo.af_ipx.dest_addr.node,IPX_NODE_LEN); |
| node | 2149 | net/ipx/af_ipx.c | memcpy(sipx->sipx_node,ipx->ipx_source.node,IPX_NODE_LEN); |