| /external/chromium_org/third_party/skia/bench/ |
| ColorFilterBench.cpp | 303 static void fill_table_data(uint8_t table[]) {
306 table[i] = (n << 5) | (n << 2) | (n >> 1);
311 uint8_t table[256]; fill_table_data(table); local
312 return SkTableColorFilter::Create(table);
|
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableMap.java | 41 private final transient LinkedEntry<K, V>[] table; field in class:RegularImmutableMap
42 // 'and' with an int to get a table index
53 table = createEntryArray(tableSize);
65 @Nullable LinkedEntry<K, V> existing = table[tableIndex];
69 table[tableIndex] = linkedEntry;
82 checkArgument(tableSize > 0, "table too large: %s", size);
147 for (LinkedEntry<K, V> entry = table[index];
|
| /external/icu/icu4c/source/common/ |
| rbbidata.cpp | 213 void RBBIDataWrapper::printTable(const char *heading, const RBBIStateTable *table) {
226 if (table == NULL) {
230 for (s=0; s<table->fNumStates; s++) {
232 (table->fTableData + (table->fRowLen * s));
252 printTable("Forward State Transition Table", fForwardTable);
253 printTable("Reverse State Transition Table", fReverseTable);
254 printTable("Safe Forward State Transition Table", fSafeFwdTable);
255 printTable("Safe Reverse State Transition Table", fSafeRevTable);
374 // Each state table begins with several 32 bit fields. Calculate the siz
[all...] |
| /external/libsepol/src/ |
| users.c | 137 usrdatum = hashtab_search(policydb->p_users.table,
161 roldatum = hashtab_search(policydb->p_roles.table,
252 if (hashtab_insert(policydb->p_users.table, name,
297 *response = (hashtab_search(policydb->p_users.table,
326 usrdatum = hashtab_search(policydb->p_users.table,
|
| expand.c | 53 filename_trans_t **table; /* filename_trans chunks with same stype */ member in struct:linear_probe
54 filename_trans_t **ends; /* pointers to ends of **table chunks */
55 uint32_t length; /* length of the table */
60 probe->table = calloc(length, sizeof(*probe->table));
61 if (probe->table == NULL)
78 free(probe->table);
88 if (probe->table[key] != NULL) {
89 data->next = probe->table[key];
90 probe->table[key] = data
[all...] |
| /external/skia/bench/ |
| ColorFilterBench.cpp | 303 static void fill_table_data(uint8_t table[]) {
306 table[i] = (n << 5) | (n << 2) | (n >> 1);
311 uint8_t table[256]; fill_table_data(table); local
312 return SkTableColorFilter::Create(table);
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemNumber.java | 484 * Table to help in converting decimals to roman numerals.
1625 char[] table = new char[radix]; local
1730 char[] table = null; local
[all...] |
| /external/owasp/sanitizer/empiricism/ |
| canned-data.js | 115 "table": true,
236 "table",
351 "table",
466 "table",
581 "table",
696 "table",
812 "table",
927 "table",
1042 "table",
1157 "table",
[all...] |
| /external/chromium_org/third_party/skia/src/effects/ |
| SkDisplacementMapEffect.cpp | 31 SkColor l, const SkUnPreMultiply::Scale* table) {
32 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedR32(l));
36 SkColor l, const SkUnPreMultiply::Scale* table) {
37 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedG32(l));
41 SkColor l, const SkUnPreMultiply::Scale* table) {
42 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedB32(l));
64 const SkUnPreMultiply::Scale* table = SkUnPreMultiply::GetScaleTable(); local
71 SkIntToScalar(getValue<typeX>(*displPtr, table))) + scaleAdj.fX;
73 SkIntToScalar(getValue<typeY>(*displPtr, table))) + scaleAdj.fY;
|
| /external/guava/guava-tests/test/com/google/common/cache/ |
| CacheBuilderTest.java | 92 assertEquals(2, map.segments[0].table.length());
93 assertEquals(2, map.segments[1].table.length());
94 assertEquals(2, map.segments[2].table.length());
95 assertEquals(2, map.segments[3].table.length());
107 assertEquals(1, map.segments[0].table.length());
108 assertEquals(1, map.segments[1].table.length());
109 assertEquals(1, map.segments[2].table.length());
110 assertEquals(1, map.segments[3].table.length());
616 assertEquals(4, map.segments[0].table.length()); // capacity / conc level
|
| /external/oprofile/libpopt/ |
| popthelp.c | 50 * Empty table marker to enable displaying popt alias/exec options.
58 * Auto help table options.
89 * @param table option(s)
92 getTableTranslationDomain(/*@null@*/ const struct poptOption *table)
97 if (table != NULL)
98 for (opt = table; opt->longName || opt->shortName || opt->arg; opt++) {
493 * Display help text for a table of options.
496 * @param table option(s)
501 /*@null@*/ const struct poptOption * table, size_t left,
509 if (table == poptAliasOptions)
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| SDL_pixels.c | 537 if ( map->table ) {
538 SDL_free(map->table);
539 map->table = NULL;
569 map->table = Map1to1(srcfmt->palette,
573 if ( map->table == NULL ) {
583 map->table = Map1toN(srcfmt, dstfmt);
584 if ( map->table == NULL ) {
594 map->table = MapNto1(srcfmt, dstfmt, &map->identity);
596 if ( map->table == NULL ) {
|
| /external/skia/src/effects/ |
| SkDisplacementMapEffect.cpp | 31 SkColor l, const SkUnPreMultiply::Scale* table) {
32 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedR32(l));
36 SkColor l, const SkUnPreMultiply::Scale* table) {
37 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedG32(l));
41 SkColor l, const SkUnPreMultiply::Scale* table) {
42 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedB32(l));
64 const SkUnPreMultiply::Scale* table = SkUnPreMultiply::GetScaleTable(); local
71 SkIntToScalar(getValue<typeX>(*displPtr, table))) + scaleAdj.fX;
73 SkIntToScalar(getValue<typeY>(*displPtr, table))) + scaleAdj.fY;
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sre_compile.py | 457 # generate overlap table
458 table = [-1] + ([0]*len(prefix))
460 table[i+1] = table[i]+1
461 while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
462 table[i+1] = table[table[i+1]-1]+1
463 code.extend(table[1:]) # don't store first entr
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sre_compile.py | 457 # generate overlap table
458 table = [-1] + ([0]*len(prefix))
460 table[i+1] = table[i]+1
461 while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
462 table[i+1] = table[table[i+1]-1]+1
463 code.extend(table[1:]) # don't store first entr
[all...] |
| /external/valgrind/main/callgrind/ |
| bbcc.c | 40 /* BBCC table (key is BB/Context), per thread, resizable */
51 bbccs->table = (BBCC**) CLG_MALLOC("cl.bbcc.ibh.1",
54 for (i = 0; i < bbccs->size; i++) bbccs->table[i] = NULL;
63 dst->table = current_bbccs.table;
77 current_bbccs.table = h->table;
118 if ((bbcc=current_bbccs.table[i]) == NULL) continue;
135 * thread specific hash table with key
174 bbcc = current_bbccs.table[idx]
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| icusvtst.cpp | 46 Hashtable table; member in class:LKFSubclass
53 table.put("en_US", this, status);
58 return &table;
836 Hashtable* table = new Hashtable(); local
837 table->put(UnicodeString(californio), (void*)table, status);
838 table->put(UnicodeString(valley), (void*)table, status);
839 table->put(UnicodeString(surfer), (void*)table, status)
1415 Hashtable table; local
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| icusvtst.cpp | 46 Hashtable table; member in class:LKFSubclass
53 table.put("en_US", this, status);
58 return &table;
836 Hashtable* table = new Hashtable(); local
837 table->put(UnicodeString(californio), (void*)table, status);
838 table->put(UnicodeString(valley), (void*)table, status);
839 table->put(UnicodeString(surfer), (void*)table, status)
1414 Hashtable table; local
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| keyboard_handler.js | 31 * @param {string} keyToFunctionsTable The key bindings table in JSON form.
44 * Converts the key bindings table into an array that is sorted by the lengths
49 * @return {Array.<Array.<string>>} The sorted key bindings table in
|
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| waterfall_view.css | 18 #waterfall-view-time-bar-table {
22 /* Displays above main tab and under information table. */
26 #waterfall-view-information-table {
33 /* Displays above time bar table. */
68 .waterfall-view-table-row {
89 /* Displays above info table and controls */
|
| /external/chromium_org/chrome/browser/resources/ |
| plugins.css | 80 .section-header > table tr td:first-child {
84 .section-header > table {
200 .plugin-details table {
229 /* Separate the header from the contents in each MIME Types table. */
|
| /external/chromium_org/gpu/command_buffer/common/ |
| gles2_cmd_utils.cc | 719 const EnumToString* table, size_t count, uint32 value) {
720 for (const EnumToString* end = table + count; table < end; ++table) {
721 if (table->value == value) {
722 return table->name;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| HashTable.h | 419 // When the hash table is empty, just return the same iterator for end as for begin.
421 // buckets, and iterating an empty table is a common case that's worth optimizing.
438 // in the table.
481 static void deleteAllBucketsAndDeallocate(ValueType* table, unsigned size);
614 const ValueType* table = m_table; local
615 if (!table)
626 const ValueType* entry = table + i;
655 ValueType* table = m_table; local
666 ValueType* entry = table + i;
697 ValueType* table = m_table local
766 ValueType* table = m_table; local
1113 HashTableType* table = reinterpret_cast<HashTableType*>(closure); local
[all...] |
| /external/chromium_org/third_party/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/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
| lp_bld_logic.c | 176 } table[] = { local
213 if (table[func].gt && !type.sign) {
219 if(table[func].swap) {
228 if(table[func].eq)
230 else if (table[func].gt)
235 if(table[func].not)
|
