HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 26 - 50 of 2317) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/bison/lib/
hash.c 1 /* hash - hashing table processing.
20 /* 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
598 Hash_table *table; local
    [all...]
  /external/chromium-trace/trace-viewer/src/tracing/analysis/
analyze_slices.css 6 .analysis-slices-table-col-1,
7 .analysis-slices-table-col-2 {
  /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/chromium_org/third_party/mesa/src/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/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/chromium_org/third_party/tcmalloc/chromium/src/tests/
stack_trace_table_test.cc 14 static void CheckTracesAndReset(tcmalloc::StackTraceTable* table,
16 void** entries = table->ReadStackTracesAndClear();
23 static void AddTrace(tcmalloc::StackTraceTable* table,
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));
56 // Table w/ just t
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/tests/
stack_trace_table_test.cc 14 static void CheckTracesAndReset(tcmalloc::StackTraceTable* table,
16 void** entries = table->ReadStackTracesAndClear();
23 static void AddTrace(tcmalloc::StackTraceTable* table,
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));
56 // Table w/ just t
    [all...]
  /external/chromium_org/chrome/browser/resources/sync_internals/
events.css 6 #sync-events-table,
7 #sync-events-table th,
8 #sync-events-table td {
12 #sync-events-table {
13 table-layout: fixed;
types.css 6 #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/
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
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/
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
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/
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
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/
hash.c 3 * 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) {
    [all...]
  /external/mesa3d/src/mesa/main/
hash.c 3 * 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) {
    [all...]
  /external/chromium_org/third_party/webrtc/base/
latebindingsymboltable_unittest.cc 38 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/
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/icu/icu4c/source/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/smack/src/org/xbill/DNS/
Options.java 27 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.remove(option.toLowerCase())
    [all...]
  /external/chromium_org/chrome/browser/extensions/activity_log/
database_string_table_unittest.cc 34 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.StringToInt(&db_, "string1", &id1))
    [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/chromium_org/third_party/libxml/src/
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_org/third_party/lzma_sdk/
7zCrcOpt.c 8 #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)
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)
31 return CrcUpdateT4(v, data, size, table);
  /external/lzma/C/
7zCrcOpt.c 8 #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)
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)
31 return CrcUpdateT4(v, data, size, table);
  /external/chromium_org/third_party/WebKit/PerformanceTests/Layout/resources/
large-table-with-collapsed-borders.js 12 var table = createElement("table", document.body, "table");
14 var tr = createElement("tr", table, "tr");
18 table.rows[y].cells[x].colSpan = colspan;
21 return table;
26 var table = createTable(width, height, colspan);
27 table.clientHeight;
  /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);

Completed in 2357 milliseconds

12 3 4 5 6 7 8 91011>>