Searched defs:search (Results 1 - 25 of 28) sorted by relevance

12

/ast/src/lib/libjcl/
H A Dfind.c23 * jcl file search
203 search(Jcl_t* jcl, const char* dir, const char* name, unsigned long flags, struct stat* st) function
283 if (s = search(jcl, NiL, name, flags, &st))
/ast/src/lib/libtk/generic/
H A DtkTextIndex.c213 TkTextSearch search;
268 TkBTreeStartSearch(&first, &last, tagPtr, &search);
269 if (!TkBTreeCharTagged(&first, tagPtr) && !TkBTreeNextTag(&search)) {
276 *indexPtr = search.curIndex;
278 while (TkBTreeNextTag(&search)) {
279 *indexPtr = search.curIndex;
209 TkTextSearch search; local
H A DtkTextMark.c110 Tcl_HashSearch search;
165 for (hPtr = Tcl_FirstHashEntry(&textPtr->markTable, &search);
166 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
614 Tcl_HashSearch search;
627 &search); hPtr != markPtr->body.mark.hPtr;
628 hPtr = Tcl_NextHashEntry(&search)) {
109 Tcl_HashSearch search; local
604 Tcl_HashSearch search; local
H A DtkImage.c155 Tcl_HashSearch search;
290 for (hPtr = Tcl_FirstHashEntry(&winPtr->mainPtr->imageTable, &search);
291 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
752 Tcl_HashSearch search;
756 for (hPtr = Tcl_FirstHashEntry(&mainPtr->imageTable, &search);
757 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
153 Tcl_HashSearch search; local
741 Tcl_HashSearch search; local
H A DtkTextTag.c511 Tcl_HashSearch search;
516 for (i = 0, hPtr = Tcl_FirstHashEntry(&textPtr->tagTable, &search);
517 hPtr != NULL; i++, hPtr = Tcl_NextHashEntry(&search)) {
565 * The search below is a bit tricky. Rather than use the B-tree
566 * facilities to stop the search at index2, let it search up
571 * search because the end of the range is after index2.
641 * The search below is a bit weird. The previous toggle can be
643 * need to turn around and search forward for the end toggle.
1061 Tcl_HashSearch search;
510 Tcl_HashSearch search; local
1054 Tcl_HashSearch search; local
[all...]
H A DtkTextWind.c282 Tcl_HashSearch search;
290 for (hPtr = Tcl_FirstHashEntry(&textPtr->windowTable, &search);
291 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
281 Tcl_HashSearch search; local
H A DtkCanvPs.c163 Tcl_HashSearch search;
385 for (hPtr = Tcl_FirstHashEntry(&psInfo.fontTable, &search);
386 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
416 for (hPtr = Tcl_FirstHashEntry(&psInfo.fontTable, &search);
417 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
162 Tcl_HashSearch search; local
H A DtkCanvas.c26 * The structure defined below is used to keep track of a tag search
33 Tk_Uid tag; /* Tag to search for. 0 means return
397 TagSearch search;
432 for (itemPtr = StartTagSearch(canvasPtr, argv[i], &search);
433 itemPtr != NULL; itemPtr = NextItem(&search)) {
633 itemPtr = StartTagSearch(canvasPtr, argv[2], &search);
713 for (itemPtr = StartTagSearch(canvasPtr, argv[2], &search);
714 itemPtr != NULL; itemPtr = NextItem(&search)) {
751 for (itemPtr = StartTagSearch(canvasPtr, argv[i], &search);
752 itemPtr != NULL; itemPtr = NextItem(&search)) {
395 TagSearch search; local
2397 TagSearch search; local
2698 TagSearch search; local
[all...]
H A DtkText.c622 } else if ((c == 's') && (strcmp(argv[1], "search") == 0)
639 "dlineinfo, get, index, insert, mark, scan, search, see, ",
674 Tcl_HashSearch search;
688 for (hPtr = Tcl_FirstHashEntry(&textPtr->tagTable, &search);
689 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
694 for (hPtr = Tcl_FirstHashEntry(&textPtr->markTable, &search);
695 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
869 TkTextSearch search;
875 TkBTreeStartSearch(&first, &last, textPtr->selTagPtr, &search);
877 || TkBTreeNextTag(&search)) {
671 Tcl_HashSearch search; local
865 TkTextSearch search; local
1287 TkTextSearch search; local
[all...]
H A DtkTextBTree.c905 * Search up the tree for the next node, then search down from that
969 * Search up the tree for the previous node, then search down from that
1178 TkTextSearch search;
1212 TkBTreeStartSearch(index1Ptr, index2Ptr, tagPtr, &search);
1214 while (TkBTreeNextTag(&search)) {
1216 segPtr = search.segPtr;
1217 prevPtr = search.curIndex.linePtr->segPtr;
1219 search.curIndex.linePtr->segPtr = segPtr->nextPtr;
1227 ChangeNodeToggleCount(search.curIndex.linePtr->parentPtr,
1246 if (cleanupLinePtr != search
1163 TkTextSearch search; local
2526 Tcl_HashSearch search; local
[all...]
H A DtkBind.c767 Tcl_HashSearch search;
774 for (hPtr = Tcl_FirstHashEntry(&bindPtr->patternTable, &search);
775 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
2365 Tcl_HashSearch search;
2368 hPtr = Tcl_FirstHashEntry(&vetPtr->patternTable, &search);
2369 for ( ; hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
2379 hPtr = Tcl_FirstHashEntry(&vetPtr->virtualTable, &search);
2380 for ( ; hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
2737 Tcl_HashSearch search;
2742 hPtr = Tcl_FirstHashEntry(&vetPtr->virtualTable, &search);
763 Tcl_HashSearch search; local
2348 Tcl_HashSearch search; local
2716 Tcl_HashSearch search; local
[all...]
H A DtkTextDisp.c2625 TkTextSearch search;
2653 * Initialize a search through all transitions on the tag, starting
2658 TkBTreeStartSearch(index1Ptr, index2Ptr, tagPtr, &search);
2660 * Make our own curIndex because at this point search.curIndex
2667 if (!TkBTreeNextTag(&search)) {
2670 curIndexPtr = &search.curIndex;
2687 * state. At the top of the loop, search contains information about
2719 if (!TkBTreeNextTag(&search)) {
2722 curIndexPtr = &search.curIndex;
2743 if (!TkBTreeNextTag(&search)) {
2610 TkTextSearch search; local
[all...]
/ast/src/cmd/dsslib/ip_t/
H A Div-flat.c41 int search; /* during search, use a faster compare */ member in struct:Flat_s
84 /* during search, we are looking for a segment containing some point.
114 if (fl->search)
118 fl->search = 0;
216 if (!fl->search)
220 fl->search = 1;
237 if (!fl->search)
241 fl->search = 1;
258 fl->search
[all...]
/ast/src/lib/libtksh/src/
H A Dbasic.c500 Tcl_HashSearch search;
531 for (hPtr = Tcl_FirstHashEntry(&iPtr->mathFuncTable, &search);
533 hPtr = Tcl_NextHashEntry(&search)) {
546 for (hPtr = Tcl_FirstHashEntry(hTablePtr, &search);
548 hPtr = Tcl_FirstHashEntry(hTablePtr, &search)) {
493 Tcl_HashSearch search; local
H A Dcommands.c309 Tcl_HashSearch search; local
367 for (hPtr = Tcl_FirstHashEntry(&iPtr->commandTable, &search);
368 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
495 for (hPtr = Tcl_FirstHashEntry(&iPtr->globalTable, &search);
496 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
642 for (hPtr = Tcl_FirstHashEntry(&iPtr->varFramePtr->varTable, &search);
643 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
700 for (hPtr = Tcl_FirstHashEntry(&iPtr->commandTable, &search);
701 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
778 for (hPtr = Tcl_FirstHashEntry(tablePtr, &search);
[all...]
/ast/src/lib/libtksh/tcl/
H A DtclPkg.c307 Tcl_HashSearch search;
392 for (hPtr = Tcl_FirstHashEntry(tablePtr, &search); hPtr != NULL;
393 hPtr = Tcl_NextHashEntry(&search)) {
583 Tcl_HashSearch search;
587 for (hPtr = Tcl_FirstHashEntry(&iPtr->packageTable, &search);
588 hPtr != NULL; hPtr = Tcl_NextHashEntry(&search)) {
304 Tcl_HashSearch search; local
578 Tcl_HashSearch search; local
/ast/src/lib/libpp/
H A Dppsearch.c25 * include file search support
30 #define SEARCH_NEXT (SEARCH_USER<<1)/* search for next (uncover) */
75 message((-3, "search: %s: status=%s%s test=%s", fp->name, status == INC_CLEAR ? "[CLEAR]" : status == INC_TEST ? "[ONCE]" : status == INC_IGNORE ? "[IGNORE]" : status->name, (pp.mode & HOSTED) ? "[HOSTED]" : "", test == INC_CLEAR ? "[CLEAR]" : test == INC_TEST ? "[TEST]" : test->name));
107 * search for file using directories in dp
111 search(register struct ppfile* fp, register struct ppdirs* dp, int type, int flags) function
132 message((-3, "search: %s %s%s%s%s%s%s type=%s prefix=%s flags=|%s%s%s%s%s%s start=%s=\"%s\" pre=%s lcl=%s vnd=%s std=%s cur=%s",
164 message((-3, "search: fp=%s need=%02x index=%d dp=%s type=%02x index=%d", fp->name, need, index, dp->name, dp->type, dp->index));
172 message((-3, "search: omit %s", dp->name));
350 message((-3, "search: omit %s", t));
397 message((-3, "search
[all...]
/ast/src/cmd/3d/
H A Dlib.c292 if (!(map = search(&state.vmount, path, strlen(path), NiL, T_PREFIX)) || ((Mount_t*)map->val)->fs == state.fs)
337 * valsize==T_PREFIX for longest path prefix search and val==visit_mask
341 search(Table_t* tab, const char* key, int keysize, const char* val, int valsize) function
H A Dlib_3d.h75 #define search _3d_search macro
/ast/src/cmd/coshell/
H A Dschedule.c72 * search for name in the shell table
79 search(int op, char* name, register Coattr_t* a, Coattr_t* d) function
233 message((-6, "search: %s name=%s misc=%s matched=%d", ap->name, (a->set & SETNAME) ? a->name : "*", ((a->set | op) & (SETMISC|DEF|NEW|SET)) == SETMISC ? a->misc : "*", matched));
578 search(op, s, NiL, NiL);
/ast/src/lib/libast/misc/
H A Dfts.c250 * search trees with top-down splaying (a la Tarjan and Sleator)
258 search(FTSENT* e, FTSENT* root, int(*comparf)(FTSENT* const*, FTSENT* const*), int insert) function
698 root = search(f, root, fts->comparf, 1);
935 if ((fts->diroot = search(f, fts->diroot, statcmp, 0)) != f || f->fts_level > 0 && (t = f) && statcmp(&t, &f->fts_parent) == 0)
1091 fts->root = search(f, fts->root, fts->comparf, 1);
1193 fts->diroot = search(f, fts->diroot, statcmp, 0);
/ast/src/cmd/ie/
H A Demacs.c170 static void search();
589 search(out,count);
928 /* search back for character */
1078 search(out,direction) function
H A Dvi.c132 #define lsearch editb.e_search /* last search string */
174 #define SEARCH -45 /* search flag */
209 static int search();
856 switch( search(c) )
1771 int opflag; /* search optimize flag */
1829 /*** attempt to optimize search somewhat to find ***/
2056 * mode = '/' require search string and search new to old
2057 * mode = '?' require search string and search ol
2064 search(mode) function
[all...]
/ast/src/cmd/tests/cdt/
H A Dtvsharemem.c26 /* Test insert/delete/search in shared/persistent memory region. */
74 int srch; /* #seen by a search process */
271 int i, k, p, num, base, insert, delete, search, unsrch, undel, unins, walk, first, size; local
306 walk = first = insert = delete = search = unsrch = unins = undel = 0;
416 { search += 1;
433 tinfo("%s %s [num=%d,pid=%d]: done, dtsize=%d search=%d[+%d]",
434 actor, type, num, pid, size, search, unsrch);
455 obj.dval = o->dval; /* for next search */
619 terror("parent %s [pid=%d]: object %d has wrong search count %d",
/ast/src/cmd/ksh93/edit/
H A Demacs.c173 static void search(Emacs_t*,genchar*,int);
614 search(ep,out,count);
1028 /* search back for character */
1232 static void search(Emacs_t* ep,genchar *out,int direction) function

Completed in 413 milliseconds

12