HomeSort by: relevance | last modified time | path
    Searched defs:nodes (Results 1 - 25 of 127) sorted by relevancy

1 2 3 4 5 6

  /src/external/mpl/bind/dist/doc/arm/_ext/
namedconf.py 19 from docutils import nodes namespace
25 class ToBeReplacedStatementList(nodes.General, nodes.Element):
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
GraphTraits.h 54 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
70 // Return total number of nodes in the graph
105 // Provide iterator ranges for the graph traits nodes and children
108 nodes(const GraphType &G) { function in namespace:llvm
  /src/external/apache2/llvm/dist/llvm/utils/
DSAextract.py 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
37 <output_file> [list of nodes to extract]')
68 #for the node (it will be Node(hex number)) to our set of nodes
98 #check to make sure that both nodes are in the node list
100 nodes = arrowexp.split(buffer) variable
101 nodes[0] = string.strip(nodes[0])
102 nodes[1] = string.strip(nodes[1]
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-streamer.h 28 /* Cache of pickled nodes. Used to avoid writing the same node more
48 /* The mapping between tree nodes and slots into the nodes array. */
51 /* The nodes pickled so far. */
52 vec<tree> nodes; member in struct:streamer_tree_cache_d
96 return cache->nodes[ix];
tree-dump.h 68 /* The first node in the queue of nodes to be written out. */
72 /* Free queue nodes. */
74 /* The tree nodes which we have already written out. The
75 keys are the addresses of the nodes; the values are the integer
77 splay_tree nodes; member in struct:dump_info
  /src/external/mpl/bind/dist/bin/tests/system/
re_compile_checker.py 16 from astroid import nodes namespace
36 def process_module(self, node: nodes.Module) -> None:
  /src/sys/arch/powerpc/booke/dev/
cpunode.c 54 static u_int nodes; variable
63 if (ma->ma_node > 8 || (nodes & (1 << ma->ma_node)))
105 nodes |= 1 << ma->ma_node;
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
ASTTableGen.cpp 52 // Type nodes are all named ending in Type, just like the corresponding
61 // Stmt nodes are named the same as the C++ class, which has no regular
93 // A map from a node to each of its child nodes.
116 // Find all the nodes in the hierarchy.
117 auto nodes = records.getAllDerivedDefinitions(nodeClassName); local
122 for (ASTNode node : nodes) {
127 "multiple root nodes in " + nodeClassName + " hierarchy");
  /src/external/gpl3/binutils/dist/include/vms/
dcx.h 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
  /src/external/gpl3/binutils.old/dist/include/vms/
dcx.h 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
  /src/external/gpl3/gcc/dist/gcc/
tree-streamer.h 28 /* Cache of pickled nodes. Used to avoid writing the same node more
48 /* The mapping between tree nodes and slots into the nodes array. */
51 /* The nodes pickled so far. */
52 vec<tree> nodes; member in struct:streamer_tree_cache_d
96 return cache->nodes[ix];
tree-dump.h 68 /* The first node in the queue of nodes to be written out. */
72 /* Free queue nodes. */
74 /* The tree nodes which we have already written out. The
75 keys are the addresses of the nodes; the values are the integer
77 splay_tree nodes; member in struct:dump_info
  /src/external/gpl3/gdb.old/dist/include/vms/
dcx.h 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
  /src/external/mpl/dhcp/bind/dist/lib/isc/
astack.c 31 uintptr_t nodes[]; member in struct:isc_astack
43 memset(stack->nodes, 0, size * sizeof(uintptr_t));
55 stack->nodes[stack->pos++] = (uintptr_t)obj;
70 rv = stack->nodes[--stack->pos];
  /src/external/gpl3/gdb/dist/include/vms/
dcx.h 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
  /src/external/gpl3/binutils/dist/include/
fibheap.h 53 size_t nodes; member in struct:fibheap
  /src/external/gpl3/binutils.old/dist/include/
fibheap.h 53 size_t nodes; member in struct:fibheap
  /src/external/gpl3/gcc/dist/include/
fibheap.h 53 size_t nodes; member in struct:fibheap
  /src/external/gpl3/gcc.old/dist/include/
fibheap.h 53 size_t nodes; member in struct:fibheap
  /src/external/gpl3/gdb.old/dist/include/
fibheap.h 53 size_t nodes; member in struct:fibheap
  /src/external/gpl3/gdb/dist/include/
fibheap.h 53 size_t nodes; member in struct:fibheap
  /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/core/
mm.h 23 struct list_head nodes; member in struct:nvkm_mm
50 list_for_each_entry(node, &mm->nodes, nl_entry) {
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/core/
nouveau_nvkm_core_mm.c 31 #define node(root, dir) ((root)->nl_entry.dir == &mm->nodes) ? NULL : \
41 list_for_each_entry(node, &mm->nodes, nl_entry) {
251 prev = list_last_entry(&mm->nodes, typeof(*node), nl_entry);
260 list_add_tail(&node->nl_entry, &mm->nodes);
264 INIT_LIST_HEAD(&mm->nodes);
280 list_add_tail(&node->nl_entry, &mm->nodes);
291 int nodes = 0; local
296 list_for_each_entry(node, &mm->nodes, nl_entry) {
298 if (++nodes > mm->heap_nodes) {
305 list_for_each_entry_safe(node, temp, &mm->nodes, nl_entry)
    [all...]
  /src/external/bsd/mdocml/dist/
tag.c 18 * Functions to tag syntax tree nodes.
43 struct roff_node **nodes; member in struct:tag_entry
58 * Set up the ohash table to collect nodes
77 free(entry->nodes);
186 entry->nodes = NULL;
207 nold = entry->nodes[--entry->nnodes];
222 entry->nodes = mandoc_reallocarray(entry->nodes,
223 entry->maxnodes, sizeof(*entry->nodes));
225 entry->nodes[entry->nnodes++] = n
    [all...]
  /src/external/gpl2/texinfo/dist/info/
info.h 97 /* A structure associating the nodes visited in a particular window. */
100 NODE **nodes; /* Array of nodes visited in this window. */
101 int *pagetops; /* For each node in NODES, the pagetop. */
102 long *points; /* For each node in NODES, the point. */
103 int current; /* Index in NODES of the current node. */
105 int nodes_slots; /* Number of slots allocated to NODES. */
108 /* Array of structures describing for each window which nodes have been
99 NODE **nodes; \/* Array of nodes visited in this window. *\/ member in struct:__anon9526

Completed in 40 milliseconds

1 2 3 4 5 6