Searched defs:table (Results 276 - 300 of 807) sorted by relevance

<<11121314151617181920>>

/external/sfntly/cpp/src/test/
H A Dverify_os2.cc19 #include "sfntly/table/core/os2_table.h"
57 static bool VerifyOS_2(Table* table) { argument
58 OS2TablePtr os2 = down_cast<OS2Table*>(table);
/external/skia/bench/
H A DColorFilterBench.cpp303 static void fill_table_data(uint8_t table[]) { argument
306 table[i] = (n << 5) | (n << 2) | (n >> 1);
311 uint8_t table[256]; fill_table_data(table); local
312 return SkTableColorFilter::Create(table);
H A DFontCacheBench.cpp91 char table[kMaxHashCount]; local
92 sk_bzero(table, sizeof(table));
97 collisions += table[index];
98 table[index] = 1;
/external/skia/gm/
H A Dtablecolorfilter.cpp53 static void make_table0(uint8_t table[]) { argument
56 table[i] = (n << 5) | (n << 2) | (n >> 1);
59 static void make_table1(uint8_t table[]) { argument
61 table[i] = i * i / 255;
64 static void make_table2(uint8_t table[]) { argument
67 table[i] = static_cast<uint8_t>(sqrtf(fi) * 255);
72 uint8_t table[256]; make_table0(table); local
73 return SkTableColorFilter::Create(table);
76 uint8_t table[25 local
80 uint8_t table[256]; make_table2(table); local
[all...]
/external/skia/src/core/
H A DSkDataTable.cpp15 // Makes empty table
181 SkDataTable* table = SkNEW_ARGS(SkDataTable, local
184 // we have to detach our fHeap, since we are giving that to the table
187 return table;
H A DSkMaskGamma.cpp75 void SkTMaskGamma_build_correcting_lut(uint8_t table[256], U8CPU srcI, SkScalar contrast, argument
97 table[i] = SkToU8(sk_float_round2int(255.0f * srca));
105 // When this happens the table[255] == 0x0 instead of 0xff.
121 table[i] = SkToU8(sk_float_round2int(255.0f * result));
/external/speex/libspeex/
H A Dfftwrap.c86 struct drft_lookup *table; local
87 table = speex_alloc(sizeof(struct drft_lookup));
88 spx_drft_init((struct drft_lookup *)table, size);
89 return (void*)table;
92 void spx_fft_destroy(void *table) argument
94 spx_drft_clear(table);
95 speex_free(table);
98 void spx_fft(void *table, float *in, float *out) argument
103 float scale = 1./((struct drft_lookup *)table)->n;
105 for (i=0;i<((struct drft_lookup *)table)
116 spx_ifft(void *table, float *in, float *out) argument
139 struct mkl_config *table = (struct mkl_config *) speex_alloc(sizeof(struct mkl_config)); local
149 spx_fft_destroy(void *table) argument
156 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
162 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument
182 struct fftw_config *table = (struct fftw_config *) speex_alloc(sizeof(struct fftw_config)); local
193 spx_fft_destroy(void *table) argument
204 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
222 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument
255 struct kiss_config *table; local
263 spx_fft_destroy(void *table) argument
273 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
285 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
297 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument
315 spx_fft_float(void *table, float *in, float *out) argument
351 spx_ifft_float(void *table, float *in, float *out) argument
388 spx_fft_float(void *table, float *in, float *out) argument
392 spx_ifft_float(void *table, float *in, float *out) argument
[all...]
/external/valgrind/main/coregrind/
H A Dm_hashtable.c3 /*--- A separately-chained hash table. m_hashtable.c ---*/
49 Bool iterOK; // table safe to iterate over?
50 const HChar* name; // name of table (for debugging only)
72 VgHashTable table = VG_(calloc)("hashtable.Hc.1", local
74 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
75 table->n_chains = n_chains;
76 table->n_elements = 0;
77 table->iterOK = True;
78 table->name = name;
80 return table;
142 HT_add_node( VgHashTable table, void* vnode ) argument
158 HT_lookup( VgHashTable table, UWord key ) argument
172 HT_remove( VgHashTable table, UWord key ) argument
197 HT_to_array( VgHashTable table, UInt* n_elems ) argument
220 HT_ResetIter(VgHashTable table) argument
228 HT_Next(VgHashTable table) argument
252 HT_destruct(VgHashTable table, void(*freenode_fn)(void*)) argument
[all...]
/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/zlib/src/
H A Dzutil.c212 local ptr_table table[MAX_PTR]; variable
213 /* This table is used to remember the original form of pointers
215 * Since MSDOS is not a preemptive multitasking OS, this table is not
235 table[next_ptr].org_ptr = buf;
240 table[next_ptr++].new_ptr = buf;
253 if (ptr != table[n].new_ptr) continue;
255 farfree(table[n].org_ptr);
257 table[n-1] = table[n];
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
H A DBlowfishEngine.java402 * apply the encryption cycle to each value pair in the table.
407 int[] table)
409 int size = table.length;
423 table[s] = xr;
424 table[s + 1] = xl;
427 xl = table[s];
404 processTable( int xl, int xr, int[] table) argument
/external/chromium_org/android_webview/java/src/org/chromium/android_webview/
H A DAwContentsClientBridge.java46 ClientCertLookupTable table) {
48 mLookupTable = table;
52 ClientCertLookupTable table) {
56 mLookupTable = table;
45 AwContentsClientBridge(DefaultAndroidKeyStore keyStore, ClientCertLookupTable table) argument
51 AwContentsClientBridge(AwContentsClient client, DefaultAndroidKeyStore keyStore, ClientCertLookupTable table) argument
/external/chromium_org/base/
H A Did_map.h23 // pointers to objects. It is implemented as a hash table, optimized for
216 static inline void release_all(HashTable* table) {} argument
221 static inline void release_all(HashTable* table) { argument
222 for (typename HashTable::iterator i = table->begin();
223 i != table->end(); ++i) {
226 table->clear();
/external/chromium_org/base/strings/
H A Dstring_piece.cc15 // to the ASCII code of that character to 1 in table. This is used by
17 // the lookup table in constant time.
18 // The argument `table' must be an array that is large enough to hold all
21 // bool table[UCHAR_MAX + 1]
23 bool* table) {
27 table[static_cast<unsigned char>(data[i])] = true;
195 // 8-bit version using lookup table.
227 // 8-bit version using lookup table.
299 // 8-bit version using lookup table.
338 // 8-bit version using lookup table
22 BuildLookupTable(const StringPiece& characters_wanted, bool* table) argument
[all...]
/external/chromium_org/chrome/browser/chromeos/input_method/
H A Dinput_method_engine_browsertests.cc629 const ui::CandidateWindow& table = local
631 EXPECT_TRUE(table.is_cursor_visible());
654 const ui::CandidateWindow& table = local
658 EXPECT_TRUE(table.is_cursor_visible());
660 EXPECT_EQ(ui::CandidateWindow::VERTICAL, table.orientation());
683 const ui::CandidateWindow& table = local
687 EXPECT_TRUE(table.is_cursor_visible());
690 EXPECT_EQ(ui::CandidateWindow::VERTICAL, table.orientation());
692 EXPECT_EQ(7U, table.page_size());
711 const ui::CandidateWindow& table local
733 const ui::CandidateWindow& table = local
776 const ui::CandidateWindow& table = local
831 const ui::CandidateWindow& table = local
[all...]
/external/chromium_org/chrome/browser/sync/
H A Dsync_ui_util_unittest.cc141 GoogleServiceAuthError::State table[] = { local
156 for (size_t i = 0; i < arraysize(table); ++i) {
158 table[i],
162 table[i],
/external/chromium_org/chrome/renderer/
H A Dchrome_render_process_observer.cc134 DWORD table,
138 int rv = GetFontData(hdc, table, offset, buffer, length);
146 rv = GetFontData(hdc, table, offset, buffer, length);
133 GetFontDataPatch(HDC hdc, DWORD table, DWORD offset, LPVOID buffer, DWORD length) argument
/external/chromium_org/chromeos/network/onc/
H A Donc_translation_tables.cc387 const FieldTranslationEntry table[],
389 for (const FieldTranslationEntry* it = table;
399 bool TranslateStringToShill(const StringTranslationEntry table[], argument
402 for (int i = 0; table[i].onc_value != NULL; ++i) {
403 if (onc_value != table[i].onc_value)
405 *shill_value = table[i].shill_value;
412 bool TranslateStringToONC(const StringTranslationEntry table[], argument
415 for (int i = 0; table[i].shill_value != NULL; ++i) {
416 if (shill_value != table[i].shill_value)
418 *onc_value = table[
386 GetShillPropertyName(const std::string& onc_field_name, const FieldTranslationEntry table[], std::string* shill_property_name) argument
[all...]
H A Donc_translator_onc_to_shill.cc88 // using |table|. It is an error if no matching table entry is found. Writes
91 const StringTranslationEntry table[],
241 const StringTranslationEntry* table = local
244 TranslateWithTableAndSet(inner, table, shill::kEapPhase2AuthProperty);
297 const StringTranslationEntry table[],
300 if (TranslateStringToShill(table, onc_value, &shill_value)) {
295 TranslateWithTableAndSet( const std::string& onc_value, const StringTranslationEntry table[], const std::string& shill_property_name) argument
/external/chromium_org/content/browser/accessibility/
H A Dcross_platform_accessibility_browsertest.cc265 // In a WebKit accessibility render tree for a table, each cell is a
273 "<table border=1><tr><td>1</td><td>2</td></tr></table>";
280 const ui::AXNode* table = root->ChildAtIndex(0); local
281 EXPECT_EQ(ui::AX_ROLE_TABLE, table->data().role);
282 const ui::AXNode* row = table->ChildAtIndex(0);
288 const ui::AXNode* column1 = table->ChildAtIndex(1);
298 const ui::AXNode* column2 = table->ChildAtIndex(2);
416 "<table border=1>"
423 "</table>";
429 const ui::AXNode* table = root->ChildAtIndex(0); local
[all...]
/external/chromium_org/content/browser/quota/
H A Dquota_database_unittest.cc68 EXPECT_TRUE(verifier.table.empty());
320 std::set<EntryType> table; member in struct:content::QuotaDatabaseTest::EntryVerifier
324 : table(itr, end) {}
327 EXPECT_EQ(1u, table.erase(entry));
350 EXPECT_TRUE(verifier.table.empty());
373 EXPECT_TRUE(verifier.table.empty());
/external/chromium_org/net/disk_cache/blockfile/
H A Ddisk_format.h13 // The index file is just a simple hash table that maps a particular entry to
81 int32 table_len; // Actual size of the table (0 == kIndexTablesize).
92 CacheAddr table[kIndexTablesize]; // Default size. Actual size controlled member in struct:disk_cache::Index
/external/chromium_org/net/dns/
H A Daddress_sorter_posix.cc37 // Returns true if |p1| should precede |p2| in the table.
38 // Sorts table by decreasing prefix size to allow longest prefix matching.
44 // Creates sorted PolicyTable from |table| with |size| entries.
46 AddressSorterPosix::PolicyEntry* table,
48 AddressSorterPosix::PolicyTable result(table, table + size);
53 // Search |table| for matching prefix of |address|. |table| must be sorted by
54 // descending prefix (prefix of another prefix must be later in table).
55 unsigned GetPolicyValue(const AddressSorterPosix::PolicyTable& table, argument
45 LoadPolicy( AddressSorterPosix::PolicyEntry* table, size_t size) argument
[all...]
/external/chromium_org/net/spdy/
H A Dhpack_encoder_test.cc23 explicit HpackHeaderTablePeer(HpackHeaderTable* table) argument
24 : table_(table) {}
42 HpackHeaderTable* table() { function in class:net::test::HpackEncoderPeer
46 return HpackHeaderTablePeer(table());
102 static_(peer_.table()->GetByIndex(1)) {}
105 // Populate dynamic entries into the table fixture. For simplicity each
107 key_1_ = peer_.table()->TryAddEntry("key1", "value1");
108 key_2_ = peer_.table()->TryAddEntry("key2", "value2");
109 cookie_a_ = peer_.table()->TryAddEntry("cookie", "a=bb");
110 cookie_c_ = peer_.table()
[all...]
H A Dhpack_header_table_test.cc28 explicit HpackHeaderTablePeer(HpackHeaderTable* table) argument
29 : table_(table) {}
110 // Adds the given vector of entries to the given header table,
125 // Static table has 61 entries, dynamic entries follow those.
151 // Static entries have been populated and inserted into the table & index.
183 // Static table has 61 entries.
329 // Fill a header table with entries. Make sure the entries are in
330 // reverse order in the header table.
343 // Fill a header table with entries, and then ramp the table'
[all...]

Completed in 430 milliseconds

<<11121314151617181920>>