gdb/linespec.c - gdb

Global variables defined

Data types defined

Functions defined

Macros defined

Source code

  1. /* Parser for linespec for the GNU debugger, GDB.

  3.    Copyright (C) 1986-2015 Free Software Foundation, Inc.

  5.    This file is part of GDB.

  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.

  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.

  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/>.  */

  20. #include "defs.h"
  21. #include "symtab.h"
  22. #include "frame.h"
  23. #include "command.h"
  24. #include "symfile.h"
  25. #include "objfiles.h"
  26. #include "source.h"
  27. #include "demangle.h"
  28. #include "value.h"
  29. #include "completer.h"
  30. #include "cp-abi.h"
  31. #include "cp-support.h"
  32. #include "parser-defs.h"
  33. #include "block.h"
  34. #include "objc-lang.h"
  35. #include "linespec.h"
  36. #include "language.h"
  37. #include "interps.h"
  38. #include "mi/mi-cmds.h"
  39. #include "target.h"
  40. #include "arch-utils.h"
  41. #include <ctype.h>
  42. #include "cli/cli-utils.h"
  43. #include "filenames.h"
  44. #include "ada-lang.h"
  45. #include "stack.h"

  47. ‌typedef struct symbol *symbolp;
  48. ‌DEF_VEC_P (symbolp);

  50. ‌typedef struct type *typep;
  51. ‌DEF_VEC_P (typep);

  53. /* An address entry is used to ensure that any given location is only
  54.    added to the result a single time.  It holds an address and the
  55.    program space from which the address came.  */

  57. ‌struct address_entry
  58. {
  59.   struct program_space *pspace;
  60.   CORE_ADDR addr;
  61. };

  63. ‌typedef struct bound_minimal_symbol bound_minimal_symbol_d;

  65. ‌DEF_VEC_O (bound_minimal_symbol_d);

  67. /* An enumeration of possible signs for a line offset.  */
  68. ‌enum offset_relative_sign
  69. {
  70.   /* No sign  */
  71.   LINE_OFFSET_NONE,

  73.   /* A plus sign ("+")  */
  74.   LINE_OFFSET_PLUS,

  76.   /* A minus sign ("-")  */
  77.   LINE_OFFSET_MINUS,

  79.   /* A special "sign" for unspecified offset.  */
  80.   LINE_OFFSET_UNKNOWN
  81. };

  83. /* A line offset in a linespec.  */

  85. ‌struct line_offset
  86. {
  87.   /* Line offset and any specified sign.  */
  88.   int offset;
  89.   enum offset_relative_sign sign;
  90. };

  92. /* A linespec.  Elements of this structure are filled in by a parser
  93.    (either parse_linespec or some other function).  The structure is
  94.    then converted into SALs by convert_linespec_to_sals.  */

  96. ‌struct linespec
  97. {
  98.   /* An expression and the resulting PC.  Specifying an expression
  99.      currently precludes the use of other members.  */

  101.   /* The expression entered by the user.  */
  102.   const char *expression;

  104.   /* The resulting PC expression derived from evaluating EXPRESSION.  */
  105.   CORE_ADDR expr_pc;

  107.   /* Any specified file symtabs.  */

  109.   /* The user-supplied source filename or NULL if none was specified.  */
  110.   const char *source_filename;

  112.   /* The list of symtabs to search to which to limit the search.  May not
  113.      be NULL.  If SOURCE_FILENAME is NULL (no user-specified filename),
  114.      FILE_SYMTABS should contain one single NULL member.  This will
  115.      cause the code to use the default symtab.  */
  116.   VEC (symtab_ptr) *file_symtabs;

  118.   /* The name of a function or method and any matching symbols.  */

  120.   /* The user-specified function name.  If no function name was
  121.      supplied, this may be NULL.  */
  122.   const char *function_name;

  124.   /* A list of matching function symbols and minimal symbols.  Both lists
  125.      may be NULL if no matching symbols were found.  */
  126.   VEC (symbolp) *function_symbols;
  127.   VEC (bound_minimal_symbol_d) *minimal_symbols;

  129.   /* The name of a label and matching symbols.  */

  131.   /* The user-specified label name.  */
  132.   const char *label_name;

  134.   /* A structure of matching label symbols and the corresponding
  135.      function symbol in which the label was found.  Both may be NULL
  136.      or both must be non-NULL.  */
  137.   struct
  138.   {
  139.     VEC (symbolp) *label_symbols;
  140.     VEC (symbolp) *function_symbols;
  141.   } labels;

  143.   /* Line offset.  It may be LINE_OFFSET_UNKNOWN, meaning that no
  144.    offset was specified.  */
  145.   struct line_offset line_offset;
  146. };
  147. ‌typedef struct linespec *linespec_p;

  149. /* A canonical linespec represented as a symtab-related string.

  151.    Each entry represents the "SYMTAB:SUFFIX" linespec string.
  152.    SYMTAB can be converted for example by symtab_to_fullname or
  153.    symtab_to_filename_for_display as needed.  */

  155. ‌struct linespec_canonical_name
  156. {
  157.   /* Remaining text part of the linespec string.  */
  158.   char *suffix;

  160.   /* If NULL then SUFFIX is the whole linespec string.  */
  161.   struct symtab *symtab;
  162. };

  164. /* An instance of this is used to keep all state while linespec
  165.    operates.  This instance is passed around as a 'this' pointer to
  166.    the various implementation methods.  */

  168. ‌struct linespec_state
  169. {
  170.   /* The language in use during linespec processing.  */
  171.   const struct language_defn *language;

  173.   /* The program space as seen when the module was entered.  */
  174.   struct program_space *program_space;

  176.   /* The default symtab to use, if no other symtab is specified.  */
  177.   struct symtab *default_symtab;

  179.   /* The default line to use.  */
  180.   int default_line;

  182.   /* The 'funfirstline' value that was passed in to decode_line_1 or
  183.      decode_line_full.  */
  184.   int funfirstline;

  186.   /* Nonzero if we are running in 'list' mode; see decode_line_list.  */
  187.   int list_mode;

  189.   /* The 'canonical' value passed to decode_line_full, or NULL.  */
  190.   struct linespec_result *canonical;

  192.   /* Canonical strings that mirror the symtabs_and_lines result.  */
  193.   struct linespec_canonical_name *canonical_names;

  195.   /* This is a set of address_entry objects which is used to prevent
  196.      duplicate symbols from being entered into the result.  */
  197.   htab_t addr_set;
  198. };

  200. /* This is a helper object that is used when collecting symbols into a
  201.    result.  */

  203. ‌struct collect_info
  204. {
  205.   /* The linespec object in use.  */
  206.   struct linespec_state *state;

  208.   /* A list of symtabs to which to restrict matches.  */
  209.   VEC (symtab_ptr) *file_symtabs;

  211.   /* The result being accumulated.  */
  212.   struct
  213.   {
  214.     VEC (symbolp) *symbols;
  215.     VEC (bound_minimal_symbol_d) *minimal_symbols;
  216.   } result;
  217. };

  219. /* Token types  */

  221. ‌enum ls_token_type
  222. {
  223.   /* A keyword  */
  224.   LSTOKEN_KEYWORD = 0,

  226.   /* A colon "separator"  */
  227.   LSTOKEN_COLON,

  229.   /* A string  */
  230.   LSTOKEN_STRING,

  232.   /* A number  */
  233.   LSTOKEN_NUMBER,

  235.   /* A comma  */
  236.   LSTOKEN_COMMA,

  238.   /* EOI (end of input)  */
  239.   LSTOKEN_EOI,

  241.   /* Consumed token  */
  242.   LSTOKEN_CONSUMED
  243. };
  244. ‌typedef enum ls_token_type linespec_token_type;

  246. /* List of keywords  */

  248. ‌static const char * const linespec_keywords[] = { "if", "thread", "task" };

  250. /* A token of the linespec lexer  */

  252. ‌struct ls_token
  253. {
  254.   /* The type of the token  */
  255.   linespec_token_type type;

  257.   /* Data for the token  */
  258.   union
  259.   {
  260.     /* A string, given as a stoken  */
  261.     struct stoken string;

  263.     /* A keyword  */
  264.     const char *keyword;
  265.   } data;
  266. };
  267. ‌typedef struct ls_token linespec_token;

  269. ‌#define LS_TOKEN_STOKEN(TOK) (TOK).data.string
  270. ‌#define LS_TOKEN_KEYWORD(TOK) (TOK).data.keyword

  272. /* An instance of the linespec parser.  */

  274. ‌struct ls_parser
  275. {
  276.   /* Lexer internal data  */
  277.   struct
  278.   {
  279.     /* Save head of input stream.  */
  280.     const char *saved_arg;

  282.     /* Head of the input stream.  */
  283.     const char **stream;
  284. ‌#define PARSER_STREAM(P) (*(P)->lexer.stream)

  286.     /* The current token.  */
  287.     linespec_token current;
  288.   } lexer;

  290.   /* Is the entire linespec quote-enclosed?  */
  291.   int is_quote_enclosed;

  293.   /* Is a keyword syntactically valid at this point?
  294.      In, e.g., "break thread thread 1", the leading "keyword" must not
  295.      be interpreted as such.  */
  296.   int keyword_ok;

  298.   /* The state of the parse.  */
  299.   struct linespec_state state;
  300. ‌#define PARSER_STATE(PPTR) (&(PPTR)->state)

  302.   /* The result of the parse.  */
  303.   struct linespec result;
  304. ‌#define PARSER_RESULT(PPTR) (&(PPTR)->result)
  305. };
  306. ‌typedef struct ls_parser linespec_parser;

  308. /* Prototypes for local functions.  */

  310. static void iterate_over_file_blocks (struct symtab *symtab,
  311.                                       const char *name, domain_enum domain,
  312.                                       symbol_found_callback_ftype *callback,
  313.                                       void *data);

  315. static void initialize_defaults (struct symtab **default_symtab,
  316.                                  int *default_line);

  318. static CORE_ADDR linespec_expression_to_pc (const char **exp_ptr);

  320. static struct symtabs_and_lines decode_objc (struct linespec_state *self,
  321.                                              linespec_p ls,
  322.                                              const char **argptr);

  324. static VEC (symtab_ptr) *symtabs_from_filename (const char *);

  326. static VEC (symbolp) *find_label_symbols (struct linespec_state *self,
  327.                                           VEC (symbolp) *function_symbols,
  328.                                           VEC (symbolp) **label_funcs_ret,
  329.                                           const char *name);

  331. static void find_linespec_symbols (struct linespec_state *self,
  332.                                    VEC (symtab_ptr) *file_symtabs,
  333.                                    const char *name,
  334.                                    VEC (symbolp) **symbols,
  335.                                    VEC (bound_minimal_symbol_d) **minsyms);

  337. static struct line_offset
  338.      linespec_parse_variable (struct linespec_state *self,
  339.                               const char *variable);

  341. static int symbol_to_sal (struct symtab_and_line *result,
  342.                           int funfirstline, struct symbol *sym);

  344. static void add_matching_symbols_to_info (const char *name,
  345.                                           struct collect_info *info,
  346.                                           struct program_space *pspace);

  348. static void add_all_symbol_names_from_pspace (struct collect_info *info,
  349.                                               struct program_space *pspace,
  350.                                               VEC (const_char_ptr) *names);

  352. static VEC (symtab_ptr) *collect_symtabs_from_filename (const char *file);

  354. static void decode_digits_ordinary (struct linespec_state *self,
  355.                                     linespec_p ls,
  356.                                     int line,
  357.                                     struct symtabs_and_lines *sals,
  358.                                     struct linetable_entry **best_entry);

  360. static void decode_digits_list_mode (struct linespec_state *self,
  361.                                      linespec_p ls,
  362.                                      struct symtabs_and_lines *values,
  363.                                      struct symtab_and_line val);

  365. static void minsym_found (struct linespec_state *self, struct objfile *objfile,
  366.                           struct minimal_symbol *msymbol,
  367.                           struct symtabs_and_lines *result);

  369. static int compare_symbols (const void *a, const void *b);

  371. static int compare_msymbols (const void *a, const void *b);

  373. static const char *find_toplevel_char (const char *s, char c);

  375. /* Permitted quote characters for the parser.  This is different from the
  376.    completer's quote characters to allow backward compatibility with the
  377.    previous parser.  */
  378. ‌static const char *const linespec_quote_characters = "\"\'";

  380. /* Lexer functions.  */

  382. /* Lex a number from the input in PARSER.  This only supports
  383.    decimal numbers.

  385.    Return true if input is decimal numbers.  Return false if not.  */

  387. static int
  388. ‌linespec_lexer_lex_number (linespec_parser *parser, linespec_token *tokenp)
  389. {
  390.   tokenp->type = LSTOKEN_NUMBER;
  391.   LS_TOKEN_STOKEN (*tokenp).length = 0;
  392.   LS_TOKEN_STOKEN (*tokenp).ptr = PARSER_STREAM (parser);

  394.   /* Keep any sign at the start of the stream.  */
  395.   if (*PARSER_STREAM (parser) == '+' || *PARSER_STREAM (parser) == '-')
  396.     {
  397.       ++LS_TOKEN_STOKEN (*tokenp).length;
  398.       ++(PARSER_STREAM (parser));
  399.     }

  401.   while (isdigit (*PARSER_STREAM (parser)))
  402.     {
  403.       ++LS_TOKEN_STOKEN (*tokenp).length;
  404.       ++(PARSER_STREAM (parser));
  405.     }

  407.   /* If the next character in the input buffer is not a space, comma,
  408.      quote, or colon, this input does not represent a number.  */
  409.   if (*PARSER_STREAM (parser) != '\0'
  410.       && !isspace (*PARSER_STREAM (parser)) && *PARSER_STREAM (parser) != ','
  411.       && *PARSER_STREAM (parser) != ':'
  412.       && !strchr (linespec_quote_characters, *PARSER_STREAM (parser)))
  413.     {
  414.       PARSER_STREAM (parser) = LS_TOKEN_STOKEN (*tokenp).ptr;
  415.       return 0;
  416.     }

  418.   return 1;
  419. }

  421. /* Does P represent one of the keywords?  If so, return
  422.    the keyword.  If not, return NULL.  */

  424. static const char *
  425. ‌linespec_lexer_lex_keyword (const char *p)
  426. {
  427.   int i;

  429.   if (p != NULL)
  430.     {
  431.       for (i = 0; i < ARRAY_SIZE (linespec_keywords); ++i)
  432.         {
  433.           int len = strlen (linespec_keywords[i]);

  435.           /* If P begins with one of the keywords and the next
  436.              character is not a valid identifier character,
  437.              we have found a keyword.  */
  438.           if (strncmp (p, linespec_keywords[i], len) == 0
  439.               && !(isalnum (p[len]) || p[len] == '_'))
  440.             return linespec_keywords[i];
  441.         }
  442.     }

  444.   return NULL;
  445. }

  447. /* Does STRING represent an Ada operator?  If so, return the length
  448.    of the decoded operator name.  If not, return 0.  */

  450. static int
  451. ‌is_ada_operator (const char *string)
  452. {
  453.   const struct ada_opname_map *mapping;

  455.   for (mapping = ada_opname_table;
  456.        mapping->encoded != NULL
  457.          && strncmp (mapping->decoded, string,
  458.                      strlen (mapping->decoded)) != 0; ++mapping)
  459.     ;

  461.   return mapping->decoded == NULL ? 0 : strlen (mapping->decoded);
  462. }

  464. /* Find QUOTE_CHAR in STRING, accounting for the ':' terminal.  Return
  465.    the location of QUOTE_CHAR, or NULL if not found.  */

  467. static const char *
  468. ‌skip_quote_char (const char *string, char quote_char)
  469. {
  470.   const char *p, *last;

  472.   p = last = find_toplevel_char (string, quote_char);
  473.   while (p && *p != '\0' && *p != ':')
  474.     {
  475.       p = find_toplevel_char (p, quote_char);
  476.       if (p != NULL)
  477.         last = p++;
  478.     }

  480.   return last;
  481. }

  483. /* Make a writable copy of the string given in TOKEN, trimming
  484.    any trailing whitespace.  */

  486. static char *
  487. ‌copy_token_string (linespec_token token)
  488. {
  489.   char *str, *s;

  491.   if (token.type == LSTOKEN_KEYWORD)
  492.     return xstrdup (LS_TOKEN_KEYWORD (token));

  494.   str = savestring (LS_TOKEN_STOKEN (token).ptr,
  495.                     LS_TOKEN_STOKEN (token).length);
  496.   s = remove_trailing_whitespace (str, str + LS_TOKEN_STOKEN (token).length);
  497.   *s = '\0';

  499.   return str;
  500. }

  502. /* Does P represent the end of a quote-enclosed linespec?  */

  504. static int
  505. ‌is_closing_quote_enclosed (const char *p)
  506. {
  507.   if (strchr (linespec_quote_characters, *p))
  508.     ++p;
  509.   p = skip_spaces ((char *) p);
  510.   return (*p == '\0' || linespec_lexer_lex_keyword (p));
  511. }

  513. /* Find the end of the parameter list that starts with *INPUT.
  514.    This helper function assists with lexing string segments
  515.    which might contain valid (non-terminating) commas.  */

  517. static const char *
  518. ‌find_parameter_list_end (const char *input)
  519. {
  520.   char end_char, start_char;
  521.   int depth;
  522.   const char *p;

  524.   start_char = *input;
  525.   if (start_char == '(')
  526.     end_char = ')';
  527.   else if (start_char == '<')
  528.     end_char = '>';
  529.   else
  530.     return NULL;

  532.   p = input;
  533.   depth = 0;
  534.   while (*p)
  535.     {
  536.       if (*p == start_char)
  537.         ++depth;
  538.       else if (*p == end_char)
  539.         {
  540.           if (--depth == 0)
  541.             {
  542.               ++p;
  543.               break;
  544.             }
  545.         }
  546.       ++p;
  547.     }

  549.   return p;
  550. }


  553. /* Lex a string from the input in PARSER.  */

  555. static linespec_token
  556. ‌linespec_lexer_lex_string (linespec_parser *parser)
  557. {
  558.   linespec_token token;
  559.   const char *start = PARSER_STREAM (parser);

  561.   token.type = LSTOKEN_STRING;

  563.   /* If the input stream starts with a quote character, skip to the next
  564.      quote character, regardless of the content.  */
  565.   if (strchr (linespec_quote_characters, *PARSER_STREAM (parser)))
  566.     {
  567.       const char *end;
  568.       char quote_char = *PARSER_STREAM (parser);

  570.       /* Special case: Ada operators.  */
  571.       if (PARSER_STATE (parser)->language->la_language == language_ada
  572.           && quote_char == '\"')
  573.         {
  574.           int len = is_ada_operator (PARSER_STREAM (parser));

  576.           if (len != 0)
  577.             {
  578.               /* The input is an Ada operator.  Return the quoted string
  579.                  as-is.  */
  580.               LS_TOKEN_STOKEN (token).ptr = PARSER_STREAM (parser);
  581.               LS_TOKEN_STOKEN (token).length = len;
  582.               PARSER_STREAM (parser) += len;
  583.               return token;
  584.             }

  586.           /* The input does not represent an Ada operator -- fall through
  587.              to normal quoted string handling.  */
  588.         }

  590.       /* Skip past the beginning quote.  */
  591.       ++(PARSER_STREAM (parser));

  593.       /* Mark the start of the string.  */
  594.       LS_TOKEN_STOKEN (token).ptr = PARSER_STREAM (parser);

  596.       /* Skip to the ending quote.  */
  597.       end = skip_quote_char (PARSER_STREAM (parser), quote_char);

  599.       /* Error if the input did not terminate properly.  */
  600.       if (end == NULL)
  601.         error (_("unmatched quote"));

  603.       /* Skip over the ending quote and mark the length of the string.  */
  604.       PARSER_STREAM (parser) = (char *) ++end;
  605.       LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - 2 - start;
  606.     }
  607.   else
  608.     {
  609.       const char *p;

  611.       /* Otherwise, only identifier characters are permitted.
  612.          Spaces are the exception.  In general, we keep spaces,
  613.          but only if the next characters in the input do not resolve
  614.          to one of the keywords.

  616.          This allows users to forgo quoting CV-qualifiers, template arguments,
  617.          and similar common language constructs.  */

  619.       while (1)
  620.         {
  621.           if (isspace (*PARSER_STREAM (parser)))
  622.             {
  623.               p = skip_spaces_const (PARSER_STREAM (parser));
  624.               /* When we get here we know we've found something followed by
  625.                  a space (we skip over parens and templates below).
  626.                  So if we find a keyword now, we know it is a keyword and not,
  627.                  say, a function name.  */
  628.               if (linespec_lexer_lex_keyword (p) != NULL)
  629.                 {
  630.                   LS_TOKEN_STOKEN (token).ptr = start;
  631.                   LS_TOKEN_STOKEN (token).length
  632.                     = PARSER_STREAM (parser) - start;
  633.                   return token;
  634.                 }

  636.               /* Advance past the whitespace.  */
  637.               PARSER_STREAM (parser) = p;
  638.             }

  640.           /* If the next character is EOI or (single) ':', the
  641.              string is complete;  return the token.  */
  642.           if (*PARSER_STREAM (parser) == 0)
  643.             {
  644.               LS_TOKEN_STOKEN (token).ptr = start;
  645.               LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start;
  646.               return token;
  647.             }
  648.           else if (PARSER_STREAM (parser)[0] == ':')
  649.             {
  650.               /* Do not tokenize the C++ scope operator. */
  651.               if (PARSER_STREAM (parser)[1] == ':')
  652.                 ++(PARSER_STREAM (parser));

  654.               /* Do not tokenify if the input length so far is one
  655.                  (i.e, a single-letter drive name) and the next character
  656.                  is a directory separator.  This allows Windows-style
  657.                  paths to be recognized as filenames without quoting it.  */
  658.               else if ((PARSER_STREAM (parser) - start) != 1
  659.                        || !IS_DIR_SEPARATOR (PARSER_STREAM (parser)[1]))
  660.                 {
  661.                   LS_TOKEN_STOKEN (token).ptr = start;
  662.                   LS_TOKEN_STOKEN (token).length
  663.                     = PARSER_STREAM (parser) - start;
  664.                   return token;
  665.                 }
  666.             }
  667.           /* Special case: permit quote-enclosed linespecs.  */
  668.           else if (parser->is_quote_enclosed
  669.                    && strchr (linespec_quote_characters,
  670.                               *PARSER_STREAM (parser))
  671.                    && is_closing_quote_enclosed (PARSER_STREAM (parser)))
  672.             {
  673.               LS_TOKEN_STOKEN (token).ptr = start;
  674.               LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start;
  675.               return token;
  676.             }
  677.           /* Because commas may terminate a linespec and appear in
  678.              the middle of valid string input, special cases for
  679.              '<' and '(' are necessary.  */
  680.           else if (*PARSER_STREAM (parser) == '<'
  681.                    || *PARSER_STREAM (parser) == '(')
  682.             {
  683.               const char *p;

  685.               p = find_parameter_list_end (PARSER_STREAM (parser));
  686.               if (p != NULL)
  687.                 {
  688.                   PARSER_STREAM (parser) = p;
  689.                   continue;
  690.                 }
  691.             }
  692.           /* Commas are terminators, but not if they are part of an
  693.              operator name.  */
  694.           else if (*PARSER_STREAM (parser) == ',')
  695.             {
  696.               if ((PARSER_STATE (parser)->language->la_language
  697.                    == language_cplus)
  698.                   && (PARSER_STREAM (parser) - start) > 8
  699.                   /* strlen ("operator") */)
  700.                 {
  701.                   char *p = strstr (start, "operator");

  703.                   if (p != NULL && is_operator_name (p))
  704.                     {
  705.                       /* This is an operator name.  Keep going.  */
  706.                       ++(PARSER_STREAM (parser));
  707.                       continue;
  708.                     }
  709.                 }

  711.               /* Comma terminates the string.  */
  712.               LS_TOKEN_STOKEN (token).ptr = start;
  713.               LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start;
  714.               return token;
  715.             }

  717.           /* Advance the stream.  */
  718.           ++(PARSER_STREAM (parser));
  719.         }
  720.     }

  722.   return token;
  723. }

  725. /* Lex a single linespec token from PARSER.  */

  727. static linespec_token
  728. ‌linespec_lexer_lex_one (linespec_parser *parser)
  729. {
  730.   const char *keyword;

  732.   if (parser->lexer.current.type == LSTOKEN_CONSUMED)
  733.     {
  734.       /* Skip any whitespace.  */
  735.       PARSER_STREAM (parser) = skip_spaces_const (PARSER_STREAM (parser));

  737.       /* Check for a keyword, they end the linespec.  */
  738.       keyword = NULL;
  739.       if (parser->keyword_ok)
  740.         keyword = linespec_lexer_lex_keyword (PARSER_STREAM (parser));
  741.       if (keyword != NULL)
  742.         {
  743.           parser->lexer.current.type = LSTOKEN_KEYWORD;
  744.           LS_TOKEN_KEYWORD (parser->lexer.current) = keyword;
  745.           return parser->lexer.current;
  746.         }

  748.       /* Handle other tokens.  */
  749.       switch (*PARSER_STREAM (parser))
  750.         {
  751.         case 0:
  752.           parser->lexer.current.type = LSTOKEN_EOI;
  753.           break;

  755.         case '+': case '-':
  756.         case '0': case '1': case '2': case '3': case '4':
  757.         case '5': case '6': case '7': case '8': case '9':
  758.            if (!linespec_lexer_lex_number (parser, &(parser->lexer.current)))
  759.              parser->lexer.current = linespec_lexer_lex_string (parser);
  760.           break;

  762.         case ':':
  763.           /* If we have a scope operator, lex the input as a string.
  764.              Otherwise, return LSTOKEN_COLON.  */
  765.           if (PARSER_STREAM (parser)[1] == ':')
  766.             parser->lexer.current = linespec_lexer_lex_string (parser);
  767.           else
  768.             {
  769.               parser->lexer.current.type = LSTOKEN_COLON;
  770.               ++(PARSER_STREAM (parser));
  771.             }
  772.           break;

  774.         case '\'': case '\"':
  775.           /* Special case: permit quote-enclosed linespecs.  */
  776.           if (parser->is_quote_enclosed
  777.               && is_closing_quote_enclosed (PARSER_STREAM (parser)))
  778.             {
  779.               ++(PARSER_STREAM (parser));
  780.               parser->lexer.current.type = LSTOKEN_EOI;
  781.             }
  782.           else
  783.             parser->lexer.current = linespec_lexer_lex_string (parser);
  784.           break;

  786.         case ',':
  787.           parser->lexer.current.type = LSTOKEN_COMMA;
  788.           LS_TOKEN_STOKEN (parser->lexer.current).ptr
  789.             = PARSER_STREAM (parser);
  790.           LS_TOKEN_STOKEN (parser->lexer.current).length = 1;
  791.           ++(PARSER_STREAM (parser));
  792.           break;

  794.         default:
  795.           /* If the input is not a number, it must be a string.
  796.              [Keywords were already considered above.]  */
  797.           parser->lexer.current = linespec_lexer_lex_string (parser);
  798.           break;
  799.         }
  800.     }

  802.   return parser->lexer.current;
  803. }

  805. /* Consume the current token and return the next token in PARSER's
  806.    input stream.  */

  808. static linespec_token
  809. ‌linespec_lexer_consume_token (linespec_parser *parser)
  810. {
  811.   parser->lexer.current.type = LSTOKEN_CONSUMED;
  812.   return linespec_lexer_lex_one (parser);
  813. }

  815. /* Return the next token without consuming the current token.  */

  817. static linespec_token
  818. ‌linespec_lexer_peek_token (linespec_parser *parser)
  819. {
  820.   linespec_token next;
  821.   const char *saved_stream = PARSER_STREAM (parser);
  822.   linespec_token saved_token = parser->lexer.current;

  824.   next = linespec_lexer_consume_token (parser);
  825.   PARSER_STREAM (parser) = saved_stream;
  826.   parser->lexer.current = saved_token;
  827.   return next;
  828. }

  830. /* Helper functions.  */

  832. /* Add SAL to SALS.  */

  834. static void
  835. ‌add_sal_to_sals_basic (struct symtabs_and_lines *sals,
  836.                        struct symtab_and_line *sal)
  837. {
  838.   ++sals->nelts;
  839.   sals->sals = xrealloc (sals->sals, sals->nelts * sizeof (sals->sals[0]));
  840.   sals->sals[sals->nelts - 1] = *sal;
  841. }

  843. /* Add SAL to SALS, and also update SELF->CANONICAL_NAMES to reflect
  844.    the new sal, if needed.  If not NULL, SYMNAME is the name of the
  845.    symbol to use when constructing the new canonical name.

  847.    If LITERAL_CANONICAL is non-zero, SYMNAME will be used as the
  848.    canonical name for the SAL.  */

  850. static void
  851. ‌add_sal_to_sals (struct linespec_state *self,
  852.                  struct symtabs_and_lines *sals,
  853.                  struct symtab_and_line *sal,
  854.                  const char *symname, int literal_canonical)
  855. {
  856.   add_sal_to_sals_basic (sals, sal);

  858.   if (self->canonical)
  859.     {
  860.       struct linespec_canonical_name *canonical;

  862.       self->canonical_names = xrealloc (self->canonical_names,
  863.                                         (sals->nelts
  864.                                          * sizeof (*self->canonical_names)));
  865.       canonical = &self->canonical_names[sals->nelts - 1];
  866.       if (!literal_canonical && sal->symtab)
  867.         {
  868.           const char *fullname = symtab_to_fullname (sal->symtab);

  870.           /* Note that the filter doesn't have to be a valid linespec
  871.              input.  We only apply the ":LINE" treatment to Ada for
  872.              the time being.  */
  873.           if (symname != NULL && sal->line != 0
  874.               && self->language->la_language == language_ada)
  875.             canonical->suffix = xstrprintf ("%s:%d", symname, sal->line);
  876.           else if (symname != NULL)
  877.             canonical->suffix = xstrdup (symname);
  878.           else
  879.             canonical->suffix = xstrprintf ("%d", sal->line);
  880.           canonical->symtab = sal->symtab;
  881.         }
  882.       else
  883.         {
  884.           if (symname != NULL)
  885.             canonical->suffix = xstrdup (symname);
  886.           else
  887.             canonical->suffix = xstrdup ("<unknown>");
  888.           canonical->symtab = NULL;
  889.         }
  890.     }
  891. }

  893. /* A hash function for address_entry.  */

  895. static hashval_t
  896. ‌hash_address_entry (const void *p)
  897. {
  898.   const struct address_entry *aep = p;
  899.   hashval_t hash;

  901.   hash = iterative_hash_object (aep->pspace, 0);
  902.   return iterative_hash_object (aep->addr, hash);
  903. }

  905. /* An equality function for address_entry.  */

  907. static int
  908. ‌eq_address_entry (const void *a, const void *b)
  909. {
  910.   const struct address_entry *aea = a;
  911.   const struct address_entry *aeb = b;

  913.   return aea->pspace == aeb->pspace && aea->addr == aeb->addr;
  914. }

  916. /* Check whether the address, represented by PSPACE and ADDR, is
  917.    already in the set.  If so, return 0.  Otherwise, add it and return
  918.    1.  */

  920. static int
  921. ‌maybe_add_address (htab_t set, struct program_space *pspace, CORE_ADDR addr)
  922. {
  923.   struct address_entry e, *p;
  924.   void **slot;

  926.   e.pspace = pspace;
  927.   e.addr = addr;
  928.   slot = htab_find_slot (set, &e, INSERT);
  929.   if (*slot)
  930.     return 0;

  932.   p = XNEW (struct address_entry);
  933.   memcpy (p, &e, sizeof (struct address_entry));
  934.   *slot = p;

  936.   return 1;
  937. }

  939. /* A callback function and the additional data to call it with.  */

  941. ‌struct symbol_and_data_callback
  942. {
  943.   /* The callback to use.  */
  944.   symbol_found_callback_ftype *callback;

  946.   /* Data to be passed to the callback.  */
  947.   void *data;
  948. };

  950. /* A helper for iterate_over_all_matching_symtabs that is used to
  951.    restrict calls to another callback to symbols representing inline
  952.    symbols only.  */

  954. static int
  955. ‌iterate_inline_only (struct symbol *sym, void *d)
  956. {
  957.   if (SYMBOL_INLINED (sym))
  958.     {
  959.       struct symbol_and_data_callback *cad = d;

  961.       return cad->callback (sym, cad->data);
  962.     }
  963.   return 1; /* Continue iterating.  */
  964. }

  966. /* Some data for the expand_symtabs_matching callback.  */

  968. ‌struct symbol_matcher_data
  969. {
  970.   /* The lookup name against which symbol name should be compared.  */
  971.   const char *lookup_name;

  973.   /* The routine to be used for comparison.  */
  974.   symbol_name_cmp_ftype symbol_name_cmp;
  975. };

  977. /* A helper for iterate_over_all_matching_symtabs that is passed as a
  978.    callback to the expand_symtabs_matching method.  */

  980. static int
  981. ‌iterate_name_matcher (const char *name, void *d)
  982. {
  983.   const struct symbol_matcher_data *data = d;

  985.   if (data->symbol_name_cmp (name, data->lookup_name) == 0)
  986.     return 1; /* Expand this symbol's symbol table.  */
  987.   return 0; /* Skip this symbol.  */
  988. }

  990. /* A helper that walks over all matching symtabs in all objfiles and
  991.    calls CALLBACK for each symbol matching NAME.  If SEARCH_PSPACE is
  992.    not NULL, then the search is restricted to just that program
  993.    space.  If INCLUDE_INLINE is nonzero then symbols representing
  994.    inlined instances of functions will be included in the result.  */

  996. static void
  997. ‌iterate_over_all_matching_symtabs (struct linespec_state *state,
  998.                                    const char *name,
  999.                                    const domain_enum domain,
  1000.                                    symbol_found_callback_ftype *callback,
  1001.                                    void *data,
  1002.                                    struct program_space *search_pspace,
  1003.                                    int include_inline)
  1004. {
  1005.   struct objfile *objfile;
  1006.   struct program_space *pspace;
  1007.   struct symbol_matcher_data matcher_data;

  1009.   matcher_data.lookup_name = name;
  1010.   matcher_data.symbol_name_cmp =
  1011.     state->language->la_get_symbol_name_cmp != NULL
  1012.     ? state->language->la_get_symbol_name_cmp (name)
  1013.     : strcmp_iw;

  1015.   ALL_PSPACES (pspace)
  1016.   {
  1017.     if (search_pspace != NULL && search_pspace != pspace)
  1018.       continue;
  1019.     if (pspace->executing_startup)
  1020.       continue;

  1022.     set_current_program_space (pspace);

  1024.     ALL_OBJFILES (objfile)
  1025.     {
  1026.       struct compunit_symtab *cu;

  1028.       if (objfile->sf)
  1029.         objfile->sf->qf->expand_symtabs_matching (objfile, NULL,
  1030.                                                   iterate_name_matcher,
  1031.                                                   ALL_DOMAIN,
  1032.                                                   &matcher_data);

  1034.       ALL_OBJFILE_COMPUNITS (objfile, cu)
  1035.         {
  1036.           struct symtab *symtab = COMPUNIT_FILETABS (cu);

  1038.           iterate_over_file_blocks (symtab, name, domain, callback, data);

  1040.           if (include_inline)
  1041.             {
  1042.               struct symbol_and_data_callback cad = { callback, data };
  1043.               struct block *block;
  1044.               int i;

  1046.               for (i = FIRST_LOCAL_BLOCK;
  1047.                    i < BLOCKVECTOR_NBLOCKS (SYMTAB_BLOCKVECTOR (symtab));
  1048.                    i++)
  1049.                 {
  1050.                   block = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab), i);
  1051.                   state->language->la_iterate_over_symbols
  1052.                     (block, name, domain, iterate_inline_only, &cad);
  1053.                 }
  1054.             }
  1055.         }
  1056.     }
  1057.   }
  1058. }

  1060. /* Returns the block to be used for symbol searches from
  1061.    the current location.  */

  1063. static const struct block *
  1064. ‌get_current_search_block (void)
  1065. {
  1066.   const struct block *block;
  1067.   enum language save_language;

  1069.   /* get_selected_block can change the current language when there is
  1070.      no selected frame yet.  */
  1071.   save_language = current_language->la_language;
  1072.   block = get_selected_block (0);
  1073.   set_language (save_language);

  1075.   return block;
  1076. }

  1078. /* Iterate over static and global blocks.  */

  1080. static void
  1081. ‌iterate_over_file_blocks (struct symtab *symtab,
  1082.                           const char *name, domain_enum domain,
  1083.                           symbol_found_callback_ftype *callback, void *data)
  1084. {
  1085.   struct block *block;

  1087.   for (block = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab), STATIC_BLOCK);
  1088.        block != NULL;
  1089.        block = BLOCK_SUPERBLOCK (block))
  1090.     LA_ITERATE_OVER_SYMBOLS (block, name, domain, callback, data);
  1091. }

  1093. /* A helper for find_method.  This finds all methods in type T which
  1094.    match NAME.  It adds matching symbol names to RESULT_NAMES, and
  1095.    adds T's direct superclasses to SUPERCLASSES.  */

  1097. static void
  1098. ‌find_methods (struct type *t, const char *name,
  1099.               VEC (const_char_ptr) **result_names,
  1100.               VEC (typep) **superclasses)
  1101. {
  1102.   int ibase;
  1103.   const char *class_name = type_name_no_tag (t);

  1105.   /* Ignore this class if it doesn't have a name.  This is ugly, but
  1106.      unless we figure out how to get the physname without the name of
  1107.      the class, then the loop can't do any good.  */
  1108.   if (class_name)
  1109.     {
  1110.       int method_counter;

  1112.       CHECK_TYPEDEF (t);

  1114.       /* Loop over each method name.  At this level, all overloads of a name
  1115.          are counted as a single name.  There is an inner loop which loops over
  1116.          each overload.  */

  1118.       for (method_counter = TYPE_NFN_FIELDS (t) - 1;
  1119.            method_counter >= 0;
  1120.            --method_counter)
  1121.         {
  1122.           const char *method_name = TYPE_FN_FIELDLIST_NAME (t, method_counter);
  1123.           char dem_opname[64];

  1125.           if (strncmp (method_name, "__", 2) == 0 ||
  1126.               strncmp (method_name, "op", 2) == 0 ||
  1127.               strncmp (method_name, "type", 4) == 0)
  1128.             {
  1129.               if (cplus_demangle_opname (method_name, dem_opname, DMGL_ANSI))
  1130.                 method_name = dem_opname;
  1131.               else if (cplus_demangle_opname (method_name, dem_opname, 0))
  1132.                 method_name = dem_opname;
  1133.             }

  1135.           if (strcmp_iw (method_name, name) == 0)
  1136.             {
  1137.               int field_counter;

  1139.               for (field_counter = (TYPE_FN_FIELDLIST_LENGTH (t, method_counter)
  1140.                                     - 1);
  1141.                    field_counter >= 0;
  1142.                    --field_counter)
  1143.                 {
  1144.                   struct fn_field *f;
  1145.                   const char *phys_name;

  1147.                   f = TYPE_FN_FIELDLIST1 (t, method_counter);
  1148.                   if (TYPE_FN_FIELD_STUB (f, field_counter))
  1149.                     continue;
  1150.                   phys_name = TYPE_FN_FIELD_PHYSNAME (f, field_counter);
  1151.                   VEC_safe_push (const_char_ptr, *result_names, phys_name);
  1152.                 }
  1153.             }
  1154.         }
  1155.     }

  1157.   for (ibase = 0; ibase < TYPE_N_BASECLASSES (t); ibase++)
  1158.     VEC_safe_push (typep, *superclasses, TYPE_BASECLASS (t, ibase));
  1159. }

  1161. /* Find an instance of the character C in the string S that is outside
  1162.    of all parenthesis pairs, single-quoted strings, and double-quoted
  1163.    strings.  Also, ignore the char within a template name, like a ','
  1164.    within foo<int, int>.  */

  1166. static const char *
  1167. ‌find_toplevel_char (const char *s, char c)
  1168. {
  1169.   int quoted = 0;                /* zero if we're not in quotes;
  1170.                                    '"' if we're in a double-quoted string;
  1171.                                    '\'' if we're in a single-quoted string.  */
  1172.   int depth = 0;                /* Number of unclosed parens we've seen.  */
  1173.   const char *scan;

  1175.   for (scan = s; *scan; scan++)
  1176.     {
  1177.       if (quoted)
  1178.         {
  1179.           if (*scan == quoted)
  1180.             quoted = 0;
  1181.           else if (*scan == '\\' && *(scan + 1))
  1182.             scan++;
  1183.         }
  1184.       else if (*scan == c && ! quoted && depth == 0)
  1185.         return scan;
  1186.       else if (*scan == '"' || *scan == '\'')
  1187.         quoted = *scan;
  1188.       else if (*scan == '(' || *scan == '<')
  1189.         depth++;
  1190.       else if ((*scan == ')' || *scan == '>') && depth > 0)
  1191.         depth--;
  1192.     }

  1194.   return 0;
  1195. }

  1197. /* The string equivalent of find_toplevel_char.  Returns a pointer
  1198.    to the location of NEEDLE in HAYSTACK, ignoring any occurrences
  1199.    inside "()" and "<>".  Returns NULL if NEEDLE was not found.  */

  1201. static const char *
  1202. ‌find_toplevel_string (const char *haystack, const char *needle)
  1203. {
  1204.   const char *s = haystack;

  1206.   do
  1207.     {
  1208.       s = find_toplevel_char (s, *needle);

  1210.       if (s != NULL)
  1211.         {
  1212.           /* Found first char in HAYSTACK;  check rest of string.  */
  1213.           if (strncmp (s, needle, strlen (needle)) == 0)
  1214.             return s;

  1216.           /* Didn't find it; loop over HAYSTACK, looking for the next
  1217.              instance of the first character of NEEDLE.  */
  1218.           ++s;
  1219.         }
  1220.     }
  1221.   while (s != NULL && *s != '\0');

  1223.   /* NEEDLE was not found in HAYSTACK.  */
  1224.   return NULL;
  1225. }

  1227. /* Convert CANONICAL to its string representation using
  1228.    symtab_to_fullname for SYMTAB.  The caller must xfree the result.  */

  1230. static char *
  1231. ‌canonical_to_fullform (const struct linespec_canonical_name *canonical)
  1232. {
  1233.   if (canonical->symtab == NULL)
  1234.     return xstrdup (canonical->suffix);
  1235.   else
  1236.     return xstrprintf ("%s:%s", symtab_to_fullname (canonical->symtab),
  1237.                        canonical->suffix);
  1238. }

  1240. /* Given FILTERS, a list of canonical names, filter the sals in RESULT
  1241.    and store the result in SELF->CANONICAL.  */

  1243. static void
  1244. ‌filter_results (struct linespec_state *self,
  1245.                 struct symtabs_and_lines *result,
  1246.                 VEC (const_char_ptr) *filters)
  1247. {
  1248.   int i;
  1249.   const char *name;

  1251.   for (i = 0; VEC_iterate (const_char_ptr, filters, i, name); ++i)
  1252.     {
  1253.       struct linespec_sals lsal;
  1254.       int j;

  1256.       memset (&lsal, 0, sizeof (lsal));

  1258.       for (j = 0; j < result->nelts; ++j)
  1259.         {
  1260.           const struct linespec_canonical_name *canonical;
  1261.           char *fullform;
  1262.           struct cleanup *cleanup;

  1264.           canonical = &self->canonical_names[j];
  1265.           fullform = canonical_to_fullform (canonical);
  1266.           cleanup = make_cleanup (xfree, fullform);

  1268.           if (strcmp (name, fullform) == 0)
  1269.             add_sal_to_sals_basic (&lsal.sals, &result->sals[j]);

  1271.           do_cleanups (cleanup);
  1272.         }

  1274.       if (lsal.sals.nelts > 0)
  1275.         {
  1276.           lsal.canonical = xstrdup (name);
  1277.           VEC_safe_push (linespec_sals, self->canonical->sals, &lsal);
  1278.         }
  1279.     }

  1281.   self->canonical->pre_expanded = 0;
  1282. }

  1284. /* Store RESULT into SELF->CANONICAL.  */

  1286. static void
  1287. ‌convert_results_to_lsals (struct linespec_state *self,
  1288.                           struct symtabs_and_lines *result)
  1289. {
  1290.   struct linespec_sals lsal;

  1292.   lsal.canonical = NULL;
  1293.   lsal.sals = *result;
  1294.   VEC_safe_push (linespec_sals, self->canonical->sals, &lsal);
  1295. }

  1297. /* A structure that contains two string representations of a struct
  1298.    linespec_canonical_name:
  1299.      - one where the the symtab's fullname is used;
  1300.      - one where the filename followed the "set filename-display"
  1301.        setting.  */

  1303. ‌struct decode_line_2_item
  1304. {
  1305.   /* The form using symtab_to_fullname.
  1306.      It must be xfree'ed after use.  */
  1307.   char *fullform;

  1309.   /* The form using symtab_to_filename_for_display.
  1310.      It must be xfree'ed after use.  */
  1311.   char *displayform;

  1313.   /* Field is initialized to zero and it is set to one if the user
  1314.      requested breakpoint for this entry.  */
  1315.   unsigned int selected : 1;
  1316. };

  1318. /* Helper for qsort to sort decode_line_2_item entries by DISPLAYFORM and
  1319.    secondarily by FULLFORM.  */

  1321. static int
  1322. ‌decode_line_2_compare_items (const void *ap, const void *bp)
  1323. {
  1324.   const struct decode_line_2_item *a = ap;
  1325.   const struct decode_line_2_item *b = bp;
  1326.   int retval;

  1328.   retval = strcmp (a->displayform, b->displayform);
  1329.   if (retval != 0)
  1330.     return retval;

  1332.   return strcmp (a->fullform, b->fullform);
  1333. }

  1335. /* Handle multiple results in RESULT depending on SELECT_MODE.  This
  1336.    will either return normally, throw an exception on multiple
  1337.    results, or present a menu to the user.  On return, the SALS vector
  1338.    in SELF->CANONICAL is set up properly.  */

  1340. static void
  1341. ‌decode_line_2 (struct linespec_state *self,
  1342.                struct symtabs_and_lines *result,
  1343.                const char *select_mode)
  1344. {
  1345.   char *args, *prompt;
  1346.   int i;
  1347.   struct cleanup *old_chain;
  1348.   VEC (const_char_ptr) *filters = NULL;
  1349.   struct get_number_or_range_state state;
  1350.   struct decode_line_2_item *items;
  1351.   int items_count;

  1353.   gdb_assert (select_mode != multiple_symbols_all);
  1354.   gdb_assert (self->canonical != NULL);
  1355.   gdb_assert (result->nelts >= 1);

  1357.   old_chain = make_cleanup (VEC_cleanup (const_char_ptr), &filters);

  1359.   /* Prepare ITEMS array.  */
  1360.   items_count = result->nelts;
  1361.   items = xmalloc (sizeof (*items) * items_count);
  1362.   make_cleanup (xfree, items);
  1363.   for (i = 0; i < items_count; ++i)
  1364.     {
  1365.       const struct linespec_canonical_name *canonical;
  1366.       struct decode_line_2_item *item;

  1368.       canonical = &self->canonical_names[i];
  1369.       gdb_assert (canonical->suffix != NULL);
  1370.       item = &items[i];

  1372.       item->fullform = canonical_to_fullform (canonical);
  1373.       make_cleanup (xfree, item->fullform);

  1375.       if (canonical->symtab == NULL)
  1376.         item->displayform = canonical->suffix;
  1377.       else
  1378.         {
  1379.           const char *fn_for_display;

  1381.           fn_for_display = symtab_to_filename_for_display (canonical->symtab);
  1382.           item->displayform = xstrprintf ("%s:%s", fn_for_display,
  1383.                                           canonical->suffix);
  1384.           make_cleanup (xfree, item->displayform);
  1385.         }

  1387.       item->selected = 0;
  1388.     }

  1390.   /* Sort the list of method names.  */
  1391.   qsort (items, items_count, sizeof (*items), decode_line_2_compare_items);

  1393.   /* Remove entries with the same FULLFORM.  */
  1394.   if (items_count >= 2)
  1395.     {
  1396.       struct decode_line_2_item *dst, *src;

  1398.       dst = items;
  1399.       for (src = &items[1]; src < &items[items_count]; src++)
  1400.         if (strcmp (src->fullform, dst->fullform) != 0)
  1401.           *++dst = *src;
  1402.       items_count = dst + 1 - items;
  1403.     }

  1405.   if (select_mode == multiple_symbols_cancel && items_count > 1)
  1406.     error (_("canceled because the command is ambiguous\n"
  1407.              "See set/show multiple-symbol."));

  1409.   if (select_mode == multiple_symbols_all || items_count == 1)
  1410.     {
  1411.       do_cleanups (old_chain);
  1412.       convert_results_to_lsals (self, result);
  1413.       return;
  1414.     }

  1416.   printf_unfiltered (_("[0] cancel\n[1] all\n"));
  1417.   for (i = 0; i < items_count; i++)
  1418.     printf_unfiltered ("[%d] %s\n", i + 2, items[i].displayform);

  1420.   prompt = getenv ("PS2");
  1421.   if (prompt == NULL)
  1422.     {
  1423.       prompt = "> ";
  1424.     }
  1425.   args = command_line_input (prompt, 0, "overload-choice");

  1427.   if (args == 0 || *args == 0)
  1428.     error_no_arg (_("one or more choice numbers"));

  1430.   init_number_or_range (&state, args);
  1431.   while (!state.finished)
  1432.     {
  1433.       int num;

  1435.       num = get_number_or_range (&state);

  1437.       if (num == 0)
  1438.         error (_("canceled"));
  1439.       else if (num == 1)
  1440.         {
  1441.           /* We intentionally make this result in a single breakpoint,
  1442.              contrary to what older versions of gdb did.  The
  1443.              rationale is that this lets a user get the
  1444.              multiple_symbols_all behavior even with the 'ask'
  1445.              setting; and he can get separate breakpoints by entering
  1446.              "2-57" at the query.  */
  1447.           do_cleanups (old_chain);
  1448.           convert_results_to_lsals (self, result);
  1449.           return;
  1450.         }

  1452.       num -= 2;
  1453.       if (num >= items_count)
  1454.         printf_unfiltered (_("No choice number %d.\n"), num);
  1455.       else
  1456.         {
  1457.           struct decode_line_2_item *item = &items[num];

  1459.           if (!item->selected)
  1460.             {
  1461.               VEC_safe_push (const_char_ptr, filters, item->fullform);
  1462.               item->selected = 1;
  1463.             }
  1464.           else
  1465.             {
  1466.               printf_unfiltered (_("duplicate request for %d ignored.\n"),
  1467.                                  num + 2);
  1468.             }
  1469.         }
  1470.     }

  1472.   filter_results (self, result, filters);
  1473.   do_cleanups (old_chain);
  1474. }



  1478. /* The parser of linespec itself.  */

  1480. /* Throw an appropriate error when SYMBOL is not found (optionally in
  1481.    FILENAME).  */

  1483. static void ATTRIBUTE_NORETURN
  1484. ‌symbol_not_found_error (const char *symbol, const char *filename)
  1485. {
  1486.   if (symbol == NULL)
  1487.     symbol = "";

  1489.   if (!have_full_symbols ()
  1490.       && !have_partial_symbols ()
  1491.       && !have_minimal_symbols ())
  1492.     throw_error (NOT_FOUND_ERROR,
  1493.                  _("No symbol table is loaded.  Use the \"file\" command."));

  1495.   /* If SYMBOL starts with '$', the user attempted to either lookup
  1496.      a function/variable in his code starting with '$' or an internal
  1497.      variable of that name.  Since we do not know which, be concise and
  1498.      explain both possibilities.  */
  1499.   if (*symbol == '$')
  1500.     {
  1501.       if (filename)
  1502.         throw_error (NOT_FOUND_ERROR,
  1503.                      _("Undefined convenience variable or function \"%s\" "
  1504.                        "not defined in \"%s\"."), symbol, filename);
  1505.       else
  1506.         throw_error (NOT_FOUND_ERROR,
  1507.                      _("Undefined convenience variable or function \"%s\" "
  1508.                        "not defined."), symbol);
  1509.     }
  1510.   else
  1511.     {
  1512.       if (filename)
  1513.         throw_error (NOT_FOUND_ERROR,
  1514.                      _("Function \"%s\" not defined in \"%s\"."),
  1515.                      symbol, filename);
  1516.       else
  1517.         throw_error (NOT_FOUND_ERROR,
  1518.                      _("Function \"%s\" not defined."), symbol);
  1519.     }
  1520. }

  1522. /* Throw an appropriate error when an unexpected token is encountered
  1523.    in the input.  */

  1525. static void ATTRIBUTE_NORETURN
  1526. ‌unexpected_linespec_error (linespec_parser *parser)
  1527. {
  1528.   linespec_token token;
  1529.   static const char * token_type_strings[]
  1530.     = {"keyword", "colon", "string", "number", "comma", "end of input"};

  1532.   /* Get the token that generated the error.  */
  1533.   token = linespec_lexer_lex_one (parser);

  1535.   /* Finally, throw the error.  */
  1536.   if (token.type == LSTOKEN_STRING || token.type == LSTOKEN_NUMBER
  1537.       || token.type == LSTOKEN_KEYWORD)
  1538.     {
  1539.       char *string;
  1540.       struct cleanup *cleanup;

  1542.       string = copy_token_string (token);
  1543.       cleanup = make_cleanup (xfree, string);
  1544.       throw_error (GENERIC_ERROR,
  1545.                    _("malformed linespec error: unexpected %s, \"%s\""),
  1546.                    token_type_strings[token.type], string);
  1547.     }
  1548.   else
  1549.     throw_error (GENERIC_ERROR,
  1550.                  _("malformed linespec error: unexpected %s"),
  1551.                  token_type_strings[token.type]);
  1552. }

  1554. /* Parse and return a line offset in STRING.  */

  1556. static struct line_offset
  1557. ‌linespec_parse_line_offset (const char *string)
  1558. {
  1559.   struct line_offset line_offset = {0, LINE_OFFSET_NONE};

  1561.   if (*string == '+')
  1562.     {
  1563.       line_offset.sign = LINE_OFFSET_PLUS;
  1564.       ++string;
  1565.     }
  1566.   else if (*string == '-')
  1567.     {
  1568.       line_offset.sign = LINE_OFFSET_MINUS;
  1569.       ++string;
  1570.     }

  1572.   /* Right now, we only allow base 10 for offsets.  */
  1573.   line_offset.offset = atoi (string);
  1574.   return line_offset;
  1575. }

  1577. /* Parse the basic_spec in PARSER's input.  */

  1579. static void
  1580. ‌linespec_parse_basic (linespec_parser *parser)
  1581. {
  1582.   char *name;
  1583.   linespec_token token;
  1584.   VEC (symbolp) *symbols, *labels;
  1585.   VEC (bound_minimal_symbol_d) *minimal_symbols;
  1586.   struct cleanup *cleanup;

  1588.   /* Get the next token.  */
  1589.   token = linespec_lexer_lex_one (parser);

  1591.   /* If it is EOI or KEYWORD, issue an error.  */
  1592.   if (token.type == LSTOKEN_KEYWORD || token.type == LSTOKEN_EOI)
  1593.     unexpected_linespec_error (parser);
  1594.   /* If it is a LSTOKEN_NUMBER, we have an offset.  */
  1595.   else if (token.type == LSTOKEN_NUMBER)
  1596.     {
  1597.       /* Record the line offset and get the next token.  */
  1598.       name = copy_token_string (token);
  1599.       cleanup = make_cleanup (xfree, name);
  1600.       PARSER_RESULT (parser)->line_offset = linespec_parse_line_offset (name);
  1601.       do_cleanups (cleanup);

  1603.       /* Get the next token.  */
  1604.       token = linespec_lexer_consume_token (parser);

  1606.       /* If the next token is a comma, stop parsing and return.  */
  1607.       if (token.type == LSTOKEN_COMMA)
  1608.         return;

  1610.       /* If the next token is anything but EOI or KEYWORD, issue
  1611.          an error.  */
  1612.       if (token.type != LSTOKEN_KEYWORD && token.type != LSTOKEN_EOI)
  1613.         unexpected_linespec_error (parser);
  1614.     }

  1616.   if (token.type == LSTOKEN_KEYWORD || token.type == LSTOKEN_EOI)
  1617.     return;

  1619.   /* Next token must be LSTOKEN_STRING.  */
  1620.   if (token.type != LSTOKEN_STRING)
  1621.     unexpected_linespec_error (parser);

  1623.   /* The current token will contain the name of a function, method,
  1624.      or label.  */
  1625.   name  = copy_token_string (token);
  1626.   cleanup = make_cleanup (xfree, name);

  1628.   /* Try looking it up as a function/method.  */
  1629.   find_linespec_symbols (PARSER_STATE (parser),
  1630.                          PARSER_RESULT (parser)->file_symtabs, name,
  1631.                          &symbols, &minimal_symbols);

  1633.   if (symbols != NULL || minimal_symbols != NULL)
  1634.     {
  1635.       PARSER_RESULT (parser)->function_symbols = symbols;
  1636.       PARSER_RESULT (parser)->minimal_symbols = minimal_symbols;
  1637.       PARSER_RESULT (parser)->function_name = name;
  1638.       symbols = NULL;
  1639.       discard_cleanups (cleanup);
  1640.     }
  1641.   else
  1642.     {
  1643.       /* NAME was not a function or a method.  So it must be a label
  1644.          name or user specified variable like "break foo.c:$zippo".  */
  1645.       labels = find_label_symbols (PARSER_STATE (parser), NULL,
  1646.                                    &symbols, name);
  1647.       if (labels != NULL)
  1648.         {
  1649.           PARSER_RESULT (parser)->labels.label_symbols = labels;
  1650.           PARSER_RESULT (parser)->labels.function_symbols = symbols;
  1651.           PARSER_RESULT (parser)->label_name = name;
  1652.           symbols = NULL;
  1653.           discard_cleanups (cleanup);
  1654.         }
  1655.       else if (token.type == LSTOKEN_STRING
  1656.                && *LS_TOKEN_STOKEN (token).ptr == '$')
  1657.         {
  1658.           /* User specified a convenience variable or history value.  */
  1659.           PARSER_RESULT (parser)->line_offset
  1660.             = linespec_parse_variable (PARSER_STATE (parser), name);

  1662.           if (PARSER_RESULT (parser)->line_offset.sign == LINE_OFFSET_UNKNOWN)
  1663.             {
  1664.               /* The user-specified variable was not valid.  Do not
  1665.                  throw an error here.  parse_linespec will do it for us.  */
  1666.               PARSER_RESULT (parser)->function_name = name;
  1667.               discard_cleanups (cleanup);
  1668.               return;
  1669.             }

  1671.           /* The convenience variable/history value parsed correctly.
  1672.              NAME is no longer needed.  */
  1673.           do_cleanups (cleanup);
  1674.         }
  1675.       else
  1676.         {
  1677.           /* The name is also not a label.  Abort parsing.  Do not throw
  1678.              an error here.  parse_linespec will do it for us.  */

  1680.           /* Save a copy of the name we were trying to lookup.  */
  1681.           PARSER_RESULT (parser)->function_name = name;
  1682.           discard_cleanups (cleanup);
  1683.           return;
  1684.         }
  1685.     }

  1687.   /* Get the next token.  */
  1688.   token = linespec_lexer_consume_token (parser);

  1690.   if (token.type == LSTOKEN_COLON)
  1691.     {
  1692.       /* User specified a label or a lineno.  */
  1693.       token = linespec_lexer_consume_token (parser);

  1695.       if (token.type == LSTOKEN_NUMBER)
  1696.         {
  1697.           /* User specified an offset.  Record the line offset and
  1698.              get the next token.  */
  1699.           name = copy_token_string (token);
  1700.           cleanup = make_cleanup (xfree, name);
  1701.           PARSER_RESULT (parser)->line_offset
  1702.             = linespec_parse_line_offset (name);
  1703.           do_cleanups (cleanup);

  1705.           /* Ge the next token.  */
  1706.           token = linespec_lexer_consume_token (parser);
  1707.         }
  1708.       else if (token.type == LSTOKEN_STRING)
  1709.         {
  1710.           /* Grab a copy of the label's name and look it up.  */
  1711.           name = copy_token_string (token);
  1712.           cleanup = make_cleanup (xfree, name);
  1713.           labels = find_label_symbols (PARSER_STATE (parser),
  1714.                                        PARSER_RESULT (parser)->function_symbols,
  1715.                                        &symbols, name);

  1717.           if (labels != NULL)
  1718.             {
  1719.               PARSER_RESULT (parser)->labels.label_symbols = labels;
  1720.               PARSER_RESULT (parser)->labels.function_symbols = symbols;
  1721.               PARSER_RESULT (parser)->label_name = name;
  1722.               symbols = NULL;
  1723.               discard_cleanups (cleanup);
  1724.             }
  1725.           else
  1726.             {
  1727.               /* We don't know what it was, but it isn't a label.  */
  1728.               throw_error (NOT_FOUND_ERROR,
  1729.                            _("No label \"%s\" defined in function \"%s\"."),
  1730.                            name, PARSER_RESULT (parser)->function_name);
  1731.             }

  1733.           /* Check for a line offset.  */
  1734.           token = linespec_lexer_consume_token (parser);
  1735.           if (token.type == LSTOKEN_COLON)
  1736.             {
  1737.               /* Get the next token.  */
  1738.               token = linespec_lexer_consume_token (parser);

  1740.               /* It must be a line offset.  */
  1741.               if (token.type != LSTOKEN_NUMBER)
  1742.                 unexpected_linespec_error (parser);

  1744.               /* Record the lione offset and get the next token.  */
  1745.               name = copy_token_string (token);
  1746.               cleanup = make_cleanup (xfree, name);

  1748.               PARSER_RESULT (parser)->line_offset
  1749.                 = linespec_parse_line_offset (name);
  1750.               do_cleanups (cleanup);

  1752.               /* Get the next token.  */
  1753.               token = linespec_lexer_consume_token (parser);
  1754.             }
  1755.         }
  1756.       else
  1757.         {
  1758.           /* Trailing ':' in the input. Issue an error.  */
  1759.           unexpected_linespec_error (parser);
  1760.         }
  1761.     }
  1762. }

  1764. /* Canonicalize the linespec contained in LS.  The result is saved into
  1765.    STATE->canonical.  */

  1767. static void
  1768. ‌canonicalize_linespec (struct linespec_state *state, linespec_p ls)
  1769. {
  1770.   /* If canonicalization was not requested, no need to do anything.  */
  1771.   if (!state->canonical)
  1772.     return;

  1774.   /* Shortcut expressions, which can only appear by themselves.  */
  1775.   if (ls->expression != NULL)
  1776.     state->canonical->addr_string = xstrdup (ls->expression);
  1777.   else
  1778.     {
  1779.       struct ui_file *buf;
  1780.       int need_colon = 0;

  1782.       buf = mem_fileopen ();
  1783.       if (ls->source_filename)
  1784.         {
  1785.           fputs_unfiltered (ls->source_filename, buf);
  1786.           need_colon = 1;
  1787.         }

  1789.       if (ls->function_name)
  1790.         {
  1791.           if (need_colon)
  1792.             fputc_unfiltered (':', buf);
  1793.           fputs_unfiltered (ls->function_name, buf);
  1794.           need_colon = 1;
  1795.         }

  1797.       if (ls->label_name)
  1798.         {
  1799.           if (need_colon)
  1800.             fputc_unfiltered (':', buf);

  1802.           if (ls->function_name == NULL)
  1803.             {
  1804.               struct symbol *s;

  1806.               /* No function was specified, so add the symbol name.  */
  1807.               gdb_assert (ls->labels.function_symbols != NULL
  1808.                           && (VEC_length (symbolp, ls->labels.function_symbols)
  1809.                               == 1));
  1810.               s = VEC_index (symbolp, ls->labels.function_symbols, 0);
  1811.               fputs_unfiltered (SYMBOL_NATURAL_NAME (s), buf);
  1812.               fputc_unfiltered (':', buf);
  1813.             }

  1815.           fputs_unfiltered (ls->label_name, buf);
  1816.           need_colon = 1;
  1817.           state->canonical->special_display = 1;
  1818.         }

  1820.       if (ls->line_offset.sign != LINE_OFFSET_UNKNOWN)
  1821.         {
  1822.           if (need_colon)
  1823.             fputc_unfiltered (':', buf);
  1824.           fprintf_filtered (buf, "%s%d",
  1825.                             (ls->line_offset.sign == LINE_OFFSET_NONE ? ""
  1826.                              : (ls->line_offset.sign
  1827.                                 == LINE_OFFSET_PLUS ? "+" : "-")),
  1828.                             ls->line_offset.offset);
  1829.         }

  1831.       state->canonical->addr_string = ui_file_xstrdup (buf, NULL);
  1832.       ui_file_delete (buf);
  1833.     }
  1834. }

  1836. /* Given a line offset in LS, construct the relevant SALs.  */

  1838. static struct symtabs_and_lines
  1839. ‌create_sals_line_offset (struct linespec_state *self,
  1840.                          linespec_p ls)
  1841. {
  1842.   struct symtabs_and_lines values;
  1843.   struct symtab_and_line val;
  1844.   int use_default = 0;

  1846.   init_sal (&val);
  1847.   values.sals = NULL;
  1848.   values.nelts = 0;

  1850.   /* This is where we need to make sure we have good defaults.
  1851.      We must guarantee that this section of code is never executed
  1852.      when we are called with just a function name, since
  1853.      set_default_source_symtab_and_line uses
  1854.      select_source_symtab that calls us with such an argument.  */

  1856.   if (VEC_length (symtab_ptr, ls->file_symtabs) == 1
  1857.       && VEC_index (symtab_ptr, ls->file_symtabs, 0) == NULL)
  1858.     {
  1859.       const char *fullname;

  1861.       set_current_program_space (self->program_space);

  1863.       /* Make sure we have at least a default source line.  */
  1864.       set_default_source_symtab_and_line ();
  1865.       initialize_defaults (&self->default_symtab, &self->default_line);
  1866.       fullname = symtab_to_fullname (self->default_symtab);
  1867.       VEC_pop (symtab_ptr, ls->file_symtabs);
  1868.       VEC_free (symtab_ptr, ls->file_symtabs);
  1869.       ls->file_symtabs = collect_symtabs_from_filename (fullname);
  1870.       use_default = 1;
  1871.     }

  1873.   val.line = ls->line_offset.offset;
  1874.   switch (ls->line_offset.sign)
  1875.     {
  1876.     case LINE_OFFSET_PLUS:
  1877.       if (ls->line_offset.offset == 0)
  1878.         val.line = 5;
  1879.       if (use_default)
  1880.         val.line = self->default_line + val.line;
  1881.       break;

  1883.     case LINE_OFFSET_MINUS:
  1884.       if (ls->line_offset.offset == 0)
  1885.         val.line = 15;
  1886.       if (use_default)
  1887.         val.line = self->default_line - val.line;
  1888.       else
  1889.         val.line = -val.line;
  1890.       break;

  1892.     case LINE_OFFSET_NONE:
  1893.       break;                        /* No need to adjust val.line.  */
  1894.     }

  1896.   if (self->list_mode)
  1897.     decode_digits_list_mode (self, ls, &values, val);
  1898.   else
  1899.     {
  1900.       struct linetable_entry *best_entry = NULL;
  1901.       int *filter;
  1902.       const struct block **blocks;
  1903.       struct cleanup *cleanup;
  1904.       struct symtabs_and_lines intermediate_results;
  1905.       int i, j;

  1907.       intermediate_results.sals = NULL;
  1908.       intermediate_results.nelts = 0;

  1910.       decode_digits_ordinary (self, ls, val.line, &intermediate_results,
  1911.                               &best_entry);
  1912.       if (intermediate_results.nelts == 0 && best_entry != NULL)
  1913.         decode_digits_ordinary (self, ls, best_entry->line,
  1914.                                 &intermediate_results, &best_entry);

  1916.       cleanup = make_cleanup (xfree, intermediate_results.sals);

  1918.       /* For optimized code, the compiler can scatter one source line
  1919.          across disjoint ranges of PC values, even when no duplicate
  1920.          functions or inline functions are involved.  For example,
  1921.          'for (;;)' inside a non-template, non-inline, and non-ctor-or-dtor
  1922.          function can result in two PC ranges.  In this case, we don't
  1923.          want to set a breakpoint on the first PC of each range.  To filter
  1924.          such cases, we use containing blocks -- for each PC found
  1925.          above, we see if there are other PCs that are in the same
  1926.          block.  If yes, the other PCs are filtered out.  */

  1928.       filter = XNEWVEC (int, intermediate_results.nelts);
  1929.       make_cleanup (xfree, filter);
  1930.       blocks = XNEWVEC (const struct block *, intermediate_results.nelts);
  1931.       make_cleanup (xfree, blocks);

  1933.       for (i = 0; i < intermediate_results.nelts; ++i)
  1934.         {
  1935.           set_current_program_space (intermediate_results.sals[i].pspace);

  1937.           filter[i] = 1;
  1938.           blocks[i] = block_for_pc_sect (intermediate_results.sals[i].pc,
  1939.                                          intermediate_results.sals[i].section);
  1940.         }

  1942.       for (i = 0; i < intermediate_results.nelts; ++i)
  1943.         {
  1944.           if (blocks[i] != NULL)
  1945.             for (j = i + 1; j < intermediate_results.nelts; ++j)
  1946.               {
  1947.                 if (blocks[j] == blocks[i])
  1948.                   {
  1949.                     filter[j] = 0;
  1950.                     break;
  1951.                   }
  1952.               }
  1953.         }

  1955.       for (i = 0; i < intermediate_results.nelts; ++i)
  1956.         if (filter[i])
  1957.           {
  1958.             struct symbol *sym = (blocks[i]
  1959.                                   ? block_containing_function (blocks[i])
  1960.                                   : NULL);

  1962.             if (self->funfirstline)
  1963.               skip_prologue_sal (&intermediate_results.sals[i]);
  1964.             /* Make sure the line matches the request, not what was
  1965.                found.  */
  1966.             intermediate_results.sals[i].line = val.line;
  1967.             add_sal_to_sals (self, &values, &intermediate_results.sals[i],
  1968.                              sym ? SYMBOL_NATURAL_NAME (sym) : NULL, 0);
  1969.           }

  1971.       do_cleanups (cleanup);
  1972.     }

  1974.   if (values.nelts == 0)
  1975.     {
  1976.       if (ls->source_filename)
  1977.         throw_error (NOT_FOUND_ERROR, _("No line %d in file \"%s\"."),
  1978.                      val.line, ls->source_filename);
  1979.       else
  1980.         throw_error (NOT_FOUND_ERROR, _("No line %d in the current file."),
  1981.                      val.line);
  1982.     }

  1984.   return values;
  1985. }

  1987. /* Create and return SALs from the linespec LS.  */

  1989. static struct symtabs_and_lines
  1990. ‌convert_linespec_to_sals (struct linespec_state *state, linespec_p ls)
  1991. {
  1992.   struct symtabs_and_lines sals = {NULL, 0};

  1994.   if (ls->expression != NULL)
  1995.     {
  1996.       struct symtab_and_line sal;

  1998.       /* We have an expression.  No other attribute is allowed.  */
  1999.       sal = find_pc_line (ls->expr_pc, 0);
  2000.       sal.pc = ls->expr_pc;
  2001.       sal.section = find_pc_overlay (ls->expr_pc);
  2002.       sal.explicit_pc = 1;
  2003.       add_sal_to_sals (state, &sals, &sal, ls->expression, 1);
  2004.     }
  2005.   else if (ls->labels.label_symbols != NULL)
  2006.     {
  2007.       /* We have just a bunch of functions/methods or labels.  */
  2008.       int i;
  2009.       struct symtab_and_line sal;
  2010.       struct symbol *sym;

  2012.       for (i = 0; VEC_iterate (symbolp, ls->labels.label_symbols, i, sym); ++i)
  2013.         {
  2014.           struct program_space *pspace = SYMTAB_PSPACE (symbol_symtab (sym));

  2016.           if (symbol_to_sal (&sal, state->funfirstline, sym)
  2017.               && maybe_add_address (state->addr_set, pspace, sal.pc))
  2018.             add_sal_to_sals (state, &sals, &sal,
  2019.                              SYMBOL_NATURAL_NAME (sym), 0);
  2020.         }
  2021.     }
  2022.   else if (ls->function_symbols != NULL || ls->minimal_symbols != NULL)
  2023.     {
  2024.       /* We have just a bunch of functions and/or methods.  */
  2025.       int i;
  2026.       struct symtab_and_line sal;
  2027.       struct symbol *sym;
  2028.       bound_minimal_symbol_d *elem;
  2029.       struct program_space *pspace;

  2031.       if (ls->function_symbols != NULL)
  2032.         {
  2033.           /* Sort symbols so that symbols with the same program space are next
  2034.              to each other.  */
  2035.           qsort (VEC_address (symbolp, ls->function_symbols),
  2036.                  VEC_length (symbolp, ls->function_symbols),
  2037.                  sizeof (symbolp), compare_symbols);

  2039.           for (i = 0; VEC_iterate (symbolp, ls->function_symbols, i, sym); ++i)
  2040.             {
  2041.               pspace = SYMTAB_PSPACE (symbol_symtab (sym));
  2042.               set_current_program_space (pspace);
  2043.               if (symbol_to_sal (&sal, state->funfirstline, sym)
  2044.                   && maybe_add_address (state->addr_set, pspace, sal.pc))
  2045.                 add_sal_to_sals (state, &sals, &sal,
  2046.                                  SYMBOL_NATURAL_NAME (sym), 0);
  2047.             }
  2048.         }

  2050.       if (ls->minimal_symbols != NULL)
  2051.         {
  2052.           /* Sort minimal symbols by program space, too.  */
  2053.           qsort (VEC_address (bound_minimal_symbol_d, ls->minimal_symbols),
  2054.                  VEC_length (bound_minimal_symbol_d, ls->minimal_symbols),
  2055.                  sizeof (bound_minimal_symbol_d), compare_msymbols);

  2057.           for (i = 0;
  2058.                VEC_iterate (bound_minimal_symbol_d, ls->minimal_symbols,
  2059.                             i, elem);
  2060.                ++i)
  2061.             {
  2062.               pspace = elem->objfile->pspace;
  2063.               set_current_program_space (pspace);
  2064.               minsym_found (state, elem->objfile, elem->minsym, &sals);
  2065.             }
  2066.         }
  2067.     }
  2068.   else if (ls->line_offset.sign != LINE_OFFSET_UNKNOWN)
  2069.     {
  2070.       /* Only an offset was specified.  */
  2071.         sals = create_sals_line_offset (state, ls);

  2073.         /* Make sure we have a filename for canonicalization.  */
  2074.         if (ls->source_filename == NULL)
  2075.           {
  2076.             const char *fullname = symtab_to_fullname (state->default_symtab);

  2078.             /* It may be more appropriate to keep DEFAULT_SYMTAB in its symtab
  2079.                form so that displaying SOURCE_FILENAME can follow the current
  2080.                FILENAME_DISPLAY_STRING setting.  But as it is used only rarely
  2081.                it has been kept for code simplicity only in absolute form.  */
  2082.             ls->source_filename = xstrdup (fullname);
  2083.           }
  2084.     }
  2085.   else
  2086.     {
  2087.       /* We haven't found any results...  */
  2088.       return sals;
  2089.     }

  2091.   canonicalize_linespec (state, ls);

  2093.   if (sals.nelts > 0 && state->canonical != NULL)
  2094.     state->canonical->pre_expanded = 1;

  2096.   return sals;
  2097. }

  2099. /* Parse a string that specifies a linespec.
  2100.    Pass the address of a char * variable; that variable will be
  2101.    advanced over the characters actually parsed.

  2103.    The basic grammar of linespecs:

  2105.    linespec -> expr_spec | var_spec | basic_spec
  2106.    expr_spec -> '*' STRING
  2107.    var_spec -> '$' (STRING | NUMBER)

  2109.    basic_spec -> file_offset_spec | function_spec | label_spec
  2110.    file_offset_spec -> opt_file_spec offset_spec
  2111.    function_spec -> opt_file_spec function_name_spec opt_label_spec
  2112.    label_spec -> label_name_spec

  2114.    opt_file_spec -> "" | file_name_spec ':'
  2115.    opt_label_spec -> "" | ':' label_name_spec

  2117.    file_name_spec -> STRING
  2118.    function_name_spec -> STRING
  2119.    label_name_spec -> STRING
  2120.    function_name_spec -> STRING
  2121.    offset_spec -> NUMBER
  2122.                -> '+' NUMBER
  2123.                -> '-' NUMBER

  2125.    This may all be followed by several keywords such as "if EXPR",
  2126.    which we ignore.

  2128.    A comma will terminate parsing.

  2130.    The function may be an undebuggable function found in minimal symbol table.

  2132.    If the argument FUNFIRSTLINE is nonzero, we want the first line
  2133.    of real code inside a function when a function is specified, and it is
  2134.    not OK to specify a variable or type to get its line number.

  2136.    DEFAULT_SYMTAB specifies the file to use if none is specified.
  2137.    It defaults to current_source_symtab.
  2138.    DEFAULT_LINE specifies the line number to use for relative
  2139.    line numbers (that start with signs).  Defaults to current_source_line.
  2140.    If CANONICAL is non-NULL, store an array of strings containing the canonical
  2141.    line specs there if necessary.  Currently overloaded member functions and
  2142.    line numbers or static functions without a filename yield a canonical
  2143.    line spec.  The array and the line spec strings are allocated on the heap,
  2144.    it is the callers responsibility to free them.

  2146.    Note that it is possible to return zero for the symtab
  2147.    if no file is validly specified.  Callers must check that.
  2148.    Also, the line number returned may be invalid.  */

  2150. /* Parse the linespec in ARGPTR.  */

  2152. static struct symtabs_and_lines
  2153. ‌parse_linespec (linespec_parser *parser, const char **argptr)
  2154. {
  2155.   linespec_token token;
  2156.   struct symtabs_and_lines values;
  2157.   volatile struct gdb_exception file_exception;
  2158.   struct cleanup *cleanup;

  2160.   /* A special case to start.  It has become quite popular for
  2161.      IDEs to work around bugs in the previous parser by quoting
  2162.      the entire linespec, so we attempt to deal with this nicely.  */
  2163.   parser->is_quote_enclosed = 0;
  2164.   if (!is_ada_operator (*argptr)
  2165.       && strchr (linespec_quote_characters, **argptr) != NULL)
  2166.     {
  2167.       const char *end;

  2169.       end = skip_quote_char (*argptr + 1, **argptr);
  2170.       if (end != NULL && is_closing_quote_enclosed (end))
  2171.         {
  2172.           /* Here's the special case.  Skip ARGPTR past the initial
  2173.              quote.  */
  2174.           ++(*argptr);
  2175.           parser->is_quote_enclosed = 1;
  2176.         }
  2177.     }

  2179.   /* A keyword at the start cannot be interpreted as such.
  2180.      Consider "b thread thread 42".  */
  2181.   parser->keyword_ok = 0;

  2183.   parser->lexer.saved_arg = *argptr;
  2184.   parser->lexer.stream = argptr;
  2185.   file_exception.reason = 0;

  2187.   /* Initialize the default symtab and line offset.  */
  2188.   initialize_defaults (&PARSER_STATE (parser)->default_symtab,
  2189.                        &PARSER_STATE (parser)->default_line);

  2191.   /* Objective-C shortcut.  */
  2192.   values = decode_objc (PARSER_STATE (parser), PARSER_RESULT (parser), argptr);
  2193.   if (values.sals != NULL)
  2194.     return values;

  2196.   /* Start parsing.  */

  2198.   /* Get the first token.  */
  2199.   token = linespec_lexer_lex_one (parser);

  2201.   /* It must be either LSTOKEN_STRING or LSTOKEN_NUMBER.  */
  2202.   if (token.type == LSTOKEN_STRING && *LS_TOKEN_STOKEN (token).ptr == '*')
  2203.     {
  2204.       char *expr;
  2205.       const char *copy;

  2207.       /* User specified an expression, *EXPR.  */
  2208.       copy = expr = copy_token_string (token);
  2209.       cleanup = make_cleanup (xfree, expr);
  2210.       PARSER_RESULT (parser)->expr_pc = linespec_expression_to_pc (&copy);
  2211.       discard_cleanups (cleanup);
  2212.       PARSER_RESULT (parser)->expression = expr;

  2214.       /* This is a little hacky/tricky.  If linespec_expression_to_pc
  2215.          did not evaluate the entire token, then we must find the
  2216.          string COPY inside the original token buffer.  */
  2217.       if (*copy != '\0')
  2218.         {
  2219.           PARSER_STREAM (parser) = strstr (parser->lexer.saved_arg, copy);
  2220.           gdb_assert (PARSER_STREAM (parser) != NULL);
  2221.         }

  2223.       /* Consume the token.  */
  2224.       linespec_lexer_consume_token (parser);

  2226.       goto convert_to_sals;
  2227.     }
  2228.   else if (token.type == LSTOKEN_STRING && *LS_TOKEN_STOKEN (token).ptr == '$')
  2229.     {
  2230.       char *var;

  2232.       /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB.  */
  2233.       VEC_safe_push (symtab_ptr, PARSER_RESULT (parser)->file_symtabs, NULL);

  2235.       /* User specified a convenience variable or history value.  */
  2236.       var = copy_token_string (token);
  2237.       cleanup = make_cleanup (xfree, var);
  2238.       PARSER_RESULT (parser)->line_offset
  2239.         = linespec_parse_variable (PARSER_STATE (parser), var);
  2240.       do_cleanups (cleanup);

  2242.       /* If a line_offset wasn't found (VAR is the name of a user
  2243.          variable/function), then skip to normal symbol processing.  */
  2244.       if (PARSER_RESULT (parser)->line_offset.sign != LINE_OFFSET_UNKNOWN)
  2245.         {
  2246.           /* Consume this token.  */
  2247.           linespec_lexer_consume_token (parser);

  2249.           goto convert_to_sals;
  2250.         }
  2251.     }
  2252.   else if (token.type != LSTOKEN_STRING && token.type != LSTOKEN_NUMBER)
  2253.     unexpected_linespec_error (parser);

  2255.   /* Now we can recognize keywords.  */
  2256.   parser->keyword_ok = 1;

  2258.   /* Shortcut: If the next token is not LSTOKEN_COLON, we know that
  2259.      this token cannot represent a filename.  */
  2260.   token = linespec_lexer_peek_token (parser);

  2262.   if (token.type == LSTOKEN_COLON)
  2263.     {
  2264.       char *user_filename;

  2266.       /* Get the current token again and extract the filename.  */
  2267.       token = linespec_lexer_lex_one (parser);
  2268.       user_filename = copy_token_string (token);

  2270.       /* Check if the input is a filename.  */
  2271.       TRY_CATCH (file_exception, RETURN_MASK_ERROR)
  2272.         {
  2273.           PARSER_RESULT (parser)->file_symtabs
  2274.             = symtabs_from_filename (user_filename);
  2275.         }

  2277.       if (file_exception.reason >= 0)
  2278.         {
  2279.           /* Symtabs were found for the file.  Record the filename.  */
  2280.           PARSER_RESULT (parser)->source_filename = user_filename;

  2282.           /* Get the next token.  */
  2283.           token = linespec_lexer_consume_token (parser);

  2285.           /* This is LSTOKEN_COLON; consume it.  */
  2286.           linespec_lexer_consume_token (parser);
  2287.         }
  2288.       else
  2289.         {
  2290.           /* No symtabs found -- discard user_filename.  */
  2291.           xfree (user_filename);

  2293.           /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB.  */
  2294.           VEC_safe_push (symtab_ptr, PARSER_RESULT (parser)->file_symtabs, NULL);
  2295.         }
  2296.     }
  2297.   /* If the next token is not EOI, KEYWORD, or COMMA, issue an error.  */
  2298.   else if (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD
  2299.            && token.type != LSTOKEN_COMMA)
  2300.     {
  2301.       /* TOKEN is the _next_ token, not the one currently in the parser.
  2302.          Consuming the token will give the correct error message.  */
  2303.       linespec_lexer_consume_token (parser);
  2304.       unexpected_linespec_error (parser);
  2305.     }
  2306.   else
  2307.     {
  2308.       /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB.  */
  2309.       VEC_safe_push (symtab_ptr, PARSER_RESULT (parser)->file_symtabs, NULL);
  2310.     }

  2312.   /* Parse the rest of the linespec.  */
  2313.   linespec_parse_basic (parser);

  2315.   if (PARSER_RESULT (parser)->function_symbols == NULL
  2316.       && PARSER_RESULT (parser)->labels.label_symbols == NULL
  2317.       && PARSER_RESULT (parser)->line_offset.sign == LINE_OFFSET_UNKNOWN
  2318.       && PARSER_RESULT (parser)->minimal_symbols == NULL)
  2319.     {
  2320.       /* The linespec didn't parse.  Re-throw the file exception if
  2321.          there was one.  */
  2322.       if (file_exception.reason < 0)
  2323.         throw_exception (file_exception);

  2325.       /* Otherwise, the symbol is not found.  */
  2326.       symbol_not_found_error (PARSER_RESULT (parser)->function_name,
  2327.                               PARSER_RESULT (parser)->source_filename);
  2328.     }

  2330. convert_to_sals:

  2332.   /* Get the last token and record how much of the input was parsed,
  2333.      if necessary.  */
  2334.   token = linespec_lexer_lex_one (parser);
  2335.   if (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD)
  2336.     PARSER_STREAM (parser) = LS_TOKEN_STOKEN (token).ptr;

  2338.   /* Convert the data in PARSER_RESULT to SALs.  */
  2339.   values = convert_linespec_to_sals (PARSER_STATE (parser),
  2340.                                      PARSER_RESULT (parser));

  2342.   return values;
  2343. }


  2346. /* A constructor for linespec_state.  */

  2348. static void
  2349. ‌linespec_state_constructor (struct linespec_state *self,
  2350.                             int flags, const struct language_defn *language,
  2351.                             struct symtab *default_symtab,
  2352.                             int default_line,
  2353.                             struct linespec_result *canonical)
  2354. {
  2355.   memset (self, 0, sizeof (*self));
  2356.   self->language = language;
  2357.   self->funfirstline = (flags & DECODE_LINE_FUNFIRSTLINE) ? 1 : 0;
  2358.   self->list_mode = (flags & DECODE_LINE_LIST_MODE) ? 1 : 0;
  2359.   self->default_symtab = default_symtab;
  2360.   self->default_line = default_line;
  2361.   self->canonical = canonical;
  2362.   self->program_space = current_program_space;
  2363.   self->addr_set = htab_create_alloc (10, hash_address_entry, eq_address_entry,
  2364.                                       xfree, xcalloc, xfree);
  2365. }

  2367. /* Initialize a new linespec parser.  */

  2369. static void
  2370. ‌linespec_parser_new (linespec_parser *parser,
  2371.                      int flags, const struct language_defn *language,
  2372.                      struct symtab *default_symtab,
  2373.                      int default_line,
  2374.                      struct linespec_result *canonical)
  2375. {
  2376.   parser->lexer.current.type = LSTOKEN_CONSUMED;
  2377.   memset (PARSER_RESULT (parser), 0, sizeof (struct linespec));
  2378.   PARSER_RESULT (parser)->line_offset.sign = LINE_OFFSET_UNKNOWN;
  2379.   linespec_state_constructor (PARSER_STATE (parser), flags, language,
  2380.                               default_symtab, default_line, canonical);
  2381. }

  2383. /* A destructor for linespec_state.  */

  2385. static void
  2386. ‌linespec_state_destructor (struct linespec_state *self)
  2387. {
  2388.   htab_delete (self->addr_set);
  2389. }

  2391. /* Delete a linespec parser.  */

  2393. static void
  2394. ‌linespec_parser_delete (void *arg)
  2395. {
  2396.   linespec_parser *parser = (linespec_parser *) arg;

  2398.   xfree ((char *) PARSER_RESULT (parser)->expression);
  2399.   xfree ((char *) PARSER_RESULT (parser)->source_filename);
  2400.   xfree ((char *) PARSER_RESULT (parser)->label_name);
  2401.   xfree ((char *) PARSER_RESULT (parser)->function_name);

  2403.   if (PARSER_RESULT (parser)->file_symtabs != NULL)
  2404.     VEC_free (symtab_ptr, PARSER_RESULT (parser)->file_symtabs);

  2406.   if (PARSER_RESULT (parser)->function_symbols != NULL)
  2407.     VEC_free (symbolp, PARSER_RESULT (parser)->function_symbols);

  2409.   if (PARSER_RESULT (parser)->minimal_symbols != NULL)
  2410.     VEC_free (bound_minimal_symbol_d, PARSER_RESULT (parser)->minimal_symbols);

  2412.   if (PARSER_RESULT (parser)->labels.label_symbols != NULL)
  2413.     VEC_free (symbolp, PARSER_RESULT (parser)->labels.label_symbols);

  2415.   if (PARSER_RESULT (parser)->labels.function_symbols != NULL)
  2416.     VEC_free (symbolp, PARSER_RESULT (parser)->labels.function_symbols);

  2418.   linespec_state_destructor (PARSER_STATE (parser));
  2419. }

  2421. /* See linespec.h.  */

  2423. void
  2424. ‌decode_line_full (char **argptr, int flags,
  2425.                   struct symtab *default_symtab,
  2426.                   int default_line, struct linespec_result *canonical,
  2427.                   const char *select_mode,
  2428.                   const char *filter)
  2429. {
  2430.   struct symtabs_and_lines result;
  2431.   struct cleanup *cleanups;
  2432.   VEC (const_char_ptr) *filters = NULL;
  2433.   linespec_parser parser;
  2434.   struct linespec_state *state;
  2435.   const char *copy, *orig;

  2437.   gdb_assert (canonical != NULL);
  2438.   /* The filter only makes sense for 'all'.  */
  2439.   gdb_assert (filter == NULL || select_mode == multiple_symbols_all);
  2440.   gdb_assert (select_mode == NULL
  2441.               || select_mode == multiple_symbols_all
  2442.               || select_mode == multiple_symbols_ask
  2443.               || select_mode == multiple_symbols_cancel);
  2444.   gdb_assert ((flags & DECODE_LINE_LIST_MODE) == 0);

  2446.   linespec_parser_new (&parser, flags, current_language, default_symtab,
  2447.                        default_line, canonical);
  2448.   cleanups = make_cleanup (linespec_parser_delete, &parser);
  2449.   save_current_program_space ();

  2451.   orig = copy = *argptr;
  2452.   result = parse_linespec (&parser, &copy);
  2453.   *argptr += copy - orig;
  2454.   state = PARSER_STATE (&parser);

  2456.   gdb_assert (result.nelts == 1 || canonical->pre_expanded);
  2457.   gdb_assert (canonical->addr_string != NULL);
  2458.   canonical->pre_expanded = 1;

  2460.   /* Arrange for allocated canonical names to be freed.  */
  2461.   if (result.nelts > 0)
  2462.     {
  2463.       int i;

  2465.       make_cleanup (xfree, state->canonical_names);
  2466.       for (i = 0; i < result.nelts; ++i)
  2467.         {
  2468.           gdb_assert (state->canonical_names[i].suffix != NULL);
  2469.           make_cleanup (xfree, state->canonical_names[i].suffix);
  2470.         }
  2471.     }

  2473.   if (select_mode == NULL)
  2474.     {
  2475.       if (ui_out_is_mi_like_p (interp_ui_out (top_level_interpreter ())))
  2476.         select_mode = multiple_symbols_all;
  2477.       else
  2478.         select_mode = multiple_symbols_select_mode ();
  2479.     }

  2481.   if (select_mode == multiple_symbols_all)
  2482.     {
  2483.       if (filter != NULL)
  2484.         {
  2485.           make_cleanup (VEC_cleanup (const_char_ptr), &filters);
  2486.           VEC_safe_push (const_char_ptr, filters, filter);
  2487.           filter_results (state, &result, filters);
  2488.         }
  2489.       else
  2490.         convert_results_to_lsals (state, &result);
  2491.     }
  2492.   else
  2493.     decode_line_2 (state, &result, select_mode);

  2495.   do_cleanups (cleanups);
  2496. }

  2498. /* See linespec.h.  */

  2500. struct symtabs_and_lines
  2501. ‌decode_line_1 (char **argptr, int flags,
  2502.                struct symtab *default_symtab,
  2503.                int default_line)
  2504. {
  2505.   struct symtabs_and_lines result;
  2506.   linespec_parser parser;
  2507.   struct cleanup *cleanups;
  2508.   const char *copy, *orig;

  2510.   linespec_parser_new (&parser, flags, current_language, default_symtab,
  2511.                        default_line, NULL);
  2512.   cleanups = make_cleanup (linespec_parser_delete, &parser);
  2513.   save_current_program_space ();

  2515.   orig = copy = *argptr;
  2516.   result = parse_linespec (&parser, &copy);
  2517.   *argptr += copy - orig;

  2519.   do_cleanups (cleanups);
  2520.   return result;
  2521. }

  2523. /* See linespec.h.  */

  2525. struct symtabs_and_lines
  2526. ‌decode_line_with_current_source (char *string, int flags)
  2527. {
  2528.   struct symtabs_and_lines sals;
  2529.   struct symtab_and_line cursal;

  2531.   if (string == 0)
  2532.     error (_("Empty line specification."));

  2534.   /* We use whatever is set as the current source line.  We do not try
  2535.      and get a default source symtab+line or it will recursively call us!  */
  2536.   cursal = get_current_source_symtab_and_line ();

  2538.   sals = decode_line_1 (&string, flags,
  2539.                         cursal.symtab, cursal.line);

  2541.   if (*string)
  2542.     error (_("Junk at end of line specification: %s"), string);
  2543.   return sals;
  2544. }

  2546. /* See linespec.h.  */

  2548. struct symtabs_and_lines
  2549. ‌decode_line_with_last_displayed (char *string, int flags)
  2550. {
  2551.   struct symtabs_and_lines sals;

  2553.   if (string == 0)
  2554.     error (_("Empty line specification."));

  2556.   if (last_displayed_sal_is_valid ())
  2557.     sals = decode_line_1 (&string, flags,
  2558.                           get_last_displayed_symtab (),
  2559.                           get_last_displayed_line ());
  2560.   else
  2561.     sals = decode_line_1 (&string, flags, (struct symtab *) NULL, 0);

  2563.   if (*string)
  2564.     error (_("Junk at end of line specification: %s"), string);
  2565.   return sals;
  2566. }



  2570. /* First, some functions to initialize stuff at the beggining of the
  2571.    function.  */

  2573. static void
  2574. ‌initialize_defaults (struct symtab **default_symtab, int *default_line)
  2575. {
  2576.   if (*default_symtab == 0)
  2577.     {
  2578.       /* Use whatever we have for the default source line.  We don't use
  2579.          get_current_or_default_symtab_and_line as it can recurse and call
  2580.          us back!  */
  2581.       struct symtab_and_line cursal =
  2582.         get_current_source_symtab_and_line ();

  2584.       *default_symtab = cursal.symtab;
  2585.       *default_line = cursal.line;
  2586.     }
  2587. }



  2591. /* Evaluate the expression pointed to by EXP_PTR into a CORE_ADDR,
  2592.    advancing EXP_PTR past any parsed text.  */

  2594. static CORE_ADDR
  2595. ‌linespec_expression_to_pc (const char **exp_ptr)
  2596. {
  2597.   if (current_program_space->executing_startup)
  2598.     /* The error message doesn't really matter, because this case
  2599.        should only hit during breakpoint reset.  */
  2600.     throw_error (NOT_FOUND_ERROR, _("cannot evaluate expressions while "
  2601.                                     "program space is in startup"));

  2603.   (*exp_ptr)++;
  2604.   return value_as_address (parse_to_comma_and_eval (exp_ptr));
  2605. }



  2609. /* Here's where we recognise an Objective-C Selector.  An Objective C
  2610.    selector may be implemented by more than one class, therefore it
  2611.    may represent more than one method/function.  This gives us a
  2612.    situation somewhat analogous to C++ overloading.  If there's more
  2613.    than one method that could represent the selector, then use some of
  2614.    the existing C++ code to let the user choose one.  */

  2616. static struct symtabs_and_lines
  2617. ‌decode_objc (struct linespec_state *self, linespec_p ls, const char **argptr)
  2618. {
  2619.   struct collect_info info;
  2620.   VEC (const_char_ptr) *symbol_names = NULL;
  2621.   struct symtabs_and_lines values;
  2622.   const char *new_argptr;
  2623.   struct cleanup *cleanup = make_cleanup (VEC_cleanup (const_char_ptr),
  2624.                                           &symbol_names);

  2626.   info.state = self;
  2627.   info.file_symtabs = NULL;
  2628.   VEC_safe_push (symtab_ptr, info.file_symtabs, NULL);
  2629.   make_cleanup (VEC_cleanup (symtab_ptr), &info.file_symtabs);
  2630.   info.result.symbols = NULL;
  2631.   info.result.minimal_symbols = NULL;
  2632.   values.nelts = 0;
  2633.   values.sals = NULL;

  2635.   new_argptr = find_imps (*argptr, &symbol_names);
  2636.   if (VEC_empty (const_char_ptr, symbol_names))
  2637.     {
  2638.       do_cleanups (cleanup);
  2639.       return values;
  2640.     }

  2642.   add_all_symbol_names_from_pspace (&info, NULL, symbol_names);

  2644.   if (!VEC_empty (symbolp, info.result.symbols)
  2645.       || !VEC_empty (bound_minimal_symbol_d, info.result.minimal_symbols))
  2646.     {
  2647.       char *saved_arg;

  2649.       saved_arg = alloca (new_argptr - *argptr + 1);
  2650.       memcpy (saved_arg, *argptr, new_argptr - *argptr);
  2651.       saved_arg[new_argptr - *argptr] = '\0';

  2653.       ls->function_name = xstrdup (saved_arg);
  2654.       ls->function_symbols = info.result.symbols;
  2655.       ls->minimal_symbols = info.result.minimal_symbols;
  2656.       values = convert_linespec_to_sals (self, ls);

  2658.       if (self->canonical)
  2659.         {
  2660.           self->canonical->pre_expanded = 1;
  2661.           if (ls->source_filename)
  2662.             self->canonical->addr_string
  2663.               = xstrprintf ("%s:%s", ls->source_filename, saved_arg);
  2664.           else
  2665.             self->canonical->addr_string = xstrdup (saved_arg);
  2666.         }
  2667.     }

  2669.   *argptr = new_argptr;

  2671.   do_cleanups (cleanup);

  2673.   return values;
  2674. }

  2676. /* An instance of this type is used when collecting prefix symbols for
  2677.    decode_compound.  */

  2679. ‌struct decode_compound_collector
  2680. {
  2681.   /* The result vector.  */
  2682.   VEC (symbolp) *symbols;

  2684.   /* A hash table of all symbols we found.  We use this to avoid
  2685.      adding any symbol more than once.  */
  2686.   htab_t unique_syms;
  2687. };

  2689. /* A callback for iterate_over_symbols that is used by
  2690.    lookup_prefix_sym to collect type symbols.  */

  2692. static int
  2693. ‌collect_one_symbol (struct symbol *sym, void *d)
  2694. {
  2695.   struct decode_compound_collector *collector = d;
  2696.   void **slot;
  2697.   struct type *t;

  2699.   if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
  2700.     return 1; /* Continue iterating.  */

  2702.   t = SYMBOL_TYPE (sym);
  2703.   CHECK_TYPEDEF (t);
  2704.   if (TYPE_CODE (t) != TYPE_CODE_STRUCT
  2705.       && TYPE_CODE (t) != TYPE_CODE_UNION
  2706.       && TYPE_CODE (t) != TYPE_CODE_NAMESPACE)
  2707.     return 1; /* Continue iterating.  */

  2709.   slot = htab_find_slot (collector->unique_syms, sym, INSERT);
  2710.   if (!*slot)
  2711.     {
  2712.       *slot = sym;
  2713.       VEC_safe_push (symbolp, collector->symbols, sym);
  2714.     }

  2716.   return 1; /* Continue iterating.  */
  2717. }

  2719. /* Return any symbols corresponding to CLASS_NAME in FILE_SYMTABS.  */

  2721. ‌static VEC (symbolp) *
  2722. lookup_prefix_sym (struct linespec_state *state, VEC (symtab_ptr) *file_symtabs,
  2723.                    const char *class_name)
  2724. {
  2725.   int ix;
  2726.   struct symtab *elt;
  2727.   struct decode_compound_collector collector;
  2728.   struct cleanup *outer;
  2729.   struct cleanup *cleanup;

  2731.   collector.symbols = NULL;
  2732.   outer = make_cleanup (VEC_cleanup (symbolp), &collector.symbols);

  2734.   collector.unique_syms = htab_create_alloc (1, htab_hash_pointer,
  2735.                                              htab_eq_pointer, NULL,
  2736.                                              xcalloc, xfree);
  2737.   cleanup = make_cleanup_htab_delete (collector.unique_syms);

  2739.   for (ix = 0; VEC_iterate (symtab_ptr, file_symtabs, ix, elt); ++ix)
  2740.     {
  2741.       if (elt == NULL)
  2742.         {
  2743.           iterate_over_all_matching_symtabs (state, class_name, STRUCT_DOMAIN,
  2744.                                              collect_one_symbol, &collector,
  2745.                                              NULL, 0);
  2746.           iterate_over_all_matching_symtabs (state, class_name, VAR_DOMAIN,
  2747.                                              collect_one_symbol, &collector,
  2748.                                              NULL, 0);
  2749.         }
  2750.       else
  2751.         {
  2752.           /* Program spaces that are executing startup should have
  2753.              been filtered out earlier.  */
  2754.           gdb_assert (!SYMTAB_PSPACE (elt)->executing_startup);
  2755.           set_current_program_space (SYMTAB_PSPACE (elt));
  2756.           iterate_over_file_blocks (elt, class_name, STRUCT_DOMAIN,
  2757.                                     collect_one_symbol, &collector);
  2758.           iterate_over_file_blocks (elt, class_name, VAR_DOMAIN,
  2759.                                     collect_one_symbol, &collector);
  2760.         }
  2761.     }

  2763.   do_cleanups (cleanup);
  2764.   discard_cleanups (outer);
  2765.   return collector.symbols;
  2766. }

  2768. /* A qsort comparison function for symbols.  The resulting order does
  2769.    not actually matter; we just need to be able to sort them so that
  2770.    symbols with the same program space end up next to each other.  */

  2772. static int
  2773. ‌compare_symbols (const void *a, const void *b)
  2774. {
  2775.   struct symbol * const *sa = a;
  2776.   struct symbol * const *sb = b;
  2777.   uintptr_t uia, uib;

  2779.   uia = (uintptr_t) SYMTAB_PSPACE (symbol_symtab (*sa));
  2780.   uib = (uintptr_t) SYMTAB_PSPACE (symbol_symtab (*sb));

  2782.   if (uia < uib)
  2783.     return -1;
  2784.   if (uia > uib)
  2785.     return 1;

  2787.   uia = (uintptr_t) *sa;
  2788.   uib = (uintptr_t) *sb;

  2790.   if (uia < uib)
  2791.     return -1;
  2792.   if (uia > uib)
  2793.     return 1;

  2795.   return 0;
  2796. }

  2798. /* Like compare_symbols but for minimal symbols.  */

  2800. static int
  2801. ‌compare_msymbols (const void *a, const void *b)
  2802. {
  2803.   const struct bound_minimal_symbol *sa = a;
  2804.   const struct bound_minimal_symbol *sb = b;
  2805.   uintptr_t uia, uib;

  2807.   uia = (uintptr_t) sa->objfile->pspace;
  2808.   uib = (uintptr_t) sa->objfile->pspace;

  2810.   if (uia < uib)
  2811.     return -1;
  2812.   if (uia > uib)
  2813.     return 1;

  2815.   uia = (uintptr_t) sa->minsym;
  2816.   uib = (uintptr_t) sb->minsym;

  2818.   if (uia < uib)
  2819.     return -1;
  2820.   if (uia > uib)
  2821.     return 1;

  2823.   return 0;
  2824. }

  2826. /* Look for all the matching instances of each symbol in NAMES.  Only
  2827.    instances from PSPACE are considered; other program spaces are
  2828.    handled by our caller.  If PSPACE is NULL, then all program spaces
  2829.    are considered.  Results are stored into INFO.  */

  2831. static void
  2832. ‌add_all_symbol_names_from_pspace (struct collect_info *info,
  2833.                                   struct program_space *pspace,
  2834.                                   VEC (const_char_ptr) *names)
  2835. {
  2836.   int ix;
  2837.   const char *iter;

  2839.   for (ix = 0; VEC_iterate (const_char_ptr, names, ix, iter); ++ix)
  2840.     add_matching_symbols_to_info (iter, info, pspace);
  2841. }

  2843. static void
  2844. ‌find_superclass_methods (VEC (typep) *superclasses,
  2845.                          const char *name,
  2846.                          VEC (const_char_ptr) **result_names)
  2847. {
  2848.   int old_len = VEC_length (const_char_ptr, *result_names);
  2849.   VEC (typep) *iter_classes;
  2850.   struct cleanup *cleanup = make_cleanup (null_cleanup, NULL);

  2852.   iter_classes = superclasses;
  2853.   while (1)
  2854.     {
  2855.       VEC (typep) *new_supers = NULL;
  2856.       int ix;
  2857.       struct type *t;

  2859.       make_cleanup (VEC_cleanup (typep), &new_supers);
  2860.       for (ix = 0; VEC_iterate (typep, iter_classes, ix, t); ++ix)
  2861.         find_methods (t, name, result_names, &new_supers);

  2863.       if (VEC_length (const_char_ptr, *result_names) != old_len
  2864.           || VEC_empty (typep, new_supers))
  2865.         break;

  2867.       iter_classes = new_supers;
  2868.     }

  2870.   do_cleanups (cleanup);
  2871. }

  2873. /* This finds the method METHOD_NAME in the class CLASS_NAME whose type is
  2874.    given by one of the symbols in SYM_CLASSES.  Matches are returned
  2875.    in SYMBOLS (for debug symbols) and MINSYMS (for minimal symbols).  */

  2877. static void
  2878. ‌find_method (struct linespec_state *self, VEC (symtab_ptr) *file_symtabs,
  2879.              const char *class_name, const char *method_name,
  2880.              VEC (symbolp) *sym_classes, VEC (symbolp) **symbols,
  2881.              VEC (bound_minimal_symbol_d) **minsyms)
  2882. {
  2883.   struct symbol *sym;
  2884.   struct cleanup *cleanup = make_cleanup (null_cleanup, NULL);
  2885.   int ix;
  2886.   int last_result_len;
  2887.   VEC (typep) *superclass_vec;
  2888.   VEC (const_char_ptr) *result_names;
  2889.   struct collect_info info;

  2891.   /* Sort symbols so that symbols with the same program space are next
  2892.      to each other.  */
  2893.   qsort (VEC_address (symbolp, sym_classes),
  2894.          VEC_length (symbolp, sym_classes),
  2895.          sizeof (symbolp),
  2896.          compare_symbols);

  2898.   info.state = self;
  2899.   info.file_symtabs = file_symtabs;
  2900.   info.result.symbols = NULL;
  2901.   info.result.minimal_symbols = NULL;

  2903.   /* Iterate over all the types, looking for the names of existing
  2904.      methods matching METHOD_NAME.  If we cannot find a direct method in a
  2905.      given program space, then we consider inherited methods; this is
  2906.      not ideal (ideal would be to respect C++ hiding rules), but it
  2907.      seems good enough and is what GDB has historically done.  We only
  2908.      need to collect the names because later we find all symbols with
  2909.      those names.  This loop is written in a somewhat funny way
  2910.      because we collect data across the program space before deciding
  2911.      what to do.  */
  2912.   superclass_vec = NULL;
  2913.   make_cleanup (VEC_cleanup (typep), &superclass_vec);
  2914.   result_names = NULL;
  2915.   make_cleanup (VEC_cleanup (const_char_ptr), &result_names);
  2916.   last_result_len = 0;
  2917.   for (ix = 0; VEC_iterate (symbolp, sym_classes, ix, sym); ++ix)
  2918.     {
  2919.       struct type *t;
  2920.       struct program_space *pspace;

  2922.       /* Program spaces that are executing startup should have
  2923.          been filtered out earlier.  */
  2924.       pspace = SYMTAB_PSPACE (symbol_symtab (sym));
  2925.       gdb_assert (!pspace->executing_startup);
  2926.       set_current_program_space (pspace);
  2927.       t = check_typedef (SYMBOL_TYPE (sym));
  2928.       find_methods (t, method_name, &result_names, &superclass_vec);

  2930.       /* Handle all items from a single program space at once; and be
  2931.          sure not to miss the last batch.  */
  2932.       if (ix == VEC_length (symbolp, sym_classes) - 1
  2933.           || (pspace
  2934.               != SYMTAB_PSPACE (symbol_symtab (VEC_index (symbolp, sym_classes,
  2935.                                                           ix + 1)))))
  2936.         {
  2937.           /* If we did not find a direct implementation anywhere in
  2938.              this program space, consider superclasses.  */
  2939.           if (VEC_length (const_char_ptr, result_names) == last_result_len)
  2940.             find_superclass_methods (superclass_vec, method_name,
  2941.                                      &result_names);

  2943.           /* We have a list of candidate symbol names, so now we
  2944.              iterate over the symbol tables looking for all
  2945.              matches in this pspace.  */
  2946.           add_all_symbol_names_from_pspace (&info, pspace, result_names);

  2948.           VEC_truncate (typep, superclass_vec, 0);
  2949.           last_result_len = VEC_length (const_char_ptr, result_names);
  2950.         }
  2951.     }

  2953.   if (!VEC_empty (symbolp, info.result.symbols)
  2954.       || !VEC_empty (bound_minimal_symbol_d, info.result.minimal_symbols))
  2955.     {
  2956.       *symbols = info.result.symbols;
  2957.       *minsyms = info.result.minimal_symbols;
  2958.       do_cleanups (cleanup);
  2959.       return;
  2960.     }

  2962.   /* Throw an NOT_FOUND_ERROR.  This will be caught by the caller
  2963.      and other attempts to locate the symbol will be made.  */
  2964.   throw_error (NOT_FOUND_ERROR, _("see caller, this text doesn't matter"));
  2965. }



  2969. /* This object is used when collecting all matching symtabs.  */

  2971. ‌struct symtab_collector
  2972. {
  2973.   /* The result vector of symtabs.  */
  2974.   VEC (symtab_ptr) *symtabs;

  2976.   /* This is used to ensure the symtabs are unique.  */
  2977.   htab_t symtab_table;
  2978. };

  2980. /* Callback for iterate_over_symtabs.  */

  2982. static int
  2983. ‌add_symtabs_to_list (struct symtab *symtab, void *d)
  2984. {
  2985.   struct symtab_collector *data = d;
  2986.   void **slot;

  2988.   slot = htab_find_slot (data->symtab_table, symtab, INSERT);
  2989.   if (!*slot)
  2990.     {
  2991.       *slot = symtab;
  2992.       VEC_safe_push (symtab_ptr, data->symtabs, symtab);
  2993.     }

  2995.   return 0;
  2996. }

  2998. /* Given a file name, return a VEC of all matching symtabs.  */

  3000. ‌static VEC (symtab_ptr) *
  3001. collect_symtabs_from_filename (const char *file)
  3002. {
  3003.   struct symtab_collector collector;
  3004.   struct cleanup *cleanups;
  3005.   struct program_space *pspace;

  3007.   collector.symtabs = NULL;
  3008.   collector.symtab_table = htab_create (1, htab_hash_pointer, htab_eq_pointer,
  3009.                                         NULL);
  3010.   cleanups = make_cleanup_htab_delete (collector.symtab_table);

  3012.   /* Find that file's data.  */
  3013.   ALL_PSPACES (pspace)
  3014.   {
  3015.     if (pspace->executing_startup)
  3016.       continue;

  3018.     set_current_program_space (pspace);
  3019.     iterate_over_symtabs (file, add_symtabs_to_list, &collector);
  3020.   }

  3022.   do_cleanups (cleanups);
  3023.   return collector.symtabs;
  3024. }

  3026. /* Return all the symtabs associated to the FILENAME.  */

  3028. ‌static VEC (symtab_ptr) *
  3029. symtabs_from_filename (const char *filename)
  3030. {
  3031.   VEC (symtab_ptr) *result;

  3033.   result = collect_symtabs_from_filename (filename);

  3035.   if (VEC_empty (symtab_ptr, result))
  3036.     {
  3037.       if (!have_full_symbols () && !have_partial_symbols ())
  3038.         throw_error (NOT_FOUND_ERROR,
  3039.                      _("No symbol table is loaded.  "
  3040.                        "Use the \"file\" command."));
  3041.       throw_error (NOT_FOUND_ERROR, _("No source file named %s."), filename);
  3042.     }

  3044.   return result;
  3045. }

  3047. /* Look up a function symbol named NAME in symtabs FILE_SYMTABS.  Matching
  3048.    debug symbols are returned in SYMBOLS.  Matching minimal symbols are
  3049.    returned in MINSYMS.  */

  3051. static void
  3052. ‌find_function_symbols (struct linespec_state *state,
  3053.                        VEC (symtab_ptr) *file_symtabs, const char *name,
  3054.                        VEC (symbolp) **symbols,
  3055.                        VEC (bound_minimal_symbol_d) **minsyms)
  3056. {
  3057.   struct collect_info info;
  3058.   VEC (const_char_ptr) *symbol_names = NULL;
  3059.   struct cleanup *cleanup = make_cleanup (VEC_cleanup (const_char_ptr),
  3060.                                           &symbol_names);

  3062.   info.state = state;
  3063.   info.result.symbols = NULL;
  3064.   info.result.minimal_symbols = NULL;
  3065.   info.file_symtabs = file_symtabs;

  3067.   /* Try NAME as an Objective-C selector.  */
  3068.   find_imps (name, &symbol_names);
  3069.   if (!VEC_empty (const_char_ptr, symbol_names))
  3070.     add_all_symbol_names_from_pspace (&info, NULL, symbol_names);
  3071.   else
  3072.     add_matching_symbols_to_info (name, &info, NULL);

  3074.   do_cleanups (cleanup);

  3076.   if (VEC_empty (symbolp, info.result.symbols))
  3077.     {
  3078.       VEC_free (symbolp, info.result.symbols);
  3079.       *symbols = NULL;
  3080.     }
  3081.   else
  3082.     *symbols = info.result.symbols;

  3084.   if (VEC_empty (bound_minimal_symbol_d, info.result.minimal_symbols))
  3085.     {
  3086.       VEC_free (bound_minimal_symbol_d, info.result.minimal_symbols);
  3087.       *minsyms = NULL;
  3088.     }
  3089.   else
  3090.     *minsyms = info.result.minimal_symbols;
  3091. }

  3093. /* Find all symbols named NAME in FILE_SYMTABS, returning debug symbols
  3094.    in SYMBOLS and minimal symbols in MINSYMS.  */

  3096. static void
  3097. ‌find_linespec_symbols (struct linespec_state *state,
  3098.                        VEC (symtab_ptr) *file_symtabs,
  3099.                        const char *name,
  3100.                        VEC (symbolp) **symbols,
  3101.                        VEC (bound_minimal_symbol_d) **minsyms)
  3102. {
  3103.   struct cleanup *cleanup;
  3104.   char *canon;
  3105.   const char *lookup_name;
  3106.   volatile struct gdb_exception except;

  3108.   cleanup = demangle_for_lookup (name, state->language->la_language,
  3109.                                  &lookup_name);
  3110.   if (state->language->la_language == language_ada)
  3111.     {
  3112.       /* In Ada, the symbol lookups are performed using the encoded
  3113.          name rather than the demangled name.  */
  3114.       lookup_name = ada_name_for_lookup (name);
  3115.       make_cleanup (xfree, (void *) lookup_name);
  3116.     }

  3118.   canon = cp_canonicalize_string_no_typedefs (lookup_name);
  3119.   if (canon != NULL)
  3120.     {
  3121.       lookup_name = canon;
  3122.       make_cleanup (xfree, canon);
  3123.     }

  3125.   /* It's important to not call expand_symtabs_matching unnecessarily
  3126.      as it can really slow things down (by unnecessarily expanding
  3127.      potentially 1000s of symtabs, which when debugging some apps can
  3128.      cost 100s of seconds).  Avoid this to some extent by *first* calling
  3129.      find_function_symbols, and only if that doesn't find anything
  3130.      *then* call find_method.  This handles two important cases:
  3131.      1) break (anonymous namespace)::foo
  3132.      2) break class::method where method is in class (and not a baseclass)  */

  3134.   find_function_symbols (state, file_symtabs, lookup_name,
  3135.                          symbols, minsyms);

  3137.   /* If we were unable to locate a symbol of the same name, try dividing
  3138.      the name into class and method names and searching the class and its
  3139.      baseclasses.  */
  3140.   if (VEC_empty (symbolp, *symbols)
  3141.       && VEC_empty (bound_minimal_symbol_d, *minsyms))
  3142.     {
  3143.       char *klass, *method;
  3144.       const char *last, *p, *scope_op;
  3145.       VEC (symbolp) *classes;

  3147.       /* See if we can find a scope operator and break this symbol
  3148.          name into namespaces${SCOPE_OPERATOR}class_name and method_name.  */
  3149.       scope_op = "::";
  3150.       p = find_toplevel_string (lookup_name, scope_op);
  3151.       if (p == NULL)
  3152.         {
  3153.           /* No C++ scope operator.  Try Java.  */
  3154.           scope_op = ".";
  3155.           p = find_toplevel_string (lookup_name, scope_op);
  3156.         }

  3158.       last = NULL;
  3159.       while (p != NULL)
  3160.         {
  3161.           last = p;
  3162.           p = find_toplevel_string (p + strlen (scope_op), scope_op);
  3163.         }

  3165.       /* If no scope operator was found, there is nothing more we can do;
  3166.          we already attempted to lookup the entire name as a symbol
  3167.          and failed.  */
  3168.       if (last == NULL)
  3169.         {
  3170.           do_cleanups (cleanup);
  3171.           return;
  3172.         }

  3174.       /* LOOKUP_NAME points to the class name.
  3175.          LAST points to the method name.  */
  3176.       klass = xmalloc ((last - lookup_name + 1) * sizeof (char));
  3177.       make_cleanup (xfree, klass);
  3178.       strncpy (klass, lookup_name, last - lookup_name);
  3179.       klass[last - lookup_name] = '\0';

  3181.       /* Skip past the scope operator.  */
  3182.       last += strlen (scope_op);
  3183.       method = xmalloc ((strlen (last) + 1) * sizeof (char));
  3184.       make_cleanup (xfree, method);
  3185.       strcpy (method, last);

  3187.       /* Find a list of classes named KLASS.  */
  3188.       classes = lookup_prefix_sym (state, file_symtabs, klass);
  3189.       make_cleanup (VEC_cleanup (symbolp), &classes);

  3191.       if (!VEC_empty (symbolp, classes))
  3192.         {
  3193.           /* Now locate a list of suitable methods named METHOD.  */
  3194.           TRY_CATCH (except, RETURN_MASK_ERROR)
  3195.             {
  3196.               find_method (state, file_symtabs, klass, method, classes,
  3197.                            symbols, minsyms);
  3198.             }

  3200.           /* If successful, we're done.  If NOT_FOUND_ERROR
  3201.              was not thrown, rethrow the exception that we did get.  */
  3202.           if (except.reason < 0 && except.error != NOT_FOUND_ERROR)
  3203.             throw_exception (except);
  3204.         }
  3205.     }

  3207.   do_cleanups (cleanup);
  3208. }

  3210. /* Return all labels named NAME in FUNCTION_SYMBOLS.  Return the
  3211.    actual function symbol in which the label was found in LABEL_FUNC_RET.  */

  3213. ‌static VEC (symbolp) *
  3214. find_label_symbols (struct linespec_state *self,
  3215.                     VEC (symbolp) *function_symbols,
  3216.                     VEC (symbolp) **label_funcs_ret, const char *name)
  3217. {
  3218.   int ix;
  3219.   const struct block *block;
  3220.   struct symbol *sym;
  3221.   struct symbol *fn_sym;
  3222.   VEC (symbolp) *result = NULL;

  3224.   if (function_symbols == NULL)
  3225.     {
  3226.       set_current_program_space (self->program_space);
  3227.       block = get_current_search_block ();

  3229.       for (;
  3230.            block && !BLOCK_FUNCTION (block);
  3231.            block = BLOCK_SUPERBLOCK (block))
  3232.         ;
  3233.       if (!block)
  3234.         return NULL;
  3235.       fn_sym = BLOCK_FUNCTION (block);

  3237.       sym = lookup_symbol (name, block, LABEL_DOMAIN, 0);

  3239.       if (sym != NULL)
  3240.         {
  3241.           VEC_safe_push (symbolp, result, sym);
  3242.           VEC_safe_push (symbolp, *label_funcs_ret, fn_sym);
  3243.         }
  3244.     }
  3245.   else
  3246.     {
  3247.       for (ix = 0;
  3248.            VEC_iterate (symbolp, function_symbols, ix, fn_sym); ++ix)
  3249.         {
  3250.           set_current_program_space (SYMTAB_PSPACE (symbol_symtab (fn_sym)));
  3251.           block = SYMBOL_BLOCK_VALUE (fn_sym);
  3252.           sym = lookup_symbol (name, block, LABEL_DOMAIN, 0);

  3254.           if (sym != NULL)
  3255.             {
  3256.               VEC_safe_push (symbolp, result, sym);
  3257.               VEC_safe_push (symbolp, *label_funcs_ret, fn_sym);
  3258.             }
  3259.         }
  3260.     }

  3262.   return result;
  3263. }



  3267. /* A helper for create_sals_line_offset that handles the 'list_mode' case.  */

  3269. static void
  3270. ‌decode_digits_list_mode (struct linespec_state *self,
  3271.                          linespec_p ls,
  3272.                          struct symtabs_and_lines *values,
  3273.                          struct symtab_and_line val)
  3274. {
  3275.   int ix;
  3276.   struct symtab *elt;

  3278.   gdb_assert (self->list_mode);

  3280.   for (ix = 0; VEC_iterate (symtab_ptr, ls->file_symtabs, ix, elt);
  3281.        ++ix)
  3282.     {
  3283.       /* The logic above should ensure this.  */
  3284.       gdb_assert (elt != NULL);

  3286.       set_current_program_space (SYMTAB_PSPACE (elt));

  3288.       /* Simplistic search just for the list command.  */
  3289.       val.symtab = find_line_symtab (elt, val.line, NULL, NULL);
  3290.       if (val.symtab == NULL)
  3291.         val.symtab = elt;
  3292.       val.pspace = SYMTAB_PSPACE (elt);
  3293.       val.pc = 0;
  3294.       val.explicit_line = 1;

  3296.       add_sal_to_sals (self, values, &val, NULL, 0);
  3297.     }
  3298. }

  3300. /* A helper for create_sals_line_offset that iterates over the symtabs,
  3301.    adding lines to the VEC.  */

  3303. static void
  3304. ‌decode_digits_ordinary (struct linespec_state *self,
  3305.                         linespec_p ls,
  3306.                         int line,
  3307.                         struct symtabs_and_lines *sals,
  3308.                         struct linetable_entry **best_entry)
  3309. {
  3310.   int ix;
  3311.   struct symtab *elt;

  3313.   for (ix = 0; VEC_iterate (symtab_ptr, ls->file_symtabs, ix, elt); ++ix)
  3314.     {
  3315.       int i;
  3316.       VEC (CORE_ADDR) *pcs;
  3317.       CORE_ADDR pc;

  3319.       /* The logic above should ensure this.  */
  3320.       gdb_assert (elt != NULL);

  3322.       set_current_program_space (SYMTAB_PSPACE (elt));

  3324.       pcs = find_pcs_for_symtab_line (elt, line, best_entry);
  3325.       for (i = 0; VEC_iterate (CORE_ADDR, pcs, i, pc); ++i)
  3326.         {
  3327.           struct symtab_and_line sal;

  3329.           init_sal (&sal);
  3330.           sal.pspace = SYMTAB_PSPACE (elt);
  3331.           sal.symtab = elt;
  3332.           sal.line = line;
  3333.           sal.pc = pc;
  3334.           add_sal_to_sals_basic (sals, &sal);
  3335.         }

  3337.       VEC_free (CORE_ADDR, pcs);
  3338.     }
  3339. }



  3343. /* Return the line offset represented by VARIABLE.  */

  3345. static struct line_offset
  3346. ‌linespec_parse_variable (struct linespec_state *self, const char *variable)
  3347. {
  3348.   int index = 0;
  3349.   const char *p;
  3350.   struct line_offset offset = {0, LINE_OFFSET_NONE};

  3352.   p = (variable[1] == '$') ? variable + 2 : variable + 1;
  3353.   if (*p == '$')
  3354.     ++p;
  3355.   while (*p >= '0' && *p <= '9')
  3356.     ++p;
  3357.   if (!*p)                /* Reached end of token without hitting non-digit.  */
  3358.     {
  3359.       /* We have a value history reference.  */
  3360.       struct value *val_history;

  3362.       sscanf ((variable[1] == '$') ? variable + 2 : variable + 1, "%d", &index);
  3363.       val_history
  3364.         = access_value_history ((variable[1] == '$') ? -index : index);
  3365.       if (TYPE_CODE (value_type (val_history)) != TYPE_CODE_INT)
  3366.         error (_("History values used in line "
  3367.                  "specs must have integer values."));
  3368.       offset.offset = value_as_long (val_history);
  3369.     }
  3370.   else
  3371.     {
  3372.       /* Not all digits -- may be user variable/function or a
  3373.          convenience variable.  */
  3374.       LONGEST valx;
  3375.       struct internalvar *ivar;

  3377.       /* Try it as a convenience variable.  If it is not a convenience
  3378.          variable, return and allow normal symbol lookup to occur.  */
  3379.       ivar = lookup_only_internalvar (variable + 1);
  3380.       if (ivar == NULL)
  3381.         /* No internal variable with that name.  Mark the offset
  3382.            as unknown to allow the name to be looked up as a symbol.  */
  3383.         offset.sign = LINE_OFFSET_UNKNOWN;
  3384.       else
  3385.         {
  3386.           /* We found a valid variable name.  If it is not an integer,
  3387.              throw an error.  */
  3388.           if (!get_internalvar_integer (ivar, &valx))
  3389.             error (_("Convenience variables used in line "
  3390.                      "specs must have integer values."));
  3391.           else
  3392.             offset.offset = valx;
  3393.         }
  3394.     }

  3396.   return offset;
  3397. }


  3400. /* A callback used to possibly add a symbol to the results.  */

  3402. static int
  3403. ‌collect_symbols (struct symbol *sym, void *data)
  3404. {
  3405.   struct collect_info *info = data;

  3407.   /* In list mode, add all matching symbols, regardless of class.
  3408.      This allows the user to type "list a_global_variable".  */
  3409.   if (SYMBOL_CLASS (sym) == LOC_BLOCK || info->state->list_mode)
  3410.     VEC_safe_push (symbolp, info->result.symbols, sym);
  3411.   return 1; /* Continue iterating.  */
  3412. }

  3414. /* We've found a minimal symbol MSYMBOL in OBJFILE to associate with our
  3415.    linespec; return the SAL in RESULT.  */

  3417. static void
  3418. ‌minsym_found (struct linespec_state *self, struct objfile *objfile,
  3419.               struct minimal_symbol *msymbol,
  3420.               struct symtabs_and_lines *result)
  3421. {
  3422.   struct gdbarch *gdbarch = get_objfile_arch (objfile);
  3423.   CORE_ADDR pc;
  3424.   struct symtab_and_line sal;

  3426.   sal = find_pc_sect_line (MSYMBOL_VALUE_ADDRESS (objfile, msymbol),
  3427.                            (struct obj_section *) 0, 0);
  3428.   sal.section = MSYMBOL_OBJ_SECTION (objfile, msymbol);

  3430.   /* The minimal symbol might point to a function descriptor;
  3431.      resolve it to the actual code address instead.  */
  3432.   pc = gdbarch_convert_from_func_ptr_addr (gdbarch, sal.pc, &current_target);
  3433.   if (pc != sal.pc)
  3434.     sal = find_pc_sect_line (pc, NULL, 0);

  3436.   if (self->funfirstline)
  3437.     skip_prologue_sal (&sal);

  3439.   if (maybe_add_address (self->addr_set, objfile->pspace, sal.pc))
  3440.     add_sal_to_sals (self, result, &sal, MSYMBOL_NATURAL_NAME (msymbol), 0);
  3441. }

  3443. /* A helper struct to pass some data through
  3444.    iterate_over_minimal_symbols.  */

  3446. ‌struct collect_minsyms
  3447. {
  3448.   /* The objfile we're examining.  */
  3449.   struct objfile *objfile;

  3451.   /* Only search the given symtab, or NULL to search for all symbols.  */
  3452.   struct symtab *symtab;

  3454.   /* The funfirstline setting from the initial call.  */
  3455.   int funfirstline;

  3457.   /* The list_mode setting from the initial call.  */
  3458.   int list_mode;

  3460.   /* The resulting symbols.  */
  3461.   VEC (bound_minimal_symbol_d) *msyms;
  3462. };

  3464. /* A helper function to classify a minimal_symbol_type according to
  3465.    priority.  */

  3467. static int
  3468. ‌classify_mtype (enum minimal_symbol_type t)
  3469. {
  3470.   switch (t)
  3471.     {
  3472.     case mst_file_text:
  3473.     case mst_file_data:
  3474.     case mst_file_bss:
  3475.       /* Intermediate priority.  */
  3476.       return 1;

  3478.     case mst_solib_trampoline:
  3479.       /* Lowest priority.  */
  3480.       return 2;

  3482.     default:
  3483.       /* Highest priority.  */
  3484.       return 0;
  3485.     }
  3486. }

  3488. /* Callback for qsort that sorts symbols by priority.  */

  3490. static int
  3491. ‌compare_msyms (const void *a, const void *b)
  3492. {
  3493.   const bound_minimal_symbol_d *moa = a;
  3494.   const bound_minimal_symbol_d *mob = b;
  3495.   enum minimal_symbol_type ta = MSYMBOL_TYPE (moa->minsym);
  3496.   enum minimal_symbol_type tb = MSYMBOL_TYPE (mob->minsym);

  3498.   return classify_mtype (ta) - classify_mtype (tb);
  3499. }

  3501. /* Callback for iterate_over_minimal_symbols that adds the symbol to
  3502.    the result.  */

  3504. static void
  3505. ‌add_minsym (struct minimal_symbol *minsym, void *d)
  3506. {
  3507.   struct collect_minsyms *info = d;
  3508.   bound_minimal_symbol_d mo;

  3510.   mo.minsym = minsym;
  3511.   mo.objfile = info->objfile;

  3513.   if (info->symtab != NULL)
  3514.     {
  3515.       CORE_ADDR pc;
  3516.       struct symtab_and_line sal;
  3517.       struct gdbarch *gdbarch = get_objfile_arch (info->objfile);

  3519.       sal = find_pc_sect_line (MSYMBOL_VALUE_ADDRESS (info->objfile, minsym),
  3520.                                NULL, 0);
  3521.       sal.section = MSYMBOL_OBJ_SECTION (info->objfile, minsym);
  3522.       pc
  3523.         = gdbarch_convert_from_func_ptr_addr (gdbarch, sal.pc, &current_target);
  3524.       if (pc != sal.pc)
  3525.         sal = find_pc_sect_line (pc, NULL, 0);

  3527.       if (info->symtab != sal.symtab)
  3528.         return;
  3529.     }

  3531.   /* Exclude data symbols when looking for breakpoint locations.   */
  3532.   if (!info->list_mode)
  3533.     switch (minsym->type)
  3534.       {
  3535.         case mst_slot_got_plt:
  3536.         case mst_data:
  3537.         case mst_bss:
  3538.         case mst_abs:
  3539.         case mst_file_data:
  3540.         case mst_file_bss:
  3541.           {
  3542.             /* Make sure this minsym is not a function descriptor
  3543.                before we decide to discard it.  */
  3544.             struct gdbarch *gdbarch = get_objfile_arch (info->objfile);
  3545.             CORE_ADDR addr = gdbarch_convert_from_func_ptr_addr
  3546.                                (gdbarch, BMSYMBOL_VALUE_ADDRESS (mo),
  3547.                                 &current_target);

  3549.             if (addr == BMSYMBOL_VALUE_ADDRESS (mo))
  3550.               return;
  3551.           }
  3552.       }

  3554.   VEC_safe_push (bound_minimal_symbol_d, info->msyms, &mo);
  3555. }

  3557. /* Search for minimal symbols called NAME.  If SEARCH_PSPACE
  3558.    is not NULL, the search is restricted to just that program
  3559.    space.

  3561.    If SYMTAB is NULL, search all objfiles, otherwise
  3562.    restrict results to the given SYMTAB.  */

  3564. static void
  3565. ‌search_minsyms_for_name (struct collect_info *info, const char *name,
  3566.                          struct program_space *search_pspace,
  3567.                          struct symtab *symtab)
  3568. {
  3569.   struct collect_minsyms local;
  3570.   struct cleanup *cleanup;

  3572.   memset (&local, 0, sizeof (local));
  3573.   local.funfirstline = info->state->funfirstline;
  3574.   local.list_mode = info->state->list_mode;
  3575.   local.symtab = symtab;

  3577.   cleanup = make_cleanup (VEC_cleanup (bound_minimal_symbol_d), &local.msyms);

  3579.   if (symtab == NULL)
  3580.     {
  3581.       struct program_space *pspace;

  3583.       ALL_PSPACES (pspace)
  3584.       {
  3585.         struct objfile *objfile;

  3587.         if (search_pspace != NULL && search_pspace != pspace)
  3588.           continue;
  3589.         if (pspace->executing_startup)
  3590.           continue;

  3592.         set_current_program_space (pspace);

  3594.         ALL_OBJFILES (objfile)
  3595.         {
  3596.           local.objfile = objfile;
  3597.           iterate_over_minimal_symbols (objfile, name, add_minsym, &local);
  3598.         }
  3599.       }
  3600.     }
  3601.   else
  3602.     {
  3603.       if (search_pspace == NULL || SYMTAB_PSPACE (symtab) == search_pspace)
  3604.         {
  3605.           set_current_program_space (SYMTAB_PSPACE (symtab));
  3606.           local.objfile = SYMTAB_OBJFILE(symtab);
  3607.           iterate_over_minimal_symbols (local.objfile, name, add_minsym,
  3608.                                         &local);
  3609.         }
  3610.     }

  3612.     if (!VEC_empty (bound_minimal_symbol_d, local.msyms))
  3613.       {
  3614.         int classification;
  3615.         int ix;
  3616.         bound_minimal_symbol_d *item;

  3618.         qsort (VEC_address (bound_minimal_symbol_d, local.msyms),
  3619.                VEC_length (bound_minimal_symbol_d, local.msyms),
  3620.                sizeof (bound_minimal_symbol_d),
  3621.                compare_msyms);

  3623.         /* Now the minsyms are in classification order.  So, we walk
  3624.            over them and process just the minsyms with the same
  3625.            classification as the very first minsym in the list.  */
  3626.         item = VEC_index (bound_minimal_symbol_d, local.msyms, 0);
  3627.         classification = classify_mtype (MSYMBOL_TYPE (item->minsym));

  3629.         for (ix = 0;
  3630.              VEC_iterate (bound_minimal_symbol_d, local.msyms, ix, item);
  3631.              ++ix)
  3632.           {
  3633.             if (classify_mtype (MSYMBOL_TYPE (item->minsym)) != classification)
  3634.               break;

  3636.             VEC_safe_push (bound_minimal_symbol_d,
  3637.                            info->result.minimal_symbols, item);
  3638.           }
  3639.       }

  3641.     do_cleanups (cleanup);
  3642. }

  3644. /* A helper function to add all symbols matching NAME to INFO.  If
  3645.    PSPACE is not NULL, the search is restricted to just that program
  3646.    space.  */

  3648. static void
  3649. ‌add_matching_symbols_to_info (const char *name,
  3650.                               struct collect_info *info,
  3651.                               struct program_space *pspace)
  3652. {
  3653.   int ix;
  3654.   struct symtab *elt;

  3656.   for (ix = 0; VEC_iterate (symtab_ptr, info->file_symtabs, ix, elt); ++ix)
  3657.     {
  3658.       if (elt == NULL)
  3659.         {
  3660.           iterate_over_all_matching_symtabs (info->state, name, VAR_DOMAIN,
  3661.                                              collect_symbols, info,
  3662.                                              pspace, 1);
  3663.           search_minsyms_for_name (info, name, pspace, NULL);
  3664.         }
  3665.       else if (pspace == NULL || pspace == SYMTAB_PSPACE (elt))
  3666.         {
  3667.           int prev_len = VEC_length (symbolp, info->result.symbols);

  3669.           /* Program spaces that are executing startup should have
  3670.              been filtered out earlier.  */
  3671.           gdb_assert (!SYMTAB_PSPACE (elt)->executing_startup);
  3672.           set_current_program_space (SYMTAB_PSPACE (elt));
  3673.           iterate_over_file_blocks (elt, name, VAR_DOMAIN,
  3674.                                     collect_symbols, info);

  3676.           /* If no new symbols were found in this iteration and this symtab
  3677.              is in assembler, we might actually be looking for a label for
  3678.              which we don't have debug info.  Check for a minimal symbol in
  3679.              this case.  */
  3680.           if (prev_len == VEC_length (symbolp, info->result.symbols)
  3681.               && elt->language == language_asm)
  3682.             search_minsyms_for_name (info, name, pspace, elt);
  3683.         }
  3684.     }
  3685. }



  3689. /* Now come some functions that are called from multiple places within
  3690.    decode_line_1.  */

  3692. static int
  3693. ‌symbol_to_sal (struct symtab_and_line *result,
  3694.                int funfirstline, struct symbol *sym)
  3695. {
  3696.   if (SYMBOL_CLASS (sym) == LOC_BLOCK)
  3697.     {
  3698.       *result = find_function_start_sal (sym, funfirstline);
  3699.       return 1;
  3700.     }
  3701.   else
  3702.     {
  3703.       if (SYMBOL_CLASS (sym) == LOC_LABEL && SYMBOL_VALUE_ADDRESS (sym) != 0)
  3704.         {
  3705.           init_sal (result);
  3706.           result->symtab = symbol_symtab (sym);
  3707.           result->line = SYMBOL_LINE (sym);
  3708.           result->pc = SYMBOL_VALUE_ADDRESS (sym);
  3709.           result->pspace = SYMTAB_PSPACE (result->symtab);
  3710.           result->explicit_pc = 1;
  3711.           return 1;
  3712.         }
  3713.       else if (funfirstline)
  3714.         {
  3715.           /* Nothing.  */
  3716.         }
  3717.       else if (SYMBOL_LINE (sym) != 0)
  3718.         {
  3719.           /* We know its line number.  */
  3720.           init_sal (result);
  3721.           result->symtab = symbol_symtab (sym);
  3722.           result->line = SYMBOL_LINE (sym);
  3723.           result->pspace = SYMTAB_PSPACE (result->symtab);
  3724.           return 1;
  3725.         }
  3726.     }

  3728.   return 0;
  3729. }

  3731. /* See the comment in linespec.h.  */

  3733. void
  3734. ‌init_linespec_result (struct linespec_result *lr)
  3735. {
  3736.   memset (lr, 0, sizeof (*lr));
  3737. }

  3739. /* See the comment in linespec.h.  */

  3741. void
  3742. ‌destroy_linespec_result (struct linespec_result *ls)
  3743. {
  3744.   int i;
  3745.   struct linespec_sals *lsal;

  3747.   xfree (ls->addr_string);
  3748.   for (i = 0; VEC_iterate (linespec_sals, ls->sals, i, lsal); ++i)
  3749.     {
  3750.       xfree (lsal->canonical);
  3751.       xfree (lsal->sals.sals);
  3752.     }
  3753.   VEC_free (linespec_sals, ls->sals);
  3754. }

  3756. /* Cleanup function for a linespec_result.  */

  3758. static void
  3759. ‌cleanup_linespec_result (void *a)
  3760. {
  3761.   destroy_linespec_result (a);
  3762. }

  3764. /* See the comment in linespec.h.  */

  3766. struct cleanup *
  3767. ‌make_cleanup_destroy_linespec_result (struct linespec_result *ls)
  3768. {
  3769.   return make_cleanup (cleanup_linespec_result, ls);
  3770. }