|
| 1 | +/* |
| 2 | + * Copyright (c) 2015 Dmitry V. Levin <[email protected]> |
| 3 | + * All rights reserved. |
| 4 | + * |
| 5 | + * Redistribution and use in source and binary forms, with or without |
| 6 | + * modification, are permitted provided that the following conditions |
| 7 | + * are met: |
| 8 | + * 1. Redistributions of source code must retain the above copyright |
| 9 | + * notice, this list of conditions and the following disclaimer. |
| 10 | + * 2. Redistributions in binary form must reproduce the above copyright |
| 11 | + * notice, this list of conditions and the following disclaimer in the |
| 12 | + * documentation and/or other materials provided with the distribution. |
| 13 | + * 3. The name of the author may not be used to endorse or promote products |
| 14 | + * derived from this software without specific prior written permission. |
| 15 | + * |
| 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 OF |
| 25 | + * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | + */ |
| 27 | + |
| 28 | +#include "defs.h" |
| 29 | + |
| 30 | +#include DEF_MPERS_TYPE(struct_flock) |
| 31 | +#include DEF_MPERS_TYPE(struct_flock64) |
| 32 | + |
| 33 | +#include "flock.h" |
| 34 | +typedef struct_kernel_flock struct_flock; |
| 35 | +typedef struct_kernel_flock64 struct_flock64; |
| 36 | + |
| 37 | +#include MPERS_DEFS |
| 38 | + |
| 39 | +#define SIZEOF_MEMBER(type, member) \ |
| 40 | + sizeof(((type *) NULL)->member) |
| 41 | + |
| 42 | +#define FLOCK_MEMBERS_EQ(type, member) \ |
| 43 | + (SIZEOF_MEMBER(struct_kernel_flock64, member) == SIZEOF_MEMBER(type, member) \ |
| 44 | + && offsetof(struct_kernel_flock64, member) == offsetof(type, member)) |
| 45 | + |
| 46 | +#define FLOCK_STRUCTS_EQ(type) \ |
| 47 | + (sizeof(struct_kernel_flock64) == sizeof(type) \ |
| 48 | + && FLOCK_MEMBERS_EQ(type, l_type) \ |
| 49 | + && FLOCK_MEMBERS_EQ(type, l_whence) \ |
| 50 | + && FLOCK_MEMBERS_EQ(type, l_start) \ |
| 51 | + && FLOCK_MEMBERS_EQ(type, l_len) \ |
| 52 | + && FLOCK_MEMBERS_EQ(type, l_pid)) |
| 53 | + |
| 54 | +MPERS_PRINTER_DECL(bool, fetch_struct_flock)(struct tcb *tcp, const long addr, void *p) |
| 55 | +{ |
| 56 | + struct_kernel_flock64 *pfl = p; |
| 57 | + struct_flock mfl; |
| 58 | + |
| 59 | + if (FLOCK_STRUCTS_EQ(struct_flock)) |
| 60 | + return !umove_or_printaddr(tcp, addr, pfl); |
| 61 | + |
| 62 | + if (umove_or_printaddr(tcp, addr, &mfl)) |
| 63 | + return false; |
| 64 | + |
| 65 | + pfl->l_type = mfl.l_type; |
| 66 | + pfl->l_whence = mfl.l_whence; |
| 67 | + pfl->l_start = mfl.l_start; |
| 68 | + pfl->l_len = mfl.l_len; |
| 69 | + pfl->l_pid = mfl.l_pid; |
| 70 | + return true; |
| 71 | +} |
| 72 | + |
| 73 | +MPERS_PRINTER_DECL(bool, fetch_struct_flock64)(struct tcb *tcp, const long addr, void *p) |
| 74 | +{ |
| 75 | + struct_kernel_flock64 *pfl = p; |
| 76 | + struct_flock64 mfl; |
| 77 | + |
| 78 | + if (FLOCK_STRUCTS_EQ(struct_flock64)) |
| 79 | + return !umove_or_printaddr(tcp, addr, pfl); |
| 80 | + |
| 81 | + if (umove_or_printaddr(tcp, addr, &mfl)) |
| 82 | + return false; |
| 83 | + |
| 84 | + pfl->l_type = mfl.l_type; |
| 85 | + pfl->l_whence = mfl.l_whence; |
| 86 | + pfl->l_start = mfl.l_start; |
| 87 | + pfl->l_len = mfl.l_len; |
| 88 | + pfl->l_pid = mfl.l_pid; |
| 89 | + return true; |
| 90 | +} |
0 commit comments