| /external/chromium_org/tools/traceline/traceline/ |
| syscall_map.h | 5 // This table is a dump of system call numbers -> function names on an XP
23 std::map<int, const char*> table; local
24 if (1) { // XP table.
25 table[0] = "ntdll.dll!NtAcceptConnectPort";
26 table[1] = "ntdll.dll!NtAccessCheck";
27 table[2] = "ntdll.dll!ZwAccessCheckAndAuditAlarm";
28 table[3] = "ntdll.dll!NtAccessCheckByType";
29 table[4] = "ntdll.dll!NtAccessCheckByTypeAndAuditAlarm";
30 table[5] = "ntdll.dll!NtAccessCheckByTypeResultList";
31 table[6] = "ntdll.dll!NtAccessCheckByTypeResultListAndAuditAlarm"
[all...] |
| /frameworks/av/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 static const Word16 table[129] = {
|
| /external/eigen/doc/snippets/ |
| Tutorial_AdvancedInitialization_LinSpaced.cpp | 1 ArrayXXf table(10, 4);
2 table.col(0) = ArrayXf::LinSpaced(10, 0, 90);
3 table.col(1) = M_PI / 180 * table.col(0);
4 table.col(2) = table.col(1).sin();
5 table.col(3) = table.col(1).cos();
7 std::cout << table << std::endl;
|
| /ndk/sources/android/support/src/musl-ctype/ |
| iswpunct.c | 3 static const unsigned char table[] = { variable
10 return (table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1;
|
| iswalpha.c | 3 static const unsigned char table[] = { variable
10 return (table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractTableReadTest.java | 30 * Test cases for {@link Table} read operations.
36 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest
39 * Creates a table with the specified data.
41 * @param data the table data, repeating the sequence row key, column key,
47 protected abstract Table<String, Integer, Character>
51 assertEquals(expectedSize, table.size());
56 table = create();
60 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
61 assertTrue(table.contains("foo", 1))
[all...] |
| AbstractTableTest.java | 26 * Test cases for a {@link Table} implementation supporting reads and writes.
35 Table<String, Integer, Character> table, Object... data) {
38 table.put(
52 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
54 table.clear();
55 assertEquals(0, table.size());
56 assertFalse(table.containsRow("foo"));
59 table.clear();
66 assertNull(table.put("foo", 1, 'a'))
[all...] |
| ArrayTableTest.java | 23 import com.google.common.collect.Table.Cell;
42 ArrayTable<String, Integer, Character> table = local
44 populate(table, data);
45 return table;
49 assertEquals(9, table.size());
63 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
64 assertTrue(table.contains("foo", 1));
65 assertTrue(table.contains("bar", 1));
66 assertTrue(table.contains("foo", 3));
67 assertTrue(table.contains("foo", 2))
283 ArrayTable<String, Integer, Character> table local
289 ArrayTable<String, Integer, Character> table local
301 ArrayTable<String, Integer, Character> table local
325 ArrayTable<String, Integer, Character> table local
353 ArrayTable<String, Integer, Character> table local
380 ArrayTable<String, Integer, Character> table local
394 ArrayTable<String, Integer, Character> table local
[all...] |
| /external/chromium_org/third_party/mesa/src/chromium_gensrc/mesa/ |
| indirect_init.c | 31 * Initialize indirect rendering dispatch table.
54 * Create and initialize a new GL dispatch table. The table is initialized
59 _glapi_proc *table; local
65 table = (_glapi_proc *) Xmalloc(entries * sizeof(_glapi_proc));
69 table[i] = (_glapi_proc) NoOp;
76 table[213] = (_glapi_proc) __indirect_glAccum;
77 table[240] = (_glapi_proc) __indirect_glAlphaFunc;
78 table[7] = (_glapi_proc) __indirect_glBegin;
79 table[8] = (_glapi_proc) __indirect_glBitmap
[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);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkFilterProc.h | 21 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table,
24 SkASSERT(table);
29 return table[(y << 2) | x];
32 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table,
35 SkASSERT(table);
40 return table[(y << 2) | x];
43 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table,
46 SkASSERT(table);
48 return &table[y << 30 >> 28];
66 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* table,
[all...] |
| /external/chromium_org/tools/memory_inspector/memory_inspector/frontends/www_content/css/ |
| nheap.css | 5 #nheap-table dl {
10 #nheap-table dt {
13 #nheap-table dd {
|
| /external/skia/src/core/ |
| SkFilterProc.h | 21 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table,
24 SkASSERT(table);
29 return table[(y << 2) | x];
32 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table,
35 SkASSERT(table);
40 return table[(y << 2) | x];
43 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table,
46 SkASSERT(table);
48 return &table[y << 30 >> 28];
66 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* table,
[all...] |
| /external/icu/icu4c/source/layout/ |
| NonContextualGlyphSubst.h | 23 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader
28 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader2
|
| /frameworks/av/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[];
81 const Word16 table[65] = variable
|
| /hardware/intel/img/libdrm/libdrm/ |
| xf86drmHash.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
159 HashTablePtr table; local
176 HashTablePtr table = (HashTablePtr)t; local
227 HashTablePtr table = (HashTablePtr)t; local
240 HashTablePtr table = (HashTablePtr)t; local
262 HashTablePtr table = (HashTablePtr)t; local
279 HashTablePtr table = (HashTablePtr)t; local
296 HashTablePtr table = (HashTablePtr)t; local
377 HashTablePtr table; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| glxhash.c | 1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
37 * 1) The table is power-of-two sized. Prime sized tables are more
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table. The approach in [Larson88] is superior i
159 __glxHashTablePtr table; local
178 __glxHashTablePtr table = (__glxHashTablePtr) t; local
233 __glxHashTablePtr table = (__glxHashTablePtr) t; local
249 __glxHashTablePtr table = (__glxHashTablePtr) t; local
275 __glxHashTablePtr table = (__glxHashTablePtr) t; local
295 __glxHashTablePtr table = (__glxHashTablePtr) t; local
313 __glxHashTablePtr table = (__glxHashTablePtr) t; local
407 __glxHashTablePtr table; local
[all...] |
| /external/mesa3d/src/glx/ |
| glxhash.c | 1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
37 * 1) The table is power-of-two sized. Prime sized tables are more
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table. The approach in [Larson88] is superior i
159 __glxHashTablePtr table; local
178 __glxHashTablePtr table = (__glxHashTablePtr) t; local
233 __glxHashTablePtr table = (__glxHashTablePtr) t; local
249 __glxHashTablePtr table = (__glxHashTablePtr) t; local
275 __glxHashTablePtr table = (__glxHashTablePtr) t; local
295 __glxHashTablePtr table = (__glxHashTablePtr) t; local
313 __glxHashTablePtr table = (__glxHashTablePtr) t; local
407 __glxHashTablePtr table; local
[all...] |
| /external/chromium_org/third_party/mesa/src/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();
58 void *table; local
60 table = ralloc_size(ctx, size);
61 assert(table != NULL);
63 ralloc_set_destructor(table, (void (*)(void*)) _glsl_symbol_table_destructor);
65 return table;
71 static void operator delete(void *table)
73 ralloc_set_destructor(table, NULL)
121 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table
[all...] |
| /external/chromium_org/third_party/mesa/src/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/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();
58 void *table; local
60 table = ralloc_size(ctx, size);
61 assert(table != NULL);
63 ralloc_set_destructor(table, (void (*)(void*)) _glsl_symbol_table_destructor);
65 return table;
71 static void operator delete(void *table)
73 ralloc_set_destructor(table, NULL)
121 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table
[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 | 16 Applies a table lookup on each of the alpha values in the mask.
23 /** Utility that sets the gamma table
25 static void MakeGammaTable(uint8_t table[256], SkScalar gamma);
27 /** Utility that creates a clipping table: clamps values below min to 0
30 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max);
32 static SkTableMaskFilter* Create(const uint8_t table[256]) {
33 return SkNEW_ARGS(SkTableMaskFilter, (table));
37 uint8_t table[256]; local
38 MakeGammaTable(table, gamma);
39 return SkNEW_ARGS(SkTableMaskFilter, (table));
43 uint8_t table[256]; local
[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 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;
[all...] |
