Searched refs:Node (Results 76 - 100 of 535) sorted by relevance

1234567891011>>

/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/
H A Ddsmthdat.c202 * A pseudo-Namespace Node is assigned to each argument and local
203 * so that RefOf() can return a pointer to the Node.
374 * Node - Where the node is returned.
378 * DESCRIPTION: Get the Node associated with a local or arg.
387 ACPI_NAMESPACE_NODE **Node)
409 *Node = &WalkState->LocalVariables[Index];
424 *Node = &WalkState->Arguments[Index];
462 ACPI_NAMESPACE_NODE *Node; local
475 Status = AcpiDsMethodDataGetNode (Type, Index, WalkState, &Node);
491 Node
383 AcpiDsMethodDataGetNode( UINT8 Type, UINT32 Index, ACPI_WALK_STATE *WalkState, ACPI_NAMESPACE_NODE **Node) argument
521 ACPI_NAMESPACE_NODE *Node; local
633 ACPI_NAMESPACE_NODE *Node; local
700 ACPI_NAMESPACE_NODE *Node; local
857 ACPI_NAMESPACE_NODE *Node; local
[all...]
H A Ddspkginit.c252 ObjDesc->Package.Node = Parent->Common.Node;
311 if (!Arg->Common.Node)
337 if (Arg->Common.Node->Type == ACPI_TYPE_METHOD)
352 ACPI_CAST_PTR (ACPI_OPERAND_OBJECT, Arg->Common.Node);
419 if (Arg->Common.Node)
422 ACPI_CAST_PTR (ACPI_OPERAND_OBJECT, Arg->Common.Node));
423 Arg->Common.Node = NULL;
459 Op->Common.Node = ACPI_CAST_PTR (ACPI_NAMESPACE_NODE, ObjDesc);
573 ScopeInfo.Scope.Node
[all...]
H A Ddsobject.c200 if (!Op->Common.Node)
222 ACPI_NAMESPACE_NODE, &(Op->Common.Node)));
262 !ObjDesc->Reference.Node)
268 ObjDesc->Reference.Node = WalkState->ScopeInfo->Scope.Node;
391 Op->Common.Node = ACPI_CAST_PTR (ACPI_NAMESPACE_NODE, ObjDesc);
400 * Node - NS Node to be initialized
412 ACPI_NAMESPACE_NODE *Node,
427 if (AcpiNsGetAttachedObject (Node))
410 AcpiDsCreateNode( ACPI_WALK_STATE *WalkState, ACPI_NAMESPACE_NODE *Node, ACPI_PARSE_OBJECT *Op) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DEntry.h12 class Node;
20 const char* name, Node* node);
31 Node* GetNode() const;
47 Node* fNode;
/haiku/src/apps/icon-o-matic/document/savers/
H A DAttributeSaver.cpp11 #include <Node.h>
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DBlock.cpp38 a Node via the ToNode() method.
119 Node *
122 Node *node = NULL;
124 node = static_cast<Node*>(this);
133 if (Node *node = ToNode()) {
145 if (Node *node = ToNode()) {
163 if (Node *node = const_cast<Block*>(this)->ToNode())
172 if (Node *node = const_cast<Block*>(this)->ToNode())
225 \class Node
228 A Node ca
233 Node::Node() function in class:Node
[all...]
H A DBlock.h38 class Node;
65 Node *ToNode();
97 // Node
98 class Node : public Block { class in inherits:Block
112 Node();
116 class InternalNode : public Node {
127 class LeafNode : public Node {
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DVolume.h48 class Node;
61 inline NodeListenerValue(NodeListener *listener, Node *node, uint32 flags)
68 Node *node;
111 status_t NewVNode(Node *node);
112 status_t PublishVNode(Node *node);
113 status_t GetVNode(ino_t id, Node **node);
114 status_t GetVNode(Node *node);
116 status_t PutVNode(Node *node);
117 status_t RemoveVNode(Node *node);
118 status_t UnremoveVNode(Node *nod
[all...]
H A DNode.h34 class Node : public DoublyLinkedListLinkImpl<Node> { class in inherits:DoublyLinkedListLinkImpl
36 Node(Volume *volume, uint8 type);
37 virtual ~Node();
41 Node*& HashLink() { return fHashLink; }
114 Node *fHashLink;
139 Node::MarkUnmodified()
170 NodeMTimeUpdater(Node *node) : fNode(node) {}
178 Node *fNode;
H A DSizeIndex.cpp11 #include "Node.h"
19 SizeIndexPrimaryKey(Node *node, off_t size)
21 SizeIndexPrimaryKey(Node *node)
26 Node *node;
33 inline SizeIndexPrimaryKey operator()(Node *a)
38 inline SizeIndexPrimaryKey operator()(Node *a) const
63 typedef TwoKeyAVLTree<Node*, SizeIndexPrimaryKey,
93 virtual void NodeRemoved(Node *node);
146 SizeIndex::Changed(Node *node, off_t oldSize)
151 Node **foundNod
[all...]
/haiku/src/libs/gnu/
H A Dxattr.cpp111 struct Node { struct in namespace:__anon7
112 Node(const char* path, bool traverseSymlinks) function in struct:__anon7::Node
118 Node(int fileFD) function in struct:__anon7::Node
127 ~Node()
286 return Node(path, true).Get(attribute, buffer, size);
293 return Node(path, false).Get(attribute, buffer, size);
300 return Node(fd).Get(attribute, buffer, size);
308 return Node(path, true).Set(attribute, flags, buffer, size);
316 return Node(path, false).Set(attribute, flags, buffer, size);
324 return Node(f
[all...]
/haiku/src/system/boot/loader/file_systems/packagefs/
H A Dpackagefs.h16 class Node;
/haiku/headers/private/print/
H A DPrintTransport.h36 #include <Node.h>
/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/components/events/
H A Devrgnini.c328 ParentNode = RegionObj->Region.Node->Parent;
339 * If the AddressSpace.Node is still pointing to the root, we need
343 if (HandlerObj->AddressSpace.Node == AcpiGbl_RootNode)
388 PciRootNode = HandlerObj->AddressSpace.Node;
415 PciDeviceNode = RegionObj->Region.Node;
464 Status = AcpiHwDerivePciId (PciId, PciRootNode, RegionObj->Region.Node);
480 * PARAMETERS: Node - Device node being examined
491 ACPI_NAMESPACE_NODE *Node)
502 Status = AcpiUtExecute_HID (Node, &Hid);
518 Status = AcpiUtExecute_CID (Node,
490 AcpiEvIsPciRootBridge( ACPI_NAMESPACE_NODE *Node) argument
743 ACPI_NAMESPACE_NODE *Node; local
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DNameIndex.cpp13 #include "Node.h"
23 NameIndexPrimaryKey(const Node* entry, const char* name = NULL)
37 const Node* entry;
47 inline NameIndexPrimaryKey operator()(const Node* a)
52 inline NameIndexPrimaryKey operator()(const Node* a) const
77 typedef TwoKeyAVLTree<Node*, NameIndexPrimaryKey, NameIndexPrimaryKeyCompare,
98 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength)
159 NameIndex::NodeAdded(Node* node)
169 NameIndex::NodeRemoved(Node* node)
179 NameIndex::NodeChanged(Node* nod
[all...]
H A DIndexImpl.h10 #include "Node.h"
20 virtual Node* Next(void* buffer, size_t* _keyLength) = 0;
35 typedef typename NodeTree::Node TreeNode;
42 virtual Node* Next(void* buffer, size_t* _keyLength);
50 inline void NodeChangeBegin(Node* node);
51 inline void NodeChangeEnd(Node* node);
53 virtual void NodeRemoved(Node* node);
89 Node*
168 GenericIndexIterator<Policy>::NodeChangeBegin(Node* node)
178 GenericIndexIterator<Policy>::NodeChangeEnd(Node* nod
[all...]
H A DLastModifiedIndex.cpp17 #include "Node.h"
27 LastModifiedIndexPrimaryKey(Node* node, time_t modified)
34 LastModifiedIndexPrimaryKey(Node* node)
48 Node* node;
58 inline LastModifiedIndexPrimaryKey operator()(Node* a)
63 inline LastModifiedIndexPrimaryKey operator()(Node* a) const
92 typedef TwoKeyAVLTree<Node*, LastModifiedIndexPrimaryKey,
118 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength)
129 virtual void NodeChanged(Node* node, uint32 statFields,
185 LastModifiedIndex::NodeAdded(Node* nod
[all...]
H A DSizeIndex.cpp17 #include "Node.h"
27 SizeIndexPrimaryKey(Node* node, off_t size)
34 SizeIndexPrimaryKey(Node* node)
48 Node* node;
58 inline SizeIndexPrimaryKey operator()(Node* a)
63 inline SizeIndexPrimaryKey operator()(Node* a) const
92 typedef TwoKeyAVLTree<Node*, SizeIndexPrimaryKey, SizeIndexPrimaryKeyCompare,
117 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength)
128 virtual void NodeChanged(Node* node, uint32 statFields,
184 SizeIndex::NodeAdded(Node* nod
[all...]
/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/components/resources/
H A Drsxface.c215 ACPI_NAMESPACE_NODE *Node; local
229 Node = AcpiNsValidateHandle (DeviceHandle);
230 if (!Node)
235 if (Node->Type != ACPI_TYPE_DEVICE)
253 *ReturnNode = Node;
287 ACPI_NAMESPACE_NODE *Node; local
295 Status = AcpiRsValidateParameters (DeviceHandle, RetBuffer, &Node);
301 Status = AcpiRsGetPrtMethodData (Node, RetBuffer);
338 ACPI_NAMESPACE_NODE *Node; local
346 Status = AcpiRsValidateParameters (DeviceHandle, RetBuffer, &Node);
386 ACPI_NAMESPACE_NODE *Node; local
431 ACPI_NAMESPACE_NODE *Node; local
486 ACPI_NAMESPACE_NODE *Node; local
[all...]
/haiku/headers/private/kernel/boot/
H A Dvfs.h26 class Node : public DoublyLinkedListLinkImpl<Node> { class in inherits:DoublyLinkedListLinkImpl
28 Node();
29 virtual ~Node();
56 typedef DoublyLinkedList<Node> NodeList;
60 class Directory : public Node {
69 virtual Node* Lookup(const char* name, bool traverseLinks);
70 virtual Node* LookupDontTraverse(const char* name) = 0;
73 virtual status_t GetNextNode(void *cookie, Node **_node) = 0;
78 Node **_nod
[all...]
/haiku/src/kits/shared/
H A DColorQuantizer.cpp43 struct BColorQuantizer::Node { struct in class:BColorQuantizer
50 Node* child[8]; // Pointers to child nodes
51 Node* next; // Pointer to next reducible node
151 BColorQuantizer::_AddColor(Node** _node, uint8 r, uint8 g, uint8 b, uint8 a,
153 Node** reducibleNodes)
181 BColorQuantizer::Node*
183 uint32* _leafCount, Node** reducibleNodes)
185 Node* node = (Node*)calloc(1, sizeof(Node));
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/
H A Dkernel_interface.cpp42 check_access(Node* node, int mode)
125 Node* dir = (Node*)fsDir->private_node;
135 Node* node;
142 Node* node;
150 Node* node = dynamic_cast<Directory*>(dir)->FindChild(StringKey(entryName));
153 BReference<Node> nodeReference(node);
166 Node* node = (Node*)fsNode->private_node;
187 Node* nod
[all...]
/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/components/executer/
H A Dexstore.c174 ACPI_NAMESPACE_NODE *Node,
494 * Node - Named object to receive the value
522 ACPI_NAMESPACE_NODE *Node,
535 /* Get current type of the node, and object attached to Node */
537 TargetType = AcpiNsGetType (Node);
538 TargetDesc = AcpiNsGetAttachedObject (Node);
542 Node, AcpiUtGetTypeName (TargetType)));
601 AcpiUtGetTypeName (Node->Type), Node->Name.Ascii));
640 Status = AcpiExStoreDirectToNode (SourceDesc, Node, WalkStat
520 AcpiExStoreObjectToNode( ACPI_OPERAND_OBJECT *SourceDesc, ACPI_NAMESPACE_NODE *Node, ACPI_WALK_STATE *WalkState, UINT8 ImplicitConversion) argument
721 AcpiExStoreDirectToNode( ACPI_OPERAND_OBJECT *SourceDesc, ACPI_NAMESPACE_NODE *Node, ACPI_WALK_STATE *WalkState) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.h52 class Node;
102 void SetRoot(Node* root);
133 class Node { class in class:BTree
135 Node(Volume* volume);
136 Node(Volume* volume, off_t block);
137 ~Node();
167 //! Reset Node and decrements ref-count to the Node's block
187 status_t Copy(const Node* origin, uint32 start, uint32 end,
196 Node(cons
[all...]
/haiku/src/bin/
H A Ddiff_zip.cpp24 class Node;
26 static Node* create_node(Directory* parent, const string& name,
56 class Node { class
58 Node(Directory* parent, const string& name, const struct stat& st) function in class:Node
65 virtual ~Node()
133 class Directory : public Node {
136 : Node(parent, name, st),
141 void AddEntry(const char* name, Node* node)
172 Node* node = create_node(this, entry->d_name, st);
190 Node* nod
[all...]

Completed in 148 milliseconds

1234567891011>>