3 * Copyright (C) 1990, 1993 Regents of The University of Michigan
4 * All Rights Reserved. See COPYRIGHT
9 * This file contains FPCatSearch implementation. FPCatSearch performs
10 * file/directory search based on specified criteria. It is used by client
11 * to perform fast searches on (propably) big volumes. So, it has to be
14 * This implementation bypasses most of adouble/libatalk stuff as long as
15 * possible and does a standard filesystem search. It calls higher-level
16 * libatalk/afpd functions only when it is really needed, mainly while
17 * returning some non-UNIX information or filtering by non-UNIX criteria.
19 * Initial version written by Rafal Lewczuk <rlewczuk@pronet.pl>
25 #endif /* HAVE_CONFIG_H */
38 #define memcpy(d,s,n) bcopy ((s), (d), (n))
39 #define memmove(d,s,n) bcopy ((s), (d), (n))
40 #endif /* ! HAVE_MEMCPY */
44 #include <netinet/in.h>
46 #include <atalk/afp.h>
47 #include <atalk/adouble.h>
48 #include <atalk/logger.h>
50 #include <atalk/cnid.h>
52 #include <atalk/util.h>
55 #include "directory.h"
66 u_int16_t attrs; /* File attributes (high 8 bits)*/
67 u_int16_t label; /* Label (low 8 bits )*/
68 char reserved[22]; /* Unknown (at least for now...) */
71 typedef char packed_finder[ADEDLEN_FINDERI];
74 * 0x04 - has a custom icon
75 * 0x20 - name/icon is locked
89 /* This is our search-criteria structure. */
91 u_int32_t rbitmap; /* Request bitmap - which values should we check ? */
92 u_int16_t fbitmap, dbitmap; /* file & directory bitmap - which values should we return ? */
93 u_int16_t attr; /* File attributes */
94 time_t cdate; /* Creation date */
95 time_t mdate; /* Last modification date */
96 time_t bdate; /* Last backup date */
97 u_int32_t pdid; /* Parent DID */
98 u_int16_t offcnt; /* Offspring count */
99 struct finderinfo finfo; /* Finder info */
100 char lname[64]; /* Long name */
101 char utf8name[514]; /* UTF8 or UCS2 name */ /* for convert_charset dest_len parameter +2 */
105 * Directory tree search is recursive by its nature. But AFP specification
106 * requires FPCatSearch to pause after returning n results and be able to
107 * resume the search later. So we have to do recursive search using flat
108 * (iterative) algorithm and remember all directories to look into in an
109 * stack-like structure. The structure below is one item of directory stack.
113 struct dir *dir; /* Structure describing this directory */
114 int pidx; /* Parent's dsitem structure index. */
115 int checked; /* Have we checked this directory ? */
117 char *path; /* absolute UNIX path to this directory */
122 static int save_cidx = -1; /* Saved index of currently scanned directory. */
124 static struct dsitem *dstack = NULL; /* Directory stack data... */
125 static int dssize = 0; /* Directory stack (allocated) size... */
126 static int dsidx = 0; /* First free item index... */
128 static struct scrit c1, c2; /* search criteria */
130 /* Puts new item onto directory stack. */
131 static int addstack(char *uname, struct dir *dir, int pidx)
136 /* check if we have some space on stack... */
137 if (dsidx >= dssize) {
139 dstack = realloc(dstack, dssize * sizeof(struct dsitem));
144 /* Put new element. Allocate and copy lname and path. */
145 ds = dstack + dsidx++;
150 l = dstack[pidx].path_len;
151 u = strlen(uname) +1;
152 if (!(ds->path = malloc(l + u + 1) ))
154 memcpy(ds->path, dstack[pidx].path, l);
156 memcpy(&ds->path[l+1], uname, u);
160 ds->path = strdup(uname);
161 ds->path_len = strlen(uname);
166 /* Removes checked items from top of directory stack. Returns index of the first unchecked elements or -1. */
167 static int reducestack(void)
170 if (save_cidx != -1) {
177 if (dstack[dsidx-1].checked) {
179 free(dstack[dsidx].path);
186 /* Clears directory stack. */
187 static void clearstack(void)
192 free(dstack[dsidx].path);
196 /* Looks up for an opened adouble structure, opens resource fork of selected file.
197 * FIXME What about noadouble?
199 static struct adouble *adl_lkup(struct vol *vol, struct path *path, struct adouble *adp)
201 static struct adouble ad;
209 isdir = S_ISDIR(path->st.st_mode);
211 if (!isdir && (of = of_findname(path))) {
214 ad_init(&ad, vol->v_adouble, vol->v_ad_options);
218 if ( ad_metadata( path->u_name, ((isdir) ? ADFLAGS_DIR : 0), adp) < 0 ) {
219 adp = NULL; /* FIXME without resource fork adl_lkup will be call again */
225 /* -------------------- */
226 static struct finderinfo *unpack_buffer(struct finderinfo *finfo, char *buffer)
228 memcpy(&finfo->f_type, buffer +FINDERINFO_FRTYPEOFF, sizeof(finfo->f_type));
229 memcpy(&finfo->creator, buffer +FINDERINFO_FRCREATOFF, sizeof(finfo->creator));
230 memcpy(&finfo->attrs, buffer +FINDERINFO_FRFLAGOFF, sizeof(finfo->attrs));
231 memcpy(&finfo->label, buffer +FINDERINFO_FRFLAGOFF, sizeof(finfo->label));
232 finfo->attrs &= 0xff00; /* high 8 bits */
233 finfo->label &= 0xff; /* low 8 bits */
238 /* -------------------- */
239 static struct finderinfo *
240 unpack_finderinfo(struct vol *vol, struct path *path, struct adouble **adp, struct finderinfo *finfo, int islnk)
245 *adp = adl_lkup(vol, path, *adp);
246 ptr = get_finderinfo(vol, path->u_name, *adp, &buf,islnk);
247 return unpack_buffer(finfo, ptr);
250 /* -------------------- */
251 #define CATPBIT_PARTIAL 31
252 /* Criteria checker. This function returns a 2-bit value. */
253 /* bit 0 means if checked file meets given criteria. */
254 /* bit 1 means if it is a directory and we should descent into it. */
256 * fname - our fname (translated to UNIX)
257 * cidx - index in directory stack
259 static int crit_check(struct vol *vol, struct path *path) {
261 u_int16_t attr, flags = CONV_PRECOMPOSE;
262 struct finderinfo *finfo = NULL, finderinfo;
263 struct adouble *adp = NULL;
264 time_t c_date, b_date;
265 u_int32_t ac_date, ab_date;
266 static char convbuf[514]; /* for convert_charset dest_len parameter +2 */
269 islnk=S_ISLNK(path->st.st_mode);
271 if (S_ISDIR(path->st.st_mode)) {
279 /* compute the Mac name
280 * first try without id (it's slow to find it)
281 * An other option would be to call get_id in utompath but
282 * we need to pass parent dir
284 if (!(path->m_name = utompath(vol, path->u_name, 0 , utf8_encoding()) )) {
285 /*retry with the right id */
289 adp = adl_lkup(vol, path, adp);
290 id = get_id(vol, adp, &path->st, path->d_dir->d_did, path->u_name, strlen(path->u_name));
295 /* save the id for getfilparm */
297 if (!(path->m_name = utompath(vol, path->u_name, id , utf8_encoding()))) {
303 /* Kind of optimization:
304 * -- first check things we've already have - filename
305 * -- last check things we get from ad_open()
306 * FIXME strmcp strstr (icase)
309 /* Check for filename */
310 if ((c1.rbitmap & (1<<DIRPBIT_LNAME))) {
311 if ( (size_t)(-1) == (len = convert_string(vol->v_maccharset, CH_UCS2, path->m_name, -1, convbuf, 512)) )
314 if ((c1.rbitmap & (1<<CATPBIT_PARTIAL))) {
315 if (strcasestr_w( (ucs2_t*) convbuf, (ucs2_t*) c1.lname) == NULL)
318 if (strcasecmp_w((ucs2_t*) convbuf, (ucs2_t*) c1.lname) != 0)
322 if ((c1.rbitmap & (1<<FILPBIT_PDINFO))) {
323 if ( (size_t)(-1) == (len = convert_charset( CH_UTF8_MAC, CH_UCS2, CH_UTF8, path->m_name, strlen(path->m_name), convbuf, 512, &flags))) {
327 if (c1.rbitmap & (1<<CATPBIT_PARTIAL)) {
328 if (strcasestr_w((ucs2_t *) convbuf, (ucs2_t*)c1.utf8name) == NULL)
331 if (strcasecmp_w((ucs2_t *)convbuf, (ucs2_t*)c1.utf8name) != 0)
337 if ((unsigned)c2.mdate > 0x7fffffff)
338 c2.mdate = 0x7fffffff;
339 if ((unsigned)c2.cdate > 0x7fffffff)
340 c2.cdate = 0x7fffffff;
341 if ((unsigned)c2.bdate > 0x7fffffff)
342 c2.bdate = 0x7fffffff;
344 /* Check for modification date */
345 if ((c1.rbitmap & (1<<DIRPBIT_MDATE))) {
346 if (path->st.st_mtime < c1.mdate || path->st.st_mtime > c2.mdate)
350 /* Check for creation date... */
351 if ((c1.rbitmap & (1<<DIRPBIT_CDATE))) {
352 c_date = path->st.st_mtime;
353 adp = adl_lkup(vol, path, adp);
354 if (adp && ad_getdate(adp, AD_DATE_CREATE, &ac_date) >= 0)
355 c_date = AD_DATE_TO_UNIX(ac_date);
357 if (c_date < c1.cdate || c_date > c2.cdate)
361 /* Check for backup date... */
362 if ((c1.rbitmap & (1<<DIRPBIT_BDATE))) {
363 b_date = path->st.st_mtime;
364 adp = adl_lkup(vol, path, adp);
365 if (adp && ad_getdate(adp, AD_DATE_BACKUP, &ab_date) >= 0)
366 b_date = AD_DATE_TO_UNIX(ab_date);
368 if (b_date < c1.bdate || b_date > c2.bdate)
372 /* Check attributes */
373 if ((c1.rbitmap & (1<<DIRPBIT_ATTR)) && c2.attr != 0) {
374 if ((adp = adl_lkup(vol, path, adp))) {
375 ad_getattr(adp, &attr);
376 if ((attr & c2.attr) != c1.attr)
382 /* Check file type ID */
383 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.f_type != 0) {
384 finfo = unpack_finderinfo(vol, path, &adp, &finderinfo,islnk);
385 if (finfo->f_type != c1.finfo.f_type)
389 /* Check creator ID */
390 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.creator != 0) {
392 finfo = unpack_finderinfo(vol, path, &adp, &finderinfo,islnk);
394 if (finfo->creator != c1.finfo.creator)
398 /* Check finder info attributes */
399 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.attrs != 0) {
401 finfo = unpack_finderinfo(vol, path, &adp, &finderinfo,islnk);
404 if ((finfo->attrs & c2.finfo.attrs) != c1.finfo.attrs)
409 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.label != 0) {
411 finfo = unpack_finderinfo(vol, path, &adp, &finderinfo,islnk);
413 if ((finfo->label & c2.finfo.label) != c1.finfo.label)
416 /* FIXME: Attributes check ! */
418 /* All criteria are met. */
422 ad_close_metadata(adp);
426 /* ------------------------------ */
427 static int rslt_add ( struct vol *vol, struct path *path, char **buf, int ext)
433 u_int16_t resultsize;
434 int isdir = S_ISDIR(path->st.st_mode);
436 /* Skip resultsize */
438 p += sizeof(resultsize);
443 *p++ = isdir ? FILDIRBIT_ISDIR : FILDIRBIT_ISFILE; /* IsDir ? */
450 ret = getdirparams(vol, c1.dbitmap, path, path->d_dir, p , &tbuf );
453 /* FIXME slow if we need the file ID, we already know it, done ? */
454 ret = getfilparams ( vol, c1.fbitmap, path, path->d_dir, p, &tbuf);
460 /* Make sure entry length is even */
467 resultsize = htons(tbuf);
468 memcpy ( *buf, &resultsize, sizeof(resultsize) );
480 "./../.AppleDouble/.AppleDB/Network Trash Folder/TheVolumeSettingsFolder/TheFindByContentFolder/.AppleDesktop/.Parent/"
482 /* This function performs search. It is called directly from afp_catsearch
483 * vol - volume we are searching on ...
484 * dir - directory we are starting from ...
485 * c1, c2 - search criteria
486 * rmatches - maximum number of matches we can return
487 * pos - position we've stopped recently
488 * rbuf - output buffer
489 * rbuflen - output buffer length
491 #define NUM_ROUNDS 200
492 static int catsearch(struct vol *vol, struct dir *dir,
493 int rmatches, u_int32_t *pos, char *rbuf, u_int32_t *nrecs, int *rsize, int ext)
495 static u_int32_t cur_pos; /* Saved position index (ID) - used to remember "position" across FPCatSearch calls */
496 static DIR *dirpos; /* UNIX structure describing currently opened directory. */
498 struct dirent *entry;
502 char *vpath = vol->v_path;
505 int num_rounds = NUM_ROUNDS;
510 if (*pos != 0 && *pos != cur_pos) {
511 result = AFPERR_CATCHNG;
515 /* FIXME: Category "offspring count ! */
518 /* We need to initialize all mandatory structures/variables and change working directory appropriate... */
521 if (dirpos != NULL) {
526 if (addstack(vpath, dir, -1) == -1) {
527 result = AFPERR_MISC;
530 /* FIXME: Sometimes DID is given by client ! (correct this one above !) */
533 /* Save current path */
534 if ((cwd = open(".", O_RDONLY)) < 0) {
535 result = AFPERR_MISC;
539 /* So we are beginning... */
540 start_time = time(NULL);
542 while ((cidx = reducestack()) != -1) {
545 error = lchdir(vol, dstack[cidx].path);
547 if (!error && dirpos == NULL) {
548 dirpos = opendir(".");
549 cached = (dstack[cidx].dir->d_child != NULL);
551 if (error || dirpos == NULL) {
554 dstack[cidx].checked = 1;
559 result = AFPERR_NFILE;
564 result = AFPERR_MISC;
565 } /* switch (errno) */
569 while ((entry=readdir(dirpos)) != NULL) {
572 if (!check_dirent(vol, entry->d_name))
575 memset(&path, 0, sizeof(path));
576 path.u_name = entry->d_name;
577 if (of_stat(&path) != 0) {
588 result = AFPERR_MISC;
592 if (S_ISDIR(path.st.st_mode)) {
593 /* here we can short cut
594 ie if in the same loop the parent dir wasn't in the cache
595 ALL dirsearch_byname will fail.
598 path.d_dir = dirsearch_byname(vol, dstack[cidx].dir, path.u_name);
602 /* path.m_name is set by adddir */
603 if (NULL == (path.d_dir = adddir( vol, dstack[cidx].dir, &path) ) ) {
604 result = AFPERR_MISC;
608 path.m_name = path.d_dir->d_m_name;
610 if (addstack(path.u_name, path.d_dir, cidx) == -1) {
611 result = AFPERR_MISC;
616 /* yes it sucks for directory d_dir is the directory, for file it's the parent directory*/
617 path.d_dir = dstack[cidx].dir;
619 ccr = crit_check(vol, &path);
621 /* bit 0 means that criteria has been met */
623 r = rslt_add ( vol, &path, &rrbuf, ext);
626 result = AFPERR_MISC;
630 /* Number of matches limit */
632 goto catsearch_pause;
633 /* Block size limit */
634 if (rrbuf - rbuf >= 448)
635 goto catsearch_pause;
637 /* MacOS 9 doesn't like servers executing commands longer than few seconds */
638 if (--num_rounds <= 0) {
639 if (start_time != time(NULL)) {
641 goto catsearch_pause;
643 num_rounds = NUM_ROUNDS;
645 } /* while ((entry=readdir(dirpos)) != NULL) */
648 dstack[cidx].checked = 1;
649 } /* while (current_idx = reducestack()) != -1) */
651 /* We have finished traversing our tree. Return EOF here. */
659 catsearch_end: /* Exiting catsearch: error condition */
660 *rsize = rrbuf - rbuf;
662 if ((fchdir(cwd)) != 0) {
663 LOG(log_debug, logtype_afpd, "error chdiring back: %s", strerror(errno));
670 /* -------------------------- */
671 static int catsearch_afp(AFPObj *obj _U_, char *ibuf, size_t ibuflen,
672 char *rbuf, size_t *rbuflen, int ext)
677 u_int32_t rmatches, reserved;
682 unsigned char *spec1, *spec2, *bspec1, *bspec2;
690 /* min header size */
695 memset(&c1, 0, sizeof(c1));
696 memset(&c2, 0, sizeof(c2));
699 memcpy(&vid, ibuf, sizeof(vid));
702 if ((vol = getvolbyvid(vid)) == NULL) {
706 memcpy(&rmatches, ibuf, sizeof(rmatches));
707 rmatches = ntohl(rmatches);
708 ibuf += sizeof(rmatches);
710 /* FIXME: (rl) should we check if reserved == 0 ? */
711 ibuf += sizeof(reserved);
713 memcpy(catpos, ibuf, sizeof(catpos));
714 ibuf += sizeof(catpos);
716 memcpy(&c1.fbitmap, ibuf, sizeof(c1.fbitmap));
717 c1.fbitmap = c2.fbitmap = ntohs(c1.fbitmap);
718 ibuf += sizeof(c1.fbitmap);
720 memcpy(&c1.dbitmap, ibuf, sizeof(c1.dbitmap));
721 c1.dbitmap = c2.dbitmap = ntohs(c1.dbitmap);
722 ibuf += sizeof(c1.dbitmap);
724 memcpy(&c1.rbitmap, ibuf, sizeof(c1.rbitmap));
725 c1.rbitmap = c2.rbitmap = ntohl(c1.rbitmap);
726 ibuf += sizeof(c1.rbitmap);
728 if (! (c1.fbitmap || c1.dbitmap)) {
729 return AFPERR_BITMAP;
733 memcpy(&spec_len, ibuf, sizeof(spec_len));
734 spec_len = ntohs(spec_len);
737 /* with catsearch only name and parent id are allowed */
738 c1.fbitmap &= (1<<FILPBIT_LNAME) | (1<<FILPBIT_PDID);
739 c1.dbitmap &= (1<<DIRPBIT_LNAME) | (1<<DIRPBIT_PDID);
740 spec_len = *(unsigned char*)ibuf;
743 /* Parse file specifications */
744 spec1 = (unsigned char*)ibuf;
745 spec2 = (unsigned char*)ibuf + spec_len + 2;
752 /* File attribute bits... */
753 if (c1.rbitmap & (1 << FILPBIT_ATTR)) {
754 memcpy(&c1.attr, spec1, sizeof(c1.attr));
755 spec1 += sizeof(c1.attr);
756 memcpy(&c2.attr, spec2, sizeof(c2.attr));
757 spec2 += sizeof(c1.attr);
761 if (c1.rbitmap & (1 << FILPBIT_PDID)) {
762 memcpy(&c1.pdid, spec1, sizeof(pdid));
763 spec1 += sizeof(c1.pdid);
764 memcpy(&c2.pdid, spec2, sizeof(pdid));
765 spec2 += sizeof(c2.pdid);
766 } /* FIXME: PDID - do we demarshall this argument ? */
769 if (c1.rbitmap & (1 << FILPBIT_CDATE)) {
770 memcpy(&c1.cdate, spec1, sizeof(c1.cdate));
771 spec1 += sizeof(c1.cdate);
772 c1.cdate = AD_DATE_TO_UNIX(c1.cdate);
773 memcpy(&c2.cdate, spec2, sizeof(c2.cdate));
774 spec2 += sizeof(c1.cdate);
775 ibuf += sizeof(c1.cdate);;
776 c2.cdate = AD_DATE_TO_UNIX(c2.cdate);
779 /* Modification date */
780 if (c1.rbitmap & (1 << FILPBIT_MDATE)) {
781 memcpy(&c1.mdate, spec1, sizeof(c1.mdate));
782 c1.mdate = AD_DATE_TO_UNIX(c1.mdate);
783 spec1 += sizeof(c1.mdate);
784 memcpy(&c2.mdate, spec2, sizeof(c2.mdate));
785 c2.mdate = AD_DATE_TO_UNIX(c2.mdate);
786 spec2 += sizeof(c1.mdate);
790 if (c1.rbitmap & (1 << FILPBIT_BDATE)) {
791 memcpy(&c1.bdate, spec1, sizeof(c1.bdate));
792 spec1 += sizeof(c1.bdate);
793 c1.bdate = AD_DATE_TO_UNIX(c1.bdate);
794 memcpy(&c2.bdate, spec2, sizeof(c2.bdate));
795 spec2 += sizeof(c2.bdate);
796 c1.bdate = AD_DATE_TO_UNIX(c2.bdate);
800 if (c1.rbitmap & (1 << FILPBIT_FINFO)) {
803 memcpy(buf, spec1, sizeof(buf));
804 unpack_buffer(&c1.finfo, buf);
805 spec1 += sizeof(buf);
807 memcpy(buf, spec2, sizeof(buf));
808 unpack_buffer(&c2.finfo, buf);
809 spec2 += sizeof(buf);
812 if ((c1.rbitmap & (1 << DIRPBIT_OFFCNT)) != 0) {
813 /* Offspring count - only directories */
814 if (c1.fbitmap == 0) {
815 memcpy(&c1.offcnt, spec1, sizeof(c1.offcnt));
816 spec1 += sizeof(c1.offcnt);
817 c1.offcnt = ntohs(c1.offcnt);
818 memcpy(&c2.offcnt, spec2, sizeof(c2.offcnt));
819 spec2 += sizeof(c2.offcnt);
820 c2.offcnt = ntohs(c2.offcnt);
822 else if (c1.dbitmap == 0) {
823 /* ressource fork length */
826 return AFPERR_BITMAP; /* error */
828 } /* Offspring count/ressource fork length */
831 if (c1.rbitmap & (1 << FILPBIT_LNAME)) {
832 /* Get the long filename */
833 memcpy(tmppath, bspec1 + spec1[1] + 1, (bspec1 + spec1[1])[0]);
834 tmppath[(bspec1 + spec1[1])[0]]= 0;
835 len = convert_string ( vol->v_maccharset, CH_UCS2, tmppath, -1, c1.lname, sizeof(c1.lname));
836 if (len == (size_t)(-1))
840 /* FIXME: do we need it ? It's always null ! */
841 memcpy(c2.lname, bspec2 + spec2[1] + 1, (bspec2 + spec2[1])[0]);
842 c2.lname[(bspec2 + spec2[1])[0]]= 0;
846 if (c1.rbitmap & (1 << FILPBIT_PDINFO)) {
849 memcpy(&namelen, spec1, sizeof(namelen));
850 namelen = ntohs (namelen);
852 spec1 = bspec1+namelen+4; /* Skip Unicode Hint */
855 memcpy(&namelen, spec1, sizeof(namelen));
856 namelen = ntohs (namelen);
857 if (namelen > 255) /* Safeguard */
860 memcpy (c1.utf8name, spec1+2, namelen);
861 c1.utf8name[(namelen+1)] =0;
863 /* convert charset */
864 flags = CONV_PRECOMPOSE;
865 len = convert_charset(CH_UTF8_MAC, CH_UCS2, CH_UTF8, c1.utf8name, namelen, c1.utf8name, 512, &flags);
866 if (len == (size_t)(-1))
872 ret = catsearch(vol, vol->v_dir, rmatches, &catpos[0], rbuf+24, &nrecs, &rsize, ext);
873 memcpy(rbuf, catpos, sizeof(catpos));
874 rbuf += sizeof(catpos);
876 c1.fbitmap = htons(c1.fbitmap);
877 memcpy(rbuf, &c1.fbitmap, sizeof(c1.fbitmap));
878 rbuf += sizeof(c1.fbitmap);
880 c1.dbitmap = htons(c1.dbitmap);
881 memcpy(rbuf, &c1.dbitmap, sizeof(c1.dbitmap));
882 rbuf += sizeof(c1.dbitmap);
884 nrecs = htonl(nrecs);
885 memcpy(rbuf, &nrecs, sizeof(nrecs));
886 rbuf += sizeof(nrecs);
890 } /* catsearch_afp */
892 /* -------------------------- */
893 int afp_catsearch (AFPObj *obj, char *ibuf, size_t ibuflen,
894 char *rbuf, size_t *rbuflen)
896 return catsearch_afp( obj, ibuf, ibuflen, rbuf, rbuflen, 0);
900 int afp_catsearch_ext (AFPObj *obj, char *ibuf, size_t ibuflen,
901 char *rbuf, size_t *rbuflen)
903 return catsearch_afp( obj, ibuf, ibuflen, rbuf, rbuflen, 1);
906 /* FIXME: we need a clean separation between afp stubs and 'real' implementation */
907 /* (so, all buffer packing/unpacking should be done in stub, everything else
908 should be done in other functions) */