Searched defs:stack (Results 126 - 150 of 419) sorted by relevance

1234567891011>>

/external/chromium_org/chrome/browser/ui/panels/
H A Dpanel_resize_browsertest.cc516 StackedPanelCollection* stack = panel_manager->CreateStack(); local
518 Panel* panel1 = CreateStackedPanel("1", panel1_initial_bounds, stack);
520 Panel* panel2 = CreateStackedPanel("2", panel2_initial_bounds, stack);
522 Panel* panel3 = CreateStackedPanel("3", panel3_initial_bounds, stack);
525 ASSERT_EQ(3, stack->num_panels());
H A Dstacked_panel_browsertest.cc24 StackedPanelCollection* stack = panel_manager->CreateStack(); local
26 Panel* panel1 = CreateStackedPanel("1", panel1_initial_bounds, stack);
28 Panel* panel2 = CreateStackedPanel("2", panel2_initial_bounds, stack);
30 Panel* panel3 = CreateStackedPanel("3", panel3_initial_bounds, stack);
39 // Check that all 3 panels are in a stack.
43 ASSERT_EQ(3, stack->num_panels());
44 EXPECT_EQ(stack, panel1->stack());
45 EXPECT_EQ(stack, panel2->stack());
118 StackedPanelCollection* stack = panel_manager->CreateStack(); local
215 StackedPanelCollection* stack = panel_manager->CreateStack(); local
298 StackedPanelCollection* stack = panel_manager->CreateStack(); local
345 StackedPanelCollection* stack = panel_manager->CreateStack(); local
452 StackedPanelCollection* stack = panel_manager->CreateStack(); local
500 StackedPanelCollection* stack = panel_manager->CreateStack(); local
575 StackedPanelCollection* stack = panel_manager->CreateStack(); local
601 StackedPanelCollection* stack = panel_manager->CreateStack(); local
817 StackedPanelCollection* stack = panel_manager->stacks().front(); local
844 StackedPanelCollection* stack = panel_manager->stacks().front(); local
859 StackedPanelCollection* stack = panel_manager->CreateStack(); local
930 StackedPanelCollection* stack = panel_manager->stacks().front(); local
946 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1152 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1185 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1249 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1284 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1310 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1351 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1379 StackedPanelCollection* stack = panel_manager->CreateStack(); local
1444 StackedPanelCollection* stack = panel_manager->CreateStack(); local
[all...]
/external/chromium_org/content/renderer/pepper/
H A Dv8_var_converter.cc8 #include <stack>
42 // Used to track parent nodes on the stack while traversing the graph.
314 // To/FromV8Value use a stack-based DFS search to traverse V8/Var graph. Each
315 // iteration, the top node on the stack examined. If the node has not been
320 // Otherwise, if they can have children, we add them to the stack. If the
321 // node at the top of the stack has already been visited, then we pop it off the
322 // stack and erase it from the list of parents.
334 std::stack<StackEntry<PP_Var> > stack; local
335 stack
486 std::stack<StackEntry<v8::Handle<v8::Value> > > stack; local
[all...]
/external/chromium_org/extensions/browser/
H A Dfile_highlighter.cc7 #include <stack>
62 std::stack<char> stack; local
67 stack.push(']');
69 stack.push('}');
70 else if (!stack.empty() && c == stack.top())
71 stack.pop();
74 } while (!stack.empty() && *index < end);
/external/chromium_org/native_client_sdk/src/libraries/error_handling/
H A Derror_handling.c40 void* stack; member in struct:__anon8910
82 /* Capture the stack, no mare than 128 bytes to keep the size sane. */
149 munmap(info->stack, info->size);
212 // Create a TLS key for storing per thread stack info
218 void* stack; local
222 // Set the stack size
226 // Allocate stack + guard page
227 stack = mmap(NULL, stack_size + PAGE_CHUNK_SIZE,
229 if (MAP_FAILED == stack) return MAP_FAILED;
232 guard = mmap(stack, PAGE_CHUNK_SIZ
[all...]
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dcodegen_unittest.cc275 std::vector<Instruction*> stack; local
289 stack.push_back(insn->jf_ptr);
294 if (stack.empty()) {
297 insn = stack.back();
298 stack.pop_back();
390 std::vector<BasicBlock*> stack; local
421 stack.push_back(all_blocks[insn->jf_ptr]);
426 if (stack.empty()) {
429 bb = stack.back();
430 stack
[all...]
/external/chromium_org/third_party/WebKit/Source/bindings/modules/v8/
H A DIDBBindingUtilities.cpp170 static IDBKey* createIDBKeyFromValue(v8::Isolate* isolate, v8::Handle<v8::Value> value, Vector<v8::Handle<v8::Array> >& stack, bool allowExperimentalTypes = false) argument
189 if (stack.contains(array))
191 if (stack.size() >= maximumDepth)
193 stack.append(array);
199 IDBKey* subkey = createIDBKeyFromValue(isolate, item, stack, allowExperimentalTypes);
206 stack.removeLast();
214 Vector<v8::Handle<v8::Array> > stack; local
215 if (IDBKey* key = createIDBKeyFromValue(isolate, value, stack, allowExperimentalTypes))
/external/chromium_org/third_party/WebKit/Source/core/inspector/
H A DPromiseTracker.cpp238 RefPtrWillBeRawPtr<ScriptCallStack> stack = createScriptCallStack(1, true); local
239 if (stack && stack->size())
240 data->m_callStack = stack;
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DAssertions.cpp227 void WTFGetBacktrace(void** stack, int* size) argument
230 *size = backtrace(stack, *size);
244 *size = captureStackBackTraceFunc(0, *size, stack, 0);
255 // Use alloca to allocate on the stack since this function is used in OOM situations.
286 void WTFPrintBacktrace(void** stack, int size) argument
289 FrameToNameScope frameToName(stack[i]);
292 printf_stderr_common("%-3d %p %s\n", frameNumber, stack[i], frameToName.nullableName());
294 printf_stderr_common("%-3d %p\n", frameNumber, stack[i]);
340 // Needed otherwise we are going to dump the stack trace twice
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DValidateLimitations.cpp28 ValidateConstIndexExpr(TLoopStack& stack) argument
29 : mValid(true), mLoopStack(stack) {}
/external/chromium_org/third_party/boringssl/src/crypto/bn/
H A Dctx.c63 /* The stack frame info is resizing, set a first-time expansion size; */
91 /* A wrapper to manage the "stack frames" */
93 /* Array of indexes into the bignum stack */
95 /* Number of stack frames, and the size of the allocated array */
112 /* The "stack frames", if you will */
113 BN_STACK stack; member in struct:bignum_ctx
116 /* Depth of stack overflow */
131 BN_STACK_init(&ret->stack);
143 BN_STACK_finish(&ctx->stack);
152 } else if (!BN_STACK_push(&ctx->stack, ct
[all...]
/external/chromium_org/third_party/freetype/src/cff/
H A Dcffgload.h160 FT_Fixed stack[CFF_MAX_OPERANDS + 1]; member in struct:CFF_Decoder_
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.cpp26 #include <stack>
171 std::stack<const Node *> stack; local
175 stack.push(node);
177 while (!stack.empty()) {
178 pos = stack.top();
179 stack.pop();
190 stack.push(ei.getNode());
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dmatrix.c62 * the top matrix of the current matrix stack and sets
104 * the top matrix of the current matrix stack and sets
136 * Set the current matrix stack.
138 * \param mode matrix stack.
144 * with the specified matrix stack.
232 * Push the current matrix stack.
236 * Verifies the current matrix stack is not full, and duplicates the top-most
237 * matrix in the stack.
238 * Marks __struct gl_contextRec::NewState with the stack dirty flag.
244 struct gl_matrix_stack *stack local
284 struct gl_matrix_stack *stack = ctx->CurrentStack; local
665 init_matrix_stack( struct gl_matrix_stack *stack, GLuint maxDepth, GLuint dirtyFlag ) argument
[all...]
/external/chromium_org/third_party/speex/libspeex/
H A Dcb_search.c53 static void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack) argument
111 char *stack,
153 compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack);
160 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
162 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
234 syn_percep_zero16(r2, ak, awk1, awk2, r2, nsf,p, stack);
253 char *stack,
297 split_cb_search_shape_sign_N1(target,ak,awk1,awk2,par,p,nsf,exc,r,bits,stack,update_target);
351 compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack);
381 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack);
100 split_cb_search_shape_sign_N1( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int update_target ) argument
242 split_cb_search_shape_sign( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int complexity, int update_target ) argument
514 split_cb_shape_sign_unquant( spx_sig_t *exc, const void *par, int nsf, SpeexBits *bits, char *stack, spx_int32_t *seed ) argument
572 noise_codebook_quant( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int complexity, int update_target ) argument
599 noise_codebook_unquant( spx_sig_t *exc, const void *par, int nsf, SpeexBits *bits, char *stack, spx_int32_t *seed ) argument
[all...]
H A Dsb_celp.h58 char *stack; /**< Temporary allocation stack */ member in struct:SBEncState
111 char *stack; member in struct:SBDecState
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dcommon.h264 void* stack[kMaxStackDepth]; member in struct:tcmalloc::StackTrace
H A Dprofiledata.cc75 memcpy(&evict_[num_evicted_], entry.stack, d * sizeof(Slot));
260 void ProfileData::Add(int depth, const void* const* stack) { argument
271 Slot slot = reinterpret_cast<Slot>(stack[i]);
286 if (e->stack[i] != reinterpret_cast<Slot>(stack[i])) {
316 e->stack[i] = reinterpret_cast<Slot>(stack[i]);
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dcommon.h241 void* stack[kMaxStackDepth]; member in struct:tcmalloc::StackTrace
H A Dprofiledata.cc75 memcpy(&evict_[num_evicted_], entry.stack, d * sizeof(Slot));
260 void ProfileData::Add(int depth, const void* const* stack) { argument
271 Slot slot = reinterpret_cast<Slot>(stack[i]);
286 if (e->stack[i] != reinterpret_cast<Slot>(stack[i])) {
316 e->stack[i] = reinterpret_cast<Slot>(stack[i]);
/external/chromium_org/ui/views/widget/desktop_aura/
H A Dx11_topmost_window_finder_interactive_uitest.cc97 std::vector<XID> stack; variable
98 ui::GetXWindowStack(ui::GetX11RootWindow(), &stack); variable
101 stack.begin(), stack.end(), expected_windows_[i]);
102 if (it == stack.end())
/external/chromium_org/v8/src/compiler/
H A Dinstruction-selector-unittest.cc303 Node* stack = m.NewNode(m.common()->StateValues(0)); local
308 locals, stack, context_dummy, m.UndefinedConstant());
343 Node* stack = m.NewNode(m.common()->StateValues(1), m.Int32Constant(45)); local
348 parameters, locals, stack, context_sentinel, m.UndefinedConstant());
421 Node* stack = m.NewNode(m.common()->StateValues(1), m.Int32Constant(65)); local
424 parameters, locals, stack, context, m.UndefinedConstant());
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-codegen-deopt.cc145 Node* stack = m.NewNode(common.StateValues(0)); local
149 locals, stack, caller_context_node, m.UndefinedConstant());
259 Node* stack = m.NewNode(common.StateValues(0)); local
263 locals, stack, context_node, m.UndefinedConstant());
/external/compiler-rt/lib/asan/
H A Dasan_thread.h100 // True is this thread is currently unwinding stack (i.e. collecting a stack
147 StackTrace *stack; member in struct:__asan::CreateThreadContextArgs
/external/compiler-rt/lib/lsan/
H A Dlsan_allocator.cc60 static void RegisterAllocation(const StackTrace &stack, void *p, uptr size) { argument
65 m->stack_trace_id = StackDepotPut(stack.trace, stack.size);
77 void *Allocate(const StackTrace &stack, uptr size, uptr alignment, argument
89 RegisterAllocation(stack, p, size);
98 void *Reallocate(const StackTrace &stack, void *p, uptr new_size, argument
107 RegisterAllocation(stack, p, new_size);

Completed in 3871 milliseconds

1234567891011>>