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

1 2 3 4 5

  /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/gdb/dist/gdbserver/
dll.cc 59 auto pred = [&] (const dll_info &dll) local
72 pred);
  /src/external/ibm-public/postfix/dist/src/util/
ring.c 83 ring->pred = ring->succ = ring;
91 entry->pred = ring;
92 ring->succ->pred = entry;
100 entry->pred = ring->pred;
102 ring->pred->succ = entry;
103 ring->pred = entry;
111 RING *pred = entry->pred; local
113 pred->succ = succ
    [all...]
ring.h 23 RING *pred; /* predecessor */ member in struct:RING
32 #define ring_pred(c) ((c)->pred)
  /src/external/gpl3/gdb.old/dist/gdbserver/
dll.cc 59 auto pred = [&] (const dll_info &dll) local
72 pred);
  /src/external/gpl3/gcc/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 579 /* Add given pred to worklist. */
637 superedge *pred; local
638 FOR_EACH_VEC_ELT (snode->m_preds, i, pred)
640 pred),
658 superedge *pred; local
659 FOR_EACH_VEC_ELT (snode->m_preds, i, pred)
661 pred),
894 /* Add given pred to worklist. */
967 superedge *pred; local
968 FOR_EACH_VEC_ELT (snode->m_preds, i, pred)
988 superedge *pred; local
    [all...]
  /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/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 77 This is done based on the flow graph, and not on the pred-succ lists.
177 basic_block pred, succ;
184 pred = INDEX_EDGE_PRED_BB (edge_list, x);
186 if (pred == ENTRY_BLOCK_PTR_FOR_FN (cfun))
195 avout[pred->index]);
196 bitmap_not (temp_bitmap, antout[pred->index]);
198 kill[pred->index], temp_bitmap);
590 basic_block pred, succ;
597 pred = INDEX_EDGE_PRED_BB (edge_list, x);
600 bitmap_copy (farthest[x], st_avout[pred->index])
176 basic_block pred, succ; local
589 basic_block pred, succ; 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...]
  /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);

Completed in 44 milliseconds

1 2 3 4 5