| /external/skia/legacy/src/effects/ |
| SkTableMaskFilter.cpp | 18 SkTableMaskFilter::SkTableMaskFilter(const uint8_t table[256]) {
19 this->setTable(table);
24 void SkTableMaskFilter::setTable(const uint8_t table[256]) {
25 memcpy(fTable, table, 256);
44 const uint8_t* table = fTable; local
50 dstP[x] = table[srcP[x]];
94 void SkTableMaskFilter::MakeGammaTable(uint8_t table[256], SkScalar gamma) {
101 table[i] = SkPin32(sk_float_round2int(powf(x, g) * 255), 0, 255);
106 void SkTableMaskFilter::MakeClipTable(uint8_t table[256], uint8_t min,
117 memset(table, 0, min + 1)
[all...] |
| /external/webkit/Source/WebCore/accessibility/ |
| AccessibilityTableCell.cpp | 77 // by javascript, and creating a table element may try to access the render tree while in a bad state.
79 // always be the case when AT clients access a table.
81 return axObjectCache()->get(toRenderTableCell(m_renderer)->table());
86 AccessibilityObject* table = parentTable(); local
87 if (!table || !table->isAccessibilityTable())
110 // since our table might have multiple sections, we have to offset our row appropriately
112 RenderTable* table = renderCell->table(); local
113 if (!table || !section
[all...] |
| /external/webp/src/enc/ |
| cost.c | 19 // Boolean-cost cost table
53 // For each given level, the following table gives the pattern of contexts to
364 uint16_t* const table = proba->level_cost_[ctype][band][ctx]; local
367 table[0] = VP8BitCost(0, p[1]);
369 table[v] = cost_base + VariableLevelCost(v, p);
|
| /frameworks/base/core/tests/coretests/src/android/widget/layout/table/ |
| AddColumnTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.AddColumn;
30 * {@link android.widget.layout.table.AddColumn} is
31 * setup to exercise the case of adding row programmatically in a table.
47 mTable = (TableLayout) activity.findViewById(R.id.table);
|
| CellSpanTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.CellSpan;
27 * {@link android.widget.layout.table.CellSpan} is
|
| FixedWidthTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.FixedWidth;
27 * {@link android.widget.layout.table.FixedWidth} is
|
| WeightTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.Weight;
27 * {@link android.widget.layout.table.Weight} is
|
| /ndk/sources/host-tools/nawk-20071023/ |
| maketab.c | 26 * this program makes the table to link function names
110 const char *table[SIZE]; variable
160 table[p->token-FIRSTTOKEN] = p->name;
163 if (table[i]==0)
166 printf("\t%s,\t/* %s */\n", table[i], names[i]);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter_bridge/ |
| ebt_among.h | 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter_bridge/ |
| ebt_among.h | 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter_bridge/ |
| ebt_among.h | 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
|
| /external/blktrace/doc/ |
| blktrace.tex | 486 & & action specifiers in section~\ref{sec:act-table} \\ \hline
593 \emph{a} & Action, a (small) string (1 or 2 characters) -- see table below for more details \\ \hline
627 \subsubsection{\label{sec:act-table}Action Table}
628 The following table shows the various actions which may be output.
648 \subsubsection{\label{sec:act-table}RWBS Description}
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| DERUniversalString.java | 15 private static final char[] table = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; field in class:DERUniversalString
99 buf.append(table[(string[i] >>> 4) & 0xf]);
100 buf.append(table[string[i] & 0xf]);
|
| /external/chromium/chrome/browser/ui/login/ |
| login_prompt_gtk.cc | 82 GtkWidget* table = gtk_util::CreateLabeledControlsGroup(NULL, local
88 gtk_box_pack_start(GTK_BOX(root_.get()), table, FALSE, FALSE, 0); local
|
| /external/clang/test/Analysis/ |
| malloc-sizeof.c | 41 int *table = malloc(sizeof sTable); local
45 return table;
50 int *table = malloc(sizeof sTable); // expected-warning {{Result of 'malloc' is converted to a pointer of type 'int', which is incompatible with sizeof operand type 'const double [10]'}} local
51 return table;
|
| /external/dropbear/libtomcrypt/src/hashes/ |
| tiger.c | 39 #define t1 (table)
40 #define t2 (table+256)
41 #define t3 (table+256*2)
42 #define t4 (table+256*3)
44 static const ulong64 table[4*256] = { variable
[all...] |
| /external/elfutils/libelf/ |
| nlist.c | 90 struct nlist_fshash *table; local
113 /* Find a symbol table. We prefer the real symbol table but if it
114 does not exist use the dynamic symbol table. */
138 table. */
152 /* Create the hash table. */
153 table = nlist_fshash_init (nsyms);
154 if (table == NULL)
180 /* And add it to the hash table. Note that we are using the
187 (void) nlist_fshash_overwrite (table, mem.str, 0, &mem)
[all...] |
| /external/freetype/src/sfnt/ |
| ttpost.c | 5 /* Postcript name table processing for TrueType and OpenType fonts */
21 /* The post table is not completely loaded by the core engine. This */
62 /* table of Mac names. Thus, it is possible to build a version of */
173 /* UNDOCUMENTED! The number of glyphs in this table can be smaller */
174 /* than the value in the maxp table (cf. cyberbit.ttf). */
177 /* in this table, so the test for this threshold has been dropped. */
200 /* compute number of names stored in table */
239 FT_TRACE6(( "load_format_20: %d byte left in post table\n",
251 " truncating at end of post table (%d byte left)\n",
266 " all entries in post table are already parsed,
279 TT_Post_20 table = &face->postscript_names.names.format_20; local
356 TT_Post_25 table = &face->postscript_names.names.format_25; local
428 TT_Post_20 table = &names->names.format_20; local
443 TT_Post_25 table = &names->names.format_25; local
516 TT_Post_20 table = &names->names.format_20; local
539 TT_Post_25 table = &names->names.format_25; local
[all...] |
| /external/jpeg/ |
| jdmaster.c | 233 * a (subscript-check-less) C table lookup
238 * These processes all use a common table prepared by the routine below.
241 * of x is within MAXJSAMPLE+1 of the legal range, so a table running from
254 * So the post-IDCT limiting table ends up looking like this:
259 * Negative inputs select values from the upper half of the table after
262 * We can save some space by overlapping the start of the post-IDCT table
263 * with the simpler range limiting table. The post-IDCT table begins at
266 * Note that the table is allocated in near data space on PCs; it's small
272 /* Allocate and fill in the sample_range_limit table */
274 JSAMPLE * table; local
[all...] |
| /external/libpng/ |
| pngmem.c | 177 png_bytep table; local
198 table = farmalloc(total_size);
200 if (table == NULL)
211 if ((png_size_t)table & 0xfff0)
224 png_ptr->offset_table = table;
239 hptr = (png_byte huge *)table;
|
| /external/qemu/distrib/jpeg-6b/ |
| jdmaster.c | 233 * a (subscript-check-less) C table lookup
238 * These processes all use a common table prepared by the routine below.
241 * of x is within MAXJSAMPLE+1 of the legal range, so a table running from
254 * So the post-IDCT limiting table ends up looking like this:
259 * Negative inputs select values from the upper half of the table after
262 * We can save some space by overlapping the start of the post-IDCT table
263 * with the simpler range limiting table. The post-IDCT table begins at
266 * Note that the table is allocated in near data space on PCs; it's small
272 /* Allocate and fill in the sample_range_limit table */
274 JSAMPLE * table; local
[all...] |
| /external/qemu/distrib/libpng-1.2.19/ |
| pngmem.c | 164 png_bytep table; local
185 table = farmalloc(total_size);
187 if (table == NULL)
198 if ((png_size_t)table & 0xfff0)
211 png_ptr->offset_table = table;
226 hptr = (png_byte huge *)table;
|
| /external/qemu/hw/ |
| smbios.c | 72 "cannot add table\n", type);
77 struct smbios_structure_header *table = (void *)(header + 1); local
78 if (type == table->type) {
79 fprintf(stderr, "SMBIOS type %d table already defined, "
173 struct smbios_table *table; local
187 sizeof(*table) + size);
188 table = (struct smbios_table *)(smbios_entries + smbios_entries_len);
189 table->header.type = SMBIOS_TABLE_ENTRY;
190 table->header.length = cpu_to_le16(sizeof(*table) + size)
[all...] |
| /external/skia/src/effects/gradients/ |
| SkSweepGradient.cpp | 58 /* Our table stores precomputed values for atan: [0...1] -> [0..PI/4]
92 // and denom != 0. Since our table is 6bits big (+1), this is a nice fit.
187 const uint8_t* table = build_sweep_table(); local
193 // since our div_64 and table want v <= 1, where v = y/x
208 result = table[result];
|
| /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...] |
