Searched refs:entry_count (Results 1 - 12 of 12) sorted by relevance

/haiku-fatelf/src/add-ons/kernel/partitioning_systems/gpt/
H A Defi_gpt.h28 uint32 entry_count; member in struct:efi_table_header
69 { entry_count = B_HOST_TO_LENDIAN_INT32(count); }
71 { return B_LENDIAN_TO_HOST_INT32(entry_count); }
/haiku-fatelf/src/add-ons/media/plugins/asf_reader/libasf/
H A Dparse.c393 index->entry_count = GetDWLE(idata + 52);
396 printf("Total Index Entries %d\n",index->entry_count);
401 if (index->entry_count == 0) {
407 if (index->entry_count * 6 + 56 > index->size) {
412 entry_data_size = index->entry_count * 6;
426 index->entries = malloc(index->entry_count * sizeof(asf_index_entry_t));
433 for (i=0; i<index->entry_count; i++) {
H A Dasf.c290 if (file->index && file->index->entry_count == 0) {
297 } else if (file->index && file->index->entry_count > 0) {
302 if (index_entry >= file->index->entry_count) {
H A Dasfint.h101 uint32_t entry_count; member in struct:asf_object_index_s
/haiku-fatelf/src/tools/
H A Dgenerate_attribute_stores.cpp28 uint32 entry_count; member in struct:attribute_file
122 file.entry_count = attributeCount;
/haiku-fatelf/src/add-ons/translators/ico/
H A DICO.h28 uint16 entry_count; member in struct:ICO::ico_header
H A DICO.cpp49 && entry_count < 32;
520 settings->AddInt32(kDocumentCount, header.entry_count);
528 if (iconIndex < 0 || iconIndex >= header.entry_count)
532 TRACE(("iconIndex = %ld, count = %ld\n", iconIndex, header.entry_count));
536 for (uint32 i = 0; i < header.entry_count; i++) {
594 if (iconIndex < 0 || iconIndex >= header.entry_count)
727 header.entry_count = B_HOST_TO_LENDIAN_INT16(1);
/haiku-fatelf/src/add-ons/kernel/file_systems/layers/attribute_overlay/
H A Dattribute_overlay.cpp144 uint32 entry_count; member in struct:attribute_overlay::AttributeFile::attribute_file
468 fEntries = (AttributeEntry **)malloc(fFile->entry_count
476 for (uint32 i = 0; i < fFile->entry_count; i++)
481 for (uint32 i = 0; i < fFile->entry_count; i++) {
506 for (uint32 i = 0; i < fFile->entry_count; i++)
527 fFile->entry_count = 0;
671 for (uint32 i = 0; i < fFile->entry_count; i++) {
761 return fFile->entry_count;
768 for (uint32 i = 0; i < fFile->entry_count; i++) {
847 for (uint32 i = index + 1; i < fFile->entry_count;
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/udf/
H A DUdfStructures.cpp995 PRINT(("entry_count: %d\n", entry_count()));
1005 uint16 entry_count;
H A DUdfStructures.h1897 uint16 entry_count() const { return B_LENDIAN_TO_HOST_INT16(_entry_count); } function in struct:icb_entry_tag
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/
H A DUdfStructures.cpp976 PRINT(("entry_count: %d\n", entry_count()));
986 uint16 entry_count;
H A DUdfStructures.h1846 uint16 entry_count() const { return B_LENDIAN_TO_HOST_INT16(_entry_count); } function in struct:Udf::icb_entry_tag

Completed in 109 milliseconds