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 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
|
/*
* Copyright (c) 1995, 2001-2002 Silicon Graphics, Inc. All Rights Reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2.1 of the GNU Lesser General Public License
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it would be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* Further, this software is distributed without any warranty that it is
* free of the rightful claim of any third person regarding infringement
* or the like. Any license provided herein, whether implied or
* otherwise, applies only to this software file. Patent licenses, if
* any, provided herein do not apply to combinations of this program with
* other software, or any other product whatsoever.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program; if not, write the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston MA 02111-1307,
* USA.
*
* Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
* Mountain View, CA 94043, or:
*
* http://www.sgi.com
*
* For further information regarding this notice, see:
*
* http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
*/
#ifdef linux
#include <xfs/libxfs.h>
#include <xfs/handle.h>
#else
#include <sys/handle.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#endif
#include <dmapi.h>
#include <dmapi_kern.h>
#include "dmapi_lib.h"
typedef enum {
DM_HANDLE_GLOBAL,
DM_HANDLE_FILESYSTEM,
DM_HANDLE_FILE,
DM_HANDLE_BAD
} dm_handletype_t;
extern int
dm_path_to_handle (
char *path,
void **hanpp,
size_t *hlenp)
{
char hbuf[DM_MAX_HANDLE_SIZE];
if (dmi(DM_PATH_TO_HANDLE, path, hbuf, hlenp))
return(-1);
if ((*hanpp = malloc(*hlenp)) == NULL) {
errno = ENOMEM;
return -1;
}
memcpy(*hanpp, hbuf, *hlenp);
return(0);
}
extern int
dm_path_to_fshandle (
char *path,
void **hanpp,
size_t *hlenp)
{
char hbuf[DM_MAX_HANDLE_SIZE];
if (dmi(DM_PATH_TO_FSHANDLE, path, hbuf, hlenp))
return(-1);
if ((*hanpp = malloc(*hlenp)) == NULL) {
errno = ENOMEM;
return -1;
}
memcpy(*hanpp, hbuf, *hlenp);
return(0);
}
extern int
dm_fd_to_handle (
int fd,
void **hanpp,
size_t *hlenp)
{
char hbuf[DM_MAX_HANDLE_SIZE];
if (dmi(DM_FD_TO_HANDLE, fd, hbuf, hlenp))
return(-1);
if ((*hanpp = malloc(*hlenp)) == NULL) {
errno = ENOMEM;
return -1;
}
memcpy(*hanpp, hbuf, *hlenp);
return(0);
}
extern int
dm_handle_to_fshandle (
void *hanp,
size_t hlen,
void **fshanp,
size_t *fshlen)
{
dm_fsid_t fsid;
if (dm_handle_to_fsid(hanp, hlen, &fsid))
return(-1);
*fshlen = sizeof(fsid);
if ((*fshanp = malloc(*fshlen)) == NULL) {
errno = ENOMEM;
return(-1);
}
memcpy(*fshanp, &fsid, *fshlen);
return(0);
}
/* ARGSUSED */
extern void
dm_handle_free(
void *hanp,
size_t hlen)
{
free(hanp);
}
static dm_handletype_t
parse_handle(
void *hanp,
size_t hlen,
dm_fsid_t *fsidp,
dm_ino_t *inop,
dm_igen_t *igenp)
{
xfs_handle_t handle;
xfs_fid2_t *xfid2;
fid_t *fidp;
if (hanp == DM_GLOBAL_HANP && hlen == DM_GLOBAL_HLEN)
return(DM_HANDLE_GLOBAL);
if (hlen < sizeof(handle.ha_fsid) || hlen > sizeof(handle))
return(DM_HANDLE_BAD);
memcpy(&handle, hanp, hlen);
if (!handle.ha_fsid.val[0] || !handle.ha_fsid.val[1])
return(DM_HANDLE_BAD);
if (fsidp)
memcpy(fsidp, &handle.ha_fsid, sizeof(handle.ha_fsid));
if (hlen == sizeof(handle.ha_fsid))
return(DM_HANDLE_FILESYSTEM);
#ifdef linux
fidp = (fid_t*)&handle.ha_fid;
if (fidp->fid_len != (hlen - sizeof(handle.ha_fsid) - sizeof(fidp->fid_len)))
return(DM_HANDLE_BAD);
#else
if (handle.ha_fid.fid_len != (hlen - sizeof(handle.ha_fsid) - sizeof(handle.ha_fid.fid_len)))
return(DM_HANDLE_BAD);
#endif
xfid2 = (struct xfs_fid2 *)&handle.ha_fid;
if (xfid2->fid_len == sizeof *xfid2 - sizeof xfid2->fid_len) {
if (xfid2->fid_pad)
return(DM_HANDLE_BAD);
if (inop)
*inop = xfid2->fid_ino;
if (igenp)
*igenp = xfid2->fid_gen;
} else {
return(DM_HANDLE_BAD);
}
return(DM_HANDLE_FILE);
}
extern dm_boolean_t
dm_handle_is_valid(
void *hanp,
size_t hlen)
{
if (parse_handle(hanp, hlen, NULL, NULL, NULL) != DM_HANDLE_BAD)
return(DM_TRUE);
return(DM_FALSE);
}
extern int
dm_handle_cmp(
void *hanp1,
size_t hlen1,
void *hanp2,
size_t hlen2)
{
int diff;
/* If the handles don't have the same length, then this is an
apples-and-oranges comparison. For lack of a better option,
use the handle lengths to sort them into an arbitrary order.
*/
if ((diff = (int)(hlen1 - hlen2)) != 0)
return diff;
return(memcmp(hanp1, hanp2, hlen1));
}
extern u_int
dm_handle_hash(
void *hanp,
size_t hlen)
{
size_t i;
u_int hash = 0;
u_char *ip = (u_char *)hanp;
for (i = 0; i < hlen; i++) {
hash += *ip++;
}
return(hash);
}
extern int
dm_handle_to_fsid(
void *hanp,
size_t hlen,
dm_fsid_t *fsidp)
{
dm_handletype_t htype;
htype = parse_handle(hanp, hlen, fsidp, NULL, NULL);
if (htype == DM_HANDLE_FILE || htype == DM_HANDLE_FILESYSTEM)
return(0);
errno = EBADF;
return(-1);
}
extern int
dm_handle_to_ino(
void *hanp,
size_t hlen,
dm_ino_t *inop)
{
if (parse_handle(hanp, hlen, NULL, inop, NULL) == DM_HANDLE_FILE)
return(0);
errno = EBADF;
return(-1);
}
extern int
dm_handle_to_igen(
void *hanp,
size_t hlen,
dm_igen_t *igenp)
{
if (parse_handle(hanp, hlen, NULL, NULL, igenp) == DM_HANDLE_FILE)
return(0);
errno = EBADF;
return(-1);
}
extern int
dm_make_handle(
dm_fsid_t *fsidp,
dm_ino_t *inop,
dm_igen_t *igenp,
void **hanpp,
size_t *hlenp)
{
xfs_fid2_t *xfid2;
/* XXX */
xfs_handle_t handle;
memcpy(&handle.ha_fsid, fsidp, sizeof(handle.ha_fsid));
xfid2 = (struct xfs_fid2 *)&handle.ha_fid;
xfid2->fid_pad = 0;
xfid2->fid_gen = (__u32)*igenp;
xfid2->fid_ino = *inop;
xfid2->fid_len = sizeof(*xfid2) - sizeof(xfid2->fid_len);
*hlenp = sizeof(*xfid2) + sizeof(handle.ha_fsid);
if ((*hanpp = malloc(*hlenp)) == NULL) {
errno = ENOMEM;
return -1;
}
memcpy(*hanpp, &handle, *hlenp);
return(0);
}
extern int
dm_make_fshandle(
dm_fsid_t *fsidp,
void **hanpp,
size_t *hlenp)
{
/* XXX */
#if 0
*hlenp = sizeof(fsid_t);
#else
*hlenp = sizeof(__kernel_fsid_t);
#endif
if ((*hanpp = malloc(*hlenp)) == NULL) {
errno = ENOMEM;
return -1;
}
memcpy(*hanpp, fsidp, *hlenp);
return(0);
}
extern int
dm_create_by_handle(
dm_sessid_t sid,
void *dirhanp,
size_t dirhlen,
dm_token_t token,
void *hanp,
size_t hlen,
char *cname)
{
return dmi(DM_CREATE_BY_HANDLE, sid, dirhanp, dirhlen, token,
hanp, hlen, cname);
}
extern int
dm_mkdir_by_handle(
dm_sessid_t sid,
void *dirhanp,
size_t dirhlen,
dm_token_t token,
void *hanp,
size_t hlen,
char *cname)
{
return dmi(DM_MKDIR_BY_HANDLE, sid, dirhanp, dirhlen, token, hanp,
hlen, cname);
}
extern int
dm_symlink_by_handle(
dm_sessid_t sid,
void *dirhanp,
size_t dirhlen,
dm_token_t token,
void *hanp,
size_t hlen,
char *cname,
char *path)
{
return dmi(DM_SYMLINK_BY_HANDLE, sid, dirhanp, dirhlen, token, hanp,
hlen, cname, path);
}
|