HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 351 - 375 of 2317) sorted by null

<<11121314151617181920>>

  /external/sfntly/cpp/
CMakeLists.txt 47 file(GLOB SFNTLY_TABLE_COMMON_FILES src/sfntly/table/*.h src/sfntly/table/*.cc)
48 file(GLOB SFNTLY_TABLE_BITMAP_FILES src/sfntly/table/bitmap/*.h src/sfntly/table/bitmap/*.cc)
49 file(GLOB SFNTLY_TABLE_CORE_FILES src/sfntly/table/core/*.h src/sfntly/table/core/*.cc)
50 file(GLOB SFNTLY_TABLE_TTF_FILES src/sfntly/table/truetype/*.h src/sfntly/table/truetype/*.cc)
55 source_group(table FILES ${SFNTLY_TABLE_COMMON_FILES})
56 source_group(table\\bitmap FILES ${SFNTLY_TABLE_BITMAP_FILES}
    [all...]
  /external/sfntly/cpp/src/sfntly/table/core/
horizontal_metrics_table.cc 17 #include "sfntly/table/core/horizontal_metrics_table.h"
88 : Table(header, data),
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;
  /hardware/qcom/gps/msm8960/utils/
loc_log.cpp 59 const char* loc_get_name_from_mask(loc_name_val_s_type table[], int table_size, long mask)
64 if (table[i].val & (long) mask)
66 return table[i].name;
73 const char* loc_get_name_from_val(loc_name_val_s_type table[], int table_size, long value)
78 if (table[i].val == (long) value)
80 return table[i].name;
  /hardware/qcom/gps/utils/
loc_log.cpp 59 const char* loc_get_name_from_mask(loc_name_val_s_type table[], int table_size, long mask)
64 if (table[i].val & (long) mask)
66 return table[i].name;
73 const char* loc_get_name_from_val(loc_name_val_s_type table[], int table_size, long value)
78 if (table[i].val == (long) value)
80 return table[i].name;
  /system/netd/server/
RouteController.cpp 139 void addTableName(uint32_t table, const std::string& name, std::string* contents) {
141 snprintf(tableString, sizeof(tableString), "%u", table);
246 // + If |table| is non-zero, the rule points at the specified routing table. Otherwise, the rule
256 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table,
286 .action = static_cast<uint8_t>(table != RT_TABLE_UNSPEC ? FR_ACT_TO_TBL :
298 { &FRATTR_TABLE, table != RT_TABLE_UNSPEC ? sizeof(FRATTR_TABLE) : 0 },
299 { &table, table != RT_TABLE_UNSPEC ? sizeof(table) : 0 }
583 uint32_t table = getRouteTableForInterface(physicalInterface); local
682 uint32_t table = getRouteTableForInterface(interface); local
704 uint32_t table = getRouteTableForInterface(interface); local
741 uint32_t table = getRouteTableForInterface(interface); local
761 uint32_t table = getRouteTableForInterface(outputInterface); local
792 uint32_t table; local
826 uint32_t table = getRouteTableForInterface(interface); local
    [all...]
  /external/chromium_org/third_party/sfntly/
sfntly.target.darwin-arm.mk 41 third_party/sfntly/cpp/src/sfntly/table/bitmap/big_glyph_metrics.cc \
42 third_party/sfntly/cpp/src/sfntly/table/bitmap/bitmap_glyph.cc \
43 third_party/sfntly/cpp/src/sfntly/table/bitmap/bitmap_glyph_info.cc \
44 third_party/sfntly/cpp/src/sfntly/table/bitmap/bitmap_size_table.cc \
45 third_party/sfntly/cpp/src/sfntly/table/bitmap/composite_bitmap_glyph.cc \
46 third_party/sfntly/cpp/src/sfntly/table/bitmap/ebdt_table.cc \
47 third_party/sfntly/cpp/src/sfntly/table/bitmap/eblc_table.cc \
48 third_party/sfntly/cpp/src/sfntly/table/bitmap/ebsc_table.cc \
49 third_party/sfntly/cpp/src/sfntly/table/bitmap/glyph_metrics.cc \
50 third_party/sfntly/cpp/src/sfntly/table/bitmap/index_sub_table.cc
    [all...]
sfntly.target.linux-arm.mk 41 third_party/sfntly/cpp/src/sfntly/table/bitmap/big_glyph_metrics.cc \
42 third_party/sfntly/cpp/src/sfntly/table/bitmap/bitmap_glyph.cc \
43 third_party/sfntly/cpp/src/sfntly/table/bitmap/bitmap_glyph_info.cc \
44 third_party/sfntly/cpp/src/sfntly/table/bitmap/bitmap_size_table.cc \
45 third_party/sfntly/cpp/src/sfntly/table/bitmap/composite_bitmap_glyph.cc \
46 third_party/sfntly/cpp/src/sfntly/table/bitmap/ebdt_table.cc \
47 third_party/sfntly/cpp/src/sfntly/table/bitmap/eblc_table.cc \
48 third_party/sfntly/cpp/src/sfntly/table/bitmap/ebsc_table.cc \
49 third_party/sfntly/cpp/src/sfntly/table/bitmap/glyph_metrics.cc \
50 third_party/sfntly/cpp/src/sfntly/table/bitmap/index_sub_table.cc
    [all...]
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3collections.c 42 // Interface functions for hash table
47 static void antlr3HashDelete (pANTLR3_HASH_TABLE table, void * key);
48 static void * antlr3HashGet (pANTLR3_HASH_TABLE table, void * key);
49 static pANTLR3_HASH_ENTRY antlr3HashRemove (pANTLR3_HASH_TABLE table, void * key);
50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
54 static void antlr3HashDeleteI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
55 static void * antlr3HashGetI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
56 static pANTLR3_HASH_ENTRY antlr3HashRemoveI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
59 static void antlr3HashFree (pANTLR3_HASH_TABLE table);
131 pANTLR3_HASH_TABLE table; local
    [all...]
  /art/compiler/dex/quick/mips/
call_mips.cc 35 * for our PIC switch table strategy. To materialize the current location
38 * locate the switch table data and as the reference base for the switch
39 * target offsets stored in the table. We'll use a special pseudo-instruction
41 * switch table offsets (which will happen after final assembly and all
50 * addiu r_base, rRA, <table> - <BaseLabel> ; table relative to BaseLabel
51 addu r_end, r_end, r_base ; end of table
65 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
67 DumpSparseSwitchTable(table);
69 // Add the table to the list - we'll process it late
142 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
224 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
    [all...]
  /external/chromium_org/third_party/skia/tests/
DataRefTest.cpp 29 SkDataTable* table) {
30 REPORTER_ASSERT(reporter, table->isEmpty());
31 REPORTER_ASSERT(reporter, 0 == table->count());
76 SkAutoTUnref<SkDataTable> table(SkDataTable::NewCopyArrays(
79 REPORTER_ASSERT(reporter, table->count() == count);
82 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
83 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
87 const char* s = table->atStr(i);
103 SkAutoTUnref<SkDataTable> table(builder.detachDataTable());
105 REPORTER_ASSERT(reporter, table->count() == count)
    [all...]
  /external/skia/tests/
DataRefTest.cpp 29 SkDataTable* table) {
30 REPORTER_ASSERT(reporter, table->isEmpty());
31 REPORTER_ASSERT(reporter, 0 == table->count());
76 SkAutoTUnref<SkDataTable> table(SkDataTable::NewCopyArrays(
79 REPORTER_ASSERT(reporter, table->count() == count);
82 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
83 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
87 const char* s = table->atStr(i);
103 SkAutoTUnref<SkDataTable> table(builder.detachDataTable());
105 REPORTER_ASSERT(reporter, table->count() == count)
    [all...]
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3collections.h 74 * is deleted from the table.
87 /** Internal structure of a hash table bucket, which tracks
101 /** Structure that tracks a hash table
105 /** Indicates whether the table allows duplicate keys
109 /** Number of buckets available in this table
118 /** How many elements currently exist in the table.
122 /** Whether the hash table should strdup the keys it is given or not.
126 /** Pointer to function to completely delete this table
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table);
131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, void * key)
161 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_HASH_ENUM_struct
184 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_LIST_struct
    [all...]
  /external/valgrind/main/callgrind/
jumps.c 49 jccs->table = (jCC**) CLG_MALLOC("cl.jumps.ijh.1",
54 jccs->table[i] = 0;
64 dst->table = current_jccs.table;
74 current_jccs.table = h->table;
84 /* double size of jcc table */
102 if (current_jccs.table[i] == NULL) continue;
104 curr_jcc = current_jccs.table[i];
123 VG_(free)(current_jccs.table);
    [all...]
  /external/chromium_org/tools/code_coverage/third_party/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
    [all...]
  /external/clang/tools/scan-build/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
    [all...]
  /frameworks/base/tools/preload/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
    [all...]
  /prebuilts/misc/darwin-x86/analyzer/tools/scan-build/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
    [all...]
  /prebuilts/misc/linux-x86/analyzer/tools/scan-build/
sorttable.js 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
    [all...]
  /external/bzip2/
bzip.css 9 #f2f2f9 very light blue nav table background
10 #3366cc medium blue nav table border
53 table.nav {
60 table.nav a { text-decoration: none; }
61 table.nav a:hover { text-decoration: underline; }
62 table.nav td { font-size: 85%; }
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/
braille_background.js 39 * @type {!Array.<cvox.BrailleTable.Table>}
94 // First, see if we have a braille table set previously.
96 var table = cvox.BrailleTable.forId(tables, localStorage['brailleTable']);
97 if (!table) {
98 // Match table against current locale.
102 var firstPass = tables.filter(function(table) {
103 return table.locale.split(/[_-]/)[0] == major;
106 table = firstPass[0];
108 var secondPass = firstPass.filter(function(table) {
109 return table.locale.split(/[_-]/)[1] == minor
    [all...]
  /external/chromium_org/chrome/browser/resources/options/
certificate_manager.css 25 .certificate-tree-table {
  /external/chromium_org/ppapi/api/private/
ppb_flash_font_file.idl 27 /* Returns the requested font table.
36 [in] uint32_t table,
  /external/chromium_org/ppapi/thunk/
ppb_flash_font_file_thunk.cc 31 uint32_t table,
37 return enter.object()->GetFontTable(table, output, output_length);
  /external/chromium_org/sql/test/
test_helpers.h 39 // takes effect but the corresponding table update does not. This
42 // must be a leaf node (either index or table). Returns true if the
48 // through the index finds the row missing in the table.
63 // Returns the number of columns in the named table. 0 indicates an
64 // error (probably no such table).
65 size_t CountTableColumns(sql::Connection* db, const char* table)
68 // Sets |*count| to the number of rows in |table|. Returns false in
69 // case of error, such as the table not existing.
70 bool CountTableRows(sql::Connection* db, const char* table, size_t* count);
  /external/chromium_org/third_party/ots/src/
cvt.cc 7 // cvt - Control Value Table
13 Buffer table(data, length);
26 if (!table.Skip(length)) {
37 return false; // this table is not for CFF fonts.

Completed in 1846 milliseconds

<<11121314151617181920>>