/haiku/src/system/kernel/util/ |
H A D | AVLTreeBase.cpp | 69 AVLTreeBase::LeftMost(AVLTreeNode* node) const 71 if (node) { 72 while (node->left) 73 node = node->left; 76 return node; 81 AVLTreeBase::RightMost(AVLTreeNode* node) const 83 if (node) { 84 while (node->right) 85 node 145 AVLTreeNode* node = fRoot; local 165 AVLTreeNode* node = fRoot; local 220 AVLTreeNode* node = fRoot; local 242 Remove(AVLTreeNode* node) argument 271 AVLTreeNode* node = *nodeP; local 302 AVLTreeNode* node = *nodeP; local 330 _BalanceInsertLeft(AVLTreeNode** node) argument 354 _BalanceInsertRight(AVLTreeNode** node) argument 381 AVLTreeNode** node; member in struct:node_info 388 AVLTreeNode** node = &fRoot; local 441 _BalanceRemoveLeft(AVLTreeNode** node) argument 468 _BalanceRemoveRight(AVLTreeNode** node) argument 495 _RemoveRightMostChild(AVLTreeNode** node, AVLTreeNode** foundNode) argument 533 _Remove(AVLTreeNode* node) argument 604 _CheckTree(AVLTreeNode* parent, AVLTreeNode* node, int& _nodeCount) const argument [all...] |
/haiku/src/build/libroot/ |
H A D | NodeRef.h | 14 ino_t node;
member in struct:BPrivate::NodeRef 16 NodeRef(dev_t device = 0, ino_t node = 0)
18 node(node)
24 node(st.st_ino)
31 node = other.node;
37 node = other.node;
43 return (device == other.device && node [all...] |
/haiku/src/kits/media/ |
H A D | TimeSourceObject.cpp | 26 TimeSourceObject::TimeSourceObject(const media_node& node) argument 28 BMediaNode("some timesource object", node.node, node.kind), 29 BTimeSource(node.node) 32 B_PRId32 "\n", node.node); 40 fControlPort = node.port; 42 ASSERT(fNodeID == node 86 DeleteHook(BMediaNode* node) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | NodeRef.h | 16 node(-1) 22 node_ref::node_ref(dev_t device, ino_t node) argument 25 node(node) 34 node(other.node) 42 return device == other.device && node == other.node; 58 return node < other.node; [all...] |
/haiku/src/kits/package/ |
H A D | FetchUtils.cpp | 29 BNode node(&entry); 30 return IsDownloadCompleted(node); 35 FetchUtils::IsDownloadCompleted(const BNode& node) argument 38 status_t status = _GetAttribute(node, DL_COMPLETE_ATTR, 52 FetchUtils::MarkDownloadComplete(BNode& node) argument 55 return _SetAttribute(node, DL_COMPLETE_ATTR, 61 FetchUtils::SetFileType(BNode& node, const char* type) argument 63 return _SetAttribute(node, "BEOS:TYPE", 68 FetchUtils::_SetAttribute(BNode& node, const char* attrName, argument 71 if (node 85 _GetAttribute(const BNode& node, const char* attrName, type_code type, void* data, size_t size) argument [all...] |
H A D | FetchUtils.h | 20 static bool IsDownloadCompleted(const BNode& node); 23 static status_t MarkDownloadComplete(BNode& node); 25 static status_t SetFileType(BNode& node, const char* type); 28 static status_t _SetAttribute(BNode& node, 32 static status_t _GetAttribute(const BNode& node,
|
/haiku/headers/private/kernel/boot/platform/efi/ |
H A D | arch_dtb.h | 12 void arch_handle_fdt(const void* fdt, int node);
|
/haiku/src/system/kernel/platform/openfirmware/ |
H A D | openfirmware_devices.cpp | 24 intptr_t node = *_cookie; local 29 if (node == 0) { 30 // node is NULL, meaning that this is the initial function call. 34 node = root; 36 node = of_peer(0); 38 if (node == OF_FAILED) 40 if (node == 0) 44 next = node; 46 next = of_child(node); 52 // no child node foun [all...] |
/haiku/headers/private/shared/ |
H A D | LRUCache.h | 79 LRUNode* node = fMap.Get(key); local 81 if (node != NULL) { 82 if (node->fValue != value) { 83 node->fValue = value; 84 _DisconnectNodeAndMakeNewest(node); 87 node = new(std::nothrow) LRUNode(key, value); 88 if (node == NULL) 90 status_t result = fMap.Put(key, node); 92 delete node; 95 _SetNewestNode(node); 104 LRUNode* node = fMap.Get(key); local 127 LRUNode* node = fMap.Get(key); local 147 _DisconnectNodeAndMakeNewest(LRUNode* node) argument 156 _DisconnectNode(LRUNode* node) argument 170 _SetNewestNode(LRUNode* node) argument [all...] |
/haiku/src/system/libroot/posix/musl/search/ |
H A D | insque.c | 3 struct node { struct 4 struct node *next; 5 struct node *prev; 10 struct node *e = element; 11 struct node *p = pred; 26 struct node *e = element;
|
/haiku/src/add-ons/print/drivers/lpstyl/ |
H A D | LpstylData.h | 20 LpstylData(BNode* node) argument 22 PrinterData(node)
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/ |
H A D | HaikuKernelVolume.cpp | 86 // check whether we do already know the node 87 HaikuKernelNode* node = fNodes->Get(vnodeID); local 88 if (node != NULL) 91 // get node capabilities 97 // create a new node 98 node = new(std::nothrow) HaikuKernelNode(this, vnodeID, privateNode, ops, 100 if (node == NULL) { 106 status_t error = fNodes->Put(vnodeID, node); 108 delete node; 112 *_node = node; 126 HaikuKernelNode* node = fNodes->Get(vnodeID); local 163 UndoNewVNode(HaikuKernelNode* node) argument 172 UndoPublishVNode(HaikuKernelNode* node) argument 255 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 283 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 350 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 367 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 384 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 420 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 502 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 514 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 526 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 540 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 551 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 563 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 590 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 625 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 636 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 647 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 675 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 686 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 697 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 709 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 724 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 765 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 776 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 787 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 799 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 814 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 829 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 840 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 851 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 863 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 878 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 894 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 907 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 918 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 929 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 941 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 957 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 973 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 985 HaikuKernelNode* node = (HaikuKernelNode*)_node; local 1011 HaikuKernelNode* node = (HaikuKernelNode*)_node; local [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/ |
H A D | NodeListener.cpp | 43 NodeListener::NodeAdded(Node* node) argument 49 NodeListener::NodeRemoved(Node* node) argument 55 NodeListener::NodeChanged(Node* node, uint32 statFields, argument
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package_links/ |
H A D | PackageLinksListener.h | 20 virtual void PackageLinkNodeAdded(Node* node) = 0; 21 virtual void PackageLinkNodeRemoved(Node* node) = 0; 22 virtual void PackageLinkNodeChanged(Node* node,
|
/haiku/src/tests/kits/storage/ |
H A D | NodeTest.cpp | 68 BNode *node; local 70 for (testNodes.rewind(); testNodes.getNext(node, entryName); ) 71 testStatables.add(node, entryName); 207 BNode node; local 208 CPPUNIT_ASSERT( node.InitCheck() == B_NO_INIT ); 214 BNode node(fileLink); 215 CPPUNIT_ASSERT( node.InitCheck() == B_OK ); 219 BNode node(nonExisting); 220 CPPUNIT_ASSERT( node.InitCheck() == B_ENTRY_NOT_FOUND ); 224 BNode node((cons 435 BNode node; local 594 WriteAttributes(BNode &node, const char **attrNames, const char **attrValues, int32 attrCount) argument 608 AttrDirTest(BNode &node) argument 661 BNode *node; local 680 AttrTest(BNode &node) argument 773 BNode *node; local 795 AttrRenameTest(BNode &node) argument 862 BNode *node; local 879 AttrInfoTest(BNode &node) argument 945 BNode *node; local 963 AttrBStringTest(BNode &node) argument 1046 BNode *node; local 1076 BNode *node; local 1095 DupTest(BNode &node) argument 1110 BNode *node; local 1174 LockTest(BNode &node, const char *entryName) argument 1198 BNode *node; local [all...] |
/haiku/src/tests/system/kernel/ |
H A D | lock_node_test.cpp | 15 BNode node; local 16 status_t status = node.SetTo(argv[1]); 22 status = node.Lock(); 32 node.Unlock(); 33 node.Unset();
|
/haiku/src/system/kernel/arch/riscv64/ |
H A D | arch_system_info.cpp | 25 arch_fill_topology_node(cpu_topology_node_info* node, int32 cpu) argument 27 switch (node->type) { 29 node->data.root.platform = B_CPU_RISC_V; 33 node->data.package.vendor = B_CPU_VENDOR_UNKNOWN; 34 node->data.package.cache_line_size = CACHE_LINE_SIZE; 38 node->data.core.model = 0; 39 node->data.core.default_frequency = sCPUClockFrequency;
|
/haiku/src/add-ons/kernel/file_systems/bindfs/ |
H A D | kernel_interface.cpp | 25 corresponding node of the bound (source) filesystem. 27 TODO: node monitoring! 32 TODO: Since the source node IDs are used for our nodes, this doesn't work 139 Node* node = (Node*)fsDir->private_node; local 142 volume, node, node->ID(), entryName); 144 FETCH_SOURCE_VOLUME_AND_NODE(volume, node->ID()); 174 Node* node = new(std::nothrow) Node(vnid, st.st_mode); local 175 if (node == NULL) 178 fsNode->private_node = node; 192 Node* node = (Node*)fsNode->private_node; local 206 Node* node = (Node*)fsNode->private_node; local 222 Node* node = (Node*)fsNode->private_node; local 245 Node* node = (Node*)fsNode->private_node; local 261 Node* node = (Node*)fsNode->private_node; local 279 Node* node = (Node*)fsNode->private_node; local 303 Node* node = (Node*)fsNode->private_node; local 319 Node* node = (Node*)fsNode->private_node; local 339 Node* node = (Node*)fsNode->private_node; local 360 Node* node = (Node*)fsNode->private_node; local 377 Node* node = (Node*)fsNode->private_node; local 393 Node* node = (Node*)fsNode->private_node; local 411 Node* node = (Node*)fsNode->private_node; local 428 Node* node = (Node*)fsNode->private_node; local 447 Node* node = (Node*)fsNode->private_node; local 464 Node* node = (Node*)fsNode->private_node; local 482 Node* node = (Node*)fsNode->private_node; local 498 Node* node = (Node*)fsNode->private_node; local 514 Node* node = (Node*)fsNode->private_node; local 531 Node* node = (Node*)fsNode->private_node; local 546 Node* node = (Node*)fsNode->private_node; local 568 Node* node = (Node*)fsNode->private_node; local 588 Node* node = (Node*)fsNode->private_node; local 608 Node* node = (Node*)fsNode->private_node; local 644 Node* node = (Node*)fsNode->private_node; local 659 Node* node = (Node*)fsNode->private_node; local 674 Node* node = (Node*)fsNode->private_node; local 690 Node* node = (Node*)fsNode->private_node; local 708 Node* node = (Node*)fsNode->private_node; local 729 Node* node = (Node*)fsNode->private_node; local 744 Node* node = (Node*)fsNode->private_node; local 759 Node* node = (Node*)fsNode->private_node; local 774 Node* node = (Node*)fsNode->private_node; local 789 Node* node = (Node*)fsNode->private_node; local 805 Node* node = (Node*)fsNode->private_node; local 821 Node* node = (Node*)fsNode->private_node; local 839 Node* node = (Node*)fsNode->private_node; local 854 Node* node = (Node*)fsNode->private_node; local 870 Node* node = (Node*)fsNode->private_node; local 887 Node* node = (Node*)fsNode->private_node; local 903 Node* node = (Node*)fsNode->private_node; local 922 Node* node = (Node*)fsNode->private_node; local 940 Node* node = (Node*)fsNode->private_node; local 957 Node* node = (Node*)fsNode->private_node; local 972 Node* node = (Node*)fsNode->private_node; local 988 Node* node = (Node*)fsNode->private_node; local 1005 Node* node = (Node*)fsNode->private_node; local 1022 Node* node = (Node*)fsNode->private_node; local 1045 Node* node = (Node*)fsNode->private_node; local 1066 Node* node = (Node*)fsNode->private_node; local 1083 Node* node = (Node*)fsNode->private_node; local [all...] |
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | Notifications.cpp | 17 const char* name, Node* node) 21 fNode(node) 38 const char* name, Node* node) 42 fNode(node) 60 Node* node) 66 fNode(node) 83 StatChangedNotification::StatChangedNotification(Node* node, uint32 statFields) argument 85 fNode(node), 102 AttributeChangedNotification::AttributeChangedNotification(Node* node, argument 105 fNode(node), 16 EntryCreatedNotification(Directory* directory, const char* name, Node* node) argument 37 EntryRemovedNotification(Directory* directory, const char* name, Node* node) argument 58 EntryMovedNotification(Directory* fromDirectory, const char* fromName, Directory* toDirectory, const char* toName, Node* node) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | NodeTable.cpp | 29 NodeTable::AddNode(Node *node) argument 31 status_t error = (node ? B_OK : B_BAD_VALUE); 33 if (fNodes.Lookup(node->GetID()) != NULL) 34 fNodes.Remove(node); 35 SET_ERROR(error, fNodes.Insert(node)); 42 NodeTable::RemoveNode(Node *node) argument 44 status_t error = (node ? B_OK : B_BAD_VALUE); 46 error = RemoveNode(node->GetID()); 66 Node *node = fNodes.Lookup(id); local 67 return node; [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
H A D | BeOSKernelVolume.h | 36 virtual status_t GetVNodeType(void* node, int* type); 41 void** node, int* type, uint32* flags, 43 virtual status_t WriteVNode(void* node, bool reenter); 44 virtual status_t RemoveVNode(void* node, bool reenter); 47 virtual status_t IOCtl(void* node, void* cookie, 49 virtual status_t SetFlags(void* node, void* cookie, 51 virtual status_t Select(void* node, void* cookie, 53 virtual status_t Deselect(void* node, void* cookie, 56 virtual status_t FSync(void* node); 58 virtual status_t ReadSymlink(void* node, cha [all...] |
/haiku/src/add-ons/kernel/network/stack/ |
H A D | net_buffer.cpp | 79 size_t offset; // the net_buffer-wide offset of this node 82 uint16 used; // defines how much memory is used by this node 619 data_node* node = NULL; local 620 while ((node = (data_node*)list_get_next_item(&buffer->buffers, node)) 622 dprintf(" node %p, offset %lu, used %u, header %u, tail %u, " 623 "header %p\n", node, node->offset, node->used, node 676 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 941 data_node* node = (data_node*)alloc_data_header_space(header, local 967 data_node* node = (data_node*)alloc_data_header_space(buffer, local 988 remove_data_node(data_node* node) argument 1015 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 1113 data_node* node = add_first_data_node(header); local 1193 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 1397 data_node* node = NULL; local 1412 data_node* node = (data_node*)list_get_next_item(&with->buffers, last); local 1561 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 1685 data_node* node = (data_node*)list_get_last_item(&buffer->buffers); local 1821 data_node* node = NULL; local 2071 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 2096 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 2114 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 2150 data_node* node = (data_node*)list_get_first_item(&source->buffers); local 2265 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local 2286 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); local [all...] |
/haiku/src/servers/media/ |
H A D | NodeManager.cpp | 79 BLocker("node manager"), 93 // #pragma mark - Default node management 97 NodeManager::SetDefaultNode(node_type type, const media_node* node, argument 103 if (node != NULL) 104 status = fDefaultManager->Set(node->node, NULL, 0, type); 106 status = fDefaultManager->Set(input->node.node, input->name, 143 // #pragma mark - Live node management 153 registered_node node; local 213 registered_node& node = found->second; local 258 registered_node& node = found->second; local 325 registered_node& node = found->second; local 358 registered_node& node = found->second; local 372 GetCloneForID(media_node_id id, team_id team, media_node* node) argument 413 GetClone(node_type type, team_id team, media_node* node, char* inputName, int32* _inputID) argument 449 ReleaseNode(const media_node& node, team_id team) argument 464 PublishInputs(const media_node& node, const media_input* inputs, int32 count) argument 492 PublishOutputs(const media_node &node, const media_output* outputs, int32 count) argument 526 registered_node& node = iterator->second; local 562 GetDormantNodeInfo(const media_node& node, dormant_node_info* nodeInfo) argument 604 GetLiveNodeInfo(const media_node& node, live_node_info* liveInfo) argument 640 registered_node& node = iterator->second; local 677 registered_node& node = iterator->second; local 752 registered_node& node = iterator->second; local 1117 SetNodeTimeSource(media_node_id node, media_node_id timesource) argument 1147 registered_node& node = iterator->second; local 1255 registered_node& node = iterator->second; local 1364 registered_node& node = found->second; local 1389 _NotifyTimeSource(registered_node& node) argument [all...] |
/haiku/src/libs/uuid/ |
H A D | unparse.c | 59 uuid.node[0], uuid.node[1], uuid.node[2], 60 uuid.node[3], uuid.node[4], uuid.node[5]);
|
/haiku/src/kits/print/ |
H A D | FolderWatcher.cpp | 51 // add this handler to the application for node monitoring 60 node_ref node; local 61 while (fFolder.GetNextEntry(&entry) == B_OK && entry.GetNodeRef(&node) == B_OK) { 62 StartAttrWatching(&node); 73 // stop node watching for spooler directory 103 bool FolderWatcher::BuildNodeRef(BMessage* msg, node_ref* node) { argument 104 return (msg->FindInt32("device", &node->device) == B_OK && 105 msg->FindInt64("node", &node->node) 109 node_ref node; local 119 node_ref node; local 127 node_ref node; local 169 StartAttrWatching(node_ref* node) argument 173 StopAttrWatching(node_ref* node) argument [all...] |