Lines Matching defs:query
279 * There's a twist here: the input query
389 db_query **query = 0;
518 newq = realloc(query, ntq * sizeof (query[0]));
523 myself, ntq * sizeof (query[0]));
526 freeQueries(query, nq);
532 query = newq;
547 query[(nq*i)+j] = cloneQuery(query[j],
549 if (query[(nq*i)+j] == 0 &&
550 query[j] != 0)
562 freeQueries(query, ntq);
575 (void) memset(query, 0, ntq * sizeof (query[0]));
578 query[i] = am(myself, sizeof (*query[i]));
579 if (query[i] == 0) {
583 query[i]->components.components_val =
585 sizeof (query[i]->components.components_val[0]));
586 if (query[i]->components.components_val == 0) {
590 query[i]->components.components_len = 0;
595 freeQueries(query, ntq);
633 * Step through the query array, adding
635 * starting at 'query[j % nrq]'.
652 ic = query[k]->components.
656 * query, the new value is a dup
667 if (query[k]->components.
678 query[k]->components.
688 query[k]->components.
692 if (query[k]->
699 query[k]->components.
706 freeQueries(query, ntq);
722 sfree(query);
723 query = 0;
726 /* Should we filter on index or input query ? */
727 if (query != 0) {
729 query = filterQuery(t, query, qin, &attr, &nq);
731 query = filterQuery(0, query, qin, &attr, &nq);
734 if (query != 0 && numQueries != 0)
742 return (query);
908 * Given an input query 'q', and a db_query work buffer 'qbuf', return
909 * a pointer to a query with one component corresponding to component
912 * Note that no memory is allocated, and that the returned query has