Home
last modified time | relevance | path

Searched refs:node_ (Results 1 – 25 of 25) sorted by relevance

/external/v8/src/
Deffects.h233 explicit NestedEffectsBase(Zone* zone) : node_(new(zone) Node(zone)) {} in NestedEffectsBase()
237 if (node_->previous) NestedEffectsBase(node_->previous).ForEach(callback); in ForEach()
238 node_->effects.ForEach(callback); in ForEach()
241 Effects<Var, kNoVar> Top() { return node_->effects; } in Top()
244 for (Node* node = node_; node != NULL; node = node->previous) { in IsEmpty()
253 Zone* zone() { return node_->zone; } in zone()
255 void push() { node_ = new(node_->zone) Node(node_->zone, node_); } in push()
256 void pop() { node_ = node_->previous; } in pop()
257 bool is_empty() { return node_ == NULL; } in is_empty()
261 for (Node* node = node_; node != NULL; node = node->previous) { in Contains()
[all …]
Dsplay-tree.h138 explicit Locator(Node* node) : node_(node) { } in Locator()
139 Locator() : node_(NULL) { } in Locator()
140 const Key& key() { return node_->key_; } in key()
141 Value& value() { return node_->value_; } in value()
142 void set_value(const Value& value) { node_->value_ = value; } in set_value()
143 inline void bind(Node* node) { node_ = node; } in bind()
146 Node* node_;
Dglobal-handles.h377 : node_(node), callback_(callback), parameter_(parameter) { in PendingPhantomCallback()
385 Node* node() { return node_; } in node()
389 Node* node_;
Dglobal-handles.cc1048 if (node_ != nullptr) { in Invoke()
1050 DCHECK(node_->state() == Node::NEAR_DEATH); in Invoke()
1058 if (node_ != nullptr) { in Invoke()
1060 DCHECK(node_->state() == Node::FREE); in Invoke()
1061 node_ = nullptr; in Invoke()
/external/compiler-rt/lib/msan/
Dmsan_chained_origin_depot.cc89 ChainedOriginDepotNode *node_; member
90 Handle() : node_(nullptr) {} in Handle()
91 explicit Handle(ChainedOriginDepotNode *node) : node_(node) {} in Handle()
92 bool valid() { return node_; } in valid()
93 u32 id() { return node_->id; } in id()
94 int here_id() { return node_->here_id; } in here_id()
95 int prev_id() { return node_->prev_id; } in prev_id()
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_stackdepot.h26 StackDepotNode *node_; member
27 StackDepotHandle() : node_(nullptr) {} in StackDepotHandle()
28 explicit StackDepotHandle(StackDepotNode *node) : node_(node) {} in StackDepotHandle()
29 bool valid() { return node_; } in valid()
Dsanitizer_stackdepot.cc90 u32 StackDepotHandle::id() { return node_->id; } in id()
92 return atomic_load(&node_->hash_and_use_count, memory_order_relaxed) & in use_count()
97 atomic_fetch_add(&node_->hash_and_use_count, 1, memory_order_relaxed) & in inc_use_count_unsafe()
/external/v8/src/compiler/
Djs-typed-lowering.cc32 : lowering_(lowering), node_(node) {} in JSBinopReduction()
36 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in GetCompareNumberOperationHint()
37 switch (CompareOperationHintOf(node_->op())) { in GetCompareNumberOperationHint()
60 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsInternalizedStringCompareOperation()
61 return (CompareOperationHintOf(node_->op()) == in IsInternalizedStringCompareOperation()
70 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsReceiverCompareOperation()
71 return (CompareOperationHintOf(node_->op()) == in IsReceiverCompareOperation()
80 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsStringCompareOperation()
81 return (CompareOperationHintOf(node_->op()) == in IsStringCompareOperation()
92 DCHECK_EQ(IrOpcode::kJSAdd, node_->opcode()); in ShouldCreateConsString()
[all …]
Dliveness-analyzer.h120 return node_; in node()
127 explicit Entry(Node* node) : kind_(kCheckpoint), var_(-1), node_(node) {} in Entry()
128 Entry(Kind kind, int var) : kind_(kind), var_(var), node_(nullptr) { in Entry()
135 Node* node_; variable
Dstate-values-utils.h120 explicit StateValuesAccess(Node* node) : node_(node) {} in StateValuesAccess()
123 iterator begin() { return iterator(node_); } in begin()
127 Node* node_;
Dnode.h128 explicit UseEdges(Node* node) : node_(node) {} in UseEdges()
131 Node* node_;
146 explicit Uses(Node* node) : node_(node) {} in Uses()
149 Node* node_;
172 Node* node_; member
202 : reinterpret_cast<OutOfLineInputs*>(start)->node_; in from()
578 return Node::UseEdges::iterator(this->node_); in begin()
623 return const_iterator(this->node_); in begin()
Dinstruction-selector.h35 PushParameter() : node_(nullptr), type_(MachineType::None()) {} in PushParameter()
36 PushParameter(Node* node, MachineType type) : node_(node), type_(type) {} in PushParameter()
38 Node* node() const { return node_; } in node()
42 Node* node_;
Dnode-matchers.h24 explicit NodeMatcher(Node* node) : node_(node) {} in NodeMatcher()
26 Node* node() const { return node_; } in node()
35 bool Equals(const Node* node) const { return node_ == node; } in Equals()
45 Node* node_;
Dnode.cc80 outline->node_ = node; in New()
158 outline->node_ = this; in AppendInput()
168 outline->node_ = this; in AppendInput()
Djs-builtin-reducer.cc28 explicit JSCallReduction(Node* node) : node_(node) {} in JSCallReduction()
33 if (node_->opcode() != IrOpcode::kJSCall) return false; in HasBuiltinFunctionId()
34 HeapObjectMatcher m(NodeProperties::GetValueInput(node_, 0)); in HasBuiltinFunctionId()
42 DCHECK_EQ(IrOpcode::kJSCall, node_->opcode()); in GetBuiltinFunctionId()
43 HeapObjectMatcher m(NodeProperties::GetValueInput(node_, 0)); in GetBuiltinFunctionId()
78 Node* receiver() { return NodeProperties::GetValueInput(node_, 1); } in receiver()
83 DCHECK_EQ(IrOpcode::kJSCall, node_->opcode()); in GetJSCallArity()
85 return node_->op()->ValueInputCount() - 2; in GetJSCallArity()
89 DCHECK_EQ(IrOpcode::kJSCall, node_->opcode()); in GetJSCallInput()
92 return NodeProperties::GetValueInput(node_, index + 2); in GetJSCallInput()
[all …]
Dstate-values-utils.cc416 SparseInputMask mask = SparseInputMaskOf(node_->op()); in size()
418 SparseInputMask::InputIterator iterator = mask.IterateOverInputs(node_); in size()
/external/webrtc/webrtc/libjingle/xmpp/
Dpubsubclient.cc24 new PubSubRequestTask(parent_, pubsubjid_, node_); in RequestItems()
29 new PubSubReceiveTask(parent_, pubsubjid_, node_); in RequestItems()
47 new PubSubPublishTask(parent_, pubsubjid_, node_, itemid, children); in PublishItem()
59 new PubSubRetractTask(parent_, pubsubjid_, node_, itemid); in RetractItem()
Dpubsubclient.h43 node_(node) {} in PubSubClient()
45 const std::string& node() const { return node_; } in node()
106 std::string node_; variable
Dpubsubtasks.h54 node_(node) { in PubSubReceiveTask()
67 std::string node_; variable
Dpubsubtasks.cc168 IsPubSubEventItemsElem(stanza, node_) && !SignalUpdate.is_empty(); in WantsStanza()
/external/protobuf/src/google/protobuf/
Dmap.h773 iterator_base() : node_(NULL) {} in iterator_base()
784 : node_(it.node_), in iterator_base()
790 : node_(n), in iterator_base()
795 : node_(NodePtrFromKeyPtr(*tree_it)), in iterator_base()
808 node_ = NULL; in SearchFrom()
812 node_ = static_cast<Node*>(m_->table_[bucket_index_]); in SearchFrom()
818 node_ = NodePtrFromKeyPtr(*tree_it_); in SearchFrom()
824 reference operator*() const { return node_->kv; }
828 return a.node_ == b.node_;
831 return a.node_ != b.node_;
[all …]
/external/libmojo/mojo/edk/system/
Dnode_controller.cc143 node_(new ports::Node(name_, this)) { in NodeController()
224 node_->ClosePort(port); in CloseChildPorts()
260 node_->SetUserData(port, observer); in SetPortObserver()
265 int rv = node_->ClosePort(port); in ClosePort()
274 int rv = node_->SendMessage(port, std::move(ports_message)); in SendMessage()
302 node_->MergePorts(port, name_, it->second.port.name()); in MergePortIntoParent()
329 node_->ClosePort(port); in MergePortIntoParent()
341 int rv = node_->MergeLocalPorts(port0, port1); in MergeLocalPorts()
575 node_->ClosePort(port); in DropPeer()
577 node_->LostConnectionToNode(name); in DropPeer()
[all …]
Dnode_controller.h60 ports::Node* node() const { return node_.get(); } in node()
228 const std::unique_ptr<ports::Node> node_; variable
/external/deqp/framework/common/
DtcuTestHierarchyIterator.hpp149 NodeIter (TestNode* node_) in NodeIter()
150 : node (node_) in NodeIter()
/external/v8/src/regexp/
Djsregexp.h876 explicit GuardedAlternative(RegExpNode* node) : node_(node), guards_(NULL) { } in GuardedAlternative()
878 RegExpNode* node() { return node_; } in node()
879 void set_node(RegExpNode* node) { node_ = node; } in set_node()
883 RegExpNode* node_;