HomeSort by relevance Sort by last modified time
    Searched refs:Depth (Results 1 - 25 of 217) sorted by null

1 2 3 4 5 6 7 8 9

  /external/javassist/src/main/javassist/runtime/
Cflow.java 26 private static class Depth {
27 private int depth; field in class:Cflow.Depth
28 Depth() { depth = 0; }
29 int get() { return depth; }
30 void inc() { ++depth; }
31 void dec() { --depth; }
35 return new Depth();
41 public void enter() { ((Depth)get()).inc(); }
46 public void exit() { ((Depth)get()).dec();
    [all...]
  /external/libcxxabi/test/
dynamic_cast_stress.pass.cpp 14 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>..
    [all...]
  /ndk/sources/cxx-stl/gabi++/tests/
dynamic_cast_stress.cpp 15 template <std::size_t Indx, std::size_t Depth>
17 : public virtual C<Indx, Depth-1>,
18 public virtual C<Indx+1, Depth-1>
29 template <std::size_t Indx, std::size_t Depth>
31 : public virtual C<Indx, Depth-1>,
32 public virtual C<Indx+1, Depth-1>
36 template <class Indx, std::size_t Depth>
39 template <std::size_t ...Indx, std::size_t Depth>
40 struct makeB<std::__tuple_indices<Indx...>, Depth>
41 : public B<Indx, Depth>..
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/
dynamic_cast_stress.pass.cpp 14 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>..
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScoreboardHazardRecognizer.h 46 size_t Depth;
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/
depth.c 29 #include "depth.h"
42 _mesa_ClearDepth( GLclampd depth )
48 _mesa_debug(ctx, "glClearDepth(%f)\n", depth);
50 depth = CLAMP( depth, 0.0, 1.0 );
52 if (ctx->Depth.Clear == depth)
56 ctx->Depth.Clear = depth;
61 _mesa_ClearDepthf( GLclampf depth )
    [all...]
matrix.c 251 if (stack->Depth + 1 >= stack->MaxDepth) {
263 _math_matrix_copy( &stack->Stack[stack->Depth + 1],
264 &stack->Stack[stack->Depth] );
265 stack->Depth++;
266 stack->Top = &(stack->Stack[stack->Depth]);
291 if (stack->Depth == 0) {
303 stack->Depth--;
304 stack->Top = &(stack->Stack[stack->Depth]);
658 * \param maxDepth maximum stack depth.
670 stack->Depth = 0
    [all...]
  /external/expat/examples/
outline.c 46 int Depth;
53 for (i = 0; i < Depth; i++)
63 Depth++;
69 Depth--;
  /external/llvm/lib/Support/
Signals.cpp 52 static bool findModulesAndOffsets(void **StackTrace, int Depth,
65 static bool printSymbolizedStackTrace(void **StackTrace, int Depth,
70 static bool printSymbolizedStackTrace(void **StackTrace, int Depth,
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/
simple-fixups.s 19 # =>This Inner Loop Header: Depth=1
32 # =>This Inner Loop Header: Depth=1
  /external/llvm/include/llvm/Analysis/
ValueTracking.h 46 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 = 0)
    [all...]
  /external/llvm/lib/Target/NVPTX/
NVPTXFavorNonGenericAddrSpaces.cpp 104 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) {
226 // Limit the depth to prevent this recursive function from running too long.
228 if (Depth >= MaxDepth
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineSimplifyDemanded.cpp 73 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
    [all...]
  /external/llvm/lib/Analysis/
ValueTracking.cpp 55 static cl::opt<unsigned> DomConditionsMaxDepth("dom-conditions-max-depth",
131 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,
    [all...]
  /external/clang/include/clang/Sema/
Template.h 40 /// list will contain a template argument list (int) at depth 0 and a
41 /// template argument list (17) at depth 1.
43 /// \brief The template argument list at a certain template depth
64 /// \brief Retrieve the template argument at a given depth and index.
65 const TemplateArgument &operator()(unsigned Depth, unsigned Index) const {
66 assert(Depth < TemplateArgumentLists.size());
67 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size());
68 return TemplateArgumentLists[getNumLevels() - Depth - 1][Index];
72 /// given depth and index.
74 /// There must exist a template argument list at the given depth
    [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCAPElim.cpp 44 static bool MayAutorelease(ImmutableCallSite CS, unsigned Depth = 0);
71 bool ObjCARCAPElim::MayAutorelease(ImmutableCallSite CS, unsigned Depth) {
78 // This recursion depth limit is arbitrary. It's just great
80 if (Depth < 3 &&
82 MayAutorelease(JCS, Depth + 1))
  /external/mesa3d/src/mesa/drivers/dri/i965/
gen6_depthstencil.c 85 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/clang/lib/Sema/
Scope.cpp 35 Depth = parent->Depth + 1;
48 Depth = 0;
214 OS << "Depth: " << Depth << '\n';
  /external/libxml2/python/tests/
reader7.py 15 result = result + "%d %d %s %d\n" % (reader.Depth(), reader.NodeType(),
  /external/opencv/cxcore/include/
cvwimage.h 204 // Return depth type (e.g. IPL_DEPTH_8U, IPL_DEPTH_32F) which is the number
207 int Depth() const;
243 assert(!img || img->depth == Depth());
247 assert(!image || image->depth == Depth());
290 assert(!image || image->depth == WImage<T>::Depth());
505 // Specializations for depth
507 inline int WImage<uchar>::Depth() const {return IPL_DEPTH_8U;
    [all...]
  /external/opencv3/modules/core/include/opencv2/core/
wimage.hpp 200 // Return depth type (e.g. IPL_DEPTH_8U, IPL_DEPTH_32F) which is the number
203 int Depth() const;
239 assert(!img || img->depth == Depth());
243 assert(!image || image->depth == Depth());
286 assert(!image || image->depth == WImage<T>::Depth());
494 // Specializations for depth
496 inline int WImage<uchar>::Depth() const {return IPL_DEPTH_8U;
    [all...]
  /external/vulkan-validation-layers/libs/glm/gtx/
norm.hpp 113 unsigned int Depth);
120 unsigned int Depth);
  /external/mesa3d/src/mesa/swrast/
s_texture.c 71 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);
337 GLsizei height, GLsizei depth)
  /external/libxml2/
regressions.py 263 if reader.Depth() == 2:
269 elif reader.Depth() == 3:
296 if reader.Depth() == 2:
304 elif reader.Depth() == 3:
316 if reader.Depth() == 0:
318 if reader.Depth() != 1:
320 reader.Depth(), reader.NodeType(), reader.Name())
  /external/mesa3d/src/mesa/drivers/dri/nouveau/
nv04_state_raster.c 147 /* Depth test. */
148 if (ctx->Depth.Test)
150 if (ctx->Depth.Mask)
153 nv04->ctrl[0] |= get_comparison_op(ctx->Depth.Func) << 16;

Completed in 1003 milliseconds

1 2 3 4 5 6 7 8 9