Searched refs:node (Results 251 - 275 of 965) sorted by relevance

<<11121314151617181920>>

/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A DShareVolume.cpp181 // delete the root node
255 // create node map
279 // create local node ID map
287 // create remote node ID map
295 // get a local node ID for our root node
300 // create the root node
307 // add the root node to the node map
360 "allocate the node I
366 ShareNode* node = it.Next().value; local
396 Node* node; local
460 ShareNode* node = NULL; local
515 WriteVNode(Node* node, char reenter) argument
529 RemoveVNode(Node* node, char reenter) argument
561 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
577 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
704 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
900 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
990 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1117 ShareDir* node = dynamic_cast<ShareDir*>(_node); local
1334 Node* node; local
1348 Node* node; local
1400 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1480 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1611 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1734 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1802 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1850 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1899 ShareNode* node = dynamic_cast<ShareNode*>(_node); local
1961 ShareNode* node; local
2444 ShareNode* node = _GetNodeByRemoteID(nodeInfo.GetID()); local
2649 _LoadAttrDir(ShareNode* node, const AttrDirInfo& attrDirInfo) argument
2693 ShareNode* node = _GetNodeByRemoteID(remoteID); local
2709 _AddAttrDirIterator(ShareNode* node, ShareAttrDirIterator* iterator) argument
2742 _RemoveAttrDirIterator(ShareNode* node, ShareAttrDirIterator* iterator) argument
2775 ShareNode* node = _GetNodeByRemoteID(remoteID); local
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DAttributeIterator.h18 AttributeIterator(Node *node = NULL);
21 status_t SetTo(Node *node);
H A DDirectoryEntryTable.h56 status_t AddEntry(Directory *node, Entry *child);
58 status_t RemoveEntry(Directory *node, Entry *child);
94 DirectoryEntryTable::AddEntry(Directory *node, Entry *child) argument
96 status_t error = (node && child ? B_OK : B_BAD_VALUE);
98 error = AddEntry(node->GetID(), child);
116 DirectoryEntryTable::RemoveEntry(Directory *node, Entry *child) argument
118 status_t error = (node && child ? B_OK : B_BAD_VALUE);
120 error = RemoveEntry(node->GetID(), child->GetName());
H A DNodeTable.h47 status_t AddNode(Node *node);
48 status_t RemoveNode(Node *node);
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DExtentAllocator.h62 Value* GetValue(AVLTreeNode* node) const
64 return static_cast<Value*>(node);
99 status_t _AddAllocatedExtent(CachedExtent* node);
100 status_t _AddFreeExtent(CachedExtent* node);
101 void _CombineFreeExtent(CachedExtent* node);
102 void _RemoveExtent(CachedExtent* node);
103 void _DumpInOrder(CachedExtent* node) const;
104 void _Delete(CachedExtent* node);
/haiku/headers/private/media/
H A DMediaMisc.h23 #define IS_INVALID_NODE(_node) ((_node).node <= 0 || (_node).port <= 0)
35 #define IS_SYSTEM_TIMESOURCE(_node) ((_node).node == NODE_SYSTEM_TIMESOURCE_ID)
/haiku/src/system/kernel/vm/
H A DVMUserArea.h39 Value* GetValue(AVLTreeNode* node) const
41 return static_cast<Value*>(node);
/haiku/src/apps/haikudepot/process/
H A DAbstractProcessNode.h35 void AddPredecessor(AbstractProcessNode* node);
59 void _AddSuccessor(AbstractProcessNode* node);
/haiku/src/add-ons/kernel/bus_managers/pci/
H A Dpci_device.cpp20 device_node* node; member in struct:pci_device
25 pci_device_init_driver(device_node* node, void** _cookie) argument
29 if (gDeviceManager->get_attr_uint8(node, B_PCI_DEVICE_DOMAIN, &domain,
31 || gDeviceManager->get_attr_uint8(node, B_PCI_DEVICE_BUS, &bus,
33 || gDeviceManager->get_attr_uint8(node, B_PCI_DEVICE_DEVICE,
35 || gDeviceManager->get_attr_uint8(node, B_PCI_DEVICE_FUNCTION,
50 device->node = node;
/haiku/src/kits/storage/
H A DNode.cpp38 node((ino_t)-1)
43 node_ref::node_ref(dev_t device, ino_t node) argument
46 node(node)
54 node((ino_t)-1)
63 return (device == other.device && node == other.node);
80 return this->node < other.node;
88 node
149 BNode(const BNode& node) argument
401 operator =(const BNode& node) argument
[all...]
/haiku/src/system/kernel/device_manager/
H A Ddevice_manager.cpp71 device_node* owner; // associated node; NULL for temporary allocation
82 Device(device_node* node, const char* moduleName);
129 // The following two are only valid, if the node's driver is
134 void AddChild(device_node *node);
135 void RemoveChild(device_node *node);
222 find_attr(const device_node* node, const char* name, bool recursive, argument
227 = node->Attributes().GetIterator();
239 node = node->Parent();
240 } while (node !
491 device_node* node = iterator.Next(); local
579 rescan_node(device_node* node) argument
633 unregister_node(device_node* node) argument
647 get_driver(device_node* node, driver_module_info** _module, void** _data) argument
682 device_node* node = iterator.Next(); local
690 device_node* node = iterator.Next(); local
713 get_parent_node(device_node* node) argument
728 put_node(device_node* node) argument
736 publish_device(device_node *node, const char *path, const char *moduleName) argument
786 unpublish_device(device_node *node, const char *path) argument
807 get_attr_uint8(const device_node* node, const char* name, uint8* _value, bool recursive) argument
823 get_attr_uint16(const device_node* node, const char* name, uint16* _value, bool recursive) argument
839 get_attr_uint32(const device_node* node, const char* name, uint32* _value, bool recursive) argument
855 get_attr_uint64(const device_node* node, const char* name, uint64* _value, bool recursive) argument
871 get_attr_string(const device_node* node, const char* name, const char** _value, bool recursive) argument
887 get_attr_raw(const device_node* node, const char* name, const void** _data, size_t* _length, bool recursive) argument
906 get_next_attr(device_node* node, device_attr** _attr) argument
939 device_node* node = iterator.Next(); local
1154 Device(device_node* node, const char* moduleName) argument
1467 AddChild(device_node* node) argument
1492 RemoveChild(device_node* node) argument
2394 device_node* node = NULL; local
[all...]
/haiku/src/kits/media/
H A DTimeSourceObjectManager.h27 BTimeSource* GetTimeSource(const media_node& node);
/haiku/src/tests/system/kernel/device_manager/playground/
H A Ddriver.cpp58 init_driver(device_node* node, void** _cookie) argument
60 *_cookie = node;
74 device_node* node = (device_node*)cookie; local
76 gDeviceManager->publish_device(node, "net/sample/0",
H A Dspecific_video_driver.cpp51 init_driver(device_node *node, void **_cookie) argument
53 *_cookie = node;
67 device_node* node = (device_node*)cookie; local
69 gDeviceManager->publish_device(node, "graphics/specific/0",
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DVolume.h67 status_t GetVNode(ino_t id, VNode **node);
70 status_t FindVNode(ino_t id, VNode *node);
71 status_t FindVNode(uint32 dirID, uint32 objectID, VNode *node);
76 status_t ReadLink(VNode *node, char *buffer, size_t bufferSize,
/haiku/src/system/kernel/arch/sparc/
H A Darch_system_info.cpp25 arch_fill_topology_node(cpu_topology_node_info* node, int32 cpu) argument
/haiku/src/system/kernel/arch/arm64/
H A Darch_system_info.cpp20 arch_fill_topology_node(cpu_topology_node_info* node, int32 cpu) argument
/haiku/src/add-ons/media/media-add-ons/equalizer/
H A DEqualizerAddOn.cpp77 EqualizerNode* node = new EqualizerNode(this); local
78 return node;
82 EqualizerAddOn::GetConfigurationFor(BMediaNode* node, BMessage* message) argument
94 EqualizerAddOn::AutoStart(int count, BMediaNode** node, int32* id, bool* more) argument
/haiku/src/add-ons/kernel/drivers/disk/scsi/scsi_disk/
H A Dscsi_disk.h24 device_node* node; member in struct:das_driver_info
/haiku/src/add-ons/kernel/drivers/disk/scsi/scsi_cd/
H A Dscsi_cd.h27 device_node* node; member in struct:cd_driver_info
/haiku/src/libs/compat/openbsd_wlan/
H A Dsubr_tree.c47 rb_n2e(const struct rb_type *t, void *node) argument
49 unsigned long addr = (unsigned long)node;
406 void *node; local
413 node = rb_e2n(t, tmp);
414 comp = (*t->t_compare)(elm, node);
420 return (node);
440 /* Finds the node with the same key as elm */
445 void *node; local
449 node = rb_e2n(t, tmp);
450 comp = (*t->t_compare)(key, node);
467 void *node; local
571 _rb_left(const struct rb_type *t, void *node) argument
579 _rb_right(const struct rb_type *t, void *node) argument
587 _rb_parent(const struct rb_type *t, void *node) argument
595 _rb_set_left(const struct rb_type *t, void *node, void *left) argument
604 _rb_set_right(const struct rb_type *t, void *node, void *right) argument
613 _rb_set_parent(const struct rb_type *t, void *node, void *parent) argument
622 _rb_poison(const struct rb_type *t, void *node, unsigned long poison) argument
631 _rb_check(const struct rb_type *t, void *node, unsigned long poison) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
H A DHaikuKernelNode.h38 static HaikuKernelNode* GetNode(fs_vnode* node);
74 HaikuKernelNode::GetNode(fs_vnode* node) argument
76 return static_cast<HaikuKernelNode*>(node);
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregcomp.c43 static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node);
44 static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node);
46 bin_tree_t *node);
47 static reg_errcode_t calc_first (void *extra, bin_tree_t *node);
48 static reg_errcode_t calc_next (void *extra, bin_tree_t *node);
49 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node);
55 int node, int root);
121 static void free_token (re_token_t *node);
122 static reg_errcode_t free_tree (void *extra, bin_tree_t *node);
123 static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node);
311 int node = init_state->nodes.elems[node_cnt]; local
1044 int node, i, mb_chars = 0, has_period = 0; local
1178 bin_tree_t *node, *prev; local
1210 bin_tree_t *node; local
1240 optimize_subexps(void *extra, bin_tree_t *node) argument
1271 lower_subexps(void *extra, bin_tree_t *node) argument
1293 lower_subexp(reg_errcode_t *err, regex_t *preg, bin_tree_t *node) argument
1330 calc_first(void *extra, bin_tree_t *node) argument
1352 calc_next(void *extra, bin_tree_t *node) argument
1375 link_nfa_nodes(void *extra, bin_tree_t *node) argument
1643 calc_eclosure_iter(re_node_set *new_set, re_dfa_t *dfa, int node, int root) argument
3741 mark_opt_subexp(void *extra, bin_tree_t *node) argument
3753 free_token(re_token_t *node) argument
3768 free_tree(void *extra, bin_tree_t *node) argument
3783 const bin_tree_t *node; local
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DAttributeIndex.h29 virtual void NodeAdded(Node* node);
30 virtual void NodeRemoved(Node* node);
31 virtual void NodeChanged(Node* node, uint32 statFields,
/haiku/src/kits/storage/mime/
H A DDatabaseDirectory.cpp71 BNode node; local
73 return node.SetTo(&entry) == B_OK
74 && node.GetAttrInfo(BPrivate::Storage::Mime::kTypeAttr, &info) == B_OK;

Completed in 115 milliseconds

<<11121314151617181920>>