HomeSort by relevance Sort by last modified time
    Searched defs:Node (Results 76 - 100 of 1545) sorted by null

1 2 34 5 6 7 8 91011>>

  /prebuilts/go/linux-x86/test/fixedbugs/
issue16008.go 16 _ = UpdateNode(tx1, &Node{
32 type Node struct {
52 func UpdateNode(tx Tx, n *Node) error {
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/containers/associative/
tree_left_rotate.pass.cpp 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node* __parent_unsafe() const { return __parent_; }
27 void __set_parent(Node* x) { __parent_ = x;}
29 Node() : __left_(), __right_(), __parent_() {}
35 Node root;
36 Node x;
37 Node y
    [all...]
tree_right_rotate.pass.cpp 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node* __parent_unsafe() const { return __parent_; }
27 void __set_parent(Node* x) { __parent_ = x;}
29 Node() : __left_(), __right_(), __parent_() {}
35 Node root;
36 Node x;
37 Node y
    [all...]
  /system/extras/libperfmgr/include/perfmgr/
Node.h 31 // The Node class provides an interface for adding and cancelling powerhint
33 // request will expire. There are additional methods for getting the Node?s name
35 // and request management. The core of the Node class is a vector of
37 // requests on the node. Each entry in the vector corresponds to a possible
38 // value for the node, in priority order. For example, the first entry in the
45 // collected in a RequestGroup. Node class is not thread safe so it needs
47 class Node {
49 Node(std::string name, std::string node_path,
61 // std::chrono::milliseconds::max() if no active request on Node; update
62 // node's controlled file node value and the current value index based o
    [all...]
  /external/gemmlowp/profiling/
profiler.h 113 // Each node shows the absolute percentage, among all the samples,
115 // The percentages are *NOT* relative to the parent node. In addition
117 // the remainder of samples under the parent node that didn't fall into
158 struct Node {
159 std::vector<Node*> children;
162 Node() : label(nullptr), weight(0) {}
163 ~Node() {
170 static bool CompareNodes(Node* n1, Node* n2) {
174 Node root_
    [all...]
  /external/skia/tests/
ArenaAllocTest.cpp 35 struct Node {
36 Node(Node* n) : next(n) { created++; }
37 ~Node() {
40 next->~Node();
43 Node *next;
49 start->~Node();
52 Node* start;
164 Node* current = nullptr;
166 uint64_t* temp = arena.makeArrayDefault<uint64_t>(sizeof(Node) / sizeof(Node*))
    [all...]
  /external/skqp/tests/
ArenaAllocTest.cpp 30 struct Node {
31 Node(Node* n) : next(n) { created++; }
32 ~Node() {
35 next->~Node();
38 Node *next;
44 start->~Node();
47 Node* start;
159 Node* current = nullptr;
161 uint64_t* temp = arena.makeArrayDefault<uint64_t>(sizeof(Node) / sizeof(Node*))
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/
rexpr.h 4 /* track field must be same for all node types */
15 } Node, *NodePtr;
  /device/linaro/bootloader/edk2/EmulatorPkg/EmuBusDriverDxe/
EmuBusDriverDxe.c 48 // Check the contents of the first Device Path Node of RemainingDevicePath to make sure
49 // it is a legal Device Path Node for this bus driver's children.
53 // Check if RemainingDevicePath is the End of Device Path Node,
58 // If RemainingDevicePath isn't the End of Device Path Node,
148 EMU_VENDOR_DEVICE_PATH_NODE *Node;
229 // Check if RemainingDevicePath is the End of Device Path Node,
234 // If RemainingDevicePath isn't the End of Device Path Node,
237 Node = (EMU_VENDOR_DEVICE_PATH_NODE *) RemainingDevicePath;
238 if (Node->VendorDevicePath.Header.Type == HARDWARE_DEVICE_PATH &&
239 Node->VendorDevicePath.Header.SubType == HW_VENDOR_DP &&
    [all...]
  /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Bus/Isa/IsaBusDxe/
IsaBus.c 100 // path node in RemainingDevicePath is an ACPI Device path node which is a
101 // legal Device Path Node for this bus driver's children.
587 EFI_DEV_PATH Node;
609 Node.DevPath.Type = ACPI_DEVICE_PATH;
610 Node.DevPath.SubType = ACPI_DP;
611 SetDevicePathNodeLength (&Node.DevPath, sizeof (ACPI_HID_DEVICE_PATH));
612 Node.Acpi.HID = IsaDeviceResourceList->Device.HID;
613 Node.Acpi.UID = IsaDeviceResourceList->Device.UID;
617 &Node.DevPath
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/ReportStatusCodeRouter/RuntimeDxe/
ReportStatusCodeRouterRuntimeDxe.h 45 LIST_ENTRY Node;
  /device/linaro/bootloader/edk2/NetworkPkg/HttpBootDxe/
HttpBootDxe.c 286 If this parameter is not NULL and the first Device Path Node is
287 not the End of Device Path Node, then only the handle for the
288 child device specified by the first Device Path Node of
290 If the first Device Path Node of RemainingDevicePath is
291 the End of Device Path Node, no child handle is created by this
310 EFI_DEV_PATH *Node;
352 // Open Device Path Protocol to prepare for appending IP and URI node.
446 // Append IPv4 device path node.
448 Node = AllocateZeroPool (sizeof (IPv4_DEVICE_PATH));
449 if (Node == NULL) {
    [all...]
  /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellLevel2CommandsLib/
Load.c 197 EFI_SHELL_FILE_INFO *Node;
240 for ( Node = (EFI_SHELL_FILE_INFO *)GetFirstNode(&ListHead->Link)
241 ; !IsNull(&ListHead->Link, &Node->Link)
242 ; Node = (EFI_SHELL_FILE_INFO *)GetNextNode(&ListHead->Link, &Node->Link)
248 LoadDriver(Node->FullName, (BOOLEAN)(ShellCommandLineGetFlag(Package, L"-nc")==FALSE));
250 Status = LoadDriver(Node->FullName, (BOOLEAN)(ShellCommandLineGetFlag(Package, L"-nc")==FALSE));
  /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellLevel3CommandsLib/
Type.c 186 EFI_SHELL_FILE_INFO *Node;
265 for ( Node = (EFI_SHELL_FILE_INFO*)GetFirstNode(&FileList->Link)
266 ; !IsNull(&FileList->Link, &Node->Link) && !ShellGetExecutionBreakFlag()
267 ; Node = (EFI_SHELL_FILE_INFO*)GetNextNode(&FileList->Link, &Node->Link)
277 if (EFI_ERROR(Node->Status)){
278 ShellPrintHiiEx(-1, -1, NULL, STRING_TOKEN (STR_GEN_FILE_OPEN_FAIL), gShellLevel3HiiHandle, L"type", Node->FileName);
286 if (FileHandleIsDirectory(Node->Handle) == EFI_SUCCESS) {
287 ShellPrintHiiEx(-1, -1, NULL, STRING_TOKEN (STR_GEN_IS_DIR), gShellLevel3HiiHandle, L"type", Node->FileName);
295 Status = TypeFileByHandle (Node->Handle, AsciiMode, UnicodeMode);
    [all...]
  /device/linaro/bootloader/edk2/StdLib/LibC/Uefi/Devices/Utility/
DevGenisis.c 110 DeviceNode *Node;
121 Node = (DeviceNode *)AllocateZeroPool(sizeof(DeviceNode));
122 if(Node == NULL) {
127 Node->DevName = DevName;
128 Node->DevProto = DevProto;
129 Node->InstanceList = InstanceList;
130 Node->OpenFunc = OpenFunc;
131 Node->InstanceSize = InstanceSize;
132 Node->NumInstances = NumInstance;
133 Node->OpModes = Modes;
    [all...]
  /external/clang/test/SemaCXX/
arrow-operator.cpp 31 class Node { public: Point Location(){ Point p; return p; } };
35 Node** node1;
  /external/libmojo/mojo/edk/system/ports/
node.h 50 class Node {
58 Node(const NodeName& name, NodeDelegate* delegate);
59 ~Node();
61 // Returns true iff there are no open ports referring to another node or ports
62 // in the process of being transferred from this node to another. If this
64 // node alive and continue routing messages to it via AcceptMessage. This
65 // method may be called again after AcceptMessage to check if the Node is now
70 // to another node.
77 // Creates a port on this node. Before the port can be used, it must be
88 // Generates a new connected pair of ports bound to this node. These port
    [all...]
  /external/llvm/bindings/go/llvm/
IRBindings.cpp 89 auto *Node = unwrap<MDNode>(MD);
90 Node->replaceAllUsesWith(unwrap<Metadata>(New));
91 MDNode::deleteTemporary(Node);
  /external/llvm/include/llvm/Analysis/
CFGPrinter.h 34 static std::string getSimpleNodeLabel(const BasicBlock *Node,
36 if (!Node->getName().empty())
37 return Node->getName().str();
42 Node->printAsOperand(OS, false);
46 static std::string getCompleteNodeLabel(const BasicBlock *Node,
52 if (Node->getName().empty()) {
53 Node->printAsOperand(OS, false);
57 OS << *Node;
91 std::string getNodeLabel(const BasicBlock *Node,
94 return getSimpleNodeLabel(Node, Graph)
    [all...]
  /external/llvm/lib/Analysis/
IteratedDominanceFrontier.cpp 39 if (DomTreeNode *Node = DT.getNode(BB))
40 PQ.push(std::make_pair(Node, DomLevels.lookup(Node)));
63 DomTreeNode *Node = Worklist.pop_back_val();
64 BasicBlock *BB = Node->getBlock();
75 if (SuccNode->getIDom() == Node)
94 for (auto DomChild : *Node) {
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.h 53 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
55 static bool isPassiveNode(SDNode *Node) {
56 if (isa<ConstantSDNode>(Node)) return true;
57 if (isa<ConstantFPSDNode>(Node)) return true;
58 if (isa<RegisterSDNode>(Node)) return true;
59 if (isa<RegisterMaskSDNode>(Node)) return true;
60 if (isa<GlobalAddressSDNode>(Node)) return true;
61 if (isa<BasicBlockSDNode>(Node)) return true;
62 if (isa<FrameIndexSDNode>(Node)) return true;
63 if (isa<ConstantPoolSDNode>(Node)) return true
    [all...]
  /external/skia/experimental/sksg/
SkSGNode.h 25 * Handles ingress edge management for the DAG (i.e. node -> "parent" node mapping),
31 class Node : public SkRefCnt {
44 explicit Node(uint32_t invalTraits);
45 ~Node() override;
52 // Tag this node for invalidation and optional damage.
61 void observeInval(const sk_sp<Node>&);
62 void unobserveInval(const sk_sp<Node>&);
66 kInvalidated_Flag = 1 << 0, // the node or its descendants require revalidation
67 kDamage_Flag = 1 << 1, // the node contributes damage during revalidatio
    [all...]
  /external/skia/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/skqp/experimental/sksg/
SkSGNode.h 25 * Handles ingress edge management for the DAG (i.e. node -> "parent" node mapping),
31 class Node : public SkRefCnt {
44 explicit Node(uint32_t invalTraits);
45 ~Node() override;
52 // Tag this node for invalidation and optional damage.
61 void observeInval(const sk_sp<Node>&);
62 void unobserveInval(const sk_sp<Node>&);
66 kInvalidated_Flag = 1 << 0, // the node or its descendants require revalidation
67 kDamage_Flag = 1 << 1, // the node contributes damage during revalidatio
    [all...]

Completed in 718 milliseconds

1 2 34 5 6 7 8 91011>>