Searched defs:CP (Results 1 - 25 of 35) sorted by relevance

12

/freebsd-10.1-release/contrib/llvm/lib/Target/SystemZ/
H A DSystemZConstantPoolValue.cpp40 getExistingMachineCPValue(MachineConstantPool *CP, unsigned Alignment) { argument
H A DSystemZISelLowering.cpp1657 SDValue SystemZTargetLowering::lowerConstantPool(ConstantPoolSDNode *CP, argument
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DLiveInterval.cpp139 bool LiveRange::overlaps(const LiveRange &Other, const CoalescerPair &CP, argument
H A DRegisterCoalescer.cpp426 bool RegisterCoalescer::adjustCopiesBackFrom(const CoalescerPair &CP, argument
569 removeCopyByCommutingDef(const CoalescerPair &CP, MachineInstr *CopyMI) argument
732 reMaterializeTrivialDef(CoalescerPair &CP, MachineInstr *CopyMI, bool &IsDefCopy) argument
899 eliminateUndefCopy(MachineInstr *CopyMI, const CoalescerPair &CP) argument
992 canJoinPhys(const CoalescerPair &CP) argument
1172 joinReservedPhysReg(CoalescerPair &CP) argument
1288 const CoalescerPair &CP; member in class:__anon2292::JoinVals
1965 joinVirtRegs(CoalescerPair &CP) argument
2025 joinIntervals(CoalescerPair &CP) argument
[all...]
/freebsd-10.1-release/contrib/ipfilter/
H A DMakefile126 CP=/bin/cp macro
/freebsd-10.1-release/contrib/llvm/lib/Target/ARM/
H A DARMConstantPoolValue.cpp63 int ARMConstantPoolValue::getExistingMachineCPValue(MachineConstantPool *CP, argument
164 int ARMConstantPoolConstant::getExistingMachineCPValue(MachineConstantPool *CP, argument
203 int ARMConstantPoolSymbol::getExistingMachineCPValue(MachineConstantPool *CP, argument
243 int ARMConstantPoolMBB::getExistingMachineCPValue(MachineConstantPool *CP, argument
H A DARMConstantPoolValue.h70 int getExistingMachineCPValueImpl(MachineConstantPool *CP, argument
/freebsd-10.1-release/contrib/llvm/lib/Target/MSP430/
H A DMSP430ISelDAGToDAG.cpp48 const Constant *CP; member in struct:__anon2498::MSP430ISelAddressMode
[all...]
/freebsd-10.1-release/sys/conf/
H A Dkern.pre.mk22 CP?= cp macro
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/
H A DLiveInterval.h161 assert(S < E && �); } bool contains(SlotIndex I) const { return start <= I && I < end; } bool containsInterval(SlotIndex S, SlotIndex E) const { assert((S < E) && �); return (start <= S && S < end) && (start < E && E <= end); } bool operator<(const Segment &Other) const { return start < Other.start || (start == Other.start && end < Other.end); } bool operator==(const Segment &Other) const { return start == Other.start && end == Other.end; } void dump() const; }; typedef SmallVector<Segment,4> Segments; typedef SmallVector<VNInfo*,4> VNInfoList; Segments segments; VNInfoList valnos; typedef Segments::iterator iterator; iterator begin() { return segments.begin(); } iterator end() { return segments.end(); } typedef Segments::const_iterator const_iterator; const_iterator begin() const { return segments.begin(); } const_iterator end() const { return segments.end(); } typedef VNInfoList::iterator vni_iterator; vni_iterator vni_begin() { return valnos.begin(); } vni_iterator vni_end() { return valnos.end(); } typedef VNInfoList::const_iterator const_vni_iterator; const_vni_iterator vni_begin() const { return valnos.begin(); } const_vni_iterator vni_end() const { return valnos.end(); } iterator advanceTo(iterator I, SlotIndex Pos) { assert(I != end()); if (Pos >= endIndex()) return end(); while (I->end <= Pos) ++I; return I; } iterator find(SlotIndex Pos); const_iterator find(SlotIndex Pos) const { return const_cast<LiveRange*>(this)->find(Pos); } void clear() { valnos.clear(); segments.clear(); } size_t size() const { return segments.size(); } bool hasAtLeastOneValue() const { return !valnos.empty(); } bool containsOneValue() const { return valnos.size() == 1; } unsigned getNumValNums() const { return (unsigned)valnos.size(); } inline VNInfo *getValNumInfo(unsigned ValNo) { return valnos[ValNo]; } inline const VNInfo *getValNumInfo(unsigned ValNo) const { return valnos[ValNo]; } bool containsValue(const VNInfo *VNI) const { return VNI && VNI->id < getNumValNums() && VNI == getValNumInfo(VNI->id); } VNInfo *getNextValue(SlotIndex def, VNInfo::Allocator &VNInfoAllocator) { VNInfo *VNI = new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), def); valnos.push_back(VNI); return VNI; } VNInfo *createDeadDef(SlotIndex Def, VNInfo::Allocator &VNInfoAllocator); VNInfo *createValueCopy(const VNInfo *orig, VNInfo::Allocator &VNInfoAllocator) { VNInfo *VNI = new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), *orig); valnos.push_back(VNI); return VNI; } void RenumberValues(); VNInfo* MergeValueNumberInto(VNInfo *V1, VNInfo *V2); void MergeSegmentsInAsValue(const LiveRange &RHS, VNInfo *LHSValNo); void MergeValueInAsValue(const LiveRange &RHS, const VNInfo *RHSValNo, VNInfo *LHSValNo); bool empty() const { return segments.empty(); } SlotIndex beginIndex() const { assert(!empty() && �); return segments.front().start; } SlotIndex endIndex() const { assert(!empty() && �); return segments.back().end; } bool expiredAt(SlotIndex index) const { return index >= endIndex(); } bool liveAt(SlotIndex index) const { const_iterator r = find(index); return r != end() && r->start <= index; } const Segment *getSegmentContaining(SlotIndex Idx) const { const_iterator I = FindSegmentContaining(Idx); return I == end() ? 0 : &*I; } Segment *getSegmentContaining(SlotIndex Idx) { iterator I = FindSegmentContaining(Idx); return I == end() ? 0 : &*I; } VNInfo *getVNInfoAt(SlotIndex Idx) const { const_iterator I = FindSegmentContaining(Idx); return I == end() ? 0 : I->valno; } VNInfo *getVNInfoBefore(SlotIndex Idx) const { const_iterator I = FindSegmentContaining(Idx.getPrevSlot()); return I == end() ? 0 : I->valno; } iterator FindSegmentContaining(SlotIndex Idx) { iterator I = find(Idx); return I != end() && I->start <= Idx ? I : end(); } const_iterator FindSegmentContaining(SlotIndex Idx) const { const_iterator I = find(Idx); return I != end() && I->start <= Idx ? I : end(); } bool overlaps(const LiveRange &other) const { if (other.empty()) return false; return overlapsFrom(other, other.begin()); } bool overlaps(const LiveRange &Other, const CoalescerPair &CP, const SlotIndexes&) const; bool overlaps(SlotIndex Start, SlotIndex End) const; bool overlapsFrom(const LiveRange &Other, const_iterator I) const; iterator addSegment(Segment S) { return addSegmentFrom(S, segments.begin()); } VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Kill); void join(LiveRange &Other, const int *ValNoAssignments, const int *RHSValNoAssignments, SmallVectorImpl<VNInfo *> &NewVNInfo); bool isLocal(SlotIndex Start, SlotIndex End) const { return beginIndex() > Start.getBaseIndex() && endIndex() < End.getBoundaryIndex(); } void removeSegment(SlotIndex Start, SlotIndex End, bool RemoveDeadValNo = false); void removeSegment(Segment S, bool RemoveDeadValNo = false) { removeSegment(S.start, S.end, RemoveDeadValNo); } LiveQueryResult Query(SlotIndex Idx) const { const_iterator I = find(Idx.getBaseIndex()); const_iterator E = end(); if (I == E) return LiveQueryResult(0, 0, SlotIndex(), false); VNInfo *EarlyVal = 0; VNInfo *LateVal = 0; SlotIndex EndPoint; bool Kill = false; if (I->start <= Idx.getBaseIndex()) { EarlyVal = I->valno; EndPoint = I->end; if (SlotIndex::isSameInstr(Idx, I->end)) { Kill = true; if (++I == E) return LiveQueryResult(EarlyVal, LateVal, EndPoint, Kill); } if (EarlyVal->def == Idx.getBaseIndex()) EarlyVal = 0; } if (!SlotIndex::isEarlierInstr(Idx, I->start) argument
/freebsd-10.1-release/contrib/llvm/utils/TableGen/
H A DDAGISelMatcherGen.cpp508 const ComplexPattern &CP = local
/freebsd-10.1-release/sys/kern/
H A Dsysv_msg.c1531 #define CP macro
1589 #undef CP macro
[all...]
H A Dsysv_sem.c1416 #define CP(src, dst, fld) do { (dst).fld = (src).fld; } while (0) macro
[all...]
H A Dsysv_shm.c1297 #define CP macro
[all...]
/freebsd-10.1-release/contrib/llvm/lib/IR/
H A DConstantsContext.h558 typename MapTy::iterator FindExistingElement(ConstantClass *CP) { argument
613 void remove(ConstantClass *CP) { argument
666 getHashValue(const ConstantClass *CP) argument
715 findExistingElement(ConstantClass *CP) argument
755 insert(ConstantClass *CP) argument
760 remove(ConstantClass *CP) argument
[all...]
/freebsd-10.1-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64ISelDAGToDAG.cpp1120 SDValue CP = CurDAG->getTargetConstantPool(C, CN->getValueType(0)); local
1122 ReplaceUses(SDValue(Node, 0), CP); local
/freebsd-10.1-release/sys/dev/mpr/
H A Dmpr_user.c187 #define CP(src,dst,fld) do { (dst).fld = (src).fld; } while (0) macro
[all...]
/freebsd-10.1-release/sys/dev/mps/
H A Dmps_user.c184 #define CP(src,dst,fld) do { (dst).fld = (src).fld; } while (0) macro
[all...]
/freebsd-10.1-release/contrib/sendmail/src/
H A Dtls.c1732 # define CP (const char **) macro
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DAsmPrinter.cpp1032 const std::vector<MachineConstantPoolEntry> &CP = MCP->getConstants(); local
/freebsd-10.1-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonISelLowering.cpp966 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op); local
/freebsd-10.1-release/contrib/llvm/lib/Target/XCore/
H A DXCoreISelLowering.cpp303 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op); local
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/Lex/
H A DLexer.cpp1111 static char DecodeTrigraphChar(const char *CP, Lexer *L) { argument
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DPathDiagnostic.cpp124 getFirstStackedCallToHeaderFile(PathDiagnosticCallPiece *CP, argument
[all...]
/freebsd-10.1-release/sys/compat/freebsd32/
H A Dfreebsd32.h39 #define CP(src,dst,fld) do { (dst).fld = (src).fld; } while (0) macro

Completed in 395 milliseconds

12