| /onnv/onnv-gate/usr/src/cmd/ipf/examples/ |
| pool.conf | 5 table role = ipf type = tree number = 0
|
| /onnv/onnv-gate/usr/src/lib/libnisdb/ |
| nis_hashitem.c | 47 * The hash table routines below implement nested (or recursive)
63 __nis_init_hash_table(__nis_hash_table_mt *table,
68 if (table != 0) {
69 errorcode = pthread_mutex_init(&table->lock, 0);
72 "(table->lock) pthread_mutex_init returned %d (%s)",
76 errorcode = pthread_cond_init(&table->cond, 0);
79 "(table->cond) pthread_cond_init returned %d (%s)",
83 errorcode = pthread_mutex_init(&table->traverser_id_lock, 0);
86 "(table->traverser_id_lock) "
91 table->traversed = 0
[all...] |
| /onnv/onnv-gate/usr/src/lib/fm/libfmd_snmp/common/ |
| init.c | 53 const sunFm_table_t *table; local
55 for (table = sun_fm_tables; table->t_name != NULL; table++) {
56 int err = table->t_init();
60 DEBUGMSGTL((MODNAME_STR, "registered table %s\n",
61 table->t_name));
65 ": table %s initialization failed: duplicate "
66 "registration\n", table->t_name);
70 ": table %s initialization failed: agent
[all...] |
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sadm/dhcpmgr/com/sun/dhcpmgr/server/ |
| ResourceBundle.properties | 29 hosts_access_err=Error accessing host table
30 hosts_open_err=Error opening host table
31 hosts_close_err=Error closing host table
32 hosts_add_err=Error adding entry to hosts table
33 hosts_remove_err=Error removing entry from hosts table
34 hosts_modify_err=Error modifying hosts table table entry
|
| /onnv/onnv-gate/usr/src/cmd/spell/ |
| hash.h | 32 #define ND ((25750/2) * sizeof (*table))
35 extern unsigned *table;
36 extern int index[]; /* into dif table based on hi hash bits */
|
| hashcheck.c | 42 unsigned *table; variable
59 y |= (long)table[tp++] << empty;
62 y |= table[tp]>>i-empty;
91 table = (unsigned *)malloc(hindex[NI-1]*sizeof (*table));
92 (void) fread((char *)table, sizeof (*table), hindex[NI-1], stdin);
|
| /onnv/onnv-gate/usr/src/uts/common/ipp/ipgpc/ |
| ba_table.c | 32 /* Implementation file for behavior aggregate (BA) lookup table */
37 * inserts filter_id into element list of bataid->table->masked_values
40 * bataid->table->masked_values[val], an error message is printed if this
48 ba_table_t *table = &bataid->table; local
60 if (ipgpc_list_insert(&table->masked_values[mskd_val].filter_list,
66 (void) ipgpc_list_insert(&table->masks, mask);
68 ++table->masked_values[mskd_val].info;
77 * searches for all filters matching value in bataid->table
78 * search is performed by appling each mask in bataid->table->masks lis
91 ba_table_t *table = &bataid->table; local
134 ba_table_t *table = &bataid->table; local
[all...] |
| table.c | 31 /* table structure used for exact-match classification of selectors */
52 * inserts id into table with filter_id as the value
62 hash_table table = taid->table; local
75 if (((table[x].key == key) && (table[x].info == 1)) ||
76 (table[x].info == 0)) {
77 table[x].key = key;
78 table[x].info = 1;
79 (void) ipgpc_list_insert(&table[x].elements, id)
159 hash_table table = taid->table; local
200 hash_table table = taid->table; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/tbl/ |
| t9.c | 26 for(useln=0; useln<MAXLIN && table[useln]==0; useln++);
28 error(gettext("Weird. No data in table."));
29 table[0]=table[useln];
32 error(gettext("Weird. No real lines in table."));
61 table[0][icol].col = dataln;
62 table[0][icol].rcol=0;
69 table[0][icol].rcol = maknew(table[0][icol].col);
72 table[0][icol].rcol = table[0][icol].col
[all...] |
| t5.c | 17 /* t5.c: read data for table */
63 table[nlin] = (struct colstr *) alocv((ncol+2)*sizeof(table[0][0]));
74 table[nlin][icol].col = cstore;
75 table[nlin][icol].rcol=0;
79 table[nlin][icol].col =
91 table[nlin][icol].rcol =
92 (char *)maknew(table[nlin][icol].col);
95 table[nlin][icol].rcol = table[nlin][icol].col
[all...] |
| /onnv/onnv-gate/usr/src/cmd/nscd/ |
| nscd_biggest.c | 48 insertn(nsc_keephot_t *table, uint_t n, void *data)
53 if (n < 1 || table[1].num > n) {
57 size = table[0].num;
58 if (table[size].num < n) /* biggest so far */
65 if (table[guess].num == n)
67 if (table[guess].num > n)
76 olddata = table[1].ptr;
77 (void) memmove(table + 1, table + 2,
79 table[guess].ptr = data
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/fs/nfs/ |
| nfs4_db.c | 173 rfs4_table_t *table = private; local
197 * Each table will be marked as "shutdown" and the reaper threads
205 rfs4_table_t *table; local
208 for (table = db->db_tables; table; table = table->dbt_tnext) {
209 table->dbt_reaper_shutdown = TRUE;
210 mutex_enter(&table->dbt_reaper_cv_lock);
211 cv_broadcast(&table->dbt_reaper_wait)
249 rfs4_table_t *table; local
411 rfs4_table_t *table = entry->dbe_table; local
509 rfs4_table_t *table = idx->dbi_table; local
639 rfs4_table_t *table = rfs4_client_tab; local
806 rfs4_table_t *table = (rfs4_table_t *)arg; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnsl/nis/gen/ |
| nis_hash.c | 35 * it hashes into a fixed size hash table of 64 entries. Collisions
39 * 1024 members which hash down to about 8 entries per table. With a
42 * The hash table is augmented by a doubly linked list which points to
65 * find_item(name, table) -- finds the item called <name> in <table>, or
71 find_item(nis_name name, NIS_HASH_TABLE *table, int *keyp)
78 /* At this level we assume name, table != 0 */
83 key %= (sizeof (table->keys) / sizeof (table->keys[0]));
88 for (pp = &table->keys[key]; (it = *pp) != 0; pp = &it->next)
[all...] |
| /onnv/onnv-gate/usr/src/cmd/krb5/kadmin/gui/visualrt/sunsoft/jws/visual/rt/type/ |
| InsetsConverter.java | 75 private int getIntegerFromTable(Hashtable table, String key) {
76 String value = (String) table.get(key);
104 Hashtable table = sft.getHashtable(); local
107 Enumeration e = table.keys();
121 if (table.containsKey(/* NOI18N */"top"))
122 insets.top = getIntegerFromTable(table,
124 if (table.containsKey(/* NOI18N */"left"))
125 insets.left = getIntegerFromTable(table,
127 if (table.containsKey(/* NOI18N */"bottom"))
128 insets.bottom = getIntegerFromTable(table,
[all...] |
| DimensionConverter.java | 67 Hashtable table = sft.getHashtable(); local
70 Enumeration e = table.keys();
85 if (table.containsKey(/* NOI18N */"width"))
86 d.width = getIntegerFromTable(table, /* NOI18N */"width");
87 if (table.containsKey(/* NOI18N */"height"))
88 d.height = getIntegerFromTable(table, /* NOI18N */"height");
93 private int getIntegerFromTable(Hashtable table, String key) {
94 String value = (String) table.get(key);
|
| PointConverter.java | 70 Hashtable table = sft.getHashtable(); local
73 Enumeration e = table.keys();
84 if (table.containsKey(/* NOI18N */"x"))
85 p.x = getIntegerFromTable(table, /* NOI18N */"x");
86 if (table.containsKey(/* NOI18N */"y"))
87 p.y = getIntegerFromTable(table, /* NOI18N */"y");
92 private int getIntegerFromTable(Hashtable table, String key) {
93 String value = (String) table.get(key);
|
| GBConstraintsConverter.java | 207 private int getIntegerFromTable(Hashtable table, String key) {
208 String value = (String) table.get(key);
215 private boolean getBooleanFromTable(Hashtable table, String key) {
216 String value = (String) table.get(key);
223 private double getDoubleFromTable(Hashtable table, String key) {
224 String value = (String) table.get(key);
231 private int getConstantFromTable(Hashtable table, String key) {
232 String value = (String) table.get(key);
247 Hashtable table = sft.getHashtable(); local
250 if (table.containsKey(/* NOI18N */"x"))
[all...] |
| /onnv/onnv-gate/usr/src/lib/krb5/ss/ |
| invocation.c | 27 register ss_data **table; local
30 table = _ss_table;
33 if (table == (ss_data **) NULL) {
34 table = (ss_data **) malloc(2 * size);
35 table[0] = table[1] = (ss_data *)NULL;
38 for (sci_idx = 1; table[sci_idx] != (ss_data *)NULL; sci_idx++)
40 table = (ss_data **) realloc((char *)table,
42 table[sci_idx+1] = (ss_data *) NULL
[all...] |
| /onnv/onnv-gate/usr/src/cmd/agents/snmp/snmprelayd/conf/ |
| dispatcher.conf | 77 table = applTable
82 table = applTable
87 table = assocTable
92 table = mtaTable
97 table = mtaTable
111 table = applTable
116 table = assocTable
121 table = mtaTable
|
| /onnv/onnv-gate/usr/src/uts/i86pc/boot/ |
| boot_mmu.c | 57 * Return the index corresponding to a virt address at a given page table level.
66 * Return a pointer to the page table entry that maps a virtual address.
67 * If there is no page table and probe_only is not set, one is created.
74 paddr_t table; local
87 table = top_page_table;
93 pteval = get_pteval(table, index);
99 table = ma_to_pa(pteval & MMU_PAGEMASK);
100 if (table == -1) {
112 set_pteval(table, index, l, pteval);
114 table = new_table
[all...] |
| /onnv/onnv-gate/usr/src/lib/gss_mechs/mech_krb5/et/ |
| error_table.h | 18 /*@dependent@*//*@null@*/ const struct error_table *table; member in struct:et_list
23 /*@dependent@*/ const struct error_table *table; member in struct:dynamic_et_list
26 #define ERRCODE_RANGE 8 /* # of bits to shift table number */
28 #define ERRCODE_MAX 0xFFFFFFFFUL /* Mask for maximum error table */
|
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sadm/dhcpmgr/com/sun/dhcpmgr/ui/ |
| SortedHeaderRenderer.java | 31 import javax.swing.table.TableCellRenderer;
37 * a table is currently being sorted on. At present it merely uses a bold
43 public SortedHeaderRenderer(JTable table) {
44 renderer = table.getTableHeader().getDefaultRenderer();
47 public Component getTableCellRendererComponent(JTable table, Object value,
49 Component c = renderer.getTableCellRendererComponent(table, value,
|
| /onnv/onnv-gate/usr/src/lib/cfgadm_plugins/ib/common/ |
| cfga_rcm.c | 33 #define MAX_FORMAT 80 /* for info table */
93 DPRINTF("ib_rcm_offline: table = %s\n", *errstring);
243 * table - table to be printed
250 * and appends the rcm_info_t data in the form of a table to the
254 ib_rcm_info_table(rcm_info_t *rinfo, char **table)
273 if (rinfo == NULL || table == NULL) {
277 /* Set localized table header strings */
317 /* Allocate space for the table */
319 if (*table == NULL)
[all...] |
| /onnv/onnv-gate/usr/src/cmd/ypcmd/revnetgroup/ |
| table.c | 31 #include "table.h"
36 * Hash table manager. Store/lookup strings, keyed by string
40 * Generate the key into the table using the first two letters
41 * of "str". The table is alphabetized, with no distinction between
65 store(table, key, datum)
66 stringtable table;
74 cur = table[index];
80 table[index] = new;
85 lookup(table, key)
86 stringtable table;
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/avs/ns/sdbc/ |
| sd_hash.h | 42 struct _sd_hash_hd *hh_next; /* hash table */
69 #define HASH(cd, blk, table) \
70 (((cd << 6) ^ ((blk) ^ ((blk) >> table->ht_bits))) \
71 & (table->ht_mask))
81 _sd_hash_table_t *table);
83 _sd_hash_hd_t *hptr, _sd_hash_table_t *table);
84 extern int _sd_hash_delete(_sd_hash_hd_t *hptr, _sd_hash_table_t *table);
86 _sd_hash_table_t *table);
|
