| /external/perfetto/src/ftrace_reader/ |
| ftrace_procfs.h | 108 const std::string root_; member in class:perfetto::FtraceProcfs
|
| /external/pdfium/core/fpdfapi/parser/ |
| cpdf_object_avail.h | 48 MaybeOwned<const CPDF_Object> root_; member in class:CPDF_ObjectAvail
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| tfprof_graph.h | 46 : TFShow(ckpt_reader), root_(nullptr) {}
80 GraphNode* root_; member in class:tensorflow::tfprof::TFGraph
|
| tfprof_op.h | 70 std::unique_ptr<OpNode> root_; member in class:tensorflow::tfprof::TFOp
|
| tfprof_scope.h | 43 : TFShow(ckpt_reader), root_(nullptr) {}
69 ScopeNode* root_; member in class:tensorflow::tfprof::TFScope
|
| tfprof_code.h | 88 std::unique_ptr<CodeNode> root_; member in class:tensorflow::tfprof::TFCode
|
| /external/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 46 SplayTree.prototype.root_ = null; method in class:SplayTree
53 return !this.root_;
67 this.root_ = new SplayTree.Node(key, value);
73 if (this.root_.key == key) {
77 if (key > this.root_.key) {
78 node.left = this.root_;
79 node.right = this.root_.right;
80 this.root_.right = null;
82 node.right = this.root_;
83 node.left = this.root_.left
[all...] |
| /external/libchrome/base/containers/ |
| linked_list.h | 145 // list (root_.next() will point back to the start of the list,
146 // and root_->previous() wraps around to the end of the list).
147 LinkedList() : root_(&root_, &root_) {}
151 e->InsertBefore(&root_);
155 return root_.next();
159 return root_.previous();
163 return &root_;
169 LinkNode<T> root_; member in class:base::LinkedList
[all...] |
| /external/v8/tools/ |
| splaytree.js | 47 SplayTree.prototype.root_ = null; method in class:SplayTree
54 return !this.root_;
69 this.root_ = new SplayTree.Node(key, value);
75 if (this.root_.key == key) {
79 if (key > this.root_.key) {
80 node.left = this.root_;
81 node.right = this.root_.right;
82 this.root_.right = null;
84 node.right = this.root_;
85 node.left = this.root_.left
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
| unify_const_pass.cpp | 33 ResultIdTrie() : root_(new Node) {}
43 auto* node = root_.get();
101 std::unique_ptr<Node> root_; // The root node of the trie. member in class:spvtools::opt::__anon799::ResultIdTrie
|
| /external/v8/benchmarks/ |
| splay.js | 141 SplayTree.prototype.root_ = null; method in class:SplayTree
148 return !this.root_;
162 this.root_ = new SplayTree.Node(key, value);
168 if (this.root_.key == key) {
172 if (key > this.root_.key) {
173 node.left = this.root_;
174 node.right = this.root_.right;
175 this.root_.right = null;
177 node.right = this.root_;
178 node.left = this.root_.left
[all...] |
| /external/v8/src/crankshaft/ |
| typing.h | 46 FunctionLiteral* root_; member in class:v8::internal::final
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.h | 128 PartitionTreeNode* root_; member in class:webrtc::Vp8PartitionAggregator
|
| /external/gemmlowp/profiling/ |
| profiler.h | 174 Node root_; member in class:gemmlowp::ProfileTreeView
181 printf("%.2f%% %s\n", 100.0f * node->weight / root_.weight, node->label);
211 AddStackToNode(stack, &root_, 0);
223 node == &root_ ? "other (outside of any label)" : "other";
229 void AddOtherNodes() { AddOtherChildrenToNode(&root_); }
238 void Sort() { SortNode(&root_); }
253 static_cast<int>(root_.weight));
254 PrintNode(&root_, 0);
|
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_nodeiteratortemplate_unittest.cpp | 61 root_ = pdfium::MakeUnique<Node>(nullptr);
62 child1_ = pdfium::MakeUnique<Node>(root_.get());
63 child2_ = pdfium::MakeUnique<Node>(root_.get());
73 Node* root() const { return root_.get(); }
85 std::unique_ptr<Node> root_; member in class:CXFA_NodeIteratorTemplateTest
|
| /external/v8/src/ |
| splay-tree.h | 39 : root_(NULL), allocator_(allocator) {}
92 bool is_empty() { return root_ == NULL; }
154 void ResetRoot() { root_ = NULL; }
157 // Search for a node with a given key. If found, root_ points
161 // Inserts a node assuming that root_ is already set up.
164 // Removes root_ node.
194 Node* root_; member in class:v8::internal::SplayTree
|
| /art/runtime/ |
| gc_root.h | 195 mirror::CompressedReference<mirror::Object>* roots[1] = { &root_ };
208 return &root_;
213 return root_.IsNull();
223 // Root visitors take pointers to root_ and place them in CompressedReference** arrays. We use a
226 mutable mirror::CompressedReference<mirror::Object> root_; member in class:art::GcRoot
|
| /external/protobuf/csharp/src/Google.Protobuf/WellKnownTypes/ |
| Api.cs | 727 root_ = other.root_;
749 private string root_ = ""; field in class:Google.Protobuf.WellKnownTypes.Mixin
755 get { return root_; }
757 root_ = pb::ProtoPreconditions.CheckNotNull(value, "value");
|
| /external/protobuf/src/google/protobuf/util/ |
| field_mask_util.cc | 197 if (root_.children.empty()) {
200 MergeMessage(&root_, source, options, destination);
236 Node root_; member in class:google::protobuf::util::__anon32442::FieldMaskTree
252 MergeToFieldMask("", &root_, mask);
278 Node* node = &root_;
280 if (!new_branch && node != &root_ && node->children.empty()) {
304 const Node* node = &root_;
307 if (node != &root_) {
|
| /external/protobuf/src/google/protobuf/util/internal/ |
| default_value_objectwriter.h | 226 // Writes the root_ node to ow_ and resets the root_ and current_ pointer to
256 google::protobuf::scoped_ptr<Node> root_; member in class:google::protobuf::util::converter::DefaultValueObjectWriter
257 // The stack to hold the path of Nodes from current_ to root_;
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| shape_tree.h | 122 root_ = other.root_;
171 return iterator(&root_, /*iterate_leaves_only=*/false,
179 return const_iterator(&root_, /*iterate_leaves_only=*/false,
189 return iterator(&root_, /*iterate_leaves_only=*/false,
197 return const_iterator(&root_, /*iterate_leaves_only=*/false,
208 return iterator(&root_, /*iterate_leaves_only=*/true, /*reverse=*/false);
215 return const_iterator(&root_, /*iterate_leaves_only=*/true,
231 return iterator(&root_, /*iterate_leaves_only=*/true, /*reverse=*/true);
238 return const_iterator(&root_, /*iterate_leaves_only=*/true
310 Node root_; member in class:xla::ShapeTree
604 root_, &index) member in namespace:xla
[all...] |
| /external/v8/src/profiler/ |
| allocation-tracker.h | 60 AllocationTraceNode* root() { return &root_; }
66 AllocationTraceNode root_; member in class:v8::internal::AllocationTraceTree
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| huffman_codec.h | 104 root_ = right;
132 root_ = root_handle;
152 code << "(" << root_ << ", {\n"; local
176 PrintTreeInternal(out, root_, 0);
183 queue.emplace(root_, "");
229 uint32_t node = root_;
360 queue.emplace(root_, 0, 0);
393 uint32_t root_ = 0; member in class:spvutils::HuffmanCodec
|
| /external/tensorflow/tensorflow/cc/gradients/ |
| math_grad_test.cc | 574 MathGradTest() : root_(Scope::NewRootScope().WithDevice("/cpu:0")) {}
578 TF_ASSERT_OK(root_.status());
586 Placeholder(root_, DataTypeToEnum<T>::v(), Placeholder::Shape(x_shape));
588 Placeholder(root_, DataTypeToEnum<T>::v(), Placeholder::Shape(y_shape));
591 z = BatchMatMul(root_, x, y, BatchMatMul::AdjX(t_x).AdjY(t_y));
593 z = MatMul(root_, x, y, MatMul::TransposeA(t_x).TransposeB(t_y));
598 root_, {x, y}, {x_shape, y_shape}, {z}, {z_shape}, &max_error)));
644 Scope root_; member in class:tensorflow::__anon38677::MathGradTest
|
| /external/v8/src/ast/ |
| ast-traversal-visitor.h | 35 DCHECK_NOT_NULL(root_);
36 Visit(root_);
57 AstNode* root_; member in class:v8::internal::AstTraversalVisitor
94 : root_(root), depth_(0) {
101 : root_(root), depth_(0) {
|
