Searched defs:it (Results 1 - 12 of 12) sorted by relevance

/osnet-11/usr/src/lib/libeti/menu/common/
H A Dterminit.c90 set_item_term(MENU *m, PTF_void it) argument
93 SIterm(m) = it;
95 SIterm(Dfl_Menu) = it;
/osnet-11/usr/src/lib/libparted/common/libparted/fs/ext2/
H A Dext2_resize.c6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
11 This program is distributed in the hope that it will be useful,
528 _("Your file system is too full to resize it to %i "
539 "resize it to %i blocks. Sorry."), newsize);
601 blk_t it; local
605 it = start + fs->itoffset;
607 /*PED_DEBUG (0x21, "start = %d, it = %d", start, it);*/
612 bb = it
[all...]
/osnet-11/usr/src/lib/libnisdb/
H A Dnis_hashitem.c135 * locked the table, lock it. If the table already is
142 /* Already locked; find out if it's us */
193 * Leave traverser_id as it is, so that it
207 * traversing the table, leave it locked.
236 __nis_hash_item_mt *it, **pp; local
248 for (pp = &table->keys[key]; (it = *pp) != 0; pp = &it->next) {
249 if (strcmp(name, it->name) == 0) {
363 * There's a writer, but it'
692 __nis_hash_item_mt *it; local
[all...]
H A Dldap_nisdbquery.c68 * it here just in case. This means we usually waste a byte for
135 item *it; local
144 it = buildItem(old->components.components_val[i].index_value->
149 if (it == 0) {
155 new->components.components_val[i].index_value = it;
542 * still go through the rest of the array, so that it's
673 /* If no previous value, add it */
749 * array. On exit, it holds the number of (db_query *)'s in the return
/osnet-11/usr/src/cmd/hal/tools/
H A Dhal-device.c13 * This program is free software; you can redistribute it and/or modify
14 * it under the terms of the GNU General Public License as published by
18 * This program is distributed in the hope that it will be useful,
226 LibHalPropertySetIterator it; local
239 for(libhal_psi_init(&it, props); libhal_psi_has_more(&it); libhal_psi_next(&it)) {
240 type = libhal_psi_get_type(&it);
244 libhal_psi_get_key(&it),
245 libhal_psi_get_string(&it)
[all...]
H A Dlshal.c11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
16 * This program is distributed in the hope that it will be useful,
93 LibHalPropertySetIterator it; local
111 for (libhal_psi_init (&it, props); libhal_psi_has_more (&it); libhal_psi_next (&it)) {
112 type = libhal_psi_get_type (&it);
116 libhal_psi_get_key (&it),
117 libhal_psi_get_string (&it));
[all...]
/osnet-11/usr/src/lib/pyzfs/common/
H A Dioctl.c485 const zprop_index_t *it = p->pd_table; local
488 for (j = 0; it[j].pi_name; j++) {
490 it[j].pi_name,
491 Py_BuildValue("K", it[j].pi_value));
/osnet-11/usr/src/lib/libscf/common/
H A Dnotify_params.c235 * Add a pg if it does not exist, or get it if it exists.
945 scf_iter_t *it = scf_iter_create(h); local
966 if (val == NULL || it == NULL)
981 if (scf_iter_property_values(it, prop) != 0) {
985 while ((err = scf_iter_next_value(it, val)) == 1) {
989 /* set initial size or double it */
1018 scf_iter_destroy(it);
1195 * If the transition set is invalid, it return
1399 scf_iter_t *it = scf_iter_create(h); local
[all...]
H A Dmidlevel.c130 * with the data it contains.
510 * named property group. If the group doesn't exist, it's created with the
573 * If it's already set the way we want, forgo the transaction.
1013 * present state, if it is different.
1170 scf_iter_t *it = scf_iter_create(h); local
1173 if (h == NULL || i == NULL || it == NULL)
1176 if (scf_iter_service_instances(it, s) != 0)
1179 while ((err = scf_iter_next_instance(it, i)) == 1)
1189 scf_iter_destroy(it);
1530 * if it does
[all...]
/osnet-11/usr/src/lib/libnisdb/yptol/
H A Ddit_access.c229 * The mapping failed and will fail again if it is
390 * we can recover it from the hash table. This makes hard work but
405 __nis_hash_item_mt *it; local
438 for (it = ldapMappingList.keys[i]; NULL != it; it = it->next) {
440 if ((target_len + domain_len + 1) > strlen(it->name))
442 if (0 != strncmp(it->name, target, target_len))
446 if (strlen(domain) >= strlen(it
973 __nis_hash_item_mt *it; local
[all...]
/osnet-11/usr/src/lib/libkmf/plugins/kmf_nss/common/
H A Dnss_spi.c238 /* If another thread already did it, return OK. */
258 * When it is called the first time, it will intialize NSS. Once the NSS
260 * if it is called again.
396 /* this is an invalid cert, reject it */
406 /* this is a valid cert, reject it in this case. */
732 /* this is an invalid cert - skip it */
739 /* this is a valid cert - skip it */
744 /* delete it from database */
894 * Ignore the exponent parameter if it i
1611 SECItem it = { 0 }; local
[all...]
/osnet-11/usr/src/lib/hal/libhal-storage/common/
H A Dlibhal-storage.c12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
17 * This program is distributed in the hope that it will be useful,
105 /* see if it already exist */
639 /* skip if hal says it's not used as a filesystem */
667 /* only the real lucky mount points will make it this far :-) */
879 #define LIBHAL_PROP_EXTRACT_INT(_property_, _where_) else if (strcmp (key, _property_) == 0 && type == LIBHAL_PROPERTY_TYPE_INT32) _where_ = libhal_psi_get_int (&it)
880 #define LIBHAL_PROP_EXTRACT_UINT64(_property_, _where_) else if (strcmp (key, _property_) == 0 && type == LIBHAL_PROPERTY_TYPE_UINT64) _where_ = libhal_psi_get_uint64 (&it)
881 #define LIBHAL_PROP_EXTRACT_STRING(_property_, _where_) else if (strcmp (key, _property_) == 0 && type == LIBHAL_PROPERTY_TYPE_STRING) _where_ = (libhal_psi_get_string (&it) != NULL && strlen (libhal_psi_get_string (&it)) >
900 LibHalPropertySetIterator it; local
1095 LibHalPropertySetIterator it; local
1882 LibHalPropertySetIterator it; local
[all...]

Completed in 123 milliseconds