Home
last modified time | relevance | path

Searched refs:stack_ (Results 1 - 25 of 66) sorted by relevance

123

/third_party/node/deps/v8/third_party/inspector_protocol/crdtp/
H A Derror_support.cc12 stack_.emplace_back(); in Push()
16 stack_.pop_back(); in Pop()
20 assert(!stack_.empty()); in SetName()
21 stack_.back().type = NAME; in SetName()
22 stack_.back().name = name; in SetName()
26 assert(!stack_.empty()); in SetIndex()
27 stack_.back().type = INDEX; in SetIndex()
28 stack_.back().index = index; in SetIndex()
32 assert(!stack_.empty()); in AddError()
35 for (size_t ii = 0; ii < stack_ in AddError()
[all...]
H A Derror_support.h56 std::vector<Segment> stack_; member in v8_crdtp::ErrorSupport
/third_party/icu/icu4c/source/common/
H A Dbytestrieiterator.cpp30 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
34 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into in Iterator()
41 stack_=new UVector32(errorCode); in Iterator()
42 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) { in Iterator()
52 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
57 stack_=new UVector32(errorCode); in Iterator()
61 if(str_==NULL || stack_==NULL) { in Iterator()
80 delete stack_; in ~Iterator()
94 stack_->setSize(0); in reset()
99 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_
[all...]
H A Ducharstrieiterator.cpp30 maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
34 // stack_ is a pointer so that it's easy to turn ucharstrie.h into in Iterator()
40 stack_=new UVector32(errorCode); in Iterator()
41 if(stack_==NULL) { in Iterator()
52 maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
56 stack_=new UVector32(errorCode); in Iterator()
60 if(stack_==NULL) { in Iterator()
78 delete stack_; in ~Iterator()
93 stack_->setSize(0); in reset()
98 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dbytestrieiterator.cpp30 str_(nullptr), maxLength_(maxStringLength), value_(0), stack_(nullptr) { in Iterator()
34 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into in Iterator()
41 stack_=new UVector32(errorCode); in Iterator()
42 if(U_SUCCESS(errorCode) && (str_==nullptr || stack_==nullptr)) { in Iterator()
52 str_(nullptr), maxLength_(maxStringLength), value_(0), stack_(nullptr) { in Iterator()
57 stack_=new UVector32(errorCode); in Iterator()
61 if(str_==nullptr || stack_==nullptr) { in Iterator()
80 delete stack_; in ~Iterator()
94 stack_->setSize(0); in reset()
99 BytesTrie::Iterator::hasNext() const { return pos_!=nullptr || !stack_
[all...]
H A Ducharstrieiterator.cpp30 maxLength_(maxStringLength), value_(0), stack_(nullptr) { in Iterator()
34 // stack_ is a pointer so that it's easy to turn ucharstrie.h into in Iterator()
40 stack_=new UVector32(errorCode); in Iterator()
41 if(stack_==nullptr) { in Iterator()
52 maxLength_(maxStringLength), value_(0), stack_(nullptr) { in Iterator()
56 stack_=new UVector32(errorCode); in Iterator()
60 if(stack_==nullptr) { in Iterator()
78 delete stack_; in ~Iterator()
93 stack_->setSize(0); in reset()
98 UCharsTrie::Iterator::hasNext() const { return pos_!=nullptr || !stack_
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dbytestrieiterator.cpp30 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
34 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into in Iterator()
41 stack_=new UVector32(errorCode); in Iterator()
42 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) { in Iterator()
52 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
57 stack_=new UVector32(errorCode); in Iterator()
61 if(str_==NULL || stack_==NULL) { in Iterator()
80 delete stack_; in ~Iterator()
94 stack_->setSize(0); in reset()
99 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_
[all...]
H A Ducharstrieiterator.cpp30 maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
34 // stack_ is a pointer so that it's easy to turn ucharstrie.h into in Iterator()
40 stack_=new UVector32(errorCode); in Iterator()
41 if(stack_==NULL) { in Iterator()
52 maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
56 stack_=new UVector32(errorCode); in Iterator()
60 if(stack_==NULL) { in Iterator()
78 delete stack_; in ~Iterator()
93 stack_->setSize(0); in reset()
98 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_
[all...]
/third_party/skia/third_party/externals/tint/src/
H A Dscope_stack.h33 stack_.push_back({}); in ScopeStack()
40 void Push() { stack_.push_back({}); } in Push()
44 if (stack_.size() > 1) { in Pop()
45 stack_.pop_back(); in Pop()
55 std::swap(val, stack_.back()[symbol]); in Set()
63 for (auto iter = stack_.rbegin(); iter != stack_.rend(); ++iter) { in Get()
75 std::vector<std::unordered_map<Symbol, T>> stack_; member in tint::ScopeStack
/third_party/protobuf/src/google/protobuf/util/internal/
H A Djson_stream_parser.cc143 stack_(), in JsonStreamParser()
162 stack_.push(VALUE); in JsonStreamParser()
200 if (stack_.empty() && leftover_.empty()) { in FinishParse()
252 if (stack_.empty()) { in ParseChunk()
263 while (!stack_.empty()) { in RunParser()
264 ParseType type = stack_.top(); in RunParser()
266 stack_.pop(); in RunParser()
302 stack_.push(type); in RunParser()
654 stack_.push(ENTRY); in HandleBeginObject()
673 stack_ in ParseObjectMid()
[all...]
H A Ddefault_value_objectwriter.cc522 stack_.push(current_); in StartObject()
528 if (stack_.empty()) { in EndObject()
533 current_ = stack_.top(); in EndObject()
534 stack_.pop(); in EndObject()
562 stack_.push(current_); in StartList()
574 if (stack_.empty()) { in EndList()
578 current_ = stack_.top(); in EndList()
579 stack_.pop(); in EndList()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles.cc355 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches member
536 r->stack_.clear(); in ForwardDFS()
537 r->stack_.push_back(n); in ForwardDFS()
538 while (!r->stack_.empty()) { in ForwardDFS()
539 n = r->stack_.back(); in ForwardDFS()
540 r->stack_.pop_back(); in ForwardDFS()
553 r->stack_.push_back(w); in ForwardDFS()
562 r->stack_.clear(); in BackwardDFS()
563 r->stack_.push_back(n); in BackwardDFS()
564 while (!r->stack_ in BackwardDFS()
[all...]
/third_party/gn/src/gn/
H A Dcommand_format.cc234 int margin() const { return stack_.back().margin; } in margin()
261 std::vector<IndentState> stack_; member in commands::__anon2874::Printer
286 stack_.push_back(IndentState()); in Printer()
360 stack_.push_back(IndentState(CurrentColumn(), false, false)); in PrintSuffixComments()
362 stack_.pop_back(); in PrintSuffixComments()
371 stack_.push_back(IndentState(CurrentColumn(), false, false)); in FlushComments()
373 stack_.pop_back(); in FlushComments()
774 if (binop->op().value() == "&&" && stack_.back().parent_is_boolean_or) { in Expr()
808 if (stack_.back().continuation_requires_indent) in Expr()
811 stack_ in Expr()
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dgraph-reducer.cc50 stack_(zone), in GraphReducer()
68 DCHECK(stack_.empty()); in ReduceNode()
72 if (!stack_.empty()) { in ReduceNode()
93 DCHECK(stack_.empty()); in ReduceNode()
149 NodeState& entry = stack_.top(); in ReduceTop()
290 Node* node = stack_.top().node; in Pop()
292 stack_.pop(); in Pop()
299 stack_.push({node, 0}); in Push()
H A Dscheduler.cc684 stack_(zone), in SpecialRPONumberer()
766 stack_[depth].block = child; in Push()
767 stack_[depth].index = 0; in Push()
812 stack_.resize(schedule_->BasicBlockCount() - previous_block_count_); in ComputeAndInsertSpecialRPO()
819 SpecialRPOStackFrame* frame = &stack_[current]; in ComputeAndInsertSpecialRPO()
850 ComputeLoopInfo(&stack_, num_loops, &backedges_); in ComputeAndInsertSpecialRPO()
863 SpecialRPOStackFrame* frame = &stack_[stack_depth - 1]; in ComputeAndInsertSpecialRPO()
1150 ZoneVector<SpecialRPOStackFrame> stack_; member in v8::internal::compiler::SpecialRPONumberer
1322 stack_(zone) {} in PrepareUsesVisitor()
1326 while (!stack_ in Run()
1383 ZoneStack<Node*> stack_; global() member in v8::internal::compiler::PrepareUsesVisitor
[all...]
H A Descape-analysis.cc299 stack_(zone), in EffectGraphReducer()
307 DCHECK(stack_.empty()); in ReduceFrom()
308 stack_.push({node, 0}); in ReduceFrom()
309 while (!stack_.empty()) { in ReduceFrom()
311 Node* current = stack_.top().node; in ReduceFrom()
312 int& input_index = stack_.top().input_index; in ReduceFrom()
327 stack_.push({input, 0}); in ReduceFrom()
332 stack_.pop(); in ReduceFrom()
352 stack_.push({revisit, 0}); in ReduceFrom()
H A Descape-analysis.h61 bool Complete() { return stack_.empty() && revisit_.empty(); } in Complete()
76 ZoneStack<NodeState> stack_; member in v8::internal::compiler::EffectGraphReducer
/third_party/protobuf/src/google/protobuf/compiler/
H A Dscc.h80 std::vector<const Descriptor*> stack_; member in google::protobuf::compiler::SCCAnalyzer
98 stack_.push_back(descriptor); in DFS()
110 // Still in the stack_ so we found a back edge in DFS()
119 const Descriptor* scc_desc = stack_.back(); in DFS()
122 stack_.pop_back(); in DFS()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DBytesTrie.java609 stack_.clear(); in reset()
618 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
635 if(stack_.isEmpty()) { in next()
640 long top=stack_.remove(stack_.size()-1); in next()
716 stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length); in branchNext()
728 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length); in branchNext()
755 private ArrayList<Long> stack_=new ArrayList<>(); field in BytesTrie.Iterator
H A DCharsTrie.java525 stack_.clear(); in reset()
534 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
551 if(stack_.isEmpty()) { in next()
556 long top=stack_.remove(stack_.size()-1); in next()
651 stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length()); in branchNext()
663 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length()); in branchNext()
693 private ArrayList<Long> stack_=new ArrayList<>(); field in CharsTrie.Iterator
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DBytesTrie.java577 stack_.clear(); in reset()
585 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
601 if(stack_.isEmpty()) { in next()
606 long top=stack_.remove(stack_.size()-1); in next()
681 stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length); in branchNext()
693 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length); in branchNext()
720 private ArrayList<Long> stack_=new ArrayList<>(); field in BytesTrie.Iterator
H A DCharsTrie.java501 stack_.clear(); in reset()
509 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
525 if(stack_.isEmpty()) { in next()
530 long top=stack_.remove(stack_.size()-1); in next()
624 stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length()); in branchNext()
636 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length()); in branchNext()
666 private ArrayList<Long> stack_=new ArrayList<>(); field in CharsTrie.Iterator
/third_party/node/deps/v8/src/json/
H A Djson-stringifier.cc116 // Uses the current stack_ to provide a detailed error message of
136 std::vector<KeyObject> stack_;
221 stack_() { in JsonStringifier()
365 if (stack_.empty()) { in CurrentHolder()
372 return Handle<JSReceiver>(JSReceiver::cast(*stack_.back().second), in CurrentHolder()
388 size_t size = stack_.size(); in StackPush()
390 if (*stack_[i].second == raw_obj) { in StackPush()
401 stack_.emplace_back(key, object); in StackPush()
405 void JsonStringifier::StackPop() { stack_.pop_back(); } in StackPop()
481 DCHECK(start_index < stack_ in ConstructCircularStructureErrorMessage()
[all...]
/third_party/node/deps/v8/src/execution/
H A Dthread-local-top.cc38 stack_ = ::heap::base::Stack(nullptr); in Clear()
55 stack_ = ::heap::base::Stack(base::Stack::GetStackStart()); in Initialize()
/third_party/node/deps/v8/src/heap/cppgc/
H A Dheap-base.h122 heap::base::Stack* stack() { return stack_.get(); } in stack()
252 std::unique_ptr<heap::base::Stack> stack_; member in cppgc::internal::HeapBase

Completed in 30 milliseconds

123