HomeSort by relevance Sort by last modified time
    Searched defs:table (Results 1 - 25 of 167) sorted by null

1 2 3 4 5 6 7

  /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/krb5/kadmin/gui/visualrt/sunsoft/jws/visual/rt/type/
SubFieldTokenizer.java 57 private Hashtable table; field in class:SubFieldTokenizer
60 table = new Hashtable();
72 table.put(key, value);
80 return (table);
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);
FontConverter.java 100 Hashtable table = sft.getHashtable(); local
102 String name = (String) table.get(/* NOI18N */"name");
108 String styleString = (String) table.get(/* NOI18N */"style");
126 String sizeString = (String) table.get(/* NOI18N */"size");
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...]
  /onnv/onnv-gate/usr/src/cmd/getent/
getent.c 38 struct table { struct
39 char *name; /* name of the table */
43 static struct table t[] = {
62 struct table *p;
  /onnv/onnv-gate/usr/src/cmd/ipf/lib/common/
printhash.c 24 iphtent_t *ipep, **table; local
37 PRINTF("# 'anonymous' table\n");
41 PRINTF("table");
58 PRINTF("Hash Table Number: %s", iph.iph_name);
127 sz = iph.iph_size * sizeof(*table);
128 table = malloc(sz);
129 if ((*copyfunc)((char *)iph.iph_table, (char *)table, sz))
133 for (ipep = table[i]; ipep != NULL; ) {
141 free(table);
facpri.c 27 typedef struct table { struct
  /onnv/onnv-gate/usr/src/cmd/loadkeys/
loadkeys.y 567 table: label
568 table line
692 * Table must be in alphabetical order.
  /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/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...]
list_rqs.c 46 register ss_request_table **table; local
93 for (table = ss_info(sci_idx)->rqt_tables; *table; table++) {
94 entry = (*table)->requests;
  /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/sgs/link_audit/common/
hash.h 63 hash_entry ** table; member in struct:hash
  /onnv/onnv-gate/usr/src/cmd/spell/
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);
hashlook.c 37 unsigned *table; variable
63 wp = &table[hindex[t]];
64 tp = &table[hindex[t+1]];
124 (table = (unsigned *)malloc(hindex[NI-1] * sizeof (*table))) == 0 ||
125 read(fileno(f), (char *)table, sizeof (*table) * hindex[NI-1]) !=
126 hindex[NI-1] * sizeof (*table))
137 (table = (unsigned *)malloc(hindex[NI-1] * sizeof (*table))) == 0 |
    [all...]
  /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/cmd/oawk/
makeprctab.c 92 char *table[SIZE]; variable
110 table[p->token-FIRSTTOKEN] = p->name;
113 if (table[i] == 0)
116 printf("/*%s*/\t%s,\n", tokname(i+FIRSTTOKEN), table[i]);
  /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/fat/
table.h 27 void* table; member in struct:_FatTable
  /onnv/onnv-gate/usr/src/lib/libast/common/regex/
ucs_names.h 41 Ucs_code_t table; member in struct:Ucs_dat_s
    [all...]
  /onnv/onnv-gate/usr/src/lib/libslp/javalib/com/sun/slp/
ActiveDiscoverer.java 43 * entered into the DA table.
64 private ServerDATable table = null; field in class:ActiveDiscoverer
77 ServerDATable table,
83 this.table = table;
198 table.recordNewDA(url,
250 table);
262 // Add preconfigured DAs to the DA table. Note that we poll the
330 table.recordNewDA(advert.URL,
  /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sadm/dhcpmgr/com/sun/dhcpmgr/data/
OptionsTable.java 34 * This class provides a global table of all the options currently known.
36 * than a single instance of this table. It includes both the standard
41 private static OptionsTable table = null; field in class:OptionsTable
47 // Initialize hash table with extra size we will probably need.
50 // Add the standard options to the table
55 * Add an array of options to the table.
65 * Add a single option to the table.
76 * Retrieve an option from the table by name
78 * @return the option found, or null if the option is not in the table
85 * Retrieve an option from the table by its cod
    [all...]
  /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sbin/in.talkd/
table.c 45 * Routines to handle insertion, deletion, etc on the table
71 static TABLE_ENTRY *table = NULL; variable
76 * Look in the table for an invitation that matches the current
90 ptr = table;
143 * out of date entries in the table while we are it.
146 ptr = table;
209 ptr->next = table;
214 table = ptr;
244 ptr = table;
274 if (table == ptr)
    [all...]

Completed in 5549 milliseconds

1 2 3 4 5 6 7