3 * Copyright (C) 1990, 1993 Regents of The University of Michigan
4 * Copyright (C) 2010 Frank Lahm
5 * All Rights Reserved. See COPYRIGHT
10 * This file contains FPCatSearch implementation. FPCatSearch performs
11 * file/directory search based on specified criteria. It is used by client
12 * to perform fast searches on (propably) big volumes. So, it has to be
15 * This implementation bypasses most of adouble/libatalk stuff as long as
16 * possible and does a standard filesystem search. It calls higher-level
17 * libatalk/afpd functions only when it is really needed, mainly while
18 * returning some non-UNIX information or filtering by non-UNIX criteria.
20 * Initial version written by Rafal Lewczuk <rlewczuk@pronet.pl>
22 * Starting with Netatalk 2.2 searching by name criteria utilizes the
23 * CNID database in conjunction with an enhanced cnid_dbd. This requires
24 * the use of cnidscheme:dbd for the searched volume, the new functionality
25 * is not built into cnidscheme:cdb.
30 #endif /* HAVE_CONFIG_H */
40 #include <netinet/in.h>
42 #include <atalk/afp.h>
43 #include <atalk/adouble.h>
44 #include <atalk/logger.h>
45 #include <atalk/cnid.h>
46 #include <atalk/cnid_dbd_private.h>
47 #include <atalk/util.h>
48 #include <atalk/bstradd.h>
51 #include "directory.h"
63 u_int16_t attrs; /* File attributes (high 8 bits)*/
64 u_int16_t label; /* Label (low 8 bits )*/
65 char reserved[22]; /* Unknown (at least for now...) */
68 typedef char packed_finder[ADEDLEN_FINDERI];
71 * 0x04 - has a custom icon
72 * 0x20 - name/icon is locked
86 /* This is our search-criteria structure. */
88 u_int32_t rbitmap; /* Request bitmap - which values should we check ? */
89 u_int16_t fbitmap, dbitmap; /* file & directory bitmap - which values should we return ? */
90 u_int16_t attr; /* File attributes */
91 time_t cdate; /* Creation date */
92 time_t mdate; /* Last modification date */
93 time_t bdate; /* Last backup date */
94 u_int32_t pdid; /* Parent DID */
95 u_int16_t offcnt; /* Offspring count */
96 struct finderinfo finfo; /* Finder info */
97 char lname[64]; /* Long name */
98 char utf8name[514]; /* UTF8 or UCS2 name */ /* for convert_charset dest_len parameter +2 */
102 * Directory tree search is recursive by its nature. But AFP specification
103 * requires FPCatSearch to pause after returning n results and be able to
104 * resume the search later. So we have to do recursive search using flat
105 * (iterative) algorithm and remember all directories to look into in an
106 * stack-like structure. The structure below is one item of directory stack.
110 struct dir *dir; /* Structure describing this directory */
111 int pidx; /* Parent's dsitem structure index. */
112 int checked; /* Have we checked this directory ? */
114 char *path; /* absolute UNIX path to this directory */
119 static int save_cidx = -1; /* Saved index of currently scanned directory. */
121 static struct dsitem *dstack = NULL; /* Directory stack data... */
122 static int dssize = 0; /* Directory stack (allocated) size... */
123 static int dsidx = 0; /* First free item index... */
125 static struct scrit c1, c2; /* search criteria */
127 /* Puts new item onto directory stack. */
128 static int addstack(char *uname, struct dir *dir, int pidx)
133 /* check if we have some space on stack... */
134 if (dsidx >= dssize) {
136 dstack = realloc(dstack, dssize * sizeof(struct dsitem));
141 /* Put new element. Allocate and copy lname and path. */
142 ds = dstack + dsidx++;
144 dir->d_flags |= DIRF_CACHELOCK;
148 l = dstack[pidx].path_len;
149 u = strlen(uname) +1;
150 if (!(ds->path = malloc(l + u + 1) ))
152 memcpy(ds->path, dstack[pidx].path, l);
154 memcpy(&ds->path[l+1], uname, u);
158 ds->path = strdup(uname);
159 ds->path_len = strlen(uname);
164 /* Removes checked items from top of directory stack. Returns index of the first unchecked elements or -1. */
165 static int reducestack(void)
168 if (save_cidx != -1) {
175 if (dstack[dsidx-1].checked) {
177 dstack[dsidx].dir->d_flags &= ~DIRF_CACHELOCK;
178 free(dstack[dsidx].path);
185 /* Clears directory stack. */
186 static void clearstack(void)
191 dstack[dsidx].dir->d_flags &= ~DIRF_CACHELOCK;
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/"
483 * This function performs a filesystem search
485 * Uses globals c1, c2, the search criteria
487 * @param vol (r) volume we are searching on ...
488 * @param dir (rw) directory we are starting from ...
489 * @param rmatches (r) maximum number of matches we can return
490 * @param pos (r) position we've stopped recently
491 * @param rbuf (w) output buffer
492 * @param nrecs (w) number of matches
493 * @param rsize (w) length of data written to output buffer
494 * @param ext (r) extended search flag
496 #define NUM_ROUNDS 200
497 static int catsearch(struct vol *vol,
506 static u_int32_t cur_pos; /* Saved position index (ID) - used to remember "position" across FPCatSearch calls */
507 static DIR *dirpos; /* UNIX structure describing currently opened directory. */
509 struct dirent *entry;
513 char *vpath = vol->v_path;
516 int num_rounds = NUM_ROUNDS;
520 if (*pos != 0 && *pos != cur_pos) {
521 result = AFPERR_CATCHNG;
525 /* FIXME: Category "offspring count ! */
528 /* We need to initialize all mandatory structures/variables and change working directory appropriate... */
531 if (dirpos != NULL) {
536 if (addstack(vpath, dir, -1) == -1) {
537 result = AFPERR_MISC;
540 /* FIXME: Sometimes DID is given by client ! (correct this one above !) */
543 /* Save current path */
544 if ((cwd = open(".", O_RDONLY)) < 0) {
545 result = AFPERR_MISC;
549 /* So we are beginning... */
550 start_time = time(NULL);
552 while ((cidx = reducestack()) != -1) {
553 error = lchdir(dstack[cidx].path);
555 if (!error && dirpos == NULL)
556 dirpos = opendir(".");
559 dirpos = opendir(dstack[cidx].path);
561 if (error || dirpos == NULL) {
564 dstack[cidx].checked = 1;
569 result = AFPERR_NFILE;
574 result = AFPERR_MISC;
575 } /* switch (errno) */
579 while ((entry=readdir(dirpos)) != NULL) {
582 if (!check_dirent(vol, entry->d_name))
585 memset(&path, 0, sizeof(path));
586 path.u_name = entry->d_name;
587 if (of_stat(&path) != 0) {
598 result = AFPERR_MISC;
602 if (S_ISDIR(path.st.st_mode)) {
603 /* here we can short cut
604 ie if in the same loop the parent dir wasn't in the cache
605 ALL dirsearch_byname will fail.
607 int unlen = strlen(path.u_name);
608 path.d_dir = dircache_search_by_name(vol, dstack[cidx].dir, path.u_name, unlen, path.st.st_ctime);
609 if (path.d_dir == NULL) {
610 /* path.m_name is set by adddir */
611 if (NULL == (path.d_dir = dir_add( vol, dstack[cidx].dir, &path, unlen) ) ) {
612 result = AFPERR_MISC;
616 path.m_name = cfrombstr(path.d_dir->d_m_name);
618 if (addstack(path.u_name, path.d_dir, cidx) == -1) {
619 result = AFPERR_MISC;
624 /* yes it sucks for directory d_dir is the directory, for file it's the parent directory*/
625 path.d_dir = dstack[cidx].dir;
627 ccr = crit_check(vol, &path);
629 /* bit 0 means that criteria has been met */
631 r = rslt_add ( vol, &path, &rrbuf, ext);
634 result = AFPERR_MISC;
638 /* Number of matches limit */
640 goto catsearch_pause;
641 /* Block size limit */
642 if (rrbuf - rbuf >= 448)
643 goto catsearch_pause;
645 /* MacOS 9 doesn't like servers executing commands longer than few seconds */
646 if (--num_rounds <= 0) {
647 if (start_time != time(NULL)) {
649 goto catsearch_pause;
651 num_rounds = NUM_ROUNDS;
653 } /* while ((entry=readdir(dirpos)) != NULL) */
656 dstack[cidx].checked = 1;
657 } /* while (current_idx = reducestack()) != -1) */
659 /* We have finished traversing our tree. Return EOF here. */
667 catsearch_end: /* Exiting catsearch: error condition */
668 *rsize = rrbuf - rbuf;
670 if ((fchdir(cwd)) != 0) {
671 LOG(log_debug, logtype_afpd, "error chdiring back: %s", strerror(errno));
679 * This function performs a CNID db search
681 * Uses globals c1, c2, the search criteria
683 * @param vol (r) volume we are searching on ...
684 * @param dir (rw) directory we are starting from ...
685 * @param uname (r) UNIX name of object to search
686 * @param rmatches (r) maximum number of matches we can return
687 * @param pos (r) position we've stopped recently
688 * @param rbuf (w) output buffer
689 * @param nrecs (w) number of matches
690 * @param rsize (w) length of data written to output buffer
691 * @param ext (r) extended search flag
693 static int catsearch_db(struct vol *vol,
703 static char resbuf[DBD_MAX_SRCH_RSLTS * sizeof(cnid_t)];
704 static uint32_t cur_pos;
705 static int num_matches;
711 LOG(log_debug, logtype_afpd, "catsearch_db(req pos: %u): {pos: %u, name: %s}",
712 *pos, cur_pos, uname);
714 if (*pos != 0 && *pos != cur_pos) {
715 result = AFPERR_CATCHNG;
719 if (cur_pos == 0 || *pos == 0) {
720 if ((num_matches = cnid_find(vol->v_cdb,
724 sizeof(resbuf))) == -1) {
725 result = AFPERR_MISC;
730 while (cur_pos < num_matches) {
733 char resolvebuf[12 + MAXPATHLEN + 1];
736 /* Next CNID to process from buffer */
737 memcpy(&cnid, resbuf + cur_pos * sizeof(cnid_t), sizeof(cnid_t));
740 if ((name = cnid_resolve(vol->v_cdb, &did, resolvebuf, 12 + MAXPATHLEN + 1)) == NULL)
742 LOG(log_debug, logtype_afpd, "catsearch_db: {pos: %u, name:%s, cnid: %u}",
743 cur_pos, name, ntohl(cnid));
744 if ((dir = dirlookup(vol, did)) == NULL)
746 if (movecwd(vol, dir) < 0 )
749 memset(&path, 0, sizeof(path));
751 path.m_name = utompath(vol, name, cnid, utf8_encoding());
753 if (of_stat(&path) != 0) {
760 result = AFPERR_MISC;
764 /* For files path.d_dir is the parent dir, for dirs its the dir itself */
765 if (S_ISDIR(path.st.st_mode))
766 if ((dir = dirlookup(vol, cnid)) == NULL)
770 LOG(log_maxdebug, logtype_afpd,"catsearch_db: dir: %s, cwd: %s, name: %s",
771 cfrombstr(dir->d_fullpath), getcwdpath(), path.u_name);
773 /* At last we can check the search criteria */
774 ccr = crit_check(vol, &path);
776 LOG(log_debug, logtype_afpd,"catsearch_db: match: %s/%s",
777 getcwdpath(), path.u_name);
778 /* bit 1 means that criteria has been met */
779 r = rslt_add(vol, &path, &rrbuf, ext);
781 result = AFPERR_MISC;
785 /* Number of matches limit */
787 goto catsearch_pause;
788 /* Block size limit */
789 if (rrbuf - rbuf >= 448)
790 goto catsearch_pause;
804 catsearch_end: /* Exiting catsearch: error condition */
805 *rsize = rrbuf - rbuf;
806 LOG(log_debug, logtype_afpd, "catsearch_db(req pos: %u): {pos: %u}", *pos, cur_pos);
810 /* -------------------------- */
811 static int catsearch_afp(AFPObj *obj _U_, char *ibuf, size_t ibuflen,
812 char *rbuf, size_t *rbuflen, int ext)
817 u_int32_t rmatches, reserved;
822 unsigned char *spec1, *spec2, *bspec1, *bspec2;
831 /* min header size */
836 memset(&c1, 0, sizeof(c1));
837 memset(&c2, 0, sizeof(c2));
840 memcpy(&vid, ibuf, sizeof(vid));
843 if ((vol = getvolbyvid(vid)) == NULL) {
847 memcpy(&rmatches, ibuf, sizeof(rmatches));
848 rmatches = ntohl(rmatches);
849 ibuf += sizeof(rmatches);
851 /* FIXME: (rl) should we check if reserved == 0 ? */
852 ibuf += sizeof(reserved);
854 memcpy(catpos, ibuf, sizeof(catpos));
855 ibuf += sizeof(catpos);
857 memcpy(&c1.fbitmap, ibuf, sizeof(c1.fbitmap));
858 c1.fbitmap = c2.fbitmap = ntohs(c1.fbitmap);
859 ibuf += sizeof(c1.fbitmap);
861 memcpy(&c1.dbitmap, ibuf, sizeof(c1.dbitmap));
862 c1.dbitmap = c2.dbitmap = ntohs(c1.dbitmap);
863 ibuf += sizeof(c1.dbitmap);
865 memcpy(&c1.rbitmap, ibuf, sizeof(c1.rbitmap));
866 c1.rbitmap = c2.rbitmap = ntohl(c1.rbitmap);
867 ibuf += sizeof(c1.rbitmap);
869 if (! (c1.fbitmap || c1.dbitmap)) {
870 return AFPERR_BITMAP;
874 memcpy(&spec_len, ibuf, sizeof(spec_len));
875 spec_len = ntohs(spec_len);
878 /* with catsearch only name and parent id are allowed */
879 c1.fbitmap &= (1<<FILPBIT_LNAME) | (1<<FILPBIT_PDID);
880 c1.dbitmap &= (1<<DIRPBIT_LNAME) | (1<<DIRPBIT_PDID);
881 spec_len = *(unsigned char*)ibuf;
884 /* Parse file specifications */
885 spec1 = (unsigned char*)ibuf;
886 spec2 = (unsigned char*)ibuf + spec_len + 2;
893 /* File attribute bits... */
894 if (c1.rbitmap & (1 << FILPBIT_ATTR)) {
895 memcpy(&c1.attr, spec1, sizeof(c1.attr));
896 spec1 += sizeof(c1.attr);
897 memcpy(&c2.attr, spec2, sizeof(c2.attr));
898 spec2 += sizeof(c1.attr);
902 if (c1.rbitmap & (1 << FILPBIT_PDID)) {
903 memcpy(&c1.pdid, spec1, sizeof(pdid));
904 spec1 += sizeof(c1.pdid);
905 memcpy(&c2.pdid, spec2, sizeof(pdid));
906 spec2 += sizeof(c2.pdid);
907 } /* FIXME: PDID - do we demarshall this argument ? */
910 if (c1.rbitmap & (1 << FILPBIT_CDATE)) {
911 memcpy(&c1.cdate, spec1, sizeof(c1.cdate));
912 spec1 += sizeof(c1.cdate);
913 c1.cdate = AD_DATE_TO_UNIX(c1.cdate);
914 memcpy(&c2.cdate, spec2, sizeof(c2.cdate));
915 spec2 += sizeof(c1.cdate);
916 ibuf += sizeof(c1.cdate);;
917 c2.cdate = AD_DATE_TO_UNIX(c2.cdate);
920 /* Modification date */
921 if (c1.rbitmap & (1 << FILPBIT_MDATE)) {
922 memcpy(&c1.mdate, spec1, sizeof(c1.mdate));
923 c1.mdate = AD_DATE_TO_UNIX(c1.mdate);
924 spec1 += sizeof(c1.mdate);
925 memcpy(&c2.mdate, spec2, sizeof(c2.mdate));
926 c2.mdate = AD_DATE_TO_UNIX(c2.mdate);
927 spec2 += sizeof(c1.mdate);
931 if (c1.rbitmap & (1 << FILPBIT_BDATE)) {
932 memcpy(&c1.bdate, spec1, sizeof(c1.bdate));
933 spec1 += sizeof(c1.bdate);
934 c1.bdate = AD_DATE_TO_UNIX(c1.bdate);
935 memcpy(&c2.bdate, spec2, sizeof(c2.bdate));
936 spec2 += sizeof(c2.bdate);
937 c1.bdate = AD_DATE_TO_UNIX(c2.bdate);
941 if (c1.rbitmap & (1 << FILPBIT_FINFO)) {
944 memcpy(buf, spec1, sizeof(buf));
945 unpack_buffer(&c1.finfo, buf);
946 spec1 += sizeof(buf);
948 memcpy(buf, spec2, sizeof(buf));
949 unpack_buffer(&c2.finfo, buf);
950 spec2 += sizeof(buf);
953 if ((c1.rbitmap & (1 << DIRPBIT_OFFCNT)) != 0) {
954 /* Offspring count - only directories */
955 if (c1.fbitmap == 0) {
956 memcpy(&c1.offcnt, spec1, sizeof(c1.offcnt));
957 spec1 += sizeof(c1.offcnt);
958 c1.offcnt = ntohs(c1.offcnt);
959 memcpy(&c2.offcnt, spec2, sizeof(c2.offcnt));
960 spec2 += sizeof(c2.offcnt);
961 c2.offcnt = ntohs(c2.offcnt);
963 else if (c1.dbitmap == 0) {
964 /* ressource fork length */
967 return AFPERR_BITMAP; /* error */
969 } /* Offspring count/ressource fork length */
972 if (c1.rbitmap & (1 << FILPBIT_LNAME)) {
973 /* Get the long filename */
974 memcpy(tmppath, bspec1 + spec1[1] + 1, (bspec1 + spec1[1])[0]);
975 tmppath[(bspec1 + spec1[1])[0]]= 0;
976 len = convert_string ( vol->v_maccharset, CH_UCS2, tmppath, -1, c1.lname, sizeof(c1.lname));
977 if (len == (size_t)(-1))
981 /* FIXME: do we need it ? It's always null ! */
982 memcpy(c2.lname, bspec2 + spec2[1] + 1, (bspec2 + spec2[1])[0]);
983 c2.lname[(bspec2 + spec2[1])[0]]= 0;
987 if (c1.rbitmap & (1 << FILPBIT_PDINFO)) {
990 memcpy(&namelen, spec1, sizeof(namelen));
991 namelen = ntohs (namelen);
993 spec1 = bspec1+namelen+4; /* Skip Unicode Hint */
996 memcpy(&namelen, spec1, sizeof(namelen));
997 namelen = ntohs (namelen);
998 if (namelen > 255) /* Safeguard */
1001 memcpy (c1.utf8name, spec1+2, namelen);
1002 c1.utf8name[namelen] = 0;
1003 if ((uname = mtoupath(vol, c1.utf8name, 0, utf8_encoding())) == NULL)
1004 return AFPERR_PARAM;
1006 /* convert charset */
1007 flags = CONV_PRECOMPOSE;
1008 len = convert_charset(CH_UTF8_MAC, CH_UCS2, CH_UTF8, c1.utf8name, namelen, c1.utf8name, 512, &flags);
1009 if (len == (size_t)(-1))
1010 return AFPERR_PARAM;
1015 if ((c1.rbitmap & (1 << FILPBIT_PDINFO)) && (strcmp(vol->v_cnidscheme, "dbd") == 0))
1016 /* we've got a name and it's a dbd volume, so search CNID database */
1017 ret = catsearch_db(vol, vol->v_root, uname, rmatches, &catpos[0], rbuf+24, &nrecs, &rsize, ext);
1019 /* perform a slow filesystem tree search */
1020 ret = catsearch(vol, vol->v_root, rmatches, &catpos[0], rbuf+24, &nrecs, &rsize, ext);
1022 memcpy(rbuf, catpos, sizeof(catpos));
1023 rbuf += sizeof(catpos);
1025 c1.fbitmap = htons(c1.fbitmap);
1026 memcpy(rbuf, &c1.fbitmap, sizeof(c1.fbitmap));
1027 rbuf += sizeof(c1.fbitmap);
1029 c1.dbitmap = htons(c1.dbitmap);
1030 memcpy(rbuf, &c1.dbitmap, sizeof(c1.dbitmap));
1031 rbuf += sizeof(c1.dbitmap);
1033 nrecs = htonl(nrecs);
1034 memcpy(rbuf, &nrecs, sizeof(nrecs));
1035 rbuf += sizeof(nrecs);
1039 } /* catsearch_afp */
1041 /* -------------------------- */
1042 int afp_catsearch (AFPObj *obj, char *ibuf, size_t ibuflen,
1043 char *rbuf, size_t *rbuflen)
1045 return catsearch_afp( obj, ibuf, ibuflen, rbuf, rbuflen, 0);
1049 int afp_catsearch_ext (AFPObj *obj, char *ibuf, size_t ibuflen,
1050 char *rbuf, size_t *rbuflen)
1052 return catsearch_afp( obj, ibuf, ibuflen, rbuf, rbuflen, 1);
1055 /* FIXME: we need a clean separation between afp stubs and 'real' implementation */
1056 /* (so, all buffer packing/unpacking should be done in stub, everything else
1057 should be done in other functions) */