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 */
39 #define memcpy(d,s,n) bcopy ((s), (d), (n))
40 #define memmove(d,s,n) bcopy ((s), (d), (n))
41 #endif /* ! HAVE_MEMCPY */
45 #include <netinet/in.h>
47 #include <atalk/afp.h>
48 #include <atalk/adouble.h>
49 #include <atalk/logger.h>
51 #include <atalk/cnid.h>
54 #include "directory.h"
65 u_int16_t attrs; /* File attributes (high 8 bits)*/
66 u_int16_t label; /* Label (low 8 bits )*/
67 char reserved[22]; /* Unknown (at least for now...) */
70 typedef char packed_finder[ADEDLEN_FINDERI];
73 * 0x04 - has a custom icon
74 * 0x20 - name/icon is locked
88 /* This is our search-criteria structure. */
90 u_int32_t rbitmap; /* Request bitmap - which values should we check ? */
91 u_int16_t fbitmap, dbitmap; /* file & directory bitmap - which values should we return ? */
92 u_int16_t attr; /* File attributes */
93 time_t cdate; /* Creation date */
94 time_t mdate; /* Last modification date */
95 time_t bdate; /* Last backup date */
96 u_int32_t pdid; /* Parent DID */
97 u_int16_t offcnt; /* Offspring count */
98 struct finderinfo finfo; /* Finder info */
99 char lname[64]; /* Long name */
100 char utf8name[512]; /* UTF8 name */
104 * Directory tree search is recursive by its nature. But AFP specification
105 * requires FPCatSearch to pause after returning n results and be able to
106 * resume the search later. So we have to do recursive search using flat
107 * (iterative) algorithm and remember all directories to look into in an
108 * stack-like structure. The structure below is one item of directory stack.
112 struct dir *dir; /* Structure describing this directory */
113 int pidx; /* Parent's dsitem structure index. */
114 int checked; /* Have we checked this directory ? */
115 char *path; /* absolute UNIX path to this directory */
120 static int cur_pos = 0; /* Saved position index (ID) - used to remember "position" across FPCatSearch calls */
121 static DIR *dirpos = NULL; /* UNIX structure describing currently opened 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++;
149 l = strlen(dstack[pidx].path);
150 if (!(ds->path = malloc(l + strlen(uname) + 2) ))
152 strcpy(ds->path, dstack[pidx].path);
153 strcat(ds->path, "/");
154 strcat(ds->path, uname);
162 /* Removes checked items from top of directory stack. Returns index of the first unchecked elements or -1. */
163 static int reducestack()
166 if (save_cidx != -1) {
173 if (dstack[dsidx-1].checked) {
175 free(dstack[dsidx].path);
182 /* Clears directory stack. */
183 static void clearstack()
188 free(dstack[dsidx].path);
192 /* Looks up for an opened adouble structure, opens resource fork of selected file.
193 * FIXME What about noadouble?
195 static struct adouble *adl_lkup(struct vol *vol, struct path *path, struct adouble *adp)
197 static struct adouble ad;
205 isdir = S_ISDIR(path->st.st_mode);
207 if (!isdir && (of = of_findname(path))) {
210 ad_init(&ad, vol->v_adouble, vol->v_ad_options);
214 if ( ad_metadata( path->u_name, ((isdir)?ADFLAGS_DIR:0), adp) < 0 ) {
215 adp = NULL; /* FIXME without resource fork adl_lkup will be call again */
221 /* -------------------- */
222 static struct finderinfo *unpack_buffer(struct finderinfo *finfo, char *buffer)
224 memcpy(&finfo->f_type, buffer +FINDERINFO_FRTYPEOFF, sizeof(finfo->f_type));
225 memcpy(&finfo->creator, buffer +FINDERINFO_FRCREATOFF, sizeof(finfo->creator));
226 memcpy(&finfo->attrs, buffer +FINDERINFO_FRFLAGOFF, sizeof(finfo->attrs));
227 memcpy(&finfo->label, buffer +FINDERINFO_FRFLAGOFF, sizeof(finfo->label));
228 finfo->attrs &= 0xff00; /* high 8 bits */
229 finfo->label &= 0xff; /* low 8 bits */
234 /* -------------------- */
235 static struct finderinfo *
236 unpack_finderinfo(char *upath, struct adouble *adp, struct finderinfo *finfo)
241 ptr = get_finderinfo(upath, adp, &buf);
242 return unpack_buffer(finfo, ptr);
245 /* -------------------- */
246 #define CATPBIT_PARTIAL 31
247 /* Criteria checker. This function returns a 2-bit value. */
248 /* bit 0 means if checked file meets given criteria. */
249 /* bit 1 means if it is a directory and we should descent into it. */
251 * fname - our fname (translated to UNIX)
252 * cidx - index in directory stack
254 static int crit_check(struct vol *vol, struct path *path) {
256 u_int16_t attr, flags = CONV_PRECOMPOSE;
257 struct finderinfo *finfo = NULL, finderinfo;
258 struct adouble *adp = NULL;
259 time_t c_date, b_date;
260 u_int32_t ac_date, ab_date;
261 static char convbuf[512];
264 if (S_ISDIR(path->st.st_mode)) {
272 /* compute the Mac name
273 * first try without id (it's slow to find it)
274 * An other option would be to call get_id in utompath but
275 * we need to pass parent dir
277 if (!(path->m_name = utompath(vol, path->u_name, 0 , utf8_encoding()) )) {
278 /*retry with the right id */
282 adp = adl_lkup(vol, path, adp);
283 id = get_id(vol, adp, &path->st, path->d_dir->d_did, path->u_name, strlen(path->u_name));
288 /* save the id for getfilparm */
290 if (!(path->m_name = utompath(vol, path->u_name, id , utf8_encoding()))) {
296 /* Kind of optimization:
297 * -- first check things we've already have - filename
298 * -- last check things we get from ad_open()
299 * FIXME strmcp strstr (icase)
302 /* Check for filename */
303 if ((c1.rbitmap & (1<<DIRPBIT_LNAME))) {
304 if ( (size_t)(-1) == (len = convert_string(vol->v_maccharset, CH_UCS2, path->m_name, strlen(path->m_name), convbuf, 512)) )
307 if ((c1.rbitmap & (1<<CATPBIT_PARTIAL))) {
308 if (strcasestr_w( (ucs2_t*) convbuf, (ucs2_t*) c1.lname) == NULL)
311 if (strcasecmp_w((ucs2_t*) convbuf, (ucs2_t*) c1.lname) != 0)
315 if ((c1.rbitmap & (1<<FILPBIT_PDINFO))) {
316 if ( (size_t)(-1) == (len = convert_charset( CH_UTF8_MAC, CH_UCS2, CH_UTF8, path->m_name, strlen(path->m_name), convbuf, 512, &flags))) {
320 if (c1.rbitmap & (1<<CATPBIT_PARTIAL)) {
321 if (strcasestr_w((ucs2_t *) convbuf, (ucs2_t*)c1.utf8name) == NULL)
324 if (strcasecmp_w((ucs2_t *)convbuf, (ucs2_t*)c1.utf8name) != 0)
330 if ((unsigned)c2.mdate > 0x7fffffff)
331 c2.mdate = 0x7fffffff;
332 if ((unsigned)c2.cdate > 0x7fffffff)
333 c2.cdate = 0x7fffffff;
334 if ((unsigned)c2.bdate > 0x7fffffff)
335 c2.bdate = 0x7fffffff;
337 /* Check for modification date */
338 if ((c1.rbitmap & (1<<DIRPBIT_MDATE))) {
339 if (path->st.st_mtime < c1.mdate || path->st.st_mtime > c2.mdate)
343 /* Check for creation date... */
344 if ((c1.rbitmap & (1<<DIRPBIT_CDATE))) {
345 c_date = path->st.st_mtime;
346 adp = adl_lkup(vol, path, adp);
347 if (adp && ad_getdate(adp, AD_DATE_CREATE, &ac_date) >= 0)
348 c_date = AD_DATE_TO_UNIX(ac_date);
350 if (c_date < c1.cdate || c_date > c2.cdate)
354 /* Check for backup date... */
355 if ((c1.rbitmap & (1<<DIRPBIT_BDATE))) {
356 b_date = path->st.st_mtime;
357 adp = adl_lkup(vol, path, adp);
358 if (adp && ad_getdate(adp, AD_DATE_BACKUP, &ab_date) >= 0)
359 b_date = AD_DATE_TO_UNIX(ab_date);
361 if (b_date < c1.bdate || b_date > c2.bdate)
365 /* Check attributes */
366 if ((c1.rbitmap & (1<<DIRPBIT_ATTR)) && c2.attr != 0) {
367 if ((adp = adl_lkup(vol, path, adp))) {
368 ad_getattr(adp, &attr);
369 if ((attr & c2.attr) != c1.attr)
375 /* Check file type ID */
376 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.f_type != 0) {
377 adp = adl_lkup(vol, path, adp);
378 finfo = unpack_finderinfo(path->u_name, adp, &finderinfo);
379 if (finfo->f_type != c1.finfo.f_type)
383 /* Check creator ID */
384 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.creator != 0) {
386 adp = adl_lkup(vol, path, adp);
387 finfo = unpack_finderinfo(path->u_name, adp, &finderinfo);
389 if (finfo->creator != c1.finfo.creator)
393 /* Check finder info attributes */
394 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.attrs != 0) {
396 adp = adl_lkup(vol, path, adp);
397 finfo = unpack_finderinfo(path->u_name, adp, &finderinfo);
400 if ((finfo->attrs & c2.finfo.attrs) != c1.finfo.attrs)
405 if ((c1.rbitmap & (1<<DIRPBIT_FINFO)) && c2.finfo.label != 0) {
407 adp = adl_lkup(vol, path, adp);
408 finfo = unpack_finderinfo(path->u_name, adp, &finderinfo);
410 if ((finfo->label & c2.finfo.label) != c1.finfo.label)
413 /* FIXME: Attributes check ! */
415 /* All criteria are met. */
419 ad_close(adp, ADFLAGS_HF);
423 /* ------------------------------ */
424 static int rslt_add ( struct vol *vol, struct path *path, char **buf, int ext)
429 u_int16_t resultsize;
430 int isdir = S_ISDIR(path->st.st_mode);
432 /* Skip resultsize */
434 p += sizeof(resultsize);
439 *p++ = isdir ? FILDIRBIT_ISDIR : FILDIRBIT_ISFILE; /* IsDir ? */
446 ret = getdirparams(vol, c1.dbitmap, path, path->d_dir, p , &tbuf );
449 /* FIXME slow if we need the file ID, we already know it, done ? */
450 ret = getfilparams ( vol, c1.fbitmap, path, path->d_dir, p, &tbuf);
456 /* Make sure entry length is even */
463 resultsize = htons(tbuf);
464 memcpy ( *buf, &resultsize, sizeof(resultsize) );
476 "./../.AppleDouble/.AppleDB/Network Trash Folder/TheVolumeSettingsFolder/TheFindByContentFolder/.AppleDesktop/.Parent/"
478 /* This function performs search. It is called directly from afp_catsearch
479 * vol - volume we are searching on ...
480 * dir - directory we are starting from ...
481 * c1, c2 - search criteria
482 * rmatches - maximum number of matches we can return
483 * pos - position we've stopped recently
484 * rbuf - output buffer
485 * rbuflen - output buffer length
487 #define NUM_ROUNDS 100
488 static int catsearch(struct vol *vol, struct dir *dir,
489 int rmatches, int *pos, char *rbuf, u_int32_t *nrecs, int *rsize, int ext)
492 struct dirent *entry;
496 char *orig_dir = NULL;
497 int orig_dir_len = 128;
498 char *vpath = vol->v_path;
501 int num_rounds = NUM_ROUNDS;
504 if (*pos != 0 && *pos != cur_pos)
505 return AFPERR_CATCHNG;
507 /* FIXME: Category "offspring count ! */
509 /* So we are beginning... */
510 start_time = time(NULL);
512 /* We need to initialize all mandatory structures/variables and change working directory appropriate... */
515 if (dirpos != NULL) {
520 if (addstack("", dir, -1) == -1) {
521 result = AFPERR_MISC;
524 dstack[0].path = strdup(vpath);
525 /* FIXME: Sometimes DID is given by client ! (correct this one above !) */
528 /* Save current path */
529 orig_dir = (char*)malloc(orig_dir_len);
530 while (getcwd(orig_dir, orig_dir_len-1)==NULL) {
531 if (errno != ERANGE) {
532 result = AFPERR_MISC;
536 orig_dir = realloc(orig_dir, orig_dir_len);
539 while ((cidx = reducestack()) != -1) {
541 if (dirpos == NULL) {
542 dirpos = opendir(dstack[cidx].path);
543 cached = (dstack[cidx].dir->d_child != NULL);
545 if (dirpos == NULL) {
548 dstack[cidx].checked = 1;
553 result = AFPERR_NFILE;
558 result = AFPERR_MISC;
559 } /* switch (errno) */
562 /* FIXME error in chdir, what do we do? */
563 chdir(dstack[cidx].path);
566 while ((entry=readdir(dirpos)) != NULL) {
569 if (!check_dirent(vol, entry->d_name))
572 memset(&path, 0, sizeof(path));
573 path.u_name = entry->d_name;
574 if (of_stat(&path) != 0) {
585 result = AFPERR_MISC;
589 if (S_ISDIR(path.st.st_mode)) {
590 /* here we can short cut
591 ie if in the same loop the parent dir wasn't in the cache
592 ALL dirsearch_byname will fail.
595 path.d_dir = dirsearch_byname(dstack[cidx].dir, path.u_name);
599 /* path.m_name is set by adddir */
600 if (NULL == (path.d_dir = adddir( vol, dstack[cidx].dir, &path) ) ) {
601 result = AFPERR_MISC;
605 path.m_name = path.d_dir->d_m_name;
607 if (addstack(path.u_name, path.d_dir, cidx) == -1) {
608 result = AFPERR_MISC;
613 /* yes it sucks for directory d_dir is the directory, for file it's the parent directory*/
614 path.d_dir = dstack[cidx].dir;
616 ccr = crit_check(vol, &path);
618 /* bit 0 means that criteria has been met */
620 r = rslt_add ( vol, &path, &rrbuf, ext);
623 result = AFPERR_MISC;
627 /* Number of matches limit */
629 goto catsearch_pause;
630 /* Block size limit */
631 if (rrbuf - rbuf >= 448)
632 goto catsearch_pause;
634 /* MacOS 9 doesn't like servers executing commands longer than few seconds */
635 if (--num_rounds <= 0) {
636 if (start_time != time(NULL)) {
638 goto catsearch_pause;
640 num_rounds = NUM_ROUNDS;
642 } /* while ((entry=readdir(dirpos)) != NULL) */
645 dstack[cidx].checked = 1;
646 } /* while (current_idx = reducestack()) != -1) */
648 /* We have finished traversing our tree. Return EOF here. */
656 catsearch_end: /* Exiting catsearch: error condition */
657 *rsize = rrbuf - rbuf;
658 if (orig_dir != NULL) {
665 /* -------------------------- */
666 int catsearch_afp(AFPObj *obj _U_, char *ibuf, int ibuflen,
667 char *rbuf, int *rbuflen, int ext)
672 u_int32_t rmatches, reserved;
677 unsigned char *spec1, *spec2, *bspec1, *bspec2;
685 /* min header size */
690 memset(&c1, 0, sizeof(c1));
691 memset(&c2, 0, sizeof(c2));
694 memcpy(&vid, ibuf, sizeof(vid));
697 if ((vol = getvolbyvid(vid)) == NULL) {
701 memcpy(&rmatches, ibuf, sizeof(rmatches));
702 rmatches = ntohl(rmatches);
703 ibuf += sizeof(rmatches);
705 /* FIXME: (rl) should we check if reserved == 0 ? */
706 ibuf += sizeof(reserved);
708 memcpy(catpos, ibuf, sizeof(catpos));
709 ibuf += sizeof(catpos);
711 memcpy(&c1.fbitmap, ibuf, sizeof(c1.fbitmap));
712 c1.fbitmap = c2.fbitmap = ntohs(c1.fbitmap);
713 ibuf += sizeof(c1.fbitmap);
715 memcpy(&c1.dbitmap, ibuf, sizeof(c1.dbitmap));
716 c1.dbitmap = c2.dbitmap = ntohs(c1.dbitmap);
717 ibuf += sizeof(c1.dbitmap);
719 memcpy(&c1.rbitmap, ibuf, sizeof(c1.rbitmap));
720 c1.rbitmap = c2.rbitmap = ntohl(c1.rbitmap);
721 ibuf += sizeof(c1.rbitmap);
723 if (! (c1.fbitmap || c1.dbitmap)) {
724 return AFPERR_BITMAP;
728 memcpy(&spec_len, ibuf, sizeof(spec_len));
729 spec_len = ntohs(spec_len);
732 /* with catsearch only name and parent id are allowed */
733 c1.fbitmap &= (1<<FILPBIT_LNAME) | (1<<FILPBIT_PDID);
734 c1.dbitmap &= (1<<DIRPBIT_LNAME) | (1<<DIRPBIT_PDID);
735 spec_len = *(unsigned char*)ibuf;
738 /* Parse file specifications */
740 spec2 = ibuf + spec_len + 2;
747 /* File attribute bits... */
748 if (c1.rbitmap & (1 << FILPBIT_ATTR)) {
749 memcpy(&c1.attr, spec1, sizeof(c1.attr));
750 spec1 += sizeof(c1.attr);
751 memcpy(&c2.attr, spec2, sizeof(c2.attr));
752 spec2 += sizeof(c1.attr);
756 if (c1.rbitmap & (1 << FILPBIT_PDID)) {
757 memcpy(&c1.pdid, spec1, sizeof(pdid));
758 spec1 += sizeof(c1.pdid);
759 memcpy(&c2.pdid, spec2, sizeof(pdid));
760 spec2 += sizeof(c2.pdid);
761 } /* FIXME: PDID - do we demarshall this argument ? */
764 if (c1.rbitmap & (1 << FILPBIT_CDATE)) {
765 memcpy(&c1.cdate, spec1, sizeof(c1.cdate));
766 spec1 += sizeof(c1.cdate);
767 c1.cdate = AD_DATE_TO_UNIX(c1.cdate);
768 memcpy(&c2.cdate, spec2, sizeof(c2.cdate));
769 spec2 += sizeof(c1.cdate);
770 ibuf += sizeof(c1.cdate);;
771 c2.cdate = AD_DATE_TO_UNIX(c2.cdate);
774 /* Modification date */
775 if (c1.rbitmap & (1 << FILPBIT_MDATE)) {
776 memcpy(&c1.mdate, spec1, sizeof(c1.mdate));
777 c1.mdate = AD_DATE_TO_UNIX(c1.mdate);
778 spec1 += sizeof(c1.mdate);
779 memcpy(&c2.mdate, spec2, sizeof(c2.mdate));
780 c2.mdate = AD_DATE_TO_UNIX(c2.mdate);
781 spec2 += sizeof(c1.mdate);
785 if (c1.rbitmap & (1 << FILPBIT_BDATE)) {
786 memcpy(&c1.bdate, spec1, sizeof(c1.bdate));
787 spec1 += sizeof(c1.bdate);
788 c1.bdate = AD_DATE_TO_UNIX(c1.bdate);
789 memcpy(&c2.bdate, spec2, sizeof(c2.bdate));
790 spec2 += sizeof(c2.bdate);
791 c1.bdate = AD_DATE_TO_UNIX(c2.bdate);
795 if (c1.rbitmap & (1 << FILPBIT_FINFO)) {
798 memcpy(buf, spec1, sizeof(buf));
799 unpack_buffer(&c1.finfo, buf);
800 spec1 += sizeof(buf);
802 memcpy(buf, spec2, sizeof(buf));
803 unpack_buffer(&c2.finfo, buf);
804 spec2 += sizeof(buf);
807 if ((c1.rbitmap & (1 << DIRPBIT_OFFCNT)) != 0) {
808 /* Offspring count - only directories */
809 if (c1.fbitmap == 0) {
810 memcpy(&c1.offcnt, spec1, sizeof(c1.offcnt));
811 spec1 += sizeof(c1.offcnt);
812 c1.offcnt = ntohs(c1.offcnt);
813 memcpy(&c2.offcnt, spec2, sizeof(c2.offcnt));
814 spec2 += sizeof(c2.offcnt);
815 c2.offcnt = ntohs(c2.offcnt);
817 else if (c1.dbitmap == 0) {
818 /* ressource fork length */
821 return AFPERR_BITMAP; /* error */
823 } /* Offspring count/ressource fork length */
826 if (c1.rbitmap & (1 << FILPBIT_LNAME)) {
827 /* Get the long filename */
828 memcpy(tmppath, bspec1 + spec1[1] + 1, (bspec1 + spec1[1])[0]);
829 tmppath[(bspec1 + spec1[1])[0]]= 0;
830 len = convert_string ( vol->v_maccharset, CH_UCS2, tmppath, strlen(tmppath), c1.lname, 64);
831 if (len == (size_t)(-1))
836 /* FIXME: do we need it ? It's always null ! */
837 memcpy(c2.lname, bspec2 + spec2[1] + 1, (bspec2 + spec2[1])[0]);
838 c2.lname[(bspec2 + spec2[1])[0]]= 0;
842 if (c1.rbitmap & (1 << FILPBIT_PDINFO)) {
845 memcpy(&namelen, spec1, sizeof(namelen));
846 namelen = ntohs (namelen);
848 spec1 = bspec1+namelen+4; /* Skip Unicode Hint */
851 memcpy(&namelen, spec1, sizeof(namelen));
852 namelen = ntohs (namelen);
853 if (namelen > 255) /* Safeguard */
856 memcpy (c1.utf8name, spec1+2, namelen);
857 c1.utf8name[(namelen+1)] =0;
859 /* convert charset */
860 flags = CONV_PRECOMPOSE;
861 len = convert_charset(CH_UTF8_MAC, CH_UCS2, CH_UTF8, c1.utf8name, namelen, c1.utf8name, 512, &flags);
862 if (len == (size_t)(-1))
869 ret = catsearch(vol, vol->v_dir, rmatches, &catpos[0], rbuf+24, &nrecs, &rsize, ext);
870 memcpy(rbuf, catpos, sizeof(catpos));
871 rbuf += sizeof(catpos);
873 c1.fbitmap = htons(c1.fbitmap);
874 memcpy(rbuf, &c1.fbitmap, sizeof(c1.fbitmap));
875 rbuf += sizeof(c1.fbitmap);
877 c1.dbitmap = htons(c1.dbitmap);
878 memcpy(rbuf, &c1.dbitmap, sizeof(c1.dbitmap));
879 rbuf += sizeof(c1.dbitmap);
881 nrecs = htonl(nrecs);
882 memcpy(rbuf, &nrecs, sizeof(nrecs));
883 rbuf += sizeof(nrecs);
887 } /* catsearch_afp */
889 /* -------------------------- */
890 int afp_catsearch (AFPObj *obj, char *ibuf, int ibuflen,
891 char *rbuf, int *rbuflen)
893 return catsearch_afp( obj, ibuf, ibuflen, rbuf, rbuflen, 0);
897 int afp_catsearch_ext (AFPObj *obj, char *ibuf, int ibuflen,
898 char *rbuf, int *rbuflen)
900 return catsearch_afp( obj, ibuf, ibuflen, rbuf, rbuflen, 1);
903 /* FIXME: we need a clean separation between afp stubs and 'real' implementation */
904 /* (so, all buffer packing/unpacking should be done in stub, everything else
905 should be done in other functions) */