Searched refs:node (Results 1 - 25 of 893) sorted by relevance

1234567891011>>

/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp69 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 DNodeRef.h14 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 DTimeSourceObject.cpp26 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 DNodeRef.h16 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/system/kernel/platform/openfirmware/
H A Dopenfirmware_devices.cpp24 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/src/add-ons/print/drivers/lpstyl/
H A DLpstylData.h20 LpstylData(BNode* node) argument
22 PrinterData(node)
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
H A DHaikuKernelVolume.cpp86 // 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 DNodeListener.cpp43 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 DPackageLinksListener.h20 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 DNodeTest.cpp68 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
766 BNode *node; local
788 AttrRenameTest(BNode &node) argument
843 BNode *node; local
860 AttrInfoTest(BNode &node) argument
926 BNode *node; local
944 AttrBStringTest(BNode &node) argument
1027 BNode *node; local
1057 BNode *node; local
1076 DupTest(BNode &node) argument
1091 BNode *node; local
1155 LockTest(BNode &node, const char *entryName) argument
1179 BNode *node; local
[all...]
/haiku/src/tests/system/kernel/
H A Dlock_node_test.cpp15 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/m68k/
H A Darch_system_info.cpp26 arch_fill_topology_node(cpu_topology_node_info* node, int32 cpu) argument
28 switch (node->type) {
30 node->data.root.platform = B_CPU_M68K;
34 node->data.package.vendor = B_CPU_VENDOR_MOTOROLA;
35 node->data.package.cache_line_size = CACHE_LINE_SIZE;
39 node->data.core.model = sCPURevision;
40 node->data.core.default_frequency = sCPUClockFrequency;
/haiku/src/add-ons/kernel/file_systems/bindfs/
H A Dkernel_interface.cpp26 corresponding node of the bound (source) filesystem.
28 TODO: node monitoring!
33 TODO: Since the source node IDs are used for our nodes, this doesn't work
139 Node* node = (Node*)fsDir->private_node; local
141 FUNCTION("volume: %p, dir: %p (%lld), entry: \"%s\"\n", volume, node,
142 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
359 Node* node = (Node*)fsNode->private_node; local
376 Node* node = (Node*)fsNode->private_node; local
392 Node* node = (Node*)fsNode->private_node; local
409 Node* node = (Node*)fsNode->private_node; local
425 Node* node = (Node*)fsNode->private_node; local
443 Node* node = (Node*)fsNode->private_node; local
459 Node* node = (Node*)fsNode->private_node; local
476 Node* node = (Node*)fsNode->private_node; local
491 Node* node = (Node*)fsNode->private_node; local
507 Node* node = (Node*)fsNode->private_node; local
523 Node* node = (Node*)fsNode->private_node; local
537 Node* node = (Node*)fsNode->private_node; local
558 Node* node = (Node*)fsNode->private_node; local
577 Node* node = (Node*)fsNode->private_node; local
596 Node* node = (Node*)fsNode->private_node; local
631 Node* node = (Node*)fsNode->private_node; local
646 Node* node = (Node*)fsNode->private_node; local
661 Node* node = (Node*)fsNode->private_node; local
677 Node* node = (Node*)fsNode->private_node; local
695 Node* node = (Node*)fsNode->private_node; local
716 Node* node = (Node*)fsNode->private_node; local
731 Node* node = (Node*)fsNode->private_node; local
746 Node* node = (Node*)fsNode->private_node; local
760 Node* node = (Node*)fsNode->private_node; local
775 Node* node = (Node*)fsNode->private_node; local
791 Node* node = (Node*)fsNode->private_node; local
807 Node* node = (Node*)fsNode->private_node; local
825 Node* node = (Node*)fsNode->private_node; local
839 Node* node = (Node*)fsNode->private_node; local
855 Node* node = (Node*)fsNode->private_node; local
872 Node* node = (Node*)fsNode->private_node; local
888 Node* node = (Node*)fsNode->private_node; local
907 Node* node = (Node*)fsNode->private_node; local
925 Node* node = (Node*)fsNode->private_node; local
941 Node* node = (Node*)fsNode->private_node; local
956 Node* node = (Node*)fsNode->private_node; local
972 Node* node = (Node*)fsNode->private_node; local
989 Node* node = (Node*)fsNode->private_node; local
1006 Node* node = (Node*)fsNode->private_node; local
1029 Node* node = (Node*)fsNode->private_node; local
1050 Node* node = (Node*)fsNode->private_node; local
1066 Node* node = (Node*)fsNode->private_node; local
[all...]
/haiku/src/tests/system/kernel/file_corruption/fs/
H A DNotifications.cpp17 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 DNodeTable.cpp29 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/bus_managers/fdt/
H A Dfdt_serial.cpp48 int node; local
74 node = fdt_path_offset(fdt, name);
76 if (node < 0) {
77 TRACE("%s: FDT node not found!\n", __func__);
82 regs = fdt_get_device_reg(fdt, node, false);
89 TRACE("serial: using '%s', node %d @ %" B_PRIxPHYSADDR "\n",
90 name, node, regs);
93 prop = fdt_getprop(fdt, node, "clock-frequency", &len);
100 prop = fdt_getprop(fdt, node, "current-speed", &len);
108 if (fdt_node_check_compatible(fdt, node, "ns16550
[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, cha
[all...]
/haiku/src/add-ons/kernel/network/stack/
H A Dnet_buffer.cpp79 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 DNodeManager.cpp79 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
448 ReleaseNode(const media_node& node, team_id team) argument
463 PublishInputs(const media_node& node, const media_input* inputs, int32 count) argument
491 PublishOutputs(const media_node &node, const media_output* outputs, int32 count) argument
525 registered_node& node = iterator->second; local
561 GetDormantNodeInfo(const media_node& node, dormant_node_info* nodeInfo) argument
603 GetLiveNodeInfo(const media_node& node, live_node_info* liveInfo) argument
639 registered_node& node = iterator->second; local
676 registered_node& node = iterator->second; local
751 registered_node& node = iterator->second; local
1116 SetNodeTimeSource(media_node_id node, media_node_id timesource) argument
1146 registered_node& node = iterator->second; local
1254 registered_node& node = iterator->second; local
1363 registered_node& node = found->second; local
1388 _NotifyTimeSource(registered_node& node) argument
[all...]
/haiku/src/kits/print/
H A DFolderWatcher.cpp51 // 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...]
/haiku/src/libs/uuid/
H A Dunparse.c59 uuid.node[0], uuid.node[1], uuid.node[2],
60 uuid.node[3], uuid.node[4], uuid.node[5]);
/haiku/src/add-ons/kernel/file_systems/packagefs/package/
H A DPackageDirectory.cpp31 PackageDirectory::AddChild(PackageNode* node) argument
33 fChildren.Add(node);
34 node->AcquireReference();
39 PackageDirectory::RemoveChild(PackageNode* node) argument
41 fChildren.Remove(node);
42 node->ReleaseReference();
/haiku/src/kits/shared/
H A DColorQuantizer.cpp44 bool isLeaf; // TRUE if node has no children
51 Node* next; // Pointer to next reducible node
158 // If the node doesn't exist, create it.
162 // Update color information if it's a leaf node.
170 // Recurse a level deeper if the node is not a leaf.
185 Node* node = (Node*)calloc(1, sizeof(Node)); local
187 if (node == NULL)
190 node->isLeaf = (level == bitsPerColor) ? true : false;
191 if (node->isLeaf)
194 node
211 Node* node = reducibleNodes[i]; local
258 _GetPaletteColors(Node* node, RGBA* table, uint32* _index, uint32* sums) const argument
[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);
35 //static int netfs_fsync(void *ns, void *node);
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, voi
316 netfs_read_vnode(void *ns, vnode_id vnid, char reenter, void **node) argument
339 Node* node = (Node*)_node; local
356 Node* node = (Node*)_node; local
388 Node* node = (Node*)_node; local
400 Node* node = (Node*)_node; local
412 Node* node = (Node*)_node; local
443 Node* node = (Node*)_node; local
455 Node* node = (Node*)_node; local
467 Node* node = (Node*)_node; local
480 Node* node = (Node*)_node; local
495 Node* node = (Node*)_node; local
510 Node* node = (Node*)_node; local
540 Node* node = (Node*)_node; local
576 Node* node = (Node*)_node; local
634 Node* node = (Node*)_node; local
646 Node* node = (Node*)_node; local
658 Node* node = (Node*)_node; local
671 Node* node = (Node*)_node; local
705 Node* node = (Node*)_node; local
735 Node* node = (Node*)_node; local
747 Node* node = (Node*)_node; local
759 Node* node = (Node*)_node; local
772 Node* node = (Node*)_node; local
788 Node* node = (Node*)_node; local
801 Node* node = (Node*)_node; local
817 Node* node = (Node*)_node; local
832 Node* node = (Node*)_node; local
845 Node* node = (Node*)_node; local
859 Node* node = (Node*)_node; local
910 netfs_free_query_cookie(void *ns, void *node, void *cookie) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/
H A DFUSEVolume.h44 virtual status_t GetVNodeName(void* node, char* buffer,
47 void** node, int* type, uint32* flags,
49 virtual status_t WriteVNode(void* node, bool reenter);
50 virtual status_t RemoveVNode(void* node, bool reenter);
53 virtual status_t SetFlags(void* node, void* cookie,
56 virtual status_t FSync(void* node);
58 virtual status_t ReadSymlink(void* node, char* buffer,
64 void* node);
69 virtual status_t Access(void* node, int mode);
70 virtual status_t ReadStat(void* node, struc
[all...]

Completed in 258 milliseconds

1234567891011>>