| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 74 * is deleted from the table.
87 /** Internal structure of a hash table bucket, which tracks
101 /** Structure that tracks a hash table
105 /** Indicates whether the table allows duplicate keys
109 /** Number of buckets available in this table
118 /** How many elements currently exist in the table.
122 /** Whether the hash table should strdup the keys it is given or not.
126 /** Pointer to function to completely delete this table
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table);
131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, void * key)
161 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_HASH_ENUM_struct
184 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_LIST_struct
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 42 // Interface functions for hash table
47 static void antlr3HashDelete (pANTLR3_HASH_TABLE table, void * key);
48 static void * antlr3HashGet (pANTLR3_HASH_TABLE table, void * key);
49 static pANTLR3_HASH_ENTRY antlr3HashRemove (pANTLR3_HASH_TABLE table, void * key);
50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
54 static void antlr3HashDeleteI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
55 static void * antlr3HashGetI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
56 static pANTLR3_HASH_ENTRY antlr3HashRemoveI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
59 static void antlr3HashFree (pANTLR3_HASH_TABLE table);
131 pANTLR3_HASH_TABLE table; local
[all...] |
| /external/bison/src/ |
| tables.c | 121 /* TABLE_SIZE is the allocated size of both TABLE and CHECK. We start
125 base_number *table; variable
127 /* The value used in TABLE to denote explicit syntax errors
139 | If TABLE (and CHECK) appear to be small to be addressed at |
140 | DESIRED, grow them. Note that TABLE[DESIRED] is to be used, so |
153 fprintf (stderr, "growing table and check from: %d to %d\n",
156 table = xnrealloc (table, table_size, sizeof *table);
163 table[old_size] = 0
[all...] |
| /external/chromium/chrome/browser/ui/gtk/ |
| certificate_viewer.cc | 32 void AddTitle(GtkTable* table, int row, const std::string& text) {
33 gtk_table_attach_defaults(table,
39 void AddKeyValue(GtkTable* table, int row, const std::string& text,
42 table,
49 table,
211 GtkTable* table = GTK_TABLE(gtk_table_new(num_rows, 2, FALSE)); local
212 gtk_table_set_col_spacing(table, 0, gtk_util::kLabelSpacing);
213 gtk_table_set_row_spacings(table, gtk_util::kControlSpacing);
215 gtk_box_pack_start(GTK_BOX(general_page_vbox_), GTK_WIDGET(table),
220 AddTitle(table, row++
[all...] |
| /external/chromium/chrome/browser/visitedlink/ |
| visitedlink_unittest.cc | 48 virtual void NewTable(base::SharedMemory* table) {
49 if (table) {
53 table->ShareToProcess(base::GetCurrentProcessHandle(), &new_handle);
86 // freshly created table to be. 0 means use the default.
128 // check that the table has the proper number of entries
231 // Deleting the other four should leave the table empty.
240 "Hash table has values in it.";
292 // Clear the table and make sure the slave picked it up.
339 // Verify that the table got resized sufficiently.
341 VisitedLinkCommon::Fingerprint* table; local
[all...] |
| /external/chromium/net/disk_cache/ |
| disk_format.h | 13 // The index file is just a simple hash table that maps a particular entry to
92 int32 table_len; // Actual size of the table (0 == kIndexTablesize).
103 CacheAddr table[kIndexTablesize]; // Default size. Actual size controlled member in struct:disk_cache::Index
|
| /external/chromium/net/proxy/ |
| proxy_config_service_linux_unittest.cc | 85 #define ENTRY(x) table.settings[#x] = &values.x
110 const char* env_value = table.Get(variable_name);
134 SettingsTable<const char*> table; member in class:net::__anon5105::MockEnvironment
[all...] |
| /external/e2fsprogs/e2fsck/ |
| unix.c | 392 int table[32]; member in struct:percent_tbl
409 return ((percent * (tbl->table[pass] - tbl->table[pass-1]))
410 + tbl->table[pass-1]);
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 226 ft_mem_table_alloc( FT_MemTable table,
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table,
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
307 FT_MemTable table; local
683 FT_MemTable table = (FT_MemTable)memory->user; local
719 FT_MemTable table = (FT_MemTable)memory->user; local
745 FT_MemTable table = (FT_MemTable)memory->user; local
826 FT_MemTable table; local
889 FT_MemTable table = (FT_MemTable)memory->user; local
925 FT_MemTable table = (FT_MemTable)memory->user; local
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-font.cc | 36 #include "hb-ot-head-table.hh"
37 #include "hb-ot-maxp-table.hh"
598 const OT::OpenTypeTable &table = ot_face.get_table_by_tag (tag); local
600 hb_blob_t *blob = hb_blob_create_sub_blob (data->blob, table.offset, table.length);
|
| /external/icu4c/common/ |
| rbbitblb.cpp | 59 // table from the RBBI rules parse tree.
184 // Update the global table of rule status {tag} values
186 // for all tables. Merge the ones from this table into the global set.
224 // Apply functions from table 3.40 in Aho
268 // Apply functions from table 3.40 in Aho
314 // Apply functions from table 3.40 in Aho
808 for (n=0; n<fDStates->size(); n++) { // For each state s (row in the state table)
824 // Update the global table of rule status {tag} values
826 // for all tables. Merge the ones from this table into the global set.
833 // for each state in this state table
1093 RBBIStateTable *table = (RBBIStateTable *)where; local
[all...] |
| /external/icu4c/test/cintltst/ |
| udatatst.c | 832 const int32_t *table=NULL; local
853 table=(const int32_t *)udata_getMemory(result);
855 /* The alias table may list more converters than what's actually available now. [grhoten] */
856 if(ucnv_countAvailable() > table[1]) /*???*/
857 log_err("FAIL: udata_getMemory() failed ucnv_countAvailable returned = %d, expected = %d\n", ucnv_countAvailable(), table[1+2*(*table)]);
[all...] |
| /external/iproute2/ip/ |
| iproute.c | 60 fprintf(stderr, " [ table TABLE_ID ] [ proto RTPROTO ]\n");
64 fprintf(stderr, " [ table TABLE_ID ] [ proto RTPROTO ]\n");
131 __u32 table; local
158 table = rtm_get_table(r, tb);
160 if (r->rtm_family == AF_INET6 && table != RT_TABLE_MAIN)
179 if (filter.tb > 0 && filter.tb != table)
353 if (table != RT_TABLE_MAIN && !filter.tb)
354 fprintf(fp, " table %s ", rtnl_rttable_n2a(table, b1, sizeof(b1)));
890 } else if (matches(*argv, "table") == 0)
[all...] |
| /external/opencv/otherlibs/highgui/ |
| bitstrm.cpp | 443 int RLBitStream::GetHuff( const short* table )
450 int table_bits = table[0];
451 val = table[Show(table_bits) + 2];
456 table += val*2;
545 int RMBitStream::GetHuff( const short* table )
552 int table_bits = table[0];
553 val = table[Show(table_bits) + 1];
558 table += val;
589 bool bsCreateDecodeHuffmanTable( const int* src, short* table, int max_size )
619 /* calc offsets of sub tables and whole size of table */
690 int* table = dst; local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| SDL_video.c | 375 int table, b, i; local
391 table = ((bpp+7)/8)-1;
392 SDL_closest_depths[table][0] = bpp;
393 SDL_closest_depths[table][7] = 0;
394 for ( b = 0; !supported && SDL_closest_depths[table][b]; ++b ) {
395 format.BitsPerPixel = SDL_closest_depths[table][b];
423 return(SDL_closest_depths[table][b]);
434 int table, b, i; local
463 table = ((*BitsPerPixel+7)/8)-1;
464 SDL_closest_depths[table][0] = *BitsPerPixel
[all...] |
| /external/quake/quake/src/QW/client/ |
| gl_vidlinux.c | 218 unsigned *table; local
230 table = d_8to24table;
241 *table++ = v;
534 GLubyte table[256][4]; local
544 table[i][2] = *oldpal++;
545 table[i][1] = *oldpal++;
546 table[i][0] = *oldpal++;
547 table[i][3] = 255;
550 gl3DfxSetPaletteEXT((GLuint *)table);
|
| gl_vidlinux_svga.c | 250 unsigned *table; local
260 table = d_8to24table;
271 *table++ = v;
572 GLubyte table[256][4]; local
582 table[i][2] = *oldpal++;
583 table[i][1] = *oldpal++;
584 table[i][0] = *oldpal++;
585 table[i][3] = 255;
588 gl3DfxSetPaletteEXT((GLuint *)table);
|
| gl_vidlinux_x11.c | 444 unsigned *table; local
454 table = d_8to24table;
465 *table++ = v;
617 GLubyte table[256][4]; local
627 table[i][2] = *oldpal++;
628 table[i][1] = *oldpal++;
629 table[i][0] = *oldpal++;
630 table[i][3] = 255;
633 gl3DfxSetPaletteEXT((GLuint *)table);
|
| gl_vidlinuxglx.c | 390 unsigned *table; local
402 table = d_8to24table;
413 *table++ = v;
565 GLubyte table[256][4]; local
575 table[i][2] = *oldpal++;
576 table[i][1] = *oldpal++;
577 table[i][0] = *oldpal++;
578 table[i][3] = 255;
581 gl3DfxSetPaletteEXT((GLuint *)table);
|
| /external/quake/quake/src/WinQuake/ |
| gl_vidlinux.cpp | 222 unsigned *table; local
232 table = d_8to24table;
241 *table++ = v;
540 GLubyte table[256][4]; local
547 table[i][2] = *oldpal++;
548 table[i][1] = *oldpal++;
549 table[i][0] = *oldpal++;
550 table[i][3] = 255;
553 qgl3DfxSetPaletteEXT((GLuint *)table);
|
| /external/skia/src/effects/ |
| SkDisplacementMapEffect.cpp | 29 SkColor l, const SkUnPreMultiply::Scale* table) {
30 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedR32(l));
34 SkColor l, const SkUnPreMultiply::Scale* table) {
35 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedG32(l));
39 SkColor l, const SkUnPreMultiply::Scale* table) {
40 return SkUnPreMultiply::ApplyScale(table[SkGetPackedA32(l)], SkGetPackedB32(l));
60 const SkUnPreMultiply::Scale* table = SkUnPreMultiply::GetScaleTable(); local
66 SkScalarMul(scaleX, SkIntToScalar(getValue<typeX>(*displPtr, table))-Half8bit);
68 SkScalarMul(scaleY, SkIntToScalar(getValue<typeY>(*displPtr, table))-Half8bit);
|
| /external/skia/src/images/ |
| SkImageDecoder_libpng.cpp | 833 hasAlpha = false; // we store false in the table entries for kIndex8
905 const SkUnPreMultiply::Scale* SK_RESTRICT table = local
[all...] |
| /external/tcpdump/ |
| addrtoname.c | 691 register struct hnamemem *table; local
699 table = &tporttable[i];
701 table = &uporttable[i];
705 while (table->name)
706 table = table->nxt;
709 table->name = strdup(buf);
711 table->name = strdup(sv->s_name);
712 table->addr = port;
713 table->nxt = newhnamemem()
733 register struct hnamemem *table; local
1081 register struct hnamemem *table; local
[all...] |
| print-radius.c | 585 static const char **table; local
587 table = attr_type[attr_code].subtypes;
605 printf("%s",table[data_value]);
[all...] |
| /external/valgrind/main/VEX/test/ |
| test-i386.c | 1086 char table[256]; local
1091 for(i=0;i<256;i++) table[i] = 256 - i;
1093 asm ("xlat" : "=a" (res) : "b" (table), "0" (res));
[all...] |
