/*- * Copyright (c) 2008-2012 Juan Romero Pardines. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifdef HAVE_STRCASESTR # define _GNU_SOURCE /* for strcasestr(3) */ #endif #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include #include #include #include #include "defs.h" struct repo_search_data { int npatterns; char **patterns; void *arg; size_t pkgver_len; size_t maxcols; }; static int repo_longest_pkgver(struct xbps_rindex *rpi, void *arg, bool *done) { size_t *len = arg, olen = 0; (void)done; if (*len == 0) { *len = find_longest_pkgver(rpi->xhp, rpi->repod); return 0; } olen = find_longest_pkgver(rpi->xhp, rpi->repod); if (olen > *len) *len = olen; return 0; } static size_t repo_find_longest_pkgver(struct xbps_handle *xhp) { size_t len = 0; xbps_rpool_foreach(xhp, repo_longest_pkgver, &len); return len; } static int repo_search_pkgs_cb(struct xbps_rindex *rpi, void *arg, bool *done) { prop_array_t allkeys; prop_dictionary_t pkgd; prop_dictionary_keysym_t ksym; struct repo_search_data *rsd = arg; const char *pkgver, *pkgname, *desc, *inststr; char tmp[255], *out = NULL; size_t i, j, len, maxcols; int x; (void)done; maxcols = rsd->maxcols - 4; /* - "...\n" */ allkeys = prop_dictionary_all_keys(rpi->repod); for (i = 0; i < prop_array_count(allkeys); i++) { ksym = prop_array_get(allkeys, i); pkgd = prop_dictionary_get_keysym(rpi->repod, ksym); prop_dictionary_get_cstring_nocopy(pkgd, "pkgname", &pkgname); prop_dictionary_get_cstring_nocopy(pkgd, "pkgver", &pkgver); prop_dictionary_get_cstring_nocopy(pkgd, "short_desc", &desc); for (x = 0; x < rsd->npatterns; x++) { if ((xbps_pkgpattern_match(pkgver, rsd->patterns[x])) || (xbps_pkgpattern_match(desc, rsd->patterns[x])) || (strcasecmp(pkgname, rsd->patterns[x]) == 0) || (strcasestr(pkgver, rsd->patterns[x])) || (strcasestr(desc, rsd->patterns[x]))) { strncpy(tmp, pkgver, sizeof(tmp)); for (j = strlen(tmp); j < rsd->pkgver_len; j++) tmp[j] = ' '; tmp[j] = '\0'; if (xbps_pkgdb_get_pkg(rpi->xhp, pkgver)) inststr = "[*]"; else inststr = "[-]"; len = strlen(inststr) + strlen(tmp) + strlen(desc); if (len > maxcols) { out = malloc(maxcols); assert(out); snprintf(out, maxcols, "%s %s %s", inststr, tmp, desc); printf("%s...\n", out); free(out); } else { printf("%s %s %s\n", inststr, tmp, desc); } } } } prop_object_release(allkeys); return 0; } int repo_search(struct xbps_handle *xhp, int npatterns, char **patterns) { struct repo_search_data rsd; int rv; rsd.npatterns = npatterns; rsd.patterns = patterns; rsd.pkgver_len = repo_find_longest_pkgver(xhp); rsd.maxcols = get_maxcols(); rv = xbps_rpool_foreach(xhp, repo_search_pkgs_cb, &rsd); if (rv != 0 && rv != ENOTSUP) fprintf(stderr, "Failed to initialize rpool: %s\n", strerror(rv)); return rv; }