Lines Matching defs:query
580 * There's a twist here: the input query
690 db_query **query = 0;
819 newq = realloc(query, ntq * sizeof (query[0]));
824 myself, ntq * sizeof (query[0]));
827 freeQueries(query, nq);
833 query = newq;
848 query[(nq*i)+j] = cloneQuery(query[j],
850 if (query[(nq*i)+j] == 0 &&
851 query[j] != 0)
863 freeQueries(query, ntq);
876 (void) memset(query, 0, ntq * sizeof (query[0]));
879 query[i] = am(myself, sizeof (*query[i]));
880 if (query[i] == 0) {
884 query[i]->components.components_val =
886 sizeof (query[i]->components.components_val[0]));
887 if (query[i]->components.components_val == 0) {
891 query[i]->components.components_len = 0;
896 freeQueries(query, ntq);
934 * Step through the query array, adding
936 * starting at 'query[j % nrq]'.
953 ic = query[k]->components.
957 * query, the new value is a dup
968 if (query[k]->components.
979 query[k]->components.
989 query[k]->components.
993 if (query[k]->
1000 query[k]->components.
1007 freeQueries(query, ntq);
1023 sfree(query);
1024 query = 0;
1027 /* Should we filter on index or input query ? */
1028 if (query != 0) {
1030 query = filterQuery(t, query, qin, &attr, &nq);
1032 query = filterQuery(0, query, qin, &attr, &nq);
1035 if (query != 0 && numQueries != 0)
1043 return (query);
1209 * Given an input query 'q', and a db_query work buffer 'qbuf', return
1210 * a pointer to a query with one component corresponding to component
1213 * Note that no memory is allocated, and that the returned query has