| /external/llvm/lib/Transforms/Utils/ |
| CloneFunction.cpp | 578 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
579 Value *V = VMap[PN->getIncomingBlock(pred)];
581 Value *InVal = MapValue(PN->getIncomingValue(pred),
585 PN->setIncomingValue(pred, InVal);
586 PN->setIncomingBlock(pred, MappedBlock);
588 PN->removeIncomingValue(pred, false);
589 --pred, --e; // Revisit the next entry.
620 BasicBlock *Pred = PCI->first
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/ |
| finder.hpp | 212 \param Pred An element selection predicate
219 PredicateT Pred,
222 return detail::token_finderF<PredicateT>( Pred, eCompress );
|
| /external/antlr/antlr-3.4/runtime/Ruby/ |
| rakefile | 33 "test/functional/lexer/syn-pred.rb",
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| LeftRecursiveRuleAnalyzer.java | 102 altText += "{}"; // add empty alt to prevent pred hoisting
128 altText += "{}"; // add empty alt to prevent pred hoisting
152 altText += "{}"; // add empty alt to prevent pred hoisting
232 altST.add("pred", predST);
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
| AST.stg | 193 <if(a.pred)>
194 if <a.pred>
206 <if(a.pred)>
207 if <a.pred>
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_internal_defs.h | 253 #define COMPILER_CHECK(pred) IMPL_COMPILER_ASSERT(pred, __LINE__)
258 #define IMPL_COMPILER_ASSERT(pred, line) \
259 typedef char IMPL_PASTE(assertion_failed_##_, line)[2*(int)(pred)-1]
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultiset.java | 388 node = node.pred;
391 node = header.pred;
463 if (current.pred == header) {
466 current = current.pred;
526 private AvlNode<E> pred;
562 successor(pred, left, this);
779 successor(pred, succ);
785 AvlNode<E> newTop = pred;
935 b.pred = a;
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| partition_copy.pass.cpp | 17 // Predicate pred);
|
| stable_partition.pass.cpp | 12 // template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred>
14 // && CopyConstructible<Pred>
16 // stable_partition(Iter first, Iter last, Pred pred);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_pred.pass.cpp | 12 // template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred>
14 // && CopyConstructible<Pred>
16 // unique(Iter first, Iter last, Pred pred);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.any_of/ |
| any_of.pass.cpp | 14 // any_of(InputIterator first, InputIterator last, Predicate pred);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.none_of/ |
| none_of.pass.cpp | 14 // none_of(InputIterator first, InputIterator last, Predicate pred);
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| bucket_count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| find_const.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| find_non_const.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| max_load_factor.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| clear.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| insert_init.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| db_swap_1.pass.cpp | 12 // template <class Key, class Value, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| count.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| find_const.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| find_non_const.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| clear.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| db_swap_1.pass.cpp | 12 // template <class Key, class Value, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
