| /external/icu4c/layout/ |
| KernTable.cpp | 38 // Kern table version 0 only
63 * This also supports only version 0 of the kern table header, only
66 * This implementation isn't careful about the kern table flags, and
103 const Subtable_0* table = (const Subtable_0*)((char*)subhead + KERN_SUBTABLE_HEADER_SIZE); local
105 nPairs = SWAPW(table->nPairs);
108 searchRange = SWAPW(table->searchRange);
109 entrySelector = SWAPW(table->entrySelector);
110 rangeShift = SWAPW(table->rangeShift);
117 pairs = (const PairInfo*)((char*)table + KERN_SUBTABLE_0_HEADER_SIZE);
|
| /external/icu4c/test/letest/ |
| FontObject.cpp | 55 void FontObject::deleteTable(void *table)
57 delete[] (char *) table;
62 le_uint16 table = 0; local
66 table = rangeShift;
72 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
73 table += probe;
77 if (SWAPL(directory->tableDirectory[table].tag) == tag) {
78 return &directory->tableDirectory[table];
95 void *table = new char[*length]; local
98 fread(table, sizeof(char), *length, file)
[all...] |
| /external/iproute2/ip/ |
| iprule.c | 38 fprintf(stderr, "ACTION := [ table TABLE_ID ]\n");
52 __u32 table; local
155 table = rtm_get_table(r, tb);
156 if (table)
157 fprintf(fp, "lookup %s ", rtnl_rttable_n2a(table, b1, sizeof(b1)));
300 } else if (matches(*argv, "table") == 0 ||
305 invarg("invalid table ID\n", *argv);
|
| /external/iptables/iptables/ |
| ip6tables-restore.c | 72 "table '%s'\n", ip6tables_globals.program_name,
208 /* New table */
209 char *table; local
211 table = strtok(buffer+1, " \t\n");
212 DEBUGP("line %u, table '%s'\n", line, table);
213 if (!table) {
215 "%s: line %u table name invalid\n",
220 strncpy(curtable, table, IP6T_TABLE_MAXNAMELEN);
226 handle = create_handle(table);
[all...] |
| iptables-restore.c | 36 {.name = "table", .has_arg = true, .val = 'T'},
53 " [ --table=<TABLE> ]\n"
73 "table '%s'\n", prog_name, tablename);
214 /* New table */
215 char *table; local
217 table = strtok(buffer+1, " \t\n");
218 DEBUGP("line %u, table '%s'\n", line, table);
219 if (!table) {
[all...] |
| /external/kernel-headers/original/linux/ |
| poll.h | 56 struct poll_table_page * table; member in struct:poll_wqueues
|
| /external/libpng/ |
| pngtrans.c | 403 png_bytep rp, end, table; local
408 table = (png_bytep)onebppswaptable;
410 table = (png_bytep)twobppswaptable;
412 table = (png_bytep)fourbppswaptable;
417 *rp = table[*rp];
|
| /external/qemu/android/ |
| hw-events.c | 64 const EventInfo* table; member in struct:__anon13032
82 return _codes[nn].table;
|
| /external/qemu/distrib/libpng-1.2.19/ |
| pngtrans.c | 371 png_bytep rp, end, table; local
376 table = (png_bytep)onebppswaptable;
378 table = (png_bytep)twobppswaptable;
380 table = (png_bytep)fourbppswaptable;
385 *rp = table[*rp];
|
| /external/qemu/distrib/zlib-1.2.3/ |
| zutil.c | 208 local ptr_table table[MAX_PTR]; variable
209 /* This table is used to remember the original form of pointers
211 * Since MSDOS is not a preemptive multitasking OS, this table is not
231 table[next_ptr].org_ptr = buf;
236 table[next_ptr++].new_ptr = buf;
249 if (ptr != table[n].new_ptr) continue;
251 farfree(table[n].org_ptr);
253 table[n-1] = table[n];
|
| /external/skia/gm/ |
| tablecolorfilter.cpp | 55 static void make_table0(uint8_t table[]) {
58 table[i] = (n << 5) | (n << 2) | (n >> 1);
61 static void make_table1(uint8_t table[]) {
63 table[i] = i * i / 255;
66 static void make_table2(uint8_t table[]) {
69 table[i] = static_cast<uint8_t>(sqrtf(fi) * 255);
74 uint8_t table[256]; make_table0(table); local
75 return SkTableColorFilter::Create(table);
78 uint8_t table[256]; make_table1(table) local
82 uint8_t table[256]; make_table2(table); local
[all...] |
| /external/skia/legacy/src/effects/ |
| SkTableColorFilter.cpp | 34 virtual bool asComponentTable(SkBitmap* table) SK_OVERRIDE;
100 const uint8_t* table = fStorage; local
106 tableA = table; table += 256;
109 tableR = table; table += 256;
112 tableG = table; table += 256;
115 tableB = table;
186 bool SkTable_ColorFilter::asComponentTable(SkBitmap* table) {
[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...] |
| /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/webkit/Source/JavaScriptCore/wtf/text/ |
| AtomicString.cpp | 42 AtomicStringTable* table = new AtomicStringTable; local
45 data.m_atomicStringTable = table;
48 return table;
51 HashSet<StringImpl*>& table() function in class:WTF::AtomicStringTable
57 static void destroy(AtomicStringTable* table)
59 HashSet<StringImpl*>::iterator end = table->m_table.end();
60 for (HashSet<StringImpl*>::iterator iter = table->m_table.begin(); iter != end; ++iter)
62 delete table;
71 AtomicStringTable* table = wtfThreadData().atomicStringTable(); local
72 if (UNLIKELY(!table))
[all...] |
| /external/webkit/Source/WebCore/html/ |
| HTMLViewSourceDocument.cpp | 91 RefPtr<HTMLTableElement> table = HTMLTableElement::create(this); local
92 body->parserAddChild(table);
93 table->attach();
95 table->parserAddChild(m_tbody);
201 // Create a table row.
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderTableCell.h | 52 RenderTable* table() const { return toRenderTable(parent()->parent()->parent()); } function in class:WebCore::RenderTableCell
116 // FIXME: For now we just assume the cell has the same block flow direction as the table. It's likely we'll
118 // the block flow directionality of the cells to the table's directionality.
|
| /external/webkit/Source/WebKit/gtk/webkit/ |
| webkitsecurityorigin.cpp | 413 GHashTable* table = webkit_security_origins(); local
414 WebKitSecurityOrigin* origin = (WebKitSecurityOrigin*) g_hash_table_lookup(table, coreOrigin);
419 g_hash_table_insert(table, coreOrigin, origin);
|
| webkitwebbackforwardlist.cpp | 74 GHashTable* table = webkit_history_items(); local
76 g_hash_table_remove(table, items[i].get());
|
| /external/zlib/src/ |
| zutil.c | 212 local ptr_table table[MAX_PTR]; variable
213 /* This table is used to remember the original form of pointers
215 * Since MSDOS is not a preemptive multitasking OS, this table is not
235 table[next_ptr].org_ptr = buf;
240 table[next_ptr++].new_ptr = buf;
253 if (ptr != table[n].new_ptr) continue;
255 farfree(table[n].org_ptr);
257 table[n-1] = table[n];
|
| /frameworks/wilhelm/tests/examples/ |
| xaVideoDecoderCapabilities.cpp | 57 // Use a table of [integer, string] entries to map an integer to a string
64 const char *id_to_string(XAuint32 id, const id_to_string_t *table, size_t numEntries)
68 if (id == table[i].id) {
69 return table[i].string;
75 // Use a table of [integer, table] entries to map a pair of integers to a string
83 const char *id_pair_to_string(XAuint32 id1, XAuint32 id2, const id_pair_to_string_t *table,
88 if (id1 == table[i].id1) {
89 return id_to_string(id2, table[i].id2_table, table[i].id2_numEntries)
148 static const id_pair_to_string_t table[] = { local
212 static const id_pair_to_string_t table[] = { local
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| Security2Test.java | 54 // to the allSupported table then increment the count of the
104 private void addOrIncrementTable(Map<String, Integer> table, String k) {
106 if (table.containsKey(key)) {
107 int before = table.get(key);
108 table.put(key, before + 1);
110 table.put(key, 1);
|
| /packages/apps/Contacts/tests/src/com/android/contacts/tests/allintents/ |
| ResultActivity.java | 178 TableLayout table = (TableLayout)findViewById(R.id.table); local
182 table.addView(row);
188 TableLayout table = (TableLayout)findViewById(R.id.table); local
194 table.addView(separator);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/ |
| memalloc.h | 76 int tblsize; /* allocated table size */
77 struct snd_sg_page *table; /* address table */ member in struct:snd_sg_buf
78 struct page **page_table; /* page table (for vmap/vunmap) */
95 return sgbuf->table[offset >> PAGE_SHIFT].addr + offset % PAGE_SIZE;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/ |
| memalloc.h | 76 int tblsize; /* allocated table size */
77 struct snd_sg_page *table; /* address table */ member in struct:snd_sg_buf
78 struct page **page_table; /* page table (for vmap/vunmap) */
95 return sgbuf->table[offset >> PAGE_SHIFT].addr + offset % PAGE_SIZE;
|
