/freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
H A D | SpillPlacement.cpp | 72 /// value can change when linked nodes change, but convergence is very fast 97 // Undecided nodes (Value==0) go on the stack. 151 bool update(const Node nodes[]) { argument 156 if (nodes[I->second].Value == -1) 158 else if (nodes[I->second].Value == 1) 186 assert(!nodes && "Leaking node array"); 187 nodes = new Node[bundles->getNumBundles()]; 202 delete[] nodes; 203 nodes = 0; 211 nodes[ [all...] |
H A D | SpillPlacement.h | 47 Node *nodes; member in class:llvm::SpillPlacement 66 SpillPlacement() : MachineFunctionPass(ID), nodes(0) {} 121 /// Return true is there are any positive nodes.
|
/freebsd-10-stable/crypto/openssl/crypto/x509v3/ |
H A D | pcy_node.c | 77 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, 87 idx = sk_X509_POLICY_NODE_find(nodes, &l); 91 return sk_X509_POLICY_NODE_value(nodes, idx); 101 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { 102 node = sk_X509_POLICY_NODE_value(level->nodes, i); 130 if (!level->nodes) 131 level->nodes = policy_node_cmp_new(); 132 if (!level->nodes) 134 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
|
H A D | pcy_lib.c | 117 if (level->nodes) 118 n += sk_X509_POLICY_NODE_num(level->nodes); 131 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
H A D | pcy_tree.c | 115 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 312 /* Iterate through all in nodes linking matches */ 313 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { 314 node = sk_X509_POLICY_NODE_value(last->nodes, i); 354 /* Look for matching nodes in previous level */ 413 /* Locate unmatched nodes */ 439 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { 440 node = sk_X509_POLICY_NODE_value(last->nodes, i); 448 * Skip any node with any children: we only want unmathced nodes [all...] |
/freebsd-10-stable/contrib/ipfilter/ |
H A D | radix_ipf.c | 31 ipf_rdx_node_t nodes[2], int *)); 90 /* nodes(O) - pair of ipf_rdx_node_t's to initialise with data */ 93 /* Initialise the fields in a pair of radix tree nodes according to the */ 99 buildnodes(addr, mask, nodes) 101 ipf_rdx_node_t nodes[2]; 120 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); 121 nodes[0].maskbitcount = maskbits; 122 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); 123 nodes[0].addrkey = (u_32_t *)addr; 124 nodes[ 946 struct ipf_rdx_node nodes[2]; member in struct:myst [all...] |
/freebsd-10-stable/sys/contrib/ipfilter/netinet/ |
H A D | radix_ipf.c | 31 ipf_rdx_node_t nodes[2], int *)); 90 /* nodes(O) - pair of ipf_rdx_node_t's to initialise with data */ 93 /* Initialise the fields in a pair of radix tree nodes according to the */ 99 buildnodes(addr, mask, nodes) 101 ipf_rdx_node_t nodes[2]; 118 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); 119 nodes[0].maskbitcount = maskbits; 120 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); 121 nodes[0].addrkey = (u_32_t *)addr; 122 nodes[ 944 struct ipf_rdx_node nodes[2]; member in struct:myst [all...] |
/freebsd-10-stable/bin/sh/ |
H A D | Makefile | 13 GENSRCS= builtins.c nodes.c syntax.c 14 GENHDRS= builtins.h nodes.h syntax.h token.h 53 .ORDER: nodes.c nodes.h 54 nodes.c nodes.h: mknodes nodetypes nodes.c.pat 55 ./mknodes ${.CURDIR}/nodetypes ${.CURDIR}/nodes.c.pat
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_fs_base/bdb/ |
H A D | nodes-table.c | 0 /* nodes-table.c : working with the `nodes' table 40 #include "nodes-table.h" 47 /* Opening/creating the `nodes' table. */ 56 DB *nodes; 59 BDB_ERR(db_create(&nodes, env, 0)); 60 BDB_ERR((nodes->open)(SVN_BDB_OPEN_PARAMS(nodes, NULL), 61 "nodes", 0, DB_BTREE, 70 BDB_ERR(nodes 55 DB *nodes; local [all...] |
/freebsd-10-stable/contrib/ipfilter/lib/ |
H A D | load_dstlist.c | 17 load_dstlist(dst, iocfunc, nodes) 20 ipf_dstnode_t *nodes; 54 printdstlist(&dest, bcopywrap, dest.ipld_name, opts, nodes, NULL); 58 for (a = nodes; a != NULL; a = a->ipfd_next)
|
H A D | printdstlist.c | 11 printdstlist(pp, copyfunc, name, opts, nodes, fields) 16 ipf_dstnode_t *nodes; 36 if (nodes == NULL) { 39 for (node = nodes; node != NULL; ) {
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc-queries.sql | 34 FROM nodes 39 SELECT op_depth, nodes.repos_id, nodes.repos_path, presence, kind, revision, 47 FROM nodes 48 LEFT OUTER JOIN lock ON nodes.repos_id = lock.repos_id 49 AND nodes.repos_path = lock.repos_relpath 57 FROM nodes 61 SELECT nodes.repos_id, nodes.repos_path, presence, kind, revision, 68 FROM nodes [all...] |
H A D | wc-checks.sql | 37 CREATE TEMPORARY TRIGGER validation_01 BEFORE INSERT ON nodes 46 CREATE TEMPORARY TRIGGER validation_02 BEFORE INSERT ON nodes 54 CREATE TEMPORARY TRIGGER validation_03 BEFORE INSERT ON nodes 58 (EXISTS (SELECT 1 FROM nodes 71 OR EXISTS (SELECT 1 FROM nodes 80 FROM nodes n WHERE local_relpath != '' 95 /* All ACTUAL nodes must have an equivalent NODE in NODES 99 AND NOT EXISTS(SELECT 1 from nodes i 102 AND NOT EXISTS(SELECT 1 from nodes i 111 LEFT JOIN nodes [all...] |
/freebsd-10-stable/contrib/gcc/ |
H A D | ddg.c | 271 if (df_find_use (df, g->nodes[i].insn, rd->reg)) 304 if (df_find_def (df, g->nodes[i].insn, use->reg)) 347 /* Given two nodes, analyze their RTL insns and add inter-loop mem deps 372 /* Perform intra-block Data Dependency analysis and connect the nodes in 394 ddg_node_ptr dest_node = &g->nodes[i]; 419 ddg_node_ptr j_node = &g->nodes[j]; 472 /* Allocate the nodes array, and initialize the nodes. */ 474 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); 491 g->closing_branch = &g->nodes[ 694 create_scc(ddg_ptr g, sbitmap nodes) argument 991 update_dist_to_successors(ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) argument 1017 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
|
/freebsd-10-stable/contrib/ofed/librdmacm/examples/ |
H A D | mckey.c | 66 struct cmatest_node *nodes; member in struct:cmatest 381 test.nodes = malloc(sizeof *test.nodes * connections); 382 if (!test.nodes) { 383 printf("mckey: unable to allocate memory for test nodes\n"); 386 memset(test.nodes, 0, sizeof *test.nodes * connections); 389 test.nodes[i].id = i; 390 ret = rdma_create_id(test.channel, &test.nodes[i].cma_id, 391 &test.nodes[ [all...] |
H A D | cmatose.c | 73 struct cmatest_node *nodes; member in struct:cmatest 282 node = &test.nodes[test.conn_index++]; 384 test.nodes = malloc(sizeof *test.nodes * connections); 385 if (!test.nodes) { 386 printf("cmatose: unable to allocate memory for test nodes\n"); 389 memset(test.nodes, 0, sizeof *test.nodes * connections); 392 test.nodes[i].id = i; 395 &test.nodes[ [all...] |
H A D | udaddy.c | 63 struct cmatest_node *nodes; member in struct:cmatest 298 node = &test.nodes[test.conn_index++]; 420 test.nodes = malloc(sizeof *test.nodes * connections); 421 if (!test.nodes) { 422 printf("udaddy: unable to allocate memory for test nodes\n"); 425 memset(test.nodes, 0, sizeof *test.nodes * connections); 428 test.nodes[i].id = i; 431 &test.nodes[ [all...] |
/freebsd-10-stable/contrib/libyaml/tests/ |
H A D | run-dumper.c | 27 for (node = document_from->nodes.start; 28 node < document_from->nodes.top; node ++) { 49 for (node = document_from->nodes.start; 50 node < document_from->nodes.top; node ++) { 56 node - document_from->nodes.start + 1, 64 node - document_from->nodes.start + 1, 150 if ((document1->nodes.top - document1->nodes.start) != 151 (document2->nodes.top - document2->nodes [all...] |
/freebsd-10-stable/contrib/libyaml/src/ |
H A D | loader.c | 75 if (!STACK_INIT(parser, document->nodes, INITIAL_STACK_SIZE)) 235 data.mark = parser->document->nodes.start[index-1].start_mark; 299 if (!PUSH(parser, parser->document->nodes, node)) goto error; 301 index = parser->document->nodes.top - parser->document->nodes.start; 344 if (!PUSH(parser, parser->document->nodes, node)) goto error; 346 index = parser->document->nodes.top - parser->document->nodes.start; 357 parser->document->nodes.start[index-1].data.sequence.items, 362 parser->document->nodes [all...] |
H A D | dumper.c | 126 if (STACK_EMPTY(emitter, document->nodes)) { 135 * (document->nodes.top - document->nodes.start)); 138 * (document->nodes.top - document->nodes.start)); 177 for (index = 0; emitter->document->nodes.start + index 178 < emitter->document->nodes.top; index ++) { 179 yaml_node_t node = emitter->document->nodes.start[index]; 194 STACK_DEL(emitter, emitter->document->nodes); 209 yaml_node_t *node = emitter->document->nodes [all...] |
H A D | api.c | 1043 } nodes = { NULL, NULL, NULL }; local 1058 if (!STACK_INIT(&context, nodes, INITIAL_STACK_SIZE)) goto error; 1091 DOCUMENT_INIT(*document, nodes.start, nodes.end, version_directive_copy, 1098 STACK_DEL(&context, nodes); 1128 while (!STACK_EMPTY(&context, document->nodes)) { 1129 yaml_node_t node = POP(&context, document->nodes); 1145 STACK_DEL(&context, document->nodes); 1168 if (index > 0 && document->nodes.start + index <= document->nodes [all...] |
/freebsd-10-stable/contrib/libgnuregex/ |
H A D | regex_internal.c | 25 const re_node_set *nodes, 28 const re_node_set *nodes, 1407 /* Add the token TOKEN to dfa->nodes, and return the index of the token. 1429 new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc); 1432 dfa->nodes = new_nodes; 1446 dfa->nodes[dfa->nodes_len] = token; 1447 dfa->nodes[dfa->nodes_len].constraint = 0; 1449 dfa->nodes[dfa->nodes_len].accept_mb = 1460 calc_state_hash (const re_node_set *nodes, unsigned int context) 1462 unsigned int hash = nodes 1457 calc_state_hash(const re_node_set *nodes, unsigned int context) argument 1477 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument 1521 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument 1613 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument 1663 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument [all...] |
/freebsd-10-stable/contrib/binutils/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|
/freebsd-10-stable/contrib/gcclibs/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|