2 Copyright (C) 2003 - 2010 Chaskiel Grundman
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions
9 1. Redistributions of source code must retain the above copyright
10 notice, this list of conditions and the following disclaimer.
12 2. Redistributions in binary form must reproduce the above copyright
13 notice, this list of conditions and the following disclaimer in the
14 documentation and/or other materials provided with the distribution.
16 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19 IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20 INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include <afs/param.h>
28 #include <afs/vlserver.h>
29 #include <afs/vldbint.h>
30 #include <afs/volint.h>
34 #include <netinet/in.h>
35 #include <arpa/inet.h>
38 #include "afscp_internal.h"
43 static int icompare(const void *pa, const void *pb) {
44 const struct afs_volume *va=pa,*vb=pb;
46 if (va->id > vb->id) return 1;
47 if (va->id < vb->id) return -1;
52 static int ncompare(const void *pa, const void *pb) {
53 const struct afs_volume *va=pa,*vb=pb;
55 if (va->voltype > vb->voltype) return 1;
56 if (vb->voltype < va->voltype) return -1;
57 return strcmp(va->name, vb->name);
68 struct afs_volume *afs_volumebyname(struct afs_cell *cell, const char *vname, afs_int32 intype)
71 struct afs_volume *ret,key;
72 struct afs_server *server;
73 afs_int32 code,vtype,type,srv;
77 if (intype == VOLTYPE_RW)
79 else if (intype == VOLTYPE_RO)
81 else if (intype == VOLTYPE_BK)
88 memset(&key,0, sizeof(key));
89 strcpy(key.name,vname);
91 s=tfind(&key, &cell->volsbyname, ncompare);
93 ret=*(struct afs_volume **)s;
98 if ((code=ubik_VL_GetEntryByNameU(cell->vlservers, 0, (char *)vname, &u.u))
101 if ((code=ubik_VL_GetEntryByNameN(cell->vlservers, 0, (char *)vname, &u.n))
104 code=ubik_VL_GetEntryByNameO(cell->vlservers, 0, (char *)vname, &u.o);
111 ret=malloc(sizeof(struct afs_volume));
116 memset(ret,0,sizeof(struct afs_volume));
117 strcpy(ret->name, u.u.name);
122 ret->id=u.u.volumeId[intype];
123 for (srv=0;srv < u.u.nServers;srv++) {
124 if ((u.u.serverFlags[srv] & vtype) == 0)
126 //printf("uvldbentry server %d flags: %x\n",srv, u.u.serverFlags[srv]);
128 if ((u.u.serverFlags[srv] & VLSERVER_FLAG_UUID) == 0)
129 server=afs_serverbyaddr(cell, u.u.serverNumber[srv].time_low);
131 server=afs_serverbyid(cell, &u.u.serverNumber[srv]);
134 ret->servers[ret->nservers++]=server->index;
138 ret->id=u.n.volumeId[intype];
139 for (srv=0;srv < u.n.nServers;srv++) {
140 if ((u.n.serverFlags[srv] & vtype) == 0)
142 server=afs_serverbyaddr(cell, u.n.serverNumber[srv]);
145 ret->servers[ret->nservers++]=server->index;
149 ret->id=u.o.volumeId[intype];
150 for (srv=0;srv < u.o.nServers;srv++) {
151 if ((u.o.serverFlags[srv] & vtype) == 0)
153 server=afs_serverbyaddr(cell, u.o.serverNumber[srv]);
156 ret->servers[ret->nservers++]=server->index;
160 if (!ret->nservers || !ret->id) {
166 server=afs_serverbyindex(ret->servers[0]);
168 i.s_addr=server->addrs[0];
171 afscp_dprintf(("New volume BYNAME %s (%lu) on %s (%d)\n", ret->name, ret->id, inet_ntoa(i),ret->servers[0]));
172 s=tsearch(&key, &cell->volsbyname, ncompare);
174 *(struct afs_volume **)s=ret;
176 s=tsearch(&key, &cell->volsbyid, icompare);
178 *(struct afs_volume **)s=ret;
182 struct afs_volume *afs_volumebyid(struct afs_cell *cell, afs_uint32 id)
184 union allvldbentry u;
185 struct afs_volume *ret,key;
186 struct afs_server *server;
187 afs_int32 code,vtype,type,srv;
193 memset(&key,0, sizeof(key));
195 s=tfind(&key, &cell->volsbyid, icompare);
197 ret=*(struct afs_volume **)s;
201 sprintf(idbuffer,"%" PRIu32, id);
203 if ((code=ubik_VL_GetEntryByNameU(cell->vlservers, 0, idbuffer, &u.u))
206 if ((code=ubik_VL_GetEntryByIDN(cell->vlservers, 0, id, -1, &u.n))
209 code=ubik_VL_GetEntryByID(cell->vlservers, 0, id, -1, &u.o);
216 ret=malloc(sizeof(struct afs_volume));
222 memset(ret,0,sizeof(struct afs_volume));
223 strcpy(ret->name, u.u.name);
229 if (id == u.u.volumeId[RWVOL]) {
232 } else if (id == u.u.volumeId[ROVOL]) {
235 } else if (id == u.u.volumeId[BACKVOL]) {
242 for (srv=0;srv < u.u.nServers;srv++) {
243 if ((u.u.serverFlags[srv] & vtype) == 0)
245 if ((u.u.serverFlags[srv] & VLSERVER_FLAG_UUID) == 0)
246 server=afs_serverbyaddr(cell, u.u.serverNumber[srv].time_low);
248 server=afs_serverbyid(cell, &u.u.serverNumber[srv]);
251 ret->servers[ret->nservers++]=server->index;
255 if (id == u.n.volumeId[RWVOL]) {
258 } else if (id == u.n.volumeId[ROVOL]) {
261 } else if (id == u.n.volumeId[BACKVOL]) {
268 for (srv=0;srv < u.n.nServers;srv++) {
269 if ((u.n.serverFlags[srv] & vtype) == 0)
271 server=afs_serverbyaddr(cell, u.n.serverNumber[srv]);
274 ret->servers[ret->nservers++]=server->index;
278 if (id == u.o.volumeId[RWVOL]) {
281 } else if (id == u.o.volumeId[ROVOL]) {
284 } else if (id == u.o.volumeId[BACKVOL]) {
291 for (srv=0;srv < u.o.nServers;srv++) {
292 if ((u.o.serverFlags[srv] & vtype) == 0)
294 server=afs_serverbyaddr(cell, u.o.serverNumber[srv]);
297 ret->servers[ret->nservers++]=server->index;
301 ret->voltype=voltype;
302 server=afs_serverbyindex(ret->servers[0]);
304 i.s_addr=server->addrs[0];
307 afscp_dprintf(("New volume BYID %s (%lu) on %s (%d)\n", ret->name, ret->id, inet_ntoa(i), ret->servers[0]));
308 s=tsearch(&key, &cell->volsbyid, icompare);
310 *(struct afs_volume **)s=ret;
311 strcpy(key.name, ret->name);
312 s=tsearch(&key, &cell->volsbyname, ncompare);
314 *(struct afs_volume **)s=ret;