| /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);
|
| /external/libxkbcommon/xkbcommon/src/ |
| atom.h | 37 atom_table_free(struct atom_table *table);
40 atom_lookup(struct atom_table *table, const char *string, size_t len);
43 atom_intern(struct atom_table *table, const char *string, size_t len,
47 atom_text(struct atom_table *table, xkb_atom_t atom);
|
| /external/mesa3d/src/glx/tests/ |
| indirect_api.cpp | 28 * Tests various apsects of the dispatch table generated by
31 * * No entry in the table should be \c NULL.
33 * * Entries in the table that correspond to "known" functions with GLX
36 * * Entries beyond the end of the "known" part of the table (i.e., entries
40 * * Entries in the table that correspond to "known" functions that lack
713 _glapi_proc *table; member in class:IndirectAPI
719 this->table = (_glapi_proc *) __glXNewIndirectAPI();
725 free(this->table);
726 this->table = NULL;
733 /* __glXNewIndirectAPI determines the size of the dispatch table by callin
738 _glapi_table *table = __glXNewIndirectAPI(); local
[all...] |
| /external/clang/test/Analysis/ |
| malloc-overflow2.c | 9 struct table { struct
11 unsigned *table; member in struct:table
15 static int table_build(struct table *t) {
18 t->table = (unsigned *)malloc(sizeof(unsigned) * t->nentry); // expected-warning {{the computation of the size of the memory allocation may overflow}}
28 static int table_build_1(struct table *t) {
29 t->nentry = (sizeof(struct table) * 2 + 31) / 32;
30 t->table = (unsigned *)malloc(sizeof(unsigned) * t->nentry); // no-warning
|
| /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;
308 FT_MemTable table; local
681 FT_MemTable table = (FT_MemTable)memory->user; local
717 FT_MemTable table = (FT_MemTable)memory->user; local
743 FT_MemTable table = (FT_MemTable)memory->user; local
825 FT_MemTable table; local
888 FT_MemTable table = (FT_MemTable)memory->user; local
923 FT_MemTable table = (FT_MemTable)memory->user; local
[all...] |
| /external/libdrm/tests/ |
| hash.c | 1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
35 * 1) The table is power-of-two sized. Prime sized tables are more
37 * sized table, especially when double hashing is not used for collision
40 * 2) The hash computation uses a table of random integers [Hanson97,
45 * With a table size of 512, the current implementation is sufficient for a
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
51 * and destroys the old table. The approach in [Larson88] is superior i
157 HashTablePtr table; local
[all...] |
| /external/webrtc/webrtc/base/ |
| latebindingsymboltable_unittest.cc | 39 LibmTestSymbolTable table; local
40 EXPECT_FALSE(table.IsLoaded());
41 ASSERT_TRUE(table.Load());
42 EXPECT_TRUE(table.IsLoaded());
43 EXPECT_EQ(table.acosf()(0.5f), acosf(0.5f));
44 EXPECT_EQ(table.sinf()(0.5f), sinf(0.5f));
45 EXPECT_EQ(table.tanf()(0.5f), tanf(0.5f));
48 table.Unload();
49 EXPECT_FALSE(table.IsLoaded());
|
| /external/icu/icu4c/source/samples/layout/ |
| FontTableCache.cpp | 22 const void *table; member in struct:FontTableCacheEntry
37 fTableCache[i].table = NULL;
44 freeFontTable(fTableCache[i].table);
47 fTableCache[i].table = NULL;
56 void FontTableCache::freeFontTable(const void *table) const
58 LE_DELETE_ARRAY(table);
65 return fTableCache[i].table;
69 const void *table = readFontTable(tableTag); local
71 ((FontTableCache *) this)->add(tableTag, table);
73 return table;
[all...] |
| /toolchain/binutils/binutils-2.27/bfd/ |
| hash.c | 1 /* hash.c -- hash table routines for BFD
33 BFD provides a simple set of hash table functions. Routines
34 are provided to initialize a hash table, to free a hash table,
35 to look up a string in a hash table and optionally create an
36 entry for it, and to traverse a hash table. There is
37 currently no routine to delete an string from a hash table.
39 The basic hash table does not permit any data to be stored
40 with a string. However, a hash table is designed to present a
44 rather than simply providing a data pointer in a hash table
709 struct bfd_hash_table table; member in struct:bfd_strtab_hash
763 struct bfd_strtab_hash *table; local
[all...] |
| /external/valgrind/coregrind/ |
| m_hashtable.c | 3 /*--- A separately-chained hash table. m_hashtable.c ---*/
51 Bool iterOK; // table safe to iterate over?
52 const HChar* name; // name of table (for debugging only)
74 VgHashTable *table = VG_(calloc)("hashtable.Hc.1", local
76 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
77 table->n_chains = n_chains;
78 table->n_elements = 0;
79 table->iterOK = True;
80 table->name = name;
82 return table;
[all...] |
| /external/libxml2/ |
| hash.c | 51 * 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,
88 value = table->random_seed;
108 return (value % table->size);
112 xmlHashComputeQKey(xmlHashTablePtr table,
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
[all...] |
| /external/freetype/src/gxvalid/ |
| gxvmorx4.c | 5 /* TrueTypeGX/AAT morx table validation */
43 gxv_morx_subtable_type4_validate( FT_Bytes table,
50 gxv_mort_subtable_type4_validate( table, limit, gxvalid );
|
| gxvmorx.h | 5 /* TrueTypeGX/AAT common definition for morx table (specification). */
40 gxv_morx_subtable_type0_validate( FT_Bytes table,
45 gxv_morx_subtable_type1_validate( FT_Bytes table,
50 gxv_morx_subtable_type2_validate( FT_Bytes table,
55 gxv_morx_subtable_type4_validate( FT_Bytes table,
60 gxv_morx_subtable_type5_validate( FT_Bytes table,
|
| /external/libxkbcommon/xkbcommon/src/compose/ |
| parser.h | 28 parse_string(struct xkb_compose_table *table,
33 parse_file(struct xkb_compose_table *table,
|
| /external/lzma/C/ |
| 7zCrcOpt.c | 10 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
12 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table)
21 table[0x300 + ((v ) & 0xFF)]
22 ^ table[0x200 + ((v >> 8) & 0xFF)]
23 ^ table[0x100 + ((v >> 16) & 0xFF)]
24 ^ table[0x000 + ((v >> 24))];
31 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table)
41 table[0x700 + ((v ) & 0xFF)]
42 ^ table[0x600 + ((v >> 8) & 0xFF)]
43 ^ table[0x500 + ((v >> 16) & 0xFF)]
[all...] |
| /system/security/keystore/tests/ |
| auth_token_table_test.cpp | 62 AuthTokenTable table; local
93 AuthTokenTable table; local
95 table.AddAuthenticationToken(make_token(1, 2));
96 table.AddAuthenticationToken(make_token(3, 4));
97 EXPECT_EQ(2U, table.size());
102 table.FindAuthorization(make_set(1), KeyPurpose::SIGN, 0, &found));
107 table.FindAuthorization(make_set(2), KeyPurpose::SIGN, 0, &found));
112 table.FindAuthorization(make_set(3), KeyPurpose::SIGN, 0, &found));
117 table.FindAuthorization(make_set(4), KeyPurpose::SIGN, 0, &found));
122 table.FindAuthorization(make_set(5), KeyPurpose::SIGN, 0, &found))
239 AuthTokenTable table; local
248 AuthTokenTable table; local
265 AuthTokenTable table; local
275 AuthTokenTable table; local
312 AuthTokenTable table; local
318 AuthTokenTable table; local
[all...] |
| /external/freetype/src/otvalid/ |
| otvgpos.h | 5 /* OpenType GPOS table validator (specification). */
27 otv_GPOS_subtable_validate( FT_Bytes table,
|
| otvbase.c | 5 /* OpenType BASE table validation (body). */
34 otv_BaseCoord_validate( FT_Bytes table,
37 FT_Bytes p = table;
61 otv_Device_validate( table + FT_NEXT_USHORT( p ), otvalid );
73 otv_BaseTagList_validate( FT_Bytes table,
76 FT_Bytes p = table;
95 otv_BaseValues_validate( FT_Bytes table,
98 FT_Bytes p = table;
115 otv_BaseCoord_validate( table + FT_NEXT_USHORT( p ), otvalid );
122 otv_MinMax_validate( FT_Bytes table,
[all...] |
| /external/guava/guava/src/com/google/common/base/ |
| SmallCharMatcher.java | 26 * An immutable version of CharMatcher for smallish sets of characters that uses a hash table
34 private final char[] table; field in class:SmallCharMatcher
38 private SmallCharMatcher(char[] table, long filter, boolean containsZero,
41 this.table = table;
72 * Returns an array size suitable for the backing array of a hash table that
95 // Compute the hash table.
96 char[] table = new char[chooseTableSize(size)]; local
97 int mask = table.length - 1;
104 if (table[index] == 0)
[all...] |
| /external/mesa3d/src/mesa/program/ |
| symbol_table.h | 28 extern void _mesa_symbol_table_push_scope(struct _mesa_symbol_table *table);
30 extern void _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table);
35 extern int _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table *table,
44 extern int _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table *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 long nativeNewTable(byte[] table);
|
| /external/skia/include/effects/ |
| SkTableMaskFilter.h | 16 Applies a table lookup on each of the alpha values in the mask.
21 /** Utility that sets the gamma table
23 static void MakeGammaTable(uint8_t table[256], SkScalar gamma);
25 /** Utility that creates a clipping table: clamps values below min to 0
28 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max);
30 static SkMaskFilter* Create(const uint8_t table[256]);
|
| /external/skqp/include/effects/ |
| SkTableMaskFilter.h | 16 Applies a table lookup on each of the alpha values in the mask.
21 /** Utility that sets the gamma table
23 static void MakeGammaTable(uint8_t table[256], SkScalar gamma);
25 /** Utility that creates a clipping table: clamps values below min to 0
28 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max);
30 static SkMaskFilter* Create(const uint8_t table[256]);
|
| /external/libexif/libexif/fuji/ |
| mnote-fuji-tag.c | 34 } table[] = { variable in typeref:struct:__anon24790
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) / sizeof (table[0]); i++
[all...] |
| /external/speex/libspeex/ |
| 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...] |
