| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| infinite-loop.cc | 471 std::vector<pair_t> succs; local
487 succs.push_back (pair_t (next_state, out_edge));
499 if (succs.size () != 1)
503 (int)succs.size ());
506 const feasibility_state &next_state = succs[0].first;
507 const exploded_edge *out_eedge = succs[0].second;
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 131 /// Succs - The successors of this node.
132 NodeGroup Succs;
139 : Location(loc), State(std::move(state)), Succs(IsSink), Id(Id) {
199 unsigned succ_size() const { return Succs.size(); }
201 bool succ_empty() const { return Succs.empty(); }
204 bool isSink() const { return Succs.getFlag(); }
251 succ_iterator succ_begin() { return Succs.begin(); }
252 succ_iterator succ_end() { return Succs.end(); }
253 succ_range succs() { return {Succs.begin(), Succs.end()}; function in class:clang::ento::ExplodedNode
261 const_succ_range succs() const { return {Succs.begin(), Succs.end()}; } function in class:clang::ento::ExplodedNode
[all...] |
| /src/external/gpl3/binutils/dist/gas/config/ |
| kvx-parse.c | 40 struct node_list_s *succs; member in struct:node_s
144 new_hd->nxt = base->succs;
158 n->succs = NULL;
181 n->succs = insert_in_succ_list (NULL, n);
196 suf->succs = node->succs;
200 rem->succs = insert_in_succ_list (NULL, rem);
204 node->succs = NULL;
206 node->succs = insert_in_succ_list (suf, node);
207 node->succs = insert_in_succ_list (rem, node)
[all...] |
| /src/external/gpl3/binutils.old/dist/gas/config/ |
| kvx-parse.c | 40 struct node_list_s *succs; member in struct:node_s
144 new_hd->nxt = base->succs;
158 n->succs = NULL;
181 n->succs = insert_in_succ_list (NULL, n);
196 suf->succs = node->succs;
200 rem->succs = insert_in_succ_list (NULL, rem);
204 node->succs = NULL;
206 node->succs = insert_in_succ_list (suf, node);
207 node->succs = insert_in_succ_list (rem, node)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| basic-block.h | 120 vec<edge, va_gc> *succs; variable
303 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
309 #define EDGE_SUCC(bb,i) (*(bb)->succs)[(i)]
316 return EDGE_COUNT (bb->succs) == 1;
479 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
614 FOR_EACH_EDGE (e, ei, bb->succs)
|
| tree-profile.cc | 302 if (!single_p (src->succs))
327 for (edge e : b->succs)
491 for (edge e : b->succs)
504 while (!(e->flags & EDGE_DFS_BACK) && single_p (e->dest->succs))
506 e = single_edge (e->dest->succs);
561 outcomes succs = conditional_succs (q); local
562 if (!bitmap_bit_p (marks, succs.t->index))
564 if (!bitmap_bit_p (marks, succs.f->index))
634 for (edge e : b->succs)
638 for (edge e : b->succs)
[all...] |
| tree-ssa-tail-merge.cc | 212 cached in succs, and the successor edge flags are cached in succ_flags.
223 bitmap succs; member in struct:same_succ
410 bitmap_print (file, e->succs, "succs:", "\n");
470 inchash::hash hstate (bitmap_hash (e->succs));
526 EXECUTE_IF_SET_IN_BITMAP (e->succs, 0, s, bs)
589 if (!bitmap_equal_p (e1->succs, e2->succs))
640 same->succs = BITMAP_ALLOC (NULL);
654 BITMAP_FREE (e->succs);
[all...] |
| tree-ssa-structalias.cc | 561 bitmap *succs; member in struct:constraint_graph
803 EXECUTE_IF_IN_NONNULL_BITMAP (graph->succs[i], 0, j, bi)
1132 if (graph->succs[node])
1133 BITMAP_FREE (graph->succs[node]);
1155 if (graph->succs[from])
1157 if (!graph->succs[to])
1158 graph->succs[to] = BITMAP_ALLOC (&pta_obstack);
1159 bitmap_ior_into (graph->succs[to],
1160 graph->succs[from]);
1213 if (!graph->succs[from]
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| basic-block.h | 120 vec<edge, va_gc> *succs; variable
311 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
317 #define EDGE_SUCC(bb,i) (*(bb)->succs)[(i)]
324 return EDGE_COUNT (bb->succs) == 1;
487 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
622 FOR_EACH_EDGE (e, ei, bb->succs)
|
| tree-ssa-tail-merge.cc | 212 cached in succs, and the successor edge flags are cached in succ_flags.
223 bitmap succs; member in struct:same_succ
402 bitmap_print (file, e->succs, "succs:", "\n");
462 inchash::hash hstate (bitmap_hash (e->succs));
515 EXECUTE_IF_SET_IN_BITMAP (e->succs, 0, s, bs)
578 if (!bitmap_equal_p (e1->succs, e2->succs))
629 same->succs = BITMAP_ALLOC (NULL);
643 BITMAP_FREE (e->succs);
[all...] |
| tree-ssa-structalias.cc | 560 bitmap *succs; member in struct:constraint_graph
802 EXECUTE_IF_IN_NONNULL_BITMAP (graph->succs[i], 0, j, bi)
1119 if (graph->succs[node])
1120 BITMAP_FREE (graph->succs[node]);
1142 if (graph->succs[from])
1144 if (!graph->succs[to])
1145 graph->succs[to] = BITMAP_ALLOC (&pta_obstack);
1146 bitmap_ior_into (graph->succs[to],
1147 graph->succs[from]);
1200 if (!graph->succs[from]
[all...] |
