| /external/llvm/lib/Target/NVPTX/ |
| NVPTXInstrInfo.td | 385 "xor.pred \t$dst, $a, $b;",
388 "xor.pred \t$dst, $a, $b;",
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 130 uint32_t lookup_or_add_cmp(unsigned Opcode, CmpInst::Predicate Pred,
725 bool performScalarPREInsertion(Instruction *Instr, BasicBlock *Pred,
731 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
[all...] |
| /art/compiler/optimizing/ |
| graph_checker_test.cc | 27 * BasicBlock 1, pred: 0
|
| pretty_printer.h | 76 PrintString(", pred: ");
|
| /art/compiler/utils/ |
| intrusive_forward_list.h | 279 void remove_if(Predicate pred) {
282 if (pred(*current)) {
294 void unique(BinaryPredicate pred) {
300 if (pred(*prev, *current)) {
|
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| DefineGrammarItemsWalker.g | 562 ( ^( REWRITE (pred=SEMPRED)? rewrite_alternative )
564 if ( $pred != null )
566 $pred.outerAltNum = this.outerAltNum;
567 trackInlineAction($pred);
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| AST.stg | 289 <if(a.pred)>if <a.pred>:
299 <if(a.pred)>
300 if <a.pred>:
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 93 void handlePredecessor(const CFGBlock *Pred) {}
96 void handlePredecessorBackEdge(const CFGBlock *Pred) {}
445 void handlePredecessor(const CFGBlock *Pred);
446 void handlePredecessorBackEdge(const CFGBlock *Pred);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CheckerContext.cpp | 25 SVal L = State->getSVal(Callee, Pred->getLocationContext());
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| partition_point.pass.cpp | 14 // partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| bucket.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| bucket_size.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| equal_range_const.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| equal_range_non_const.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| load_factor.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| rehash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| reserve.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.cnstr/ |
| assign_init.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| default.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| size.fail.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| size.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| size_hash.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| size_hash_equal.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
| size_hash_equal_allocator.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.elem/ |
| index.pass.cpp | 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
