blob: 3c90a258c810410bac4e1ec9b589034dcf1c409c [file] [log] [blame]
Dmitry V. Levina367db82015-11-19 18:13:53 +00001/*
2 * Copyright (c) 1991, 1992 Paul Kranenburg <pk@cs.few.eur.nl>
3 * Copyright (c) 1993 Branko Lankester <branko@hacktic.nl>
4 * Copyright (c) 1993, 1994, 1995, 1996 Rick Sladkey <jrs@world.std.com>
5 * Copyright (c) 1996-1999 Wichert Akkerman <wichert@cistron.nl>
6 * Copyright (c) 2005-2015 Dmitry V. Levin <ldv@altlinux.org>
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. The name of the author may not be used to endorse or promote products
18 * derived from this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32#include "defs.h"
33#include <dirent.h>
34
35#include "xlat/dirent_types.h"
36
37#define D_NAME_LEN_MAX 256
38
39SYS_FUNC(getdents64)
40{
41 /* the minimum size of a valid dirent64 structure */
42 const unsigned int d_name_offset = offsetof(struct dirent64, d_name);
43
44 unsigned int i, len, dents = 0;
45 char *buf;
46
47 if (entering(tcp)) {
48 printfd(tcp, tcp->u_arg[0]);
49 tprints(", ");
50 return 0;
51 }
52 if (syserror(tcp) || !verbose(tcp)) {
53 printaddr(tcp->u_arg[1]);
54 tprintf(", %lu", tcp->u_arg[2]);
55 return 0;
56 }
57
58 /* Beware of insanely large or too small values in tcp->u_rval */
59 if (tcp->u_rval > 1024*1024)
60 len = 1024*1024;
61 else if (tcp->u_rval < (int) d_name_offset)
62 len = 0;
63 else
64 len = tcp->u_rval;
65
66 if (len) {
67 buf = malloc(len);
68 if (!buf || umoven(tcp, tcp->u_arg[1], len, buf) < 0) {
69 printaddr(tcp->u_arg[1]);
70 tprintf(", %lu", tcp->u_arg[2]);
71 free(buf);
72 return 0;
73 }
74 } else {
75 buf = NULL;
76 }
77
78 if (!abbrev(tcp))
79 tprints("[");
80 for (i = 0; len && i <= len - d_name_offset; ) {
81 struct dirent64 *d = (struct dirent64 *) &buf[i];
82 if (!abbrev(tcp)) {
83 int d_name_len;
84 if (d->d_reclen >= d_name_offset
85 && i + d->d_reclen <= len) {
86 d_name_len = d->d_reclen - d_name_offset;
87 } else {
88 d_name_len = len - i - d_name_offset;
89 }
90 if (d_name_len > D_NAME_LEN_MAX)
91 d_name_len = D_NAME_LEN_MAX;
92
93 tprintf("%s{d_ino=%" PRIu64 ", d_off=%" PRId64
94 ", d_reclen=%u, d_type=",
95 i ? ", " : "",
96 d->d_ino,
97 d->d_off,
98 d->d_reclen);
99 printxval(dirent_types, d->d_type, "DT_???");
100
101 tprints(", d_name=");
102 if (print_quoted_string(d->d_name, d_name_len,
103 QUOTE_0_TERMINATED) > 0) {
104 tprints("...");
105 }
106
107 tprints("}");
108 }
109 if (d->d_reclen < d_name_offset) {
110 tprints("/* d_reclen < offsetof(struct dirent64, d_name) */");
111 break;
112 }
113 i += d->d_reclen;
114 dents++;
115 }
116 if (!abbrev(tcp))
117 tprints("]");
118 else
119 tprintf("/* %u entries */", dents);
120 tprintf(", %lu", tcp->u_arg[2]);
121 free(buf);
122 return 0;
123}