Searched refs:table (Results 26 - 50 of 1739) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
H A Dstack_trace_table_test.cc14 static void CheckTracesAndReset(tcmalloc::StackTraceTable* table, argument
16 void** entries = table->ReadStackTracesAndClear();
23 static void AddTrace(tcmalloc::StackTraceTable* table, argument
31 table->AddTrace(t);
35 tcmalloc::StackTraceTable table; local
37 // Empty table
38 CHECK_EQ(table.depth_total(), 0);
39 CHECK_EQ(table.bucket_total(), 0);
41 CheckTracesAndReset(&table, k1, ARRAYSIZE(k1));
57 AddTrace(&table, t
[all...]
/external/chromium_org/chrome/browser/resources/sync_internals/
H A Devents.css6 #sync-events-table,
7 #sync-events-table th,
8 #sync-events-table td {
12 #sync-events-table {
13 table-layout: fixed;
H A Dtypes.css6 #type-counters-table {
7 table-layout: fixed;
10 #type-counters-table th {
15 #type-counters-table th.type {
20 #type-counters-table tr:nth-child(odd) {
/external/chromium_org/third_party/freetype/src/base/
H A Dftdbgmem.c226 ft_mem_table_alloc( FT_MemTable table, argument
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table, argument
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
307 FT_MemTable table; local
425 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument
504 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_ULong size, FT_Long delta ) argument
603 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument
678 FT_MemTable table = (FT_MemTable)memory->user; local
714 FT_MemTable table = (FT_MemTable)memory->user; local
740 FT_MemTable table = (FT_MemTable)memory->user; local
821 FT_MemTable table; local
884 FT_MemTable table = (FT_MemTable)memory->user; local
920 FT_MemTable table = (FT_MemTable)memory->user; local
[all...]
/external/freetype/src/base/
H A Dftdbgmem.c226 ft_mem_table_alloc( FT_MemTable table, argument
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table, argument
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
307 FT_MemTable table; local
425 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument
504 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_ULong size, FT_Long delta ) argument
603 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument
678 FT_MemTable table = (FT_MemTable)memory->user; local
714 FT_MemTable table = (FT_MemTable)memory->user; local
740 FT_MemTable table = (FT_MemTable)memory->user; local
821 FT_MemTable table; local
884 FT_MemTable table = (FT_MemTable)memory->user; local
920 FT_MemTable table = (FT_MemTable)memory->user; local
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftdbgmem.c226 ft_mem_table_alloc( FT_MemTable table, argument
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table, argument
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
307 FT_MemTable table; local
425 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument
504 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_ULong size, FT_Long delta ) argument
603 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument
678 FT_MemTable table = (FT_MemTable)memory->user; local
714 FT_MemTable table = (FT_MemTable)memory->user; local
740 FT_MemTable table = (FT_MemTable)memory->user; local
821 FT_MemTable table; local
884 FT_MemTable table = (FT_MemTable)memory->user; local
920 FT_MemTable table = (FT_MemTable)memory->user; local
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dhash.c3 * Generic hash table.
44 #define TABLE_SIZE 1023 /**< Size of lookup table/array */
50 * An entry in the hash table.
60 * The hash table data structure.
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
73 * Create a new hash table.
75 * \return pointer to a new, empty hash table.
80 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local
81 if (table) {
82 _glthread_INIT_MUTEX(table
99 _mesa_DeleteHashTable(struct _mesa_HashTable *table) argument
127 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key) argument
156 _mesa_HashLookup(struct _mesa_HashTable *table, GLuint key) argument
176 _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data) argument
231 _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key) argument
283 _mesa_HashDeleteAll(struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument
319 _mesa_HashWalk(const struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument
350 _mesa_HashFirstEntry(struct _mesa_HashTable *table) argument
373 _mesa_HashNextEntry(const struct _mesa_HashTable *table, GLuint key) argument
418 _mesa_HashPrint(const struct _mesa_HashTable *table) argument
447 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable *table, GLuint numKeys) argument
487 _mesa_HashNumEntries(const struct _mesa_HashTable *table) argument
[all...]
/external/mesa3d/src/mesa/main/
H A Dhash.c3 * Generic hash table.
44 #define TABLE_SIZE 1023 /**< Size of lookup table/array */
50 * An entry in the hash table.
60 * The hash table data structure.
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
73 * Create a new hash table.
75 * \return pointer to a new, empty hash table.
80 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local
81 if (table) {
82 _glthread_INIT_MUTEX(table
99 _mesa_DeleteHashTable(struct _mesa_HashTable *table) argument
127 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key) argument
156 _mesa_HashLookup(struct _mesa_HashTable *table, GLuint key) argument
176 _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data) argument
231 _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key) argument
283 _mesa_HashDeleteAll(struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument
319 _mesa_HashWalk(const struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument
350 _mesa_HashFirstEntry(struct _mesa_HashTable *table) argument
373 _mesa_HashNextEntry(const struct _mesa_HashTable *table, GLuint key) argument
418 _mesa_HashPrint(const struct _mesa_HashTable *table) argument
447 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable *table, GLuint numKeys) argument
487 _mesa_HashNumEntries(const struct _mesa_HashTable *table) argument
[all...]
/external/chromium-trace/trace-viewer/src/tracing/analysis/
H A Danalysis_results_test.js30 var table = new tracing.analysis.StubAnalysisTable();
32 assertEquals(0, table.nodeCount);
34 r.appendSummaryRow(table, 'false_value', false);
35 assertEquals(1, table.nodeCount);
36 node = table.lastNode;
40 r.appendSummaryRow(table, 'true_value', true);
41 assertEquals(1, table.nodeCount);
42 node = table.lastNode;
46 r.appendSummaryRow(table, 'string_value', 'a string');
47 assertEquals(1, table
[all...]
/external/chromium_org/third_party/webrtc/base/
H A Dlatebindingsymboltable_unittest.cc38 LibmTestSymbolTable table; local
39 EXPECT_FALSE(table.IsLoaded());
40 ASSERT_TRUE(table.Load());
41 EXPECT_TRUE(table.IsLoaded());
42 EXPECT_EQ(table.acos()(0.5), acos(0.5));
43 EXPECT_EQ(table.sin()(0.5), sin(0.5));
44 EXPECT_EQ(table.tan()(0.5), tan(0.5));
47 table.Unload();
48 EXPECT_FALSE(table.IsLoaded());
/external/chromium_org/third_party/icu/source/samples/layout/
H A DFontTableCache.cpp18 const void *table; member in struct:FontTableCacheEntry
33 fTableCache[i].table = NULL;
40 freeFontTable(fTableCache[i].table);
43 fTableCache[i].table = NULL;
52 void FontTableCache::freeFontTable(const void *table) const
54 LE_DELETE_ARRAY(table);
61 return fTableCache[i].table;
65 const void *table = readFontTable(tableTag); local
67 ((FontTableCache *) this)->add(tableTag, table);
69 return table;
72 add(LETag tableTag, const void *table) argument
[all...]
/external/icu/icu4c/source/samples/layout/
H A DFontTableCache.cpp18 const void *table; member in struct:FontTableCacheEntry
33 fTableCache[i].table = NULL;
40 freeFontTable(fTableCache[i].table);
43 fTableCache[i].table = NULL;
52 void FontTableCache::freeFontTable(const void *table) const
54 LE_DELETE_ARRAY(table);
61 return fTableCache[i].table;
65 const void *table = readFontTable(tableTag); local
67 ((FontTableCache *) this)->add(tableTag, table);
69 return table;
72 add(LETag tableTag, const void *table) argument
[all...]
/external/smack/src/org/xbill/DNS/
H A DOptions.java27 private static Map table; field in class:Options
62 table = null;
68 if (table == null)
69 table = new HashMap();
70 table.put(option.toLowerCase(), "true");
76 if (table == null)
77 table = new HashMap();
78 table.put(option.toLowerCase(), value.toLowerCase());
84 if (table == null)
86 table
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/
H A Dbraille_table.js6 * @fileoverview Holds information about a braille table.
45 // Append the common definitions to all table filenames.
46 tables.forEach(function(table) {
47 table.fileNames += (',' + cvox.BrailleTable.COMMON_DEFS_FILENAME_);
73 * Finds a table in a list of tables by id.
75 * @param {string} id id of table to find.
76 * @return {cvox.BrailleTable.Table} The found table, or null if not found.
79 return tables.filter(function(table) { return table.id === id })[0] || null;
84 * Returns an uncontracted braille table correspondin
[all...]
/external/chromium_org/chrome/browser/extensions/activity_log/
H A Ddatabase_string_table_unittest.cc34 DatabaseStringTable table("test");
35 table.Initialize(&db_);
40 // Insert a new mapping into the table, then verify the table contents.
42 DatabaseStringTable table("test");
43 table.Initialize(&db_);
45 ASSERT_TRUE(table.StringToInt(&db_, "abc", &id));
57 DatabaseStringTable table("test");
58 table.Initialize(&db_);
62 ASSERT_TRUE(table
[all...]
/external/libxml2/
H A Dhash.c51 * A single entry in the hash table
65 * The entire hash table
68 struct _xmlHashEntry *table; member in struct:_xmlHashTable
82 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, argument
88 value = table->random_seed;
108 return (value % table->size);
112 xmlHashComputeQKey(xmlHashTablePtr table, argument
120 value = table->random_seed;
162 return (value % table->size);
167 * @size: the size of the hash table
175 xmlHashTablePtr table; local
209 xmlHashTablePtr table; local
229 xmlHashGrow(xmlHashTablePtr table, int size) argument
320 xmlHashFree(xmlHashTablePtr table, xmlHashDeallocator f) argument
375 xmlHashAddEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata) argument
392 xmlHashAddEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) argument
411 xmlHashUpdateEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) argument
431 xmlHashUpdateEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) argument
447 xmlHashLookup(xmlHashTablePtr table, const xmlChar *name) argument
462 xmlHashLookup2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) argument
478 xmlHashQLookup(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) argument
496 xmlHashQLookup2(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) argument
517 xmlHashAddEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) argument
633 xmlHashUpdateEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) argument
755 xmlHashLookup3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) argument
799 xmlHashQLookup3(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) argument
845 xmlHashScan(xmlHashTablePtr table, xmlHashScanner f, void *data) argument
861 xmlHashScanFull(xmlHashTablePtr table, xmlHashScannerFull f, void *data) argument
912 xmlHashScan3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) argument
933 xmlHashScanFull3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) argument
975 xmlHashCopy(xmlHashTablePtr table, xmlHashCopier f) argument
1014 xmlHashSize(xmlHashTablePtr table) argument
1032 xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) argument
1051 xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) argument
1071 xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) argument
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/api/processes/process_monitor/
H A Dpopup.js9 var table = "<table>\n" +
22 table = displayProcessInfo(processes[pid], table);
24 table += "</table>\n";
26 div.innerHTML = table;
35 function displayProcessInfo(process, table) {
46 table +=
56 table
[all...]
/external/chromium_org/third_party/libxml/src/
H A Dhash.c35 * A single entry in the hash table
49 * The entire hash table
52 struct _xmlHashEntry *table; member in struct:_xmlHashTable
63 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, argument
84 return (value % table->size);
88 xmlHashComputeQKey(xmlHashTablePtr table, argument
133 return (value % table->size);
138 * @size: the size of the hash table
146 xmlHashTablePtr table; local
151 table
177 xmlHashTablePtr table; local
197 xmlHashGrow(xmlHashTablePtr table, int size) argument
288 xmlHashFree(xmlHashTablePtr table, xmlHashDeallocator f) argument
343 xmlHashAddEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata) argument
360 xmlHashAddEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) argument
379 xmlHashUpdateEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) argument
399 xmlHashUpdateEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) argument
415 xmlHashLookup(xmlHashTablePtr table, const xmlChar *name) argument
430 xmlHashLookup2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) argument
446 xmlHashQLookup(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) argument
464 xmlHashQLookup2(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) argument
485 xmlHashAddEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) argument
601 xmlHashUpdateEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) argument
723 xmlHashLookup3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) argument
767 xmlHashQLookup3(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) argument
813 xmlHashScan(xmlHashTablePtr table, xmlHashScanner f, void *data) argument
829 xmlHashScanFull(xmlHashTablePtr table, xmlHashScannerFull f, void *data) argument
880 xmlHashScan3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) argument
901 xmlHashScanFull3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) argument
943 xmlHashCopy(xmlHashTablePtr table, xmlHashCopier f) argument
982 xmlHashSize(xmlHashTablePtr table) argument
1000 xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) argument
1019 xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) argument
1039 xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) argument
[all...]
/external/chromium_org/third_party/lzma_sdk/
H A D7zCrcOpt.c8 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
10 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table) argument
19 table[0x300 + (v & 0xFF)] ^
20 table[0x200 + ((v >> 8) & 0xFF)] ^
21 table[0x100 + ((v >> 16) & 0xFF)] ^
22 table[0x000 + ((v >> 24))];
29 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table) argument
31 return CrcUpdateT4(v, data, size, table);
/external/lzma/C/
H A D7zCrcOpt.c8 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
10 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table) argument
19 table[0x300 + (v & 0xFF)] ^
20 table[0x200 + ((v >> 8) & 0xFF)] ^
21 table[0x100 + ((v >> 16) & 0xFF)] ^
22 table[0x000 + ((v >> 24))];
29 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table) argument
31 return CrcUpdateT4(v, data, size, table);
/external/chromium_org/chrome/browser/resources/memory_internals/
H A Dlist.css5 table.list {
10 table.list tr:nth-child(odd) td {
14 table.list td {
19 table.list .header th {
24 table.list .bottom th,
25 table.list th.bottom {
/external/chromium_org/base/metrics/
H A Dstats_table_unittest.cc24 // locations in the table.
28 StatsTable table(StatsTable::TableIdentifier(), kMaxThreads, kMaxCounter);
32 int slot_id = table.RegisterThread(thread_name);
35 // Fill up the table with counters.
40 int counter_id = table.FindCounter(counter_name);
45 slot_id = table.RegisterThread("too many threads");
49 int counter_id = table.FindCounter(counter_base_name);
114 // Create a stats table.
117 StatsTable table(StatsTable::TableIdentifier(), kMaxThreads, kMaxCounter);
118 StatsTable::set_current(&table);
[all...]
/external/chromium_org/native_client_sdk/src/libraries/xray/
H A Dhashtable.c29 XRAY_NO_INSTRUMENT void XRayHashTableGrow(struct XRayHashTable* table);
31 XRAY_NO_INSTRUMENT void XRayHashTableInit(struct XRayHashTable* table,
54 int XRayHashTableGetCapacity(struct XRayHashTable* table) { argument
55 return table->capacity;
59 int XRayHashTableGetCount(struct XRayHashTable* table) { argument
60 return table->count;
65 void* XRayHashTableLookup(struct XRayHashTable* table, uint32_t key) { argument
67 uint32_t m = table->capacity - 1;
72 /* An empty entry means the {key, data} isn't in the table. */
73 if (NULL == table
93 XRayHashTableInsert(struct XRayHashTable* table, void* data, uint32_t key) argument
126 XRayHashTableAtIndex(struct XRayHashTable* table, int i) argument
135 XRayHashTableGrow(struct XRayHashTable* table) argument
153 XRayHashTableInit(struct XRayHashTable* table, int32_t capacity) argument
176 struct XRayHashTable* table; local
196 XRayHashTableFree(struct XRayHashTable* table) argument
[all...]
/external/libexif/libexif/fuji/
H A Dmnote-fuji-tag.c34 } table[] = { variable in typeref:struct:__anon23673
76 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
77 if (table[i].tag == t) return (table[i].name);
87 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
88 if (table[i].tag == t) return (_(table[i].title));
97 for (i = 0; i < sizeof (table) / sizeo
[all...]
/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...]

Completed in 3437 milliseconds

1234567891011>>