Searched refs:node (Results 26 - 50 of 965) sorted by relevance

1234567891011>>

/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
638 Node* node = (Node*)_node; local
650 Node* node = (Node*)_node; local
662 Node* node = (Node*)_node; local
675 Node* node = (Node*)_node; local
709 Node* node = (Node*)_node; local
739 Node* node = (Node*)_node; local
751 Node* node = (Node*)_node; local
763 Node* node = (Node*)_node; local
776 Node* node = (Node*)_node; local
792 Node* node = (Node*)_node; local
805 Node* node = (Node*)_node; local
821 Node* node = (Node*)_node; local
836 Node* node = (Node*)_node; local
849 Node* node = (Node*)_node; local
863 Node* node = (Node*)_node; local
914 netfs_free_query_cookie(void *ns, void *node, void *cookie) argument
[all...]
H A DVolume.h27 // TODO: Add the parent node ID and maybe get rid of parent volume.
49 status_t GetVNode(vnode_id vnid, Node** node);
51 status_t NewVNode(vnode_id vnid, Node* node);
73 Node** node);
74 virtual status_t WriteVNode(Node* node, char reenter);
75 virtual status_t RemoveVNode(Node* node, char reenter);
78 virtual status_t FSync(Node* node);
79 virtual status_t ReadStat(Node* node, struct stat* st);
80 virtual status_t WriteStat(Node* node, struct stat *st,
82 virtual status_t Access(Node* node, in
[all...]
/haiku/headers/libs/print/libprint/
H A DExports.h17 _EXPORT BMessage *config_page(BNode *node, BMessage *msg);
18 _EXPORT BMessage *config_job(BNode *node, BMessage *msg);
19 _EXPORT BMessage *take_job(BFile *spool_file, BNode *node, BMessage *msg);
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/
H A DDirectory.cpp80 Directory::AddChild(Node* node) argument
82 fChildTable.Insert(node);
83 fChildList.Add(node);
84 node->AcquireReference();
89 Directory::RemoveChild(Node* node) argument
91 Node* nextNode = fChildList.GetNext(node);
93 fChildTable.Remove(node);
94 fChildList.Remove(node);
95 node->ReleaseReference();
100 if (iterator->node
[all...]
/haiku/src/kits/debugger/value/type_handlers/
H A DBMessageTypeHandler.cpp45 ValueNode* node = new(std::nothrow) BMessageValueNode(nodeChild,
48 if (node == NULL)
51 _node = node;
/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp25 CacheableNode(off_t offset,bplustree_node *node) argument
28 fNode(node)
65 CacheableNode *node = (CacheableNode *)Cache<off_t>::Get(offset); local
66 return node->fNode;
204 bplustree_node *node = fCache.Get(header.root_node_pointer); local
205 //if (node)
206 // dump_bplustree_node(node);
208 return fStatus = node && CheckNode(node) ? B_OK : B_BAD_DATA;
229 // (for now only the node integrit
265 bplustree_node *node; local
307 bplustree_node *node = fCache.Get(offset); local
322 SetCurrentNode(bplustree_node *node,off_t offset,int8 to) argument
564 FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next) argument
625 bplustree_node *node; local
651 InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index) argument
721 SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value) argument
969 bplustree_node *node; local
1052 bplustree_node *node; local
1076 CheckNode(bplustree_node *node) argument
[all...]
/haiku/src/system/kernel/arch/arm/
H A Darch_system_info.cpp28 arch_fill_topology_node(cpu_topology_node_info* node, int32 cpu) argument
30 switch (node->type) {
33 node->data.root.platform = B_CPU_ARM;
37 //TODO node->data.package.vendor = sCPUVendor;
38 node->data.package.cache_line_size = CACHE_LINE_SIZE;
42 //TODO node->data.core.model = sPVR;
43 //TODO node->data.core.default_frequency = sCPUClockFrequency;
/haiku/src/system/libroot/posix/musl/search/
H A Dtsearch.h7 struct node { struct
/haiku/src/add-ons/kernel/file_systems/packagefs/
H A Dkernel_interface.cpp42 check_access(Node* node, int mode) argument
48 return check_access_permissions(mode, node->Mode(), node->GroupID(),
49 node->UserID());
135 Node* node; local
137 return volume->GetVNode(*_vnid, node);
142 Node* node; local
144 return volume->GetVNode(*_vnid, node);
147 // resolve normal entries -- look up the node
150 Node* node local
166 Node* node = (Node*)fsNode->private_node; local
187 Node* node = volume->FindNode(vnid); local
212 Node* node = (Node*)fsNode->private_node; local
235 Node* node = (Node*)fsNode->private_node; local
258 Node* node = (Node*)fsNode->private_node; local
274 Node* node = (Node*)fsNode->private_node; local
293 Node* node = (Node*)fsNode->private_node; local
308 Node* node = (Node*)fsNode->private_node; local
352 Node* node = (Node*)fsNode->private_node; local
393 Node* node = (Node*)fsNode->private_node; local
412 Node* node = (Node*)fsNode->private_node; local
516 Node* node = (Node*)fsNode->private_node; local
553 Node* node = (Node*)fsNode->private_node; local
573 Node* node = (Node*)fsNode->private_node; local
637 Node* node = (Node*)fsNode->private_node; local
659 Node* node = (Node*)fsNode->private_node; local
694 Node* node = (Node*)fsNode->private_node; local
713 Node* node = (Node*)fsNode->private_node; local
729 Node* node = (Node*)fsNode->private_node; local
749 Node* node = (Node*)fsNode->private_node; local
787 Node* node = (Node*)fsNode->private_node; local
806 Node* node = (Node*)fsNode->private_node; local
823 Node* node = (Node*)fsNode->private_node; local
[all...]
/haiku/src/add-ons/kernel/file_cache/
H A Dlaunch_speedup.cpp40 // ToDo: maybe ignore sessions if the node count is < 3 (without system libs)
57 struct node { struct
58 struct node *next;
68 typedef node ValueType;
72 return VNODE_HASH(key.device, key.node);
80 bool Compare(KeyType key, ValueType* node) const
82 return (node->ref.device == key.device && node->ref.node == key.node);
251 start_session(team_id team, dev_t device, ino_t node, const char *name, int32 seconds = 30) argument
325 struct node *node = new ::node; local
371 Session(team_id team, const char *name, dev_t device, ino_t node, int32 seconds) argument
429 struct node *node, *next = NULL; local
460 _FindNode(dev_t device, ino_t node) argument
473 struct node *node = _FindNode(device, id); local
491 struct node *node = _FindNode(device, id); local
570 struct node *node = new_node(nodeRef.device, nodeRef.node); local
612 struct node *node = iterator.Next(); local
683 New(const char *name, dev_t device, ino_t node, Session **_session) argument
712 node_opened(struct vnode *vnode, int32 fdType, dev_t device, ino_t parent, ino_t node, const char *name, off_t size) argument
747 node_closed(struct vnode *vnode, int32 fdType, dev_t device, ino_t node, int32 accessType) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
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, voi
[all...]
/haiku/src/system/kernel/util/
H A DRadixBitmap.cpp40 * free contiguous range of blocks under the node. It may contain a
46 * the ALL-ALLOCATED state and the ALL-FREE state. If a meta node is
48 * the node is considered stale. These states are used to optimize
66 * linear array. Each meta node is immediately followed (layed out
74 * must be encompassed in larger root-node radix.
106 radix_bitmap_init(radix_node *node, uint32 radix, uint32 skip, uint32 slots) argument
111 // leaf node
113 if (node) {
114 node->big_hint = big_hint;
116 node
[all...]
/haiku/src/add-ons/kernel/file_systems/exfat/
H A DVolume.h31 struct node { struct
35 SplayTreeLink<struct node> nodeTreeLink;
36 SplayTreeLink<struct node> inoTreeLink;
42 typedef struct node NodeType;
44 static KeyType GetKey(const NodeType* node) argument
46 return node->key;
49 static SplayTreeLink<NodeType>* GetLink(NodeType* node) argument
51 return &node->nodeTreeLink;
54 static int Compare(KeyType key, const NodeType* node) argument
56 if (key.cluster == node
69 GetKey(const NodeType* node) argument
74 GetLink(NodeType* node) argument
79 Compare(KeyType key, const NodeType* node) argument
[all...]
/haiku/headers/private/kernel/util/
H A DSplayTree.h18 cheaply iteratable (requires another pointer per node).
27 static const KeyType& GetKey(const NodeType* node);
28 static SplayTreeLink<NodeType>* GetLink(NodeType* node);
30 static int Compare(const KeyType& key, const NodeType* node);
33 static NodeType** GetListLink(NodeType* node);
61 \param node the item to insert.
63 bool Insert(Node* node) argument
65 Link* nodeLink = Definition::GetLink(node);
68 fRoot = node;
74 Key key = Definition::GetKey(node);
126 Remove(Node* node) argument
214 Node* node = fRoot; local
234 Node* node = fRoot; local
467 Node* node = fNext; local
497 Insert(Node* node) argument
516 Node* node = fTree.Remove(key); local
531 Remove(Node* node) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DVNode.cpp29 the ID of its parent node and its stat data (for fast and convenient
44 VNode::VNode(const VNode &node) argument
50 *this = node;
110 VNode::operator=(const VNode &node) argument
112 if (&node != this) {
113 fParentID = node.fParentID;
114 fDirID = node.fDirID;
115 fObjectID = node.fObjectID;
116 fStatData = node.fStatData;
/haiku/src/add-ons/print/drivers/gutenprint/
H A DGPData.h23 GPData(BNode* node) argument
25 PrinterData(node)
/haiku/src/add-ons/print/drivers/postscript/
H A DPSData.h22 PSData(BNode* node) argument
24 PrinterData(node)
/haiku/src/apps/icon-o-matic/document/savers/
H A DAttributeSaver.cpp32 BNode node(&fRef);
34 return iconExporter.Export(document->Icon(), &node, fAttrName.String());
/haiku/src/tests/system/kernel/device_manager/playground/
H A Dbus.h30 extern void bus_trigger_device_removed(device_node* node);
31 extern void bus_trigger_device_added(device_node* node);
/haiku/src/add-ons/tracker/mark_as/
H A DMarkAsRead.cpp22 BNode node(&ref);
25 if (node.InitCheck() == B_OK
26 && node.ReadAttrString("BEOS:TYPE", &type) == B_OK
38 if (read_read_attr(node, previousRead) != B_OK
41 if (node.ReadAttr(B_MAIL_ATTR_ACCOUNT_ID, B_INT32_TYPE,
45 write_read_attr(node, read);
53 if (node.ReadAttrString(B_MAIL_ATTR_STATUS, &previousStatus) != B_OK
55 node.WriteAttrString(B_MAIL_ATTR_STATUS, &status);
/haiku/src/tools/fs_shell/
H A Dnode_monitor.cpp12 const char *name, fssh_vnode_id node)
20 const char *name, fssh_vnode_id node)
29 fssh_vnode_id node)
37 fssh_vnode_id node, uint32_t statFields)
45 fssh_vnode_id node, const char *attribute, int32_t cause)
54 fssh_vnode_id node)
63 fssh_vnode_id node)
72 fssh_vnode_id node)
11 fssh_notify_entry_created(fssh_mount_id device, fssh_vnode_id directory, const char *name, fssh_vnode_id node) argument
19 fssh_notify_entry_removed(fssh_mount_id device, fssh_vnode_id directory, const char *name, fssh_vnode_id node) argument
27 fssh_notify_entry_moved(fssh_mount_id device, fssh_vnode_id fromDirectory, const char *fromName, fssh_vnode_id toDirectory, const char *toName, fssh_vnode_id node) argument
36 fssh_notify_stat_changed(fssh_mount_id device, fssh_vnode_id dir, fssh_vnode_id node, uint32_t statFields) argument
44 fssh_notify_attribute_changed(fssh_mount_id device, fssh_vnode_id dir, fssh_vnode_id node, const char *attribute, int32_t cause) argument
52 fssh_notify_query_entry_created(fssh_port_id port, int32_t token, fssh_mount_id device, fssh_vnode_id directory, const char *name, fssh_vnode_id node) argument
61 fssh_notify_query_entry_removed(fssh_port_id port, int32_t token, fssh_mount_id device, fssh_vnode_id directory, const char *name, fssh_vnode_id node) argument
70 fssh_notify_query_attr_changed(fssh_port_id port, int32_t token, fssh_mount_id device, fssh_vnode_id directory, const char *name, fssh_vnode_id node) argument
/haiku/src/kits/media/
H A DTimeSourceObjectManager.cpp65 TimeSourceObjectManager::GetTimeSource(const media_node& node) argument
70 PRINT(1, "TimeSourceObjectManager::GetTimeSource, node id %ld\n",
71 node.node);
73 NodeMap::iterator found = fMap.find(node.node);
77 // time sources are not accounted in node reference counting
78 BTimeSource* timeSource = new(std::nothrow) TimeSourceObject(node);
82 fMap.insert(std::make_pair(node.node, timeSourc
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNodeListener.h24 virtual void NodeAdded(Node *node);
25 virtual void NodeRemoved(Node *node);
/haiku/src/system/boot/platform/efi/
H A Ddtb.h18 bool dtb_get_reg(const void* fdt, int node, size_t idx, addr_range& range);
19 uint32 dtb_get_interrupt(const void* fdt, int node);

Completed in 180 milliseconds

1234567891011>>