Searched refs:search (Results 76 - 100 of 186) sorted by relevance

12345678

/freebsd-12-stable/contrib/mandoc/
H A Dcgi.c48 * A query as passed to the search function.
418 printf(" <input type=\"search\" name=\"query\" value=\"");
953 struct mansearch search; local
973 search.arch = req->q.arch;
974 search.sec = req->q.sec;
975 search.outkey = "Nd";
976 search.argmode = req->q.equal ? ARG_NAME : ARG_EXPR;
977 search.firstmatch = 1;
1018 else if (mansearch(&search, &paths, argc, argv, &res, &ressz) == 0)
/freebsd-12-stable/cddl/contrib/opensolaris/lib/libzfs/common/
H A Dlibzfs_iter.c260 zfs_node_t search; local
262 search.zn_handle = zhp;
263 node = avl_find(avl, &search, NULL);
H A Dlibzfs_pool.c2200 * Find a vdev that matches the search criteria specified. We use the
2206 vdev_to_nvlist_iter(nvlist_t *nv, nvlist_t *search, boolean_t *avail_spare, argument
2214 nvpair_t *pair = nvlist_next_nvpair(search, NULL);
2217 if (search == NULL || pair == NULL)
2220 /* Obtain the key we will use to search */
2360 if ((ret = vdev_to_nvlist_iter(child[c], search,
2381 if ((ret = vdev_to_nvlist_iter(child[c], search,
2392 if ((ret = vdev_to_nvlist_iter(child[c], search,
2411 nvlist_t *search, *nvroot, *ret; local
2413 verify(nvlist_alloc(&search, NV_UNIQUE_NAM
2450 nvlist_t *nvroot, *search, *ret; local
2856 is_replacing_spare(nvlist_t *search, nvlist_t *tgt, int which) argument
[all...]
/freebsd-12-stable/contrib/wpa/src/utils/
H A Dedit.c1007 static int search = 0; local
1012 if (search) {
1016 search = 0;
1096 search = 1;
/freebsd-12-stable/contrib/ntp/sntp/unity/auto/
H A Dunity_test_summary.py105 m = re.search(r"([0-9]+) Tests ([0-9]+) Failures ([0-9]+) Ignored", summary)
/freebsd-12-stable/lib/libc/stdlib/
H A Dtdelete.c30 #include <search.h>
37 * Makes a step to the left along the binary search tree. This step is
58 /* Makes a step to the right along the binary search tree. */
/freebsd-12-stable/lib/libedit/
H A DMakefile20 parse.c prompt.c read.c readline.c refresh.c search.c sig.c \
/freebsd-12-stable/crypto/heimdal/lib/wind/
H A Dgen-normalize.py139 if v[4] and not re.search('<[a-zA-Z]+> *', v[4]) and not exclusions.has_key(k)])
/freebsd-12-stable/crypto/openssl/
H A DNOTES.PERL84 favorite package manager. Usually, all you need to do is search
89 $ apt-cache search Text::Template
/freebsd-12-stable/usr.sbin/rtadvd/
H A Dtimer.c47 #include <search.h>
/freebsd-12-stable/contrib/openresolv/
H A Dlibc.in85 prepend_search="$(key_get_value "search " "$base")"
182 newconf="${newconf}search $newsearch$NL"
189 stuff="$($list_resolv | keys_remove nameserver domain search)"
/freebsd-12-stable/contrib/googletest/googletest/scripts/
H A Dpump.py172 m = regex.search(line)
245 m = regex.search(line)
263 m = re.search(regex, line)
272 m = re.search(regex, line)
780 return re.search(r'/\* IWYU pragma: ', line)
787 re.search(r'// IWYU pragma: ', line))
/freebsd-12-stable/contrib/libucl/src/
H A Ducl_hash.c441 ucl_object_t search; local
444 search.key = key;
445 search.keylen = keylen;
455 k = kh_get (ucl_hash_caseless_node, h, &search);
464 k = kh_get (ucl_hash_node, h, &search);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/WindowsManifest/
H A DWindowsManifestMerger.cpp126 static xmlNsPtr search(const unsigned char *HRef, xmlNodePtr Node) { function
133 return search(HRef, Node->parent);
155 if (xmlNsPtr Def = search(HRef, Node))
/freebsd-12-stable/contrib/bmake/
H A Darch.c245 Hash_Search search; local
249 for (entry = Hash_EnumFirst(&a->members, &search);
251 entry = Hash_EnumNext(&search))
1220 * Search for a library along the given search path.
/freebsd-12-stable/contrib/bmake/mk/
H A Ddirdeps-targets.mk25 # We then search those dirs for any Makefile.depend*
/freebsd-12-stable/sys/netinet6/
H A Dnd6.h405 struct nd_opt_hdr *search; /* multiple opts */ member in struct:nd_opts::__anon16387
418 #define nd_opts_search nd_opt_each.search
/freebsd-12-stable/share/mk/
H A Ddirdeps-targets.mk26 # We then search those dirs for any Makefile.depend*
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dmetaslab.c155 * aggressive strategy (i.e search by size rather than offset).
1275 * a suitable block to allocate. This will search the specified AVL
3445 zio_alloc_list_t *zal, metaslab_t *search, boolean_t *was_active)
3449 metaslab_t *msp = avl_find(t, search, &idx);
3489 search->ms_weight = msp->ms_weight;
3490 search->ms_start = msp->ms_start + 1;
3491 search->ms_allocator = msp->ms_allocator;
3492 search->ms_primary = msp->ms_primary;
3528 metaslab_t *search = kmem_alloc(sizeof (*search), KM_SLEE local
3443 find_valid_metaslab(metaslab_group_t *mg, uint64_t activation_weight, dva_t *dva, int d, boolean_t want_unique, uint64_t asize, int allocator, zio_alloc_list_t *zal, metaslab_t *search, boolean_t *was_active) argument
[all...]
H A Dvdev_queue.c846 zio_t search; local
865 search.io_timestamp = 0;
866 search.io_offset = vq->vq_last_offset + 1;
867 VERIFY3P(avl_find(tree, &search, &idx), ==, NULL);
H A Dzfs_ctldir.c127 sfs_node_t search; local
130 search.sn_id = id;
131 search.sn_parent_id = parent_id;
133 sfs_compare_ids, &search);
/freebsd-12-stable/contrib/ldns-host/
H A Dldns-host.c786 search(ldns_resolver *res, ldns_rdf *domain, ldns_pkt **pkt, function
875 dname = search(res, domain, &pkt, absolute, true);
895 dname = search(res, domain, &pkt, absolute, false);
951 if ((dname = search(res, domain, &pkt, absolute, true)) == NULL)
/freebsd-12-stable/contrib/libedit/
H A DMakefile19 parse.c prompt.c read.c readline.c refresh.c search.c sig.c \
/freebsd-12-stable/contrib/amd/amd/
H A Dmapc.c112 search_fn *search; /* Search for new entry */ member in struct:map_type
531 * Calls map specific search routine.
540 rc = (*m->search) (m, m->map_name, key, valp, &m->modify);
735 m->search = alloc >= MAPC_ALL ? error_search : mt->search;
943 * Otherwise search the map. If we are
1226 /* for now, only file-type search paths are implemented */
1242 /* now break path into components, and search in each */
/freebsd-12-stable/sbin/devmatch/
H A Ddevmatch.c494 * Find our bus name. It will include the unit number. We have to search
518 * other begins, so we pass the whole thing to our search routine.

Completed in 486 milliseconds

12345678