HomeSort by relevance Sort by last modified time
    Searched defs:table (Results 251 - 275 of 358) sorted by null

<<1112131415

  /external/qemu/target-arm/
helper.c 1018 uint32_t table; local
1021 table = env->cp15.c2_base1 & 0xffffc000;
1023 table = env->cp15.c2_base0 & env->cp15.c2_base_mask;
1025 table |= (address >> 18) & 0x3ffc;
1026 return table;
1034 uint32_t table; local
1043 table = get_level1_table_address(env, address);
1044 desc = ldl_phys(table);
1127 uint32_t table; local
    [all...]
  /external/qemu-pc-bios/vgabios/
clext.c 598 ; in si:mode table
1274 ;; in - al:mode, out - cflag:result, si:table, ax:destroyed variable
1363 ;; in - si: table
1367 mov bx, [si+14] ;; crtc table
  /external/quake/quake/src/WinQuake/
gl_vidandroid.cpp 89 unsigned *table; local
102 table = d_8to24table;
113 *table++ = v;
gl_vidlinuxglx.cpp 495 unsigned *table; local
504 table = d_8to24table;
513 *table++ = v;
654 GLubyte table[256][4]; local
661 table[i][2] = *oldpal++;
662 table[i][1] = *oldpal++;
663 table[i][0] = *oldpal++;
664 table[i][3] = 255;
667 qgl3DfxSetPaletteEXT((GLuint *)table);
  /external/skia/src/core/
SkBitmap.cpp 1256 const SkPMColor* SK_RESTRICT table = ct->lockColors(); local
    [all...]
  /external/skia/src/images/
SkImageDecoder_libpng.cpp 849 const SkUnPreMultiply::Scale* SK_RESTRICT table = local
860 SkUnPreMultiply::Scale scale = table[a];
875 const SkUnPreMultiply::Scale* SK_RESTRICT table = local
886 SkUnPreMultiply::Scale scale = table[a];
908 hasAlpha = false; // we store false in the table entries for kIndex8
980 const SkUnPreMultiply::Scale* SK_RESTRICT table = local
    [all...]
  /external/speex/libspeex/
preprocess.c 248 void *fft_lookup; /**< Lookup table for the FFT */
300 /* Q13 table */
301 static const spx_word16_t table[21] = { local
311 return SHL32(DIV32_16(PSHR32(MULT16_16(Q15_ONE-frac,table[ind]) + MULT16_16(frac,table[ind+1]),7),(spx_sqrt(SHL32(xx,15)+6711))),7);
360 static const float table[21] = { local
372 return FRAC_SCALING*((1-frac)*table[ind] + frac*table[ind+1])/sqrt(x+.0001f);
    [all...]
resample.c 53 makes the table much smaller and makes it possible to compute that table
54 on a per-stream basis. In turn, being able to tweak the table for each
194 double *table; member in struct:FuncDef
218 /* This table maps conversion quality to internal parameters. There are two
258 return interp[0]*func->table[ind] + interp[1]*func->table[ind+1] + interp[2]*func->table[ind+2] + interp[3]*func->table[ind+3];
275 /* The slow way of computing a sinc for the table. Should improve that some day *
    [all...]
  /external/srec/seti/sltsEngine/src/
run_seq_lts.c 144 PHashTable* table = NULL; local
152 rc = PHashTableCreate( &hashArgs, hashName, &table);
156 rc = PHashTableGetValue( table, strings[i], (void**)&old);
158 rc = PHashTablePutValue( table, strings[i], (const void *)i, NULL );
161 return table;
    [all...]
  /external/srec/srec/include/
pre_desc.h 51 { /* mul-table data types */
80 const prdata *table; member in struct:__anon11156
174 prdata exp_wt[MAX_WTS]; /* weights exp lookup table */
175 mul_table_info mul; /* Mul-table */
176 logadd_table_info add; /* logadd-table */
192 logadd_table_info fbadd; /* logadd-table for ENC */
  /external/v8/test/cctest/
test-regexp.cc 617 // Enter test data into dispatch table.
619 DispatchTable table; local
623 table.AddRange(CharacterRange(range[j], range[j + 1]), i);
625 // Check that the table looks as we would expect
627 OutSet* outs = table.Get(p);
1389 DispatchTable table; local
1405 DispatchTable table; local
    [all...]
  /external/webkit/Source/JavaScriptCore/wtf/
HashTable.h 113 HashTableConstIterator(const HashTableType* table, PointerType position, PointerType endPosition)
116 addIterator(table, this);
120 HashTableConstIterator(const HashTableType* table, PointerType position, PointerType endPosition, HashItemKnownGoodTag)
123 addIterator(table, this);
234 HashTableIterator(HashTableType* table, PointerType pos, PointerType end) : m_iterator(table, pos, end) { }
235 HashTableIterator(HashTableType* table, PointerType pos, PointerType end, HashItemKnownGoodTag tag) : m_iterator(table, pos, end, tag) { }
323 // in the table.
363 static void deallocateTable(ValueType* table, int size)
485 ValueType* table = m_table; local
532 ValueType* table = m_table; local
584 ValueType* table = m_table; local
644 ValueType* table = m_table; local
    [all...]
  /external/webkit/Source/WebCore/rendering/
RenderTableCell.cpp 96 if (RenderTableCol* tableCol = table()->colElement(col())) {
113 tableCol = table()->nextColElement(tableCol);
132 // The child cells rely on the grids up in the sections to do their computePreferredLogicalWidths work. Normally the sections are set up early, as table
135 table()->recalcSectionsIfNeeded();
249 // If the table grid is dirty, we cannot get reliable information about adjoining cells,
251 // the table is going to recalculate the grid, relayout and repaint its current rect, which
253 if (!table()->collapseBorders() || table()->needsSectionRecalc())
256 bool rtl = !table()->style()->isLeftToRightDirection();
263 if (RenderTableCell* before = table()->cellBefore(this))
464 RenderTable* table = this->table(); local
530 RenderTable* table = this->table(); local
608 RenderTable* table = this->table(); local
    [all...]
  /external/webkit/Source/WebKit/gtk/tests/
testatk.c 45 static const char* contentsInTable = "<html><body><table><tr><td>foo</td><td>bar</td></tr></table></body></html>";
47 static const char* contentsInTableWithHeaders = "<html><body><table><tr><th>foo</th><th>bar</th><th colspan='2'>baz</th></tr><tr><th>qux</th><td>1</td><td>2</td><td>3</td></tr><tr><th rowspan='2'>quux</th><td>4</td><td>5</td><td>6</td></tr><tr><td>6</td><td>7</td><td>8</td></tr><tr><th>corge</th><td>9</td><td>10</td><td>11</td></tr></table><table><tr><td>1</td><td>2</td></tr><tr><td>3</td><td>4</td></tr></table></body></html>";
59 static const char* layoutAndDataTables = "<html><body><table><tr><th>Odd</th><th>Even</th></tr><tr><td>1</td><td>2</td></tr></table><table><tr><td>foo</td><td>bar</td></tr></table></body></html>"
842 AtkObject* table = atk_object_ref_accessible_child(axWebView, 0); local
    [all...]
  /frameworks/base/packages/SettingsProvider/src/com/android/providers/settings/
SettingsProvider.java 84 * Decode a content URL into the table, projection, and arguments
88 public String table; field in class:SettingsProvider.SqlArguments
95 this.table = url.getPathSegments().get(0);
96 if (!DatabaseHelper.isValidTable(this.table)) {
97 throw new IllegalArgumentException("Bad root path: " + this.table);
106 this.table = url.getPathSegments().get(0);
107 if (!DatabaseHelper.isValidTable(this.table)) {
108 throw new IllegalArgumentException("Bad root path: " + this.table);
110 if ("system".equals(this.table) || "secure".equals(this.table)) {
146 String table = tableUri.getPathSegments().get(0); local
168 String property = null, table = uri.getPathSegments().get(0); local
    [all...]
  /libcore/luni/src/main/java/java/util/
HashMap.java 66 * An empty table shared by all zero-capacity maps (typically from default
69 * minimum-sized table.
87 * The hash table. If this hash map contains a mapping for null, it is
88 * not represented this hash table.
90 transient HashMapEntry<K, V>[] table; field in class:HashMap
109 * The table is rehashed when its size exceeds this threshold.
126 table = (HashMapEntry<K, V>[]) EMPTY_TABLE;
146 table = tab;
241 result.makeTable(table.length);
302 HashMapEntry<K, V>[] tab = table;
    [all...]
Hashtable.java 51 * An empty table shared by all zero-capacity maps (typically from default
54 * minimum-sized table.
72 * The hash table.
74 private transient HashtableEntry<K, V>[] table; field in class:Hashtable
88 * The table is rehashed when its size exceeds this threshold.
106 table = (HashtableEntry<K, V>[]) EMPTY_TABLE;
125 table = tab;
219 result.makeTable(table.length);
267 HashtableEntry<K, V>[] tab = table;
295 HashtableEntry<K, V>[] tab = table;
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentHashMap.java 20 * A hash table supporting full concurrency of retrievals and
26 * and there is <em>not</em> any support for locking the entire table
38 * Enumerations return elements reflecting the state of the hash table
46 * table is internally partitioned to try to permit the indicated
50 * threads as will ever concurrently modify the table. Using a
57 * hash table is a relatively slow operation, so, when possible, it is
58 * a good idea to provide estimates of expected table sizes in
78 * The basic strategy is to subdivide the table among Segments,
79 * each of which itself is a concurrently readable hash table.
85 * The default initial capacity for this table,
278 transient volatile HashEntry<K,V>[] table; field in class:ConcurrentHashMap.Segment
    [all...]
  /packages/providers/TelephonyProvider/src/com/android/providers/telephony/
SmsProvider.java 344 String table = TABLE_SMS; local
382 table = "raw";
386 table = "sr_pending";
390 table = "attachments";
394 table = "canonical_addresses";
404 if (table.equals(TABLE_SMS)) {
489 rowID = db.insert(table, "body", values);
491 // Don't use a trigger for updating the words table because of a bug
494 if (table == TABLE_SMS) {
495 // Update the words table with a corresponding row. The words tabl
608 String table = TABLE_SMS; local
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
locale_facets.h 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
    [all...]
  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/
locale_facets.h 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/
locale_facets.h 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
    [all...]
  /sdk/ddms/libs/ddmuilib/src/com/android/ddmuilib/log/event/
EventLogPanel.java 51 import org.eclipse.swt.widgets.Table;
631 Table table = eventDisplay.getTable(); local
632 if (table != null) {
633 addTableToFocusListener(table);
  /dalvik/vm/
Jni.cpp 111 removals require grabbing a mutex. If the table serves as an indirection
133 The GC will scan all references in the table.
201 // that we use the correct per-thread indirect reference table.
397 LOGE("Failed adding to JNI local ref table (has %zd entries)",
431 * refs table of the current thread.
513 * we're either leaking global ref table entries or we're going to
519 LOGE("Failed adding to JNI global ref table (%zd entries)",
558 IndirectRefTable *table = &gDvm.jniWeakGlobalRefTable; local
559 jobject jobj = (jobject) table->add(IRT_FIRST_SEGMENT, obj);
561 LOGE("Failed adding to JNI weak global ref table (%zd entries)", table->capacity())
572 IndirectRefTable *table = &gDvm.jniWeakGlobalRefTable; local
    [all...]
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
ElemNumber.java 484 * Table to help in converting decimals to roman numerals.
1625 char[] table = new char[radix]; local
1730 char[] table = null; local
    [all...]

Completed in 2292 milliseconds

<<1112131415