| /src/external/ibm-public/postfix/dist/src/util/ |
| nvtable.h | 26 #define nvtable_locate(table, key) htable_locate((table), (key))
27 #define nvtable_walk(table, action, ptr) htable_walk((table), HTABLE_ACTION_FN_CAST(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), (key), myfree
[all...] |
| /src/external/gpl3/gdb/dist/sim/ppc/ |
| gen-itable.h | 22 (insn_table *table,
26 (insn_table *table,
|
| gen-model.h | 23 (insn_table *table,
28 (insn_table *table,
|
| gen-support.h | 22 (insn_table *table,
26 (insn_table *table,
|
| /src/external/gpl3/gdb.old/dist/sim/ppc/ |
| gen-itable.h | 22 (insn_table *table,
26 (insn_table *table,
|
| gen-model.h | 23 (insn_table *table,
28 (insn_table *table,
|
| gen-support.h | 22 (insn_table *table,
26 (insn_table *table,
|
| /src/distrib/utils/more/ |
| 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[i-1] = table[i]
[all...] |
| /src/external/ibm-public/postfix/dist/src/global/ |
| 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)
127 while (table->name) {
128 if (table->target[0]
[all...] |
| 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;
65 /* lists of variables, as directed by their table arguments. A table
177 /* get_mail_conf_str_table - look up table of strings */
179 void get_mail_conf_str_table(const CONFIG_STR_TABLE *table)
181 while (table->name) {
182 if (table->target[0]
[all...] |
| /src/external/gpl3/gcc/dist/gcc/text-art/ |
| table.cc | 31 #include "text-art/table.h"
58 /* class text_art::table::cell_placement. */
61 table::cell_placement::paint_cell_contents_to_canvas(canvas &canvas,
71 const table::coord_t table_top_left = m_rect.m_top_left;
113 /* class text_art::table. */
116 table::table (size_t size) function in class:table
125 table::set_cell (coord_t coord,
130 set_cell_span (rect_t (coord, table::size_t (1, 1)),
135 table::set_cell_span (rect_t span
693 table table = make_text_table (); local
725 table table = make_text_table (); local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/dwarf2/ |
| abbrev-table-cache.c | 1 /* DWARF 2 abbrev table cache
20 #include "dwarf2/abbrev-table-cache.h"
23 abbrev_table_cache::add (abbrev_table_up table)
26 if (table == nullptr)
29 bool inserted = m_tables.emplace (std::move (table)).second;
|
| /src/external/gpl3/gdb/dist/gdb/dwarf2/ |
| abbrev-table-cache.c | 1 /* DWARF 2 abbrev table cache
20 #include "dwarf2/abbrev-table-cache.h"
23 abbrev_table_cache::add (abbrev_table_up table)
26 if (table == nullptr)
29 bool inserted = m_tables.emplace (std::move (table)).second;
|
| /src/external/gpl3/gdb.old/dist/sim/igen/ |
| gen-itable.h | 25 /* Output a table of all the instructions */
27 extern void gen_itable_h (lf *file, const insn_table *table);
29 extern void gen_itable_c (lf *file, const insn_table *table);
|
| gen-model.c | 25 #include "table.h"
36 gen_model_h (lf *file, const insn_table *table)
43 gen_model_c (lf *file, const insn_table *table)
|
| gen-support.h | 25 extern void gen_support_h (lf *file, const insn_table *table);
27 extern void gen_support_c (lf *file, const insn_table *table);
|
| /src/external/gpl3/gdb/dist/sim/igen/ |
| gen-itable.h | 25 /* Output a table of all the instructions */
27 extern void gen_itable_h (lf *file, const insn_table *table);
29 extern void gen_itable_c (lf *file, const insn_table *table);
|
| gen-model.c | 25 #include "table.h"
36 gen_model_h (lf *file, const insn_table *table)
43 gen_model_c (lf *file, const insn_table *table)
|
| gen-support.h | 25 extern void gen_support_h (lf *file, const insn_table *table);
27 extern void gen_support_c (lf *file, const insn_table *table);
|
| /src/external/mit/isl/dist/ |
| isl_hash.c | 42 int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table,
47 if (!table)
52 table->bits = ffs(round_up(4 * (min_size + 1) / 3 - 1)) - 1;
53 table->n = 0;
55 size = 1 << table->bits;
56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
58 if (!table->entries)
71 /* Extend "table" to twice its size.
74 * We reuse isl_hash_table_find to create entries in the extended table.
75 * Since all entries in the original table are assumed to be different
125 struct isl_hash_table *table = NULL; local
[all...] |
| /src/external/bsd/unbound/dist/util/storage/ |
| lruhash.c | 67 struct lruhash* table = (struct lruhash*)calloc(1, local
69 if(!table)
71 lock_quick_init(&table->lock);
72 table->sizefunc = sizefunc;
73 table->compfunc = compfunc;
74 table->delkeyfunc = delkeyfunc;
75 table->deldatafunc = deldatafunc;
76 table->cb_arg = arg;
77 table->size = start_size;
78 table->size_mask = (int)(start_size-1)
[all...] |
| slabhash.h | 39 * Hash table that consists of smaller hash tables.
52 * Hash table formed from several smaller ones.
53 * This results in a partitioned lruhash table, a 'slashtable'.
69 * Create new slabbed hash table.
73 * @param maxmem: maximum amount of memory this table is allowed to use.
74 * so every table gets maxmem/numtables to use for itself.
80 * @return: new hash table or NULL on malloc failure.
88 * Delete hash table. Entries are all deleted.
89 * @param table: to delete.
91 void slabhash_delete(struct slabhash* table);
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/ |
| renoir_ppt.h | 35 #define GET_DPM_CUR_FREQ(table, clk_type, dpm_level, freq) \
39 freq = table->SocClocks[dpm_level].Freq; \
42 freq = table->MemClocks[dpm_level].Freq; \
45 freq = table->DcfClocks[dpm_level].Freq; \
48 freq = table->FClocks[dpm_level].Freq; \
|
| /src/external/bsd/unbound/dist/testcode/ |
| unitslabhash.c | 2 * testcode/unitslabhash.c - unit test for slabhash table.
38 * Tests the locking LRU keeping hash table implementation.
83 test_short_table(struct slabhash* table)
93 slabhash_insert(table, myhash(12), &k->entry, d, NULL);
94 slabhash_insert(table, myhash(14), &k2->entry, d2, NULL);
96 unit_assert( slabhash_lookup(table, myhash(12), k, 0) == &k->entry);
98 unit_assert( slabhash_lookup(table, myhash(14), k2, 0) == &k2->entry);
100 slabhash_remove(table, myhash(12), k);
101 slabhash_remove(table, myhash(14), k2);
109 testadd(struct slabhash* table, testdata_type* ref[]
306 struct slabhash* table; member in struct:slab_test_thr
363 struct slabhash* table; local
[all...] |
| /src/external/gpl3/binutils/dist/bfd/ |
| 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
877 struct bfd_hash_table table; member in struct:bfd_strtab_hash
941 struct bfd_strtab_hash *table; local
[all...] |
