Home
last modified time | relevance | path

Searched defs:valid_entries (Results 1 – 9 of 9) sorted by relevance

/external/pdfium/third_party/freetype/src/sfnt/
Dttload.c175 FT_UShort nn, valid_entries = 0; in check_table_dir() local
341 FT_UShort nn, valid_entries; in tt_face_load_font_dir() local
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/sfnt/
Dttload.c175 FT_UShort nn, valid_entries = 0; in check_table_dir() local
341 FT_UShort nn, valid_entries; in tt_face_load_font_dir() local
/external/freetype/src/sfnt/
Dttload.c175 FT_UShort nn, valid_entries = 0; in check_table_dir() local
341 FT_UShort nn, valid_entries; in tt_face_load_font_dir() local
/external/mesa3d/src/gallium/drivers/trace/
Dtr_dump_state.c372 unsigned valid_entries = 1; in trace_dump_blend_state() local
/external/vboot_reference/firmware/include/
Dgpt_misc.h111 uint32_t valid_headers, valid_entries; member
/external/v8/src/
Dobjects-debug.cc1152 bool DescriptorArray::IsSortedNoDuplicates(int valid_entries) { in IsSortedNoDuplicates()
1174 bool TransitionArray::IsSortedNoDuplicates(int valid_entries) { in IsSortedNoDuplicates()
Dobjects-inl.h2650 int BinarySearch(T* array, Name* name, int valid_entries, in BinarySearch()
2700 int LinearSearch(T* array, Name* name, int valid_entries, in LinearSearch()
2729 int Search(T* array, Name* name, int valid_entries, int* out_insertion_index) { in Search()
/external/mesa3d/src/gallium/auxiliary/util/
Du_dump_state.c547 unsigned valid_entries = 1; in util_dump_blend_state() local
/external/vboot_reference/cgpt/
Dcgpt_common.c880 uint8_t RepairEntries(GptData *gpt, const uint32_t valid_entries) { in RepairEntries()