/freebsd-10-stable/contrib/gdb/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|
/freebsd-10-stable/contrib/texinfo/info/ |
H A D | gc.c | 24 /* Array of pointers to the contents of gc-able nodes. A pointer on this 60 NODE *node = iw->nodes[j];
|
H A D | info.h | 95 /* A structure associating the nodes visited in a particular window. */ 98 NODE **nodes; /* Array of nodes visited in this window. */ 106 /* Array of structures describing for each window which nodes have been 97 NODE **nodes; /* Array of nodes visited in this window. */ member in struct:__anon4673
|
/freebsd-10-stable/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 \
|
/freebsd-10-stable/contrib/gcc/ |
H A D | ddg.h | 85 /* The source and destination nodes of the dependency edge. */ 126 /* This array holds the nodes in the graph; it is indexed by the node 128 ddg_node_ptr nodes; member in struct:ddg 148 /* A bitmap that represents the nodes of the DDG that are in the SCC. */ member in struct:ddg_scc 149 sbitmap nodes;
|
H A D | modulo-sched.c | 106 /* The number of different iterations the nodes in ps span, assuming 125 /* The number of nodes in the same row that come after this node. */ 224 /* The column of a node inside the ps. If nodes u, v are on the same row, 370 node_sched_params[i].asap = g->nodes[i].aux.count; 371 g->nodes[i].aux.info = &node_sched_params[i]; 412 ddg_node_ptr u = &g->nodes[i]; 445 ddg_node_ptr u = &g->nodes[i]; 476 Set a bitmap vector, telling which nodes use each copy of this 520 rep->insn = g->nodes[i_use].insn; 532 replace_rtx (g->nodes[i_us 1817 find_max_asap(ddg_ptr g, sbitmap nodes) argument 1838 find_max_hv_min_mob(ddg_ptr g, sbitmap nodes) argument 1867 find_max_dv_min_mob(ddg_ptr g, sbitmap nodes) argument [all...] |
H A D | cgraphunit.c | 79 This function is responsible for lowering tree nodes not understood by 81 callgraph and varpool nodes referenced by the as needed. 180 /* Records tree nodes seen in record_reference. Simply using 507 /* Since we reclaim unreachable nodes at the end of every language 703 /* Verify cgraph nodes of given cgraph node. */ 786 /* The nodes we're interested in are never shared, so walk 987 /* Look for externally_visible and used attributes and mark cgraph nodes 990 We cannot mark the nodes at the point the attributes are processed (in 1001 Furthermore, we can't mark these nodes in cgraph_finalize_function because: 1008 So, we walk the nodes a 1367 struct cgraph_order_sort *nodes; local [all...] |
/freebsd-10-stable/usr.sbin/bluetooth/hccontrol/ |
H A D | hccontrol.c | 104 struct nodeinfo *nodes; local 106 num = find_hci_nodes(&nodes); 108 errx(7, "Could not find HCI nodes"); 111 node = strdup(nodes[0].name); 116 free(nodes); 270 /* Find all HCI nodes */ 272 find_hci_nodes(struct nodeinfo** nodes) argument 296 err(11, "Could not get list of HCI nodes"); 300 *nodes = r.names;
|
/freebsd-10-stable/contrib/texinfo/util/ |
H A D | install-info.c | 86 /* This is used for a list of nodes found by parsing the dir file. */ 996 nodes, and their menus, and the sections of their menus. */ 998 parse_dir_file (struct line_data *lines, int nlines, struct node **nodes, 1005 *nodes = 0; 1026 (*nodes)->name = copy_string (line + j, end - j); 1036 next->next = *nodes; 1044 if (*nodes != 0) 1045 (*nodes)->end_line = i; 1048 if (*nodes != 0 && (*nodes) 985 parse_dir_file(struct line_data *lines, int nlines, struct node **nodes, const char *base_name) argument [all...] |
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 94 NodeVector nodes; member in class:PBQP::Graph 104 NodeEntry& getNode(NodeId nId) { return nodes[nId]; } 105 const NodeEntry& getNode(NodeId nId) const { return nodes[nId]; } 115 nodes[nodeId] = n; 117 nodeId = nodes.size(); 118 nodes.push_back(n); 158 : nodeId(nodeId), endNodeId(g.nodes.size()), freeNodes(g.freeNodes) { 217 /// \brief Add an edge between the given nodes with the given costs. 228 /// \brief Get the number of nodes in the graph. 229 /// @return Number of nodes i [all...] |
/freebsd-10-stable/crypto/openssl/util/ |
H A D | mkcerts.sh | 23 -out pca-req.pem -nodes >/dev/null <<EOF 59 -out ca-req.pem -nodes >/dev/null <<EOF 96 -out s512-req.pem -nodes >/dev/null <<EOF 133 -out s1024req.pem -nodes >/dev/null <<EOF 170 -out c512-req.pem -nodes >/dev/null <<EOF
|
/freebsd-10-stable/contrib/libgnuregex/ |
H A D | regexec.c | 148 const re_node_set *nodes) 158 static int find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, 676 if (dfa->init_state->nodes.nelem == 0 677 && dfa->init_state_word->nodes.nelem == 0 678 && (dfa->init_state_nl->nodes.nelem == 0 1127 err = check_subexp_matching_top (mctx, &cur_state->nodes, 0); 1133 err = transit_state_bkref (mctx, &cur_state->nodes); 1232 re_token_type_t type = dfa->nodes[node].type; 1233 unsigned int constraint = dfa->nodes[node].constraint; 1258 for (i = 0; i < state->nodes 2586 transit_state_bkref(re_match_context_t *mctx, const re_node_set *nodes) argument 2783 const re_node_set *nodes; local 2878 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, int subexp_idx, int type) argument [all...] |
/freebsd-10-stable/sbin/routed/ |
H A D | radix.h | 113 struct radix_node_head *head, struct radix_node nodes[]); 116 struct radix_node_head *head, struct radix_node nodes[]);
|
/freebsd-10-stable/crypto/openssl/apps/ |
H A D | CA.pl | 8 # CA -newreq[-nodes] ... will generate a certificate request 67 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n"; 79 } elsif (/^-newreq-nodes$/) { 81 system ("$REQ -new -nodes -keyout newkey.pem -out newreq.pem $DAYS"); 167 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n";
|
H A D | CA.sh | 58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2 96 -newreq-nodes) 98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc-metadata.sql | 239 /* The NODES table describes the way WORKING nodes are layered on top of 240 BASE nodes and on top of other WORKING nodes, due to nested tree structure 256 This table contains full node descriptions for nodes in either the BASE 290 modifying the working copy tree structure. All nodes below the root 324 tree. The 'BASE' represents pristine nodes that are in the 329 layer of working nodes. The 'WORKING' tree is obtained and 380 copied). This is set on all the nodes in the moved tree. The source of 484 /* Many queries have to filter the nodes table to pick only that version 494 SELECT * FROM nodes A [all...] |
/freebsd-10-stable/contrib/binutils/libiberty/ |
H A D | fibheap.c | 118 heap->nodes++; 161 /* Merge them to the next nodes on the opposite chain. */ 167 heapa->nodes += heapb->nodes; 184 /* If we don't have a min set, it means we have no nodes. */ 279 return heap->nodes == 0; 302 heap->nodes--; 304 /* If we are left with no nodes, then the min is NULL. */ 305 if (heap->nodes == 0)
|
/freebsd-10-stable/contrib/gcclibs/libiberty/ |
H A D | fibheap.c | 118 heap->nodes++; 161 /* Merge them to the next nodes on the opposite chain. */ 167 heapa->nodes += heapb->nodes; 184 /* If we don't have a min set, it means we have no nodes. */ 279 return heap->nodes == 0; 302 heap->nodes--; 304 /* If we are left with no nodes, then the min is NULL. */ 305 if (heap->nodes == 0)
|
/freebsd-10-stable/sys/net/ |
H A D | radix.h | 114 struct radix_node_head *head, struct radix_node nodes[]); 117 struct radix_node_head *head, struct radix_node nodes[]);
|
/freebsd-10-stable/contrib/ipfilter/ |
H A D | radix_ipf.h | 60 ipf_rdx_node_t nodes[3]; member in struct:ipf_rdx_head
|
/freebsd-10-stable/sys/contrib/ipfilter/netinet/ |
H A D | radix_ipf.h | 58 ipf_rdx_node_t nodes[3]; member in struct:ipf_rdx_head
|
/freebsd-10-stable/sys/mips/nlm/ |
H A D | board.h | 135 } nodes[XLP_MAX_NODES]; member in struct:xlp_board_info
|
/freebsd-10-stable/crypto/openssl/crypto/x509v3/ |
H A D | pcy_int.h | 138 /* This structure represents the relationship between nodes */ 145 /* Number of child nodes */ 152 /* nodes at this level */ 153 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st 168 * Extra policy data when additional nodes (not from the certificate) are
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_fs_base/ |
H A D | fs.h | 102 DB *nodes; 99 DB *nodes; member in struct:base_fs_data_t
|
/freebsd-10-stable/usr.bin/make/ |
H A D | targ.c | 45 * Functions for maintaining the Lst allTargets. Target nodes are 60 * Targ_FindList Given a list of names, find nodes for all of them. If a 199 * A complete list of graph nodes corresponding to all instances of all 203 * If flags is TARG_CREATE, nodes will be created for all names in 204 * names which do not yet have graph nodes. If flags is TARG_NOCREATE, 208 Targ_FindList(Lst *nodes, Lst *names, int flags) argument 220 * the nodes are added to the list in the order in which 223 Lst_AtEnd(nodes, gn); 225 Lst_Concat(nodes, &gn->cohorts, LST_CONCNEW);
|