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

123

/illumos-gate/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
/illumos-gate/usr/src/test/zfs-tests/tests/functional/acl/nontrivial/
H A Dzfs_acl_chmod_compact_001_pos.ksh101 # $2 ACE access generated by the element of a_access
102 # $3 ACE inherit_object generated by the element of a_inherit_object
103 # $4 ACE inherit_strategy generated by the element of a_inherit_strategy
116 for element in ${a_access[@]} ; do
117 if [[ $acl_access == *"$element"* ]]; then
118 tmp_ace="${tmp_ace}${element}"
125 for element in ${a_inherit_object[@]} ; do
126 if [[ $acl_inherit_object == *"$element"* ]]; then
127 tmp_ace="${tmp_ace}${element}"
132 for element i
[all...]
/illumos-gate/usr/src/lib/libnisdb/
H A Dnis_parse_ldap_util.c170 free_mapping_element(&r->element[i]);
171 if (r->element != NULL)
172 free(r->element);
176 free_mapping_element(&r->element[i]);
177 if (r->element != NULL)
178 free(r->element);
202 free_mapping_item(&e->element.item);
205 if (e->element.print.fmt != NULL)
206 free_mapping_format(e->element.print.fmt);
207 e->element
[all...]
H A Dldap_print.c129 printMappingItem(&e->element.item, native);
133 printMappingFormatArray(e->element.print.fmt);
134 for (i = 0; i < e->element.print.numItems; i++) {
136 printMappingItem(&e->element.print.item[i], native);
138 if (e->element.print.doElide) {
139 p2buf(myself, ", \"%c\"", e->element.print.elide);
145 printMappingItem(&e->element.split.item, native);
146 p2buf(myself, ", \"%c\")", e->element.split.delim);
153 printMappingItem(&e->element.extract.item, native);
155 printMappingFormatArray(e->element
[all...]
H A Dnis_parse_ldap_map.c730 elmnt[numSplits].element.match.numItems = nElements;
731 elmnt[numSplits].element.match.item = item;
732 elmnt[numSplits].element.match.fmt = base;
741 if (t_map->e[numSplits].element.
744 t_map->e[numSplits].element.
1076 next->rhs.element[0].type != me_split)) {
1203 &e->element.item, item_type);
1330 e->element.match.numItems = nElements;
1331 e->element.match.item = item;
1332 e->element
2306 *element = NULL; local
[all...]
H A Dldap_parse.h54 /* Attribute/value hash list element */
122 * element in __nis_mapping_item_t or
164 * element Pointer to a value element. If 'element' is non-NULL, the
165 * 'attrs' value is derived by evaluating 'element'.
171 struct __nis_mapping_element_struct *element; member in struct:__anon3597
214 /* Type of an element in a mapping rule */
277 * Sub-element of a mapping rule element
360 } element; member in struct:__anon3604
463 } element; member in struct:__nis_mapping_element_struct
494 __nis_mapping_element_t *element; member in struct:__anon3614
[all...]
H A Dldap_ldap.c74 if (t->element != 0) {
75 /* Evaluate t->element to get the t->attrs value */
77 eVal = evalMappingElement(t->element, rv);
87 eVal = evalMappingElement(t->element, 0);
226 * 'element' fields, or (if neither of those fields is set)
293 item->searchSpec.triple.element != 0) {
298 if (item->searchSpec.triple.element != 0) {
300 item->searchSpec.triple.element, 0);
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dtsd.c88 void *element = NULL; local
113 if (mdb_vread(&element, sizeof (element), eladdr) == -1) {
119 if (element == NULL && (flags & DCMD_PIPE))
122 mdb_printf("%p\n", element);
/illumos-gate/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_hash.c52 * A hash table element
106 DAPL_HASH_ELEM *element = \
108 if (NO_DATUM(element->datum)) { \
110 } else if (element->key == (DAPL_HASH_KEY) (in_key)) { \
111 (out_datum) = element->datum; \
112 (bucket_head) = (void *)element; \
113 } else if (element->next_element) { \
114 dapli_hash_rehash(element, \
133 * Inputs: element element t
138 dapli_hash_rehash( DAPL_HASH_ELEM *element, DAPL_HASH_KEY key, void **datum, DAPL_HASH_ELEM ** head) argument
288 dapl_hash_delete_element(DAPL_HASH_ELEM * element, DAPL_HASH_KEY key, DAPL_HASH_DATA *p_datum) argument
[all...]
/illumos-gate/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);
/illumos-gate/usr/src/lib/libshell/common/tests/
H A Dsun_solaris_staticvariables.sh86 s+=( "an element" )
91 )" != "helloan elementan elementan element" ]] && err_exit "static array var failed"
/illumos-gate/usr/src/cmd/tnf/tnfdump/
H A Dtable.c36 * and get an element by index.
85 table_insert(entry_t *element) argument
91 table_start[table_cur++] = *element;
/illumos-gate/usr/src/tools/stabs/
H A Dstabs.h100 struct element { struct
108 struct element *indices;
/illumos-gate/usr/src/uts/common/sys/ib/clients/of/sol_ofs/
H A Dsol_kverb_impl.h46 ib_event.element.qp = qpp; \
57 ib_event.element.cq = cqp; \
/illumos-gate/usr/src/lib/libbsm/
H A DxmlHandlers.pm179 my $element = shift;
181 # print "end tag $element\n" if $main::debug;
184 if ($functionRef = $endCallback{$element}) {
188 # print "no end callback for $element\n";
219 my ($obj, $element) = @_;
223 unless ($element =~ /^\s*$/) {
224 print "comment: $element\n";
254 my ($element, %content) = @_;
256 # print "processAttributes: element = $element\
[all...]
/illumos-gate/usr/src/lib/print/libpapi-common/common/
H A Dlist.c128 * routine and element passed in to find an element in the list. It
129 * returns the first element matched, or NULL if none exists
132 list_locate(void **list, int (*compare)(void *, void *), void *element) argument
136 if ((list != NULL) && (element != NULL))
138 if ((compare)(list[current], element) == 0)
/illumos-gate/usr/src/lib/brand/shared/brand/sparc/
H A Dcrt.s70 add %o0, 1, %l0 ! add 1 to argc for last element of 0
/illumos-gate/usr/src/uts/common/io/usb/usba/
H A Dusba.c995 usba_init_list(usba_list_entry_t *element, usb_opaque_t private, argument
998 mutex_init(&element->list_mutex, NULL, MUTEX_DRIVER,
1000 mutex_enter(&element->list_mutex);
1001 element->private = private;
1002 mutex_exit(&element->list_mutex);
1019 usba_add_to_list(usba_list_entry_t *head, usba_list_entry_t *element) argument
1025 mutex_enter(&element->list_mutex);
1030 ASSERT(element->next == NULL);
1031 ASSERT(element->prev == NULL);
1043 if (next == element) {
1090 usba_rm_from_list(usba_list_entry_t *head, usba_list_entry_t *element) argument
1173 usba_list_entry_t *element = NULL; local
1216 usba_list_entry_t *element = usba_rm_first_from_list(head); local
1255 usba_check_in_list(usba_list_entry_t *head, usba_list_entry_t *element) argument
[all...]
/illumos-gate/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...]
/illumos-gate/usr/src/lib/print/libprint/common/
H A Dlist.c101 * routine and element passed in to find an element in the list. It
102 * returns the first element matched, or NULL if none exists
105 list_locate(void **list, int (*compair)(void *, void *), void *element) argument
114 if ((compair)(list[current], element) == 0)
/illumos-gate/usr/src/cmd/lvm/metassist/xml/
H A Dxml_convert.c120 * Encapsulates the parsing of an XML element
123 /* The name of the element */
126 /* The type of element to set in the devconfig_t */
132 * the hierarchy when this XML element is encountered.
138 * devconfig_t structure of this type when this element is
143 /* The valid XML attributes for this element */
167 xmlNodePtr node, xmlChar *element, xmlChar *name);
760 * the expected root element name of the XML document
851 /* Search for this element definition */
853 element_t *element local
1011 element_t *element = &(elements[i]); local
1127 xml_find_node( xmlNodePtr node, xmlChar *element, xmlChar *name) argument
[all...]
/illumos-gate/usr/src/cmd/rcm_daemon/common/
H A Drcm_subr.c1921 rcm_enqueue_head(rcm_queue_t *head, rcm_queue_t *element) argument
1923 rcm_enqueue(head, element);
1927 rcm_enqueue_tail(rcm_queue_t *head, rcm_queue_t *element) argument
1929 rcm_enqueue(head->prev, element);
1933 rcm_enqueue(rcm_queue_t *list_element, rcm_queue_t *element) argument
1935 element->next = list_element->next;
1936 element->prev = list_element;
1937 element->next->prev = element;
1938 list_element->next = element;
1944 rcm_queue_t *element = head->next; local
1952 rcm_queue_t *element = head->prev; local
1958 rcm_dequeue(rcm_queue_t *element) argument
[all...]
/illumos-gate/usr/src/cmd/prtfru/
H A Dprtfru.c301 char **element; local
310 if (((element = fru_reg_list_entries(&num_elements)) == NULL) ||
317 error(gettext("Unable to get memory for tagged element list"),
362 * Output the definition for each element
365 assert(element[i] != NULL);
367 if ((strcmp("Location", element[i])) == 0) continue;
368 if ((def = fru_reg_lookup_def_by_name(element[i])) == NULL) {
371 element[i]);
379 output("<!ELEMENT %s (%s", element[i],
385 element[
[all...]

Completed in 116 milliseconds

123