struct value *v;
if (args == NULL)
- error (_("missing search parameters"));
+ error (_("Missing search parameters."));
pattern_buf = xmalloc (pattern_buf_size);
pattern_buf_end = pattern_buf;
size = *s++;
break;
default:
- error (_("invalid size granularity"));
+ error (_("Invalid size granularity."));
}
}
len = value_as_long (v);
if (len == 0)
{
- printf_filtered (_("empty search range\n"));
+ printf_filtered (_("Empty search range.\n"));
return;
}
if (len < 0)
- error (_("invalid length"));
+ error (_("Invalid length."));
/* Watch for overflows. */
if (len > CORE_ADDR_MAX
|| (start_addr + len - 1) < start_addr)
- error (_("search space too large"));
+ error (_("Search space too large."));
search_space_len = len;
}
else
v = parse_to_comma_and_eval (&s);
end_addr = value_as_address (v);
if (start_addr > end_addr)
- error (_("invalid search space, end preceeds start"));
+ error (_("Invalid search space, end preceeds start."));
search_space_len = end_addr - start_addr + 1;
/* We don't support searching all of memory
(i.e. start=0, end = 0xff..ff).
Bail to avoid overflows later on. */
if (search_space_len == 0)
- error (_("overflow in address range computation, choose smaller range"));
+ error (_("Overflow in address range computation, choose smaller range."));
}
if (*s == ',')
}
if (pattern_buf_end == pattern_buf)
- error (_("missing search pattern"));
+ error (_("Missing search pattern."));
pattern_len = pattern_buf_end - pattern_buf;
if (search_space_len < pattern_len)
- error (_("search space too small to contain pattern"));
+ error (_("Search space too small to contain pattern."));
*max_countp = max_count;
*pattern_bufp = pattern_buf;
}
if (found_count == 0)
- printf_filtered ("pattern not found\n");
+ printf_filtered ("Pattern not found.\n");
else
- printf_filtered ("%d pattern%s found\n", found_count,
+ printf_filtered ("%d pattern%s found.\n", found_count,
found_count > 1 ? "s" : "");
do_cleanups (old_cleanups);
if (read_inferior_memory (start_addr, search_buf, search_buf_size) != 0)
{
- warning ("unable to access target memory at 0x%lx, halting search",
+ warning ("Unable to access target memory at 0x%lx, halting search.",
(long) start_addr);
return -1;
}
if (read_inferior_memory (read_addr, search_buf + keep_len,
nr_to_read) != 0)
{
- warning ("unable to access target memory at 0x%lx, halting search",
+ warning ("Unable to access target memory at 0x%lx, halting search.",
(long) read_addr);
return -1;
}
pattern = malloc (packet_len);
if (pattern == NULL)
{
- error ("unable to allocate memory to perform the search");
+ error ("Unable to allocate memory to perform the search");
strcpy (own_buf, "E00");
return;
}
pattern, &pattern_len) < 0)
{
free (pattern);
- error ("error in parsing qSearch:memory packet");
+ error ("Error in parsing qSearch:memory packet");
strcpy (own_buf, "E00");
return;
}
if (search_buf == NULL)
{
free (pattern);
- error ("unable to allocate memory to perform the search");
+ error ("Unable to allocate memory to perform the search");
strcpy (own_buf, "E00");
return;
}
search_buf = malloc (search_buf_size);
if (search_buf == NULL)
- error (_("unable to allocate memory to perform the search"));
+ error (_("Unable to allocate memory to perform the search."));
old_cleanups = make_cleanup (free_current_contents, &search_buf);
/* Prime the search buffer. */
if (target_read (ops, TARGET_OBJECT_MEMORY, NULL,
search_buf, start_addr, search_buf_size) != search_buf_size)
{
- warning (_("unable to access target memory at %s, halting search"),
+ warning (_("Unable to access target memory at %s, halting search."),
hex_string (start_addr));
do_cleanups (old_cleanups);
return -1;
search_buf + keep_len, read_addr,
nr_to_read) != nr_to_read)
{
- warning (_("unable to access target memory at %s, halting search"),
+ warning (_("Unable to access target memory at %s, halting search."),
hex_string (read_addr));
do_cleanups (old_cleanups);
return -1;