/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
H A D | ftgxval.c | 76 FT_Bytes table ) 86 FT_FREE( table ); 127 FT_Bytes table ) 138 FT_FREE( table );
|
/external/qemu/distrib/zlib-1.2.8/ |
H A D | inftrees.h | 13 indexed that table entry, or it provides a pointer to another 14 table that indexes more bits of the code. op indicates whether 15 the entry is a pointer to another table, a literal, a length or 16 distance, an end-of-block, or an invalid code. For a table 18 that table. For a length or distance, the low four bits of op 23 the current table to the next table. Each entry is four bytes. */ 25 unsigned char op; /* operation, extra bits, table bits */ 27 unsigned short val; /* offset in table or code value */ 32 0000tttt - table lin [all...] |
H A D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table, 26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table 28 requested root table index bits, and on return it is the actual root 29 table index bits. It will differ if the request is greater than the 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) 36 code FAR * FAR *table; 43 unsigned root; /* number of index bits for root table */ 44 unsigned curr; /* number of index bits for current table */ 45 unsigned drop; /* code bits to drop for sub-table */ 47 unsigned used; /* code entries in table use [all...] |
/external/skia/include/effects/ |
H A D | SkTableColorFilter.h | 10 * Create a table colorfilter, copying the table into the filter, and 12 * a' = table[a]; 13 * r' = table[r]; 14 * g' = table[g]; 15 * b' = table[b]; 18 * the table is applied, and then the result is remultiplied. 20 static SkColorFilter* Create(const uint8_t table[256]); 23 * Create a table colorfilter, with a different table fo [all...] |
/external/srec/srec/include/ |
H A D | log_tabl.h | 35 const int *table; member in struct:__anon31116
|
/external/zlib/src/contrib/infback9/ |
H A D | inftree9.h | 13 indexed that table entry, or it provides a pointer to another 14 table that indexes more bits of the code. op indicates whether 15 the entry is a pointer to another table, a literal, a length or 16 distance, an end-of-block, or an invalid code. For a table 18 that table. For a length or distance, the low four bits of op 23 the current table to the next table. Each entry is four bytes. */ 25 unsigned char op; /* operation, extra bits, table bits */ 27 unsigned short val; /* offset in table or code value */ 32 0000tttt - table lin [all...] |
/external/zlib/src/ |
H A D | inftrees.h | 13 indexed that table entry, or it provides a pointer to another 14 table that indexes more bits of the code. op indicates whether 15 the entry is a pointer to another table, a literal, a length or 16 distance, an end-of-block, or an invalid code. For a table 18 that table. For a length or distance, the low four bits of op 23 the current table to the next table. Each entry is four bytes. */ 25 unsigned char op; /* operation, extra bits, table bits */ 27 unsigned short val; /* offset in table or code value */ 32 0000tttt - table lin [all...] |
H A D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table, 26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table 28 requested root table index bits, and on return it is the actual root 29 table index bits. It will differ if the request is greater than the 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) 36 code FAR * FAR *table; 43 unsigned root; /* number of index bits for root table */ 44 unsigned curr; /* number of index bits for current table */ 45 unsigned drop; /* code bits to drop for sub-table */ 47 unsigned used; /* code entries in table use [all...] |
/external/chromium_org/chrome/browser/signin/ |
H A D | signin_global_error_unittest.cc | 99 ErrorTableEntry table[] = { local 114 COMPILE_ASSERT(ARRAYSIZE_UNSAFE(table) == GoogleServiceAuthError::NUM_STATES, 117 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(table); ++i) { 121 GoogleServiceAuthError(table[i].error_state)); 123 EXPECT_EQ(global_error_->HasMenuItem(), table[i].is_error); 124 EXPECT_EQ(global_error_->MenuItemLabel().empty(), !table[i].is_error); 126 !table[i].is_error);
|
/external/freetype/src/gzip/ |
H A D | zutil.c | 75 local ptr_table table[MAX_PTR]; variable 76 /* This table is used to remember the original form of pointers 78 * Since MSDOS is not a preemptive multitasking OS, this table is not 98 table[next_ptr].org_ptr = buf; 103 table[next_ptr++].new_ptr = buf; 116 if (ptr != table[n].new_ptr) continue; 118 farfree(table[n].org_ptr); 120 table[n-1] = table[n];
|
/external/chromium_org/third_party/WebKit/Source/web/tests/ |
H A D | WebInputEventFactoryTestMac.mm | 96 KeyMappingEntry table[] = 118 for (size_t i = 0; i < arraysize(table); ++i) { 119 NSEvent* macEvent = BuildFakeKeyEvent(table[i].macKeyCode, table[i].character, 0); 121 EXPECT_EQ(table[i].windowsKeyCode, webEvent.windowsKeyCode);
|
/external/chromium_org/third_party/ots/src/ |
H A D | post.cc | 15 Buffer table(data, length); 20 if (!table.ReadU32(&post->version) || 21 !table.ReadU32(&post->italic_angle) || 22 !table.ReadS16(&post->underline) || 23 !table.ReadS16(&post->underline_thickness) || 24 !table.ReadU32(&post->is_fixed_pitch)) { 41 // We have a version 2 table with a list of Pascal strings at the end 45 if (!table.Skip(16)) { 50 if (!table.ReadU16(&num_glyphs)) { 62 OTS_WARNING("table versio [all...] |
H A D | gasp.cc | 16 Buffer table(data, length); 22 if (!table.ReadU16(&gasp->version) || 23 !table.ReadU16(&num_ranges)) { 44 if (!table.ReadU16(&max_ppem) || 45 !table.ReadU16(&behavior)) {
|
/external/chromium_org/third_party/lzma_sdk/ |
H A D | 7zCrc.c | 15 typedef UInt32 (MY_FAST_CALL *CRC_FUNC)(UInt32 v, const void *data, size_t size, const UInt32 *table); 22 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8)) 24 static UInt32 MY_FAST_CALL CrcUpdateT1(UInt32 v, const void *data, size_t size, const UInt32 *table) argument 34 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table); 35 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table);
|
/external/e2fsprogs/lib/ss/ |
H A D | list_rqs.c | 31 ss_request_table **table; local 58 for (table = ss_info(sci_idx)->rqt_tables; *table; table++) { 59 entry = (*table)->requests;
|
/external/lzma/C/ |
H A D | 7zCrc.c | 15 typedef UInt32 (MY_FAST_CALL *CRC_FUNC)(UInt32 v, const void *data, size_t size, const UInt32 *table);
22 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
24 static UInt32 MY_FAST_CALL CrcUpdateT1(UInt32 v, const void *data, size_t size, const UInt32 *table)
argument 34 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table);
35 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table);
|
/external/openfst/src/include/fst/ |
H A D | bi-table.h | 1 // bi-table.h 73 HashBiTable(const HashBiTable<I, T, H, E> &table) argument 74 : hash_func_(table.hash_func_ ? new H(*table.hash_func_) : 0), 75 hash_equal_(table.hash_equal_ ? new E(*table.hash_equal_) : 0), 76 entry2id_(table.entry2id_.begin(), table.entry2id_.end(), 77 table.entry2id_.size(), 80 id2entry_(table 155 CompactHashBiTable(const CompactHashBiTable<I, T, H, E, HS> &table) argument 286 VectorBiTable(const VectorBiTable<I, T, FP> &table) argument 352 VectorHashBiTable(const VectorHashBiTable<I, T, S, FP, H, HS> &table) argument [all...] |
/external/libexif/libexif/olympus/ |
H A D | mnote-olympus-tag.c | 34 } table[] = { variable in typeref:struct:__anon23676 201 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++) 202 if (table[i].tag == t) return (table[i].name); 212 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++) 213 if (table[i].tag == t) return (_(table[i].title)); 222 for (i = 0; i < sizeof (table) / sizeo [all...] |
/external/chromium_org/third_party/freetype/src/psaux/ |
H A D | psobjs.c | 57 /* table :: The address of the target table. */ 60 /* count :: The table size = the maximum number of elements. */ 69 ps_table_new( PS_Table table, 76 table->memory = memory; 77 if ( FT_NEW_ARRAY( table->elements, count ) || 78 FT_NEW_ARRAY( table->lengths, count ) ) 81 table->max_elems = count; 82 table->init = 0xDEADBEEFUL; 83 table 99 shift_elements( PS_Table table, FT_Byte* old_base ) argument 116 reallocate_t1_table( PS_Table table, FT_Offset new_size ) argument [all...] |
/external/freetype/src/psaux/ |
H A D | psobjs.c | 57 /* table :: The address of the target table. */ 60 /* count :: The table size = the maximum number of elements. */ 69 ps_table_new( PS_Table table, 76 table->memory = memory; 77 if ( FT_NEW_ARRAY( table->elements, count ) || 78 FT_NEW_ARRAY( table->lengths, count ) ) 81 table->max_elems = count; 82 table->init = 0xDEADBEEFUL; 83 table 99 shift_elements( PS_Table table, FT_Byte* old_base ) argument 116 reallocate_t1_table( PS_Table table, FT_Offset new_size ) argument [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/psaux/ |
H A D | psobjs.c | 57 /* table :: The address of the target table. */ 60 /* count :: The table size = the maximum number of elements. */ 69 ps_table_new( PS_Table table, 76 table->memory = memory; 77 if ( FT_NEW_ARRAY( table->elements, count ) || 78 FT_NEW_ARRAY( table->lengths, count ) ) 81 table->max_elems = count; 82 table->init = 0xDEADBEEFUL; 83 table 99 shift_elements( PS_Table table, FT_Byte* old_base ) argument 116 reallocate_t1_table( PS_Table table, FT_Offset new_size ) argument [all...] |
/external/chromium_org/v8/test/cctest/ |
H A D | test-weakmaps.cc | 49 // Do not leak handles for the hash table, it would make entries strong. 52 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 1); local 53 weakmap->set_table(*table); 61 Handle<ObjectHashTable> table = ObjectHashTable::Put( local 62 Handle<ObjectHashTable>(ObjectHashTable::cast(weakmap->table())), 65 weakmap->set_table(*table); 107 CHECK_EQ(1, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 112 CHECK_EQ(1, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 114 0, ObjectHashTable::cast(weakmap->table())->NumberOfDeletedElements()); 131 CHECK_EQ(1, ObjectHashTable::cast(weakmap->table()) [all...] |
H A D | test-weaksets.cc | 49 // Do not leak handles for the hash table, it would make entries strong. 52 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 1); local 53 weakset->set_table(*table); 61 Handle<ObjectHashTable> table = ObjectHashTable::Put( local 62 Handle<ObjectHashTable>(ObjectHashTable::cast(weakset->table())), 65 weakset->set_table(*table); 107 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 112 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 114 0, ObjectHashTable::cast(weakset->table())->NumberOfDeletedElements()); 131 CHECK_EQ(1, ObjectHashTable::cast(weakset->table()) [all...] |
/external/fonttools/Lib/fontTools/ttLib/tables/ |
H A D | otBase.py | 27 """Generic base class for TTX table converters. It functions as an 28 adapter between the TTX (ttLib actually) table model and the model 43 self.table = tableClass() 44 self.table.decompile(reader, font) 56 """ Create a top-level OTFWriter for the GPOS/GSUB table. 57 Call the compile method for the the table 58 for each 'converter' record in the table converter list 65 each writer representing a table, and the writer.items list containing 71 Traverse the flat list of tables again, calling getData each get the data in the table, now that 85 self.table [all...] |
/external/fonttools/Tools/fontTools/ttLib/tables/ |
H A D | otBase.py | 27 """Generic base class for TTX table converters. It functions as an 28 adapter between the TTX (ttLib actually) table model and the model 43 self.table = tableClass() 44 self.table.decompile(reader, font) 56 """ Create a top-level OTFWriter for the GPOS/GSUB table. 57 Call the compile method for the the table 58 for each 'converter' record in the table converter list 65 each writer representing a table, and the writer.items list containing 71 Traverse the flat list of tables again, calling getData each get the data in the table, now that 85 self.table [all...] |