Lines Matching defs:stack
424 ZoneForwardList<Handle<SourceTextModule>>* stack, Status new_status) {
427 // {module} is on the {stack}.
428 std::count_if(stack->begin(), stack->end(),
436 ancestor = stack->front();
437 stack->pop_front();
455 ZoneForwardList<Handle<SourceTextModule>>* stack, unsigned* dfs_index,
468 stack->push_front(module);
476 if (!Module::FinishInstantiate(isolate, requested_module, stack, dfs_index,
484 // {requested_module} is instantiating iff it's on the {stack}.
486 std::count_if(stack->begin(), stack->end(), [&](Handle<Module> m) {
535 return MaybeTransitionComponent(isolate, module, stack, kLinked);
690 // 5. Let stack be a new empty List.
692 ZoneForwardList<Handle<SourceTextModule>> stack(&zone);
702 // 8. Let result be InnerModuleEvaluation(module, stack, 0).
705 if (!InnerModuleEvaluation(isolate, module, &stack, &dfs_index)
707 // a. For each Cyclic Module Record m in stack, do
708 for (auto& descendant : stack) {
744 // c. Assert: stack is empty.
745 DCHECK(stack.empty());
1020 ZoneForwardList<Handle<SourceTextModule>>* stack, unsigned* dfs_index) {
1023 // InnerModuleEvaluation(module, stack, index)
1060 // 11. Append module to stack.
1061 stack->push_front(module);
1077 InnerModuleEvaluation(isolate, required_module, stack, dfs_index),
1088 // only if requiredModule is in stack.
1091 std::count_if(stack->begin(), stack->end(), [&](Handle<Module> m) {
1174 CHECK(MaybeTransitionComponent(isolate, module, stack, kEvaluated));