| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 128 /// Preds - The predecessors of this node.
129 NodeGroup Preds;
200 unsigned pred_size() const { return Preds.size(); }
202 bool pred_empty() const { return Preds.empty(); }
239 pred_iterator pred_begin() { return Preds.begin(); }
240 pred_iterator pred_end() { return Preds.end(); }
241 pred_range preds() { return {Preds.begin(), Preds.end()}; } function in class:clang::ento::ExplodedNode
249 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; function in class:clang::ento::ExplodedNode
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/arm/ |
| arm-mve-builtins.h | 255 const predication_index *preds; member in struct:arm_mve::function_group_info
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| basic-block.h | 45 dest->preds. */
119 vec<edge, va_gc> *preds; variable
312 && EDGE_COUNT ((e)->dest->preds) >= 2)
316 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
332 return EDGE_COUNT (bb->preds) == 1;
530 FOR_EACH_EDGE (e, ei, bb->preds)
545 FOR_EACH_EDGE (e, ei, bb->preds)
638 FOR_EACH_EDGE (e, ei, bb->preds)
|
| tree-ssa-tail-merge.cc | 254 /* The preds of the bbs in the cluster. */
255 bitmap preds; member in struct:bb_cluster
823 FOR_EACH_EDGE (e, ei, bb->preds)
922 bitmap_print (file, c->preds, "preds:", "\n");
968 /* Add BB to cluster C. Sets BB in C->bbs, and preds of BB in C->preds. */
978 FOR_EACH_EDGE (e, ei, bb->preds)
979 bitmap_set_bit (c->preds, e->src->index);
992 c->preds = BITMAP_ALLOC (NULL)
[all...] |
| predict.cc | 515 edge_prediction **preds = bb_predictions->get (bb); local
517 if (!preds)
520 for (i = *preds; i; i = i->ep_next)
534 edge_prediction **preds = bb_predictions->get (bb); local
535 if (!preds)
543 for (i = *preds; i; i = i->ep_next)
625 edge_prediction *&preds = bb_predictions->get_or_insert (e->src); local
627 i->ep_next = preds;
628 preds = i;
635 /* Filter edge predictions PREDS by a function FILTER: if FILTER return fals
691 edge_prediction **preds = bb_predictions->get (bb); local
1145 edge_prediction **preds = bb_predictions->get (bb); local
1256 edge_prediction **preds = bb_predictions->get (bb); local
1309 edge_prediction **preds = bb_predictions->get (bb); local
1640 edge_prediction **preds = bb_predictions->get (bb); local
3180 edge_prediction **preds = bb_predictions->get (e->src); local
[all...] |
| genmatch.cc | 2922 auto_vec<dt_operand *> preds; local
2943 preds.safe_push (op);
2968 fns, generic_fns, preds, others);
2975 preds.truncate (0);
2984 fns, generic_fns, preds, others);
2995 const vec<dt_operand *> &preds,
3167 for (unsigned i = 0; i < preds.length (); ++i)
3169 expr *e = as_a <expr *> (preds[i]->op);
3171 preds[i]->get_name (kid_opname);
3183 preds[i]->gen_opname (child_opname, j)
[all...] |
| sel-sched-ir.cc | 3734 || EDGE_COUNT (bb->preds) == 0
3739 FOR_EACH_EDGE (e, ei, bb->preds)
3777 FOR_EACH_EDGE (e, ei, bb->preds)
3791 FOR_EACH_EDGE (e, ei, bb->preds)
4071 /* Compute seqno for INSN by its preds or succs. Use OLD_SEQNO to compute
4089 /* We can have preds outside a region when splitting edges
4110 insn_t *preds;
4113 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n);
4118 seqno = INSN_SEQNO (preds[0]);
4122 free (preds);
4090 insn_t *preds; local
4093 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n); local
4130 insn_t *preds; local
[all...] |
| tree-ssa-structalias.cc | 567 bitmap *preds; member in struct:constraint_graph
1179 if (!graph->preds[to])
1180 graph->preds[to] = BITMAP_ALLOC (&predbitmap_obstack);
1181 bitmap_set_bit (graph->preds[to], from);
1266 graph->preds = XCNEWVEC (bitmap, graph->size);
2048 EXECUTE_IF_IN_NONNULL_BITMAP (graph->preds[n], 0, i, bi)
2119 if (graph->preds[b])
2121 if (!graph->preds[a])
2122 std::swap (graph->preds[a], graph->preds[b])
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| aarch64-sve-builtins.h | 262 const predication_index *preds; member in struct:aarch64_sve::function_group_info
|
| /src/external/gpl3/gcc/dist/gcc/ |
| basic-block.h | 45 dest->preds. */
119 vec<edge, va_gc> *preds; variable
304 && EDGE_COUNT ((e)->dest->preds) >= 2)
308 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
324 return EDGE_COUNT (bb->preds) == 1;
522 FOR_EACH_EDGE (e, ei, bb->preds)
537 FOR_EACH_EDGE (e, ei, bb->preds)
630 FOR_EACH_EDGE (e, ei, bb->preds)
|
| tree-ssa-loop-unswitch.cc | 587 auto_vec<tree, 16> preds; local
589 preds.safe_grow_cleared (EDGE_COUNT (gimple_bb (stmt)->succs), true);
620 tree &expr = preds[(uintptr_t)e->aux];
629 for (edge_index = 0; edge_index < preds.length (); ++edge_index)
633 if (preds[edge_index] != NULL_TREE)
636 = new unswitch_predicate (preds[edge_index], idx,
|
| tree-ssa-tail-merge.cc | 254 /* The preds of the bbs in the cluster. */
255 bitmap preds; member in struct:bb_cluster
834 FOR_EACH_EDGE (e, ei, bb->preds)
933 bitmap_print (file, c->preds, "preds:", "\n");
979 /* Add BB to cluster C. Sets BB in C->bbs, and preds of BB in C->preds. */
989 FOR_EACH_EDGE (e, ei, bb->preds)
990 bitmap_set_bit (c->preds, e->src->index);
1003 c->preds = BITMAP_ALLOC (NULL)
[all...] |
| predict.cc | 527 edge_prediction **preds = bb_predictions->get (bb); local
529 if (!preds)
532 for (i = *preds; i; i = i->ep_next)
546 edge_prediction **preds = bb_predictions->get (bb); local
547 if (!preds)
555 for (i = *preds; i; i = i->ep_next)
637 edge_prediction *&preds = bb_predictions->get_or_insert (e->src); local
639 i->ep_next = preds;
640 preds = i;
647 /* Filter edge predictions PREDS by a function FILTER: if FILTER return fals
703 edge_prediction **preds = bb_predictions->get (bb); local
1157 edge_prediction **preds = bb_predictions->get (bb); local
1268 edge_prediction **preds = bb_predictions->get (bb); local
1321 edge_prediction **preds = bb_predictions->get (bb); local
1652 edge_prediction **preds = bb_predictions->get (bb); local
3279 edge_prediction **preds = bb_predictions->get (e->src); local
[all...] |
| genmatch.cc | 3110 auto_vec<dt_operand *> preds; local
3139 preds.safe_push (op);
3177 fns, generic_fns, preds, others);
3184 preds.truncate (0);
3195 fns, generic_fns, preds, others);
3206 const vec<dt_operand *> &preds,
3410 for (unsigned i = 0; i < preds.length (); ++i)
3412 expr *e = as_a <expr *> (preds[i]->op);
3414 preds[i]->get_name (kid_opname);
3426 preds[i]->gen_opname (child_opname, j)
[all...] |
| sel-sched-ir.cc | 3734 || EDGE_COUNT (bb->preds) == 0
3739 FOR_EACH_EDGE (e, ei, bb->preds)
3777 FOR_EACH_EDGE (e, ei, bb->preds)
3791 FOR_EACH_EDGE (e, ei, bb->preds)
4071 /* Compute seqno for INSN by its preds or succs. Use OLD_SEQNO to compute
4089 /* We can have preds outside a region when splitting edges
4110 insn_t *preds;
4113 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n);
4118 seqno = INSN_SEQNO (preds[0]);
4122 free (preds);
4090 insn_t *preds; local
4093 cfg_preds (BLOCK_FOR_INSN (insn), &preds, &n); local
4130 insn_t *preds; local
[all...] |
| tree-ssa-structalias.cc | 568 bitmap *preds; member in struct:constraint_graph
1192 if (!graph->preds[to])
1193 graph->preds[to] = BITMAP_ALLOC (&predbitmap_obstack);
1194 bitmap_set_bit (graph->preds[to], from);
1282 graph->preds = XCNEWVEC (bitmap, graph->size);
2071 EXECUTE_IF_IN_NONNULL_BITMAP (graph->preds[n], 0, i, bi)
2142 if (graph->preds[b])
2144 if (!graph->preds[a])
2145 std::swap (graph->preds[a], graph->preds[b])
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| aarch64-sve-builtins.h | 364 const predication_index *preds; member in struct:aarch64_sve::function_group_info
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vector-builtins.h | 347 const predication_type_index *preds; member in struct:riscv_vector::function_group_info
|
