/netbsd-6-1-5-RELEASE/external/ibm-public/postfix/dist/src/util/ |
H A D | dict.c | 232 DICT_NODE *node; local 236 if ((node = dict_node(dict_name)) == 0) { 237 node = (DICT_NODE *) mymalloc(sizeof(*node)); 238 node->dict = dict_info; 239 node->refcount = 0; 240 htable_enter(dict_table, dict_name, (char *) node); 241 } else if (dict_info != node->dict) 243 node->refcount++; 245 msg_info("%s: %s %d", myname, dict_name, node 252 DICT_NODE *node; local 261 DICT_NODE *node = (DICT_NODE *) ptr; local 274 DICT_NODE *node; local 289 DICT_NODE *node; local 309 DICT_NODE *node; local 332 DICT_NODE *node; local 357 DICT_NODE *node; local [all...] |
/netbsd-6-1-5-RELEASE/sys/dev/xmi/ |
H A D | xmireg.h | 34 * XMI node definitions. 38 * XMI node addresses 40 #define XMI_NODESIZE 0x80000 /* Size of one XMI node (512k) */ 41 #define XMI_NODE(node) (XMI_NODESIZE * (node))
|
/netbsd-6-1-5-RELEASE/dist/pf/sbin/pfctl/ |
H A D | pfctl_qstats.c | 87 struct pf_altq_node *root = NULL, *node; local 96 for (node = root; node != NULL; node = node->next) { 97 if (iface != NULL && strcmp(node->altq.ifname, iface)) 103 pfctl_print_altq_node(dev, node, 0, opts); 112 for (node = root; node != NULL; node 125 struct pf_altq_node *node; local 180 struct pf_altq_node *node; local 220 struct pf_altq_node *node, *child; local 237 pfctl_print_altq_node(int dev, const struct pf_altq_node *node, unsigned level, int opts) argument 353 pfctl_free_altq_node(struct pf_altq_node *node) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/lib/datastruct/ |
H A D | btree.c | 21 struct node { struct 23 struct node *l, *r, *p; 30 struct node *root; 60 static struct node **_lookup(struct node *const *c, uint32_t key, 61 struct node **p) 76 return (struct node **)c; 82 struct node *p, **c = _lookup(&t->root, key, &p); 89 struct node *p, **c = _lookup(&t->root, key, &p), *n; 108 return ((struct node *) i [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | lto-cgraph.c | 79 struct cgraph_node *node) 84 slot = pointer_map_contains (encoder->map, node); 88 slot = pointer_map_insert (encoder->map, node); 90 VEC_safe_push (cgraph_node_ptr, heap, encoder->nodes, node); 104 struct cgraph_node *node) 106 void **slot = pointer_map_contains (encoder->map, node); 111 /* Return the cgraph node corresponding to REF using ENCODER. */ 173 that have had their callgraph node written so far. This is used to 174 determine if NODE is a clone of a previously written node. */ 177 lto_output_node (struct lto_simple_output_block *ob, struct cgraph_node *node, argument 78 lto_cgraph_encoder_encode(lto_cgraph_encoder_t encoder, struct cgraph_node *node) argument 103 lto_cgraph_encoder_lookup(lto_cgraph_encoder_t encoder, struct cgraph_node *node) argument 380 struct cgraph_node *node; local 501 input_overwrite_node(struct lto_file_decl_data *file_data, struct cgraph_node *node, enum LTO_cgraph_tags tag, struct bitpack_d *bp, unsigned int stack_size, unsigned int self_time, unsigned int time_inlining_benefit, unsigned int self_size, unsigned int size_inlining_benefit) argument 550 struct cgraph_node *node; local 718 struct cgraph_node *node; local 813 struct cgraph_node *node; local [all...] |
/netbsd-6-1-5-RELEASE/bin/sh/ |
H A D | jobs.h | 90 struct job *makejob(union node *, int); 91 int forkshell(struct job *, union node *, int); 92 void forkchild(struct job *, union node *, int, int); 93 int forkparent(struct job *, union node *, int, pid_t); 96 void commandtext(struct procstat *, union node *);
|
H A D | nodes.c.pat | 50 int funcstringsize; /* size of strings in node */ 57 STATIC void calcsize(union node *); 59 STATIC union node *copynode(union node *); 69 union node * 71 union node *n; 87 union node *n; 107 STATIC union node * 109 union node *n; 111 union node *ne [all...] |
H A D | parser.h | 75 #define NEOF ((union node *)&tokpushback) 79 union node *parsecmd(int); 80 void fixredir(union node *, const char *, int);
|
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/makeinfo/ |
H A D | node.h | 3 /* node.h -- declarations for Node. 4 Id: node.h,v 1.2 2004/04/11 17:56:47 karl Exp 30 /* What we remember for each node. */ 34 char *node; /* Name of this node. */ member in struct:tentry 35 char *prev; /* Name of "Prev:" for this node. */ 36 char *next; /* Name of "Next:" for this node. */ 37 char *up; /* Name of "Up:" for this node. */ 38 int position; /* Output file position of this node. */ 40 char *filename; /* The file that this node wa 69 char *node; /* Name of node referred to. */ member in struct:node_ref [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/ia64/stand/common/ |
H A D | merge_help.awk | 90 node = first; 91 while (node != -1) 94 printf "# T%s ", help[node, "T"]; 95 if (help[node, "S"] != "") printf "S%s ", help[node, "S"]; 96 printf "D%s\n\n", help[node, "D"]; 97 for (i = 0; i < help[node, "text"]; i++) 98 printf "%s\n", help[node, "text", i]; 99 node = help[node, "lin [all...] |
/netbsd-6-1-5-RELEASE/dist/ipf/lib/ |
H A D | printpool_live.c | 23 ip_pool_node_t entry, *top, *node; local 57 node = malloc(sizeof(*top)); 58 if (node == NULL) 60 bcopy(&entry, node, sizeof(entry)); 61 node->ipn_next = top; 62 top = node; 66 node = top; 67 (void) printpoolnode(node, opts); 70 top = node->ipn_next; 71 free(node); [all...] |
/netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/uts/common/os/ |
H A D | list.c | 39 #define list_object(a, node) ((void *)(((char *)node) - (a)->list_offset)) 42 #define list_insert_after_node(list, node, object) { \ 44 lnew->list_prev = (node); \ 45 lnew->list_next = (node)->list_next; \ 46 (node)->list_next->list_prev = lnew; \ 47 (node)->list_next = lnew; \ 50 #define list_insert_before_node(list, node, object) { \ 52 lnew->list_next = (node); \ 53 lnew->list_prev = (node) 79 list_node_t *node = &list->list_head; local 172 list_node_t *node = list_d2l(list, object); local 183 list_node_t *node = list_d2l(list, object); local [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/ofppc/pci/ |
H A D | gt_mainbus.c | 127 int node; local 135 for (node = OF_child(OF_finddevice("/")); node; node = OF_peer(node)) { 137 if (OF_getprop(node, "name", name, sizeof(name)) == -1) 140 for (node = OF_child(node); node; 141 node 166 int node; local [all...] |
/netbsd-6-1-5-RELEASE/lib/libc/stdlib/ |
H A D | _env.c | 53 * Red-Black tree node for tracking memory used by environment variables. 119 env_tree_compare_key(void *ctx, const void *node, const void *key) argument 121 return env_tree_compare_nodes(ctx, node, 159 env_node_t *node; local 162 node = rb_tree_find_node(&env_tree, envvar); 163 if (node != NULL) { 164 rb_tree_remove_node(&env_tree, node); 165 free(node); 176 env_node_t *node; local 178 node 197 env_node_t *node; local 211 env_node_t *node, *next; local [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/sparc64/dev/ |
H A D | pci_machdep.c | 76 ofpci_make_tag(pci_chipset_tag_t pc, int node, int b, int d, int f) argument 81 tag = PCITAG_CREATE(node, b, d, f); 84 ("%s: creating tag for node %x bus %d dev %d fn %d\n", 85 __func__, node, b, d, f)); 119 int node, len; local 126 * Refer to the PCI/CardBus bus node first. 127 * It returns a tag if node is present and bus is valid. 131 node = (*pc->spc_busnode)[b].node; 133 if (node ! 252 int node, b, d, f, ret; local 410 int len, node = PCITAG_NODE(tag); local [all...] |
/netbsd-6-1-5-RELEASE/external/public-domain/xz/dist/src/liblzma/common/ |
H A D | index.c | 47 /// Root node 50 /// Leftmost node. Since the tree will be filled sequentially, 51 /// this won't change after the first node has been added to 55 /// The rightmost node in the tree. Since the tree is filled 56 /// sequentially, this is always the node where to add the new data. 73 index_tree_node node; member in struct:__anon2910 108 /// Every index_stream is a node in the tree of Sreams. 109 index_tree_node node; member in struct:__anon2911 119 /// INDEX_GROUP_SIZE Records per node by default. 194 index_tree_node_end(index_tree_node *node, lzma_allocato argument 218 index_tree_end(index_tree *tree, lzma_allocator *allocator, void (*free_func)(void *node, lzma_allocator *allocator)) argument 231 index_tree_append(index_tree *tree, index_tree_node *node) argument 295 index_tree_next(const index_tree_node *node) argument 319 const index_tree_node *node = tree->root; local 371 index_stream_end(void *node, lzma_allocator *allocator) argument [all...] |
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/ |
H A D | rf_evenodd_dagfuncs.c | 67 * the following encoding node functions is used in EO_000_CreateLargeWriteDAG 70 rf_RegularPEFunc(RF_DagNode_t *node) argument 72 rf_RegularESubroutine(node, node->results[1]); 73 rf_RegularXorFunc(node);/* does the wakeup here! */ 99 rf_RegularONEFunc(RF_DagNode_t *node) argument 101 RF_Raid_t *raidPtr = (RF_Raid_t *) node->params[node->numParams - 1].p; 103 int EpdaIndex = (node->numParams - 1) / 2 - 1; /* the parameter of node 158 rf_SimpleONEFunc(RF_DagNode_t *node) argument 198 rf_RegularESubroutine(RF_DagNode_t *node, char *ebuf) argument 229 rf_RegularEFunc(RF_DagNode_t *node) argument 251 rf_DegrESubroutine(RF_DagNode_t *node, char *ebuf) argument 287 rf_Degraded_100_EOFunc(RF_DagNode_t *node) argument 399 rf_RecoveryEFunc(RF_DagNode_t *node) argument 442 rf_EO_DegradedWriteEFunc(RF_DagNode_t * node) argument 651 rf_EvenOddDoubleRecoveryFunc(RF_DagNode_t *node) argument 851 rf_EOWriteDoubleRecoveryFunc(RF_DagNode_t *node) argument [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/bind/dist/lib/dns/ |
H A D | compress.c | 66 dns_compressnode_t *node; local 74 node = cctx->table[i]; 76 if (node->count < DNS_COMPRESS_INITIALNODES) 78 isc_mem_put(cctx->mctx, node, sizeof(*node)); 122 #define NODENAME(node, name) \ 124 (name)->length = (node)->r.length; \ 125 (name)->labels = (node)->labels; \ 126 (name)->ndata = (node)->r.base; \ 140 dns_compressnode_t *node local 206 dns_compressnode_t *node; local 256 dns_compressnode_t *node; local [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/alpha/tlsb/ |
H A D | tlsb.c | 79 * these are just the actual hard TL node IDS that we 93 aprint_normal("%s at %s node %d", 96 aprint_normal(" node %d: %s", tap->ta_node, 127 int node; local 140 * The highest priority I/O node has to be in 141 * node #8, and I want to find it *first*, since 145 for (node = 0; node <= TLSB_NODE_MAX; ++node) { 150 if (badaddr(TLSB_NODE_REG_ADDR(node, TLDE [all...] |
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/src/ |
H A D | hash.h | 30 struct node struct 33 struct node *next; 34 struct node *prev; 35 struct node *hashnext; 36 struct node *hashprev; 39 void (*delproc) (struct node *); 41 typedef struct node Node;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/torture/ |
H A D | pr42773.C | 25 NodePtr node; member in class:QValueListPrivate 28 node = new Node; 29 node->next = node->prev = node; 32 NodePtr p = node->next; 33 while( p != node ) {
|
/netbsd-6-1-5-RELEASE/sys/dev/ofw/ |
H A D | ofw_subr.c | 78 * This routine checks an OFW node's "compatible" entry to see if 147 * This routine places the last component of an OFW node's name 165 * (meaning that the leaf node name was successfully extracted). 168 * If the leaf node name was successfully extracted, 'buf' is 169 * filled in with at most 'bufsize' bytes of the leaf node 170 * name. If the leaf node was not successfully extracted, a 208 * Find the first child of a given node that matches name. Does not recurse. 211 of_find_firstchild_byname(int node, const char *name) argument 216 for (nn = OF_child(node); nn; nn = OF_peer(nn)) { 227 * Find a give node b 233 int node, next; local 264 of_to_uint32_prop(prop_dictionary_t dict, int node, const char *ofname, const char *propname) argument 280 of_to_dataprop(prop_dictionary_t dict, int node, const char *ofname, const char *propname) argument 338 int node, len; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/libdm/regex/ |
H A D | ttree.c | 21 struct node { struct 23 struct node *l, *m, *r; 30 struct node *root; 33 static struct node **_lookup_single(struct node **c, unsigned int k) 53 struct node **c = &tt->root; 64 static struct node *_tree_node(struct dm_pool *mem, unsigned int k) 66 struct node *n = dm_pool_zalloc(mem, sizeof(*n)); 76 struct node **c = &tt->root;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/ |
H A D | 20050309-1.c | 10 void *node, int topLevel) 26 error (1, 0, 0, node, "%s", name); 34 error (1, 0, 0, node, "%s", name); 8 test(char *ret, int *counter, void *schema, const char* name, const char *namespace, void *node, int topLevel) argument
|
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/makeinfo/tests/ |
H A D | Makefile.am | 21 node-expand node-value node-whitespace \ 35 node-expand.txi node-value.txi node-whitespace.txi \
|