/external/mesa3d/src/glx/ |
H A D | singlepix.c | 119 const _glapi_proc *const table = (_glapi_proc *) GET_DISPATCH(); local 121 (PFNGLGETSEPARABLEFILTEREXTPROC) table[359];
|
/external/mesa3d/src/mesa/swrast/ |
H A D | s_texfetch.c | 54 * Implemented with a 256-entry lookup table. 59 static GLfloat table[256]; local 62 /* compute lookup table now */ 67 table[i] = cs / 12.92f; 70 table[i] = (GLfloat) pow((cs + 0.055) / 1.055, 2.4); 75 return table[cs8]; 1122 /* check that the table entries are sorted by format name */
|
/external/opencv3/3rdparty/libjpeg/ |
H A D | jdmaster.c | 191 * a (subscript-check-less) C table lookup 196 * These processes all use a common table prepared by the routine below. 199 * of x is within MAXJSAMPLE+1 of the legal range, so a table running from 212 * So the post-IDCT limiting table ends up looking like this: 217 * Negative inputs select values from the upper half of the table after 220 * We can save some space by overlapping the start of the post-IDCT table 221 * with the simpler range limiting table. The post-IDCT table begins at 224 * Note that the table is allocated in near data space on PCs; it's small 230 /* Allocate and fill in the sample_range_limit table */ 232 JSAMPLE * table; local [all...] |
/external/opencv3/3rdparty/libwebp/enc/ |
H A D | cost.c | 21 // Boolean-cost cost table 55 // For each given level, the following table gives the pattern of contexts to 366 uint16_t* const table = proba->level_cost_[ctype][band][ctx]; local 369 table[0] = VP8BitCost(0, p[1]); 371 table[v] = cost_base + VariableLevelCost(v, p);
|
/external/opencv3/samples/cpp/tutorial_code/core/how_to_scan_images/ |
H A D | how_to_scan_images.cpp | 25 Mat& ScanImageAndReduceC(Mat& I, const uchar* table); 26 Mat& ScanImageAndReduceIterator(Mat& I, const uchar* table); 27 Mat& ScanImageAndReduceRandomAccess(Mat& I, const uchar * table); 61 uchar table[256]; local 63 table[i] = (uchar)(divideWith * (i/divideWith)); 74 J = ScanImageAndReduceC(clone_i, table); 88 J = ScanImageAndReduceIterator(clone_i, table); 102 ScanImageAndReduceRandomAccess(clone_i, table); 111 //! [table-init] 115 p[i] = table[ 134 ScanImageAndReduceC(Mat& I, const uchar* const table) argument 165 ScanImageAndReduceIterator(Mat& I, const uchar* const table) argument 197 ScanImageAndReduceRandomAccess(Mat& I, const uchar* const table) argument [all...] |
/external/pdfium/core/src/fxge/android/ |
H A D | fx_android_font.cpp | 53 FX_DWORD table, 59 return ((IFPF_Font*)hFont)->GetFontData(table, buffer, size); 52 GetFontData(void* hFont, FX_DWORD table, uint8_t* buffer, FX_DWORD size) argument
|
/external/pdfium/third_party/freetype/src/sfnt/ |
H A D | ttpost.c | 5 /* Postcript name table processing for TrueType and OpenType fonts */ 21 /* The post table is not completely loaded by the core engine. This */ 62 /* table of Mac names. Thus, it is possible to build a version of */ 173 /* UNDOCUMENTED! The number of glyphs in this table can be smaller */ 174 /* than the value in the maxp table (cf. cyberbit.ttf). */ 177 /* in this table, so the test for this threshold has been dropped. */ 200 /* compute number of names stored in table */ 239 FT_TRACE6(( "load_format_20: %d byte left in post table\n", 254 " truncating at end of post table (%d byte left)\n", 269 " all entries in post table ar 282 TT_Post_20 table = &face->postscript_names.names.format_20; local 359 TT_Post_25 table = &face->postscript_names.names.format_25; local 431 TT_Post_20 table = &names->names.format_20; local 446 TT_Post_25 table = &names->names.format_25; local 519 TT_Post_20 table = &names->names.format_20; local 542 TT_Post_25 table = &names->names.format_25; local [all...] |
/external/pdfium/third_party/libjpeg/ |
H A D | fpdfapi_jdmaster.c | 210 * a (subscript-check-less) C table lookup 215 * These processes all use a common table prepared by the routine below. 218 * of x is within MAXJSAMPLE+1 of the legal range, so a table running from 231 * So the post-IDCT limiting table ends up looking like this: 236 * Negative inputs select values from the upper half of the table after 239 * We can save some space by overlapping the start of the post-IDCT table 240 * with the simpler range limiting table. The post-IDCT table begins at 243 * Note that the table is allocated in near data space on PCs; it's small 249 /* Allocate and fill in the sample_range_limit table */ 251 JSAMPLE * table; local [all...] |
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/util/ |
H A D | SQLite.java | 23 * @param table table name 28 public static SQLStringAndBindings buildInsertString(String table, ContentValues values, int conflictAlgorithm) throws SQLException { argument 35 sb.append(table); 50 * @param table table name 56 public static SQLStringAndBindings buildUpdateString(String table, ContentValues values, String whereClause, String[] whereArgs) { argument 60 sb.append(table); 82 * @param table table nam 87 buildDeleteString(String table, String whereClause, String[] whereArgs) argument [all...] |
/external/selinux/libselinux/src/ |
H A D | compute_create.c | 36 static const char *table = "0123456789ABCDEF"; local 43 buffer[offset++] = table[h]; 44 buffer[offset++] = table[l];
|
/external/sfntly/cpp/src/sfntly/table/core/ |
H A D | horizontal_device_metrics_table.cc | 17 #include "sfntly/table/core/horizontal_device_metrics_table.h" 96 FontDataTablePtr table = new HorizontalDeviceMetricsTable(header(), data, local 98 return table.Detach(); 109 HorizontalDeviceMetricsTable* table = local 111 if (table) { 112 table->num_glyphs_ = num_glyphs;
|
H A D | horizontal_metrics_table.cc | 17 #include "sfntly/table/core/horizontal_metrics_table.h" 108 FontDataTablePtr table = local 110 return table.Detach(); 125 HorizontalMetricsTable* table = local 127 table->num_hmetrics_ = num_hmetrics; 133 HorizontalMetricsTable* table = local 135 table->num_glyphs_ = num_glyphs;
|
/external/sfntly/cpp/src/sfntly/table/ |
H A D | font_data_table.cc | 17 #include "sfntly/table/font_data_table.h" 81 FontDataTablePtr table; // NULL default table local 99 table = SubBuildTable(data); 100 NotifyPostTableBuild(table); 105 return table; 168 void FontDataTable::Builder::NotifyPostTableBuild(FontDataTable* table) { argument 170 UNREFERENCED_PARAMETER(table);
|
/external/sfntly/cpp/src/sfntly/tools/subsetter/ |
H A D | subsetter.cc | 30 // TODO(arthurhsu): IMPLEMENT: CMap table subsetter 86 Table* table = font_->GetTable(*tag); local 87 if (table) { 88 font_builder->NewTableBuilder(*tag, table->ReadFontData());
|
/external/skia/src/effects/ |
H A D | SkTableMaskFilter.cpp | 21 SkTableMaskFilter::SkTableMaskFilter(const uint8_t table[256]) { argument 22 memcpy(fTable, table, sizeof(fTable)); 43 const uint8_t* table = fTable; local 49 dstP[x] = table[srcP[x]]; 78 uint8_t table[256]; local 79 if (!buffer.readByteArray(table, 256)) { 82 return Create(table); 87 void SkTableMaskFilter::MakeGammaTable(uint8_t table[256], SkScalar gamma) { argument 94 table[i] = SkTPin(sk_float_round2int(powf(x, g) * 255), 0, 255); 99 void SkTableMaskFilter::MakeClipTable(uint8_t table[25 argument [all...] |
/external/skia/src/opts/ |
H A D | SkBitmapProcState_opts_mips_dsp.cpp | 21 const SkPMColor* SK_RESTRICT table = s.fPixmap.ctable()->readColors(); local 27 SkPMColor dstValue = table[src]; 92 "pref 0, 64(%[table]) \n\t" 93 "lwx $t0, $t0(%[table]) \n\t" 94 "lwx $t1, $t1(%[table]) \n\t" 95 "lwx $t2, $t2(%[table]) \n\t" 96 "lwx $t3, $t3(%[table]) \n\t" 97 "lwx $t4, $t4(%[table]) \n\t" 98 "lwx $t5, $t5(%[table]) \n\t" 99 "lwx $t6, $t6(%[table]) \ [all...] |
/external/v8/src/ic/arm64/ |
H A D | stub-cache-arm64.cc | 19 // Probe primary or secondary table. 27 StubCache::Table table, Register receiver, Register name, 34 ExternalReference key_offset(isolate->stub_cache()->key_reference(table)); 35 ExternalReference value_offset(isolate->stub_cache()->value_reference(table)); 36 ExternalReference map_offset(isolate->stub_cache()->map_reference(table)); 75 if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { 77 } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { 133 // Compute the hash for primary table. 142 // Probe the primary table. 146 // Primary miss: Compute hash for secondary table 25 ProbeTable(Isolate* isolate, MacroAssembler* masm, Code::Kind ic_kind, Code::Flags flags, StubCache::Table table, Register receiver, Register name, Register offset, Register scratch, Register scratch2, Register scratch3) argument [all...] |
/external/v8/src/ic/ia32/ |
H A D | stub-cache-ia32.cc | 20 StubCache::Table table, Register name, Register receiver, 23 ExternalReference key_offset(isolate->stub_cache()->key_reference(table)); 24 ExternalReference value_offset(isolate->stub_cache()->value_reference(table)); 25 ExternalReference map_offset(isolate->stub_cache()->map_reference(table)); 57 if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { 59 } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { 112 if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { 114 } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { 191 // Probe the primary table. 204 // Probe the secondary table 18 ProbeTable(Isolate* isolate, MacroAssembler* masm, Code::Kind ic_kind, Code::Flags flags, StubCache::Table table, Register name, Register receiver, Register offset, Register extra) argument [all...] |
/external/v8/src/ic/x64/ |
H A D | stub-cache-x64.cc | 20 StubCache::Table table, Register receiver, Register name, 34 ExternalReference key_offset(isolate->stub_cache()->key_reference(table)); 35 ExternalReference value_offset(isolate->stub_cache()->value_reference(table)); 49 DCHECK(isolate->stub_cache()->map_reference(table).address() - 50 isolate->stub_cache()->key_reference(table).address() == 68 if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { 70 } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { 141 // Probe the primary table. 153 // Probe the secondary table. 18 ProbeTable(Isolate* isolate, MacroAssembler* masm, Code::Kind ic_kind, Code::Flags flags, StubCache::Table table, Register receiver, Register name, Register offset) argument
|
/external/v8/src/ic/x87/ |
H A D | stub-cache-x87.cc | 20 StubCache::Table table, Register name, Register receiver, 23 ExternalReference key_offset(isolate->stub_cache()->key_reference(table)); 24 ExternalReference value_offset(isolate->stub_cache()->value_reference(table)); 25 ExternalReference map_offset(isolate->stub_cache()->map_reference(table)); 57 if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { 59 } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { 112 if (FLAG_test_secondary_stub_cache && table == StubCache::kPrimary) { 114 } else if (FLAG_test_primary_stub_cache && table == StubCache::kSecondary) { 191 // Probe the primary table. 204 // Probe the secondary table 18 ProbeTable(Isolate* isolate, MacroAssembler* masm, Code::Kind ic_kind, Code::Flags flags, StubCache::Table table, Register name, Register receiver, Register offset, Register extra) argument [all...] |
/external/v8/test/cctest/ |
H A D | test-dictionary.cc | 46 static void TestHashMap(Handle<HashMap> table) { argument 52 table = HashMap::Put(table, a, b); 53 CHECK_EQ(table->NumberOfElements(), 1); 54 CHECK_EQ(table->Lookup(a), *b); 56 CHECK_EQ(table->Lookup(b), CcTest::heap()->the_hole_value()); 60 CHECK_EQ(table->NumberOfElements(), 1); 61 CHECK_EQ(table->Lookup(a), *b); 62 CHECK_EQ(table->Lookup(b), CcTest::heap()->the_hole_value()); 65 table 141 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 100); local 154 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 100); local 170 TestHashSetCausesGC(Handle<HashSet> table) argument 201 TestHashMapCausesGC(Handle<HashMap> table) argument [all...] |
H A D | test-weakmaps.cc | 45 // Do not leak handles for the hash table, it would make entries strong. 48 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 1); local 49 weakmap->set_table(*table); 97 CHECK_EQ(2, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 102 CHECK_EQ(2, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 104 0, ObjectHashTable::cast(weakmap->table())->NumberOfDeletedElements()); 121 CHECK_EQ(2, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 123 0, ObjectHashTable::cast(weakmap->table())->NumberOfDeletedElements()); 126 CHECK_EQ(0, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 128 ObjectHashTable::cast(weakmap->table()) [all...] |
H A D | test-weaksets.cc | 48 // Do not leak handles for the hash table, it would make entries strong. 51 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 1); local 52 weakset->set_table(*table); 96 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 101 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 103 0, ObjectHashTable::cast(weakset->table())->NumberOfDeletedElements()); 120 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 122 0, ObjectHashTable::cast(weakset->table())->NumberOfDeletedElements()); 125 CHECK_EQ(0, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 127 1, ObjectHashTable::cast(weakset->table()) [all...] |
/external/autotest/frontend/client/src/autotest/common/table/ |
H A D | DataTable.java | 1 package autotest.common.table; 24 * A table to display data from JSONObjects. Each row displays data from one 30 * <li>.data-table - the entire table 40 // use CLICKABLE_WIDGET_COLUMN for widget that expect to receive clicks. The table will ignore 50 protected RightClickTable table; field in class:DataTable 59 // keep a list of JSONObjects corresponding to rows in the table 80 table = new RightClickTable(); 81 initWidget(table); 83 table [all...] |
H A D | SelectionManager.java | 1 package autotest.common.table; 4 import autotest.common.table.DataTable.TableWidgetFactory; 5 import autotest.common.table.TableClickWidget.TableWidgetClickListener; 24 * in a table, and as a SelectionPanelListener. 44 public SelectionManager(DataTable table, boolean selectOnlyOne) { argument 45 attachedTable = table; 116 * Select all objects in the table.
|