/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/binary_heap_/ |
H A D | entry_pred.hpp | 56 class Pred, 61 typedef Pred type; 64 template<typename Value_Type, class Pred, class Allocator> 67 Pred, 77 struct type : public Pred 85 type(const Pred& other) : Pred(other) 91 return Pred::operator()(*p_v);
|
H A D | erase_fn_imps.hpp | 114 template<typename Pred> 117 erase_if(Pred pred) 124 Pred, 223 template<typename Pred> 226 partition(Pred pred)
|
H A D | binary_heap_.hpp | 226 template<typename Pred> 228 erase_if(Pred pred); 251 template<typename Pred> 253 split(Pred pred, PB_DS_CLASS_C_DEC& other); 313 template<typename Pred> 315 partition(Pred pred);
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | split_join_fn_imps.hpp | 48 template<typename Pred> 51 split(Pred pred, PB_DS_CLASS_C_DEC& other)
|
H A D | rc_binomial_heap_.hpp | 145 template<typename Pred> 147 erase_if(Pred pred); 149 template<typename Pred> 151 split(Pred pred, PB_DS_CLASS_C_DEC& other);
|
H A D | erase_fn_imps.hpp | 92 template<typename Pred> 95 erase_if(Pred pred)
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
H A D | BlockFrequencyImpl.h | 163 BlockT *Pred = *PI; 169 return Pred; 183 if(BlockT *Pred = getSingleBlockPred(BB)) { 184 if (BlocksInLoop.count(Pred)) 185 setBlockFreq(BB, getEdgeFreq(Pred, BB)); 197 BlockT *Pred = *PI; local 199 if (isReachable(Pred) && isBackedge(Pred, BB)) { 201 } else if (BlocksInLoop.count(Pred)) { 202 incBlockFreq(BB, getEdgeFreq(Pred, B 241 BlockT *Pred = *PI; local 294 BlockT *Pred = *PI; local [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 125 BlkT *Pred = Preds[p]; local 128 BBMap.FindAndConstruct(Pred); 135 ValT PredVal = AvailableVals->lookup(Pred); 136 BBInfo *PredInfo = new (Allocator) BBInfo(Pred, PredVal); 238 BBInfo *Pred = Info->Preds[p]; local 241 if (Pred->BlkNum == 0) { 242 Pred->AvailableVal = Traits::GetUndefVal(Pred->BB, Updater); 243 (*AvailableVals)[Pred->BB] = Pred 268 IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) argument 360 BlkT *Pred = PredInfo->BB; local [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Target/ARM/ |
H A D | Thumb2RegisterInfo.h | 36 ARMCC::CondCodes Pred = ARMCC::AL,
|
H A D | Thumb2RegisterInfo.cpp | 40 ARMCC::CondCodes Pred, unsigned PredReg, 35 emitLoadConstPool(MachineBasicBlock &MBB, MachineBasicBlock::iterator &MBBI, DebugLoc dl, unsigned DestReg, unsigned SubIdx, int Val, ARMCC::CondCodes Pred, unsigned PredReg, unsigned MIFlags) const argument
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/pairing_heap_/ |
H A D | pairing_heap_.hpp | 169 template<typename Pred> 171 erase_if(Pred pred); 173 template<typename Pred> 175 split(Pred pred, PB_DS_CLASS_C_DEC& other);
|
H A D | split_join_fn_imps.hpp | 48 template<typename Pred> 51 split(Pred pred, PB_DS_CLASS_C_DEC& other)
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | erase_fn_imps.hpp | 62 template<typename Pred> 65 erase_if(Pred pred)
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | erase_fn_imps.hpp | 76 template<typename Pred> 79 erase_if(Pred pred)
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 48 template<typename Pred> 51 split(Pred pred, PB_DS_CLASS_C_DEC& other)
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/ |
H A D | Analysis.h | 72 ISD::CondCode getFCmpCondCode(FCmpInst::Predicate Pred); 81 ISD::CondCode getICmpCondCode(ICmpInst::Predicate Pred);
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Utils/ |
H A D | CmpInstAnalysis.cpp | 45 ICmpInst::Predicate Pred = InvertPred ? ICI->getInversePredicate() local 47 switch (Pred) {
|
H A D | BasicBlockUtils.cpp | 156 // Make all PHI nodes that referred to BB now refer to Pred as their 335 BasicBlock *Pred = *i; local 340 if (Loop *PL = LI->getLoopFor(Pred)) 347 if (L->contains(Pred)) 369 BasicBlock *Pred = *i; local 370 if (Loop *PredLoop = LI->getLoopFor(Pred)) { 545 BasicBlock *Pred = *i++; local 546 if (Pred == NewBB1) continue; 547 assert(!isa<IndirectBrInst>(Pred->getTerminator()) && 549 NewBB2Preds.push_back(Pred); 652 FoldReturnIntoUncondBranch(ReturnInst *RI, BasicBlock *BB, BasicBlock *Pred) argument [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/utils/unittest/googletest/include/gtest/ |
H A D | gtest_pred_impl.h | 85 template <typename Pred, 89 Pred pred, 126 template <typename Pred, 132 Pred pred, 174 template <typename Pred, 182 Pred pred, 229 template <typename Pred, 239 Pred pred, 291 template <typename Pred, 303 Pred pre [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/ |
H A D | CodePlacementOpt.cpp | 163 MachineBasicBlock *Pred = *PI; local 164 if (Pred == TopMBB) continue; 165 if (HasFallthrough(Pred)) continue; 166 if (!L->contains(Pred)) continue; 170 if (Pred == MF.begin()) 172 if (!HasAnalyzableTerminator(Pred)) 174 if (!HasAnalyzableTerminator(prior(MachineFunction::iterator(Pred)))) 178 DEBUG(dbgs() << "CGP: Moving blocks starting at BB#" << Pred->getNumber() 184 MachineFunction::iterator Begin = Pred;
|
H A D | LatencyPriorityQueue.cpp | 59 SUnit &Pred = *I->getSUnit(); local 60 if (!Pred.isScheduled) { 63 if (OnlyAvailablePred && OnlyAvailablePred != &Pred) 65 OnlyAvailablePred = &Pred;
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 78 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"? 79 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, argument 86 if (CPred == Pred && CLHS == LHS && CRHS == RHS) 88 return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS && 430 static Value *ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, argument 440 Pred = CmpInst::getSwappedPredicate(Pred); 450 Value *TCmp = SimplifyCmpInst(Pred, TV, RHS, Q, MaxRecurse); 458 if (!isSameCompare(Cond, Pred, TV, RHS)) 464 Value *FCmp = SimplifyCmpInst(Pred, F 555 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 1577 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1594 computePointerICmp(const TargetData &TD, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1638 CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate; local 2413 CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate; local [all...] |
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | binomial_heap_base_.hpp | 163 template<typename Pred> 165 erase_if(Pred pred); 167 template<typename Pred> 169 split(Pred pred, PB_DS_CLASS_C_DEC& other);
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | erase_fn_imps.hpp | 114 template<typename Pred> 117 prune(Pred pred)
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/pb_ds/detail/list_update_map_/ |
H A D | erase_fn_imps.hpp | 85 template<typename Pred> 88 erase_if(Pred pred)
|