/external/chromium_org/v8/test/cctest/ |
H A D | test-weakmaps.cc | 49 // Do not leak handles for the hash table, it would make entries strong. 52 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 1); local 53 weakmap->set_table(*table); 61 Handle<ObjectHashTable> table = ObjectHashTable::Put( local 62 Handle<ObjectHashTable>(ObjectHashTable::cast(weakmap->table())), 65 weakmap->set_table(*table); 107 CHECK_EQ(1, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 112 CHECK_EQ(1, ObjectHashTable::cast(weakmap->table())->NumberOfElements()); 114 0, ObjectHashTable::cast(weakmap->table())->NumberOfDeletedElements()); 131 CHECK_EQ(1, ObjectHashTable::cast(weakmap->table()) [all...] |
H A D | test-weaksets.cc | 49 // Do not leak handles for the hash table, it would make entries strong. 52 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 1); local 53 weakset->set_table(*table); 61 Handle<ObjectHashTable> table = ObjectHashTable::Put( local 62 Handle<ObjectHashTable>(ObjectHashTable::cast(weakset->table())), 65 weakset->set_table(*table); 107 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 112 CHECK_EQ(1, ObjectHashTable::cast(weakset->table())->NumberOfElements()); 114 0, ObjectHashTable::cast(weakset->table())->NumberOfDeletedElements()); 131 CHECK_EQ(1, ObjectHashTable::cast(weakset->table()) [all...] |
/external/clang/test/Analysis/ |
H A D | 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/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | CatchStructs.java | 47 * {@code null-ok;} the underlying table; set in 50 private CatchTable table; field in class:CatchStructs 77 this.table = null; 87 if (table == null) { 88 table = code.getCatches(); 99 return table.size(); 121 int size = table.size(); 130 handlerOffsets.put(table.get(i).getHandlers(), null); 200 int tableSize = table.size(); 202 CatchTable.Entry one = table [all...] |
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/table/ |
H A D | PropertyTooltipProvider.java | 11 package org.eclipse.wb.internal.core.model.property.table; 27 * @coverage core.model.property.table 97 PropertyTable table = m_site.getTable(); 98 // convert location from tooltip to table 101 p = table.toControl(p); 102 // send MouseDown to table 106 table.notifyListeners(SWT.MouseDown, newEvent);
|
/external/elfutils/0.153/libelf/ |
H A D | 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, me [all...] |
/external/freetype/src/gzip/ |
H A D | zutil.c | 75 local ptr_table table[MAX_PTR]; variable 76 /* This table is used to remember the original form of pointers 78 * Since MSDOS is not a preemptive multitasking OS, this table is not 98 table[next_ptr].org_ptr = buf; 103 table[next_ptr++].new_ptr = buf; 116 if (ptr != table[n].new_ptr) continue; 118 farfree(table[n].org_ptr); 120 table[n-1] = table[n];
|
/external/freetype/src/sfnt/ |
H A D | 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 ar 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/guava/guava/src/com/google/common/collect/ |
H A D | HashBasedTable.java | 46 * access this table concurrently and one of the threads modifies the table, it 96 * table. 98 * @param table the table to copy 100 * in {@code table} is null 103 Table<? extends R, ? extends C, ? extends V> table) { 105 result.putAll(table); 102 create( Table<? extends R, ? extends C, ? extends V> table) argument
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractTableReadTest.java | 36 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest 39 * Creates a table with the specified data. 41 * @param data the table data, repeating the sequence row key, column key, 51 assertEquals(expectedSize, table.size()); 56 table = create(); 60 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); 61 assertTrue(table.contains("foo", 1)); 62 assertTrue(table.contains("bar", 1)); 63 assertTrue(table.contains("foo", 3)); 64 assertFalse(table [all...] |
/external/harfbuzz_ng/src/ |
H A D | main.cc | 29 #include "hb-ot-layout-gdef-table.hh" 98 printf (" %d table(s) found in font\n", num_tables); 100 const OpenTypeTable &table = font.get_table (n_table); local 102 (const char *)table.tag, 103 (unsigned int) table.offset, 104 (unsigned int) table.length); 106 switch (table.tag) { 112 const GSUBGPOS &g = *CastP<GSUBGPOS> (font_data + table.offset); 115 printf (" %d script(s) found in table\n", num_scripts); 150 printf (" %d feature(s) found in table\ [all...] |
/external/icu/icu4c/source/common/ |
H A D | locresdata.cpp | 30 * Lookup a resource bundle table item with fallback on the table level. 33 * This function takes the name of a top-level table and of an item in that table 34 * and performs a lookup of both, falling back until a bundle contains a table 50 UResourceBundle *rb=NULL, table, subTable; local 74 ures_initStackObject(&table); 76 ures_getByKeyWithFallback(rb, tableKey, &table, &errorCode); 80 ures_getByKeyWithFallback(&table,subTableKey, &subTable, &errorCode); 88 ures_getByKeyWithFallback(&table,subTableKe [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | collationdata.cpp | 130 uint8_t table[256], UErrorCode &errorCode) const { 133 // Initialize the table. 137 table[lowByte] = lowByte; 143 table[highByte] = highByte; 149 table[i] = 0; 172 do { table[firstByte++] = lowByte++; } while(firstByte <= lastByte); 193 if(table[firstByte] != 0) { // Duplicate or equivalent script. 197 do { table[lastByte--] = highByte--; } while(firstByte <= lastByte); 212 if(table[firstByte] != 0) { // Duplicate or equivalent script. 216 do { table[firstByt 129 makeReorderTable(const int32_t *reorder, int32_t length, uint8_t table[256], UErrorCode &errorCode) const argument [all...] |
/external/jpeg/ |
H A D | 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...] |
H A D | rdswitch.c | 12 * -qslots N[,N,...] Set component quantization table selectors 81 * table 0 for luminance (or primary) components, 1 for chrominance components. 82 * You must use -qslots if you want a different component->table mapping. 88 unsigned int table[DCTSIZE2]; local 91 fprintf(stderr, "Can't open table file %s\n", filename); 96 while (read_text_integer(fp, &val, &termchar)) { /* read 1st element of table */ 102 table[0] = (unsigned int) val; 105 fprintf(stderr, "Invalid table data in file %s\n", filename); 109 table[i] = (unsigned int) val; 111 jpeg_add_quant_table(cinfo, tblno, table, scale_facto [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | map_to_7segment.h | 75 unsigned char table[128]; member in struct:seg7_conversion_map 80 return c >= 0 && c < sizeof(map->table) ? map->table[c] : -EINVAL; 84 struct seg7_conversion_map _name = { .table = { _map } } 94 * ASCII conversion table
|
/external/libcap-ng/libcap-ng-0.7/src/ |
H A D | lookup_table.c | 47 all strings referenced in the table and the table itself, which uses 76 static int capng_lookup_name(const struct transtab *table, argument 82 if (!strcasecmp(tabstr + table[i].offset, name)) 83 return table[i].value; 88 static const char *capng_lookup_number(const struct transtab *table, argument 95 if (table[i].value == number) 96 return tabstr + table[i].offset;
|
/external/libnl/lib/route/ |
H A D | route_utils.c | 20 * // libnl is only aware of the de facto standard routing table names. 25 * // Translating a table name to its idenfier 26 * int table = rtnl_route_str2table("main"); 31 * rtnl_route_table2str(table, buf, sizeof(buf))); 78 char *rtnl_route_table2str(int table, char *buf, size_t size) argument 80 return __list_type2str(table, buf, size, &table_names);
|
/external/libvterm/src/ |
H A D | unicode.c | 6 // moved 'combining' table to file scope, so other functions can see it 131 /* auxiliary function for binary search in interval table */ 132 static int bisearch(wchar_t ucs, const struct interval *table, int max) { argument 136 if (ucs < table[0].first || ucs > table[max].last) 140 if (ucs > table[mid].last) 142 else if (ucs < table[mid].first) 193 /* binary search in table of non-spacing characters */ 299 /* binary search in table of non-spacing characters */
|
/external/mesa3d/src/glx/ |
H A D | singlepix.c | 119 const _glapi_proc *const table = (_glapi_proc *) GET_DISPATCH(); local 121 (PFNGLGETSEPARABLEFILTEREXTPROC) table[359];
|
/external/mesa3d/src/mesa/swrast/ |
H A D | s_texfetch.c | 54 * Implemented with a 256-entry lookup table. 59 static GLfloat table[256]; local 62 /* compute lookup table now */ 67 table[i] = cs / 12.92f; 70 table[i] = (GLfloat) pow((cs + 0.055) / 1.055, 2.4); 75 return table[cs8]; 1122 /* check that the table entries are sorted by format name */
|
/external/pdfium/core/src/fxcodec/libjpeg/ |
H A D | fpdfapi_jdmaster.c | 211 * a (subscript-check-less) C table lookup
216 * These processes all use a common table prepared by the routine below.
219 * of x is within MAXJSAMPLE+1 of the legal range, so a table running from
232 * So the post-IDCT limiting table ends up looking like this:
237 * Negative inputs select values from the upper half of the table after
240 * We can save some space by overlapping the start of the post-IDCT table
241 * with the simpler range limiting table. The post-IDCT table begins at
244 * Note that the table is allocated in near data space on PCs; it's small
250 /* Allocate and fill in the sample_range_limit table */
252 JSAMPLE * table; local [all...] |
/external/pdfium/core/src/fxge/android/ |
H A D | fx_android_font.cpp | 53 FX_DWORD CFX_AndroidFontInfo::GetFontData(void* hFont, FX_DWORD table, FX_LPBYTE buffer, FX_DWORD size) argument 58 return ((IFPF_Font*)hFont)->GetFontData(table, buffer, size);
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/sfnt/ |
H A D | 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 ar 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/qemu/distrib/jpeg-6b/ |
H A D | 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...] |