| /external/compiler-rt/test/asan/TestCases/Linux/ |
| D | swapcontext_test.cc | 18 const int kStackSize = 1 << 20; variable
54 child_context.uc_stack.ss_size = kStackSize / 2; in Run()
64 for (int i = 0; i < kStackSize; i++) { in Run()
71 char stack[kStackSize + 1]; in main()
80 char *heap = new char[kStackSize + 1]; in main()
|
| D | swapcontext_annotation.cc | 26 const int kStackSize = 1 << 20; variable
85 next_child_context.uc_stack.ss_size = kStackSize / 2; in Child()
102 child_context.uc_stack.ss_size = kStackSize / 2; in Run()
120 for (int i = 0; i < kStackSize; i++) { in Run()
157 char *heap = new char[kStackSize + 1]; in main()
158 next_child_stack = new char[kStackSize + 1]; in main()
159 char stack[kStackSize + 1]; in main()
|
| D | clone_test.cc | 24 const int kStackSize = 1 << 20; in main() local
25 char __attribute__((aligned(16))) child_stack[kStackSize + 1]; in main()
26 char *sp = child_stack + kStackSize; // Stack grows down. in main()
37 for (int i = 0; i < kStackSize; i++) in main()
|
| /external/compiler-rt/test/lsan/TestCases/ |
| D | swapcontext.cc | 17 const int kStackSize = 1 << 20; variable
26 char stack_memory[kStackSize + 1]; in main()
27 char *heap_memory = new char[kStackSize + 1]; in main()
35 child_context.uc_stack.ss_size = kStackSize / 2; in main()
|
| /external/compiler-rt/test/asan/TestCases/Posix/ |
| D | stack-use-after-return.cc | 28 #ifndef kStackSize
29 # define kStackSize 0 macro
69 if (kStackSize > 0) in main()
70 pthread_attr_setstacksize(&attr, kStackSize); in main()
|
| /external/icu/icu4c/source/common/ |
| D | rbbiscan.h | 49 kStackSize = 100 // The size of the state stack for enumerator
117 uint16_t fStack[kStackSize]; // State stack, holds state pushes
121 RBBINode *fNodeStack[kStackSize]; // Node stack, holds nodes created
|
| D | rbbiscan.cpp | 1080 if (fStackPtr >= kStackSize) { in parse()
1183 if (fNodeStackPtr >= kStackSize) { in pushNewNode()
|
| /external/icu/icu4c/source/i18n/ |
| D | regexcmp.h | 48 kStackSize = 100 // The size of the state stack for enumerator
163 uint16_t fStack[kStackSize]; // State stack, holds state pushes
|
| D | regexcmp.cpp | 246 if (fStackPtr >= kStackSize) { in compile()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | RBBIRuleScanner.java | 25 private final static int kStackSize = 100; // The size of the state stack for field in RBBIRuleScanner
53 short fStack[] = new short[kStackSize]; // State stack, holds state pushes
57 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
935 if (fStackPtr >= kStackSize) { in parse()
1030 if (fNodeStackPtr >= kStackSize) { in pushNewNode()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | RBBIRuleScanner.java | 26 private final static int kStackSize = 100; // The size of the state stack for field in RBBIRuleScanner
54 short fStack[] = new short[kStackSize]; // State stack, holds state pushes
58 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
936 if (fStackPtr >= kStackSize) { in parse()
1031 if (fNodeStackPtr >= kStackSize) { in pushNewNode()
|
| /external/compiler-rt/lib/msan/tests/ |
| D | msan_test.cc | 3076 const size_t kStackSize = SMALLPRESTACKSIZE; in TEST() local
3077 res = posix_memalign(&stack, 4096, kStackSize); in TEST()
3079 res = pthread_attr_setstack(&attr, stack, kStackSize); in TEST()
|
| /external/v8/src/ |
| D | objects.h | 10025 static const int kStackSize = 32;
10027 static const int kDepthMask = kStackSize-1;
10028 STATIC_ASSERT(IS_POWER_OF_TWO(kStackSize));
10035 inline bool StackBlown() { return maximum_depth_ - depth_ == kStackSize; } in StackBlown()
10043 ConsString* frames_[kStackSize];
|
| D | objects.cc | 10606 maximum_depth_ = kStackSize + depth_; in Initialize()
|