Searched defs:search (Results 1 - 25 of 26) sorted by relevance

12

/osnet-11/usr/src/lib/libshadowfs/common/
H A Dshadow_open.c38 struct mnttab mntent, search; local
53 bzero(&search, sizeof (search));
54 search.mnt_mountp = shp->sh_mountpoint;
55 if (getmntany(mnttab, &mntent, &search) != 0) {
H A Dshadow_hash.c197 shadow_hash_lookup(shadow_hash_t *shp, const void *search) argument
199 ulong_t idx = shp->sh_compute(search) % shp->sh_nbuckets;
205 if (shp->sh_compare(shp->sh_convert(elem), search) == 0)
H A Dshadow_migrate.c381 struct mnttab mntent, search; local
391 bzero(&search, sizeof (search));
392 search.mnt_mountp = shp->sh_mountpoint;
393 if (getmntany(mnttab, &mntent, &search) != 0) {
/osnet-11/usr/src/lib/libparted/common/libparted/fs/hfs/
H A Dprobe.c69 PedSector search, max; local
82 search = ((PedSector) PED_BE16_TO_CPU (mdb->start_block)
85 max = search + (PED_BE32_TO_CPU (mdb->block_size) / PED_SECTOR_SIZE_DEFAULT);
86 if (!(geom_ret = ped_geometry_new (geom->dev, geom->start, search + 2)))
89 for (; search < max; search++) {
90 if (!ped_geometry_set (geom_ret, geom_ret->start, search + 2)
91 || !ped_geometry_read (geom_ret, buf, search, 1))
126 PedSector search, max; local
143 search
197 PedSector search, max; local
[all...]
H A Dfile.c74 HfsExtentKey search; local
81 search.key_length = sizeof (HfsExtentKey) - 1;
82 search.type = HFS_DATA_FORK;
83 search.file_ID = file->CNID;
84 search.start = PED_CPU_TO_BE16 (block);
87 (HfsPrivateGenericKey*) &search,
91 if (ret_key->file_ID != search.file_ID || ret_key->type != search.type)
H A Dfile_plus.c76 HfsPExtentKey search; local
83 search.key_length = PED_CPU_TO_BE16 (sizeof (HfsPExtentKey) - 2);
84 search.type = HFS_DATA_FORK;
85 search.pad = 0;
86 search.file_ID = file->CNID;
87 search.start = PED_CPU_TO_BE32 (block);
90 (HfsPPrivateGenericKey*) &search,
94 if (ret_key->file_ID != search.file_ID || ret_key->type != search.type)
H A Dadvfs.c184 HfsExtentKey search; local
190 search.key_length = sizeof (HfsExtentKey) - 1;
191 search.type = HFS_DATA_FORK;
192 search.file_ID = PED_CPU_TO_BE32 (HFS_BAD_BLOCK_ID);
198 search.start = PED_CPU_TO_BE16 (block);
200 (HfsPrivateGenericKey*) &search,
202 || ret_key->file_ID != search.file_ID
203 || ret_key->type != search.type) {
H A Dadvfs_plus.c69 /* WARNING : the search function called only handle Extents BTree */
190 HfsPExtentKey search; local
197 search.key_length = sizeof (HfsExtentKey) - 2;
198 search.type = HFS_DATA_FORK;
199 search.pad = 0;
200 search.file_ID = PED_CPU_TO_BE32 (HFS_BAD_BLOCK_ID);
206 search.start = PED_CPU_TO_BE32 (block);
208 (HfsPPrivateGenericKey*) &search,
210 || ret_key->file_ID != search.file_ID
211 || ret_key->type != search
[all...]
/osnet-11/usr/src/lib/libnsl/rpc/
H A Dfdsync.c62 static mutex_t *search(const void *handle, int fd);
81 * If search() and create_block() fail for rpc_fd_lock(), then search()
94 mp = search(handle, fd);
113 mp = search(handle, fd);
157 search(const void *handle, int fd) function
/osnet-11/usr/src/lib/libinetutil/common/
H A Difspec.c216 char *search = "/"; local
231 if ((zonetoken = strtok_r(buffer, search, &last)) == NULL)
235 if ((linktoken = strtok_r(NULL, search, &last)) == NULL) {
252 if (strtok_r(NULL, search, &last) != NULL)
/osnet-11/usr/src/lib/efcode/fcdriver/
H A Dload_node.c53 * Build the library/drop-in fcode search path. If there's no architecture
54 * passed, we build the search path (per the PSARC decision):
58 * If there is an architecture passed, we prepend the following search path to
114 search_path(char *name, char *search, int (*fn)(char *)) argument
119 fpath = STRDUP(search);
186 char *search, *fname; local
190 if ((search = cdp->search_path) == NULL &&
191 (search = default_search_path) == NULL) {
192 log_message(MSG_ERROR, "find_lib_file: no search path\n");
198 fname = search_path(lib_name, search, f
[all...]
/osnet-11/usr/src/lib/libpp/common/
H A Dppsearch.c25 * include file search support
30 #define SEARCH_NEXT (SEARCH_USER<<1)/* search for next (uncover) */
75 message((-3, "search: %s: status=%s%s test=%s", fp->name, status == INC_CLEAR ? "[CLEAR]" : status == INC_TEST ? "[ONCE]" : status == INC_IGNORE ? "[IGNORE]" : status->name, (pp.mode & HOSTED) ? "[HOSTED]" : "", test == INC_CLEAR ? "[CLEAR]" : test == INC_TEST ? "[TEST]" : test->name));
107 * search for file using directories in dp
111 search(register struct ppfile* fp, register struct ppdirs* dp, int type, int flags) function
132 message((-3, "search: %s %s%s%s%s%s%s type=%s prefix=%s flags=|%s%s%s%s%s%s start=%s=\"%s\" pre=%s lcl=%s vnd=%s std=%s cur=%s",
164 message((-3, "search: fp=%s need=%02x index=%d dp=%s type=%02x index=%d", fp->name, need, index, dp->name, dp->type, dp->index));
172 message((-3, "search: omit %s", dp->name));
350 message((-3, "search: omit %s", t));
397 message((-3, "search
[all...]
/osnet-11/usr/src/lib/libipmi/common/
H A Dipmi_hash.c217 ipmi_hash_lookup(ipmi_hash_t *ihp, const void *search) argument
219 ulong_t idx = ihp->ih_compute(search) % ihp->ih_nbuckets;
225 if (ihp->ih_compare(ihp->ih_convert(elem), search) == 0)
H A Dipmi_entity.c74 ipmi_entity_t search; local
76 search.ie_type = id;
77 search.ie_instance = instance;
79 if ((cp = ipmi_hash_lookup(ihp->ih_entities, &search)) == NULL) {
199 ipmi_entity_t search; local
206 search.ie_type = id;
207 search.ie_instance = instance;
209 if ((eip = ipmi_hash_lookup(ihp->ih_entities, &search)) == NULL) {
653 ipmi_entity_t search; local
659 search
[all...]
H A Dipmi_sdr.c567 ipmi_sdr_cache_ent_t *ent, search; local
573 search.isc_name = (char *)idstr;
574 search.isc_sdr = NULL;
575 if ((ent = ipmi_hash_lookup(ihp->ih_sdr_cache, &search)) == NULL) {
/osnet-11/usr/src/grub/grub2/grub-core/commands/i386/pc/
H A Ddrivemap.c92 drivemap_node_t *search = map_head; local
93 while (search)
95 if (search->newdrive == newdrive)
97 mapping = search;
100 search = search->next;
126 drivemap_node_t *search = map_head; local
129 while (search)
131 if (search->newdrive == newdrive)
133 mapping = search;
[all...]
/osnet-11/usr/src/cmd/hal/hald/
H A Dids.c465 /* no need to continue the search */
978 struct pnp_id search, *res; local
987 search.id = (char *) pnp_id;
988 res = bsearch(&search, pnp_ids_list, sizeof(pnp_ids_list)/sizeof(pnp_ids_list[0]),
/osnet-11/usr/src/lib/fm/topo/libtopo/common/
H A Dsvc.c345 char *search; local
379 if ((search = topo_mod_alloc(mod, len)) == NULL)
382 (void) snprintf(search, len, "svc:/%s", svc_name);
383 svc_node = topo_node_lookup(node, (const char *)search, 0);
386 topo_mod_free(mod, search, len);
391 (void) snprintf(search, len, "svc:/%s:%s", svc_name, svc_inst);
392 svc_node = topo_node_lookup(svc_node, (const char *)search, 0);
394 topo_mod_free(mod, search, len);
399 topo_mod_free(mod, search, len);
/osnet-11/usr/src/lib/libast/common/misc/
H A Dfts.c250 * search trees with top-down splaying (a la Tarjan and Sleator)
258 search(FTSENT* e, FTSENT* root, int(*comparf)(FTSENT* const*, FTSENT* const*), int insert) function
685 root = search(f, root, fts->comparf, 1);
922 if ((fts->diroot = search(f, fts->diroot, statcmp, 0)) != f || f->fts_level > 0 && (t = f) && statcmp(&t, &f->fts_parent) == 0)
1078 fts->root = search(f, fts->root, fts->comparf, 1);
1180 fts->diroot = search(f, fts->diroot, statcmp, 0);
H A Doptget.c789 * prefix search for s in tab with num elements of size
794 search(const void* tab, size_t num, size_t siz, char* s) function
2388 else if ((hp = (Help_t*)search(styles, elementsof(styles), sizeof(styles[0]), (char*)what + 1)) && hp->style >= 0)
3583 if (hp = (Help_t*)search(styles, elementsof(styles), sizeof(styles[0]), (char*)what))
5090 if (hp = (Help_t*)search(styles, elementsof(styles), sizeof(styles[0]), w))
5416 if (hp = (Help_t*)search(styles, elementsof(styles), sizeof(styles[0]), s))
/osnet-11/usr/src/lib/libshell/common/edit/
H A Demacs.c173 static void search(Emacs_t*,genchar*,int);
611 search(ep,out,count);
1025 /* search back for character */
1229 static void search(Emacs_t* ep,genchar *out,int direction) function
H A Dvi.c155 #define lsearch editb.e_search /* last search string */
183 #define SEARCH -45 /* search flag */
203 static int search(Vi_t*,int);
839 switch( search(vp,c) )
1874 int opflag; /* search optimize flag */
1957 /*** attempt to optimize search somewhat to find ***/
2184 * mode = '/' require search string and search new to old
2185 * mode = '?' require search string and search ol
2212 static int search(register Vi_t* vp,register int mode) function
[all...]
/osnet-11/usr/src/lib/libproc/common/
H A DPsymtab.c2198 * Use a binary search to do the work of sym_by_addr().
2267 * Use a linear search to do the work of sym_by_addr().
2312 * Use a linear or a binary search depending on whether or not we
2326 * Use a binary search to do the work of sym_by_name().
2365 * Use a linear search to do the work of sym_by_name().
2393 * Use a linear or a binary search depending on whether or not we
2787 * If which == PR_SYMTAB, search the normal symbol table.
2788 * If which == PR_DYNSYM, search the dynamic symbol table.
3055 const char *search; member in struct:getenv_data
3071 strncmp(nameval, d->search,
[all...]
/osnet-11/usr/src/lib/libzfs/common/
H A Dlibzfs_pool.c1878 * Find a vdev that matches the search criteria specified. We use the
1884 vdev_to_nvlist_iter(nvlist_t *nv, nvlist_t *search, boolean_t *avail_spare, argument
1892 nvpair_t *pair = nvlist_next_nvpair(search, NULL);
1895 if (search == NULL || pair == NULL)
1898 /* Obtain the key we will use to search */
2038 if ((ret = vdev_to_nvlist_iter(child[c], search,
2061 if ((ret = vdev_to_nvlist_iter(child[c], search,
2072 if ((ret = vdev_to_nvlist_iter(child[c], search,
2102 nvlist_t *nvroot, *search, *ret; local
2105 verify(nvlist_alloc(&search, NV_UNIQUE_NAM
2593 is_replacing_spare(nvlist_t *search, nvlist_t *tgt, int which) argument
[all...]
H A Dlibzfs_sendrecv.c919 zfs_node_t search; local
921 search.zn_handle = zhp;
922 node = avl_find(avl, &search, NULL);
1951 /* exhaustive search all local snapshots or shares */

Completed in 106 milliseconds

12