HomeSort by relevance Sort by last modified time
    Searched full:number_of_entries (Results 1 - 25 of 28) sorted by null

1 2

  /external/vboot_reference/firmware/lib/cgptlib/
cgptlib_internal.c 18 size_t bytes = h->number_of_entries * h->size_of_entry;
103 if ((h->number_of_entries < MIN_NUMBER_OF_ENTRIES) ||
104 (h->number_of_entries > MAX_NUMBER_OF_ENTRIES) ||
106 h->number_of_entries != MAX_NUMBER_OF_ENTRIES))
169 h->size_of_entry * h->number_of_entries);
174 for (i = 0, entry = entries; i < h->number_of_entries; i++, entry++) {
188 for (i2 = 0, e2 = entries; i2 < h->number_of_entries;
227 if (h1->number_of_entries != h2->number_of_entries)
351 entries_size = header1->size_of_entry * header1->number_of_entries;
    [all...]
cgptlib.c 49 i < header->number_of_entries; i++) {
74 for (i = 0, e = entries; i < header->number_of_entries; i++, e++) {
222 for (i = 0, e = entries; i < header->number_of_entries; i++, e++) {
  /art/compiler/utils/
dedupe_set-inl.h 103 size_t number_of_entries = entry.second; variable
104 if (number_of_entries > 1u) {
105 global_stats->collision_sum += number_of_entries - 1u;
106 global_stats->collision_max = std::max(global_stats->collision_max, number_of_entries);
  /external/vboot_reference/cgpt/
cgpt_create.c 51 h->number_of_entries = MAX_NUMBER_OF_ENTRIES;
75 if (h->number_of_entries > max_entries) {
76 h->number_of_entries = max_entries;
92 size_t entries_size = h->number_of_entries * h->size_of_entry;
cgpt_common.c 701 return header->number_of_entries;
710 require(entry_index < header->number_of_entries);
827 primary_header->number_of_entries;
833 secondary_header->number_of_entries;
854 * number_of_entries
864 (a->number_of_entries == b->number_of_entries) &&
898 size_t entries_size = h->number_of_entries * h->size_of_entry;
920 target->number_of_entries = source->number_of_entries;
    [all...]
cgpt_show.c 89 printf("%sNumber of entries: %d\n", indent, header->number_of_entries);
94 header->number_of_entries)
297 secondary_header->number_of_entries *
  /hardware/qcom/data/ipacfg-mgr/msm8998/ipanat/src/
ipa_nat_drv.c 36 * @number_of_entries: [in] number of nat entries
44 uint16_t number_of_entries,
49 if (NULL == tbl_hdl || 0 == number_of_entries) {
55 number_of_entries,
ipa_nat_drvi.c 642 uint16_t number_of_entries,
653 ret = ipa_nati_alloc_table(number_of_entries,
695 int ipa_nati_alloc_table(uint16_t number_of_entries,
707 *table_entries = (uint16_t)(number_of_entries * IPA_NAT_BASE_TABLE_PERCENTAGE);
716 *expn_table_entries = (uint16_t)(number_of_entries * IPA_NAT_EXPANSION_TABLE_PERCENTAGE);
    [all...]
  /hardware/qcom/data/ipacfg-mgr/msm8998/ipanat/inc/
ipa_nat_drv.h 54 * @number_of_entries: [in] number of nat entries
62 uint16_t number_of_entries,
ipa_nat_drvi.h 385 uint16_t number_of_entries,
388 int ipa_nati_alloc_table(uint16_t number_of_entries,
  /external/vboot_reference/firmware/lib/
gpt_misc.c 56 uint64_t entries_bytes = primary_header->number_of_entries
81 uint64_t entries_bytes = secondary_header->number_of_entries
107 uint64_t entries_bytes = header->number_of_entries
  /external/vboot_reference/tests/
cgptlib_test.c 84 header->number_of_entries * header->size_of_entry);
89 header2->number_of_entries * header2->size_of_entry);
174 header->number_of_entries = 128;
334 h3.number_of_entries++;
513 h1->number_of_entries = TOTAL_ENTRIES_SIZE /
515 h2->number_of_entries = TOTAL_ENTRIES_SIZE /
539 h1->number_of_entries--;
540 h2->number_of_entries /= 2;
    [all...]
vboot_kernel_tests.c 86 h->number_of_entries = MAX_NUMBER_OF_ENTRIES;
432 h->number_of_entries = MAX_NUMBER_OF_ENTRIES;
446 h->number_of_entries = MAX_NUMBER_OF_ENTRIES;
  /external/v8/src/
transitions-inl.h 104 return internal::Search<ALL_ENTRIES>(this, name, number_of_entries(),
transitions.h 160 inline int number_of_entries() { return number_of_transitions(); } function in class:v8::internal::TransitionArray
code-stub-assembler.h     [all...]
  /external/vboot_reference/firmware/include/
gpt.h 87 uint32_t number_of_entries; member in struct:__anon38211
  /external/piex/src/
tiff_parser.cc 472 std::uint16_t number_of_entries; local
473 if (!Get16u(stream, ifd_offset, endian, &number_of_entries)) {
478 i < static_cast<std::uint32_t>(number_of_entries) * 12; i += 12) {
522 return Get32u(stream, ifd_offset + 2u + number_of_entries * 12u, endian,
  /art/runtime/
stack_map.cc 160 << "DexRegisterLocationCatalog (number_of_entries=" << number_of_location_catalog_entries
  /external/google-breakpad/src/processor/
minidump.cc     [all...]
minidump_unittest.cc 640 .D64(kNumberOfEntries); // number_of_entries
    [all...]
  /external/javassist/src/main/javassist/bytecode/
StackMap.java 64 * Returns <code>number_of_entries</code>.
StackMapTable.java 537 output.write(0); // u2 number_of_entries
  /art/compiler/
oat_writer.cc     [all...]
  /external/google-breakpad/src/google_breakpad/common/
minidump_format.h 814 uint64_t number_of_entries; member in struct:__anon19656
    [all...]

Completed in 627 milliseconds

1 2