1 /* 2 * Copyright (c) 1991, 1992 Paul Kranenburg <pk (at) cs.few.eur.nl> 3 * Copyright (c) 1993 Branko Lankester <branko (at) hacktic.nl> 4 * Copyright (c) 1993, 1994, 1995, 1996 Rick Sladkey <jrs (at) world.std.com> 5 * Copyright (c) 1996-1999 Wichert Akkerman <wichert (at) cistron.nl> 6 * Copyright (c) 2002-2005 Roland McGrath <roland (at) redhat.com> 7 * Copyright (c) 2009 Andreas Schwab <schwab (at) redhat.com> 8 * Copyright (c) 2012 H.J. Lu <hongjiu.lu (at) intel.com> 9 * Copyright (c) 2013 Denys Vlasenko <vda.linux (at) googlemail.com> 10 * Copyright (c) 2014-2016 Dmitry V. Levin <ldv (at) altlinux.org> 11 * All rights reserved. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. The name of the author may not be used to endorse or promote products 22 * derived from this software without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 25 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 27 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 28 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 29 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 30 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 31 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 32 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 33 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 34 */ 35 36 #include "defs.h" 37 38 #include "xlat/whence_codes.h" 39 40 /* Linux kernel has exactly one version of lseek: 41 * fs/read_write.c::SYSCALL_DEFINE3(lseek, unsigned, fd, off_t, offset, unsigned, origin) 42 * In kernel, off_t is always the same as (kernel's) long 43 * (see include/uapi/asm-generic/posix_types.h). 44 * Use test/x32_lseek.c to test lseek decoding. 45 */ 46 SYS_FUNC(lseek) 47 { 48 printfd(tcp, tcp->u_arg[0]); 49 50 kernel_long_t offset; 51 52 # ifndef current_klongsize 53 if (current_klongsize < sizeof(kernel_long_t)) { 54 offset = (int) tcp->u_arg[1]; 55 } else 56 # endif /* !current_klongsize */ 57 { 58 offset = tcp->u_arg[1]; 59 } 60 61 tprintf(", %" PRI_kld ", ", offset); 62 63 printxval(whence_codes, tcp->u_arg[2], "SEEK_???"); 64 65 return RVAL_DECODED | RVAL_UDECIMAL; 66 } 67 68 /* llseek syscall takes explicitly two ulong arguments hi, lo, 69 * rather than one 64-bit argument for which ULONG_LONG works 70 * appropriate for the native byte order. 71 * 72 * See kernel's fs/read_write.c::SYSCALL_DEFINE5(llseek, ...) 73 * 74 * hi,lo are "unsigned longs" and combined exactly this way in kernel: 75 * ((loff_t) hi << 32) | lo 76 * Note that for architectures with kernel's long wider than userspace long 77 * (such as x32), combining code will use *kernel's*, i.e. *wide* longs 78 * for hi and lo. 79 */ 80 SYS_FUNC(llseek) 81 { 82 if (entering(tcp)) { 83 printfd(tcp, tcp->u_arg[0]); 84 tprintf(", %lld, ", 85 ((long long) tcp->u_arg[1] << 32) 86 | ((long long) tcp->u_arg[2])); 87 } else { 88 printnum_int64(tcp, tcp->u_arg[3], "%" PRIu64); 89 tprints(", "); 90 printxval(whence_codes, tcp->u_arg[4], "SEEK_???"); 91 } 92 return 0; 93 } 94
