| /external/e2fsprogs/tests/f_illitable/ |
| name | 1 illegal inode table
|
| /external/e2fsprogs/tests/f_misstable/ |
| name | 1 missing inode table
|
| /external/e2fsprogs/tests/f_bbinode/ |
| name | 1 bad blocks in inode table
|
| /external/e2fsprogs/tests/f_badtable/ |
| name | 1 bad blocks in bitmaps and inode table
|
| /external/e2fsprogs/tests/f_journal/ |
| name | 1 recover journal from corrupted inode table
|
| /external/e2fsprogs/tests/e_brel_bma/ |
| name | 1 block relocation table using the memory array implementation
|
| /external/e2fsprogs/tests/e_irel_ima/ |
| name | 1 inode relocation table using the memory array implementation
|
| /external/e2fsprogs/tests/f_full_bg/ |
| name | 1 inode table in last block of first bg
|
| /external/e2fsprogs/tests/r_move_itable/ |
| name | 1 filesystem resize which requires moving the inode table
|
| /dalvik/vm/alloc/ |
| HeapTable.c | 53 LargeHeapRefTable *table; local
58 /* Make sure that a table with a free slot is
62 table = *tableP;
68 while (table != NULL && heapRefTableIsFull(&table->refs)) {
69 prevTable = table;
70 table = table->next;
72 if (table != NULL) {
74 /* Move the table to the head of the list
122 LargeHeapRefTable *table; local
155 LargeHeapRefTable *table; local
[all...] |
| /libcore/sqlite-jdbc/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/webkit/WebCore/manual-tests/ |
| input-type-file-autocomplete-frame-2.html | 3 <table><tr><td>
5 </td></tr></table>
|
| overlappingTableSpans.html | 3 <table>
15 <table>
22 </table>
25 </table>
|
| /build/tools/droiddoc/templates/assets/ |
| android-developer-docs-devguide.css | 12 #jd-header table {
16 #jd-content table table,
17 #jd-content table img {
|
| /external/iproute2/etc/iproute2/ |
| ematch_map | 1 # lookup table for ematch kinds
|
| /external/chromium/third_party/icu/source/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/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/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...] |
| /cts/tools/signature-tools/templates/ |
| Table.st | 0 <table summary="$name$" border="1" width="100%">
8 </table>
|
| /external/icu4c/data/misc/ |
| icustd.txt | 7 icustd:table(nofallback){
|
| /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...] |
| /external/e2fsprogs/tests/progs/ |
| test_rel_cmds.ct | 8 # Block relocation table commands
11 request do_brel_ma_create, "Open a memory array block relocation table",
14 request do_brel_free, "Free a block relocation table",
23 request do_brel_start_iter, "Start iterating over the block table",
29 request do_brel_dump, "Dump the block relocation table",
32 request do_brel_move, "Move an entry in the block relocation table",
35 request do_brel_delete, "Delete an entry in the block relocation table",
39 # Inode relocation table commands
42 request do_irel_ma_create, "Open a memory array inode relocation table",
45 request do_irel_free, "Free an inode relocation table",
[all...] |
| /dalvik/docs/ |
| instruction-formats.css | 23 table {
29 table {
34 table th {
39 table {
43 table td {
59 table.letters {
66 table.letters td:first-child {
72 table.letters td:first-child + td {
77 table.letters td:first-child + td + td {
84 table.format
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| ucol_cnt.cpp | 16 * This module maintains a contraction table structure in expanded form
77 static ContractionTable *addATableElement(CntTable *table, uint32_t *key, UErrorCode *status) {
98 table->elements[table->size] = el;
100 //uhash_put(table->elements, (void *)table->size, el, status);
102 *key = table->size++;
104 if(table->size == table->capacity) {
105 ContractionTable **newElements = (ContractionTable **)uprv_malloc(table->capacity*2*sizeof(ContractionTable *))
[all...] |
