HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 501 - 525 of 3336) sorted by null

<<21222324252627282930>>

  /external/opencv/otherlibs/highgui/
bitstrm.cpp 443 int RLBitStream::GetHuff( const short* table )
450 int table_bits = table[0];
451 val = table[Show(table_bits) + 2];
456 table += val*2;
545 int RMBitStream::GetHuff( const short* table )
552 int table_bits = table[0];
553 val = table[Show(table_bits) + 1];
558 table += val;
589 bool bsCreateDecodeHuffmanTable( const int* src, short* table, int max_size )
619 /* calc offsets of sub tables and whole size of table */
690 int* table = dst; local
    [all...]
  /system/core/fs_mgr/
fs_mgr_verity.cpp 116 const char *table, uint32_t table_length)
122 // Hash the table
123 SHA256((uint8_t*)table, table_length, hash_buf);
135 LERROR << "Couldn't verify table";
149 verity.table, verity.table_length) == 0 ||
151 verity.table, verity.table_length) == 0) {
158 static int invalidate_table(char *table, size_t table_length)
165 if (table[n++] == ' ') {
173 while (n < table_length && table[n] != ' ') {
174 table[n++] = '0'
186 char *table; member in struct:verity_table_params
    [all...]
  /external/freetype/src/pshinter/
pshalgo.c 61 /* destroy hints table */
63 psh_hint_table_done( PSH_Hint_Table table,
66 FT_FREE( table->zones );
67 table->num_zones = 0;
68 table->zone = NULL;
70 FT_FREE( table->sort );
71 FT_FREE( table->hints );
72 table->num_hints = 0;
73 table->max_hints = 0;
74 table->sort_global = NULL
1571 PSH_Hint_Table table = &glyph->hint_tables[dimension]; local
1647 PSH_Blue_Table table; local
    [all...]
  /external/pdfium/third_party/freetype/src/pshinter/
pshalgo.c 61 /* destroy hints table */
63 psh_hint_table_done( PSH_Hint_Table table,
66 FT_FREE( table->zones );
67 table->num_zones = 0;
68 table->zone = NULL;
70 FT_FREE( table->sort );
71 FT_FREE( table->hints );
72 table->num_hints = 0;
73 table->max_hints = 0;
74 table->sort_global = NULL
1571 PSH_Hint_Table table = &glyph->hint_tables[dimension]; local
1647 PSH_Blue_Table table; local
    [all...]
  /external/shflags/doc/
rst2html.css 16 .borderless, table.borderless td, table.borderless th {
19 table.borderless td, table.borderless th {
20 /* Override padding for "table.docutils td" with "! important".
21 The right padding separates the table cells. */
245 table.citation {
249 table.docinfo {
253 table.docutils {
258 table.footnote
    [all...]
  /external/mesa3d/src/mesa/main/
texstore.c 4039 static StoreTexImageFunc table[MESA_FORMAT_COUNT]; local
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/text/
RBBIDataWrapper.java 80 // Index offsets to the fields in a state table row.
89 // Index offsets to header fields of a state table
98 // Bit selectors for the "FLAGS" field of the state table header
120 int fFTable; // forward state transition table.
122 int fRTable; // Offset to the reverse state transition table.
124 int fSFTable; // safe point forward transition table
126 int fSRTable; // safe point reverse transition table
132 int fStatusTable; // Offset to the table of rule status values
143 * RBBI State Table Indexing Function. Given a state number, return the
144 * array index of the start of the state table row for that state
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
RBBIDataWrapper.java 79 // Index offsets to the fields in a state table row.
88 // Index offsets to header fields of a state table
97 // Bit selectors for the "FLAGS" field of the state table header
119 int fFTable; // forward state transition table.
121 int fRTable; // Offset to the reverse state transition table.
123 int fSFTable; // safe point forward transition table
125 int fSRTable; // safe point reverse transition table
131 int fStatusTable; // Offset to the table of rule status values
142 * RBBI State Table Indexing Function. Given a state number, return the
143 * array index of the start of the state table row for that state
    [all...]
  /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowSQLiteDatabase.java 72 public long insert(String table, String nullColumnHack, ContentValues values) {
73 return insertWithOnConflict(table, nullColumnHack, values, SQLiteDatabase.CONFLICT_NONE);
77 public long insertOrThrow(String table, String nullColumnHack, ContentValues values) {
80 return insertWithOnConflict(table, nullColumnHack, values, SQLiteDatabase.CONFLICT_NONE);
84 public long replace(String table, String nullColumnHack, ContentValues values) {
85 return insertWithOnConflict(table, nullColumnHack, values, SQLiteDatabase.CONFLICT_REPLACE);
89 public long insertWithOnConflict(String table, String nullColumnHack,
93 SQLStringAndBindings sqlInsertString = buildInsertString(table, initialValues, conflictAlgorithm);
114 public Cursor query(boolean distinct, String table, String[] columns,
123 String sql = SQLiteQueryBuilder.buildQueryString(distinct, table,
    [all...]
  /external/v8/src/
compilation-cache.cc 19 // Initial size of each compilation cache table allocated.
48 CompilationCacheTable* table = local
50 result = Handle<CompilationCacheTable>(table, isolate());
100 Handle<CompilationCacheTable> table = GetTable(generation); local
101 table->Remove(*function_info);
155 Handle<CompilationCacheTable> table = GetTable(generation); local
156 Handle<Object> probe = table->Lookup(source, context, language_mode);
196 Handle<CompilationCacheTable> table = GetFirstTable(); local
197 SetFirstTable(CompilationCacheTable::Put(table, source, context,
206 // Make sure not to leak the table into the surrounding handl
212 Handle<CompilationCacheTable> table = GetTable(generation); local
237 Handle<CompilationCacheTable> table = GetFirstTable(); local
254 Handle<CompilationCacheTable> table = GetTable(generation); local
276 Handle<CompilationCacheTable> table = GetFirstTable(); local
    [all...]
  /libcore/ojluni/src/main/java/java/lang/
ThreadLocal.java 293 * very large and long-lived usages, the hash table entries use
296 * the table starts running out of space.
305 * entry can be expunged from table. Such entries are referred to
324 * The table, resized as necessary.
325 * table.length MUST always be a power of two.
327 private Entry[] table; field in class:ThreadLocal.ThreadLocalMap
330 * The number of entries in the table.
366 table = new Entry[INITIAL_CAPACITY];
368 table[i] = new Entry(firstKey, firstValue);
380 Entry[] parentTable = parentMap.table;
    [all...]
  /external/autotest/frontend/client/src/autotest/tko/
FilterSelector.java 73 private FlexTable table = new FlexTable(); field in class:FilterSelector
123 table.setWidget(0, 0, booleanOpPanel);
124 table.setWidget(1, 0, filtersPanel);
125 table.getFlexCellFormatter().setColSpan(1, 0, 2);
126 table.setWidget(2, 1, addLink);
127 table.getFlexCellFormatter().setHorizontalAlignment(
129 table.setWidget(3, 0, viewer);
130 table.getFlexCellFormatter().setColSpan(3, 0, 2);
131 table.setStylePrimaryName("box");
135 initWidget(table);
    [all...]
  /external/elfutils/lib/
fixedsizehash.h 1 /* Fixed size hash table with internal linking.
42 TYPE data type of the hash table entries
48 STORE_POINTER if defined the table stores a pointer and not an element
88 } table[0];
92 /* Constructor for the hashing table. */
97 /* We choose a size for the hashing table 150% over the number of
107 /* Adjust the size to be used for the hashing table. */
138 if (htab->table[idx].hval != 0)
143 if (htab->table[idx].hval == hval
144 && COMPARE (data, ENTRYP (htab->table[idx])) == 0
    [all...]
  /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/codecs/vc1/parser/
vc1parse_ppic_adv.c 19 * Table 20 of SMPTE 421M after processing up to POSTPROC by
28 const uint8_t *table; local
38 table = VC1_MVMODE_LOW_TBL;
40 table = VC1_MVMODE_HIGH_TBL;
51 picLayerHeader->MVMODE = table[bit_count];
64 picLayerHeader->MVMODE2 = table[bit_count];
127 * Table 83 of SMPTE 421M after processing up to POSTPROC by
203 * Table 88 of SMPTE 421M after processing up to BFRACTION by
212 const uint8_t *table; local
257 table = VC1_MVMODE_LOW_TBL;
    [all...]
  /system/extras/ioshark/
ioshark_bench_mmap.c 53 struct mmap_io_ent_tab_s table[MMAP_ENTS + 1]; member in struct:mmap_io_ent_s
69 mio->table[mio->num_entries].offset = offset;
70 mio->table[mio->num_entries].len =
72 total_len -= mio->table[mio->num_entries].len;
73 offset += mio->table[mio->num_entries].len;
91 if (mio->table[i].len > 0)
97 iolength = MIN(mio->table[i].len, iolength);
98 *offset = mio->table[i].offset;
99 mio->table[i].offset += iolength;
100 mio->table[i].len -= iolength
    [all...]
  /external/valgrind/callgrind/
bb.c 44 bbs.table = (BB**) CLG_MALLOC("cl.bb.ibh.1",
47 for (i = 0; i < bbs.size; i++) bbs.table[i] = NULL;
65 /* double size of bb table */
81 if (bbs.table[i] == NULL) continue;
83 curr = bbs.table[i];
101 VG_(free)(bbs.table);
109 bbs.table = new_table;
125 /* check fill degree of bb hash table and resize if needed (>80%) */
151 /* insert into BB hash table */
153 bb->next = bbs.table[idx]
    [all...]
  /external/freetype/src/sfnt/
ttcmap.c 5 /* TrueType character mapping table (cmap) support (body). */
63 FT_Byte* table )
65 cmap->data = table;
80 /* TABLE OVERVIEW */
86 /* length 2 USHORT table length in bytes */
95 tt_cmap0_validate( FT_Byte* table,
102 if ( table + 2 + 2 > valid->limit )
105 p = table + 2; /* skip format */
108 if ( table + length > valid->limit || length < 262 )
117 p = table + 6
134 FT_Byte* table = cmap->data; local
145 FT_Byte* table = cmap->data; local
458 FT_Byte* table = cmap->data; local
497 FT_Byte* table = cmap->data; local
709 FT_Byte* table = cmap->cmap.data; local
1615 FT_Byte* table = cmap->data; local
1637 FT_Byte* table = cmap->data; local
1875 FT_Byte* table = cmap->data; local
1912 FT_Byte* table = cmap->data; local
2079 FT_Byte* table = cmap->data; local
2106 FT_Byte* table = cmap->data; local
    [all...]
  /external/icu/icu4c/source/tools/gensprep/
filterRFC3454.pl 9 # This tool filters the RFC-3454 txt file for StringPrep tables and creates a table
28 $warning = "###################\n# WARNING: This table is generated by filterRFC3454.pl tool with\n# options: @ARGV \n###################\n\n";
159 local ($inFH, $outFH,$comment, $table) = @_;
167 # break if "End Table" is found
181 if($table =~ /A/ ){
184 }elsif ( $table =~ /B\.1/ ){
186 }elsif ( $table =~ /B\.[23]/ ){
189 }elsif ( $table =~ /C/ ) {
222 $comment = "# This table contains code points from Table A.1 from RFC 3454\n"
    [all...]
  /external/pdfium/third_party/freetype/src/sfnt/
ttcmap.c 5 /* TrueType character mapping table (cmap) support (body). */
63 FT_Byte* table )
65 cmap->data = table;
80 /* TABLE OVERVIEW */
86 /* length 2 USHORT table length in bytes */
95 tt_cmap0_validate( FT_Byte* table,
102 if ( table + 2 + 2 > valid->limit )
105 p = table + 2; /* skip format */
108 if ( table + length > valid->limit || length < 262 )
117 p = table + 6
134 FT_Byte* table = cmap->data; local
145 FT_Byte* table = cmap->data; local
456 FT_Byte* table = cmap->data; local
495 FT_Byte* table = cmap->data; local
705 FT_Byte* table = cmap->cmap.data; local
1555 FT_Byte* table = cmap->data; local
1577 FT_Byte* table = cmap->data; local
1813 FT_Byte* table = cmap->data; local
1850 FT_Byte* table = cmap->data; local
2012 FT_Byte* table = cmap->data; local
2039 FT_Byte* table = cmap->data; local
    [all...]
  /external/icu/icu4c/
icu4c.css 132 p,pre,table,ul,ol,dl {
263 table.newsItem {
312 table.rtable caption {
321 table.rtable tr th {
326 table.rtable tr td {
331 table.rtable tr.broken td {
338 table.rtable tr.rarely td {
381 table.genTable {
388 table.gentable td {
396 table.genTable td.file
    [all...]
  /packages/providers/TelephonyProvider/src/com/android/providers/telephony/
MmsProvider.java 80 * Return the proper view of "pdu" table for the current access status.
83 * @return the table/view name of the mms data
92 // First check if a restricted view of the "pdu" table should be used based on the
323 String table = TABLE_PDU; local
349 table = TABLE_PART;
353 table = TABLE_ADDR;
357 table = TABLE_RATE;
361 table = TABLE_DRM;
373 if (table.equals(TABLE_PDU)) {
415 if ((rowId = db.insert(table, null, finalValues)) <= 0)
588 String table, extraSelection = null; local
752 String table; local
    [all...]
  /art/runtime/
bytecode_utils.h 63 const uint16_t* table = reinterpret_cast<const uint16_t*>(&instruction) + table_offset; local
64 DCHECK_EQ(table[0], sparse_ ? static_cast<uint16_t>(Instruction::kSparseSwitchSignature)
66 num_entries_ = table[1];
67 values_ = reinterpret_cast<const int32_t*>(&table[2]);
76 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
79 // In a packed table, we have the starting key and num_entries_ values.
96 // Index of the first value in the table.
99 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
102 // In a packed table, we have the starting key and num_entries_ values.
117 // Whether this is a sparse-switch table (or a packed-switch one)
    [all...]
  /external/google-breakpad/src/common/linux/
dump_symbols_unittest.cc 101 StringTable table(kLittleEndian);
102 SymbolTable syms(kLittleEndian, 4, table);
106 int index = elf.AddSection(".dynstr", table, SHT_STRTAB);
141 StringTable table(kLittleEndian);
142 SymbolTable syms(kLittleEndian, 8, table);
146 int index = elf.AddSection(".dynstr", table, SHT_STRTAB);
  /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/
DecompTable.java 76 public static void sort(DecompEntry[] table, Vector decompVector)
78 for (int j = 0; j < table.length; j += 1) {
83 if (v.compareTo(table[i]) >= 0) {
87 table[i + 1] = table[i];
90 table[i + 1] = v;
156 writer.writeData(0); // coverage table offset (fixed later)
162 writer.writeData(0); // offset to sequence table (fixed later);
178 // write a format 1 coverage table
  /external/libexif/libexif/canon/
mnote-canon-entry.c 442 canon_search_table_value (const struct canon_entry_table_t table[],
447 /* Search the table for the first matching subtag and value. */
448 for (j = 0; table[j].name && ((table[j].subtag < t) ||
449 ((table[j].subtag == t) && table[j].value <= vs)); j++) {
450 if ((table[j].subtag == t) && (table[j].value == vs)) {
454 if ((table[j].subtag == t) && (table[j].value == vs) && table[j].name)
    [all...]

Completed in 698 milliseconds

<<21222324252627282930>>