Lines Matching refs:stack
166 // from the previous stack-based implementation.
251 // Followed by stack: string.
557 // If we are at the end of the stack, abort. This function may recurse.
974 Handle<Object> stack;
1031 .ToHandle(&stack)) {
1034 if (stack->IsString()) {
1036 WriteString(Handle<String>::cast(stack));
1400 // errors for stack overflows, though, and in that case we won't retry.
1418 // If we are at the end of the stack, abort. This function may recurse.
1664 // If we are at the end of the stack, abort. This function may recurse.
1687 // If we are at the end of the stack, abort. This function may recurse.
1716 // If we are at the end of the stack, abort. This function may recurse.
1862 // If we are at the end of the stack, abort. This function may recurse.
1903 // If we are at the end of the stack, abort. This function may recurse.
2080 Handle<Object> stack = isolate_->factory()->undefined_value();
2136 stack = stack_string;
2155 ErrorUtils::SetFormattedStack(isolate_, error, stack);
2478 std::vector<Handle<Object>> stack;
2488 // JS Object: Read the last 2*n values from the stack and use them as
2492 stack.size() / 2 < num_properties) {
2499 stack.size() - 2 * static_cast<size_t>(num_properties);
2504 isolate_, js_object, &stack[begin_properties], num_properties)
2510 stack.resize(begin_properties);
2517 // Sparse JS Array: Read the last 2*|num_properties| from the stack.
2522 stack.size() / 2 < num_properties) {
2532 stack.size() - 2 * static_cast<size_t>(num_properties);
2535 isolate_, js_array, &stack[begin_properties], num_properties)
2541 stack.resize(begin_properties);
2555 stack.push_back(new_object);
2566 if (stack.size() != 1) {
2571 return scope.CloseAndEscape(stack[0]);