Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 1172) sorted by relevance

12345678910>>...47

/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp69 AVLTreeBase::LeftMost(AVLTreeNode* node) const in LeftMost()
71 if (node) { in LeftMost()
72 while (node->left) in LeftMost()
73 node = node->left; in LeftMost()
76 return node; in LeftMost()
81 AVLTreeBase::RightMost(AVLTreeNode* node) const in RightMost()
83 if (node) { in RightMost()
84 while (node->right) in RightMost()
85 node = node->right; in RightMost()
88 return node; in RightMost()
[all …]
/haiku/src/libs/zydis/Zycore/
H A DList.c41 #define ZYCORE_LIST_GET_NODE_DATA(node) \ argument
42 ((void*)(node + 1))
60 static ZyanStatus ZyanListAllocateNode(ZyanList* list, ZyanListNode** node) in ZyanListAllocateNode() argument
63 ZYAN_ASSERT(node); in ZyanListAllocateNode()
69 ZYAN_CHECK(list->allocator->allocate(list->allocator, (void**)node, in ZyanListAllocateNode()
75 *node = list->first_unused; in ZyanListAllocateNode()
76 list->first_unused = (*node)->next; in ZyanListAllocateNode()
85 *node = (ZyanListNode*)((ZyanU8*)list->buffer + size); in ZyanListAllocateNode()
100 static ZyanStatus ZyanListDeallocateNode(ZyanList* list, ZyanListNode* node) in ZyanListDeallocateNode() argument
103 ZYAN_ASSERT(node); in ZyanListDeallocateNode()
[all …]
/haiku/src/tests/kits/storage/
H A DNodeTest.cpp68 BNode *node; in ConvertTestStatablesToNodes() local
70 for (testNodes.rewind(); testNodes.getNext(node, entryName); ) in ConvertTestStatablesToNodes()
71 testStatables.add(node, entryName); in ConvertTestStatablesToNodes()
207 BNode node; in InitTest1() local
208 CPPUNIT_ASSERT( node.InitCheck() == B_NO_INIT ); in InitTest1()
214 BNode node(fileLink); in InitTest1() local
215 CPPUNIT_ASSERT( node.InitCheck() == B_OK ); in InitTest1()
219 BNode node(nonExisting); in InitTest1() local
220 CPPUNIT_ASSERT( node.InitCheck() == B_ENTRY_NOT_FOUND ); in InitTest1()
224 BNode node((const char *)NULL); in InitTest1() local
[all …]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
H A DHaikuKernelVolume.cpp87 HaikuKernelNode* node = fNodes->Get(vnodeID); in NewVNode() local
88 if (node != NULL) in NewVNode()
98 node = new(std::nothrow) HaikuKernelNode(this, vnodeID, privateNode, ops, in NewVNode()
100 if (node == NULL) { in NewVNode()
106 status_t error = fNodes->Put(vnodeID, node); in NewVNode()
108 delete node; in NewVNode()
112 *_node = node; in NewVNode()
126 HaikuKernelNode* node = fNodes->Get(vnodeID); in PublishVNode() local
127 if (node != NULL) { in PublishVNode()
128 if (node->published) in PublishVNode()
[all …]
H A DHaikuKernelVolume.h32 fs_vnode_ops* ops, HaikuKernelNode** node);
35 HaikuKernelNode** node);
36 void UndoNewVNode(HaikuKernelNode* node);
37 void UndoPublishVNode(HaikuKernelNode* node);
51 virtual status_t GetFileMap(void* node, off_t offset,
58 virtual status_t GetVNodeName(void* node, char* buffer,
61 void** node, int* type, uint32* flags,
63 virtual status_t WriteVNode(void* node, bool reenter);
64 virtual status_t RemoveVNode(void* node, bool reenter);
67 virtual status_t DoIO(void* node, void* cookie,
[all …]
/haiku/headers/private/shared/
H A DLRUCache.h79 LRUNode* node = fMap.Get(key); in Put() local
81 if (node != NULL) { in Put()
82 if (node->fValue != value) { in Put()
83 node->fValue = value; in Put()
84 _DisconnectNodeAndMakeNewest(node); in Put()
87 node = new(std::nothrow) LRUNode(key, value); in Put()
88 if (node == NULL) in Put()
90 status_t result = fMap.Put(key, node); in Put()
92 delete node; in Put() local
95 _SetNewestNode(node); in Put()
[all …]
/haiku/src/kits/media/
H A DTimeSourceObject.cpp26 TimeSourceObject::TimeSourceObject(const media_node& node) in TimeSourceObject() argument
28 BMediaNode("some timesource object", node.node, node.kind), in TimeSourceObject()
29 BTimeSource(node.node) in TimeSourceObject()
32 B_PRId32 "\n", node.node); in TimeSourceObject()
40 fControlPort = node.port; in TimeSourceObject()
42 ASSERT(fNodeID == node.node); in TimeSourceObject()
43 ASSERT(fKinds == node.kind); in TimeSourceObject()
45 if (node.node == NODE_SYSTEM_TIMESOURCE_ID) { in TimeSourceObject()
50 if (BMediaRoster::Roster()->GetLiveNodeInfo(node, &liveNodeInfo) in TimeSourceObject()
55 node.node); in TimeSourceObject()
[all …]
H A DMediaRoster.cpp95 node(local_node) {} in LocalNode()
99 node(NULL) {} in LocalNode()
103 if (a.node == this->node) in operator ==()
108 BMediaNode* node; member
137 LocalNode* node = NULL; in ~MediaRosterUndertaker() local
138 sRegisteredNodes.Get(i, &node); in ~MediaRosterUndertaker()
139 if (node != NULL) { in ~MediaRosterUndertaker()
141 " was not released correctly\n", node->node->ID()); in ~MediaRosterUndertaker()
244 BMediaRosterEx::RegisterLocalNode(BMediaNode* node) in RegisterLocalNode() argument
246 sRegisteredNodes.Insert(LocalNode(node)); in RegisterLocalNode()
[all …]
/haiku/src/add-ons/kernel/file_systems/bindfs/
H A Dkernel_interface.cpp139 Node* node = (Node*)fsDir->private_node; in bindfs_lookup() local
142 volume, node, node->ID(), entryName); in bindfs_lookup()
144 FETCH_SOURCE_VOLUME_AND_NODE(volume, node->ID()); in bindfs_lookup()
174 Node* node = new(std::nothrow) Node(vnid, st.st_mode); in bindfs_get_vnode() local
175 if (node == NULL) in bindfs_get_vnode()
178 fsNode->private_node = node; in bindfs_get_vnode()
180 *_type = node->Mode() & S_IFMT; in bindfs_get_vnode()
192 Node* node = (Node*)fsNode->private_node; in bindfs_get_vnode_name() local
194 FUNCTION("volume: %p, node: %p\n", volume, node); in bindfs_get_vnode_name()
196 FETCH_SOURCE_VOLUME_AND_NODE(volume, node->ID()); in bindfs_get_vnode_name()
[all …]
/haiku/headers/private/kernel/util/
H A DAVLTreeMap.h68 Node* Previous(Node* node) const;
69 Node* Next(Node* node) const;
74 inline Iterator GetIterator(Node* node);
75 inline ConstIterator GetIterator(Node* node) const;
85 status_t Remove(Node* node);
92 const AVLTreeNode* node);
96 void _FreeTree(AVLTreeNode* node);
100 inline void _Free(Node* node);
101 inline Key _GetKey(Node* node) const;
102 inline Value& _GetValue(Node* node) const;
[all …]
/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A Dnetfs.cpp30 void **node);
31 static int netfs_write_vnode(void *ns, void *node, char reenter);
32 static int netfs_remove_vnode(void *ns, void *node, char reenter);
36 static int netfs_read_stat(void *ns, void *node, struct stat *st);
37 static int netfs_write_stat(void *ns, void *node, struct stat *st,
39 static int netfs_access(void *ns, void *node, int mode);
44 static int netfs_open(void *ns, void *node, int openMode, void **cookie);
45 static int netfs_close(void *ns, void *node, void *cookie);
46 static int netfs_free_cookie(void *ns, void *node, void *cookie);
47 static int netfs_read(void *ns, void *node, void *cookie, off_t pos,
[all …]
/haiku/src/servers/media/
H A DNodeManager.cpp97 NodeManager::SetDefaultNode(node_type type, const media_node* node, in SetDefaultNode() argument
103 if (node != NULL) in SetDefaultNode()
104 status = fDefaultManager->Set(node->node, NULL, 0, type); in SetDefaultNode()
106 status = fDefaultManager->Set(input->node.node, input->name, in SetDefaultNode()
153 registered_node node; in RegisterNode() local
154 node.timesource_id = timesource; in RegisterNode()
155 node.add_on_id = addOnID; in RegisterNode()
156 node.flavor_id = flavorID; in RegisterNode()
157 strlcpy(node.name, name, sizeof(node.name)); in RegisterNode()
158 node.kinds = kinds; in RegisterNode()
[all …]
/haiku/src/add-ons/kernel/network/stack/
H A Dnet_buffer.cpp620 data_node* node = NULL; in dump_buffer() local
621 while ((node = (data_node*)list_get_next_item(&buffer->buffers, node)) in dump_buffer()
624 "header %p\n", node, node->offset, node->used, node->HeaderSpace(), in dump_buffer()
625 node->TailSpace(), node->header); in dump_buffer()
627 if ((node->flags & DATA_NODE_STORED_HEADER) != 0) { in dump_buffer()
628 dump_block((char*)node->start - buffer->stored_header_length, in dump_buffer()
631 dump_block((char*)node->start, min_c(node->used, 64), " "); in dump_buffer()
677 data_node* node = (data_node*)list_get_first_item(&buffer->buffers); in check_buffer() local
678 while (node != NULL) { in check_buffer()
679 if (node->offset != size) { in check_buffer()
[all …]
/haiku/src/add-ons/kernel/file_cache/
H A Dlaunch_speedup.cpp57 struct node { struct
58 struct node *next; argument
68 typedef node ValueType; argument
72 return VNODE_HASH(key.device, key.node); in HashKey()
80 bool Compare(KeyType key, ValueType* node) const in Compare()
82 return (node->ref.device == key.device && node->ref.node == key.node); in Compare()
96 ino_t node, int32 seconds);
109 void AddNode(dev_t device, ino_t node);
110 void RemoveNode(dev_t device, ino_t node);
125 struct node *_FindNode(dev_t device, ino_t node);
[all …]
/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp25 CacheableNode(off_t offset,bplustree_node *node) in CacheableNode() argument
28 fNode(node) in CacheableNode()
65 CacheableNode *node = (CacheableNode *)Cache<off_t>::Get(offset); in Get() local
66 return node->fNode; in Get()
204 bplustree_node *node = fCache.Get(header.root_node_pointer); in SetTo() local
208 return fStatus = node && CheckNode(node) ? B_OK : B_BAD_DATA; in SetTo()
265 bplustree_node *node; in Validate() local
266 if ((node = fCache.Get(info.offset)) == NULL in Validate()
267 || !info.free && !CheckNode(node)) { in Validate()
272 if ((node = fCache.Get(info.from)) != NULL) in Validate()
[all …]
/haiku/src/system/kernel/platform/openfirmware/
H A Dopenfirmware_devices.cpp24 intptr_t node = *_cookie; in of_get_next_device() local
29 if (node == 0) { in of_get_next_device()
34 node = root; in of_get_next_device()
36 node = of_peer(0); in of_get_next_device()
38 if (node == OF_FAILED) in of_get_next_device()
40 if (node == 0) in of_get_next_device()
44 next = node; in of_get_next_device()
46 next = of_child(node); in of_get_next_device()
53 next = of_peer(node); in of_get_next_device()
61 next = of_parent(node); in of_get_next_device()
[all …]
/haiku/src/kits/print/
H A DFolderWatcher.cpp60 node_ref node; in FolderWatcher() local
61 while (fFolder.GetNextEntry(&entry) == B_OK && entry.GetNodeRef(&node) == B_OK) { in FolderWatcher()
62 StartAttrWatching(&node); in FolderWatcher()
103 bool FolderWatcher::BuildNodeRef(BMessage* msg, node_ref* node) { in BuildNodeRef() argument
104 return (msg->FindInt32("device", &node->device) == B_OK && in BuildNodeRef()
105 msg->FindInt64("node", &node->node) == B_OK); in BuildNodeRef()
109 node_ref node; in HandleCreatedEntry() local
112 BuildNodeRef(msg, &node)) { in HandleCreatedEntry()
113 if (fWatchAttrChanges) StartAttrWatching(&node); in HandleCreatedEntry()
114 fListener->EntryCreated(&node, &entry); in HandleCreatedEntry()
[all …]
/haiku/src/add-ons/kernel/file_systems/packagefs/
H A Dkernel_interface.cpp45 lock_directory_for_node(Volume* volume, Node* node, DirectoryReadLocker& locker) in lock_directory_for_node() argument
47 if (Directory* directory = dynamic_cast<Directory*>(node)) { in lock_directory_for_node()
51 BReference<Directory> parentRef = node->GetParent(); in lock_directory_for_node()
55 return locker.IsLocked() && node->GetParentUnchecked() == locker.Get(); in lock_directory_for_node()
61 check_access(Node* node, int mode) in check_access() argument
67 return check_access_permissions(mode, node->Mode(), node->GroupID(), in check_access()
68 node->UserID()); in check_access()
148 Node* node = (Node*)fsDir->private_node; in packagefs_lookup() local
151 node, node->ID(), entryName); in packagefs_lookup()
153 if (!S_ISDIR(node->Mode())) in packagefs_lookup()
[all …]
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DExtentAllocator.cpp110 CachedExtent* node = FindClosest(lowerBound, false); in FillFreeExtents() local
113 uint64 flags = node->flags & (~BTRFS_EXTENT_FLAG_ALLOCATED); in FillFreeExtents()
114 if (lowerBound < node->offset) { in FillFreeExtents()
115 hole = CachedExtent::Create(lowerBound, node->offset - lowerBound, in FillFreeExtents()
123 while ((next = Next(node)) != NULL && next->End() < upperBound) { in FillFreeExtents()
124 if (node->End() == next->offset) { in FillFreeExtents()
125 node = next; in FillFreeExtents()
129 hole = CachedExtent::Create(node->End(), next->offset - node->End(), in FillFreeExtents()
134 node = next; in FillFreeExtents()
138 if (upperBound > node->End()) { in FillFreeExtents()
[all …]
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DLastModifiedIndex.cpp27 LastModifiedIndexPrimaryKey(Node* node, time_t modified) in LastModifiedIndexPrimaryKey() argument
29 node(node), in LastModifiedIndexPrimaryKey()
34 LastModifiedIndexPrimaryKey(Node* node) in LastModifiedIndexPrimaryKey() argument
36 node(node), in LastModifiedIndexPrimaryKey()
37 modified(node->ModifiedTime().tv_sec) in LastModifiedIndexPrimaryKey()
43 node(NULL), in LastModifiedIndexPrimaryKey()
48 Node* node; member in LastModifiedIndexPrimaryKey
78 if (a.node != NULL && a.node == b.node) in operator ()()
118 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength) in GetNodeValue()
120 *(time_t*)buffer = node->ModifiedTime().tv_sec; in GetNodeValue()
[all …]
H A DSizeIndex.cpp27 SizeIndexPrimaryKey(Node* node, off_t size) in SizeIndexPrimaryKey() argument
29 node(node), in SizeIndexPrimaryKey()
34 SizeIndexPrimaryKey(Node* node) in SizeIndexPrimaryKey() argument
36 node(node), in SizeIndexPrimaryKey()
37 size(node->FileSize()) in SizeIndexPrimaryKey()
43 node(NULL), in SizeIndexPrimaryKey()
48 Node* node; member in SizeIndexPrimaryKey
78 if (a.node != NULL && a.node == b.node) in operator ()()
117 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength) in GetNodeValue()
119 *(off_t*)buffer = node->FileSize(); in GetNodeValue()
[all …]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A DBeOSKernelVolume.h36 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, char* buffer,
[all …]
/haiku/src/kits/package/
H A DFetchUtils.cpp29 BNode node(&entry); in IsDownloadCompleted() local
30 return IsDownloadCompleted(node); in IsDownloadCompleted()
35 FetchUtils::IsDownloadCompleted(const BNode& node) in IsDownloadCompleted() argument
38 status_t status = _GetAttribute(node, DL_COMPLETE_ATTR, in IsDownloadCompleted()
52 FetchUtils::MarkDownloadComplete(BNode& node) in MarkDownloadComplete() argument
55 return _SetAttribute(node, DL_COMPLETE_ATTR, in MarkDownloadComplete()
61 FetchUtils::SetFileType(BNode& node, const char* type) in SetFileType() argument
63 return _SetAttribute(node, "BEOS:TYPE", in SetFileType()
68 FetchUtils::_SetAttribute(BNode& node, const char* attrName, in _SetAttribute() argument
71 if (node.InitCheck() != B_OK) in _SetAttribute()
[all …]
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DRPCServer.cpp357 ServerNode* node = _Find(address); in _Acquire() local
358 if (node != NULL) { in _Acquire()
359 node->fRefCount++; in _Acquire()
360 *_server = node->fServer; in _Acquire()
365 node = new(std::nothrow) ServerNode; in _Acquire()
366 if (node == NULL) in _Acquire()
369 node->fID = address; in _Acquire()
374 delete node; in _Acquire()
378 node->fServer = new Server(conn, &node->fID); in _Acquire()
379 if (node->fServer == NULL) { in _Acquire()
[all …]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/
H A DVolume.h47 virtual status_t GetVNodeType(void* node, int* type);
51 virtual status_t GetVNodeName(void* node, char* buffer,
54 void** node, int* type, uint32* flags,
56 virtual status_t WriteVNode(void* node, bool reenter);
57 virtual status_t RemoveVNode(void* node, bool reenter);
60 virtual status_t DoIO(void* node, void* cookie,
62 virtual status_t CancelIO(void* node, void* cookie,
73 virtual status_t IOCtl(void* node, void* cookie,
75 virtual status_t SetFlags(void* node, void* cookie,
77 virtual status_t Select(void* node, void* cookie,
[all …]

12345678910>>...47