/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/include/vms/ |
H A D | dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/include/vms/ |
H A D | dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/x509v3/ |
H A D | pcy_node.c | 76 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, 86 idx = sk_X509_POLICY_NODE_find(nodes, &l); 90 return sk_X509_POLICY_NODE_value(nodes, idx); 100 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) 102 node = sk_X509_POLICY_NODE_value(level->nodes, i); 135 if (!level->nodes) 136 level->nodes = policy_node_cmp_new(); 137 if (!level->nodes) 139 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
|
H A D | pcy_lib.c | 115 if (level->nodes) 116 n += sk_X509_POLICY_NODE_num(level->nodes); 130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
H A D | pcy_tree.c | 114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 316 /* Iterate through all in nodes linking matches */ 317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) 319 node = sk_X509_POLICY_NODE_value(last->nodes, i); 362 /* Look for matching nodes in previous level */ 426 /* Locate unmatched nodes */ 451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) 453 node = sk_X509_POLICY_NODE_value(last->nodes, i); 461 * nodes [all...] |
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/daemons/clvmd/ |
H A D | clvmd-cman.c | 63 static struct cman_node *nodes = NULL; variable in typeref:struct:cman_node 65 static int count_nodes; /* size of allocated nodes array */ 143 /* return number of ACTIVE nodes */ 145 if (nodes[i].cn_member && nodes[i].cn_nodeid) 185 if (nodes[i].cn_member && nodes[i].cn_nodeid) { 186 int up = (int)(long)dm_hash_lookup_binary(node_updown_hash, (char *)&nodes[i].cn_nodeid, sizeof(int)); 188 callback(client, (char *)&nodes[i].cn_nodeid, up); 296 int nodeid = nodes[ [all...] |
/netbsd-6-1-5-RELEASE/bin/sh/ |
H A D | Makefile | 12 GENSRCS=arith.c arith_lex.c builtins.c init.c nodes.c 13 GENHDRS=arith.h builtins.h nodes.h token.h 70 .ORDER: nodes.h nodes.c 71 nodes.c nodes.h: mknodes.sh nodetypes nodes.c.pat 74 [ -f nodes.h ]
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | ddg.c | 351 /* Given two nodes, analyze their RTL insns and add inter-loop mem deps 387 /* Perform intra-block Data Dependency analysis and connect the nodes in 409 ddg_node_ptr dest_node = &g->nodes[i]; 434 ddg_node_ptr j_node = &g->nodes[j]; 497 /* Allocate the nodes array, and initialize the nodes. */ 499 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); 516 g->closing_branch = &g->nodes[i]; 525 g->nodes[i].cuid = i; 526 g->nodes[ 746 create_scc(ddg_ptr g, sbitmap nodes) argument 1069 update_dist_to_successors(ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) argument 1095 longest_simple_path(struct ddg * g, int src, int dest, sbitmap nodes) argument [all...] |
H A D | tree-dump.h | 69 /* The first node in the queue of nodes to be written out. */ 73 /* Free queue nodes. */ 75 /* The tree nodes which we have already written out. The 76 keys are the addresses of the nodes; the values are the integer 78 splay_tree nodes; member in struct:dump_info
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | pr42640.c | 15 struct S nodes[8]; variable in typeref:struct:S 16 struct S *rr_node = nodes;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | ddg.c | 271 if (df_reg_used (df, g->nodes[i].insn, rd->reg)) 304 if (df_find_def (df, g->nodes[i].insn, use->reg)) 344 /* Given two nodes, analyze their RTL insns and add inter-loop mem deps 369 /* Perform intra-block Data Dependency analysis and connect the nodes in 391 ddg_node_ptr dest_node = &g->nodes[i]; 417 ddg_node_ptr j_node = &g->nodes[j]; 470 /* Allocate the nodes array, and initialize the nodes. */ 472 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); 489 g->closing_branch = &g->nodes[ 692 create_scc(ddg_ptr g, sbitmap nodes) argument 989 update_dist_to_successors(ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) argument 1015 longest_simple_path(struct ddg * g, int src, int dest, sbitmap nodes) argument [all...] |
H A D | tree-dump.h | 69 /* The first node in the queue of nodes to be written out. */ 73 /* Free queue nodes. */ 75 /* The tree nodes which we have already written out. The 76 keys are the addresses of the nodes; the values are the integer 78 splay_tree nodes; member in struct:dump_info
|
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/ |
H A D | rf_dagffwr.c | 62 * through the graph, blindly executing nodes until it reaches the end. 140 * All nodes are before the commit node (Cmt) are assumed to be atomic and 195 /* alloc the nodes: Wnd, xor, commit, block, term, and Wnp */ 200 tmpNode->list_next = dag_h->nodes; 201 dag_h->nodes = tmpNode; 203 wndNodes = dag_h->nodes; 206 xorNode->list_next = dag_h->nodes; 207 dag_h->nodes = xorNode; 210 wnpNode->list_next = dag_h->nodes; 211 dag_h->nodes [all...] |
H A D | rf_dagffrd.c | 60 * through the graph, blindly executing nodes until it reaches the end. 108 * There is one disk node per stripe unit accessed, and all disk nodes are in 112 * normally. Subsequent disk nodes are created by copying the first one, 117 * in ONLY ONE of the read nodes. This does not apply to the "params" field 186 tmpNode->list_next = dag_h->nodes; 187 dag_h->nodes = tmpNode; 189 diskNodes = dag_h->nodes; 192 blockNode->list_next = dag_h->nodes; 193 dag_h->nodes = blockNode; 196 commitNode->list_next = dag_h->nodes; [all...] |
H A D | rf_dagdegrd.c | 62 * through the graph, blindly executing nodes until it reaches the end. 136 /* alloc the Wnd nodes and the Wmir node */ 142 /* total number of nodes = 1 + (block + commit + terminator) */ 145 rdNode->list_next = dag_h->nodes; 146 dag_h->nodes = rdNode; 149 blockNode->list_next = dag_h->nodes; 150 dag_h->nodes = blockNode; 153 commitNode->list_next = dag_h->nodes; 154 dag_h->nodes = commitNode; 157 termNode->list_next = dag_h->nodes; 582 RF_DagNode_t *nodes, *rdNode, *blockNode, *commitNode, *termNode; local 1042 RF_DagNode_t *nodes, *rudNodes, *rrdNodes, *recoveryNode, *blockNode, local [all...] |
H A D | rf_parityscan.c | 407 * nNodes nodes at level 2, an unblock-recon node at level 3, and a 409 * and unblock nodes are not touched, nor are the pda fields in the 410 * second-level nodes, so they must be filled in later. 425 RF_DagNode_t *nodes, *termNode, *blockNode, *unblockNode, *tmpNode; local 442 /* create the nodes, the block & unblock nodes, and the terminator 447 tmpNode->list_next = dag_h->nodes; 448 dag_h->nodes = tmpNode; 450 nodes = dag_h->nodes; [all...] |
/netbsd-6-1-5-RELEASE/external/gpl2/lvm2/dist/libdm/regex/ |
H A D | matcher.c | 38 struct rx_node **nodes; member in struct:dm_regex 67 m->nodes[m->nodes_entered++] = rx; 75 struct rx_node *n = m->nodes[i]; 88 rx = m->nodes[i]; 150 struct rx_node *n = m->nodes[j]; 161 struct rx_node *n = m->nodes[j]; 228 if (dm_bit(m->nodes[i]->charset, a)) { 230 dfa->final = m->nodes[i]->final; 233 m->nodes[i]->followpos); 312 m->nodes [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/libsaslc/dist/src/ |
H A D | mech.c | 121 LIST_INSERT_HEAD(head, node, nodes); 142 LIST_FOREACH(node, list, nodes) { 160 LIST_REMOVE(node, nodes);
|
H A D | dict.c | 56 LIST_ENTRY(saslc__dict_node_t) nodes; 141 LIST_REMOVE(node, nodes); 157 LIST_FOREACH(node, dict, nodes) { 306 LIST_INSERT_HEAD(dict, node, nodes);
|
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/lib/ |
H A D | regex_internal.c | 25 const re_node_set *nodes, 28 const re_node_set *nodes, 1320 /* Add the token TOKEN to dfa->nodes, and return the index of the token. 1334 re_token_t *new_nodes = re_x2realloc (dfa->nodes, re_token_t, 1338 dfa->nodes = new_nodes; 1352 dfa->nodes[dfa->nodes_len] = token; 1353 dfa->nodes[dfa->nodes_len].constraint = 0; 1355 dfa->nodes[dfa->nodes_len].accept_mb = 1366 calc_state_hash (const re_node_set *nodes, unsigned int context) 1368 re_hashval_t hash = nodes 1363 calc_state_hash(const re_node_set *nodes, unsigned int context) argument 1383 re_acquire_state(reg_errcode_t *err, re_dfa_t *dfa, const re_node_set *nodes) argument 1433 re_acquire_state_context(reg_errcode_t *err, re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument 1518 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, re_hashval_t hash) argument 1568 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, re_hashval_t hash) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/include/ |
H A D | fibheap.h | 54 size_t nodes; member in struct:fibheap
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/include/ |
H A D | fibheap.h | 54 size_t nodes; member in struct:fibheap
|
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/info/ |
H A D | gc.c | 26 /* Array of pointers to the contents of gc-able nodes. A pointer on this 62 NODE *node = iw->nodes[j];
|
/netbsd-6-1-5-RELEASE/gnu/usr.bin/texinfo/info/ |
H A D | Makefile | 8 infomap.c m-x.c man.c nodemenu.c nodes.c search.c session.c \
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|