/external/qemu/distrib/jpeg-6b/ |
rdswitch.c | 12 * -qslots N[,N,...] Set component quantization table selectors 81 * table 0 for luminance (or primary) components, 1 for chrominance components. 82 * You must use -qslots if you want a different component->table mapping. 88 unsigned int table[DCTSIZE2]; local 91 fprintf(stderr, "Can't open table file %s\n", filename); 96 while (read_text_integer(fp, &val, &termchar)) { /* read 1st element of table */ 102 table[0] = (unsigned int) val; 105 fprintf(stderr, "Invalid table data in file %s\n", filename); 109 table[i] = (unsigned int) val; 111 jpeg_add_quant_table(cinfo, tblno, table, scale_factor, force_baseline) [all...] |
/external/regex-re2/doc/ |
mksyntaxhtml | 30 <table border=0 cellpadding=2 cellspacing=2> 36 </table>
|
/external/sfntly/cpp/src/sfntly/table/ |
font_data_table.h | 26 // An abstract base for any table that contains a FontData. This is the root of 27 // the table class hierarchy. 80 virtual void NotifyPostTableBuild(FontDataTable* table); 102 // Get the readable font data for this table. 105 // Get the length of the data for this table in bytes. This is the full 106 // allocated length of the data underlying the table and may or may not
|
/external/skia/src/core/ |
SkDeviceProfile.cpp | 35 uint8_t table[256]) const {
|
/external/skia/tools/lua/ |
scrape.lua | 12 if type(v) == "table" then 29 where t is a table of parameters that were passed to that draw-op.
|
/external/srec/portable/include/ |
phashtable.h | 30 * The default initial capacity of a hash table. 54 * Abstract hash table operations. The keys of the Map are strings and values 61 * of the HashTable is the ratio of the total number of entries in the table 62 * vs the capacity of the table. The lower the load factor, the faster the 67 * hash table is increased and each entry is put in its new linked list based 94 * table. 121 * Creates an hash table. The hash table is created with specified capacity 132 * table including the call to the HashTableDestroy function. Most likely, 135 * @param hashtable A pointer to the returned hash table. This parameter ma [all...] |
/external/srec/shared/include/ |
HashMapImpl.h | 41 * Actual hash table implementation. 43 PHashTable *table; member in struct:HashMapImpl_t
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
picoloadphones.lua | 3 -- lua script picoloadphones.lua --- creates pkb containing phones table.
37 --- table with symbol name keys (not really used currently)
39 --- table with symbol name number keys (specified with property mapval)
62 -- construct props table and add first mapval property
|
/frameworks/av/media/libstagefright/include/ |
SampleIterator.h | 24 SampleIterator(SampleTable *table);
|
/packages/apps/Exchange/tests/src/com/android/exchange/provider/ |
MockProvider.java | 71 /*package*/ static final int TABLE = 100; 121 String table = uri.getPath().substring(1); local 123 Uri newUri = new Uri.Builder().scheme("content").authority(AUTHORITY).path(table) 130 sURIMatcher.addURI(AUTHORITY, table, TABLE); 131 sURIMatcher.addURI(AUTHORITY, table + "/#", RECORD); 150 case TABLE: 189 case TABLE:
|
/packages/apps/Gallery2/src/com/android/photos/data/ |
PhotoDatabase.java | 39 private static final String SQL_CREATE_TABLE = "CREATE TABLE "; 88 createTable(db, Accounts.TABLE, getAccountTableDefinition()); 89 createTable(db, Albums.TABLE, getAlbumTableDefinition()); 90 createTable(db, Photos.TABLE, getPhotoTableDefinition()); 91 createTable(db, Metadata.TABLE, getMetadataTableDefinition()); 113 dropTable(db, Metadata.TABLE); 114 dropTable(db, Photos.TABLE); 115 dropTable(db, Albums.TABLE); 116 dropTable(db, Accounts.TABLE); 136 protected static void createTable(SQLiteDatabase db, String table, List<String[]> columns) [all...] |
/packages/apps/UnifiedEmail/tests/src/com/android/mail/browse/ |
TestProvider.java | 69 /* package */static final int TABLE = 100; 121 String table = uri.getPath().substring(1); local 123 Uri newUri = new Uri.Builder().scheme("content").authority(AUTHORITY).path(table) 130 sURIMatcher.addURI(AUTHORITY, table, TABLE); 131 sURIMatcher.addURI(AUTHORITY, table + "/#", RECORD); 150 case TABLE: 189 case TABLE: 227 case TABLE:
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
Table_Suite.py | 1 """Suite Table Suite: Classes for manipulating tables 52 table = tables variable
|
/art/compiler/optimizing/ |
code_generator.cc | 343 // Verify the encoded table holds the expected data. 344 MappingTable table(data_ptr); 345 CHECK_EQ(table.TotalSize(), total_entries); 346 CHECK_EQ(table.PcToDexSize(), pc2dex_entries); 347 auto it = table.PcToDexBegin(); 348 auto it2 = table.DexToPcBegin(); 355 CHECK(it == table.PcToDexEnd()); 356 CHECK(it2 == table.DexToPcEnd());
|
/art/runtime/ |
intern_table.cc | 53 os << "Intern table: " << strong_interns_.size() << " strong; " 90 // Note: we deliberately don't visit the weak_interns_ table and the immutable image roots. 102 mirror::String* InternTable::Lookup(Table* table, mirror::String* s) { 104 auto it = table->find(GcRoot<mirror::String>(s)); 105 if (LIKELY(it != table->end())) { 144 void InternTable::Remove(Table* table, mirror::String* s) { 145 auto it = table->find(GcRoot<mirror::String>(s)); 146 DCHECK(it != table->end()) [all...] |
/external/javassist/src/main/javassist/bytecode/analysis/ |
Analyzer.java | 35 * variable table at every reachable instruction in a method. During analysis, 216 ExceptionTable table = method.getCodeAttribute().getExceptionTable(); local 217 ExceptionInfo[] exceptions = new ExceptionInfo[table.size()]; 218 for (int i = 0; i < table.size(); i++) { 219 int index = table.catchType(i); 227 exceptions[i] = new ExceptionInfo(table.startPc(i), table.endPc(i), table.handlerPc(i), type); 409 // Offset table
|
/external/javassist/src/main/javassist/bytecode/stackmap/ |
BasicBlock.java | 174 private Mark makeMark(HashMap table, int pos) { 175 return makeMark0(table, pos, true, true); 181 private Mark makeMark(HashMap table, int pos, BasicBlock[] jump, 183 Mark m = makeMark0(table, pos, false, false); 188 private Mark makeMark0(HashMap table, int pos, 191 Mark m = (Mark)table.get(p); 194 table.put(p, m);
|
/external/checkpolicy/ |
policy_define.c | 223 t = hashtab_search(policydbp->p_types.table, type); 342 cladatum = hashtab_search(policydbp->p_classes.table, id); 372 cladatum = hashtab_search(policydbp->p_classes.table, id); 404 cladatum = hashtab_search(policydbp->p_classes.table, id); 436 cladatum = hashtab_search(policydbp->p_classes.table, id); 468 cladatum = hashtab_search(policydbp->p_classes.table, id); 502 comdatum = hashtab_search(policydbp->p_commons.table, id); 513 ret = hashtab_insert(policydbp->p_commons.table, 521 yyerror("hash table overflow"); 544 ret = hashtab_insert(comdatum->permissions.table, [all...] |
/external/chromium_org/chrome/browser/resources/ |
about_stats.js | 46 node.style.display = 'table-row'; 133 // on a table cell element. To use it, put it in a <td> element: 147 var table = tbody.parentNode; 153 for (var i = startIndex; i < table.rows.length; i++) 154 rows.push(table.rows[i]);
|
/external/chromium_org/third_party/WebKit/Source/wtf/text/ |
AtomicString.cpp | 64 HashSet<StringImpl*>& table() function in class:WTF::AtomicStringTable 82 static void destroy(AtomicStringTable* table) 84 HashSet<StringImpl*>::iterator end = table->m_table.end(); 85 for (HashSet<StringImpl*>::iterator iter = table->m_table.begin(); iter != end; ++iter) { 92 delete table; 102 AtomicStringTable* table = data.atomicStringTable(); local 103 if (UNLIKELY(!table)) 104 table = AtomicStringTable::create(data); 105 return *table; 110 return atomicStringTable().table(); [all...] |
/external/ltrace/sysdeps/linux-gnu/arm/ |
trace.c | 583 uint32_t table; local 587 table = (uint32_t)pc + 4; 588 else if (arm_get_register(proc, tbl_reg, &table) < 0) 595 table += offset; 598 if (proc_read_8(proc, (arch_addr_t)table, &length) < 0) 609 uint32_t table; local 613 table = (uint32_t)pc + 4; 614 else if (arm_get_register(proc, tbl_reg, &table) < 0) 621 table += 2 * offset; 624 if (proc_read_16(proc, (arch_addr_t)table, &length) < 0 [all...] |
/external/oprofile/module/ |
oprofile.c | 638 static int get_nr_interrupts(ctl_table * table, int write, struct file * filp, void * buffer, size_t * lenp) 655 ret = proc_dointvec(table, write, filp, buffer, lenp); 661 static int get_nr_buffer_overflow(ctl_table * table, int write, struct file * filp, void * buffer, size_t * lenp) 676 ret = proc_dointvec(table, write, filp, buffer, lenp); 682 int lproc_dointvec(ctl_table * table, int write, struct file * filp, void * buffer, size_t * lenp) 687 err = proc_dointvec(table, write, filp, buffer, lenp); 702 static int sysctl_do_dump(ctl_table * table, int write, struct file * filp, void * buffer, size_t * lenp) 712 err = proc_dointvec(table, write, filp, buffer, lenp); 724 static int sysctl_do_dump_stop(ctl_table * table, int write, struct file * filp, void * buffer, size_t * lenp) 734 err = proc_dointvec(table, write, filp, buffer, lenp) [all...] |
/external/chromium_org/chromeos/network/onc/ |
onc_translator_onc_to_shill.cc | 74 // using |table|. It is an error if no matching table entry is found. Writes 77 const StringTranslationEntry table[], 183 const StringTranslationEntry* table = local 186 TranslateWithTableAndSet(inner, table, shill::kEapPhase2AuthProperty); 239 const StringTranslationEntry table[], 242 if (TranslateStringToShill(table, onc_value, &shill_value)) {
|
/external/chromium_org/third_party/icu/source/common/ |
rbbidata.cpp | 213 void RBBIDataWrapper::printTable(const char *heading, const RBBIStateTable *table) { 226 if (table == NULL) { 230 for (s=0; s<table->fNumStates; s++) { 232 (table->fTableData + (table->fRowLen * s)); 252 printTable("Forward State Transition Table", fForwardTable); 253 printTable("Reverse State Transition Table", fReverseTable); 254 printTable("Safe Forward State Transition Table", fSafeFwdTable); 255 printTable("Safe Reverse State Transition Table", fSafeRevTable); 374 // Each state table begins with several 32 bit fields. Calculate the siz [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
uspoof_wsconf.cpp | 46 // | | | |---- Which table, Any Case or Lower Case (A or L) 62 "\\s*(?:(A)|(L))" // The table A or L. Group 6 or 7 210 // select the table - (A) any case or (L) lower case only 211 UTrie2 *table = anyCaseTrie; local 213 table = lowerCaseTrie; 225 int32_t setIndex = utrie2_get32(table, cp); 237 bsset->trie = table; 247 utrie2_set32(table, cp, setIndex, &status);
|