| /src/external/apache2/llvm/dist/clang/docs/analyzer/checkers/ |
| unix_api_example.c | 12 pthread_once_t pred = {0x30B1BCBA, {0}}; local
13 pthread_once(&pred, f);
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| reachability.h | 50 edge_t *pred; local
51 FOR_EACH_VEC_ELT (next->m_preds, i, pred)
53 if (!reachable_from_p (pred->m_src))
55 worklist.safe_push (pred->m_src);
56 bitmap_set_bit (m_indices, pred->m_src->m_index);
|
| state-purge.cc | 574 /* Add given pred to worklist. */
632 superedge *pred; local
633 FOR_EACH_VEC_ELT (snode->m_preds, i, pred)
635 pred),
653 superedge *pred; local
654 FOR_EACH_VEC_ELT (snode->m_preds, i, pred)
656 pred),
885 /* Add given pred to worklist. */
958 superedge *pred; local
959 FOR_EACH_VEC_ELT (snode->m_preds, i, pred)
979 superedge *pred; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphds.h | 37 struct graph_edge *pred, *succ; member in struct:vertex
|
| shortest-paths.h | 157 edge_t *pred; local
158 FOR_EACH_VEC_ELT (n->m_preds, i, pred)
161 node_t *src = pred->m_src;
166 m_best_edge[src->m_index] = pred;
|
| value-pointer-equiv.cc | 212 edge pred = single_pred_edge_ignoring_loop_edges (bb, false); local
213 if (pred)
214 visit_edge (pred);
|
| hw-doloop.cc | 303 basic_block pred = e->src; local
305 if (!bb_in_loop_p (loop, pred))
309 loop->loop_no, pred->index,
|
| lcm.cc | 80 This is done based on the flow graph, and not on the pred-succ lists.
175 basic_block pred, succ;
182 pred = INDEX_EDGE_PRED_BB (edge_list, x);
184 if (pred == ENTRY_BLOCK_PTR_FOR_FN (cfun))
193 avout[pred->index]);
194 bitmap_not (temp_bitmap, antout[pred->index]);
196 kill[pred->index], temp_bitmap);
591 basic_block pred, succ;
598 pred = INDEX_EDGE_PRED_BB (edge_list, x);
601 bitmap_copy (farthest[x], st_avout[pred->index])
174 basic_block pred, succ; local
590 basic_block pred, succ; local
[all...] |
| cfghooks.cc | 233 error ("basic block %d pred edge is corrupted", bb->index);
244 error ("basic block %d pred edge is corrupted", bb->index);
1058 basic_block pred = single_pred (ret); local
1061 = find_common_loop (pred->loop_father, succ->loop_father);
1066 if (loop->latch == pred
|
| genoutput.cc | 253 struct pred_data *pred;
270 pred = NULL;
272 pred = lookup_predicate (d->predicate);
273 printf (" %d\n", pred && pred->codes[MEM]);
250 struct pred_data *pred; local
|
| tree-cfgcleanup.cc | 568 basic_block pred = NULL; local
570 pred = single_pred (bb);
656 bb->loop_father->latch = pred;
1222 /* Record BB's single pred in case we need to update the father
1224 basic_block pred = NULL;
1226 pred = single_pred (bb);
1331 bb->loop_father->latch = pred;
|
| cfganal.cc | 247 pred and succ that edge represents can be determined, or
248 given a pred and a succ, its index number can be returned.
250 represent the normally full matrix of edge (pred,succ) with a
251 single indexed vector, edge (EDGE_INDEX (pred, succ)), with no
335 int pred, succ, index;
345 pred = e->src->index;
350 fprintf (f, "*p* No index for edge from %d to %d\n", pred, succ);
354 if (INDEX_EDGE_PRED_BB (elist, index)->index != pred)
355 fprintf (f, "*p* Pred for index %d should be %d not %d\n",
356 index, pred, INDEX_EDGE_PRED_BB (elist, index)->index)
333 int pred, succ, index; local
878 basic_block pred; local
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 230 const CFGBlock *pred = *CB->pred_begin(); local
231 if (!pred)
235 const Stmt *cond = pred->getTerminatorCondition();
|
| MallocOverflowSecurityChecker.cpp | 150 llvm::function_ref<bool(const MallocOverflowCheck &)> Pred) {
151 auto P = [DR, Pred](const MallocOverflowCheck &Check) {
153 return getDecl(CheckDR) == getDecl(DR) && Pred(Check);
214 auto pred = [assignKnown, numeratorKnown, local
221 Erase<DeclRefExpr>(DR, pred);
223 Erase<MemberExpr>(ME, pred);
|
| /src/external/cddl/osnet/dist/lib/libdtrace/common/ |
| dt_sugar.c | 131 * (this->%condition_<condid> && pred);
134 * Note: if condid==0, we will instead do "... = (1 && pred)", to effectively
135 * convert the pred to a boolean.
143 dt_node_t *pred, int condid, int newcond)
152 * value is (1 && pred)
156 * Therefore, value can't simply be <pred>, because then
160 value = dt_node_op2(DT_TOK_LAND, dt_node_int(1), pred);
162 /* value is (this->%condition_<condid> && pred) */
164 dt_sugar_new_condition_var(condid), pred);
180 dt_sugar_new_condition(dt_sugar_parse_t *dp, dt_node_t *pred, int condid
344 dt_node_t *pred = local
364 dt_node_t *pred = NULL; local
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 92 const ExplodedNode *pred = *(node->pred_begin()); local
93 if (pred->succ_size() != 1)
116 ProgramStateRef pred_state = pred->getState();
118 progPoint.getLocationContext() != pred->getLocationContext())
160 ExplodedNode *pred = *(node->pred_begin()); local
162 pred->replaceSuccessor(succ);
163 succ->replacePredecessor(pred);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/profile/ |
| GCDAProfiling.c | 332 uint32_t pred; local
334 pred = *predecessor;
335 if (pred == 0xffffffff)
337 counter = counters[pred];
339 /* Don't crash if the pred# is out of sync. This can happen due to threads,
346 "llvmgcda: increment_indirect_counter counters=%08llx, pred=%u\n",
|
| /src/external/gpl3/gcc.old/dist/gcc/c-family/ |
| c-gimplify.cc | 423 tree pred = build_predict_expr (PRED_CONTINUE, NOT_TAKEN); local
427 append_to_statement_list_force (pred, &stmt_list);
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| UninitializedValues.cpp | 573 const CFGBlock *Pred = *I;
574 if (!Pred)
577 Value AtPredExit = vals.getValue(Pred, B, vd);
596 CFGTerminator term = Pred->getTerminator();
598 const CFGBlock *fallthrough = *Pred->succ_begin();
614 unsigned &SV = SuccsVisited[Pred->getBlockID()];
618 for (CFGBlock::const_succ_iterator SI = Pred->succ_begin(),
619 SE = Pred->succ_end();
625 if (++SV == Pred->succ_size())
628 Queue.push_back(Pred);
845 const CFGBlock *pred = *I; local
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/ |
| GCOV.h | 245 uint64_t propagateCounts(const GCOVBlock &v, GCOVArc *pred);
280 void addSrcEdge(GCOVArc *Edge) { pred.push_back(Edge); }
285 return make_range(pred.begin(), pred.end());
304 SmallVector<GCOVArc *, 2> pred; member in class:llvm::GCOVBlock
|
| /src/sys/arch/riscv/riscv/ |
| db_disasm.c | 1325 unsigned pred, succ; local
1328 pred = (imm >> 4) & 0xf;
1331 db_print_riscv_fencebits(pred);
|
| /src/usr.bin/diff/ |
| diffreg.c | 127 * new k-candidate is chained (via pred) to the current k-1 candidate so
150 int pred; member in struct:cand
628 newcand(int x, int y, int pred)
639 q->pred = pred;
676 for (q = clist + p; q->y != 0; q = clist + q->pred)
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/ |
| RetainCountChecker.cpp | 232 const ExplodedNode *pred = C.getPredecessor(); local
234 SVal V = pred->getSVal(Child);
250 state->getSVal(Ex, pred->getLocationContext()).getAsSymbol()) {
273 const ExplodedNode *Pred = C.getPredecessor();
274 ProgramStateRef State = Pred->getState();
276 if (SymbolRef Sym = Pred->getSVal(Ex).getAsSymbol()) {
965 ExplodedNode *Pred = C.getPredecessor();
973 return Pred;
976 return Pred;
980 return Pred;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ConstantFold.cpp | 1352 // cmp pred ^ true -> cmp !pred
1354 CmpInst::Predicate pred = (CmpInst::Predicate)CE1->getPredicate(); local
1355 pred = CmpInst::getInversePredicate(pred);
1356 return ConstantExpr::getCompare(pred, CE1->getOperand(0),
1716 ICmpInst::Predicate pred = ICmpInst::ICMP_EQ; local
1717 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
1719 return pred;
1720 pred = isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT
[all...] |
| /src/external/bsd/libpcap/dist/ |
| gencode.h | 265 struct block *pred; /* predecessor vertex */ member in struct:edge
|
