Searched refs:element (Results 1 - 25 of 76) sorted by relevance

1234

/osnet-11/usr/src/lib/libfru/libfru/
H A DAncestor.h45 // the object used to determine the ancestory of a particular element.
66 // information about all the Ancestors of element.
67 static Ancestor *listTaggedAncestors(char *element);
84 Str element);
87 Str element,
H A DAncestor.cc143 Ancestor::listTaggedAncestors(char *element) argument
160 Ancestor *ant = createTaggedAncestor(def, element);
183 Ancestor::createTaggedAncestor(const fru_regdef_t *def, Str element) argument
191 Ancestor *rc = new Ancestor(element, tag, def);
193 if (element.compare(def->name) == 0) {
207 int f = definitionContains(tmp, def, element,
225 Str element,
230 if (element.compare(def->name) == 0) {
255 int f = definitionContains(tmp, def, element,
223 definitionContains(const fru_regdef_t *def, const fru_regdef_t *parent_def, Str element, uint32_t offset, Ancestor *ant, Str path) argument
H A DnameSyntaxYacc.y60 %type <pathDef> recordpath element
74 recordpath : element
78 | element SEPIDENT recordpath
114 element : NAME label
/osnet-11/usr/src/lib/libnisdb/
H A Dnis_parse_ldap_util.c167 free_mapping_element(&r->element[i]);
168 if (r->element != NULL)
169 free(r->element);
173 free_mapping_element(&r->element[i]);
174 if (r->element != NULL)
175 free(r->element);
199 free_mapping_item(&e->element.item);
202 if (e->element.print.fmt != NULL)
203 free_mapping_format(e->element.print.fmt);
204 e->element
[all...]
H A Dldap_print.c126 printMappingItem(&e->element.item, native);
130 printMappingFormatArray(e->element.print.fmt);
131 for (i = 0; i < e->element.print.numItems; i++) {
133 printMappingItem(&e->element.print.item[i], native);
135 if (e->element.print.doElide) {
136 p2buf(myself, ", \"%c\"", e->element.print.elide);
142 printMappingItem(&e->element.split.item, native);
143 p2buf(myself, ", \"%c\")", e->element.split.delim);
150 printMappingItem(&e->element.extract.item, native);
152 printMappingFormatArray(e->element
[all...]
H A Dnis_parse_ldap_map.c729 elmnt[numSplits].element.match.numItems = nElements;
730 elmnt[numSplits].element.match.item = item;
731 elmnt[numSplits].element.match.fmt = base;
740 if (t_map->e[numSplits].element.
743 t_map->e[numSplits].element.
1075 next->rhs.element[0].type != me_split)) {
1202 &e->element.item, item_type);
1329 e->element.match.numItems = nElements;
1330 e->element.match.item = item;
1331 e->element
2289 *element = NULL; local
[all...]
H A Dldap_parse.h50 /* Attribute/value hash list element */
118 * element in __nis_mapping_item_t or
160 * element Pointer to a value element. If 'element' is non-NULL, the
161 * 'attrs' value is derived by evaluating 'element'.
167 struct __nis_mapping_element_struct *element; member in struct:__anon1951
210 /* Type of an element in a mapping rule */
270 * Sub-element of a mapping rule element
353 } element; member in struct:__anon1958
456 } element; member in struct:__nis_mapping_element_struct
487 __nis_mapping_element_t *element; member in struct:__anon1968
[all...]
H A Dldap_ldap.c70 if (t->element != 0) {
71 /* Evaluate t->element to get the t->attrs value */
73 eVal = evalMappingElement(t->element, rv);
83 eVal = evalMappingElement(t->element, 0);
222 * 'element' fields, or (if neither of those fields is set)
287 item->searchSpec.triple.element != 0) {
292 if (item->searchSpec.triple.element != 0) {
294 item->searchSpec.triple.element, 0);
H A Dldap_val.c575 item->searchSpec.triple.element == 0) {
665 triple.element =
666 item->searchSpec.triple.element;
1404 * However, since whatever the 'element' field points to
1408 new->element = old->element;
1437 * Since we only copied the element pointer when this structure
1438 * was created, we don't free old->element.
1739 * set to the start of the fmt element data (which will be 'str',
1776 /* Not a matchable element */
[all...]
H A Dldap_ruleval.c495 /* If there is more than one element, we concatenate the items */
497 __nis_mapping_element_t *e = &rl->element[i];
503 tmpitem = cloneItem(&e->element.item);
508 * element.
510 tmp = matchMappingItem(e->element.match.fmt, r, &nv,
533 for (n = 0; n < e->element.match.numItems;
537 &e->element.match.item[n]);
594 /* If there is more than one element, we concatenate the values */
596 vnew = getMappingElement(&rl->element[i], native, rv, stat);
644 r->lhs.element
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/
H A Dpriority_queue.c64 element (struct grub_priority_queue *pq, grub_size_t k) function
74 p1 = (grub_uint8_t *) element (pq, m);
75 p2 = (grub_uint8_t *) element (pq, n);
108 return element (pq, 0);
141 /* Heap property: pq->cmp (element (pq, p), element (pq, parent (p))) <= 0. */
156 grub_memcpy (element (pq, pq->used - 1), el, pq->elsize);
159 if (pq->cmp (element (pq, p), element (pq, parent (p))) <= 0)
177 if (pq->cmp (element (p
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Class/
H A DStruct.pm71 # struct( class => [ element-list ])
72 # struct( class => { element-list })
73 # struct( element-list )
177 croak "'$type' is not a valid struct element type";
281 $element_value = $obj->s; # element value
282 $obj->s('new value'); # assign to element
286 $ary_element_value = $obj->a(2); # array element value
287 $obj->a(2, 'new value'); # assign to array element
291 $hash_element_value = $obj->h('x'); # hash element value
292 $obj->h('x', 'new value'); # assign to hash element
[all...]
/osnet-11/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_hash.c51 * A hash table element
105 DAPL_HASH_ELEM *element = \
107 if (NO_DATUM(element->datum)) { \
109 } else if (element->key == (DAPL_HASH_KEY) (in_key)) { \
110 (out_datum) = element->datum; \
111 (bucket_head) = (void *)element; \
112 } else if (element->next_element) { \
113 dapli_hash_rehash(element, \
132 * Inputs: element element t
137 dapli_hash_rehash( DAPL_HASH_ELEM *element, DAPL_HASH_KEY key, void **datum, DAPL_HASH_ELEM ** head) argument
287 dapl_hash_delete_element(DAPL_HASH_ELEM * element, DAPL_HASH_KEY key, DAPL_HASH_DATA *p_datum) argument
[all...]
/osnet-11/usr/src/lib/gss_mechs/mech_dh/backend/mech/
H A Doid.h44 int __OID_is_member(gss_OID_set set, const gss_OID_desc * const element);
H A Doid.c59 /* If the upper bit is set it is part of this element */
117 __OID_is_member(gss_OID_set set, const gss_OID_desc * const element) argument
123 if (__OID_equal(element, &set->elements[i]))
201 /* For each element in the array, addit to the set */
/osnet-11/usr/src/lib/libbsm/
H A DxmlHandlers.pm178 my $element = shift;
180 # print "end tag $element\n" if $main::debug;
183 if ($functionRef = $endCallback{$element}) {
187 # print "no end callback for $element\n";
220 my ($obj, $element) = @_;
224 unless ($element =~ /^\s*$/) {
225 print "comment: $element\n";
255 my ($element, %content) = @_;
257 # print "processAttributes: element = $element\
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/gfxmenu/
H A Dgui_string_util.c72 /* Find the end of the path element. */
77 /* Copy the element. */
82 /* Advance p to point to the start of the next element, or NULL. */
101 /* Delete the '..' and the prior path element. */
124 char *element = path_array[i]; local
125 if (element)
130 newpath_end = grub_stpcpy (newpath_end, element);
/osnet-11/usr/src/lib/brand/shared/brand/sparc/
H A Dcrt.s70 add %o0, 1, %l0 ! add 1 to argc for last element of 0
/osnet-11/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DTuple.java36 * Multi-element key to a value in an {@link Aggregation}.
39 * of each corresponding element. The natural ordering of tuples is
119 throw new NullPointerException("null element");
126 * Creates a tuple with the given element list in the given list
138 throw new NullPointerException("element list is null");
142 throw new NullPointerException("null element");
151 * @throws NullPointerException if element is null
152 * @throws IllegalArgumentException if element is neither a {@link
157 addElement(ValueRecord element) argument
159 if (element
[all...]
/osnet-11/usr/src/lib/libnisdb/yptol/
H A Ddit_access_utils.c163 valA = matchMappingItem(sf->e[i].element.match.fmt,
191 sf->e[i].element.match.item[j].name,
369 valA = matchMappingItem(t->e->element.match.fmt, val,
393 t->e->element.match.item[i].name,
409 sf = mappingFromMap(t->e->element.match.item[i].name,
525 nitems = t->e->element.match.numItems;
546 sf = mappingFromMap(t->e->element.match.item[i].name,
564 if (findVal(t->e->element.match.item[i].name,
568 t->e->element.match.item[i].name,
590 sf->e[k].element
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Text/
H A DAbbrev.pm19 Stores all unambiguous truncations of each element of LIST
/osnet-11/usr/src/lib/libfru/include/
H A Dlibfru.h276 const char *element);
278 unsigned int instance, const char *element);
/osnet-11/usr/src/cmd/hal/addons/network-devices/
H A Dcommon.c38 char *element; local
43 while ((element = va_arg(ap, char *)) != NULL) {
44 if (element[0] != '/')
46 strlcat(udi, element, size);
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/IO/lib/IO/
H A DDir.pm219 C<File::stat::lstat>. Deleting an element from the hash will
225 a single integer to a hash element will cause both the access and
227 an array of two values can be passed. The first array element will be used to
228 set the access time and the second element will be used to set the modification
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/List/Util/lib/List/
H A DUtil.pm109 Similar to C<grep> in that it evaluates BLOCK setting C<$_> to each element
110 of LIST in turn. C<first> returns the first element where the result from
185 element in the list.
188 C<undef> is returned. If LIST only contains one element then that
189 element is returned and BLOCK is not executed.

Completed in 3117 milliseconds

1234