Lines Matching defs:search
162 (void)ctag_search(sp, tp->search, tp->slen, tqp->tag);
202 (void)ctag_search(sp, tp->search, tp->slen, tqp->tag);
476 * We give the file name 20 columns and the search string the rest.
639 if (otp->search != NULL)
648 if (otp->search != NULL)
649 tp->search = tp->buf + (otp->search - otp->buf);
773 tqp->current->search, tqp->current->slen, tqp->tag);
826 msgq_str(sp, M_ERR, tag, "166|%s: search pattern not found");
903 ctag_search(SCR *sp, CHAR_T *search, size_t slen, char *tag)
913 * used a line number, not a search string. I got complaints, so
916 if (ISDIGIT(search[0])) {
917 INT2CHAR(sp, search, slen+1, np, nlen);
931 search, slen, NULL, SEARCH_FILE | SEARCH_TAG)) {
932 INT2CHAR(sp, search, slen, np, nlen);
935 if (f_search(sp, &m, &m, search, slen,
945 * Historically, tags set the search direction if it wasn't
954 * Tags move to the first non-blank, NOT the search pattern start.
1030 char *back, *front, *map, *p, *search, *t;
1063 * because their binary search assumes that there's only one record
1102 /* The rest of the string is the search pattern. */
1103 search = p;
1134 tp->search = (CHAR_T*)(tp->fname + tp->fnlen + 1);
1135 CHAR2INT(sp, search, slen + 1, wp, wlen);
1136 MEMCPY(tp->search, wp, (tp->slen = slen) + 1);
1192 * Binary search for "string" in memory between "front" and "back".
1223 * (back - front), which in turn implies that a linear search will
1226 * Trying to continue with binary search at this point would be