/haiku-buildtools/gcc/gcc/testsuite/gcc.target/s390/ |
H A D | 20041109-1.c | 6 static struct table { int x; } table[3]; variable in typeref:struct:table 10 struct table *t; 12 for (t = table; t < &table[3]; t++) 15 for (t = table; t < &table[3]; t++)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/init/ |
H A D | array34.C | 13 Class table [10] = {}; local
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/lto/ |
H A D | 20090717_0.c | 4 struct variable table[] = { }; variable in typeref:struct:variable
|
H A D | 20090717_1.c | 4 extern struct variable table[]; 8 for(p = table; p->string; p++)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr26719.c | 7 int table[32][256]; variable 15 table[i][j] = ((signed char)j) * i; 17 if (table[9][132] != -1116)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20040326-1.c | 12 int table, c, elt; local 13 int tem = Faref (table, elt); 14 Faset (table, elt, c); 15 Faset (table, c, tem);/* tem cannot be replaced with Faref (table, elt) */ 21 int __attribute__ ((noinline)) Faref (table, elt) 27 int __attribute__ ((noinline)) Faset (table, elt, c)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/m68k/ |
H A D | slp-ice.c | 4 extern void (**table)(void); 14 table[code=(*(uw16*)(pc++))]();
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr51495.c | 10 static const void *const table[] = { &&begin, &&end }; local 11 goto *(table[i]);
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | hash.c | 1 /* hash.c -- hash table routines 32 /* The default number of entries to use when creating a hash table. */ 35 /* Create a new hash table, given a number of entries. */ 38 hash_table_init_n (table, newfunc, hash, comp, size) 39 struct hash_table *table; 50 if (!obstack_begin (&table->memory, alloc)) 55 table->table = ((struct hash_entry **) 56 obstack_alloc (&table->memory, alloc)); 57 if (!table [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | c_f_pointer_tests_4.f90 | 5 integer, dimension(2,1,2), target :: table variable in program:main 6 table = reshape ( (/ 1,2,-1,-2/), (/2,1,2/)) 7 call set_table (c_loc (table)) 13 if (any(table_tmp /= table)) call abort
|
H A D | realloc_on_assign_17.f90 | 11 type table type in module:mytypes 13 end type table 20 type(table) x1(2) 21 type(table) x2(3) 22 type(table), allocatable :: x(:) 40 x1 = [table([(label([(j,j=1,3)]),i=1,3)]), & 41 table([(label([(j,j=1,4)]),i=1,4)])] 43 x2 = [table([(label([(j,j=1,4)]),i=1,4)]), & 44 table([(label([(j,j=1,5)]),i=1,5)]), & 45 table([(labe [all...] |
H A D | aliasing_dummy_1.f90 | 23 type(list) :: table variable in program:test_lex 26 table%list = (/dtype (1 , "one "), dtype (2 , "two "), dtype (3 , "three"), dtype (4 , "four ")/) 29 call bar (table, 2, 4) 30 if (any (table%list%word.ne.(/"one ","i= 2","three","i= 4"/))) call abort () 32 elist = reshape (table%list, (/2,2/)) 41 subroutine bar (table, n, m) 42 type(list) :: table local in subroutine:bar 44 call foo1 (table%list(:table%l)%word, n) 45 call foo2 (table [all...] |
/haiku-buildtools/isl/ |
H A D | isl_hash.c | 43 int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table, argument 48 if (!table) 53 table->bits = ffs(round_up(4 * (min_size + 1) / 3 - 1)) - 1; 54 table->n = 0; 56 size = 1 << table->bits; 57 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, 59 if (!table->entries) 72 /* Extend "table" to twice its size. 75 * We reuse isl_hash_table_find to create entries in the extended table. 76 * Since all entries in the original table ar 79 grow_table(struct isl_ctx *ctx, struct isl_hash_table *table) argument 126 struct isl_hash_table *table = NULL; local 137 isl_hash_table_clear(struct isl_hash_table *table) argument 144 isl_hash_table_free(struct isl_ctx *ctx, struct isl_hash_table *table) argument 152 isl_hash_table_find(struct isl_ctx *ctx, struct isl_hash_table *table, uint32_t key_hash, int (*eq)(const void *entry, const void *val), const void *val, int reserve) argument 183 isl_hash_table_foreach(struct isl_ctx *ctx, struct isl_hash_table *table, int (*fn)(void **entry, void *user), void *user) argument 199 isl_hash_table_remove(struct isl_ctx *ctx, struct isl_hash_table *table, struct isl_hash_table_entry *entry) argument [all...] |
/haiku-buildtools/binutils/bfd/ |
H A D | hash.c | 1 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash table is designed to present a 44 rather than simply providing a data pointer in a hash table 368 bfd_hash_table_init_n(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize, unsigned int size) argument 411 bfd_hash_table_init(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize) argument 424 bfd_hash_table_free(struct bfd_hash_table *table) argument 457 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument 502 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 567 bfd_hash_rename(struct bfd_hash_table *table, const char *string, struct bfd_hash_entry *ent) argument 592 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument 617 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument 631 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 644 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument 709 struct bfd_hash_table table; member in struct:bfd_strtab_hash 724 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 763 struct bfd_strtab_hash *table; local 803 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | constexpr-array7.C | 10 constexpr X table[1][1] = {{ {} }}; variable 13 SA(table[0][0].a.i == 1);
|
H A D | constexpr-array8.C | 9 constexpr X table[2][2] = {{ {} }}; variable 12 SA(table[1][1].a.i == 1); 16 const int *p = &table[1][1].a.j;
|
H A D | constexpr-array9.C | 9 constexpr X table[2][2] = {{ {} }}; variable 12 SA(table[1][1].a.i == 0); 16 const int *p = &table[1][1].a.j;
|
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | hash.c | 1 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash table is designed to present a 44 rather than simply providing a data pointer in a hash table 307 bfd_hash_table_init_n(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize, unsigned int size) argument 340 bfd_hash_table_init(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize) argument 353 bfd_hash_table_free(struct bfd_hash_table *table) argument 362 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument 426 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument 451 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument 465 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 477 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument 538 struct bfd_hash_table table; member in struct:bfd_strtab_hash 553 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 591 struct bfd_strtab_hash *table; local 631 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument [all...] |
/haiku-buildtools/gcc/libcpp/ |
H A D | symtab.c | 59 cpp_hash_table *table; local 61 table = XCNEW (cpp_hash_table); 64 obstack_specify_allocation (&table->stack, 0, 0, xmalloc, free); 66 obstack_alignment_mask (&table->stack) = 0; 68 table->entries = XCNEWVEC (hashnode, nslots); 69 table->entries_owned = true; 70 table->nslots = nslots; 71 return table; 74 /* Frees all memory associated with a hash table. */ 77 ht_destroy (cpp_hash_table *table) argument 91 ht_lookup(cpp_hash_table *table, const unsigned char *str, size_t len, enum ht_lookup_option insert) argument 99 ht_lookup_with_hash(cpp_hash_table *table, const unsigned char *str, size_t len, unsigned int hash, enum ht_lookup_option insert) argument 182 ht_expand(cpp_hash_table *table) argument 224 ht_forall(cpp_hash_table *table, ht_cb cb, const void *v) argument 242 ht_purge(cpp_hash_table *table, ht_cb cb, const void *v) argument 274 ht_dump_statistics(cpp_hash_table *table) argument [all...] |
/haiku-buildtools/binutils/ld/testsuite/ld-m68hc11/ |
H A D | bug-1417.s | 7 tst table 12 ldx #table ; Instruction removed 13 bset 0,x #4 ; Changed to bset *table #4 20 .globl table 21 table: .long 0 label
|
/haiku-buildtools/legacy/binutils/ld/testsuite/ld-m68hc11/ |
H A D | bug-1417.s | 7 tst table 12 ldx #table ; Instruction removed 13 bset 0,x #4 ; Changed to bset *table #4 20 .globl table 21 table: .long 0 label
|
/haiku-buildtools/binutils/gas/ |
H A D | hash.c | 1 /* hash.c -- gas hash table code 21 /* This version of the hash table code is a wholescale replacement of 22 the old hash table code, which was fairly bad. This is based on 23 the hash table code in BFD, but optimized slightly for the 25 are stored in the hash table. Instead, it always stores a pointer. 26 The assembler uses the hash table mostly to store symbols, and we 27 don't need to confuse the symbol structure with a hash table 34 /* An entry in a hash table. */ 42 table. */ 44 /* Pointer being stored in the hash table 52 struct hash_entry **table; member in struct:hash_control 118 hash_die(struct hash_control *table) argument 134 hash_lookup(struct hash_control *table, const char *key, size_t len, struct hash_entry ***plist, unsigned long *phash) argument 206 hash_insert(struct hash_control *table, const char *key, void *val) argument 236 hash_jam(struct hash_control *table, const char *key, void *val) argument 274 hash_replace(struct hash_control *table, const char *key, void *value) argument 298 hash_find(struct hash_control *table, const char *key) argument 313 hash_find_n(struct hash_control *table, const char *key, size_t len) argument 328 hash_delete(struct hash_control *table, const char *key, int freeme) argument 356 hash_traverse(struct hash_control *table, void (*pfn) (const char *key, void *value)) argument [all...] |
/haiku-buildtools/binutils/gas/testsuite/gas/m68k/ |
H A D | p2663.s | 5 jsr table(%pc,%d7.w) | wrong 6 jsr %pc@(table-.-2:b,%d7:w) | correct but cryptic 9 table: label
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/m68k/ |
H A D | p2663.s | 5 jsr table(%pc,%d7.w) | wrong 6 jsr %pc@(table-.-2:b,%d7:w) | correct but cryptic 9 table: label
|
/haiku-buildtools/binutils/gas/testsuite/gas/mach-o/ |
H A D | dysymtab-1-64.d | 10 table of content: off: 0x00000000 num: 0.*\(endoff: 0x00000000\) 11 module table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\) 12 external reference table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\) 13 indirect symbol table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\) 14 external relocation table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\) 15 local relocation table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
|