2 * Copyright (c) 2013 Luca Clementi <luca.clementi@gmail.com>
3 * Copyright (c) 2013-2018 The strace developers.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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.
33 #ifdef _LARGEFILE64_SOURCE
35 # define fopen_for_input fopen64
37 # define fopen_for_input fopen
40 # define fopen_for_input fopen
43 static unsigned int mmap_cache_generation;
46 * caching of /proc/ID/maps for each process to speed up stack tracing
48 * The cache must be refreshed after syscalls that affect memory mappings,
49 * e.g. mmap, mprotect, munmap, execve.
52 build_mmap_cache(struct tcb *tcp)
55 struct mmap_cache_t *cache_head = NULL;
56 /* start with a small dynamically-allocated array and then expand it */
57 size_t cur_array_size = 0;
58 char filename[sizeof("/proc/4294967296/maps")];
59 char buffer[PATH_MAX + 80];
61 xsprintf(filename, "/proc/%u/maps", tcp->pid);
62 fp = fopen_for_input(filename, "r");
64 perror_msg("fopen: %s", filename);
68 while (fgets(buffer, sizeof(buffer), fp) != NULL) {
69 struct mmap_cache_t *entry;
70 unsigned long start_addr, end_addr, mmap_offset;
75 char binary_path[sizeof(buffer)];
77 if (sscanf(buffer, "%lx-%lx %c%c%c%c %lx %*x:%*x %*d %[^\n]",
78 &start_addr, &end_addr,
79 &read_bit, &write_bit, &exec_bit, &shared_bit,
80 &mmap_offset, binary_path) != 8)
83 /* skip mappings that have unknown protection */
84 if (!(read_bit == '-' || read_bit == 'r'))
86 if (!(write_bit == '-' || write_bit == 'w'))
88 if (!(exec_bit == '-' || exec_bit == 'x'))
90 if (!(shared_bit == 'p' || shared_bit == 's'))
93 if (end_addr < start_addr) {
94 error_msg("%s: unrecognized file format", filename);
99 * sanity check to make sure that we're storing
100 * non-overlapping regions in ascending order
102 if (tcp->mmap_cache_size > 0) {
103 entry = &cache_head[tcp->mmap_cache_size - 1];
104 if (entry->start_addr == start_addr &&
105 entry->end_addr == end_addr) {
106 /* duplicate entry, e.g. [vsyscall] */
109 if (start_addr <= entry->start_addr ||
110 start_addr < entry->end_addr) {
111 debug_msg("%s: overlapping memory region: "
112 "\"%s\" [%08lx-%08lx] overlaps with "
113 "\"%s\" [%08lx-%08lx]",
114 filename, binary_path, start_addr,
115 end_addr, entry->binary_filename,
116 entry->start_addr, entry->end_addr);
121 if (tcp->mmap_cache_size >= cur_array_size)
122 cache_head = xgrowarray(cache_head, &cur_array_size,
123 sizeof(*cache_head));
125 entry = &cache_head[tcp->mmap_cache_size];
126 entry->start_addr = start_addr;
127 entry->end_addr = end_addr;
128 entry->mmap_offset = mmap_offset;
129 entry->protections = (
131 | ((read_bit == 'r')? MMAP_CACHE_PROT_READABLE : 0)
132 | ((write_bit == 'w')? MMAP_CACHE_PROT_WRITABLE : 0)
133 | ((exec_bit == 'x')? MMAP_CACHE_PROT_EXECUTABLE: 0)
134 | ((shared_bit == 's')? MMAP_CACHE_PROT_SHARED : 0)
136 entry->binary_filename = xstrdup(binary_path);
137 tcp->mmap_cache_size++;
140 tcp->mmap_cache = cache_head;
141 tcp->mmap_cache_generation = mmap_cache_generation;
143 debug_func_msg("tgen=%u, ggen=%u, tcp=%p, cache=%p",
144 tcp->mmap_cache_generation,
145 mmap_cache_generation,
146 tcp, tcp->mmap_cache);
149 /* deleting the cache */
151 mmap_cache_delete(struct tcb *tcp, const char *caller)
155 debug_func_msg("tgen=%u, ggen=%u, tcp=%p, cache=%p, caller=%s",
156 tcp->mmap_cache_generation,
157 mmap_cache_generation,
158 tcp, tcp->mmap_cache, caller);
160 for (i = 0; i < tcp->mmap_cache_size; i++) {
161 free(tcp->mmap_cache[i].binary_filename);
162 tcp->mmap_cache[i].binary_filename = NULL;
164 free(tcp->mmap_cache);
165 tcp->mmap_cache = NULL;
166 tcp->mmap_cache_size = 0;
169 extern enum mmap_cache_rebuild_result
170 mmap_cache_rebuild_if_invalid(struct tcb *tcp, const char *caller)
172 enum mmap_cache_rebuild_result r = MMAP_CACHE_REBUILD_READY;
173 if ((tcp->mmap_cache_generation != mmap_cache_generation)
175 mmap_cache_delete(tcp, caller);
177 if (!tcp->mmap_cache) {
178 r = MMAP_CACHE_REBUILD_RENEWED;
179 build_mmap_cache(tcp);
182 if (!(tcp->mmap_cache && tcp->mmap_cache_size))
183 r = MMAP_CACHE_REBUILD_NOCACHE;
189 mmap_cache_invalidate(struct tcb *tcp)
191 #if SUPPORTED_PERSONALITIES > 1
192 if (tcp->currpers != DEFAULT_PERSONALITY) {
193 /* disable stack trace */
197 mmap_cache_generation++;
198 debug_func_msg("tgen=%u, ggen=%u, tcp=%p, cache=%p",
199 tcp->mmap_cache_generation,
200 mmap_cache_generation,
201 tcp, tcp->mmap_cache);
204 struct mmap_cache_t *
205 mmap_cache_search(struct tcb *tcp, unsigned long ip)
208 int upper = (int) tcp->mmap_cache_size - 1;
210 while (lower <= upper) {
211 struct mmap_cache_t *cur_mmap_cache;
212 int mid = (upper + lower) / 2;
214 cur_mmap_cache = &tcp->mmap_cache[mid];
216 if (ip >= cur_mmap_cache->start_addr &&
217 ip < cur_mmap_cache->end_addr)
218 return cur_mmap_cache;
219 else if (ip < cur_mmap_cache->start_addr)