Home
last modified time | relevance | path

Searched refs:kStackSize (Results 1 – 15 of 15) sorted by relevance

/external/compiler-rt/test/asan/TestCases/Linux/
Dswapcontext_annotation.cc26 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()
Dswapcontext_test.cc18 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()
Dclone_test.cc24 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/
Dswapcontext.cc17 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/
Dstack-use-after-return.cc28 #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/
Drbbiscan.h49 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
Drbbiscan.cpp1086 if (fStackPtr >= kStackSize) { in parse()
1172 if (fNodeStackPtr >= kStackSize - 1) { in pushNewNode()
/external/icu/icu4c/source/i18n/
Dregexcmp.h48 kStackSize = 100 // The size of the state stack for enumerator
163 uint16_t fStack[kStackSize]; // State stack, holds state pushes
Dregexcmp.cpp247 if (fStackPtr >= kStackSize) { in compile()
/external/v8/src/objects/
Dstring.h876 static const int kStackSize = 32;
878 static const int kDepthMask = kStackSize - 1;
879 static_assert(base::bits::IsPowerOfTwo(kStackSize),
887 inline bool StackBlown() { return maximum_depth_ - depth_ == kStackSize; } in StackBlown()
895 ConsString* frames_[kStackSize];
/external/icu/android_icu4j/src/main/java/android/icu/text/
DRBBIRuleScanner.java27 private final static int kStackSize = 100; // The size of the state stack for field in RBBIRuleScanner
55 short fStack[] = new short[kStackSize]; // State stack, holds state pushes
59 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
944 if (fStackPtr >= kStackSize) { in parse()
1027 if (fNodeStackPtr >= kStackSize) { in pushNewNode()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DRBBIRuleScanner.java26 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
943 if (fStackPtr >= kStackSize) { in parse()
1026 if (fNodeStackPtr >= kStackSize) { in pushNewNode()
/external/libchrome/base/debug/
Dactivity_tracker_unittest.cc49 const int kStackSize = 1 << 10; // 1KiB member in base::debug::ActivityTrackerTest
64 std::unique_ptr<char[]> memory(new char[kStackSize]); in CreateActivityTracker()
65 return std::make_unique<TestActivityTracker>(std::move(memory), kStackSize); in CreateActivityTracker()
/external/compiler-rt/lib/msan/tests/
Dmsan_test.cc3076 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/
Dobjects.cc11220 maximum_depth_ = kStackSize + depth_; in Initialize()