| /external/libweave/src/notification/ |
| xml_node_unittest.cc | 20 return std::move(node_);
27 node_.reset(new XmlNode{node_name, std::move(attributes)});
33 node_->AddChild(std::move(stanza));
36 std::unique_ptr<XmlNode> node_; member in class:weave::__anon16744::XmlParser
45 node_.reset(
61 node_ = XmlParser{}.Parse(R"(
71 std::unique_ptr<XmlNode> node_; member in class:weave::XmlNodeTest
75 EXPECT_EQ("test_node", node_->name());
76 EXPECT_TRUE(node_->children().empty());
77 EXPECT_TRUE(node_->text().empty())
[all...] |
| xmpp_iq_stanza_handler_unittest.cc | 39 return std::move(node_);
46 node_.reset(new XmlNode{node_name, std::move(attributes)});
52 node_->AddChild(std::move(stanza));
55 std::unique_ptr<XmlNode> node_; member in class:weave::__anon16748::XmlParser
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_stackdepot.h | 26 StackDepotNode *node_; member in struct:__sanitizer::StackDepotHandle
27 StackDepotHandle() : node_(nullptr) {}
28 explicit StackDepotHandle(StackDepotNode *node) : node_(node) {}
29 bool valid() { return node_; }
|
| sanitizer_stackdepot.cc | 90 u32 StackDepotHandle::id() { return node_->id; }
92 return atomic_load(&node_->hash_and_use_count, memory_order_relaxed) &
97 atomic_fetch_add(&node_->hash_and_use_count, 1, memory_order_relaxed) &
|
| /external/compiler-rt/lib/msan/ |
| msan_chained_origin_depot.cc | 89 ChainedOriginDepotNode *node_; member in struct:__msan::ChainedOriginDepotNode::Handle
90 Handle() : node_(nullptr) {}
91 explicit Handle(ChainedOriginDepotNode *node) : node_(node) {}
92 bool valid() { return node_; }
93 u32 id() { return node_->id; }
94 int here_id() { return node_->here_id; }
95 int prev_id() { return node_->prev_id; }
|
| /external/v8/src/ |
| effects.h | 233 explicit NestedEffectsBase(Zone* zone) : node_(new(zone) Node(zone)) {}
237 if (node_->previous) NestedEffectsBase(node_->previous).ForEach(callback);
238 node_->effects.ForEach(callback);
241 Effects<Var, kNoVar> Top() { return node_->effects; }
244 for (Node* node = node_; node != NULL; node = node->previous) {
253 Zone* zone() { return node_->zone; }
255 void push() { node_ = new(node_->zone) Node(node_->zone, node_);
288 Node* node_; member in class:v8::internal::NestedEffectsBase
[all...] |
| splay-tree.h | 138 explicit Locator(Node* node) : node_(node) { }
139 Locator() : node_(NULL) { }
140 const Key& key() { return node_->key_; }
141 Value& value() { return node_->value_; }
142 void set_value(const Value& value) { node_->value_ = value; }
143 inline void bind(Node* node) { node_ = node; }
146 Node* node_; member in class:v8::internal::SplayTree::BASE_EMBEDDED
|
| global-handles.h | 373 : node_(node), callback_(callback), parameter_(parameter) {
381 Node* node() { return node_; }
385 Node* node_; member in class:v8::internal::GlobalHandles::PendingPhantomCallback
|
| /system/core/libmemunreachable/ |
| LinkedList.h | 53 LinkedListHead() : node_() {}
57 LinkedList<T> node_; member in class:LinkedListHead
|
| Allocator.cpp | 194 LinkedList<Chunk*> node_; // linked list sorted by minimum free count member in class:Chunk
243 node_(this), heap_(heap), bucket_(bucket), allocation_size_(
356 chunk->node_.remove();
361 chunk->node_.remove();
379 free_chunks_[bucket].insert(chunk->node_);
440 chunk->node_.remove();
448 node->insert(chunk->node_);
|
| /external/v8/src/compiler/ |
| node.h | 120 explicit InputEdges(Node* node) : node_(node) {}
123 Node* node_; member in class:v8::internal::compiler::final::final
138 explicit Inputs(Node* node) : node_(node) {}
141 Node* node_; member in class:v8::internal::compiler::final::final
156 explicit UseEdges(Node* node) : node_(node) {}
159 Node* node_; member in class:v8::internal::compiler::final::final
174 explicit Uses(Node* node) : node_(node) {}
177 Node* node_; member in class:v8::internal::compiler::final::final
196 Node* node_; member in struct:v8::internal::compiler::final::OutOfLineInputs
226 : reinterpret_cast<OutOfLineInputs*>(start)->node_;
[all...] |
| state-values-utils.h | 106 explicit StateValuesAccess(Node* node) : node_(node) {}
109 iterator begin() { return iterator(node_); }
113 Node* node_; member in class:v8::internal::compiler::StateValuesAccess
|
| liveness-analyzer.h | 101 return node_;
108 explicit Entry(Node* node) : kind_(kCheckpoint), var_(-1), node_(node) {}
109 Entry(Kind kind, int var) : kind_(kind), var_(var), node_(nullptr) {
116 Node* node_; member in class:v8::internal::compiler::LivenessAnalyzerBlock::Entry
|
| js-builtin-reducer.cc | 23 explicit JSCallReduction(Node* node) : node_(node) {}
28 if (node_->opcode() != IrOpcode::kJSCallFunction) return false;
29 HeapObjectMatcher m(NodeProperties::GetValueInput(node_, 0));
37 DCHECK_EQ(IrOpcode::kJSCallFunction, node_->opcode());
38 HeapObjectMatcher m(NodeProperties::GetValueInput(node_, 0));
73 DCHECK_EQ(IrOpcode::kJSCallFunction, node_->opcode());
75 return node_->op()->ValueInputCount() - 2;
79 DCHECK_EQ(IrOpcode::kJSCallFunction, node_->opcode());
82 return NodeProperties::GetValueInput(node_, index + 2);
86 Node* node_; member in class:v8::internal::compiler::JSCallReduction
[all...] |
| js-typed-lowering.cc | 28 : lowering_(lowering), node_(node) {}
35 DCHECK_NE(0, node_->op()->ControlOutputCount());
36 DCHECK_EQ(1, node_->op()->EffectOutputCount());
37 DCHECK_EQ(2, OperatorProperties::GetFrameStateInputCount(node_->op()));
38 BinaryOperationHints hints = BinaryOperationHintsOf(node_->op());
53 DCHECK_NE(0, node_->op()->ControlOutputCount());
54 DCHECK_EQ(1, node_->op()->EffectOutputCount());
55 DCHECK_EQ(2, OperatorProperties::GetFrameStateInputCount(node_->op()));
56 CompareOperationHints hints = CompareOperationHintsOf(node_->op());
78 bool handles_exception = NodeProperties::IsExceptionalCall(node_);
230 Node* node_; \/\/ The original node. member in class:v8::internal::compiler::final
[all...] |
| instruction-selector.h | 33 PushParameter() : node_(nullptr), type_(MachineType::None()) {}
34 PushParameter(Node* node, MachineType type) : node_(node), type_(type) {}
36 Node* node() const { return node_; }
40 Node* node_; member in class:v8::internal::compiler::PushParameter
|
| state-values-utils.cc | 304 for (int i = 0; i < node_->InputCount(); i++) {
305 if (node_->InputAt(i)->opcode() == IrOpcode::kStateValues ||
306 node_->InputAt(i)->opcode() == IrOpcode::kTypedStateValues) {
307 count += StateValuesAccess(node_->InputAt(i)).size();
|
| node.cc | 80 outline->node_ = node;
158 outline->node_ = this;
168 outline->node_ = this;
|
| node-matchers.h | 21 explicit NodeMatcher(Node* node) : node_(node) {}
23 Node* node() const { return node_; }
32 bool Equals(const Node* node) const { return node_ == node; }
42 Node* node_; member in struct:v8::internal::compiler::NodeMatcher
|
| /external/webrtc/webrtc/libjingle/xmpp/ |
| pubsubclient.h | 43 node_(node) {}
45 const std::string& node() const { return node_; }
106 std::string node_; member in class:buzz::PubSubClient
|
| pubsubtasks.h | 54 node_(node) {
67 std::string node_; member in class:buzz::PubSubReceiveTask
|
| pubsubclient.cc | 24 new PubSubRequestTask(parent_, pubsubjid_, node_);
29 new PubSubReceiveTask(parent_, pubsubjid_, node_);
47 new PubSubPublishTask(parent_, pubsubjid_, node_, itemid, children);
59 new PubSubRetractTask(parent_, pubsubjid_, node_, itemid);
|
| pubsubtasks.cc | 168 IsPubSubEventItemsElem(stanza, node_) && !SignalUpdate.is_empty();
|
| /external/deqp/framework/common/ |
| tcuTestHierarchyIterator.hpp | 149 NodeIter (TestNode* node_)
150 : node (node_)
|
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| map.h | 770 // node_ is always correct. This is handy because the most common
771 // operations are operator* and operator-> and they only use node_.
772 // When node_ is set to a non-NULL value, all the other non-const fields
776 iterator_base() : node_(NULL) {}
787 : node_(it.node_),
793 : node_(n),
798 : node_(NodePtrFromKeyPtr(*tree_it)),
807 // If nothing non-empty is found then leave node_ == NULL.
811 node_ = NULL
893 Node* node_; member in class:google::protobuf::Map::InnerMap::iterator_base
[all...] |
