Searched refs:contains (Results 1 - 25 of 223) sorted by relevance

123456789

/freebsd-10.1-release/contrib/llvm/lib/Target/R600/
H A DAMDGPUAsmPrinter.cpp209 if (AMDGPU::SReg_32RegClass.contains(reg)) {
212 } else if (AMDGPU::VReg_32RegClass.contains(reg)) {
215 } else if (AMDGPU::SReg_64RegClass.contains(reg)) {
218 } else if (AMDGPU::VReg_64RegClass.contains(reg)) {
221 } else if (AMDGPU::VReg_96RegClass.contains(reg)) {
224 } else if (AMDGPU::SReg_128RegClass.contains(reg)) {
227 } else if (AMDGPU::VReg_128RegClass.contains(reg)) {
230 } else if (AMDGPU::SReg_256RegClass.contains(reg)) {
233 } else if (AMDGPU::VReg_256RegClass.contains(reg)) {
236 } else if (AMDGPU::SReg_512RegClass.contains(re
[all...]
H A DSIInstrInfo.cpp96 if (AMDGPU::SReg_32RegClass.contains(DestReg)) {
97 assert(AMDGPU::SReg_32RegClass.contains(SrcReg));
102 } else if (AMDGPU::SReg_64RegClass.contains(DestReg)) {
103 assert(AMDGPU::SReg_64RegClass.contains(SrcReg));
108 } else if (AMDGPU::SReg_128RegClass.contains(DestReg)) {
109 assert(AMDGPU::SReg_128RegClass.contains(SrcReg));
113 } else if (AMDGPU::SReg_256RegClass.contains(DestReg)) {
114 assert(AMDGPU::SReg_256RegClass.contains(SrcReg));
118 } else if (AMDGPU::SReg_512RegClass.contains(DestReg)) {
119 assert(AMDGPU::SReg_512RegClass.contains(SrcRe
[all...]
/freebsd-10.1-release/contrib/llvm/lib/Target/Mips/
H A DMipsSEInstrInfo.cpp10 // This file contains the Mips32/64 implementation of the TargetInstrInfo class.
88 if (Mips::GPR32RegClass.contains(DestReg)) { // Copy to CPU Reg.
89 if (Mips::GPR32RegClass.contains(SrcReg))
91 else if (Mips::CCRRegClass.contains(SrcReg))
93 else if (Mips::FGR32RegClass.contains(SrcReg))
95 else if (Mips::HI32RegClass.contains(SrcReg))
97 else if (Mips::LO32RegClass.contains(SrcReg))
99 else if (Mips::HI32DSPRegClass.contains(SrcReg))
101 else if (Mips::LO32DSPRegClass.contains(SrcReg))
103 else if (Mips::DSPCCRegClass.contains(SrcRe
[all...]
/freebsd-10.1-release/contrib/dialog/samples/
H A Dtextbox11 the file first if it contains 'tab' characters.
H A Dtextbox211 the file first if it contains 'tab' characters.
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DMachineLoopInfo.cpp54 while (contains(PriorMBB)) {
68 while (contains(NextMBB)) {
/freebsd-10.1-release/contrib/llvm/lib/Analysis/
H A DInterval.cpp10 // This file contains the definition of the Interval class, which represents a
34 if (contains(*I))
H A DLoopInfo.cpp64 return !contains(I);
154 if (contains(Incoming)) {
155 if (contains(Backedge))
158 } else if (!contains(Backedge))
195 !contains(UserBB) &&
296 // The loop branch contains the parallel loop metadata. In order to ensure
343 if (!contains(*PI))
367 if (contains(*I))
469 assert((NL != Unloop && (!NL || NL->contains(Unloop))) &&
476 assert((FoundIB || Unloop->contains(
[all...]
H A DRegionInfo.cpp112 bool Region::contains(const BasicBlock *B) const { function in class:Region
128 bool Region::contains(const Loop *L) const { function in class:Region
135 if (!contains(L->getHeader()))
143 if (!contains(*BI))
150 if (!contains(L))
153 while (L && contains(L->getParentLoop())) {
174 if (DT->getNode(Pred) && !contains(Pred)) {
196 if (contains(Pred)) {
236 if (!contains(BB))
242 if (!contains(*S
[all...]
/freebsd-10.1-release/contrib/llvm/include/llvm/Analysis/
H A DRegionInfo.h118 /// @return True if it contains a subregion. False if it contains a
178 /// A simple control flow graph, that contains two regions.
367 /// @brief Check if the region contains a BasicBlock.
371 bool contains(const BasicBlock *BB) const;
373 /// @brief Check if the region contains another region.
377 bool contains(const Region *SubRegion) const { function in class:llvm::Region
382 return contains(SubRegion->getEntry())
383 && (contains(SubRegion->getExit()) || SubRegion->getExit() == getExit());
386 /// @brief Check if the region contains a
390 bool contains(const Instruction *Inst) const { function in class:llvm::Region
[all...]
H A DLoopInfo.h101 /// contains - Return true if the specified loop is contained within in
104 bool contains(const LoopT *L) const { function in class:llvm::LoopBase
107 return contains(L->getParentLoop());
110 /// contains - Return true if the specified basic block is in this loop.
112 bool contains(const BlockT *BB) const { function in class:llvm::LoopBase
116 /// contains - Return true if the specified instruction is in this loop.
119 bool contains(const InstT *Inst) const { function in class:llvm::LoopBase
120 return contains(Inst->getParent());
156 if (!contains(*SI))
172 if (contains(*
[all...]
H A DLoopInfoImpl.h39 if (!contains(*I)) {
68 if (!contains(*I))
93 if (!contains(*I))
139 if (!contains(N)) { // If the block is not in the loop...
152 /// A latch block is a block that contains a branch back to the header.
164 if (contains(N)) {
249 if (contains(*SI)) {
258 if (contains(N))
280 "Loop contains function entry block!");
292 assert(contains(*B
[all...]
/freebsd-10.1-release/contrib/llvm/include/llvm/Support/
H A DConstantRange.h67 /// makeICmpRegion - Produce the smallest range that contains all values that
89 /// isFullSet - Return true if this set contains all of the elements possible
94 /// isEmptySet - Return true if this set contains no members.
108 /// contains - Return true if the specified value is in the set.
110 bool contains(const APInt &Val) const;
112 /// contains - Return true if the other range is a subset of this one.
114 bool contains(const ConstantRange &CR) const;
116 /// getSingleElement - If this set contains a single element, return it,
125 /// isSingleElement - Return true if this set contains exactly one member.
H A DUnicodeCharRanges.h56 /// \brief Returns true if the character set contains the Unicode code point
58 bool contains(uint32_t C) const { function in class:llvm::sys::UnicodeCharSet
/freebsd-10.1-release/contrib/bmake/mk/
H A Dyacc.mk17 # this file contains rules to DTRT when SRCS contains foo.y or foo.c
H A Drst2htm.mk26 # the following will run RST2S5 if the target name contains the word 'slides'
/freebsd-10.1-release/contrib/gperf/src/
H A Dpositions.cc35 Positions::contains (int pos) const function in class:Positions
H A Dpositions.h89 bool contains (int pos) const;
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/
H A DLiveRegUnits.h66 bool contains(unsigned Reg, const MCRegisterInfo &MCRI) const { function in class:llvm::LiveRegUnits
/freebsd-10.1-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.cpp10 // This file contains the AArch64 implementation of the TargetInstrInfo class.
60 assert(AArch64::GPR64RegClass.contains(SrcReg));
66 assert(AArch64::GPR64RegClass.contains(DestReg));
70 } else if (AArch64::GPR64RegClass.contains(DestReg)) {
71 if(AArch64::GPR64RegClass.contains(SrcReg)){
75 assert(AArch64::FPR64RegClass.contains(SrcReg));
80 } else if (AArch64::GPR32RegClass.contains(DestReg)) {
81 if(AArch64::GPR32RegClass.contains(SrcReg)){
85 assert(AArch64::FPR32RegClass.contains(SrcReg));
90 } else if (AArch64::FPR32RegClass.contains(DestRe
[all...]
/freebsd-10.1-release/tools/regression/filemon/
H A DMakefile64 if [ "$${NL}" != 97 ]; then echo "$$F BAD, contains $${NL} lines" ; exit 1 ; fi ; done
/freebsd-10.1-release/contrib/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp283 } else if (TIL->contains(DestLoop)) {
286 } else if (DestLoop->contains(TIL)) {
303 if (!TIL->contains(DestBB) &&
305 assert(!TIL->contains(NewBB) &&
326 if (TIL->contains(P)) {
H A DLoopSimplify.cpp27 // contains or is entered by an indirectbr instruction, it may not be possible
161 if (!L->contains(P))
199 !L->contains(BI->getSuccessor(0))));
235 if (!L->contains(*PI)) {
379 if (!L->contains(P)) { // Coming in from outside the loop?
421 if (L->contains(P)) {
485 L->contains(PN->getIncomingBlock(i)))
515 L->contains(BBI)) {
566 !L->contains(PN->getIncomingBlock(i))) {
/freebsd-10.1-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestGetAggregate.java74 if (!included.contains(a.getName())) {
126 if (cleared.contains(a.getName())) {
/freebsd-10.1-release/contrib/groff/src/libs/libdriver/
H A Dprinter.cpp219 if (!(*f)->contains(i)) {
249 if (!f->contains(i)) {

Completed in 134 milliseconds

123456789