2009-10-07 01:31:13 +07:00
|
|
|
#ifndef __CEPH_DECODE_H
|
|
|
|
#define __CEPH_DECODE_H
|
|
|
|
|
2012-07-11 20:24:45 +07:00
|
|
|
#include <linux/err.h>
|
2011-11-24 08:12:59 +07:00
|
|
|
#include <linux/bug.h>
|
2010-02-03 07:11:19 +07:00
|
|
|
#include <linux/time.h>
|
2011-11-24 08:12:59 +07:00
|
|
|
#include <asm/unaligned.h>
|
2009-10-07 01:31:13 +07:00
|
|
|
|
2012-10-03 00:01:25 +07:00
|
|
|
#include <linux/ceph/types.h>
|
2009-10-14 23:59:09 +07:00
|
|
|
|
2009-10-07 01:31:13 +07:00
|
|
|
/*
|
|
|
|
* in all cases,
|
|
|
|
* void **p pointer to position pointer
|
|
|
|
* void *end pointer to end of buffer (last byte + 1)
|
|
|
|
*/
|
|
|
|
|
2009-10-14 23:59:09 +07:00
|
|
|
static inline u64 ceph_decode_64(void **p)
|
|
|
|
{
|
|
|
|
u64 v = get_unaligned_le64(*p);
|
|
|
|
*p += sizeof(u64);
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
static inline u32 ceph_decode_32(void **p)
|
|
|
|
{
|
|
|
|
u32 v = get_unaligned_le32(*p);
|
|
|
|
*p += sizeof(u32);
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
static inline u16 ceph_decode_16(void **p)
|
|
|
|
{
|
|
|
|
u16 v = get_unaligned_le16(*p);
|
|
|
|
*p += sizeof(u16);
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
static inline u8 ceph_decode_8(void **p)
|
|
|
|
{
|
|
|
|
u8 v = *(u8 *)*p;
|
|
|
|
(*p)++;
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
static inline void ceph_decode_copy(void **p, void *pv, size_t n)
|
|
|
|
{
|
|
|
|
memcpy(pv, *p, n);
|
|
|
|
*p += n;
|
|
|
|
}
|
|
|
|
|
2009-10-07 01:31:13 +07:00
|
|
|
/*
|
|
|
|
* bounds check input.
|
|
|
|
*/
|
2012-04-21 03:49:44 +07:00
|
|
|
static inline int ceph_has_room(void **p, void *end, size_t n)
|
|
|
|
{
|
|
|
|
return end >= *p && n <= end - *p;
|
|
|
|
}
|
|
|
|
|
2012-11-01 20:39:27 +07:00
|
|
|
#define ceph_decode_need(p, end, n, bad) \
|
|
|
|
do { \
|
|
|
|
if (!likely(ceph_has_room(p, end, n))) \
|
|
|
|
goto bad; \
|
2009-10-07 01:31:13 +07:00
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define ceph_decode_64_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_decode_need(p, end, sizeof(u64), bad); \
|
2009-10-14 23:59:09 +07:00
|
|
|
v = ceph_decode_64(p); \
|
2009-10-07 01:31:13 +07:00
|
|
|
} while (0)
|
|
|
|
#define ceph_decode_32_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_decode_need(p, end, sizeof(u32), bad); \
|
2009-10-14 23:59:09 +07:00
|
|
|
v = ceph_decode_32(p); \
|
2009-10-07 01:31:13 +07:00
|
|
|
} while (0)
|
|
|
|
#define ceph_decode_16_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_decode_need(p, end, sizeof(u16), bad); \
|
2009-10-14 23:59:09 +07:00
|
|
|
v = ceph_decode_16(p); \
|
2009-10-07 01:31:13 +07:00
|
|
|
} while (0)
|
2010-02-03 07:11:19 +07:00
|
|
|
#define ceph_decode_8_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_decode_need(p, end, sizeof(u8), bad); \
|
|
|
|
v = ceph_decode_8(p); \
|
|
|
|
} while (0)
|
2009-10-07 01:31:13 +07:00
|
|
|
|
|
|
|
#define ceph_decode_copy_safe(p, end, pv, n, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_decode_need(p, end, n, bad); \
|
|
|
|
ceph_decode_copy(p, pv, n); \
|
|
|
|
} while (0)
|
|
|
|
|
2012-07-11 20:24:45 +07:00
|
|
|
/*
|
|
|
|
* Allocate a buffer big enough to hold the wire-encoded string, and
|
|
|
|
* decode the string into it. The resulting string will always be
|
|
|
|
* terminated with '\0'. If successful, *p will be advanced
|
|
|
|
* past the decoded data. Also, if lenp is not a null pointer, the
|
|
|
|
* length (not including the terminating '\0') will be recorded in
|
|
|
|
* *lenp. Note that a zero-length string is a valid return value.
|
|
|
|
*
|
|
|
|
* Returns a pointer to the newly-allocated string buffer, or a
|
|
|
|
* pointer-coded errno if an error occurs. Neither *p nor *lenp
|
|
|
|
* will have been updated if an error is returned.
|
|
|
|
*
|
|
|
|
* There are two possible failures:
|
|
|
|
* - converting the string would require accessing memory at or
|
2012-11-01 20:39:27 +07:00
|
|
|
* beyond the "end" pointer provided (-ERANGE)
|
|
|
|
* - memory could not be allocated for the result (-ENOMEM)
|
2012-07-11 20:24:45 +07:00
|
|
|
*/
|
|
|
|
static inline char *ceph_extract_encoded_string(void **p, void *end,
|
|
|
|
size_t *lenp, gfp_t gfp)
|
|
|
|
{
|
|
|
|
u32 len;
|
|
|
|
void *sp = *p;
|
|
|
|
char *buf;
|
|
|
|
|
|
|
|
ceph_decode_32_safe(&sp, end, len, bad);
|
|
|
|
if (!ceph_has_room(&sp, end, len))
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
buf = kmalloc(len + 1, gfp);
|
|
|
|
if (!buf)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
|
|
|
|
if (len)
|
|
|
|
memcpy(buf, sp, len);
|
|
|
|
buf[len] = '\0';
|
|
|
|
|
|
|
|
*p = (char *) *p + sizeof (u32) + len;
|
|
|
|
if (lenp)
|
|
|
|
*lenp = (size_t) len;
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
|
|
|
|
bad:
|
|
|
|
return ERR_PTR(-ERANGE);
|
|
|
|
}
|
|
|
|
|
2009-10-07 01:31:13 +07:00
|
|
|
/*
|
|
|
|
* struct ceph_timespec <-> struct timespec
|
|
|
|
*/
|
2009-10-14 23:59:09 +07:00
|
|
|
static inline void ceph_decode_timespec(struct timespec *ts,
|
2009-11-04 06:17:56 +07:00
|
|
|
const struct ceph_timespec *tv)
|
2009-10-14 23:59:09 +07:00
|
|
|
{
|
2013-04-20 03:34:50 +07:00
|
|
|
ts->tv_sec = (__kernel_time_t)le32_to_cpu(tv->tv_sec);
|
|
|
|
ts->tv_nsec = (long)le32_to_cpu(tv->tv_nsec);
|
2009-10-14 23:59:09 +07:00
|
|
|
}
|
|
|
|
static inline void ceph_encode_timespec(struct ceph_timespec *tv,
|
2009-11-04 06:17:56 +07:00
|
|
|
const struct timespec *ts)
|
2009-10-14 23:59:09 +07:00
|
|
|
{
|
2013-04-20 03:34:50 +07:00
|
|
|
tv->tv_sec = cpu_to_le32((u32)ts->tv_sec);
|
|
|
|
tv->tv_nsec = cpu_to_le32((u32)ts->tv_nsec);
|
2009-10-14 23:59:09 +07:00
|
|
|
}
|
2009-10-07 01:31:13 +07:00
|
|
|
|
2009-11-04 06:17:56 +07:00
|
|
|
/*
|
|
|
|
* sockaddr_storage <-> ceph_sockaddr
|
|
|
|
*/
|
|
|
|
static inline void ceph_encode_addr(struct ceph_entity_addr *a)
|
|
|
|
{
|
2010-06-12 06:58:48 +07:00
|
|
|
__be16 ss_family = htons(a->in_addr.ss_family);
|
|
|
|
a->in_addr.ss_family = *(__u16 *)&ss_family;
|
2009-11-04 06:17:56 +07:00
|
|
|
}
|
|
|
|
static inline void ceph_decode_addr(struct ceph_entity_addr *a)
|
|
|
|
{
|
2010-06-12 06:58:48 +07:00
|
|
|
__be16 ss_family = *(__be16 *)&a->in_addr.ss_family;
|
|
|
|
a->in_addr.ss_family = ntohs(ss_family);
|
2009-11-19 07:19:57 +07:00
|
|
|
WARN_ON(a->in_addr.ss_family == 512);
|
2009-11-04 06:17:56 +07:00
|
|
|
}
|
|
|
|
|
2009-10-07 01:31:13 +07:00
|
|
|
/*
|
|
|
|
* encoders
|
|
|
|
*/
|
2009-10-14 23:59:09 +07:00
|
|
|
static inline void ceph_encode_64(void **p, u64 v)
|
|
|
|
{
|
|
|
|
put_unaligned_le64(v, (__le64 *)*p);
|
|
|
|
*p += sizeof(u64);
|
|
|
|
}
|
|
|
|
static inline void ceph_encode_32(void **p, u32 v)
|
|
|
|
{
|
|
|
|
put_unaligned_le32(v, (__le32 *)*p);
|
|
|
|
*p += sizeof(u32);
|
|
|
|
}
|
|
|
|
static inline void ceph_encode_16(void **p, u16 v)
|
|
|
|
{
|
|
|
|
put_unaligned_le16(v, (__le16 *)*p);
|
|
|
|
*p += sizeof(u16);
|
|
|
|
}
|
|
|
|
static inline void ceph_encode_8(void **p, u8 v)
|
|
|
|
{
|
|
|
|
*(u8 *)*p = v;
|
|
|
|
(*p)++;
|
|
|
|
}
|
2009-11-19 07:19:57 +07:00
|
|
|
static inline void ceph_encode_copy(void **p, const void *s, int len)
|
|
|
|
{
|
|
|
|
memcpy(*p, s, len);
|
|
|
|
*p += len;
|
|
|
|
}
|
2009-10-07 01:31:13 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* filepath, string encoders
|
|
|
|
*/
|
|
|
|
static inline void ceph_encode_filepath(void **p, void *end,
|
|
|
|
u64 ino, const char *path)
|
|
|
|
{
|
|
|
|
u32 len = path ? strlen(path) : 0;
|
2012-07-04 04:01:18 +07:00
|
|
|
BUG_ON(*p + 1 + sizeof(ino) + sizeof(len) + len > end);
|
2010-01-28 05:28:10 +07:00
|
|
|
ceph_encode_8(p, 1);
|
2009-10-07 01:31:13 +07:00
|
|
|
ceph_encode_64(p, ino);
|
|
|
|
ceph_encode_32(p, len);
|
|
|
|
if (len)
|
|
|
|
memcpy(*p, path, len);
|
|
|
|
*p += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void ceph_encode_string(void **p, void *end,
|
|
|
|
const char *s, u32 len)
|
|
|
|
{
|
|
|
|
BUG_ON(*p + sizeof(len) + len > end);
|
|
|
|
ceph_encode_32(p, len);
|
|
|
|
if (len)
|
|
|
|
memcpy(*p, s, len);
|
|
|
|
*p += len;
|
|
|
|
}
|
|
|
|
|
2012-11-01 20:39:27 +07:00
|
|
|
#define ceph_encode_need(p, end, n, bad) \
|
|
|
|
do { \
|
|
|
|
if (!likely(ceph_has_room(p, end, n))) \
|
|
|
|
goto bad; \
|
2010-02-03 07:11:19 +07:00
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define ceph_encode_64_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_encode_need(p, end, sizeof(u64), bad); \
|
|
|
|
ceph_encode_64(p, v); \
|
|
|
|
} while (0)
|
|
|
|
#define ceph_encode_32_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_encode_need(p, end, sizeof(u32), bad); \
|
2012-11-01 20:39:27 +07:00
|
|
|
ceph_encode_32(p, v); \
|
2010-02-03 07:11:19 +07:00
|
|
|
} while (0)
|
|
|
|
#define ceph_encode_16_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_encode_need(p, end, sizeof(u16), bad); \
|
2012-11-01 20:39:27 +07:00
|
|
|
ceph_encode_16(p, v); \
|
|
|
|
} while (0)
|
|
|
|
#define ceph_encode_8_safe(p, end, v, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_encode_need(p, end, sizeof(u8), bad); \
|
|
|
|
ceph_encode_8(p, v); \
|
2010-02-03 07:11:19 +07:00
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define ceph_encode_copy_safe(p, end, pv, n, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_encode_need(p, end, n, bad); \
|
|
|
|
ceph_encode_copy(p, pv, n); \
|
|
|
|
} while (0)
|
2010-05-19 06:38:08 +07:00
|
|
|
#define ceph_encode_string_safe(p, end, s, n, bad) \
|
|
|
|
do { \
|
|
|
|
ceph_encode_need(p, end, n, bad); \
|
|
|
|
ceph_encode_string(p, end, s, n); \
|
|
|
|
} while (0)
|
2010-02-03 07:11:19 +07:00
|
|
|
|
2009-10-07 01:31:13 +07:00
|
|
|
|
|
|
|
#endif
|