Searched refs:table (Results 151 - 175 of 768) sorted by relevance

1234567891011>>

/external/qemu/
H A Dkeymaps.h55 void *init_keyboard_layout(const name2keysym_t *table, const char *language);
H A Dkeymaps.c28 static int get_keysym(const name2keysym_t *table, argument
32 for(p = table; p->name != NULL; p++) {
62 static kbd_layout_t *parse_keyboard_layout(const name2keysym_t *table, argument
115 parse_keyboard_layout(table, line + 8, k);
123 keysym = get_keysym(table, line);
168 void *init_keyboard_layout(const name2keysym_t *table, const char *language) argument
170 return parse_keyboard_layout(table, language, NULL);
/external/webrtc/src/system_wrappers/source/
H A Ddata_log_unittest.cc21 // A class for storing the values expected from a log table column when
22 // verifying a log table file.
45 // Verifies that the log table stored in the file "log_file" corresponds to
74 // Verifies the table header stored in "line" to correspond with the header
91 // one line read from a log table file. An element can either be a column
118 ASSERT_EQ(DataLog::AddTable(DataLog::Combine("a proper table", 1)), 0);
121 ASSERT_LT(DataLog::AddTable(DataLog::Combine("table failure", 1)), 0);
126 DataLog::Combine("a proper table", 1));
131 DataLog::AddTable(DataLog::Combine("table", 1));
132 DataLog::AddColumn(DataLog::Combine("table",
146 FILE* table = fopen("table_1.txt", "r"); local
228 FILE* table = fopen("table_2.txt", "r"); local
251 FILE* table = fopen("table_3.txt", "r"); local
270 FILE* table = fopen("table_4.txt", "r"); local
[all...]
/external/chromium/chrome/browser/resources/options/chromeos/
H A Dcellular_plan_element.js76 var detailsTable = this.createTable_('details-plan-table',
77 'option-control-table');
98 var table = this.ownerDocument.createElement('table');
99 table.id = tableId;
100 table.className = tableClass;
101 return table;
104 addRow_: function(table, rowClass, col1Class, col1Id, col1Value,
125 table.appendChild(row);
/external/e2fsprogs/e2fsck/
H A Dgen_crc32table.c25 * crc32init_le() - allocate and initialize LE table data
46 * crc32init_be() - allocate and initialize BE table data
62 static void output_table(uint32_t table[], int len, const char *trans) argument
69 printf("%s(0x%8.8xL), ", trans, table[i]);
71 printf("%s(0x%8.8xL)\n", trans, table[len - 1]);
/external/guava/guava-gwt/src/com/google/common/collect/
H A DTreeBasedTable_CustomFieldSerializer.java48 TreeBasedTable<Object, Object, Object> table
51 table.row(row.getKey()).putAll((Map<?, ?>) row.getValue());
53 return table;
/external/iproute2/netem/
H A Dparetonormal.c2 * Paretoormal distribution table generator
54 double table[TABLESIZE+1]; local
58 table[i] = x;
61 "# This is the distribution table for the paretonormal distribution.\n"
67 normvalue = (int) rint(table[i]*TABLEFACTOR);
/external/webkit/LayoutTests/dom/html/level2/html/
H A DHTMLTableElement31.js78 The insertRow() method inserts a new empty table row. In addition, when
79 the table is empty the row is inserted into a TBODY which is created
80 and inserted into the table.
82 Load the table1 file which has a non-empty table element.
87 in the table.
104 var table;
115 table = doc.createElement("table");
116 tableNode = testNode.appendChild(table);
117 nodeList = doc.getElementsByTagName("table");
[all...]
/external/webkit/LayoutTests/dom/xhtml/level2/html/
H A DHTMLTableElement31.js78 The insertRow() method inserts a new empty table row. In addition, when
79 the table is empty the row is inserted into a TBODY which is created
80 and inserted into the table.
82 Load the table1 file which has a non-empty table element.
87 in the table.
104 var table;
115 table = doc.createElement("table");
116 tableNode = testNode.appendChild(table);
117 nodeList = doc.getElementsByTagName("table");
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/ui/
H A DConfigTab.java65 Table table; field in class:ConfigTab
104 * @param fullSelection Tells whether the table should have a full line selection or not
112 // Remove old table is present
113 boolean initResources = this.table == null;
114 if (this.table != null) {
121 // Create the "children" table
124 this.table = new Table(tabFolder, style);
125 this.table.setLinesVisible (true);
126 this.table.setHeaderVisible (true);
129 this.table
[all...]
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/
H A DSymbolTable.h11 // Symbol table for parsing. Has these design characteristics:
13 // * Same symbol table can be used to compile many shaders, to preserve
18 // so that symbol table lookups are never ambiguous. This allows
19 // a simpler symbol table structure.
21 // * Pushing and popping of scope, so symbol table will really be a stack
26 // in the symbol table. The parser can substitute constants at parse
30 // are tracked in the intermediate representation, not the symbol table.
204 // returning true means symbol was added to the table
245 // The symbol table cannot be used until push() is called, but
247 // that the symbol table ha
342 std::vector<TSymbolTableLevel*> table; member in class:TSymbolTable
[all...]
/external/webkit/Source/WebCore/accessibility/
H A DAccessibilityTableColumn.cpp59 void AccessibilityTableColumn::setParentTable(AccessibilityTable* table) argument
61 m_parentTable = table;
108 RenderTable* table = toRenderTable(renderer);
113 headerObject = headerObjectForSection(table->header(), false);
119 headerObject = headerObjectForSection(table->firstBody(), true);
H A DAccessibilityTable.cpp95 // Do not consider it a data table is it has an ARIA role.
99 // This employs a heuristic to determine if this table should appear.
102 // between a "layout" table and a "data" table.
104 RenderTable* table = toRenderTable(m_renderer);
105 Node* tableNode = table->node();
109 // if there is a caption element, summary, THEAD, or TFOOT section, it's most certainly a data table
114 // if someone used "rules" attribute than the table should appear
118 // go through the cell's and check for tell-tale signs of "data" table status
120 RenderTableSection* firstBody = table
457 RenderTable* table = toRenderTable(m_renderer); local
[all...]
/external/webkit/Source/WebCore/rendering/
H A DRenderTableSection.cpp89 RenderTable* recalcTable = table();
126 RenderObject* row = new (renderArena()) RenderTableRow(document() /* anonymous table row */);
151 // If the next renderer is actually wrapped in an anonymous table row, we need to go up and find that.
177 int nCols = max(1, table()->numEffCols());
193 Vector<RenderTable::ColumnStruct>& columns = table()->columns();
197 // (see the annotation on table cell layouting in the CSS specs and the testcase below:
240 table()->appendColumn(cSpan);
244 table()->splitColumn(m_cCol, cSpan);
262 cell->setCol(table()->effColToCol(col));
267 Vector<int>& columnPos = table()
[all...]
/external/dexmaker/src/dx/java/com/android/dx/dex/file/
H A DCatchStructs.java47 * {@code null-ok;} the underlying table; set in
50 private CatchTable table; field in class:CatchStructs
77 this.table = null;
87 if (table == null) {
88 table = code.getCatches();
99 return table.size();
121 int size = table.size();
130 handlerOffsets.put(table.get(i).getHandlers(), null);
200 int tableSize = table.size();
202 CatchTable.Entry one = table
[all...]
/external/icu4c/test/letest/
H A DFontObject.cpp55 void FontObject::deleteTable(void *table) argument
57 delete[] (char *) table;
62 le_uint16 table = 0; local
66 table = rangeShift;
72 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
73 table += probe;
77 if (SWAPL(directory->tableDirectory[table].tag) == tag) {
78 return &directory->tableDirectory[table];
95 void *table = new char[*length]; local
98 fread(table, sizeo
[all...]
/external/qemu/distrib/zlib-1.2.3/
H A Dinftrees.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
32 int inflate_table(type, lens, codes, table, bits, work)
36 code FAR * FAR *table;
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
47 unsigned used; /* code entries in table use
[all...]
H A Dzutil.c208 local ptr_table table[MAX_PTR]; variable
209 /* This table is used to remember the original form of pointers
211 * Since MSDOS is not a preemptive multitasking OS, this table is not
231 table[next_ptr].org_ptr = buf;
236 table[next_ptr++].new_ptr = buf;
249 if (ptr != table[n].new_ptr) continue;
251 farfree(table[n].org_ptr);
253 table[n-1] = table[n];
/external/qemu/hw/
H A Dsmbios.c72 "cannot add table\n", type);
77 struct smbios_structure_header *table = (void *)(header + 1); local
78 if (type == table->type) {
79 fprintf(stderr, "SMBIOS type %d table already defined, "
173 struct smbios_table *table; local
187 sizeof(*table) + size);
188 table = (struct smbios_table *)(smbios_entries + smbios_entries_len);
189 table->header.type = SMBIOS_TABLE_ENTRY;
190 table->header.length = cpu_to_le16(sizeof(*table)
[all...]
/external/elfutils/libelf/
H A Dnlist.c90 struct nlist_fshash *table; local
113 /* Find a symbol table. We prefer the real symbol table but if it
114 does not exist use the dynamic symbol table. */
138 table. */
152 /* Create the hash table. */
153 table = nlist_fshash_init (nsyms);
154 if (table == NULL)
180 /* And add it to the hash table. Note that we are using the
187 (void) nlist_fshash_overwrite (table, me
[all...]
/external/opencv/otherlibs/highgui/
H A Dbitstrm.cpp443 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 ) argument
619 /* calc offsets of sub tables and whole size of table */
690 int* table = dst; local
1058 bsCreateEncodeHuffmanTable( const int* src, ulong* table, int max_size ) argument
[all...]
/external/freetype/src/pshinter/
H A Dpshalgo.c64 /* destroy hints table */
66 psh_hint_table_done( PSH_Hint_Table table, argument
69 FT_FREE( table->zones );
70 table->num_zones = 0;
71 table->zone = 0;
73 FT_FREE( table->sort );
74 FT_FREE( table->hints );
75 table->num_hints = 0;
76 table->max_hints = 0;
77 table
99 psh_hint_table_record( PSH_Hint_Table table, FT_UInt idx ) argument
146 psh_hint_table_record_mask( PSH_Hint_Table table, PS_Mask hint_mask ) argument
174 psh_hint_table_init( PSH_Hint_Table table, PS_Hint_Table hints, PS_Mask_Table hint_masks, PS_Mask_Table counter_masks, FT_Memory memory ) argument
247 psh_hint_table_activate_mask( PSH_Hint_Table table, PS_Mask hint_mask ) argument
400 ps_simple_scale( PSH_Hint_Table table, FT_Fixed scale, FT_Fixed delta, FT_Int dimension ) argument
849 psh_hint_table_align_hints( PSH_Hint_Table table, PSH_Globals globals, FT_Int dimension, PSH_Glyph glyph ) argument
1517 psh_hint_table_find_strong_points( PSH_Hint_Table table, PSH_Point point, FT_UInt count, FT_Int threshold, FT_Int major_dir ) argument
1676 PSH_Hint_Table table = &glyph->hint_tables[dimension]; local
1756 PSH_Blue_Table table; local
[all...]
/external/elfutils/lib/
H A Dfixedsizehash.h1 /* Fixed size hash table with internal linking.
63 TYPE data type of the hash table entries
69 STORE_POINTER if defined the table stores a pointer and not an element
109 } table[0];
113 /* Constructor for the hashing table. */
118 /* We choose a size for the hashing table 150% over the number of
128 /* Adjust the size to be used for the hashing table. */
159 if (htab->table[idx].hval != 0)
164 if (htab->table[idx].hval == hval
165 && COMPARE (data, ENTRYP (htab->table[id
[all...]
/external/valgrind/main/callgrind/
H A Dbb.c44 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 */
83 if (bbs.table[i] == NULL) continue;
85 curr = bbs.table[i];
103 VG_(free)(bbs.table);
111 bbs.table = new_table;
127 /* check fill degree of bb hash table and resize if needed (>80%) */
153 /* insert into BB hash table */
155 bb->next = bbs.table[id
[all...]
/external/webkit/Source/JavaScriptCore/wtf/text/
H A DAtomicString.cpp42 AtomicStringTable* table = new AtomicStringTable; local
45 data.m_atomicStringTable = table;
48 return table;
51 HashSet<StringImpl*>& table() function in class:WTF::AtomicStringTable
57 static void destroy(AtomicStringTable* table) argument
59 HashSet<StringImpl*>::iterator end = table->m_table.end();
60 for (HashSet<StringImpl*>::iterator iter = table->m_table.begin(); iter != end; ++iter)
62 delete table;
71 AtomicStringTable* table = wtfThreadData().atomicStringTable(); local
72 if (UNLIKELY(!table))
[all...]

Completed in 960 milliseconds

1234567891011>>