HomeSort by relevance Sort by last modified time
    Searched refs:node_ (Results 1 - 25 of 40) sorted by null

1 2

  /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/swiftshader/third_party/stlport-cpp11-extension/
memory 74 // Thread safe decrement, deletes node_ if holding last remaining reference.
75 // Any use of node_ after calling this function is unsafe unless node_ is
88 Node node_;
105 node_ = NewNodeFor(value);
109 shared_ptr<T>::shared_ptr() : node_(NewNullNode()) {}
113 bool should_delete = __atomic_fetch_sub(node_.count, 1, __ATOMIC_SEQ_CST) == 0;
114 // The only accesses to node_ that should be made after this line is the
116 // because another thread could have deleted node_
118 delete node_.value
    [all...]
  /external/tensorflow/tensorflow/cc/framework/
ops.cc 21 Operation::Operation(Node* n) : inputs_(GetInputs(n)), node_(n) {}
24 CHECK_NOTNULL(node_);
26 CHECK_LT(i, node_->num_inputs());
30 for (const Edge* e : node_->in_edges()) {
41 CHECK_NOTNULL(node_);
43 CHECK_LT(i, node_->num_outputs());
44 return Output(node_, i);
48 return ::tensorflow::Hash64(reinterpret_cast<const char*>(&node_),
ops.h 39 Operation() : node_(nullptr) {}
42 int32 num_inputs() const { return node_->num_inputs(); }
43 DataType input_type(int32 o) const { return node_->input_type(o); }
46 int32 num_outputs() const { return node_->num_outputs(); }
47 DataType output_type(int32 o) const { return node_->output_type(o); }
50 Node* node() const { return node_; }
54 bool operator==(const Operation& other) const { return node_ == other.node_; }
61 Node* node_; member in class:tensorflow::Operation
  /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
  /external/tensorflow/tensorflow/compiler/xla/
shape_tree.h 343 : node_(node),
346 if (node_) {
348 while (!node_->children.empty()) {
349 const int child_index = node_->children.size() - 1;
350 stack_.push_back({node_, child_index});
351 node_ = node_->children[child_index].get();
354 if (!node_->children.empty() && iterate_leaves_only) {
361 : node_(other.node_),
455 NodeType* node_; member in class:xla::ShapeTreeIterator
    [all...]
  /external/tensorflow/tensorflow/core/grappler/optimizers/
layout_optimizer.cc 472 node_(opt_cxt.node),
519 if (node_->attr().find("data_format") != node_->attr().end()) {
520 if (node_->attr().at("data_format").s().compare("NHWC") == 0) {
528 auto outputs = node_map_->GetOutputs(node_->name());
541 return nodes_to_preserve_.find(node_->name()) != nodes_to_preserve_.end();
546 if (node_->device().empty()) {
547 device_name = virtual_placer_.get_canonical_device_name(*node_);
549 device_name = node_->device();
562 return !MustPreserve() && IsNHWC() && IsPortZeroDimsFour(*node_) &
705 NodeDef* node_; member in class:tensorflow::grappler::__anon39667::NodeProcessor
    [all...]
  /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/tensorflow/tensorflow/core/profiler/internal/
tfprof_node.h 320 node_.set_id(id);
321 node_.set_name(node->name());
322 node_.set_op(node->op());
323 node_.set_float_ops(0);
326 (*node_.mutable_attrs())[attr.first].MergeFrom(attr.second);
356 void AddFloatOps(int64 float_ops) { node_.set_float_ops(float_ops); }
366 const string& name() const { return node_.name(); }
367 int64 id() const { return node_.id(); }
368 const string& op() const { return node_.op(); }
369 const ProfileNode& node() { return node_; }
738 ProfileNode node_; member in class:tensorflow::tfprof::TFGraphNode
    [all...]
tfprof_node.cc 204 if (!node_.canonical_device().empty()) {
205 if (node_.canonical_device() != dev) {
211 node_.set_canonical_device(dev);
214 node_.set_host_device(StringReplace(dev, "device:sycl:\\d+", "cpu:0"));
216 node_.set_host_device(StringReplace(dev, "gpu:\\d+", "cpu:0"));
218 AddOpType(node_.canonical_device());
230 if (dev == node_.canonical_device()) {
  /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);
  /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
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...]
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_);
  /external/deqp/framework/common/
tcuTestHierarchyIterator.hpp 149 NodeIter (TestNode* node_)
150 : node (node_)
  /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/libmojo/mojo/edk/system/
node_controller.cc 145 node_(new ports::Node(name_, this)) {
223 node_->ClosePort(port);
276 node_->SetUserData(port, std::move(observer));
281 int rv = node_->ClosePort(port);
290 int rv = node_->SendMessage(port, std::move(ports_message));
318 node_->MergePorts(port, name_, it->second.port.name());
345 node_->ClosePort(port);
357 int rv = node_->MergeLocalPorts(port0, port1);
640 node_->ClosePort(port);
642 node_->LostConnectionToNode(name)
    [all...]

Completed in 1414 milliseconds

1 2