Searched refs:nodes (Results 1 - 25 of 47) sorted by relevance

12

/haiku-buildtools/binutils/include/vms/
H A Ddcx.h46 unsigned char nodes[2]; member in struct:vms_dcxsbm
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dpr42640.c15 struct S nodes[8]; variable in typeref:struct:S
16 struct S *rr_node = nodes;
/haiku-buildtools/gcc/gcc/
H A Dddg.c446 /* Given two nodes, analyze their RTL insns and add intra-loop mem deps
473 /* Given two nodes, analyze their RTL insns and add inter-loop mem deps
509 /* Perform intra-block Data Dependency analysis and connect the nodes in
531 ddg_node_ptr dest_node = &g->nodes[i];
564 ddg_node_ptr j_node = &g->nodes[j];
639 /* Allocate the nodes array, and initialize the nodes. */
641 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node));
658 g->closing_branch = &g->nodes[i];
667 g->nodes[
888 create_scc(ddg_ptr g, sbitmap nodes) argument
1212 update_dist_to_successors(ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) argument
1238 longest_simple_path(struct ddg * g, int src, int dest, sbitmap nodes) argument
[all...]
H A Dtree-streamer.c133 if (cache->nodes.exists ())
135 if (cache->nodes.length () == ix)
136 cache->nodes.safe_push (t);
138 cache->nodes[ix] = t;
280 /* If we recursively end up at nodes we do not want to preload simply don't.
302 streamer_tree_cache_append (cache, node, cache->nodes.length ());
322 /* Preload common nodes into CACHE and make sure they are merged
347 /* Skip optimization and target option nodes; they depend on flags. */
354 /* Skip va_list* related nodes if offloading. For native LTO
365 /* Create a cache of pickled nodes
[all...]
H A Dtree-dump.h68 /* 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
H A Dtree-streamer.h30 /* Cache of pickled nodes. Used to avoid writing the same node more
50 /* The mapping between tree nodes and slots into the nodes array. */
53 /* The nodes pickled so far. */
54 vec<tree> nodes; member in struct:streamer_tree_cache_d
63 these nodes, we just emit the class and function code. */
113 return cache->nodes[ix];
H A Dddg.h77 /* The source and destination nodes of the dependency edge. */
121 /* This array holds the nodes in the graph; it is indexed by the node
123 ddg_node_ptr nodes; member in struct:ddg
143 /* A bitmap that represents the nodes of the DDG that are in the SCC. */ member in struct:ddg_scc
144 sbitmap nodes;
H A Dlto-cgraph.c85 /* True when asm nodes has been output. */
89 static void input_cgraph_opt_summary (vec<symtab_node *> nodes);
125 encoder->nodes.create (0);
135 encoder->nodes.release ();
156 ref = encoder->nodes.length ();
157 encoder->nodes.safe_push (entry);
165 ref = encoder->nodes.length ();
168 encoder->nodes.safe_push (entry);
190 gcc_checking_assert (encoder->nodes[index].node == node);
194 last_node = encoder->nodes
1249 input_node(struct lto_file_decl_data *file_data, struct lto_input_block *ib, enum LTO_symtab_tags tag, vec<symtab_node *> nodes) argument
1455 input_ref(struct lto_input_block *ib, symtab_node *referring_node, vec<symtab_node *> nodes) argument
1481 input_edge(struct lto_input_block *ib, vec<symtab_node *> nodes, bool indirect) argument
1554 vec<symtab_node *> nodes = vNULL; local
1656 input_refs(struct lto_input_block *ib, vec<symtab_node *> nodes) argument
1867 vec<symtab_node *> nodes; local
2128 input_cgraph_opt_section(struct lto_file_decl_data *file_data, const char *data, size_t len, vec<symtab_node *> nodes) argument
[all...]
H A Dcgraphunit.c237 /* Queue of cgraph nodes scheduled to be added into cgraph. This is a
287 /* Head and terminator of the queue of nodes to be processed while building
701 /* Look for externally_visible and used attributes and mark cgraph nodes
704 We cannot mark the nodes at the point the attributes are processed (in
715 Furthermore, we can't mark these nodes in finalize_function because:
722 So, we walk the nodes at the end of the translation unit, applying the
935 /* Keep track of already processed nodes when called multiple times for
1934 /* Stop pointing to the local nodes about to be freed.
1987 Attempt to topologically sort the nodes so function is output when
2082 cgraph_order_sort *nodes; local
[all...]
H A Dmodulo-sched.c145 /* The number of different iterations the nodes in ps span, assuming
156 the ddg's num_nodes refer directly to ddg nodes. A value of
276 /* The column of a node inside the ps. If nodes u, v are on the same row,
346 return ps->g->nodes[id].insn;
360 return ps->g->nodes[id].first_note;
537 fprintf (file, " asap = %d:\n", NODE_ASAP (&ps->g->nodes[i]));
571 between a producing ddg node and various consuming ddg nodes.
719 ddg_node_ptr u = &g->nodes[i];
865 replace_rtx (ps->g->nodes[i_use].insn, move->old_reg, move->new_reg);
866 df_insn_rescan (ps->g->nodes[i_us
2694 find_max_asap(ddg_ptr g, sbitmap nodes) argument
2715 find_max_hv_min_mob(ddg_ptr g, sbitmap nodes) argument
2744 find_max_dv_min_mob(ddg_ptr g, sbitmap nodes) argument
[all...]
H A Dlto-streamer.h143 (GIMPLE statements, basic blocks, EH regions, tree nodes, etc).
194 /* Special for global streamer. A blob of unnamed tree nodes. */
197 /* References to indexable tree nodes. These objects are stored in
434 /* Number of nodes in globals stream. */
474 /* Encoder data structure used to stream callgraph nodes. */
477 vec<lto_encoder_entry> nodes; member in struct:lto_symtab_encoder_d
530 decls and cgraph nodes used in the serialization of this file. */
537 /* Encoder for cgraph nodes. */
570 /* Table of cgraph nodes present in this file. */
722 /* Cache of nodes writte
[all...]
H A Dcgraph.h90 The symtab_node is inherited by cgraph and varpol nodes. */
371 memcpy/memset on the tree nodes. */
459 During WPA output it is used to mark nodes that are present in
502 /* Circular list of nodes in the same comdat group if non-NULL. */
525 /* Dump base fields of symtab nodes to F. Not to be used directly. */
885 TREE_MAP is a mapping of tree nodes we want to replace with
939 nodes that were expanded. */
960 /* Verify cgraph nodes of the cgraph node. */
1332 /* A cgraph node set is a collection of cgraph nodes. A cgraph node
1337 vec<cgraph_node *> nodes; member in struct:cgraph_node_set_def
1350 vec<varpool_node *> nodes; member in struct:varpool_node_set_def
[all...]
/haiku-buildtools/gcc/contrib/
H A Dmake-obstacks-texi.pl35 my @nodes = grep /^\@node /, (split /\n/, $data);
37 foreach my $node (@nodes) {
H A Ddglib.pm396 my @nodes = split(m!/!, $path);
397 push @nodes, $descriptor if $descriptor;
398 my $lastnode = pop @nodes;
401 foreach (@nodes) {
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/
H A Dbinary-tree-freelist.go70 nodes := make([]Node, 3<<uint(*n))
71 for i := 0; i < len(nodes)-1; i++ {
72 nodes[i].left = &nodes[i+1]
74 a.head = &nodes[0]
/haiku-buildtools/gcc/include/
H A Dfibheap.h54 size_t nodes; member in struct:fibheap
/haiku-buildtools/legacy/binutils/include/
H A Dfibheap.h49 size_t nodes; member in struct:fibheap
/haiku-buildtools/legacy/gcc/texinfo/info/
H A Dgc.c26 /* Array of pointers to the contents of gc-able nodes. A pointer on this
63 NODE *node = iw->nodes[j];
H A Dinfo.h97 /* A structure associating the nodes visited in a particular window. */
100 NODE **nodes; /* Array of nodes visited in this window. */
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:__anon3567
H A Dsession.c52 /* Array of structures describing for each window which nodes have been
66 /* Begin an info session finding the nodes specified by FILENAME and NODENAMES.
96 of remembered windows and nodes. Then tile the windows. */
353 (info_win->nodes[info_win->current] == window->node))
373 info_win->nodes = (NODE **)NULL;
386 the list of history nodes. This may happen only at the very
388 if (info_win->nodes
390 && info_win->nodes[info_win->current]->contents == node->contents
397 and points as well as nodes, it is more efficient to avoid the
402 info_win->nodes
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/arm/
H A Dpr59858.c33 re_node_set nodes; member in struct:re_dfastate_t
53 re_token_t *nodes; member in struct:re_dfa_t
126 const re_node_set *cur_nodes = &state->nodes;
129 re_token_t *node = &dfa->nodes[cur_nodes->elems[i]];
/haiku-buildtools/binutils/include/
H A Dfibheap.h53 size_t nodes; member in struct:fibheap
/haiku-buildtools/binutils/libiberty/
H A Dfibheap.c118 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. */
287 return heap->nodes == 0;
310 heap->nodes--;
312 /* If we are left with no nodes, then the min is NULL. */
313 if (heap->nodes == 0)
/haiku-buildtools/gcc/libiberty/
H A Dfibheap.c118 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. */
287 return heap->nodes == 0;
310 heap->nodes--;
312 /* If we are left with no nodes, then the min is NULL. */
313 if (heap->nodes == 0)
/haiku-buildtools/legacy/binutils/libiberty/
H A Dfibheap.c118 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)

Completed in 314 milliseconds

12