Lines Matching defs:of
3 * Copyright (C) 1990, 1993 Regents of The University of Michigan
15 * This implementation bypasses most of adouble/libatalk stuff as long as
24 * the use of cnidscheme:dbd for the searched volume, the new functionality
110 * stack-like structure. The structure below is one item of directory stack.
114 cnid_t ds_did; /* CNID of this directory */
120 static int save_cidx = -1; /* Saved index of currently scanned directory. */
161 /* Removes checked items from top of directory stack. Returns index of the first unchecked elements or -1. */
181 /* Looks up for an opened adouble structure, opens resource fork of selected file.
188 struct ofork *of;
196 if (!isdir && (of = of_findname(vol, path))) {
197 adp = of->of_ad;
288 /* Kind of optimization:
474 * @param rmatches (r) maximum number of matches we can return
477 * @param nrecs (w) number of matches
478 * @param rsize (w) length of data written to output buffer
493 struct dir *currentdir; /* struct dir of current directory */
645 /* Number of matches limit */
692 * @param uname (r) UNIX name of object to search
693 * @param rmatches (r) maximum number of matches we can return
696 * @param nrecs (w) number of matches
697 * @param rsize (w) length of data written to output buffer
810 /* Number of matches limit */