/haiku/src/tests/servers/app/benchmark/ |
H A D | DrawingModeToString.cpp | 34 int entries = sizeof(kDrawingModes) / sizeof(DrawingModeString); local 35 for (int32 i = 0; i < entries; i++) { 47 int entries = sizeof(kDrawingModes) / sizeof(DrawingModeString); local 48 for (int32 i = 0; i < entries; i++) {
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Attribute.cpp | 91 btrfs_dir_entry* entries; local 93 status_t status = _Lookup(fName, nameLength, &entries, &length); 98 status = _FindEntry(entries, length, fName, nameLength, &entry); 100 free(entries); 107 free(entries); 119 btrfs_dir_entry* entries; local 121 status_t status = _Lookup(fName, nameLength, &entries, &length); 126 status = _FindEntry(entries, length, fName, nameLength, &entry); 128 free(entries); 141 free(entries); 157 btrfs_dir_entry* entries; local 180 _FindEntry(btrfs_dir_entry* entries, size_t length, const char* name, size_t nameLength, btrfs_dir_entry** _entry) argument [all...] |
H A D | AttributeIterator.cpp | 52 btrfs_dir_entry* entries; local 54 status_t status = fIterator->GetPreviousEntry((void**)&entries, 59 btrfs_dir_entry* entry = entries; 64 // TODO there could be several entries with the same name hash 74 free(entries);
|
H A D | DirectoryIterator.cpp | 74 btrfs_dir_entry* entries; local 76 status_t status = fIterator->GetNextEntry((void**)&entries, &entries_length); 80 btrfs_dir_entry* entry = entries; 85 // TODO there could be several entries with the same name hash 95 free(entries); 103 free(entries); 128 btrfs_dir_entry* entries; local 131 (void**)&entries, &length); 138 btrfs_dir_entry* entry = entries; 143 // TODO there could be several entries wit [all...] |
H A D | Attribute.h | 56 btrfs_dir_entry** entries = NULL, 59 status_t _FindEntry(btrfs_dir_entry* entries,
|
/haiku/src/add-ons/kernel/file_systems/fat/ |
H A D | dlist.cpp | 41 vol->dlist.entries = 0; 61 vol->dlist.entries = vol->dlist.allocated = 0; 77 ASSERT(allocate > vol->dlist.entries); 85 memcpy(vnid_list, vol->dlist.vnid_list, sizeof(ino_t) * vol->dlist.entries); 101 // XXX: check for duplicate entries 103 if (vol->dlist.entries == vol->dlist.allocated) { 107 vol->dlist.vnid_list[vol->dlist.entries++] = vnid; 120 for (i=0;i<vol->dlist.entries;i++) 123 ASSERT(i < vol->dlist.entries); 124 if (i == vol->dlist.entries) [all...] |
/haiku/src/tests/kits/storage/ |
H A D | QueryTest.h | 34 void AddLiveEntries(QueryTestEntry **entries, int32 entryCount, 36 void RemoveLiveEntries(QueryTestEntry **entries, int32 entryCount, 39 void CheckUpdateMessages(uint32 opcode, QueryTestEntry **entries,
|
H A D | StatableTest.h | 30 for (typename list<C*>::iterator it = entries.begin(); 31 it != entries.end(); 47 entries.clear(); 54 entries.push_back(entry); 60 bool result = (entryIt != entries.end() 73 entryIt = entries.begin(); 77 list<C*> entries; member in struct:TestEntries
|
/haiku/src/add-ons/kernel/partitioning_systems/session/ |
H A D | Disc.cpp | 186 cdrom_full_table_of_contents_entry* entries local 210 TRACE((" session = %d\n", entries[i].session)); 211 TRACE((" adr = %d\n", entries[i].adr)); 212 TRACE((" control = %d (%s track, copy %s)\n", entries[i].control, 213 (entries[i].control & kControlDataTrack ? "data" : "audio"), 214 (entries[i].control & kControlCopyPermitted 216 TRACE((" tno = %d\n", entries[i].tno)); 217 TRACE((" point = %d (0x%.2x)\n", entries[i].point, 218 entries[i].point)); 219 TRACE((" minutes = %d\n", entries[ 551 cdrom_full_table_of_contents_entry* entries; local 711 _AdjustForYellowBook(cdrom_full_table_of_contents_entry entries[], uint32 count) argument 797 _ParseTableOfContents(cdrom_full_table_of_contents_entry entries[], uint32 count) argument [all...] |
H A D | Disc.h | 50 entries[], 54 entries[],
|
/haiku/src/add-ons/tracker/openterminal/ |
H A D | OpenTerminal.cpp | 38 std::vector<BEntry> entries; local 58 for (uint x = 0; x < entries.size(); x++) { 59 if (entries[x] == entry) { 70 entries.push_back(BEntry(entry));
|
/haiku/src/system/libroot/posix/musl/search/ |
H A D | hsearch.c | 20 ENTRY *entries; member in struct:__tab 54 ENTRY *oldtab = htab->__tab->entries; 55 ENTRY *oldend = htab->__tab->entries + htab->__tab->mask + 1; 60 htab->__tab->entries = calloc(newsize, sizeof *htab->__tab->entries); 61 if (!htab->__tab->entries) { 62 htab->__tab->entries = oldtab; 71 newe = htab->__tab->entries + (i & htab->__tab->mask); 97 e = htab->__tab->entries + (i & htab->__tab->mask); 130 if (htab->__tab) free(htab->__tab->entries); [all...] |
/haiku/src/kits/storage/ |
H A D | AddOnMonitorHandler.cpp | 46 EntryList::iterator eiter = it->entries.begin(); 47 for (; eiter != it->entries.end(); eiter++) 70 // notifications arrive while we are still adding initial entries from the 72 // message and wants to process pending entries while we are still adding 219 // Search pending entries first, which can simply be discarded 237 eiter = diter->entries.begin(); 238 if (!_FindEntry(entryNodeRef, diter->entries, eiter)) { 245 diter->entries.erase(eiter); 253 if (_HasEntry(info.name, diter2->entries)) { 267 eiter = diter->entries [all...] |
/haiku/src/system/kernel/fs/ |
H A D | EntryCache.cpp | 23 entries(NULL) 30 delete[] entries; 38 entries = new(std::nothrow) EntryCacheEntry*[entries_size]; 39 if (entries == NULL) 42 memset(entries, 0, sizeof(EntryCacheEntry*) * entries_size); 64 // delete entries 121 fGenerations[entry->generation].entries[entry->index] = NULL; 162 fGenerations[entry->generation].entries[entry->index] = NULL; 198 fGenerations[oldGeneration].entries[entry->index] = NULL; 204 fGenerations[fCurrentGeneration].entries[inde [all...] |
/haiku/src/add-ons/kernel/busses/scsi/virtio/ |
H A D | VirtioSCSIRequest.cpp | 173 physical_entry *entries) 188 + sizeof(struct virtio_scsi_cmd_resp), &entries[0], 1); 189 entries[0].size = sizeof(struct virtio_scsi_cmd_req); 191 memcpy(entries + 1, fCCB->sg_list, fCCB->sg_count 195 entries[outCount].address = entries[0].address 197 entries[outCount].size = sizeof(struct virtio_scsi_cmd_resp); 200 memcpy(entries + outCount + 1, fCCB->sg_list, fCCB->sg_count 172 FillRequest(uint32 inCount, uint32 outCount, physical_entry *entries) argument
|
/haiku/headers/os/net/ |
H A D | net_settings.h | 25 _ns_entry_t* entries; member in struct:_ns_section
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | HTreeEntryIterator.cpp | 234 TRACE("HTreeEntryIterator::GetNext(): end of entries in the block\n"); 288 const HTreeEntry* entries = (const HTreeEntry*)blockData; local 290 (const HTreeCountLimit*)&entries[fFirstEntry]; 300 HTreeRoot* root = (HTreeRoot*)entries; 327 HTreeEntry* entries = (HTreeEntry*)blockData; 329 HTreeCountLimit* countLimit = (HTreeCountLimit*)&entries[fFirstEntry]; 359 memmove(&entries[fFirstEntry + count / 2], &secondBlockEntries[1], 371 memmove(&entries[fCurrentEntry + 2], &entries[fCurrentEntry + 1], 375 uint32 oldHash = entries[fCurrentEntr 392 HTreeEntry* entries = (HTreeEntry*)block; local [all...] |
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/ |
H A D | IMAPConnectionWorker.cpp | 169 MessageUIDList& entries, const BMessenger* replyTo = NULL) 173 fEntries(entries) 175 folder.RegisterPendingBodies(entries, replyTo); 371 printf("IMAP: get entries from %" B_PRIu32 " to %" B_PRIu32 "\n", 374 IMAP::MessageEntryList entries; 375 IMAP::FetchMessageEntriesCommand fetch(entries, from, to, false); 384 for (size_t i = 0; i < entries.size(); i++) { 386 B_PRIx32 "\n", entries[i].uid, entries[i].size, 387 entries[ 168 FetchBodiesCommand(IMAPFolder& folder, IMAPMailbox& mailbox, MessageUIDList& entries, const BMessenger* replyTo = NULL) argument 451 UpdateFlagsCommand(IMAPFolder& folder, IMAPMailbox& mailbox, MessageUIDList& entries, uint32 flags) argument [all...] |
/haiku/src/add-ons/screen_savers/slideshowsaver/ |
H A D | SlideShowSaver.cpp | 405 BList entries; local 414 entries.AddItem(new entry_ref(entry)); 417 entries.AddItem(in_current); 421 entries.SortItems(CompareEntries); 423 cur = entries.IndexOf(in_current); 427 entries.RemoveItem(in_current); 432 for (; (ref = (entry_ref*)entries.ItemAt(cur)) != NULL; cur ++) { 443 ref = (entry_ref*)entries.ItemAt(cur); 452 FreeEntries(&entries); 459 SlideShowSaver::FreeEntries(BList *entries) argument [all...] |
/haiku/headers/private/graphics/radeon_hd/atombios/ |
H A D | pptable.h | 516 UCHAR ucNumEntries; // Number of entries. 517 ATOM_PPLIB_Clock_Voltage_Dependency_Record entries[1]; // Dynamically allocate entries. member in struct:_ATOM_PPLIB_Clock_Voltage_Dependency_Table 532 UCHAR ucNumEntries; // Number of entries. 533 ATOM_PPLIB_Clock_Voltage_Limit_Record entries[1]; // Dynamically allocate entries. member in struct:_ATOM_PPLIB_Clock_Voltage_Limit_Table 556 UCHAR ucNumEntries; // Number of entries. 557 ATOM_PPLIB_CAC_Leakage_Record entries[1]; // Dynamically allocate entries. member in struct:_ATOM_PPLIB_CAC_Leakage_Table 571 UCHAR ucNumEntries; // Number of entries 572 ATOM_PPLIB_PhaseSheddingLimits_Record entries[1]; // Dynamically allocate entries. member in struct:_ATOM_PPLIB_PhaseSheddingLimits_Table 584 VCEClockInfo entries[1]; member in struct:_VCEClockInfoArray 596 ATOM_PPLIB_VCE_Clock_Voltage_Limit_Record entries[1]; member in struct:_ATOM_PPLIB_VCE_Clock_Voltage_Limit_Table 608 ATOM_PPLIB_VCE_State_Record entries[1]; member in struct:_ATOM_PPLIB_VCE_State_Table 630 UVDClockInfo entries[1]; member in struct:_UVDClockInfoArray 642 ATOM_PPLIB_UVD_Clock_Voltage_Limit_Record entries[1]; member in struct:_ATOM_PPLIB_UVD_Clock_Voltage_Limit_Table 661 ATOM_PPLIB_SAMClk_Voltage_Limit_Record entries[1]; member in struct:_ATOM_PPLIB_SAMClk_Voltage_Limit_Table 679 ATOM_PPLIB_ACPClk_Voltage_Limit_Record entries[1]; member in struct:_ATOM_PPLIB_ACPClk_Voltage_Limit_Table 748 ATOM_PPLIB_VQ_Budgeting_Record entries[1]; member in struct:ATOM_PPLIB_VQ_Budgeting_Table [all...] |
/haiku/src/add-ons/accelerants/radeon/ |
H A D | driver_wrapper.c | 26 // wait until "entries" FIFO entries are empty 28 status_t Radeon_WaitForFifo( accelerator_info *ai, int entries ) 36 if ( slots >= entries )
|
/haiku/src/tests/add-ons/mail/imap/ |
H A D | imap_tester.cpp | 178 IMAP::MessageEntryList entries; local 179 IMAP::FetchMessageEntriesCommand command(entries, from, to, true); 186 for (size_t i = 0; i < entries.size(); i++) { 187 printf("%10lu %8lu bytes, flags: %#lx\n", entries[i].uid, 188 entries[i].size, entries[i].flags);
|
/haiku/src/bin/ |
H A D | top.cpp | 85 char *entries = &buf[0]; local 88 exit_ca_mode = tgetstr("te", &entries); 89 enter_ca_mode = tgetstr("ti", &entries); 90 cursor_home = tgetstr("ho", &entries); 91 clear_string = tgetstr("cl", &entries); 92 restore_cursor = tgetstr("rc", &entries); 93 save_cursor = tgetstr("sc", &entries);
|
/haiku/src/system/libroot/posix/ |
H A D | shadow.cpp | 53 spwd** entries; local 56 || (error = sShadowPwdDBReply.FindData("entries", B_RAW_TYPE, 57 (const void**)&entries, &numBytes)) != B_OK) { 61 // relocate the entries 62 addr_t baseAddress = (addr_t)entries; 64 spwd* entry = relocate_pointer(baseAddress, entries[i]); 69 sShadowPwdEntries = entries;
|
H A D | grp.cpp | 97 group** entries; local 100 || (error = sGroupDBReply.FindData("entries", B_RAW_TYPE, 101 (const void**)&entries, &numBytes)) != B_OK) { 105 // relocate the entries 106 addr_t baseAddress = (addr_t)entries; 108 group* entry = relocate_pointer(baseAddress, entries[i]); 118 sGroupEntries = entries;
|