Searched refs:Depth (Results 1 - 25 of 252) sorted by relevance

1234567891011

/external/javassist/src/main/javassist/runtime/
H A DCflow.java26 private static class Depth { class in class:Cflow
28 Depth() { depth = 0; } method in class:Cflow.Depth
35 return new Depth();
41 public void enter() { ((Depth)get()).inc(); }
46 public void exit() { ((Depth)get()).dec(); }
51 public int value() { return ((Depth)get()).get(); }
/external/libcxxabi/test/
H A Ddynamic_cast_stress.pass.cpp14 template <std::size_t Indx, std::size_t Depth>
16 : public virtual C<Indx, Depth-1>,
17 public virtual C<Indx+1, Depth-1>
28 template <std::size_t Indx, std::size_t Depth>
30 : public virtual C<Indx, Depth-1>,
31 public virtual C<Indx+1, Depth-1>
35 template <class Indx, std::size_t Depth>
38 template <std::size_t ...Indx, std::size_t Depth>
39 struct makeB<std::__tuple_indices<Indx...>, Depth>
40 : public B<Indx, Depth>
53 const std::size_t Depth = 5; local
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h46 size_t Depth; member in class:llvm::ScoreboardHazardRecognizer::Scoreboard
50 Scoreboard():Data(nullptr), Depth(0), Head(0) { }
55 size_t getDepth() const { return Depth; }
57 // Depth is expected to be a power-of-2.
58 assert(Depth && !(Depth & (Depth - 1)) &&
61 return Data[(Head + idx) & (Depth-1)];
66 Depth = d;
67 Data = new unsigned[Depth];
[all...]
/external/mesa3d/src/mesa/main/
H A Ddepth.c52 if (ctx->Depth.Clear == depth)
56 ctx->Depth.Clear = depth;
91 if (ctx->Depth.Func == func)
95 ctx->Depth.Func = func;
116 if (ctx->Depth.Mask == flag)
120 ctx->Depth.Mask = flag;
148 if (ctx->Depth.BoundsMin == zmin && ctx->Depth.BoundsMax == zmax)
152 ctx->Depth.BoundsMin = (GLfloat) zmin;
153 ctx->Depth
[all...]
/external/expat/examples/
H A Doutline.c46 int Depth; variable
53 for (i = 0; i < Depth; i++)
63 Depth++;
69 Depth--;
/external/llvm/lib/Support/
H A DSignals.cpp52 static bool findModulesAndOffsets(void **StackTrace, int Depth,
65 static bool printSymbolizedStackTrace(void **StackTrace, int Depth,
70 static bool printSymbolizedStackTrace(void **StackTrace, int Depth, argument
89 std::vector<const char *> Modules(Depth, nullptr);
90 std::vector<intptr_t> Offsets(Depth, 0);
91 if (!findModulesAndOffsets(StackTrace, Depth, Modules.data(), Offsets.data(),
103 for (int i = 0; i < Depth; i++) {
137 for (int i = 0; i < Depth; i++) {
/external/llvm/test/MC/COFF/
H A Dsimple-fixups.s19 # =>This Inner Loop Header: Depth=1
32 # =>This Inner Loop Header: Depth=1
/external/llvm/include/llvm/Analysis/
H A DValueTracking.h46 const DataLayout &DL, unsigned Depth = 0,
64 const DataLayout &DL, unsigned Depth = 0,
75 bool OrZero = false, unsigned Depth = 0,
84 bool isKnownNonZero(Value *V, const DataLayout &DL, unsigned Depth = 0,
90 bool isKnownNonNegative(Value *V, const DataLayout &DL, unsigned Depth = 0,
112 unsigned Depth = 0, AssumptionCache *AC = nullptr,
125 unsigned Depth = 0, AssumptionCache *AC = nullptr,
136 unsigned Depth = 0);
141 bool CannotBeNegativeZero(const Value *V, unsigned Depth = 0);
146 bool CannotBeOrderedLessThanZero(const Value *V, unsigned Depth
[all...]
/external/llvm/lib/Target/NVPTX/
H A DNVPTXFavorNonGenericAddrSpaces.cpp104 Value *hoistAddrSpaceCastFrom(Value *V, int Depth = 0);
106 Value *hoistAddrSpaceCastFromGEP(GEPOperator *GEP, int Depth);
108 Value *hoistAddrSpaceCastFromBitCast(BitCastOperator *BC, int Depth);
146 GEPOperator *GEP, int Depth) {
148 hoistAddrSpaceCastFrom(GEP->getPointerOperand(), Depth + 1);
184 BitCastOperator *BC, int Depth) {
185 Value *NewOperand = hoistAddrSpaceCastFrom(BC->getOperand(0), Depth + 1);
221 int Depth) {
228 if (Depth >= MaxDepth)
235 return hoistAddrSpaceCastFromGEP(GEP, Depth);
145 hoistAddrSpaceCastFromGEP( GEPOperator *GEP, int Depth) argument
183 hoistAddrSpaceCastFromBitCast( BitCastOperator *BC, int Depth) argument
220 hoistAddrSpaceCastFrom(Value *V, int Depth) argument
[all...]
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp73 unsigned Depth) {
76 KnownOne, Depth, UserI);
106 unsigned Depth,
109 assert(Depth <= 6 && "Limit Search Depth");
139 if (Depth == 6) // Limit search depth.
147 computeKnownBits(V, KnownZero, KnownOne, Depth, CxtI);
154 if (Depth != 0 && !I->hasOneUse()) {
161 computeKnownBits(I->getOperand(1), RHSKnownZero, RHSKnownOne, Depth + 1,
163 computeKnownBits(I->getOperand(0), LHSKnownZero, LHSKnownOne, Depth
71 SimplifyDemandedBits(Use &U, APInt DemandedMask, APInt &KnownZero, APInt &KnownOne, unsigned Depth) argument
104 SimplifyDemandedUseBits(Value *V, APInt DemandedMask, APInt &KnownZero, APInt &KnownOne, unsigned Depth, Instruction *CxtI) argument
876 SimplifyDemandedVectorElts(Value *V, APInt DemandedElts, APInt &UndefElts, unsigned Depth) argument
[all...]
/external/llvm/lib/Analysis/
H A DValueTracking.cpp131 const DataLayout &DL, unsigned Depth,
135 const DataLayout &DL, unsigned Depth,
138 ::computeKnownBits(V, KnownZero, KnownOne, DL, Depth,
158 const DataLayout &DL, unsigned Depth,
162 const DataLayout &DL, unsigned Depth,
165 ::ComputeSignBit(V, KnownZero, KnownOne, DL, Depth,
169 static bool isKnownToBeAPowerOfTwo(Value *V, bool OrZero, unsigned Depth,
173 unsigned Depth, AssumptionCache *AC,
176 return ::isKnownToBeAPowerOfTwo(V, OrZero, Depth,
180 static bool isKnownNonZero(Value *V, const DataLayout &DL, unsigned Depth,
134 computeKnownBits(Value *V, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
161 ComputeSignBit(Value *V, bool &KnownZero, bool &KnownOne, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
172 isKnownToBeAPowerOfTwo(Value *V, const DataLayout &DL, bool OrZero, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
183 isKnownNonZero(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
189 isKnownNonNegative(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
211 MaskedValueIsZero(Value *V, const APInt &Mask, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
221 ComputeNumSignBits(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
228 computeKnownBitsAddSub(bool Add, Value *Op0, Value *Op1, bool NSW, APInt &KnownZero, APInt &KnownOne, APInt &KnownZero2, APInt &KnownOne2, const DataLayout &DL, unsigned Depth, const Query &Q) argument
308 computeKnownBitsMul(Value *Op0, Value *Op1, bool NSW, APInt &KnownZero, APInt &KnownOne, APInt &KnownZero2, APInt &KnownOne2, const DataLayout &DL, unsigned Depth, const Query &Q) argument
545 computeKnownBitsFromTrueCondition(Value *V, ICmpInst *Cmp, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, const Query &Q) argument
619 computeKnownBitsFromDominatingCondition(Value *V, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, const Query &Q) argument
727 computeKnownBitsFromAssume(Value *V, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, const Query &Q) argument
984 computeKnownBitsFromShiftOperator(Operator *I, APInt &KnownZero, APInt &KnownOne, APInt &KnownZero2, APInt &KnownOne2, const DataLayout &DL, unsigned Depth, const Query &Q, KZFunctor KZF, KOFunctor KOF) argument
1059 computeKnownBitsFromOperator(Operator *I, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, const Query &Q) argument
1612 computeKnownBits(Value *V, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, const Query &Q) argument
1702 ComputeSignBit(Value *V, bool &KnownZero, bool &KnownOne, const DataLayout &DL, unsigned Depth, const Query &Q) argument
1721 isKnownToBeAPowerOfTwo(Value *V, bool OrZero, unsigned Depth, const Query &Q, const DataLayout &DL) argument
1818 isGEPKnownNonNull(GEPOperator *GEP, const DataLayout &DL, unsigned Depth, const Query &Q) argument
1897 isKnownNonZero(Value *V, const DataLayout &DL, unsigned Depth, const Query &Q) argument
2129 MaskedValueIsZero(Value *V, const APInt &Mask, const DataLayout &DL, unsigned Depth, const Query &Q) argument
2146 ComputeNumSignBits(Value *V, const DataLayout &DL, unsigned Depth, const Query &Q) argument
2370 ComputeMultiple(Value *V, unsigned Base, Value *&Multiple, bool LookThroughSExt, unsigned Depth) argument
2492 CannotBeNegativeZero(const Value *V, unsigned Depth) argument
2543 CannotBeOrderedLessThanZero(const Value *V, unsigned Depth) argument
4104 isTruePredicate(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
4165 isImpliedCondOperands(CmpInst::Predicate Pred, Value *ALHS, Value *ARHS, Value *BLHS, Value *BRHS, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
4190 isImpliedCondition(Value *LHS, Value *RHS, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
[all...]
/external/clang/include/clang/Sema/
H A DTemplate.h65 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const { argument
66 assert(Depth < TemplateArgumentLists.size());
67 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size());
68 return TemplateArgumentLists[getNumLevels() - Depth - 1][Index];
75 bool hasTemplateArgument(unsigned Depth, unsigned Index) const {
76 assert(Depth < TemplateArgumentLists.size());
78 if (Index >= TemplateArgumentLists[getNumLevels() - Depth - 1].size())
81 return !(*this)(Depth, Index).isNull();
85 void setArgument(unsigned Depth, unsigned Index,
87 assert(Depth < TemplateArgumentList
[all...]
/external/lldb/include/lldb/Core/
H A DAddressResolverFileLine.h42 virtual Searcher::Depth
H A DAddressResolverName.h50 virtual Searcher::Depth
H A DFileLineResolver.h50 virtual Searcher::Depth
/external/llvm/lib/Transforms/ObjCARC/
H A DObjCARCAPElim.cpp44 static bool MayAutorelease(ImmutableCallSite CS, unsigned Depth = 0);
71 bool ObjCARCAPElim::MayAutorelease(ImmutableCallSite CS, unsigned Depth) { argument
80 if (Depth < 3 &&
82 MayAutorelease(JCS, Depth + 1))
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dgen6_depthstencil.c85 if (ctx->Depth.Test && depth_irb) {
86 ds->ds2.depth_test_enable = ctx->Depth.Test;
87 ds->ds2.depth_test_func = intel_translate_compare_func(ctx->Depth.Func);
88 ds->ds2.depth_write_enable = ctx->Depth.Mask;
/external/vulkan-validation-layers/libs/glm/gtx/
H A Dnorm.hpp113 unsigned int Depth);
120 unsigned int Depth);
/external/clang/lib/Sema/
H A DScope.cpp35 Depth = parent->Depth + 1;
48 Depth = 0;
214 OS << "Depth: " << Depth << '\n'; local
/external/libxml2/python/tests/
H A Dreader7.py15 result = result + "%d %d %s %d\n" % (reader.Depth(), reader.NodeType(),
/external/lldb/include/lldb/Breakpoint/
H A DBreakpointResolverAddress.h50 virtual Searcher::Depth
H A DBreakpointResolverFileLine.h46 virtual Searcher::Depth
H A DBreakpointResolverFileRegex.h43 virtual Searcher::Depth
/external/opencv/cxcore/include/
H A Dcvwimage.h207 int Depth() const;
243 assert(!img || img->depth == Depth());
247 assert(!image || image->depth == Depth());
290 assert(!image || image->depth == WImage<T>::Depth());
507 inline int WImage<uchar>::Depth() const {return IPL_DEPTH_8U; } function in class:cv::WImage
509 inline int WImage<schar>::Depth() const {return IPL_DEPTH_8S; } function in class:cv::WImage
511 inline int WImage<short>::Depth() const {return IPL_DEPTH_16S; } function in class:cv::WImage
513 inline int WImage<ushort>::Depth() const {return IPL_DEPTH_16U; } function in class:cv::WImage
515 inline int WImage<int>::Depth() const {return IPL_DEPTH_32S; } function in class:cv::WImage
517 inline int WImage<float>::Depth() cons function in class:cv::WImage
519 inline int WImage<double>::Depth() const {return IPL_DEPTH_64F; } function in class:cv::WImage
[all...]
/external/mesa3d/src/mesa/swrast/
H A Ds_texture.c71 texImage->Height, texImage->Depth);
86 swImg->ImageOffsets = (GLuint *) malloc(texImage->Depth * sizeof(GLuint));
90 for (i = 0; i < texImage->Depth; i++) {
114 (texImage->Depth == 1 || _mesa_is_pow_two(texImage->Depth2)))
129 swImg->DepthScale = (GLfloat) texImage->Depth;
220 assert(slice < texImage->Depth);

Completed in 606 milliseconds

1234567891011