| /frameworks/base/media/libstagefright/codecs/amrwbenc/inc/ |
| log2_tab.h | 23 * Purpose : Table for routine Log2().
28 static const Word16 table[33] = variable
|
| isp_isf.tab | 22 /* table of cos(x) in Q15 */
24 const static Word16 table[129] = {
|
| /frameworks/base/telephony/java/com/android/internal/telephony/ |
| MccTable.java | 43 static ArrayList<MccEntry> table; field in class:MccTable
79 index = Collections.binarySearch(table, m);
84 return table.get(index);
258 table = new ArrayList<MccEntry>(240);
262 * The table below is built from two resources:
272 * This table has not been verified.
276 table.add(new MccEntry(202,"gr",2)); //Greece
277 table.add(new MccEntry(204,"nl",2,"nl")); //Netherlands (Kingdom of the)
278 table.add(new MccEntry(206,"be",2)); //Belgium
279 table.add(new MccEntry(208,"fr",2,"fr")); //Franc
512 Collections.sort(table); typedefs
[all...] |
| /external/speex/libspeex/ |
| fftwrap.h | 44 void spx_fft_destroy(void *table);
47 void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out);
50 void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out);
53 void spx_fft_float(void *table, float *in, float *out);
56 void spx_ifft_float(void *table, float *in, float *out);
|
| fftwrap.c | 86 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)
94 spx_drft_clear(table);
95 speex_free(table);
98 void spx_fft(void *table, float *in, float *out)
103 float scale = 1./((struct drft_lookup *)table)->n;
105 for (i=0;i<((struct drft_lookup *)table)->n;i++
139 struct mkl_config *table = (struct mkl_config *) speex_alloc(sizeof(struct mkl_config)); local
182 struct fftw_config *table = (struct fftw_config *) speex_alloc(sizeof(struct fftw_config)); local
255 struct kiss_config *table; local
[all...] |
| /external/skia/src/core/ |
| SkFilterProc.h | 28 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table,
31 SkASSERT(table);
36 return table[(y << 2) | x];
39 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table,
42 SkASSERT(table);
47 return table[(y << 2) | x];
50 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table,
53 SkASSERT(table);
55 return &table[y << 30 >> 28];
73 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* table,
[all...] |
| /external/mesa3d/src/glsl/ |
| glsl_symbol_table.h | 43 * type safe and some symbol table invariants.
48 _glsl_symbol_table_destructor (glsl_symbol_table *table)
50 table->~glsl_symbol_table();
60 void *table; local
62 table = hieralloc_size(ctx, size);
63 assert(table != NULL);
65 hieralloc_set_destructor(table, (int (*)(void*)) _glsl_symbol_table_destructor);
66 return table;
72 static void operator delete(void *table)
74 hieralloc_set_destructor(table, NULL)
121 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table
[all...] |
| /external/valgrind/main/coregrind/ |
| m_hashtable.c | 3 /*--- A separately-chained hash table. m_hashtable.c ---*/
49 Bool iterOK; // table safe to iterate over?
50 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;
[all...] |
| /external/icu4c/layout/ |
| NonContextualGlyphSubst.h | 25 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader
|
| /external/javasqlite/src/main/java/SQLite/ |
| BusyHandler.java | 10 * Invoked when a table is locked by another process
12 * until the table becomes unlocked, or false in order
15 * @param table the name of the locked table
16 * @param count number of times the table was locked
19 public boolean busy(String table, int count);
|
| /frameworks/base/media/libstagefright/codecs/amrnb/common/src/ |
| lsp_lsf_tbl.cpp | 37 Description: Added #ifdef __cplusplus and removed "extern" from table
80 extern const Word16 table[65] = variable
|
| /external/bison/lib/ |
| hash.c | 1 /* hash - hashing table processing.
22 /* A generic hash table package. */
56 are not empty, there are N_ENTRIES active entries in the table. */
86 /* A hash table contains many internal entries, each holding a pointer to
91 and the current table size. At each slot position in the hash table,
97 entries divided by the table size. Finding the slot for a data is usually
100 larger hash table size (that is, a larger number of buckets) is prone to
103 Long buckets slow down the lookup algorithm. One might use big hash table
105 become inordinate, as unused slots in the hash table take some space. Th
544 Hash_table *table; local
[all...] |
| /external/mesa3d/src/mesa/main/ |
| hash.h | 3 * Generic hash table.
40 extern void _mesa_DeleteHashTable(struct _mesa_HashTable *table);
42 extern void *_mesa_HashLookup(struct _mesa_HashTable *table, GLuint key);
44 extern void _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data);
46 extern void _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key);
49 _mesa_HashDeleteAll(struct _mesa_HashTable *table,
54 _mesa_HashWalk(const struct _mesa_HashTable *table,
58 extern GLuint _mesa_HashFirstEntry(struct _mesa_HashTable *table);
60 extern GLuint _mesa_HashNextEntry(const struct _mesa_HashTable *table, GLuint key);
62 extern void _mesa_HashPrint(const struct _mesa_HashTable *table);
[all...] |
| /external/skia/include/effects/ |
| SkTableMaskFilter.h | 25 Applies a table lookup on each of the alpha values in the mask.
31 SkTableMaskFilter(const uint8_t table[256]);
34 void setTable(const uint8_t table[256]);
36 /** Utility that sets the gamma table
38 static void MakeGammaTable(uint8_t table[256], SkScalar gamma);
40 /** Utility that creates a clipping table: clamps values below min to 0
43 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max);
46 uint8_t table[256]; local
47 MakeGammaTable(table, gamma);
48 return SkNEW_ARGS(SkTableMaskFilter, (table));
52 uint8_t table[256]; local
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 226 ft_mem_table_alloc( FT_MemTable table,
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,
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
683 FT_MemTable table = (FT_MemTable)memory->user; local
719 FT_MemTable table = (FT_MemTable)memory->user; local
745 FT_MemTable table = (FT_MemTable)memory->user; local
826 FT_MemTable table; local
889 FT_MemTable table = (FT_MemTable)memory->user; local
925 FT_MemTable table = (FT_MemTable)memory->user; local
[all...] |
| /external/icu4c/samples/layout/ |
| FontTableCache.cpp | 18 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;
[all...] |
| /external/icu4c/test/letest/ |
| FontTableCache.cpp | 19 const void *table; member in struct:FontTableCacheEntry
34 fTableCache[i].table = NULL;
41 DELETE_ARRAY(fTableCache[i].table);
44 fTableCache[i].table = NULL;
52 void FontTableCache::freeFontTable(const void *table) const
54 DELETE_ARRAY(table);
61 return fTableCache[i].table;
65 const void *table = readFontTable(tableTag); local
67 ((FontTableCache *) this)->add(tableTag, table);
69 return table;
[all...] |
| /external/dbus/dbus/ |
| dbus-hash.h | 2 /* dbus-hash.h Generic hash table utility (internal to D-Bus implementation)
79 DBusHashTable* _dbus_hash_table_ref (DBusHashTable *table);
80 void _dbus_hash_table_unref (DBusHashTable *table);
81 void _dbus_hash_table_remove_all (DBusHashTable *table);
82 void _dbus_hash_iter_init (DBusHashTable *table,
93 dbus_bool_t _dbus_hash_iter_lookup (DBusHashTable *table,
97 void* _dbus_hash_table_lookup_string (DBusHashTable *table,
99 void* _dbus_hash_table_lookup_two_strings (DBusHashTable *table,
101 void* _dbus_hash_table_lookup_int (DBusHashTable *table,
103 void* _dbus_hash_table_lookup_pointer (DBusHashTable *table,
[all...] |
| dbus-hash.c | 2 /* dbus-hash.c Generic hash table utility (internal to D-Bus implementation)
8 * Hash table implementation based on generic/tclHash.c from the Tcl
83 * @defgroup DBusHashTable Hash table
91 * @defgroup DBusHashTableInternals Hash table implementation details
102 * the hash table to make it larger.
122 #define RANDOM_INDEX(table, i) \
123 (((((intptr_t) (i))*1103515245) >> (table)->down_shift) & (table)->mask)
126 * Initial number of buckets in hash table (hash table staticall
214 DBusHashTable *table; \/**< Pointer to table containing entry. *\/ member in struct:__anon5181
297 DBusHashTable *table; local
[all...] |
| /external/libxml2/ |
| hash.c | 35 * 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,
84 return (value % table->size);
88 xmlHashComputeQKey(xmlHashTablePtr table,
133 return (value % table->size);
138 * @size: the size of the hash table
146 xmlHashTablePtr table; local
151 table = xmlMalloc(sizeof(xmlHashTable))
177 xmlHashTablePtr table; local
[all...] |
| /external/chromium/chrome/browser/resources/options/ |
| certificate_manager.css | 7 .certificate-tree-table {
|
| /frameworks/base/graphics/java/android/graphics/ |
| TableMaskFilter.java | 24 public TableMaskFilter(byte[] table) {
25 if (table.length < 256) {
26 throw new RuntimeException("table.length must be >= 256");
28 native_instance = nativeNewTable(table);
43 private static native int nativeNewTable(byte[] table);
|
| /frameworks/compile/linkloader/include/ |
| ELFSectionRelTable.h | 32 std::vector<ELFRelocTy *> table; member in class:ELFSectionRelTable
46 return table.size();
50 return table[index];
54 return table[index];
|
| /external/srec/portable/src/ |
| phashtable.c | 40 PHashTable *table; member in struct:PHashTableEntry_t
76 PHashTable **table)
81 if (table == NULL ||
125 *table = tmp;
129 ESR_ReturnCode PHashTableDestroy(PHashTable *table)
133 if (table == NULL)
136 block = table->entryBlock;
144 FREE(table->entries);
145 FREE(table);
149 ESR_ReturnCode PHashTableGetSize(PHashTable *table,
[all...] |
| /external/valgrind/main/include/ |
| pub_tool_hashtable.h | 3 /*--- A hash table implementation. pub_tool_hashtable.h ---*/
34 /* Generic type for a separately-chained hash table. Via a kind of dodgy
52 /* Make a new table. Allocates the memory with VG_(calloc)(), so can
53 be freed with VG_(free)(). The table starts small but will
58 /* Count the number of nodes in a table. */
59 extern Int VG_(HT_count_nodes) ( VgHashTable table );
61 /* Add a node to the table. Duplicate keys are permitted. */
64 /* Looks up a VgHashNode in the table. Returns NULL if not found. If entries
67 extern void* VG_(HT_lookup) ( VgHashTable table, UWord key );
69 /* Removes a VgHashNode from the table. Returns NULL if not found. *
[all...] |
