| /external/skqp/src/core/ |
| SkArenaAllocList.h | 20 struct Node;
41 explicit Iter(Node* node) : fCurr(node) {}
42 Node* fCurr = nullptr;
50 struct Node {
52 Node(Args... args) : fT(std::forward<Args>(args)...) {}
54 Node* fNext = nullptr;
56 Node* fHead = nullptr;
57 Node* fTail = nullptr
[all...] |
| SkRTree.h | 51 // Insertion count (not overall node count, which may be greater).
62 struct Node;
66 Node* fSubtree;
72 struct Node {
78 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const;
86 Node* allocateNodeAtLevel(uint16_t level);
92 SkTDArray<Node> fNodes;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.h | 50 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
52 static bool isPassiveNode(SDNode *Node) {
53 if (isa<ConstantSDNode>(Node)) return true;
54 if (isa<ConstantFPSDNode>(Node)) return true;
55 if (isa<RegisterSDNode>(Node)) return true;
56 if (isa<GlobalAddressSDNode>(Node)) return true;
57 if (isa<BasicBlockSDNode>(Node)) return true;
58 if (isa<FrameIndexSDNode>(Node)) return true;
59 if (isa<ConstantPoolSDNode>(Node)) return true;
60 if (isa<JumpTableSDNode>(Node)) return true
[all...] |
| /external/swiftshader/third_party/subzero/src/ |
| IceLiveness.cpp | 35 // (IsFullInit=false). In the latter case, FirstNode points to the first node
109 // Process each node.
112 LivenessNode &Node = Nodes[(*I)->getIndex()];
114 Node.LiveIn.resize(NumGlobals);
115 Node.LiveOut.resize(NumGlobals);
117 MaxLocals = std::max(MaxLocals, Node.NumLocals);
135 Variable *Liveness::getVariable(SizeT LiveIndex, const CfgNode *Node) const {
138 SizeT NodeIndex = Node->getIndex();
|
| /external/v8/src/builtins/ |
| builtins-global.cc | 109 typedef compiler::Node Node;
113 Node* context = assembler.Parameter(4);
125 Node* num = var_num.value();
139 Node* num_value = assembler.LoadHeapNumberValue(num);
163 typedef compiler::Node Node;
167 Node* context = assembler.Parameter(4);
179 Node* num = var_num.value();
193 Node* num_value = assembler.LoadHeapNumberValue(num)
[all...] |
| builtins-promise.h | 14 typedef compiler::Node Node;
58 Node* AllocateAndInitJSPromise(Node* context);
61 Node* AllocateAndInitJSPromise(Node* context, Node* parent);
65 Node* AllocateAndSetJSPromise(Node* context, Node* status, Node* result)
[all...] |
| builtins-symbol.cc | 73 typedef compiler::Node Node;
76 Node* receiver = assembler.Parameter(0);
77 Node* context = assembler.Parameter(4);
79 Node* result =
88 typedef compiler::Node Node;
91 Node* receiver = assembler.Parameter(0);
92 Node* context = assembler.Parameter(3);
94 Node* value = assembler.ToThisValue(context, receiver, PrimitiveType::kSymbol
[all...] |
| /external/v8/src/ |
| locked-queue-inl.h | 15 struct LockedQueue<Record>::Node : Malloced {
16 Node() : next(nullptr) {}
18 base::AtomicValue<Node*> next;
24 head_ = new Node();
33 Node* old_node = nullptr;
34 Node* cur_node = head_;
45 Node* n = new Node();
58 Node* old_head = nullptr;
62 Node* const next_node = head_->next.Value()
[all...] |
| /external/v8/tools/ |
| splaytree.js | 42 * Pointer to the root node of the tree.
44 * @type {SplayTree.Node}
60 * Inserts a node into the tree with the specified key and value if
61 * the tree does not already contain a node with the specified key. If
69 this.root_ = new SplayTree.Node(key, value);
72 // Splay on the key to move the last node on the search path for
78 var node = new SplayTree.Node(key, value);
80 node.left = this.root_;
81 node.right = this.root_.right
[all...] |
| /external/valgrind/memcheck/tests/ |
| leak-cases.c | 46 } Node;
48 Node* mk(Node* next)
52 Node* x = malloc(2 * sizeof(Node));
58 Node* p1;
59 Node* p2;
60 Node* p3;
61 Node* p4;
62 Node* p5
[all...] |
| /frameworks/base/tools/incident_report/ |
| generic_message.h | 45 struct Node {
61 typedef multimap<int32_t,Node>::const_iterator const_iterator;
67 multimap<int,Node> mNodes;
|
| /packages/apps/Dialer/java/com/android/dialer/searchfragment/cp2/ |
| ContactTernarySearchTree.java | 26 private Node root;
29 * Add {@code value} to all middle and end {@link Node#values} that correspond to {@code key}.
32 * "O". But if the traversal required visiting {@link Node#left} or {@link Node#right}, {@code
42 private Node put(Node node, String key, int value, int position) {
44 if (node == null) {
45 node = new Node();
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Tooling/Refactoring/ |
| ASTSelection.h | 25 /// A node that's not selected.
28 /// A node that's considered to be selected because the whole selection range
31 /// A node that's considered to be selected because the start of the selection
34 /// A node that's considered to be selected because the end of the selection
38 /// A node that's considered to be selected because the node is entirely in
43 /// Represents a selected AST node.
46 /// follows the top-down shape of the actual AST. Each selected node has
47 /// a selection kind. The kind might be none as the node itself might not
51 ast_type_traits::DynTypedNode Node;
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
| unify_const_pass.cpp | 33 ResultIdTrie() : root_(new Node) {}
38 // is found, creates a trie node with those keys, stores the instruction's
43 auto* node = root_.get(); local
45 node = node->GetOrCreateTrieNodeFor(key);
47 if (node->result_id() == 0) {
48 node->SetResultId(inst.result_id());
50 return node->result_id();
54 // The trie node to store result ids.
55 class Node {
[all...] |
| /system/core/libmemunreachable/ |
| Tarjan.h | 30 class Node {
32 allocator::set<Node<T>*> references_in;
33 allocator::set<Node<T>*> references_out;
39 Node(T* ptr, Allocator<Node> allocator)
41 Node(Node&& rhs) = default;
42 void Edge(Node<T>* ref) {
48 for (auto& node : references_out) {
49 f(node->ptr)
[all...] |
| /development/tools/line_endings/ |
| line_endings.c | 20 typedef struct Node {
21 struct Node *next;
23 } Node;
62 Node* root = malloc(sizeof(Node));
63 Node* node = root; local
64 node->buf[0] = 0;
67 node->next = malloc(sizeof(Node));
[all...] |
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/Net/MarvellYukonDxe/ |
| DriverBinding.c | 581 Find node associated with controller
584 @param [out] DrvLinkedBuff Controller's node.
596 LIST_ENTRY *Node;
600 Node = GetFirstNode (&MarvellYukonDrvDataHead);
601 while (!IsNull (&MarvellYukonDrvDataHead, Node)) {
602 DrvBuffNode = MSK_DRV_INFO_FROM_THIS (Node);
608 Node = GetNextNode (&MarvellYukonDrvDataHead, Node);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_cpickle.py | 105 class Node(object):
113 nodes = [Node() for i in range(500)]
|
