| /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_; }
|
| /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
|
| /system/core/libmemunreachable/ |
| LinkedList.h | 54 LinkedListHead() : node_() {}
58 LinkedList<T> node_; member in class:android::LinkedListHead
|
| Allocator.cpp | 185 LinkedList<Chunk*> node_; // linked list sorted by minimum free count member in class:android::Chunk
231 : node_(this),
344 chunk->node_.remove();
349 chunk->node_.remove();
367 free_chunks_[bucket].insert(chunk->node_);
426 chunk->node_.remove();
434 node->insert(chunk->node_);
|
| /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/compiler/ |
| state-values-utils.h | 120 explicit StateValuesAccess(Node* node) : node_(node) {}
123 iterator begin() { return iterator(node_); }
127 Node* node_; member in class:v8::internal::compiler::StateValuesAccess
|
| liveness-analyzer.h | 120 return node_;
127 explicit Entry(Node* node) : kind_(kCheckpoint), var_(-1), node_(node) {}
128 Entry(Kind kind, int var) : kind_(kind), var_(var), node_(nullptr) {
135 Node* node_; member in class:v8::internal::compiler::LivenessAnalyzerBlock::Entry
|
| instruction-selector.h | 35 PushParameter() : node_(nullptr), type_(MachineType::None()) {}
36 PushParameter(Node* node, MachineType type) : node_(node), type_(type) {}
38 Node* node() const { return node_; }
42 Node* node_; member in class:v8::internal::compiler::PushParameter
|
| node.h | 128 explicit UseEdges(Node* node) : node_(node) {}
131 Node* node_; member in class:v8::internal::compiler::final::final
146 explicit Uses(Node* node) : node_(node) {}
149 Node* node_; member in class:v8::internal::compiler::final::final
172 Node* node_; member in struct:v8::internal::compiler::final::OutOfLineInputs
202 : reinterpret_cast<OutOfLineInputs*>(start)->node_;
578 return Node::UseEdges::iterator(this->node_);
623 return const_iterator(this->node_);
|
| node-matchers.h | 24 explicit NodeMatcher(Node* node) : node_(node) {}
26 Node* node() const { return node_; }
35 bool Equals(const Node* node) const { return node_ == node; }
45 Node* node_; member in struct:v8::internal::compiler::NodeMatcher
|
| js-builtin-reducer.cc | 28 explicit JSCallReduction(Node* node) : node_(node) {}
33 if (node_->opcode() != IrOpcode::kJSCall) return false;
34 HeapObjectMatcher m(NodeProperties::GetValueInput(node_, 0));
42 DCHECK_EQ(IrOpcode::kJSCall, node_->opcode());
43 HeapObjectMatcher m(NodeProperties::GetValueInput(node_, 0));
78 Node* receiver() { return NodeProperties::GetValueInput(node_, 1); }
83 DCHECK_EQ(IrOpcode::kJSCall, node_->opcode());
85 return node_->op()->ValueInputCount() - 2;
89 DCHECK_EQ(IrOpcode::kJSCall, node_->opcode());
92 return NodeProperties::GetValueInput(node_, index + 2)
96 Node* node_; member in class:v8::internal::compiler::JSCallReduction
[all...] |
| js-typed-lowering.cc | 32 : lowering_(lowering), node_(node) {}
36 DCHECK_EQ(1, node_->op()->EffectOutputCount());
37 switch (CompareOperationHintOf(node_->op())) {
60 DCHECK_EQ(1, node_->op()->EffectOutputCount());
61 return (CompareOperationHintOf(node_->op()) ==
70 DCHECK_EQ(1, node_->op()->EffectOutputCount());
71 return (CompareOperationHintOf(node_->op()) ==
80 DCHECK_EQ(1, node_->op()->EffectOutputCount());
81 return (CompareOperationHintOf(node_->op()) ==
92 DCHECK_EQ(IrOpcode::kJSAdd, node_->opcode())
408 Node* node_; \/\/ The original node. member in class:v8::internal::compiler::final
[all...] |
| /external/v8/src/ |
| 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
|
| 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...] |
| global-handles.h | 377 : node_(node), callback_(callback), parameter_(parameter) {
385 Node* node() { return node_; }
389 Node* node_; member in class:v8::internal::GlobalHandles::PendingPhantomCallback
|
| /external/libmojo/mojo/edk/system/ |
| node_controller.h | 60 ports::Node* node() const { return node_.get(); }
228 const std::unique_ptr<ports::Node> node_; member in class:mojo::edk::NodeController
|
| /external/protobuf/src/google/protobuf/ |
| map.h | 767 // node_ is always correct. This is handy because the most common
768 // operations are operator* and operator-> and they only use node_.
769 // When node_ is set to a non-NULL value, all the other non-const fields
773 iterator_base() : node_(NULL) {}
784 : node_(it.node_),
790 : node_(n),
795 : node_(NodePtrFromKeyPtr(*tree_it)),
804 // If nothing non-empty is found then leave node_ == NULL.
808 node_ = NULL
890 Node* node_; member in class:google::protobuf::Map::InnerMap::iterator_base
[all...] |
| /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...] |
| /external/v8/src/regexp/ |
| jsregexp.h | 876 explicit GuardedAlternative(RegExpNode* node) : node_(node), guards_(NULL) {
883 RegExpNode* node_; member in class:v8::internal::GuardedAlternative
[all...] |
| /prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit/2.14/ |
| htmlunit-2.14.jar | |
