Commit | Line | Data |
---|---|---|
08388c79 DE |
1 | /* The find command. |
2 | ||
0b302171 | 3 | Copyright (C) 2008-2012 Free Software Foundation, Inc. |
08388c79 DE |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 3 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ | |
19 | ||
20 | #include "defs.h" | |
e17c207e | 21 | #include "arch-utils.h" |
08388c79 DE |
22 | #include <ctype.h> |
23 | #include "gdb_string.h" | |
24 | #include "gdbcmd.h" | |
25 | #include "value.h" | |
26 | #include "target.h" | |
27 | ||
28 | /* Copied from bfd_put_bits. */ | |
29 | ||
30 | static void | |
31 | put_bits (bfd_uint64_t data, char *buf, int bits, bfd_boolean big_p) | |
32 | { | |
33 | int i; | |
34 | int bytes; | |
35 | ||
36 | gdb_assert (bits % 8 == 0); | |
37 | ||
38 | bytes = bits / 8; | |
39 | for (i = 0; i < bytes; i++) | |
40 | { | |
41 | int index = big_p ? bytes - i - 1 : i; | |
42 | ||
43 | buf[index] = data & 0xff; | |
44 | data >>= 8; | |
45 | } | |
46 | } | |
47 | ||
48 | /* Subroutine of find_command to simplify it. | |
49 | Parse the arguments of the "find" command. */ | |
50 | ||
51 | static void | |
52 | parse_find_args (char *args, ULONGEST *max_countp, | |
53 | char **pattern_bufp, ULONGEST *pattern_lenp, | |
e17c207e UW |
54 | CORE_ADDR *start_addrp, ULONGEST *search_space_lenp, |
55 | bfd_boolean big_p) | |
08388c79 DE |
56 | { |
57 | /* Default to using the specified type. */ | |
58 | char size = '\0'; | |
59 | ULONGEST max_count = ~(ULONGEST) 0; | |
60 | /* Buffer to hold the search pattern. */ | |
61 | char *pattern_buf; | |
62 | /* Current size of search pattern buffer. | |
63 | We realloc space as needed. */ | |
64 | #define INITIAL_PATTERN_BUF_SIZE 100 | |
65 | ULONGEST pattern_buf_size = INITIAL_PATTERN_BUF_SIZE; | |
66 | /* Pointer to one past the last in-use part of pattern_buf. */ | |
67 | char *pattern_buf_end; | |
68 | ULONGEST pattern_len; | |
69 | CORE_ADDR start_addr; | |
70 | ULONGEST search_space_len; | |
71 | char *s = args; | |
08388c79 DE |
72 | struct cleanup *old_cleanups; |
73 | struct value *v; | |
74 | ||
75 | if (args == NULL) | |
5e1471f5 | 76 | error (_("Missing search parameters.")); |
08388c79 DE |
77 | |
78 | pattern_buf = xmalloc (pattern_buf_size); | |
79 | pattern_buf_end = pattern_buf; | |
80 | old_cleanups = make_cleanup (free_current_contents, &pattern_buf); | |
81 | ||
82 | /* Get search granularity and/or max count if specified. | |
83 | They may be specified in either order, together or separately. */ | |
84 | ||
85 | while (*s == '/') | |
86 | { | |
87 | ++s; | |
88 | ||
89 | while (*s != '\0' && *s != '/' && !isspace (*s)) | |
90 | { | |
91 | if (isdigit (*s)) | |
92 | { | |
93 | max_count = atoi (s); | |
94 | while (isdigit (*s)) | |
95 | ++s; | |
96 | continue; | |
97 | } | |
98 | ||
99 | switch (*s) | |
100 | { | |
101 | case 'b': | |
102 | case 'h': | |
103 | case 'w': | |
104 | case 'g': | |
105 | size = *s++; | |
106 | break; | |
107 | default: | |
5e1471f5 | 108 | error (_("Invalid size granularity.")); |
08388c79 DE |
109 | } |
110 | } | |
111 | ||
112 | while (isspace (*s)) | |
113 | ++s; | |
114 | } | |
115 | ||
116 | /* Get the search range. */ | |
117 | ||
118 | v = parse_to_comma_and_eval (&s); | |
119 | start_addr = value_as_address (v); | |
120 | ||
121 | if (*s == ',') | |
122 | ++s; | |
123 | while (isspace (*s)) | |
124 | ++s; | |
125 | ||
126 | if (*s == '+') | |
127 | { | |
128 | LONGEST len; | |
bb9bcb69 | 129 | |
08388c79 DE |
130 | ++s; |
131 | v = parse_to_comma_and_eval (&s); | |
132 | len = value_as_long (v); | |
133 | if (len == 0) | |
134 | { | |
5fe41fbf | 135 | do_cleanups (old_cleanups); |
5e1471f5 | 136 | printf_filtered (_("Empty search range.\n")); |
08388c79 DE |
137 | return; |
138 | } | |
139 | if (len < 0) | |
5e1471f5 | 140 | error (_("Invalid length.")); |
08388c79 DE |
141 | /* Watch for overflows. */ |
142 | if (len > CORE_ADDR_MAX | |
143 | || (start_addr + len - 1) < start_addr) | |
5e1471f5 | 144 | error (_("Search space too large.")); |
08388c79 DE |
145 | search_space_len = len; |
146 | } | |
147 | else | |
148 | { | |
149 | CORE_ADDR end_addr; | |
bb9bcb69 | 150 | |
08388c79 DE |
151 | v = parse_to_comma_and_eval (&s); |
152 | end_addr = value_as_address (v); | |
153 | if (start_addr > end_addr) | |
177b42fe | 154 | error (_("Invalid search space, end precedes start.")); |
08388c79 DE |
155 | search_space_len = end_addr - start_addr + 1; |
156 | /* We don't support searching all of memory | |
157 | (i.e. start=0, end = 0xff..ff). | |
158 | Bail to avoid overflows later on. */ | |
159 | if (search_space_len == 0) | |
3e43a32a MS |
160 | error (_("Overflow in address range " |
161 | "computation, choose smaller range.")); | |
08388c79 DE |
162 | } |
163 | ||
164 | if (*s == ',') | |
165 | ++s; | |
166 | ||
167 | /* Fetch the search string. */ | |
168 | ||
169 | while (*s != '\0') | |
170 | { | |
171 | LONGEST x; | |
744a8059 | 172 | struct type *t; |
76b83c51 | 173 | ULONGEST pattern_buf_size_need; |
08388c79 DE |
174 | |
175 | while (isspace (*s)) | |
176 | ++s; | |
177 | ||
178 | v = parse_to_comma_and_eval (&s); | |
744a8059 | 179 | t = value_type (v); |
08388c79 DE |
180 | |
181 | /* Keep it simple and assume size == 'g' when watching for when we | |
182 | need to grow the pattern buf. */ | |
76b83c51 | 183 | pattern_buf_size_need = (pattern_buf_end - pattern_buf |
744a8059 | 184 | + max (TYPE_LENGTH (t), sizeof (int64_t))); |
76b83c51 | 185 | if (pattern_buf_size_need > pattern_buf_size) |
08388c79 DE |
186 | { |
187 | size_t current_offset = pattern_buf_end - pattern_buf; | |
bb9bcb69 | 188 | |
76b83c51 | 189 | pattern_buf_size = pattern_buf_size_need * 2; |
08388c79 DE |
190 | pattern_buf = xrealloc (pattern_buf, pattern_buf_size); |
191 | pattern_buf_end = pattern_buf + current_offset; | |
192 | } | |
193 | ||
194 | if (size != '\0') | |
195 | { | |
196 | x = value_as_long (v); | |
197 | switch (size) | |
198 | { | |
199 | case 'b': | |
200 | *pattern_buf_end++ = x; | |
201 | break; | |
202 | case 'h': | |
203 | put_bits (x, pattern_buf_end, 16, big_p); | |
204 | pattern_buf_end += sizeof (int16_t); | |
205 | break; | |
206 | case 'w': | |
207 | put_bits (x, pattern_buf_end, 32, big_p); | |
208 | pattern_buf_end += sizeof (int32_t); | |
209 | break; | |
210 | case 'g': | |
211 | put_bits (x, pattern_buf_end, 64, big_p); | |
212 | pattern_buf_end += sizeof (int64_t); | |
213 | break; | |
214 | } | |
215 | } | |
216 | else | |
217 | { | |
744a8059 SP |
218 | memcpy (pattern_buf_end, value_contents (v), TYPE_LENGTH (t)); |
219 | pattern_buf_end += TYPE_LENGTH (t); | |
08388c79 DE |
220 | } |
221 | ||
222 | if (*s == ',') | |
223 | ++s; | |
224 | while (isspace (*s)) | |
225 | ++s; | |
226 | } | |
227 | ||
228 | if (pattern_buf_end == pattern_buf) | |
5e1471f5 | 229 | error (_("Missing search pattern.")); |
08388c79 DE |
230 | |
231 | pattern_len = pattern_buf_end - pattern_buf; | |
232 | ||
233 | if (search_space_len < pattern_len) | |
5e1471f5 | 234 | error (_("Search space too small to contain pattern.")); |
08388c79 DE |
235 | |
236 | *max_countp = max_count; | |
237 | *pattern_bufp = pattern_buf; | |
238 | *pattern_lenp = pattern_len; | |
239 | *start_addrp = start_addr; | |
240 | *search_space_lenp = search_space_len; | |
241 | ||
242 | /* We successfully parsed the arguments, leave the freeing of PATTERN_BUF | |
243 | to the caller now. */ | |
244 | discard_cleanups (old_cleanups); | |
245 | } | |
246 | ||
247 | static void | |
248 | find_command (char *args, int from_tty) | |
249 | { | |
e17c207e UW |
250 | struct gdbarch *gdbarch = get_current_arch (); |
251 | bfd_boolean big_p = gdbarch_byte_order (gdbarch) == BFD_ENDIAN_BIG; | |
08388c79 DE |
252 | /* Command line parameters. |
253 | These are initialized to avoid uninitialized warnings from -Wall. */ | |
254 | ULONGEST max_count = 0; | |
255 | char *pattern_buf = 0; | |
256 | ULONGEST pattern_len = 0; | |
257 | CORE_ADDR start_addr = 0; | |
258 | ULONGEST search_space_len = 0; | |
259 | /* End of command line parameters. */ | |
260 | unsigned int found_count; | |
261 | CORE_ADDR last_found_addr; | |
262 | struct cleanup *old_cleanups; | |
263 | ||
264 | parse_find_args (args, &max_count, &pattern_buf, &pattern_len, | |
e17c207e | 265 | &start_addr, &search_space_len, big_p); |
08388c79 DE |
266 | |
267 | old_cleanups = make_cleanup (free_current_contents, &pattern_buf); | |
268 | ||
269 | /* Perform the search. */ | |
270 | ||
271 | found_count = 0; | |
272 | last_found_addr = 0; | |
273 | ||
274 | while (search_space_len >= pattern_len | |
275 | && found_count < max_count) | |
276 | { | |
277 | /* Offset from start of this iteration to the next iteration. */ | |
278 | ULONGEST next_iter_incr; | |
279 | CORE_ADDR found_addr; | |
280 | int found = target_search_memory (start_addr, search_space_len, | |
281 | pattern_buf, pattern_len, &found_addr); | |
282 | ||
283 | if (found <= 0) | |
284 | break; | |
285 | ||
5af949e3 | 286 | print_address (gdbarch, found_addr, gdb_stdout); |
08388c79 DE |
287 | printf_filtered ("\n"); |
288 | ++found_count; | |
289 | last_found_addr = found_addr; | |
290 | ||
291 | /* Begin next iteration at one byte past this match. */ | |
292 | next_iter_incr = (found_addr - start_addr) + 1; | |
293 | ||
294 | /* For robustness, we don't let search_space_len go -ve here. */ | |
295 | if (search_space_len >= next_iter_incr) | |
296 | search_space_len -= next_iter_incr; | |
297 | else | |
298 | search_space_len = 0; | |
299 | start_addr += next_iter_incr; | |
300 | } | |
301 | ||
302 | /* Record and print the results. */ | |
303 | ||
4fa62494 | 304 | set_internalvar_integer (lookup_internalvar ("numfound"), found_count); |
08388c79 DE |
305 | if (found_count > 0) |
306 | { | |
8b9b9e1a | 307 | struct type *ptr_type = builtin_type (gdbarch)->builtin_data_ptr; |
bb9bcb69 | 308 | |
08388c79 | 309 | set_internalvar (lookup_internalvar ("_"), |
8b9b9e1a | 310 | value_from_pointer (ptr_type, last_found_addr)); |
08388c79 DE |
311 | } |
312 | ||
313 | if (found_count == 0) | |
5e1471f5 | 314 | printf_filtered ("Pattern not found.\n"); |
08388c79 | 315 | else |
5e1471f5 | 316 | printf_filtered ("%d pattern%s found.\n", found_count, |
08388c79 DE |
317 | found_count > 1 ? "s" : ""); |
318 | ||
319 | do_cleanups (old_cleanups); | |
320 | } | |
321 | ||
2c0b251b PA |
322 | /* Provide a prototype to silence -Wmissing-prototypes. */ |
323 | extern initialize_file_ftype _initialize_mem_search; | |
324 | ||
08388c79 DE |
325 | void |
326 | _initialize_mem_search (void) | |
327 | { | |
328 | add_cmd ("find", class_vars, find_command, _("\ | |
329 | Search memory for a sequence of bytes.\n\ | |
3e43a32a MS |
330 | Usage:\nfind \ |
331 | [/size-char] [/max-count] start-address, end-address, expr1 [, expr2 ...]\n\ | |
08388c79 DE |
332 | find [/size-char] [/max-count] start-address, +length, expr1 [, expr2 ...]\n\ |
333 | size-char is one of b,h,w,g for 8,16,32,64 bit values respectively,\n\ | |
334 | and if not specified the size is taken from the type of the expression\n\ | |
335 | in the current language.\n\ | |
336 | Note that this means for example that in the case of C-like languages\n\ | |
337 | a search for an untyped 0x42 will search for \"(int) 0x42\"\n\ | |
338 | which is typically four bytes.\n\ | |
339 | \n\ | |
340 | The address of the last match is stored as the value of \"$_\".\n\ | |
341 | Convenience variable \"$numfound\" is set to the number of matches."), | |
342 | &cmdlist); | |
343 | } |