/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | ipa-utils.c | 83 unnecessary if C had nested functions. V is the node to start 92 /* mark node as old */ 106 /* Bypass the clones and only look at the master node. Skip 162 struct cgraph_node *node; 173 for (node = cgraph_nodes; node; node = node->next) 174 if ((node->analyzed) 175 && (cgraph_is_master_clone (node) 161 struct cgraph_node *node; local [all...] |
H A D | tree-browser.c | 488 /* Search in the subtree a node with the given code. */ 495 fprintf (TB_OUT_FILE, "There's no node with this code (reachable via the walk_tree function from this node).\n"); 499 fprintf (TB_OUT_FILE, "Achoo! I got this node in the tree.\n"); 565 /* Don't go further if it's the last node in this chain. */ 621 /* Search the first node in this BIND_EXPR. */ 624 TB_first_in_bind (tree node) argument 628 if (node == NULL_TREE) 631 while ((t = TB_prev_expr (node))) 632 node 640 TB_last_in_bind(tree node) argument 656 TB_up_expr(tree node) argument 669 TB_prev_expr(tree node) argument 686 TB_next_expr(tree node) argument 698 TB_current_chain_node(tree node) argument 727 tree node; local 783 tree node, parent; local 836 TB_update_up(tree node) argument [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/macppc/macppc/ |
H A D | cpu.c | 103 int node; local 108 node = OF_finddevice("/cpus"); 109 if (node != -1) { 110 for (node = OF_child(node); node != 0; node = OF_peer(node)) { 113 l = OF_getprop(node, "reg", &cpunum, sizeof(cpunum)); 136 int node; local 214 u_int node, off; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | tree-browser.c | 492 /* Search in the subtree a node with the given code. */ 499 fprintf (TB_OUT_FILE, "There's no node with this code (reachable via the walk_tree function from this node).\n"); 503 fprintf (TB_OUT_FILE, "Achoo! I got this node in the tree.\n"); 569 /* Don't go further if it's the last node in this chain. */ 625 /* Search the first node in this BIND_EXPR. */ 628 TB_first_in_bind (tree node) argument 632 if (node == NULL_TREE) 635 while ((t = TB_prev_expr (node))) 636 node 644 TB_last_in_bind(tree node) argument 660 TB_up_expr(tree node) argument 673 TB_prev_expr(tree node) argument 690 TB_next_expr(tree node) argument 702 TB_current_chain_node(tree node) argument 731 tree node; local 758 const_tree const node = (const_tree)p2; local 778 TB_update_up(tree node) argument [all...] |
H A D | ipa-utils.c | 81 unnecessary if C had nested functions. V is the node to start 91 /* mark node as old */ 163 struct cgraph_node *node; 174 for (node = cgraph_nodes; node; node = node->next) 176 enum availability avail = cgraph_function_body_availability (node); 183 struct ipa_dfs_info *info = (struct ipa_dfs_info *) node->aux; 189 node 162 struct cgraph_node *node; local [all...] |
H A D | lists.c | 69 /* Find corresponding to ELEM node in the list pointed to by LISTP. 70 This node must exist in the list. Returns pointer to that node. */ 79 /* Remove the node pointed to by LISTP from the list. */ 83 rtx node; local 85 node = *listp; 86 *listp = XEXP (node, 1); 87 XEXP (node, 1) = 0; 90 /* Removes corresponding to ELEM node from the list pointed to by LISTP. 91 Returns that node 95 rtx node; local 196 rtx node = *listp; local 209 rtx node = *listp; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/libiberty/ |
H A D | splay-tree.c | 53 splay_tree_delete_helper (splay_tree sp, splay_tree_node node) argument 58 if (!node) 64 KDEL (node->key); 65 VDEL (node->value); 68 node->key = (splay_tree_key)pending; 69 pending = (splay_tree_node)node; 83 /* active points to a node which has its key and value 201 /* Call FN, passing it the DATA, for every node below NODE, all of 207 splay_tree_foreach_helper (splay_tree sp, splay_tree_node node, argument 212 if (!node) 356 splay_tree_node node; local 477 splay_tree_node node; local 508 splay_tree_node node; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libiberty/ |
H A D | splay-tree.c | 52 splay_tree_delete_helper (splay_tree sp, splay_tree_node node) argument 57 if (!node) 63 KDEL (node->key); 64 VDEL (node->value); 67 node->key = (splay_tree_key)pending; 68 pending = (splay_tree_node)node; 82 /* active points to a node which has its key and value 200 /* Call FN, passing it the DATA, for every node below NODE, all of 206 splay_tree_foreach_helper (splay_tree sp, splay_tree_node node, argument 211 if (!node) 315 splay_tree_node node; local 436 splay_tree_node node; local 467 splay_tree_node node; local [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libiberty/ |
H A D | splay-tree.c | 52 splay_tree_delete_helper (splay_tree sp, splay_tree_node node) argument 57 if (!node) 63 KDEL (node->key); 64 VDEL (node->value); 67 node->key = (splay_tree_key)pending; 68 pending = (splay_tree_node)node; 82 /* active points to a node which has its key and value 200 /* Call FN, passing it the DATA, for every node below NODE, all of 206 splay_tree_foreach_helper (splay_tree sp, splay_tree_node node, argument 211 if (!node) 315 splay_tree_node node; local 436 splay_tree_node node; local 467 splay_tree_node node; local [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/sparc/include/ |
H A D | promlib.h | 101 /* Device node traversal (OBP v0, v2, v3; but not sun4) */ 105 /* Device node properties */ 153 #define findnode(node,name) prom_findnode(node,name) 155 #define node_has_property(node,prop) prom_node_has_property(node,prop) 199 #define prom_firstchild(node) ((*promops.po_firstchild)(node)) 200 #define prom_nextsibling(node) ((*promops.po_nextsibling)(node)) [all...] |
/netbsd-6-1-5-RELEASE/lib/libc/gen/ |
H A D | sysctl.c | 125 * the nodes under the "user" node 265 const struct sysctlnode *node; local 278 node = newp; 279 if (node == NULL) 281 else if (SYSCTL_VERS(node->sysctl_flags) == SYSCTL_VERS_1 && 303 node = newp; 304 if (node != NULL && 305 (SYSCTL_VERS(node->sysctl_flags) < SYSCTL_VERS_1 || 312 if (node != NULL && 313 node [all...] |
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/ |
H A D | rf_pq.c | 60 rf_RegularONPFunc(RF_DagNode_t *node) argument 62 return (rf_RegularXorFunc(node)); 69 rf_SimpleONPFunc(RF_DagNode_t *node) argument 71 return (rf_SimpleXorFunc(node)); 75 rf_RecoveryPFunc(RF_DagNode_t *node) argument 77 return (rf_RecoveryXorFunc(node)); 81 rf_RegularPFunc(RF_DagNode_t *node) argument 83 return (rf_RegularXorFunc(node)); 241 rf_RegularONQFunc(RF_DagNode_t *node) argument 243 int np = node 305 rf_SimpleONQFunc(RF_DagNode_t *node) argument 354 RegularQSubr(RF_DagNode_t *node, char *qbuf) argument 396 DegrQSubr(RF_DagNode_t *node) argument 457 rf_RegularPQFunc(RF_DagNode_t *node) argument 464 rf_RegularQFunc(RF_DagNode_t *node) argument 492 rf_Degraded_100_PQFunc(RF_DagNode_t *node) argument 534 rf_RecoveryQFunc(RF_DagNode_t *node) argument 573 rf_RecoveryPQFunc(RF_DagNode_t *node) argument 593 rf_PQ_DegradedWriteQFunc(RF_DagNode_t *node) argument [all...] |
H A D | rf_pqdegdags.c | 82 * Each R node is a successor of the L node 83 * One successor arc from each R node goes to U, and the other to X 87 * X = pq recovery node, T = terminate 93 * Note: The target buffer for the XOR node is set to the actual user buffer where the 98 * Every buffer read is passed to the pq recovery node, whose job it is to sort out whats 101 /* init a disk node with 2 successors and one predecessor */ 102 #define INIT_DISK_NODE(node,name) \ 103 rf_InitNode(node, rf_wait, RF_FALSE, rf_DiskReadFunc, rf_DiskReadUndoFunc, rf_GenericWakeupFunc, 2,1,4,0, dag_h, name, allocList); \ 104 (node) 186 rf_PQDoubleRecoveryFunc(RF_DagNode_t *node) argument 274 rf_PQWriteDoubleRecoveryFunc(RF_DagNode_t *node) argument [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/powerpc/pci/ |
H A D | pci_machdep_ofw.c | 70 genofw_find_picnode(int node) argument 75 if (node == picnodes[i].node) 83 int node, iparent, child, iranges[6], irgot=0, i; local 87 for (node = startnode; node; node = OF_peer(node)) { 88 if ((child = OF_child(node)) != 0) 91 if (OF_getprop(node, "nam 194 int node; local 348 int node, sz, p=0; local 465 int node; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | asmgoto-1.c | 18 void *__kmalloc_node (size_t size, gfp_t flags, int node); 29 int node) 58 kmalloc_node (size_t size, gfp_t flags, int node) argument 68 ret, size, s->size, flags, node); 70 return __kmalloc_node (size, flags, node); 77 int node = cpu_to_node (cpu); local 84 node); 27 trace_kmalloc_node(unsigned long call_site, const void *ptr, size_t bytes_req, size_t bytes_alloc, gfp_t gfp_flags, int node) argument
|
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/daemons/clvmd/ |
H A D | refresh_clvmd.c | 40 char node[255]; member in struct:lvm_response 146 /* Only return an error here if there are no node-specific 158 /* Build the structure header and parse-out wildcard node names */ 159 static void _build_header(struct clvm_header *head, int cmd, const char *node, argument 168 if (node) { 170 * Allow a couple of special node names: 172 * "." for the local node only 174 if (strcmp(node, "*") == 0) { 175 head->node[0] = '\0'; 176 } else if (strcmp(node, " 188 _cluster_request(char cmd, const char *node, void *data, int len, lvm_response_t ** response, int *num) argument [all...] |
/netbsd-6-1-5-RELEASE/tests/fs/puffs/h_dtfs/ |
H A D | dtfs.c | 190 PUFFSOP_SET(pops, dtfs, node, lookup); 191 PUFFSOP_SET(pops, dtfs, node, access); 192 PUFFSOP_SET(pops, puffs_genfs, node, getattr); 193 PUFFSOP_SET(pops, dtfs, node, setattr); 194 PUFFSOP_SET(pops, dtfs, node, create); 195 PUFFSOP_SET(pops, dtfs, node, remove); 196 PUFFSOP_SET(pops, dtfs, node, readdir); 197 PUFFSOP_SET(pops, dtfs, node, poll); 198 PUFFSOP_SET(pops, dtfs, node, mmap); 199 PUFFSOP_SET(pops, dtfs, node, mkdi [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/alpha/alpha/ |
H A D | dec_kn8ae.c | 267 int node; local 270 for (node = 0; node <= TLSB_NODE_MAX; ++node) { 271 if ((tlsb_found & (1 << node)) == 0) 273 tldev = TLSB_GET_NODEREG(node, TLDEV); 281 if (TLSB_GET_NODEREG(node, TLBER) & 283 TLSB_PUT_NODEREG(node, TLESR0, 284 TLSB_GET_NODEREG(node, TLESR0)); 285 TLSB_PUT_NODEREG(node, TLESR [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/x509v3/ |
H A D | pcy_tree.c | 74 X509_POLICY_NODE *node, int indent) 77 || !(node->data->flags & POLICY_DATA_FLAG_MAP_MASK)) 82 STACK_OF(ASN1_OBJECT) *pset = node->data->expected_policy_set; 100 X509_POLICY_NODE *node; local 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 117 X509_POLICY_NODE_print(err, node, 2); 118 expected_print(err, plev, node, 2); 119 BIO_printf(err, " Flags: %x\n", node->data->flags); 314 X509_POLICY_NODE *node; local 319 node 73 expected_print(BIO *err, X509_POLICY_LEVEL *lev, X509_POLICY_NODE *node, int indent) argument 374 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 402 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 448 X509_POLICY_NODE *node; local 507 X509_POLICY_NODE *node; local 590 X509_POLICY_NODE *node, *anyptr; local 637 X509_POLICY_NODE *node; local 721 exnode_free(X509_POLICY_NODE *node) argument [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/sparc/sparc/ |
H A D | promlib.c | 183 * prom_getprop() reads the named property data from a given node. 193 prom_getprop(int node, const char *name, size_t size, int *nitem, void *bufp) argument 198 len = prom_getproplen(node, name); 216 _prom_getprop(node, name, buf, len); 228 prom_getpropstring(int node, const char *name) argument 232 return (prom_getpropstringA(node, name, stringbuf, sizeof stringbuf)); 239 prom_getpropstringA(int node, const char *name, char *buf, size_t bufsize) argument 243 if (prom_getprop(node, name, 1, &len, &buf) != 0) 255 prom_getpropint(int node, const char *name, int deflt) argument 260 if (prom_getprop(node, nam 270 prom_matchname(int node, const char *name) argument 319 int node; local 334 int node; local 347 prom_node_has_property(int node, const char *prop) argument 358 prom_search(int node, const char *name) argument 384 int node; local 449 int node = prom_getoptionsnode(); local 753 int node; local 786 int node = findchosen(); local 799 int node = findchosen(); local 812 int node = findchosen(); local 823 opf_nextprop(int node, const char *prop) argument 845 int node, n; local 945 int node, len; local 993 prom_getether(int node, u_char *cp) argument 1006 prom_get_node_ether(int node, u_char *cp) argument 1235 int node; local 1287 int node; local [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/ntp/dist/ntpd/ |
H A D | ntp_data_structures.c | 43 node *temp = NULL; 64 node *new_node = emalloc(sizeof(*new_node) + size); 69 /* Define a function to free the allocated memory for a queue node */ 72 node *old_node = my_node; 82 node *pn; 119 node *new_node = ((node *) my_node) - 1; 120 node *i = NULL; 121 node *j = my_queue->front; 148 node *my_nod [all...] |
/netbsd-6-1-5-RELEASE/sys/dev/sbus/ |
H A D | lebuffer.c | 81 int node; local 103 node = sc->sc_node = sa->sa_node; 112 sc->sc_burst = prom_getpropint(node, "burst-sizes", -1); 123 for (node = firstchild(node); node; node = nextsibling(node)) { 126 bt, dt, node, &sax);
|
/netbsd-6-1-5-RELEASE/dist/ipf/lib/ |
H A D | load_hashnode.c | 20 int load_hashnode(unit, name, node, iocfunc) 23 iphtent_t *node; 43 bcopy((char *)&node->ipe_addr, (char *)&ipe.ipe_addr, 45 bcopy((char *)&node->ipe_mask, (char *)&ipe.ipe_mask, 47 bcopy((char *)&node->ipe_group, (char *)&ipe.ipe_group,
|
H A D | printhash_live.c | 23 iphtent_t entry, *top, *node; local 66 node = top; 67 (void) printhashnode(hp, node, bcopywrap, opts); 68 top = node->ipe_next; 69 free(node);
|
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/util/ |
H A D | prepinfo.awk | 3 # prepinfo.awk --- fix node lines and menus 75 $1 == "@node" \ 100 # skip fake nodes --- titles without associated @node lines 116 printf("%s line with no @node or fakenode line\n", 186 Node[node ".mendesc"] = desc 187 Node[node ".longdesc"] = longdesc 190 node, Node[node ".mendesc"]) > "/dev/stderr" 192 node, Node[node " [all...] |