Searched refs:id (Results 126 - 150 of 1213) sorted by relevance

1234567891011>>

/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNodeTable.cpp52 NodeTable::RemoveNode(ino_t id) argument
55 if (Node *element = fNodes.Lookup(id))
64 NodeTable::GetNode(ino_t id) argument
66 Node *node = fNodes.Lookup(id);
/haiku/src/kits/storage/
H A DAddOnImage.h21 void SetID(image_id id);
/haiku/headers/private/libroot/
H A Dtime_private.h26 int32 id; member in struct:__timer_t
29 void SetTo(int32 id, thread_id thread) argument
31 this->id = id;
/haiku/src/add-ons/kernel/file_systems/xfs/
H A DDirectory.h24 xfs_ino_t* id) = 0;
/haiku/src/apps/icon-o-matic/generic/property/
H A DCommonPropertyIDs.h46 const char* name_for_id(int32 id);
/haiku/src/bin/
H A Dlistimage.c24 list_images_for_team_by_id(team_id id) argument
32 status_t result = get_team_info(id, &teamInfo);
33 if (id != 1 && result < B_OK)
49 if (id == 1)
52 printf("\nTEAM %4" B_PRId32 " (%s):\n", id, teamInfo.args);
59 while ((result = get_next_image_info(id, &cookie, &imageInfo)) == B_OK) {
60 printf(format, imageInfo.id, imageInfo.text, imageInfo.data,
H A Dramdisk.cpp37 " delete <id>\n"
39 " flush <id>\n"
60 "Usage: %s %s <id>\n"
61 "Deletes the existing RAM disk with ID <id>. All modified data will be\n"
66 "Usage: %s %s <id>\n"
67 "Writes all modified data of the RAM disk with ID <id> back to the file\n"
179 request.id = -1;
222 kRamDiskRawDeviceBasePath, request.id);
260 long long id = strtol(idString, &end, 0); local
261 if (end == idString || *end != '\0' || id <
324 long long id = strtol(idString, &end, 0); local
399 long long id = strtol(idString, &end, 0); local
[all...]
H A Dxres.cpp48 " -a <type>:<id>[:<name>] ( <file> | -s <data> )\n"
50 " of type <type> and has the ID <id>. If given the resource will\n"
54 " -d <type>[:<id>]\n"
55 " - Excludes resources with type <type> and, if given, ID <id> from\n"
73 " -x <type>[:<id>]\n"
74 " - Only resources with type <type> and, if given, ID <id> will be\n"
83 " <id> - A positive or negative integer.\n"
106 int32 id; member in struct:ResourceID
109 ResourceID(type_code type = B_ANY_TYPE, int32 id = 0,
113 id(i
310 AddResource(const ResourceID &id, const char *name, ResourceDataSource *dataSource) argument
362 int32 id; local
427 int32 id; local
462 AddResource(const ResourceID &id, const char *name, ResourceDataSource *dataSource) argument
620 AddResourceCommand(const ResourceID &id, const char *name, ResourceDataSource *dataSource) argument
738 int id = 0; local
[all...]
/haiku/src/tools/cppunit/
H A DThreadedTestCase.cpp39 thread_id id = find_thread(NULL); local
44 map<thread_id, ThreadSubTestInfo*>::iterator i = fNumberMap.find(id);
67 thread_id id = find_thread(NULL); local
71 isSingleThreaded = fNumberMap.find(id) == fNumberMap.end();
99 BThreadedTestCase::InitThreadInfo(thread_id id, string threadName) { argument
101 map<thread_id, ThreadSubTestInfo*>::iterator i = fNumberMap.find(id);
110 fNumberMap[id] = info;
/haiku/src/system/kernel/
H A DTeamThreadTables.h51 if (entry->id >= 0) {
91 Element* Lookup(id_type id, bool visibleOnly = true) const argument
93 Element* element = fTable.Lookup(id);
109 entry->id = -1;
135 if (nextEntry->id >= 0 && (!visibleOnly || nextEntry->visible)) {
157 return HashKey(value->id);
162 return value->id == key;
H A Dport.cpp62 // (Team::id % kTeamListLockCount).
64 // state. id is immutable.
120 port_id id; member in struct:__anon6::Port
147 // id is initialized when the caller adds the port to the hash table
175 return HashKey(value->id);
180 return value->id == key;
252 fID(port->id),
280 fID(port->id)
299 fID(portRef->id),
308 Read(port_id id, int3 argument
337 Write(port_id id, int32 readCount, int32 writeCount, int32 code, size_t bufferSize, ssize_t result) argument
379 Info(port_id id, int32 readCount, int32 writeCount, int32 code, ssize_t result) argument
1041 const port_id id = port->id; local
1061 close_port(port_id id) argument
1091 delete_port(port_id id) argument
1142 select_port(int32 id, struct select_info* info, bool kernel) argument
1188 deselect_port(int32 id, struct select_info* info, bool kernel) argument
1238 _get_port_info(port_id id, port_info* info, size_t size) argument
1314 port_buffer_size(port_id id) argument
1321 port_buffer_size_etc(port_id id, uint32 flags, bigtime_t timeout) argument
1330 _get_port_message_info_etc(port_id id, port_message_info* info, size_t infoSize, uint32 flags, bigtime_t timeout) argument
1409 port_count(port_id id) argument
1435 read_port_etc(port_id id, int32* _code, void* buffer, size_t bufferSize, uint32 flags, bigtime_t timeout) argument
1536 write_port(port_id id, int32 msgCode, const void* buffer, size_t bufferSize) argument
1545 write_port_etc(port_id id, int32 msgCode, const void* buffer, size_t bufferSize, uint32 flags, bigtime_t timeout) argument
1555 writev_port_etc(port_id id, int32 msgCode, const iovec* msgVecs, size_t vecCount, size_t bufferSize, uint32 flags, bigtime_t timeout) argument
1690 set_port_owner(port_id id, team_id newTeamID) argument
1767 _user_close_port(port_id id) argument
1774 _user_delete_port(port_id id) argument
1796 _user_get_port_info(port_id id, struct port_info *userInfo) argument
[all...]
H A Dthread.cpp142 return Notify(eventCode, thread->id, thread->team->id, thread);
204 id = threadID >= 0 ? threadID : allocate_thread_id();
209 snprintf(lockName, sizeof(lockName), "Thread:%" B_PRId32, id);
289 Thread::Get(thread_id id) argument
292 Thread* thread = sThreadHash.Lookup(id);
300 Thread::GetAndLock(thread_id id) argument
304 Thread* thread = sThreadHash.Lookup(id);
315 if (sThreadHash.Lookup(id) == thread)
328 Thread::GetDebug(thread_id id) argument
335 IsAlive(thread_id id) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DDirectoryIterator.h29 status_t Get(char* name, size_t* _nameLength, ino_t* id);
30 status_t GetNext(char* name, size_t* _nameLength, ino_t* id);
36 size_t nameLength, ino_t id, uint8 type);
37 status_t FindEntry(const char* name, ino_t* id = NULL);
40 status_t ChangeEntry(Transaction& transaction, ino_t id,
53 uint8 nameLength, ino_t id, uint8 fileType,
57 const char* name, uint8 nameLength, ino_t id,
/haiku/headers/private/kernel/
H A Dport.h45 status_t writev_port_etc(port_id id, int32 msgCode, const iovec *msgVecs,
51 status_t _user_close_port(port_id id);
52 status_t _user_delete_port(port_id id);
54 status_t _user_get_port_info(port_id id, struct port_info *info);
67 status_t _user_writev_port_etc(port_id id, int32 msgCode,
/haiku/src/tests/add-ons/kernel/partitioning_systems/
H A DPartitioningSystemsTest.cpp47 partition->id = sNextID++;
51 device->id = partition->id;
85 sDiskDevices.insert(std::make_pair(partition->id, device));
86 sPartitions.insert(std::make_pair(partition->id, partition));
89 *_id = partition->id;
96 print_disk_device(partition_id id) argument
98 disk_device_data* data = get_disk_device(id);
100 printf("device ID %ld\n", id);
118 print_partition(partition_id id) argument
386 partition_id id; local
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DVolume.h49 dev_t GetID() const { return fFSVolume->id; }
67 status_t GetVNode(ino_t id, VNode **node);
68 status_t PutVNode(ino_t id);
70 status_t FindVNode(ino_t id, VNode *node);
82 bool IsNegativeEntry(ino_t id);
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DRPCCallbackServer.h62 inline Callback* GetCallback(int32 id);
99 CallbackServer::GetCallback(int32 id) argument
102 if (id >= 0 && static_cast<uint32>(id) < fArraySize)
103 return fCallbackArray[id].fCallback;
/haiku/src/system/kernel/fs/
H A Drootfs.cpp67 ino_t id; member in struct:__anon39::rootfs_vnode
89 return vnode->id;
94 return vnode->id == key;
107 dev_t id; member in struct:__anon39::rootfs
164 return vnode->parent->id;
189 vnode->id = fs->next_vnode_id++;
284 notify_stat_changed(fs->id, get_parent_id(dir), dir->id,
310 notify_stat_changed(fs->id, get_parent_id(dir), dir->id,
520 rootfs_get_vnode(fs_volume* _volume, ino_t id, fs_vnode* _vnode, int* _type, uint32* _flags, bool reenter) argument
[all...]
/haiku/src/system/libroot/posix/musl/math/
H A Datanl.c133 int id; local
152 id = -1;
157 id = 0;
160 id = 1;
165 id = 2;
168 id = 3;
179 if (id < 0)
181 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
/haiku/headers/os/locale/
H A DCatalog.h36 const char* GetString(uint32 id);
39 status_t GetData(uint32 id, BMessage* msg);
126 #define B_TRANSLATE_ID(id) \
127 B_CATALOG->GetString((id))
173 #define B_TRANSLATE_MARK_ID(id) (id)
192 #define B_TRANSLATE_MARK_ID_VOID(id)
212 #define B_TRANSLATE_NOCOLLECT_ID(id) \
213 B_TRANSLATE_ID(id)
/haiku/src/bin/fwcontrol/
H A Deui64.c212 eui64_ntoa(const struct eui64 *id, char *a, size_t len) argument
217 id->octet[0], id->octet[1], id->octet[2], id->octet[3],
218 id->octet[4], id->octet[5], id->octet[6], id->octet[7]);
229 eui64_ntohost(char *hostname, size_t len, const struct eui64 *id) argument
280 eui64_hostton(const char *hostname, struct eui64 *id) argument
[all...]
/haiku/src/add-ons/accelerants/radeon_hd/
H A Ddisplay.cpp248 for (uint32 id = 0; id < MAX_DISPLAY; id++) {
249 gDisplay[id]->attached = false;
250 gDisplay[id]->powered = false;
251 gDisplay[id]->foundRanges = false;
255 for (uint32 id = 0; id < ATOM_MAX_SUPPORTED_DEVICE; id++) {
256 if (gConnector[id]
[all...]
/haiku/src/add-ons/kernel/network/protocols/unix/
H A DUnixAddress.h149 int32 id = 0; local
154 id = (id << 4) + (c - '0');
156 id = (id << 4) + 10 + (c - 'a');
161 return id;
/haiku/src/apps/deskbar/
H A DResourceSet.h87 const void* FindResource(type_code type, int32 id, size_t* outSize);
90 const BBitmap* FindBitmap(type_code type, int32 id);
93 const TStringBlock* FindStringBlock(type_code type, int32 id);
96 const char* FindString(type_code type, int32 id, uint32 index);
103 TypeItem* FindItemID(type_code type, int32 id);
106 TypeItem* LoadResource(type_code type, int32 id, const char* name,
/haiku/src/apps/resedit/
H A DResourceData.cpp25 ResourceData::ResourceData(const type_code &code, const int32 &id, argument
29 fID(id),
121 ResourceData::SetTo(const type_code &code, const int32 &id, argument
126 fID = id;
144 ResourceData::SetID(const int32 &id) argument
146 fID = id;

Completed in 202 milliseconds

1234567891011>>