HomeSort by relevance Sort by last modified time
    Searched refs:Pred (Results 51 - 75 of 354) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/clang/lib/Analysis/
ThreadSafetyTIL.cpp 56 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) {
59 Predecessors.push_back(Pred);
198 for (auto *Pred : Predecessors)
199 ID = Pred->topologicalFinalSort(Blocks, ID);
212 for (auto *Pred : Predecessors) {
214 if (Pred->BlockID >= BlockID) continue;
217 Candidate = Pred;
221 auto *Alternate = Pred;
  /external/clang/lib/StaticAnalyzer/Core/
CheckerManager.cpp 153 NodeBuilder &Bldr, ExplodedNode *Pred) {
158 Pred->getLocationContext(), checkFn.Checker);
159 CheckerContext C(Bldr, Eng, Pred, L, WasInlined);
198 NodeBuilder &Bldr, ExplodedNode *Pred) {
213 CheckerContext C(Bldr, Eng, Pred, L, WasInlined);
215 checkFn(*Msg.cloneWithState<ObjCMethodCall>(Pred->getState()), C);
265 NodeBuilder &Bldr, ExplodedNode *Pred) {
267 CheckerContext C(Bldr, Eng, Pred, L, WasInlined);
269 checkFn(*Call.cloneWithState(Pred->getState()), C);
309 NodeBuilder &Bldr, ExplodedNode *Pred) {
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/
copy_if.pass.cpp 13 // Predicate<auto, InIter::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // copy_if(InIter first, InIter last, OutIter result, Pred pred);
23 struct Pred
38 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
  /external/llvm/include/llvm/Analysis/
LazyValueInfo.h 53 /// Pred is a CmpInst predicate.
54 Tristate getPredicateOnEdge(unsigned Pred, Value *V, Constant *C,
60 /// (from an assume intrinsic). Pred is a CmpInst predicate.
61 Tristate getPredicateAt(unsigned Pred, Value *V, Constant *C,
  /external/llvm/include/llvm/CodeGen/
Analysis.h 87 ISD::CondCode getFCmpCondCode(FCmpInst::Predicate Pred);
96 ISD::CondCode getICmpCondCode(ICmpInst::Predicate Pred);
  /external/llvm/lib/Transforms/Utils/
CmpInstAnalysis.cpp 45 ICmpInst::Predicate Pred = InvertPred ? ICI->getInversePredicate()
47 switch (Pred) {
  /external/v8/src/compiler/
node-cache.h 29 typename Pred = std::equal_to<Key> >
56 Pred pred_;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.copy/
copy_if.pass.cpp 13 // Predicate<auto, InIter::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // copy_if(InIter first, InIter last, OutIter result, Pred pred);
23 struct Pred
38 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/
max_element_comp.pass.cpp 61 template <class Iter, class Pred>
62 void test_eq0(Iter first, Iter last, Pred p)
min_element_comp.pass.cpp 61 template <class Iter, class Pred>
62 void test_eq0(Iter first, Iter last, Pred p)
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/
remove_if.hpp 31 template< typename Pred, typename InsertOp > struct remove_if_helper
36 typename apply1<Pred,U>::type
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/
erase_fn_imps.hpp 56 template<typename Pred>
59 erase_if(Pred pred)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
75 if (pred(p_e->m_p_next->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
erase_fn_imps.hpp 70 template<typename Pred>
73 erase_if(Pred pred)
81 if (pred(p_e->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/list_update_map_/
erase_fn_imps.hpp 79 template<typename Pred>
82 erase_if(Pred pred)
86 while (m_p_l != 0 && pred(m_p_l->m_value))
100 if (pred(p_l->m_p_next->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/
split_join_fn_imps.hpp 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
59 node_pointer p_out = base_type::prune(pred);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/
erase_fn_imps.hpp 56 template<typename Pred>
59 erase_if(Pred pred)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
75 if (pred(p_e->m_p_next->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
erase_fn_imps.hpp 70 template<typename Pred>
73 erase_if(Pred pred)
81 if (pred(p_e->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/list_update_map_/
erase_fn_imps.hpp 79 template<typename Pred>
82 erase_if(Pred pred)
86 while (m_p_l != 0 && pred(m_p_l->m_value))
100 if (pred(p_l->m_p_next->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/
split_join_fn_imps.hpp 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
59 node_pointer p_out = base_type::prune(pred);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/
erase_fn_imps.hpp 56 template<typename Pred>
59 erase_if(Pred pred)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
75 if (pred(p_e->m_p_next->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
erase_fn_imps.hpp 70 template<typename Pred>
73 erase_if(Pred pred)
81 if (pred(p_e->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/list_update_map_/
erase_fn_imps.hpp 79 template<typename Pred>
82 erase_if(Pred pred)
86 while (m_p_l != 0 && pred(m_p_l->m_value))
100 if (pred(p_l->m_p_next->m_value))
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/thin_heap_/
split_join_fn_imps.hpp 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
59 node_pointer p_out = base_type::prune(pred);
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/cc_hash_table_map_/
erase_fn_imps.hpp 56 template<typename Pred>
59 erase_if(Pred pred)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
75 if (pred(p_e->m_p_next->m_value))
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/gp_hash_table_map_/
erase_fn_imps.hpp 70 template<typename Pred>
73 erase_if(Pred pred)
81 if (pred(p_e->m_value))

Completed in 335 milliseconds

1 23 4 5 6 7 8 91011>>