HomeSort by relevance Sort by last modified time
    Searched refs:elements (Results 1 - 25 of 211) sorted by null

1 2 3 4 5 6 7 8 9

  /onnv/onnv-gate/usr/src/lib/gss_mechs/mech_krb5/mech/
rel_oid_set.c 53 free((*set)->elements[i].elements);
55 free((*set)->elements);
util_buffer_set.c 52 set->elements = NULL;
78 set->elements = (gss_buffer_desc *)realloc(set->elements,
81 if (set->elements == NULL) {
87 p = &set->elements[set->count];
91 free(set->elements); /* SUNW17PACresync - MIT17 bug */
119 (void) generic_gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
122 if ((*buffer_set)->elements != NULL) {
123 free((*buffer_set)->elements);
124 (*buffer_set)->elements = NULL
    [all...]
oid_ops.c 78 free((*oid)->elements);
101 p->elements = malloc(p->length);
102 if (!p->elements) {
106 memcpy(p->elements, oid->elements, p->length);
141 member_oid->elements == NULL)
144 elist = (*oid_set)->elements;
146 if (((*oid_set)->elements = (gss_OID) malloc(((*oid_set)->count+1) *
150 memcpy((*oid_set)->elements,
155 lastel = &(*oid_set)->elements[(*oid_set)->count]
    [all...]
  /onnv/onnv-gate/usr/src/lib/gss_mechs/mech_dh/backend/mech/
oid.c 45 return (memcmp(oid1->elements, oid2->elements, oid1->length) == 0);
49 /* Count the number of elements in an oid. Return -1 on badly formed OID */
54 unsigned char *p = (unsigned char *)oid->elements;
76 /* Allocate the elements of the new OID */
77 dest->elements = (void *)New(char, source->length);
78 if (dest->elements == NULL)
84 /* And copy the elements */
85 memcpy(dest->elements, source->elements, dest->length)
    [all...]
  /onnv/onnv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
Tuple.java 41 * corresponding elements are not mutually comparable or the number of
42 * tuple elements differs.
54 * The empty tuple has zero elements and may be used to obtain the
67 new String[] {"elements"})
92 private java.util.List <ValueRecord> elements; field in class:Tuple
98 // expected to be a short list (usually one to three elements)
100 elements = new ArrayList <ValueRecord> (4);
104 * Creates a tuple with the given elements in the given order.
106 * @param tupleElements ordered series of tuple elements
108 * elements is {@code null
    [all...]
  /onnv/onnv-gate/usr/src/lib/libgss/
g_rel_oid_set.c 57 oid = &(*set)->elements[index];
58 free(oid->elements);
60 free((*set)->elements);
oid_ops.c 86 free((*oid)->elements);
115 p->elements = malloc(p->length);
116 if (!p->elements) {
120 (void) memcpy(p->elements, oid->elements, p->length);
158 member_oid->elements == NULL)
164 elist = (*oid_set)->elements;
166 if (((*oid_set)->elements = (gss_OID) malloc(((*oid_set)->count+1) *
170 (void) memcpy((*oid_set)->elements, elist,
174 lastel = &(*oid_set)->elements[(*oid_set)->count]
    [all...]
g_initialize.c 241 free(g_mechSet.elements[i].elements);
242 free(g_mechSet.elements);
243 g_mechSet.elements = NULL;
247 /* determine how many elements to have in the list */
257 g_mechSet.elements =
259 if (g_mechSet.elements == NULL) {
265 (void) memset(g_mechSet.elements, 0,
273 curItem = &(g_mechSet.elements[count]);
274 curItem->elements = (void*
    [all...]
g_imp_sec_context.c 117 ctx->mech_type->elements = malloc(length);
118 if (!ctx->mech_type->elements) {
121 (void) memcpy(ctx->mech_type->elements, p, length);
153 if (ctx->mech_type->elements)
154 free(ctx->mech_type->elements);
g_inquire_cred.c 170 (*mechanisms)->elements =
174 if ((*mechanisms)->elements == NULL) {
181 (*mechanisms)->elements[i].elements = (void *)
183 if ((*mechanisms)->elements[i].elements == NULL)
185 g_OID_copy(&(*mechanisms)->elements[i],
198 * elements.
g_acquire_cred_with_pw.c 58 actual_mechs->elements = (gss_OID)
60 if (!actual_mechs->elements) {
68 actual_mechs->elements[i].elements = (void *)
70 if (actual_mechs->elements[i].elements == NULL) {
74 g_OID_copy(&actual_mechs->elements[i], &mechs_array[i]);
146 default_OID_set.elements = &default_OID;
148 default_OID.elements = mech->mech_type.elements;
    [all...]
  /onnv/onnv-gate/usr/src/lib/libslp/javalib/com/sun/slp/
ServiceLocationEnumerator.java 62 base = v.elements();
64 base = (new Vector()).elements();
  /onnv/onnv-gate/usr/src/cmd/gss/gssd/
gssd_release_name_and_type.c 68 FREE(union_name->name_type->elements, union_name->name_type->length);
92 FREE((*set)->elements[i].elements, (*set)->elements[i].length);
94 FREE((*set)->elements, (*set)->count * sizeof (gss_OID_desc));
  /onnv/onnv-gate/usr/src/cmd/abi/spectrans/spec2map/
util.h 40 char *elements[1]; /* Actually elements[nelem] */ member in struct:table_head_t
util.c 94 t->elements[i] = NULL;
97 t->elements[t->used] = strset(t->elements[t->used], value);
124 return (t->elements[index]);
137 if (strcmp(value, t->elements[i]) == 0)
153 "table size = %d elements out of %d elements/%d bytes\n",
174 qsort((char *)t->elements, (size_t)t->used,
  /onnv/onnv-gate/usr/src/uts/common/gssapi/
gss_release_oid_set.c 48 FREE((*set)->elements, (*set)->count * sizeof (gss_OID_desc));
gss_import_name.c 104 * making a copy of the name_type structure and elements
114 union_name->name_type->elements = (void *)
117 if (!union_name->name_type->elements) {
122 (void) memcpy(union_name->name_type->elements,
123 input_name_type->elements, input_name_type->length);
  /onnv/onnv-gate/usr/src/uts/common/ipp/ipgpc/
table.c 79 (void) ipgpc_list_insert(&table[x].elements, id);
82 table[x].next->elements = NULL;
86 (void) ipgpc_list_insert(&table[x].next->elements, id);
94 (void) ipgpc_list_insert(&p->elements, id);
103 p->elements = NULL;
107 (void) ipgpc_list_insert(&p->elements, id);
133 return (table[x].elements);
138 return (p->elements);
214 if (table[x].elements != NULL) {
215 if (ipgpc_list_remove(&table[x].elements, id))
    [all...]
trie.c 60 buf->elements = NULL;
167 nodep->zero->elements = nodep->elements;
168 nodep->elements = NULL;
193 nodep->one->elements = nodep->elements;
194 nodep->elements = NULL;
264 /* check if at a leaf node with elements */
267 (c_node->elements != NULL)) {
310 (void) ipgpc_list_insert(&c_node->elements, id)
    [all...]
  /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sadm/dhcpmgr/com/sun/dhcpmgr/data/
OptionsTable.java 92 for (Enumeration e = elements(); e.hasMoreElements(); ) {
104 public Enumeration elements() { method in class:OptionsTable
105 return options.elements();
  /onnv/onnv-gate/usr/src/lib/libshell/common/scripts/
simplefiletree1.sh 57 typeset -a pe # path elements
78 [[ ! -v node.elements ]] && typeset -a node.elements
79 node.elements+=( "${pe[i]}" )
  /onnv/onnv-gate/usr/src/cmd/pools/poold/com/sun/solaris/service/pools/
Configuration.java 60 * The cache of elements known to this configuration.
62 private Map elements; field in class:Configuration
83 elements = new HashMap();
146 elements.clear();
269 elements.put(p.getKey(), p);
281 elements.remove(aPool.getKey());
300 if (elements.containsKey("PoolInternal." + name))
301 return ((Pool) elements.get("PoolInternal." + name));
304 elements.put(p.getKey(), p);
372 elements.put(res.getKey(), res)
    [all...]
  /onnv/onnv-gate/usr/src/uts/common/rpc/sec_gss/
rpcsec_gss_utils.c 74 tmp->elements = kmem_alloc((oid->length), KM_SLEEP);
75 bcopy((char *)oid->elements, (char *)tmp->elements, oid->length);
96 return (bcmp(oid1->elements, oid2->elements, oid1->length) == 0);
112 (*name_type)->elements = (void *)(cp + sizeof (int));
  /onnv/onnv-gate/usr/src/cmd/abi/spectrans/spec2trace/
util.h 41 char *elements[1]; /* Actually elements[nelem] */ member in struct:table_head_t
  /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sadm/dhcpmgr/com/sun/dhcpmgr/data/qualifier/
QualifierArray.java 43 * The default String of characters that delimit elements in a String
49 * The default String of characters that delimit elements in a String
55 * The type of the arrays elements.
60 * The String of characters that delimit elements in a String
66 * The String of characters that delimit elements in a String
77 * The qualifier type of the arrays elements.
87 * The qualifier type of the arrays elements.
89 * The String of characters that delimit elements in a String
104 * The qualifier type of the arrays elements.
133 * The String of characters that delimit elements in a Strin
145 ArrayList elements = new ArrayList(); local
    [all...]

Completed in 600 milliseconds

1 2 3 4 5 6 7 8 9