/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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++)
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/ |
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++)
|
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)
|
H A D | m68k-slp-ice.c | 4 extern void (**table)(void); 14 table[code=(*(uw16*)(pc++))]();
|
/netbsd-6-1-5-RELEASE/external/ibm-public/postfix/dist/src/util/ |
H A D | nvtable.h | 26 #define nvtable_locate(table, key) htable_locate((table), (key)) 27 #define nvtable_walk(table, action, ptr) htable_walk((table), (action), (ptr)) 28 #define nvtable_list(table) htable_list(table) 29 #define nvtable_find(table, key) htable_find((table), (key)) 30 #define nvtable_delete(table, key) htable_delete((table), (ke [all...] |
H A D | htable.c | 7 /* hash table manager 22 /* HTABLE_INFO *htable_enter(table, key, value) 23 /* HTABLE *table; 27 /* char *htable_find(table, key) 28 /* HTABLE *table; 31 /* HTABLE_INFO *htable_locate(table, key) 32 /* HTABLE *table; 35 /* void htable_delete(table, key, free_fn) 36 /* HTABLE *table; 40 /* void htable_free(table, free_f 165 htable_size(HTABLE *table, unsigned size) argument 183 HTABLE *table; local 193 htable_grow(HTABLE *table) argument 214 htable_enter(HTABLE *table, const char *key, char *value) argument 229 htable_find(HTABLE *table, const char *key) argument 244 htable_locate(HTABLE *table, const char *key) argument 259 htable_delete(HTABLE *table, const char *key, void (*free_fn) (char *)) argument 289 htable_free(HTABLE *table, void (*free_fn) (char *)) argument 314 htable_walk(HTABLE *table, void (*action) (HTABLE_INFO *, char *), char *ptr) argument 329 htable_list(HTABLE *table) argument 350 htable_sequence(HTABLE *table, int how) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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++)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/sim/ppc/ |
H A D | gen-itable.h | 23 (insn_table *table, 27 (insn_table *table,
|
H A D | gen-model.h | 24 (insn_table *table, 29 (insn_table *table,
|
H A D | gen-support.h | 23 (insn_table *table, 27 (insn_table *table,
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/sim/igen/ |
H A D | gen-itable.h | 24 /* Output a table of all the instructions */ 26 extern void gen_itable_h (lf *file, insn_table *table); 28 extern void gen_itable_c (lf *file, insn_table *table);
|
H A D | gen-support.h | 23 extern void gen_support_h (lf *file, insn_table *table); 25 extern void gen_support_c (lf *file, insn_table *table);
|
/netbsd-6-1-5-RELEASE/distrib/utils/more/ |
H A D | position.c | 43 * Routines dealing with the "position" table. 44 * This is a table which tells the position (in the input file) of the 47 * {{ The position table is scrolled by moving all the entries. 48 * Would be better to have a circular table 58 static off_t *table; /* The position table */ variable 85 return (table[where]); 89 * Add a new file position to the bottom of the position table. 98 * Scroll the position table up. 101 table[ [all...] |
/netbsd-6-1-5-RELEASE/external/ibm-public/postfix/dist/src/global/ |
H A D | mail_conf_raw.c | 23 /* void get_mail_conf_raw_table(table) 24 /* const CONFIG_RAW_TABLE *table; 26 /* void get_mail_conf_raw_fn_table(table) 27 /* const CONFIG_RAW_TABLE *table; 44 /* lists of variables, as directed by their table arguments. A table 123 /* get_mail_conf_raw_table - look up table of strings */ 125 void get_mail_conf_raw_table(const CONFIG_RAW_TABLE *table) argument 127 while (table->name) { 128 if (table 138 get_mail_conf_raw_fn_table(const CONFIG_RAW_FN_TABLE *table) argument [all...] |
H A D | mail_conf_str.c | 27 /* void get_mail_conf_str_table(table) 28 /* const CONFIG_STR_TABLE *table; 30 /* void get_mail_conf_str_fn_table(table) 31 /* const CONFIG_STR_TABLE *table; 59 /* lists of variables, as directed by their table arguments. A table 168 /* get_mail_conf_str_table - look up table of strings */ 170 void get_mail_conf_str_table(const CONFIG_STR_TABLE *table) argument 172 while (table->name) { 173 if (table 183 get_mail_conf_str_fn_table(const CONFIG_STR_FN_TABLE *table) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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)
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/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)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.target/m68k/ |
H A D | slp-ice.c | 4 extern void (**table)(void); 14 table[code=(*(uw16*)(pc++))]();
|
/netbsd-6-1-5-RELEASE/sys/external/bsd/drm/dist/libdrm/ |
H A D | xf86drmHash.c | 1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping 31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for 35 * 1) The table is power-of-two sized. Prime sized tables are more 37 * sized table, especially when double hashing is not used for collision 40 * 2) The hash computation uses a table of random integers [Hanson97, 45 * With a table size of 512, the current implementation is sufficient for a 49 * naive) approach to dynamic hash table implementation simply creates a 50 * new hash table when necessary, rehashes all the data into the new table, 51 * and destroys the old table 159 HashTablePtr table; local 176 HashTablePtr table = (HashTablePtr)t; local 197 HashFind(HashTablePtr table, unsigned long key, unsigned long *h) argument 227 HashTablePtr table = (HashTablePtr)t; local 240 HashTablePtr table = (HashTablePtr)t; local 262 HashTablePtr table = (HashTablePtr)t; local 279 HashTablePtr table = (HashTablePtr)t; local 296 HashTablePtr table = (HashTablePtr)t; local 329 compute_dist(HashTablePtr table) argument 347 check_table(HashTablePtr table, unsigned long key, unsigned long value) argument 377 HashTablePtr table; local [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/roken/ |
H A D | rtbl.c | 71 rtbl_set_flags (rtbl_t table, unsigned int flags) argument 73 table->flags = flags; 77 rtbl_get_flags (rtbl_t table) argument 79 return table->flags; 83 rtbl_get_column_by_id (rtbl_t table, unsigned int id) argument 86 for(i = 0; i < table->num_columns; i++) 87 if(table->columns[i]->column_id == id) 88 return table->columns[i]; 93 rtbl_get_column (rtbl_t table, const char *column) argument 96 for(i = 0; i < table 103 rtbl_destroy(rtbl_t table) argument 125 rtbl_add_column_by_id(rtbl_t table, unsigned int id, const char *header, unsigned int flags) argument 154 rtbl_add_column(rtbl_t table, const char *header, unsigned int flags) argument 160 rtbl_new_row(rtbl_t table) argument 186 column_compute_width(rtbl_t table, struct column_data *column) argument 200 rtbl_set_prefix(rtbl_t table, const char *prefix) argument 211 rtbl_set_separator(rtbl_t table, const char *separator) argument 222 rtbl_set_column_prefix(rtbl_t table, const char *column, const char *prefix) argument 238 rtbl_set_column_affix_by_id(rtbl_t table, unsigned int id, const char *prefix, const char *suffix) argument 269 get_column_prefix(rtbl_t table, struct column_data *c) argument 281 get_column_suffix(rtbl_t table, struct column_data *c) argument 307 rtbl_add_column_entry_by_id(rtbl_t table, unsigned int id, const char *data) argument 318 rtbl_add_column_entryv_by_id(rtbl_t table, unsigned int id, const char *fmt, ...) argument 336 rtbl_add_column_entry(rtbl_t table, const char *column, const char *data) argument 347 rtbl_add_column_entryv(rtbl_t table, const char *column, const char *fmt, ...) argument 365 rtbl_format(rtbl_t table, FILE * f) argument 435 rtbl_t table; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/bfd/ |
H A D | hash.c | 1 /* hash.c -- hash table routines for BFD 34 BFD provides a simple set of hash table functions. Routines 35 are provided to initialize a hash table, to free a hash table, 36 to look up a string in a hash table and optionally create an 37 entry for it, and to traverse a hash table. There is 38 currently no routine to delete an string from a hash table. 40 The basic hash table does not permit any data to be stored 41 with a string. However, a hash table is designed to present a 45 rather than simply providing a data pointer in a hash table 360 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 396 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 409 bfd_hash_table_free(struct bfd_hash_table *table) argument 442 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument 487 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 552 bfd_hash_rename(struct bfd_hash_table *table, const char *string, struct bfd_hash_entry *ent) argument 577 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument 602 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument 616 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 629 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument 693 struct bfd_hash_table table; member in struct:bfd_strtab_hash 708 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 747 struct bfd_strtab_hash *table; local 787 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/bfd/ |
H A D | hash.c | 1 /* hash.c -- hash table routines for BFD 34 BFD provides a simple set of hash table functions. Routines 35 are provided to initialize a hash table, to free a hash table, 36 to look up a string in a hash table and optionally create an 37 entry for it, and to traverse a hash table. There is 38 currently no routine to delete an string from a hash table. 40 The basic hash table does not permit any data to be stored 41 with a string. However, a hash table is designed to present a 45 rather than simply providing a data pointer in a hash table 360 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 396 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 409 bfd_hash_table_free(struct bfd_hash_table *table) argument 442 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument 487 bfd_hash_insert(struct bfd_hash_table *table, const char *string, unsigned long hash) argument 552 bfd_hash_rename(struct bfd_hash_table *table, const char *string, struct bfd_hash_entry *ent) argument 577 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument 602 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument 616 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 629 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument 693 struct bfd_hash_table table; member in struct:bfd_strtab_hash 708 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 747 struct bfd_strtab_hash *table; local 787 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/preproc/tbl/ |
H A D | Makefile.sub | 7 table.$(OBJEXT) 10 $(srcdir)/table.cpp 12 $(srcdir)/table.h
|