Searched refs:node (Results 151 - 175 of 965) sorted by relevance

1234567891011>>

/haiku/src/add-ons/kernel/file_systems/fat/
H A Ddir.h15 ino_t *vnid, vnode **node);
17 ino_t *vnid, vnode **node);
19 ino_t *vnid, vnode **node, bool *dups_exist);
21 ino_t *vnid, vnode **node, bool *dups_exist);
22 status_t erase_dir_entry(nspace *vol, vnode *node);
25 status_t create_dir_entry(nspace *vol, vnode *dir, vnode *node,
/haiku/src/system/boot/platform/efi/arch/arm64/
H A Darch_dtb.cpp38 arch_handle_fdt(const void* fdt, int node) argument
40 const char* deviceType = (const char*)fdt_getprop(fdt, node,
49 info->id = fdt32_to_cpu(*(uint32*)fdt_getprop(fdt, node,
58 const char* compatible = (const char*)fdt_getprop(fdt, node,
73 dtb_get_reg(fdt, node, 0, interrupt_controller.regs1);
74 dtb_get_reg(fdt, node, 1, interrupt_controller.regs2);
/haiku/src/add-ons/kernel/bus_managers/virtio/
H A Dvirtio_balloon.cpp27 virtio_balloon_init_device(device_node *node, void **_cookie) argument
32 VirtioBalloonDevice(node);
98 virtio_balloon_init_driver(device_node *node, void **_cookie) argument
101 *_cookie = node;
110 device_node *node = (device_node *)cookie; local
118 return gDeviceManager->register_node(node,
144 NULL, // register node
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DVolume.cpp48 // node ID of the root directory
184 // remove the packages from the node tree
206 Node* node = fNodes.Clear(true); local
207 while (node != NULL) {
208 Node* next = node->IDHashTableNext();
209 node->ReleaseReference();
210 node = next;
400 // create the root node
431 // publish the root node
457 Volume::IOCtl(Node* node, uint3 argument
569 AddNodeListener(NodeListener* listener, Node* node) argument
587 Node* node = listener->ListenedNode(); local
619 UpdateLiveQueries(Node* node, const char* attribute, int32 type, const void* oldKey, size_t oldLength, const void* newKey, size_t newLength) argument
653 PublishVNode(Node* node) argument
661 PackageLinkNodeAdded(Node* node) argument
671 PackageLinkNodeRemoved(Node* node) argument
681 PackageLinkNodeChanged(Node* node, uint32 statFields, const OldNodeAttributes& oldAttributes) argument
1019 PackageNode* node = package->Nodes().Head(); local
1056 Node* node; local
1183 Node* node = directory->FindChild(packageNode->Name()); local
1290 _RemovePackageNode(Directory* directory, PackageNode* packageNode, Node* node, bool notify) argument
1402 Node* node = unpackingNode->GetNode(); local
1421 _RemoveNode(Node* node) argument
1434 _RemoveNodeAndVNode(Node* node) argument
1878 _AddPackageLinksNode(Node* node) argument
1898 _RemovePackageLinksNode(Node* node) argument
1925 _NotifyNodeAdded(Node* node) argument
1951 _NotifyNodeRemoved(Node* node) argument
1977 _NotifyNodeChanged(Node* node, uint32 statFields, const OldNodeAttributes& oldAttributes) argument
[all...]
/haiku/src/add-ons/media/media-add-ons/equalizer/
H A DEqualizerAddOn.h21 virtual status_t GetConfigurationFor(BMediaNode* node, BMessage* message);
23 virtual status_t AutoStart(int count, BMediaNode** node, int32* id, bool* more);
/haiku/src/apps/glteapot/
H A Dutil.h18 /* Create a node with no next */
22 /* Create a node with specified next */
26 /* Create a node and insert it in a list right after `prev' */
44 /* Create a list pointing to the specified node */
68 for (LispNode<contents>* node = first; node; node = node->cdr)
69 if (node->car == element)
79 for (LispNode<contents>* node
196 remove(LispNode<contents>* node) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/exfat/
H A DInode.h193 static KeyType GetKey(const NodeType* node) argument
195 return node->ID();
198 static SplayTreeLink<NodeType>* GetLink(NodeType* node) argument
200 return &node->fInoTreeLink;
203 static int Compare(KeyType key, const NodeType* node) argument
205 return key == node->ID() ? 0
206 : (key < node->ID() ? -1 : 1);
209 static NodeType** GetListLink(NodeType* node) argument
211 return &node->fInoTreeNext;
221 static KeyType GetKey(const NodeType* node) argument
226 GetLink(NodeType* node) argument
231 Compare(KeyType key, const NodeType* node) argument
237 GetListLink(NodeType* node) argument
[all...]
/haiku/src/libs/uuid/
H A Dcompare.c53 return memcmp(uuid1.node, uuid2.node, 6);
/haiku/src/system/boot/loader/file_systems/amiga_ffs/
H A DDirectory.cpp101 NodeBlock *node; local
103 while ((node = iterator.GetNext(block)) != NULL) {
105 if (node->GetName(fileName, sizeof(fileName)) == B_OK
107 if (node->IsFile())
109 if (node->IsDirectory())
125 NodeBlock *node = iterator->GetNext(block); local
126 if (node == NULL)
129 return node->GetName(name, size);
/haiku/headers/libs/print/libprint/
H A DDbgMsg.h23 void DUMP_BNODE(BNode *node);
29 #define DUMP_BNODE(node) (void)0
/haiku/src/bin/bfs_tools/lib/
H A Ddump.h23 extern void dump_inode(const Inode* node, const bfs_inode* inode,
28 extern void dump_bplustree_node(const bplustree_node* node,
/haiku/src/system/kernel/arch/ppc/
H A Darch_system_info.cpp62 arch_fill_topology_node(cpu_topology_node_info* node, int32 cpu) argument
64 switch (node->type) {
67 node->data.root.platform = B_CPU_PPC_64;
69 node->data.root.platform = B_CPU_PPC;
74 node->data.package.vendor = sCPUVendor;
75 node->data.package.cache_line_size = CACHE_LINE_SIZE;
79 node->data.core.model = sPVR;
80 node->data.core.default_frequency = sCPUClockFrequency;
/haiku/src/apps/cortex/AddOnHost/
H A DAddOnHostApp.cpp80 // fetch node info
102 media_node node; local
103 err = r->InstantiateDormantNode(info, &node);
107 // err = r->GetNodeFor(node.node, &node);
112 m.AddInt32("node_id", node.node);
126 // fetch node info
148 media_node node; local
[all...]
/haiku/src/system/boot/platform/efi/arch/arm/
H A Darch_dtb.cpp46 arch_handle_fdt(const void* fdt, int node) argument
48 const char* deviceType = (const char*)fdt_getprop(fdt, node,
57 info->id = fdt32_to_cpu(*(uint32*)fdt_getprop(fdt, node,
66 const char* compatible = (const char*)fdt_getprop(fdt, node,
81 dtb_get_reg(fdt, node, 0, interrupt_controller.regs1);
82 dtb_get_reg(fdt, node, 1, interrupt_controller.regs2);
96 dtb_get_reg(fdt, node, 0, timer.regs);
97 timer.interrupt = dtb_get_interrupt(fdt, node);
/haiku/src/apps/debugger/user_interface/cli/commands/
H A DCliPrintVariableCommand.cpp102 CliPrintVariableCommand::_ResolveValueIfNeeded(ValueNode* node, argument
114 if (node->LocationAndValueResolutionState() == VALUE_NODE_UNRESOLVED) {
116 context.CurrentThread()->GetCpuState(), container, node);
119 while (node->LocationAndValueResolutionState()
129 if (node->LocationAndValueResolutionState() == B_OK && maxDepth > 0) {
130 for (int32 i = 0; i < node->CountChildren(); i++) {
131 ValueNodeChild* child = node->ChildAt(i);
138 // the intervening compound, don't consider the hidden node
140 if (node->GetType()->Kind() == TYPE_ADDRESS
/haiku/src/add-ons/kernel/bus_managers/fdt/
H A Dfdt_module.cpp57 device_node* node; member in struct:fdt_bus
63 device_node* node; member in struct:fdt_device
85 fdt_register_node(fdt_bus* bus, int node, device_node* parentDev, argument
88 TRACE("%s('%s', %p)\n", __func__, fdt_get_name(gFDT, node, NULL),
94 const char *name = fdt_get_name(gFDT, node, &nameLen);
105 attrs.Add({ "fdt/node", B_UINT32_TYPE, {.ui32 = (uint32)node}});
108 prop = fdt_getprop(gFDT, node, "device_type", &propLen);
112 prop = fdt_getprop(gFDT, node, "compatible", &propLen);
132 prop = fdt_getprop(gFDT, node, "phandl
142 fdt_traverse(fdt_bus* bus, int &node, int &depth, device_node* parentDev) argument
215 fdt_bus_init(device_node* node, void** cookie) argument
264 int node = -1, depth = -1; local
302 fdt_device_init_driver(device_node* node, void** cookie) argument
382 fdt_get_address_cells(const void* fdt, int node) argument
400 fdt_get_size_cells(const void* fdt, int node) argument
467 fdt_get_interrupt_parent(fdt_device* dev, int node) argument
488 int node = fdt_node_offset_by_phandle(gFDT, interrupt_parent_phandle); local
[all...]
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp78 NodeChecker(const bplustree_node* node, int32 nodeSize, const char* text) argument
80 fNode(node),
244 // Note: This code will fail if the block size is smaller than the node size!
245 // Since BFS supports block sizes of 1024 bytes or greater, and the node size
291 const bplustree_node* node; local
292 if (SetTo(offset, &node, check) == B_OK)
293 return node;
319 FATAL(("invalid node [%p] read from offset %" B_PRIdOFF " (block %"
353 FATAL(("invalid node [%p] read from offset %" B_PRIdOFF " (block %"
468 // The node i
776 const bplustree_node* node; local
859 bplustree_node* node = cached.SetToWritable(transaction, NodeSize(), false); local
871 bplustree_node* node = cached.SetToWritable(transaction, offset, false); local
1043 _FindKey(const bplustree_node* node, const uint8* key, uint16 keyLength, uint16* _index, off_t* _next) argument
1117 const bplustree_node* node; local
1156 _FindFreeDuplicateFragment(Transaction& transaction, const bplustree_node* node, CachedNode& cached, off_t* _offset, bplustree_node** _fragment, uint32* _index) argument
1198 _InsertDuplicate(Transaction& transaction, CachedNode& cached, const bplustree_node* node, uint16 index, off_t value) argument
1365 _InsertKey(bplustree_node* node, uint16 index, uint8* key, uint16 keyLength, off_t value) argument
1417 _SplitNode(bplustree_node* node, off_t nodeOffset, bplustree_node* other, off_t otherOffset, uint16* _keyIndex, uint8* key, uint16* _keyLength, off_t* _value) argument
1699 const bplustree_node* node; local
1828 _RemoveDuplicate(Transaction& transaction, const bplustree_node* node, CachedNode& cached, uint16 index, off_t value) argument
2034 _RemoveKey(bplustree_node* node, uint16 index) argument
2112 const bplustree_node* node; local
2236 const bplustree_node* node; local
2294 const bplustree_node* node; local
2385 const bplustree_node* node; local
2525 const bplustree_node* node; local
2592 const bplustree_node* node; local
2662 const bplustree_node* node; local
2825 const bplustree_node* node; local
[all...]
/haiku/src/tests/system/kernel/file_corruption/fs/
H A DTransaction.cpp89 Transaction::StartAndAddNode(Node* node, uint32 flags) argument
95 return AddNode(node, flags);
109 status_t error = info->node->Flush(*this);
170 info->node->RevertNodeData(info->oldNodeData);
178 // delete the node infos
199 Transaction::AddNode(Node* node, uint32 flags) argument
203 NodeInfo* info = _GetNodeInfo(node);
212 node->WriteLock();
214 info->node = node;
246 RemoveNode(Node* node) argument
263 UpdateNodeFlags(Node* node, uint32 flags) argument
276 KeepNode(Node* node) argument
[all...]
H A DVolume.cpp250 Volume::NewNode(Node* node) argument
252 return new_vnode(fFSVolume, node->BlockIndex(), node, &gCheckSumFSVnodeOps);
257 Volume::PublishNode(Node* node, uint32 flags) argument
259 return publish_vnode(fFSVolume, node->BlockIndex(), node,
260 &gCheckSumFSVnodeOps, node->Mode(), flags);
272 Volume::PutNode(Node* node) argument
274 return put_vnode(fFSVolume, node->BlockIndex());
279 Volume::RemoveNode(Node* node) argument
286 UnremoveNode(Node* node) argument
306 Node* node; local
379 DeleteNode(Node* node) argument
484 _CreateNode(Node* node, Transaction& transaction) argument
[all...]
/haiku/src/kits/media/
H A DNotifications.cpp57 Register(const BMessenger& notifyHandler, const media_node& node, argument
74 msg.AddData("node", B_RAW_TYPE, &node, sizeof(node));
81 Unregister(const BMessenger& notifyHandler, const media_node& node, argument
98 msg.AddData("node", B_RAW_TYPE, &node, sizeof(node));
105 notifications from this node. If \a info isn't \c NULL, it's used as a
107 The message field "be:node_id" will contain the node I
110 ReportError(const media_node& node, BMediaNode::node_error what, const BMessage* info) argument
228 ParameterChanged(const media_node& node, int32 parameterID) argument
241 WebChanged(const media_node& node) argument
253 NewParameterValue(const media_node& node, int32 parameterID, bigtime_t when, const void* param, size_t paramsize) argument
283 NodeStopped(const media_node& node, bigtime_t when) argument
[all...]
H A DMediaRecorder.cpp123 media_node node; local
128 err = BMediaRoster::Roster()->GetAudioMixer(&node);
132 err = BMediaRoster::Roster()->GetVideoInput(&node);
144 err = _Connect(node, NULL, format);
147 BMediaRoster::Roster()->ReleaseNode(node);
167 media_node node;
169 &node, B_FLAVOR_IS_GLOBAL);
176 err = _Connect(node, NULL, format);
179 BMediaRoster::Roster()->ReleaseNode(node);
188 BMediaRecorder::Connect(const media_node& node, argument
375 _Connect(const media_node& node, const media_output* output, const media_format& format) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DVolume.h61 inline NodeListenerValue(NodeListener *listener, Node *node, uint32 flags) argument
62 : listener(listener), node(node), flags(flags) {}
68 Node *node; member in class:NodeListenerValue
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);
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DAttributeIndex.cpp43 Node* node; member in struct:AttributeIndexTreeValue
85 Value* GetValue(AVLTreeNode* node) const
87 return static_cast<Value*>(node);
98 // node itself, we must not return 0, though. We consider a node-less
99 // key always less than an actual tree node with the same attribute
157 static void GetTreeNodeValue(TreeNode* node, void* buffer, argument
160 if (node->length > 0)
161 memcpy(buffer, node->data, node
306 NodeAdded(Node* node) argument
319 NodeRemoved(Node* node) argument
331 NodeChanged(Node* node, uint32 statFields, const OldNodeAttributes& oldAttributes) argument
422 NodeChanged(Node* node, uint32 statFields, const OldNodeAttributes& oldAttributes) argument
[all...]
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/
H A DIMAPFolder.cpp120 BNode node(&fRef);
121 status_t status = node.InitCheck();
126 status = node.GetNodeRef(&nodeRef);
130 fNodeID = nodeRef.node;
133 if (node.ReadAttrString(kMailboxNameAttribute, &originalMailboxName) == B_OK
138 fUIDValidity = _ReadUInt32(node, kUIDValidityAttribute);
139 fLastUID = _ReadUInt32(node, kLastUIDAttribute);
144 status = node.GetAttrInfo(kStateAttribute, &info);
154 ssize_t bytesRead = node.ReadAttr(kStateAttribute, B_RAW_TYPE, 0,
193 BNode node(
244 BNode node; local
528 BNode node; local
653 _MailToIMAPFlags(BNode& node, uint32& flags) argument
714 _WriteUniqueID(BNode& node, uint32 uid) const argument
747 _WriteFlags(BNode& node, uint32 flags) const argument
754 _ReadUInt32(BNode& node, const char* attribute) const argument
767 _WriteUInt32(BNode& node, const char* attribute, uint32 value) const argument
[all...]
/haiku/src/system/kernel/
H A Dcpu.cpp200 cpu_create_topology_node(cpu_topology_node* node, int32* maxID, int32 id) argument
202 cpu_topology_level level = static_cast<cpu_topology_level>(node->level - 1);
208 node->children[id] = newNode;
230 cpu_rebuild_topology_tree(cpu_topology_node* node, int32* lastID) argument
232 if (node->children == NULL)
236 for (int32 i = 0; i < node->children_count; i++) {
237 if (node->children[i] == NULL)
241 node->children[count] = node->children[i];
243 if (node
279 cpu_topology_node* node = &sCPUTopology; local
[all...]

Completed in 467 milliseconds

1234567891011>>