Searched defs:element (Results 1 - 25 of 39) sorted by relevance

12

/illumos-gate/usr/src/lib/libfru/libfru/
H A DnameSyntaxYacc.y60 %type <pathDef> recordpath element
74 recordpath : element
78 | element SEPIDENT recordpath
114 element : NAME label
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 Dlibfru.cc126 "No registry definition for this element",
1402 // instWICur: The instance of this element within the tag itself.
1896 const char *element)
1905 = fru_reg_lookup_def_by_name((char *)element);
1963 const char *element)
1994 if (strcmp(element, "UNKNOWN") == 0) {
2015 = fru_reg_lookup_def_by_name((char *)element);
2142 fru_get_tagged_parents(const char *element, fru_strlist_t *parents) argument
2145 = Ancestor::listTaggedAncestors((char *)element);
1894 fru_add_element(fru_nodehdl_t container, const char *seg_name, const char *element) argument
1960 fru_delete_element(fru_nodehdl_t container, const char *seg_name, unsigned int instance, const char *element) argument
/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/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)
H A Dns_bsd_addr.c46 char *element; local
48 for (element = strtok_r(string, seperators, &where); element != NULL;
49 element = strtok_r(NULL, seperators, &where))
50 list = (char **)list_append((void **)list, element);
/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/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;
H A Dcooked.c181 entry_t element; local
189 element.time = evt_time;
190 element.record = datum;
191 table_insert(&element);
/illumos-gate/usr/src/lib/gss_mechs/mech_dh/backend/mech/
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 */
/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/uts/common/os/
H A Dshare.c246 is_match_for_del(struct shrlock *shr, struct shrlock *element) argument
252 nlmid2 = GETNLMID(element->s_sysid);
260 result = shr->s_sysid == element->s_sysid;
273 shr->s_pid == element->s_pid);
277 shr->s_pid == element->s_pid) ||
279 shr->s_sysid == element->s_sysid));
/illumos-gate/usr/src/cmd/prstat/
H A Dprtable.c127 add_element(table_t *table, long element) argument
135 table->t_list[table->t_nent++] = element;
139 has_element(table_t *table, long element) argument
145 if (table->t_list[i] == element)
148 return (1); /* pretend that element was found */
151 return (0); /* element was not found */
267 if (!elm_prev) /* first chain element */
/illumos-gate/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);
/illumos-gate/usr/src/tools/stabs/
H A Dstabs.h100 struct element { struct
108 struct element *indices;
/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/uts/common/io/ib/clients/of/sol_uverbs/
H A Dsol_uverbs_event.c807 * element - The users handle to the associated object.
820 uverbs_async_event_common(uverbs_uctxt_uobj_t *uctxt, uint64_t element, argument
827 "%llx, %llx, %p, %p)", uctxt, element, event, obj_list, counter);
844 entry->ev_desc.async.element = element;
/illumos-gate/usr/src/uts/common/io/lvm/notify/
H A Dmd_notify.c66 md_event_t *element, *next_element; local
79 element = queue->mdn_front;
80 while (element) {
81 next_element = element->mdn_next;
82 kmem_free(element, sizeof (md_event_t));
83 element = next_element;
/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...]
/illumos-gate/usr/src/uts/i86pc/os/cpupm/
H A Dcpu_acpi.c476 cmn_err(CE_NOTE, "!cpu_acpi: %s element "
723 cmn_err(CE_NOTE, "!cpu_acpi: _CST invalid element "
749 ACPI_OBJECT *element; local
756 element = &(pkg->Package.Elements[1]);
757 cstate->cs_type = element->Integer.Value;
758 element = &(pkg->Package.Elements[2]);
759 cstate->cs_latency = element->Integer.Value;
760 element = &(pkg->Package.Elements[3]);
761 cstate->cs_power = element->Integer.Value;
801 cmn_err(CE_NOTE, "!cpu_acpi: _CST first element typ
[all...]
/illumos-gate/usr/src/cmd/mdb/common/modules/libc/
H A Dlibc.c1104 void *element = NULL; local
1119 element = u.ul_ftsd[key];
1129 if (mdb_vread(&element, sizeof (element),
1138 if (element == NULL && (flags & DCMD_PIPE))
1141 mdb_printf("%p\n", element);
/illumos-gate/usr/src/lib/libnisdb/
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 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...]
/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/fs.d/ufs/fsck/
H A Dinode.c934 search_cache(struct inoinfo *element, fsck_ino_t key) argument
936 while (element != NULL) {
937 if (element->i_number == key)
939 element = element->i_nextlist;
942 return (element);

Completed in 157 milliseconds

12