1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*
* Copyright (c) 1995 - 2002 Kungliga Tekniska Hgskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "arla_local.h"
RCSID("$Id: subr.c,v 1.12 2002/09/07 10:43:30 lha Exp $");
/*
* come up with a good inode number for `name', `fid' in `parent'
*/
ino_t
dentry2ino (const char *name, const VenusFid *fid, const FCacheEntry *parent)
{
if (strcmp (name, ".") == 0
&& (parent->flags.vol_root
|| (fid->fid.Vnode == 1 && fid->fid.Unique == 1))
&& parent->volume != NULL)
return afsfid2inode (&parent->volume->mp_fid);
else if (strcmp (name, "..") == 0
&& (parent->flags.vol_root
|| (parent->fid.fid.Vnode == 1
&& parent->fid.fid.Unique == 1))
&& parent->volume != NULL)
return afsfid2inode (&parent->volume->parent_fid);
else if (strcmp (name, "..") == 0
&& fid->fid.Vnode == 1 && fid->fid.Unique == 1
&& parent->volume != NULL)
return afsfid2inode (&parent->volume->mp_fid);
else
return afsfid2inode (fid);
}
/*
* Assume `e' has valid data.
*/
int
conv_dir_sub (FCacheEntry *e, CredCacheEntry *ce, u_int tokens,
fcache_cache_handle *cache_handle,
char *cache_name, size_t cache_name_sz,
fdir_readdir_func func,
void (*flush_func)(void *),
size_t blocksize)
{
struct write_dirent_args args;
int ret;
int fd;
fbuf the_fbuf;
e->flags.extradirp = TRUE;
fcache_extra_file_name (e, cache_name, cache_name_sz);
e->tokens |= NNPFS_DATA_R | NNPFS_OPEN_NR;
args.fd = open (cache_name, O_WRONLY | O_CREAT | O_TRUNC | O_BINARY, 0666);
if (args.fd == -1) {
ret = errno;
arla_warn (ADEBWARN, ret, "open %s", cache_name);
return ret;
}
ret = fcache_fhget (cache_name, cache_handle);
args.off = 0;
args.buf = (char *)malloc (blocksize);
if (args.buf == NULL) {
ret = errno;
arla_warn (ADEBWARN, ret, "malloc %u", (unsigned)blocksize);
close (args.fd);
return ret;
}
ret = fcache_get_fbuf (e, &fd, &the_fbuf,
O_RDONLY, FBUF_READ|FBUF_PRIVATE);
if (ret) {
close (args.fd);
free (args.buf);
return ret;
}
args.ptr = args.buf;
args.last = NULL;
args.e = e;
args.ce = ce;
/* translate to local dir format, write in args.fd */
fdir_readdir (&the_fbuf, func, (void *)&args, e->fid, NULL);
fbuf_end (&the_fbuf);
close (fd);
if (args.last)
(*flush_func) (&args);
free (args.buf);
ret = close (args.fd);
if (ret)
ret = errno;
return ret;
}
|