HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 476 - 500 of 2064) sorted by null

<<11121314151617181920>>

  /external/icu4c/layout/
SingleTableProcessor.cpp 29 singleTableLookupTable = (const SingleTableLookupTable *) &header->table;
SingleTableProcessor2.cpp 29 singleTableLookupTable = (const SingleTableLookupTable *) &header->table;
  /external/icu4c/tools/makeconv/
makeconv.h 30 /* converter table type for writing */
52 (*addTable)(NewConverter *cnvData, UCMTable *table, UConverterStaticData *staticData);
  /external/iptables/include/
ip6tables.h 10 extern int do_command6(int argc, char *argv[], char **table,
  /external/opencv/otherlibs/highgui/
bitstrm.h 130 int GetHuff( const short* table );
150 int GetHuff( const short* table );
224 void PutHuff( int val, const int* table );
247 void PutHuff( int val, const ulong* table );
  /external/regex-re2/benchlog/
mktable 4 sub table() { subroutine
7 <table border=0>
17 </table>
118 "table" => \&table,
  /external/skia/src/core/
SkDeviceProfile.h 81 * Given a luminance byte (0 for black, 0xFF for white), generate a table
84 void generateTableForLuminanceByte(U8CPU lumByte, uint8_t table[256]) const;
  /external/v8/src/
compilation-cache.cc 46 // Initial size of each compilation cache table allocated.
82 CompilationCacheTable* table = local
84 result = Handle<CompilationCacheTable>(table, isolate());
125 Handle<CompilationCacheTable> table = GetTable(generation); local
126 table->Remove(*function_info);
179 Handle<CompilationCacheTable> table = GetTable(generation); local
180 Handle<Object> probe(table->Lookup(*source), isolate());
230 Handle<CompilationCacheTable> table = GetFirstTable(); local
231 return table->Put(*source, *function_info);
256 // Make sure not to leak the table into the surrounding handl
263 Handle<CompilationCacheTable> table = GetTable(generation); local
291 Handle<CompilationCacheTable> table = GetFirstTable(); local
326 Handle<CompilationCacheTable> table = GetTable(generation); local
351 Handle<CompilationCacheTable> table = GetFirstTable(); local
    [all...]
  /frameworks/av/media/libeffects/testlibs/
AudioCoefInterpolator.h 29 // M-dimensional function. The approximation is based on a table of output
32 // Access to values are done by specifying input values in table index units,
39 // inDims An array of size nInDims with the size of the table on each
42 // table The coefficient table. Should be of size:
44 // func([i,j,k]) = table(i,j,k,:)
46 size_t nOutDims, const audio_coef_t * table);
71 // The coefficient table.
  /ndk/sources/host-tools/nawk-20071023/
maketab.c 26 * this program makes the table to link function names
110 const char *table[SIZE]; variable
160 table[p->token-FIRSTTOKEN] = p->name;
163 if (table[i]==0)
166 printf("\t%s,\t/* %s */\n", table[i], names[i]);
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/database/
ContactsTableUtil.java 34 * Methods for operating on the contacts table.
44 final String table = Tables.CONTACTS; local
46 db.execSQL("CREATE INDEX contacts_has_phone_index ON " + table + " (" +
50 db.execSQL("CREATE INDEX contacts_name_raw_contact_id_index ON " + table + " (" +
54 db.execSQL(MoreDatabaseUtils.buildCreateIndexSql(table,
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter_bridge/
ebt_among.h 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter_bridge/
ebt_among.h 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter_bridge/
ebt_among.h 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
  /system/core/fs_mgr/
fs_mgr_verity.c 86 static int verify_table(char *signature, char *table, int table_length)
93 // Hash the table
94 SHA_hash((uint8_t*)table, table_length, hash_buf);
109 ERROR("Couldn't verify table.");
150 static int read_verity_metadata(char *block_device, char **signature, char **table)
207 // get the size of the table
209 ERROR("Couldn't get the size of the verity table from metadata!\n");
214 // get the table + null terminator
216 *table = malloc(table_length);
217 if(!*table) {
    [all...]
  /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/util/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
42 forEach(document.getElementsByTagName('table'), function(table) {
43 if (table.className.search(/\bsortable\b/) != -1) {
44 sorttable.makeSortable(table);
50 makeSortable: function(table) {
51 if (table.getElementsByTagName('thead').length == 0) {
52 // table doesn't have a tHead. Since it should have, create one and
53 // put the first table row in it.
55 the.appendChild(table.rows[0])
    [all...]
  /external/chromium_org/chrome/common/extensions/docs/examples/extensions/benchmark/util/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
40 forEach(document.getElementsByTagName('table'), function(table) {
41 if (table.className.search(/\bsortable\b/) != -1) {
42 sorttable.makeSortable(table);
48 makeSortable: function(table) {
49 if (table.getElementsByTagName('thead').length == 0) {
50 // table doesn't have a tHead. Since it should have, create one and
51 // put the first table row in it.
53 the.appendChild(table.rows[0])
    [all...]
  /external/chromium_org/third_party/sfntly/cpp/src/sfntly/
font.cc 33 #include "sfntly/table/core/font_header_table.h"
34 #include "sfntly/table/core/horizontal_device_metrics_table.h"
35 #include "sfntly/table/core/horizontal_header_table.h"
36 #include "sfntly/table/core/horizontal_metrics_table.h"
37 #include "sfntly/table/core/maximum_profile_table.h"
38 #include "sfntly/table/truetype/loca_table.h"
57 Table* Font::GetTable(int32_t tag) {
102 TablePtr table = tables_[*tag]; local
103 if (table != NULL) {
105 new Header(*tag, table->CalculatedChecksum(), table_offset
376 TablePtr table; local
496 HeaderPtr table = new Header(tag, checksum, offset, length); local
519 HeaderPtr table = new Header(tag, checksum, offset, length); local
    [all...]
  /external/sfntly/cpp/src/sfntly/
font.cc 33 #include "sfntly/table/core/font_header_table.h"
34 #include "sfntly/table/core/horizontal_device_metrics_table.h"
35 #include "sfntly/table/core/horizontal_header_table.h"
36 #include "sfntly/table/core/horizontal_metrics_table.h"
37 #include "sfntly/table/core/maximum_profile_table.h"
38 #include "sfntly/table/truetype/loca_table.h"
57 Table* Font::GetTable(int32_t tag) {
102 TablePtr table = tables_[*tag]; local
103 if (table != NULL) {
105 new Header(*tag, table->CalculatedChecksum(), table_offset
376 TablePtr table; local
496 HeaderPtr table = new Header(tag, checksum, offset, length); local
519 HeaderPtr table = new Header(tag, checksum, offset, length); local
    [all...]
  /art/compiler/dex/quick/
codegen_util.cc 227 /* Dump a mapping table */
422 LOG(INFO) << "Switch table for offset 0x" << std::hex << bx_offset;
424 if (tab_rec->table[0] == Instruction::kSparseSwitchSignature) {
425 const int* keys = reinterpret_cast<const int*>(&(tab_rec->table[2]));
426 for (int elems = 0; elems < tab_rec->table[1]; elems++) {
438 DCHECK_EQ(static_cast<int>(tab_rec->table[0]),
440 for (int elems = 0; elems < tab_rec->table[1]; elems++) {
460 code_buffer_.push_back(tab_rec->table[i] & 0xFF);
461 code_buffer_.push_back((tab_rec->table[i] >> 8) & 0xFF);
501 LOG(INFO) << "Bad dex2pcMapping table in " << PrettyMethod(cu_->method_idx, *cu_->dex_file)
807 const uint16_t* table = tab_rec->table; local
818 const uint16_t* table = tab_rec->table; local
    [all...]
  /external/chromium_org/chrome/browser/resources/chromeos/
network.js 6 // Properties to display in the network state table
86 * Create a cell in network state table.
98 * Create a row in the network state table.
107 row.className = 'network-status-table-row';
117 * Create network state table.
122 var table = $('network-status-table');
123 var oldRows = table.querySelectorAll('.network-status-table-row');
125 table.removeChild(oldRows[i])
    [all...]
  /external/chromium_org/third_party/sqlite/src/test/
laststmtchanges.test 34 create table t0 (x);
74 # changes() set properly after update on table where no rows changed
82 # changes() set properly after delete from table
102 # changes() changed properly after insert into table containing after trigger
106 create table t1 (k integer primary key);
107 create table t2 (k integer primary key, v1, v2);
146 # changes() changed properly after update into table containing after trigger
178 # changes() changed properly on delete from table containing before trigger
215 drop table t0; drop table t1; drop table t2
    [all...]
  /external/chromium/base/metrics/
stats_table.cc 28 // | Thread names table |
30 // | Thread TID table |
32 // | Thread PID table |
34 // | Counter names table |
51 // the rows and columns of the table to particular threads, locking is
55 // shared-memory table only, and is used when we create new counters (e.g.
57 // data from the table does not require any locking at the shared memory
60 // Each process which accesses the table will create a StatsTable object.
61 // The StatsTable maintains a hash table of the existing counters in the
62 // table for faster lookup. Since the hash table is process specific
250 StatsTable* table; member in struct:base::StatsTable::TLSData
435 StatsTable *table = StatsTable::current(); local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/accessibility/
AXTable.cpp 92 // Do not consider it a data table is it has an ARIA role.
102 // This employs a heuristic to determine if this table should appear.
105 // between a "layout" table and a "data" table.
107 RenderTable* table = toRenderTable(m_renderer);
108 Node* tableNode = table->node();
112 // if there is a caption element, summary, THEAD, or TFOOT section, it's most certainly a data table
117 // if someone used "rules" attribute than the table should appear
121 // if there's a colgroup or col element, it's probably a data table.
127 // go through the cell's and check for tell-tale signs of "data" table statu
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
dlist.c 638 * Delete the named display list, but don't remove from hash table.
816 * Destroy a display list and remove from hash table.
9938 struct _glapi_table *table; local
    [all...]

Completed in 396 milliseconds

<<11121314151617181920>>