Searched refs:item (Results 26 - 50 of 256) sorted by relevance

1234567891011

/illumos-gate/usr/src/lib/print/libpapi-common/common/
H A Dlist.c43 list_append(void ***list, void *item) argument
47 if ((list == NULL) || (item == NULL)) {
52 if (item != NULL) {
74 (*list)[count] = item;
144 list_remove(void ***list, void *item) argument
148 if ((list == NULL) || (*list == NULL) || (item == NULL))
153 if ((*list)[count] == item) { /* mark the location of item */
155 item = NULL;
159 if (item
[all...]
/illumos-gate/usr/src/uts/common/io/xge/hal/include/
H A Dxge-list.h32 * struct xge_list_t - List item.
33 * @prev: Previous list item.
34 * @next: Next list item.
72 * xge_list_first_get - Return the first item from the linked list.
75 * Returns the next item from the header.
76 * Returns NULL if the next item is header itself
92 * xge_list_remove - Remove the specified item from the linked list.
93 * item: element of the list
95 * Remove item from a list.
98 static inline void xge_list_remove(xge_list_t *item) argument
[all...]
/illumos-gate/usr/src/lib/libumem/common/
H A Denvvar.c47 * This structure describes items. Each item has a name, type, and
48 * description. During processing, an item read from the user may
51 * A valid item has an argument, if required, and it is of the right
54 * If the item is valid, item_flag_target != NULL, and:
63 typedef int arg_process_t(const struct umem_env_item *item, const char *value);
301 item_uint_process(const umem_env_item_t *item, const char *item_arg) argument
327 (*item->item_uint_target) = (uint_t)result;
331 log_message("%s: %s: not a number\n", CURRENT, item->item_name);
335 log_message("%s: %s: overflowed\n", CURRENT, item->item_name);
340 item_size_process(const umem_env_item_t *item, cons argument
409 umem_log_process(const umem_env_item_t *item, const char *item_arg) argument
427 umem_size_process(const umem_env_item_t *item, const char *item_arg) argument
471 umem_backend_process(const umem_env_item_t *item, const char *item_arg) argument
495 umem_allocator_process(const umem_env_item_t *item, const char *item_arg) argument
524 process_item(const umem_env_item_t *item, const char *item_arg) argument
[all...]
/illumos-gate/usr/src/lib/libshare/common/
H A Dlibsharecore.c143 xfs_sharelist_t *item; local
145 item = (xfs_sharelist_t *)malloc(sizeof (xfs_sharelist_t));
146 if (item != NULL)
147 (void) memset(item, '\0', sizeof (xfs_sharelist_t));
148 return (item);
161 xfs_sharelist_t *item, *prev; local
174 item = alloc_sharelist();
175 if (item != NULL) {
176 item->description = strdup(notice[i]);
178 item
211 xfs_sharelist_t *item = NULL, *first = NULL, *last; local
317 xfs_sharelist_t *item; local
336 xfs_sharelist_t *item, *prev = NULL; local
374 xfs_sharelist_t *item, *prev = NULL; local
407 xfs_sharelist_t *item, *tmp; local
455 xfs_sharelist_t *item; local
1290 xfs_sharelist_t *list, *item; local
[all...]
/illumos-gate/usr/src/cmd/lvm/metassist/layout/
H A Dlayout_device_cache.c229 dlist_t *item; local
257 if ((item = dlist_new_item((void *)dcp)) == NULL) {
262 _desc_cache = dlist_append(item, _desc_cache, AT_HEAD);
289 ENTRY item; local
295 item.key = buf;
298 if ((cached_item = hsearch(item, FIND)) != NULL) {
368 dlist_t *item; local
401 if ((item = dlist_new_item((void *)ncp)) == NULL) {
408 _name_cache = dlist_append(item, _name_cache, AT_HEAD);
431 ENTRY item; local
610 dlist_t *item = NULL; local
656 ENTRY item; local
741 dlist_t *item; local
821 dlist_t *item = NULL; local
[all...]
/illumos-gate/usr/src/test/zfs-tests/tests/functional/rsend/
H A Drsend_010_pos.ksh64 for item in $list ; do
65 if datasetnonexists $item@snap ; then
66 log_must zfs snapshot $item@snap
/illumos-gate/usr/src/lib/passwdutil/
H A D__get_authtoken_attr.c41 __get_authtoken_attr(char *name, pwu_repository_t *rep, attrlist *item) argument
63 res = rops[i]->getattr(name, item, rep);
/illumos-gate/usr/src/lib/print/libprint/common/
H A Dlist.c44 * list_append() takes in a list (type **) and a pointer to an item to add
45 * to the list and returns a new list with the new item appended on the
51 list_append(void **list, void *item) argument
54 syslog(LOG_DEBUG, "list_append(0x%x, 0x%x)", list, item);
56 if (item == NULL)
62 list[0] = item;
82 list[count] = item;
89 list_append_unique(void **list, void *item, int (*cmp)(void *, void*)) argument
91 if (list_locate(list, cmp, item))
94 list = list_append(list, item);
[all...]
/illumos-gate/usr/src/common/crypto/ecc/
H A Dsecitem.c68 SECITEM_AllocItem(PRArenaPool *arena, SECItem *item, unsigned int len, argument
78 if (item == NULL) {
88 PORT_Assert(item->data == NULL);
89 result = item;
116 if (item != NULL) {
117 item->data = NULL;
118 item->len = 0;
122 SECITEM_FreeItem(result, (item == NULL) ? PR_TRUE : PR_FALSE);
125 * If item is not NULL, the above has set item
[all...]
/illumos-gate/usr/src/cmd/eeprom/i386/
H A Dbenv.h50 void *item; member in struct:eplist
59 extern void add_item(void *item, eplist_t *list);
/illumos-gate/usr/src/cmd/stat/common/
H A Dmnt.c110 mnt_t *item; local
147 item = safe_alloc(sizeof (mnt_t));
148 item->device_name =
150 item->mount_point =
152 item->devinfo =
154 item->minor = mnt.mnt_minor;
155 item->next = *which;
156 *which = item;
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dhsearch.c120 ENTRY item; member in struct:node
136 static unsigned int prcnt; /* Number of probes this item */
243 * Find or insert the item into the table
245 * item: Item to be inserted or found
249 hsearch(ENTRY item, ACTION action) argument
257 i = HASH(item.key); /* Primary hash on key */
266 else if(COMPARE(table[i].key, item.key) == 0) /* Match? */
270 c = HASH2(item.key); /* No match => compute secondary hash */
283 else if(COMPARE(table[i].key, item.key) == 0) /* Match? */
300 { unsigned int p0 = HASH(item
371 hsearch(ENTRY item, ACTION action) argument
418 build(NODE **last, NODE *next, ENTRY item) argument
[all...]
H A Dndbm.c190 datum item; local
196 item = makdatum(db->dbm_pagbuf, i+1);
197 if (item.dptr != NULL)
198 return (item);
201 item.dptr = NULL;
202 item.dsize = 0;
203 return (item);
241 datum item, item1; local
284 item = makdatum(db->dbm_pagbuf, i);
285 if (item
349 datum item, bitem; local
403 datum item; local
445 datum item,bitem; local
725 datum item; local
762 finddatum(char buf[PBLKSIZ], datum item) argument
805 dcalchash(datum item) argument
860 additem(char buf[PBLKSIZ], datum item, datum item1) argument
[all...]
/illumos-gate/usr/src/uts/common/tnf/
H A Dtnf_types.h251 #define tnf_derived_base(ops, item, ref)\
252 tnf_tag_element_1(ops, item, ref, tnf_derived_base_tag_data)
256 #define tnf_element_type(ops, item, ref)\
257 tnf_tag_element_1(ops, item, ref, tnf_element_type_tag_data)
261 #define tnf_type_array(ops, item, ref) \
262 tnf_tag_array_1(ops, item, ref, tnf_type_array_tag_data)
266 #define tnf_slot_types(ops, item, ref) \
267 tnf_tag_array_1(ops, item, ref, tnf_slot_types_tag_data)
271 #define tnf_properties(ops, item, ref) \
272 tnf_tag_properties_1(ops, item, re
[all...]
/illumos-gate/usr/src/lib/libnisdb/
H A Dldap_ldap.h43 int storeLDAP(__nis_mapping_item_t *item, int index,
H A Dldap_parse.h56 __nis_hash_item_mt item; /* item.name is the attr name */ member in struct:__anon3590
218 /* Type of an item in a mapping rule */
250 * Mapping item
252 * The mapping item is a single LDAP attribute, or a NIS+ table column, such as
262 * repeat True if item should be repeated if necessary. This is used
265 * exItem forward mapping item for supporting removespec syntax.
284 * element.item A single item
287 * numItems Number of items in the 'item' arra
344 __nis_mapping_item_t item; member in union:__anon3604::__anon3605
348 __nis_mapping_item_t *item; member in struct:__anon3604::__anon3605::__anon3606
353 __nis_mapping_item_t item; member in struct:__anon3604::__anon3605::__anon3607
358 __nis_mapping_item_t item; member in struct:__anon3604::__anon3605::__anon3608
442 __nis_mapping_item_t item; member in union:__nis_mapping_element_struct::__anon3609
451 __nis_mapping_item_t item; member in struct:__nis_mapping_element_struct::__anon3609::__anon3611
457 __nis_mapping_item_t *item; member in struct:__nis_mapping_element_struct::__anon3609::__anon3612
461 __nis_mapping_item_t item; member in struct:__nis_mapping_element_struct::__anon3609::__anon3613
653 __nis_hash_item_mt item; /* item.name=dbId||objName */ member in struct:__anon3617
[all...]
H A Dldap_ldap.c200 * Store 'val' at the LDAP location indicated by 'item'. As usual,
211 * item->repeat == 0 || index < numIndexes
218 * used when the item search triple is invalid. Also, the defDN->write.base
219 * value is appended to the item search base if the latter is empty, or ends
222 * If the item search triple is invalid, 'dn' must contain the DN(s)
233 storeLDAP(__nis_mapping_item_t *item, int index, int numIndexes, argument
244 if (item == 0 || item->type != mit_ldap || item->name == 0 ||
258 if (item
[all...]
/illumos-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DpmHelpController.java49 * request presentation of the specified help item.
54 pmHelpItem item = viewPanel.loadItemForTag(tag);
59 public void showHelpItem(pmHelpItem item) { argument
60 if (item != null)
61 showHelpItem(item.tag);
/illumos-gate/usr/src/test/zfs-tests/tests/functional/cli_root/zfs_get/
H A Dzfs_get_common.kshlib57 typeset -i item=0
73 (( item = $RANDOM % ${#elements[@]} ))
76 comb_str=${elements[item]}
78 comb_str=$comb_str$separator${elements[item]}
/illumos-gate/usr/src/cmd/gss/gsscred/
H A Dgsscred_file.c261 char fullEntry[MAX_ENTRY_LEN+1], *item, *item_buf, *name_buf; local
286 if ((item = strtok(fullEntry, dilims)) == NULL)
292 item_len = strlen(item);
300 if (strncmp(item, name->value, name_len) != 0) {
318 if (strncmp(item, krb5_ntok_prefix,
322 if ((item_buf = strstr(item, gss_u_name)) == NULL)
356 if ((item = strtok(NULL, dilims)) == NULL)
358 *uidOut = atol(item);
370 if ((item = strtok(NULL, dilims)) == NULL)
373 if (strcmp(item, ui
[all...]
/illumos-gate/usr/src/lib/libc/port/gen/
H A Dndbm.c254 datum item; local
260 item = makdatum(db->dbm_pagbuf, i+1);
261 if (item.dptr != NULL)
262 return (item);
265 item.dptr = NULL;
266 item.dsize = 0;
267 return (item);
306 datum item, item1; local
351 item = makdatum(db->dbm_pagbuf, i);
352 if (item
426 datum item, bitem; local
496 datum item; local
543 datum item, bitem; local
847 datum item; local
888 finddatum(char buf[PBLKSIZ], datum item) argument
939 dcalchash(datum item) argument
995 additem(char buf[PBLKSIZ], datum item, datum item1) argument
[all...]
H A Dhsearch.c118 ENTRY item; member in struct:node
134 static unsigned int prcnt; /* Number of probes this item */
280 /* Find or insert the item into the table */
282 *hsearch(ENTRY item, ACTION action) argument
283 /* "item" to be inserted or found */
293 i = HASH(item.key); /* Primary hash on key */
302 else if (COMPARE(table[i].key, item.key) == 0) /* Match? */
306 c = HASH2(item.key); /* No match => compute secondary hash */
319 else if (COMPARE(table[i].key, item.key) == 0) /* Match? */
338 unsigned int p0 = HASH(item
[all...]
/illumos-gate/usr/src/cmd/lp/lib/access/
H A Dallowed.c174 char * item,
179 allowed (item, allow, deny)
180 char *item,
186 if (bang_searchlist(item, allow))
193 if (bang_searchlist(item, deny))
173 allowed( char * item, char ** allow, char ** deny ) argument
/illumos-gate/usr/src/uts/common/io/xge/hal/xgehal/
H A Dxge-queue.c27 * xge_queue_item_data - Get item's data.
28 * @item: Queue item.
30 * Returns: item data(variable size). Note that xge_queue_t
33 * user-defined portion of the queue item.
35 void* xge_queue_item_data(xge_queue_item_t *item) argument
37 return (char *)item + sizeof(xge_queue_item_t);
41 * __queue_consume - (Lockless) dequeue an item from the specified queue.
47 __queue_consume(xge_queue_t *queue, int data_max_size, xge_queue_item_t *item) argument
59 xge_list_remove(&elem->item);
154 xge_queue_item_t *item = (xge_queue_item_t *)(void *)item_buf; local
325 xge_list_t *item; local
392 xge_queue_consume(xge_queue_h queueh, int data_max_size, xge_queue_item_t *item) argument
417 xge_queue_item_t *item = (xge_queue_item_t *)(void *)item_buf; local
[all...]
/illumos-gate/usr/src/lib/libshell/common/bltins/
H A Dalarm.c55 * insert timeout item on current given list in sorted order
57 static void *time_add(struct tevent *item, void *list) argument
60 if(!tp || item->milli < tp->milli)
62 item->next = tp;
63 list = (void*)item;
67 while(tp->next && item->milli > tp->next->milli)
69 item->next = tp->next;
70 tp->next = item;
72 tp = item;
78 * delete timeout item fro
80 time_delete(register struct tevent *item, void *list) argument
[all...]

Completed in 99 milliseconds

1234567891011