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
|
/*
* Copyright (C) 2006 by CERN/IT/GD/ITR
* All rights reserved
*/
#ifndef lint
static char sccsid[] = "@(#)$RCSfile: Cns_listrepset.c,v $ $Revision: 1.1 $ $Date: 2006/12/01 09:19:37 $ CERN IT-GD/CT Jean-Philippe Baud";
#endif /* not lint */
/* Cns_listrepset - list replica entries that belong to a given set */
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#if defined(_WIN32)
#include <winsock2.h>
#else
#include <unistd.h>
#include <netinet/in.h>
#endif
#include "marshall.h"
#include "Cns_api.h"
#include "Cns.h"
#include "serrno.h"
struct Cns_filereplicax *
Cns_listrepset(const char *setname, int flags, Cns_list *listp)
{
int bol = 0;
int c;
char func[15];
gid_t gid;
int listentsz;
struct Cns_filereplicax *lp;
int msglen;
int nbentries;
char *q;
char *rbp;
char repbuf[LISTBUFSZ+4];
char *sbp;
char sendbuf[REQBUFSZ];
struct Cns_api_thread_info *thip;
uid_t uid;
strcpy (func, "Cns_listrepset");
if (Cns_apiinit (&thip))
return (NULL);
uid = geteuid();
gid = getegid();
#if defined(_WIN32)
if (uid < 0 || gid < 0) {
Cns_errmsg (func, NS053);
serrno = SENOMAPFND;
return (NULL);
}
#endif
if (! setname || ! listp) {
serrno = EFAULT;
return (NULL);
}
if (strlen (setname) > 36) {
serrno = EINVAL;
return (NULL);
}
if (flags == CNS_LIST_BEGIN) {
memset (listp, 0, sizeof(Cns_list));
listp->fd = -1;
if ((listp->buf = malloc (LISTBUFSZ)) == NULL) {
serrno = ENOMEM;
return (NULL);
}
bol = 1;
}
if (listp->len == 0 && listp->eol /* all entries have been listed */
&& flags != CNS_LIST_END)
return (NULL);
if (listp->buf == NULL) /* buffer has already been freed
and connection closed */
return (NULL);
/* compute size of Cns_filereplicax structure excluding sfn */
lp = (struct Cns_filereplicax *) listp->buf;
listentsz = &lp->sfn[0] - (char *) lp;
if (listp->len == 0 /* no data in the cache */
|| flags == CNS_LIST_END) {
/* Build request header */
sbp = sendbuf;
marshall_LONG (sbp, CNS_MAGIC3);
if (flags == CNS_LIST_END) {
marshall_LONG (sbp, CNS_ENDLIST);
} else {
marshall_LONG (sbp, CNS_LISTREPSET);
}
q = sbp; /* save pointer. The next field will be updated */
msglen = 3 * LONGSIZE;
marshall_LONG (sbp, msglen);
/* Build request body */
marshall_LONG (sbp, uid);
marshall_LONG (sbp, gid);
marshall_WORD (sbp, listentsz);
marshall_STRING (sbp, setname);
marshall_WORD (sbp, bol);
msglen = sbp - sendbuf;
marshall_LONG (q, msglen); /* update length field */
c = send2nsd (&listp->fd, NULL, sendbuf,
msglen, repbuf, sizeof(repbuf));
if (c < 0 || flags == CNS_LIST_END) {
if (listp->buf)
free (listp->buf);
listp->buf = NULL;
return (NULL);
}
rbp = repbuf;
unmarshall_WORD (rbp, nbentries);
if (nbentries == 0)
return (NULL); /* end of list */
/* unmarshall reply into Cns_filereplicax structures */
while (nbentries--) {
unmarshall_HYPER (rbp, lp->fileid);
unmarshall_HYPER (rbp, lp->nbaccesses);
unmarshall_TIME_T (rbp, lp->ctime);
unmarshall_TIME_T (rbp, lp->atime);
unmarshall_TIME_T (rbp, lp->ptime);
unmarshall_TIME_T (rbp, lp->ltime);
unmarshall_BYTE (rbp, lp->r_type);
unmarshall_BYTE (rbp, lp->status);
unmarshall_BYTE (rbp, lp->f_type);
unmarshall_STRING (rbp, lp->setname);
unmarshall_STRING (rbp, lp->poolname);
unmarshall_STRING (rbp, lp->host);
unmarshall_STRING (rbp, lp->fs);
unmarshall_STRING (rbp, lp->sfn);
c = ((listentsz + strlen (lp->sfn) + 8) / 8) * 8;
lp = (struct Cns_filereplicax *) ((char *) lp + c);
}
unmarshall_WORD (rbp, listp->eol);
listp->len = (char *) lp - listp->buf;
}
lp = (struct Cns_filereplicax *) (listp->buf + listp->offset);
listp->offset += ((listentsz + strlen (lp->sfn) + 8) / 8) * 8;
if (listp->offset >= listp->len) { /* must refill next time */
listp->offset = 0;
listp->len = 0;
}
return (lp);
}
|
