expr.h 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  1. /* expr.h -> header file for expr.c
  2. Copyright (C) 1987-2022 Free Software Foundation, Inc.
  3. This file is part of GAS, the GNU Assembler.
  4. GAS is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 3, or (at your option)
  7. any later version.
  8. GAS is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with GAS; see the file COPYING. If not, write to the Free
  14. Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
  15. 02110-1301, USA. */
  16. /* By popular demand, we define a struct to represent an expression.
  17. This will no doubt mutate as expressions become baroque.
  18. Currently, we support expressions like "foo OP bar + 42". In other
  19. words we permit a (possibly undefined) symbol, a (possibly
  20. undefined) symbol and the operation used to combine the symbols,
  21. and an (absolute) augend. RMS says this is so we can have 1-pass
  22. assembly for any compiler emissions, and a 'case' statement might
  23. emit 'undefined1 - undefined2'.
  24. The type of an expression used to be stored as a segment. That got
  25. confusing because it overloaded the concept of a segment. I added
  26. an operator field, instead. */
  27. /* This is the type of an expression. The operator types are also
  28. used while parsing an expression.
  29. NOTE: This enumeration must match the op_rank array in expr.c. */
  30. typedef enum
  31. {
  32. /* An illegal expression. */
  33. O_illegal,
  34. /* A nonexistent expression. */
  35. O_absent,
  36. /* X_add_number (a constant expression). */
  37. O_constant,
  38. /* X_add_symbol + X_add_number. */
  39. O_symbol,
  40. /* X_add_symbol + X_add_number - the base address of the image. */
  41. O_symbol_rva,
  42. /* The section index of X_add_symbol. */
  43. O_secidx,
  44. /* A register (X_add_number is register number). */
  45. O_register,
  46. /* A big value. If X_add_number is negative or 0, the value is in
  47. generic_floating_point_number. Otherwise the value is in
  48. generic_bignum, and X_add_number is the number of LITTLENUMs in
  49. the value. */
  50. O_big,
  51. /* (- X_add_symbol) + X_add_number. */
  52. O_uminus,
  53. /* (~ X_add_symbol) + X_add_number. */
  54. O_bit_not,
  55. /* (! X_add_symbol) + X_add_number. */
  56. O_logical_not,
  57. /* (X_add_symbol * X_op_symbol) + X_add_number. */
  58. O_multiply,
  59. /* (X_add_symbol / X_op_symbol) + X_add_number. */
  60. O_divide,
  61. /* (X_add_symbol % X_op_symbol) + X_add_number. */
  62. O_modulus,
  63. /* (X_add_symbol << X_op_symbol) + X_add_number. */
  64. O_left_shift,
  65. /* (X_add_symbol >> X_op_symbol) + X_add_number. */
  66. O_right_shift,
  67. /* (X_add_symbol | X_op_symbol) + X_add_number. */
  68. O_bit_inclusive_or,
  69. /* (X_add_symbol |~ X_op_symbol) + X_add_number. */
  70. O_bit_or_not,
  71. /* (X_add_symbol ^ X_op_symbol) + X_add_number. */
  72. O_bit_exclusive_or,
  73. /* (X_add_symbol & X_op_symbol) + X_add_number. */
  74. O_bit_and,
  75. /* (X_add_symbol + X_op_symbol) + X_add_number. */
  76. O_add,
  77. /* (X_add_symbol - X_op_symbol) + X_add_number. */
  78. O_subtract,
  79. /* (X_add_symbol == X_op_symbol) + X_add_number. */
  80. O_eq,
  81. /* (X_add_symbol != X_op_symbol) + X_add_number. */
  82. O_ne,
  83. /* (X_add_symbol < X_op_symbol) + X_add_number. */
  84. O_lt,
  85. /* (X_add_symbol <= X_op_symbol) + X_add_number. */
  86. O_le,
  87. /* (X_add_symbol >= X_op_symbol) + X_add_number. */
  88. O_ge,
  89. /* (X_add_symbol > X_op_symbol) + X_add_number. */
  90. O_gt,
  91. /* (X_add_symbol && X_op_symbol) + X_add_number. */
  92. O_logical_and,
  93. /* (X_add_symbol || X_op_symbol) + X_add_number. */
  94. O_logical_or,
  95. /* X_op_symbol [ X_add_symbol ] */
  96. O_index,
  97. /* machine dependent operators */
  98. O_md1, O_md2, O_md3, O_md4, O_md5, O_md6, O_md7, O_md8,
  99. O_md9, O_md10, O_md11, O_md12, O_md13, O_md14, O_md15, O_md16,
  100. O_md17, O_md18, O_md19, O_md20, O_md21, O_md22, O_md23, O_md24,
  101. O_md25, O_md26, O_md27, O_md28, O_md29, O_md30, O_md31, O_md32,
  102. /* this must be the largest value */
  103. O_max
  104. } operatorT;
  105. typedef struct expressionS
  106. {
  107. /* The main symbol. */
  108. symbolS *X_add_symbol;
  109. /* The second symbol, if needed. */
  110. symbolS *X_op_symbol;
  111. /* A number to add. */
  112. offsetT X_add_number;
  113. /* The type of the expression. We can't assume that an arbitrary
  114. compiler can handle a bitfield of enum type. FIXME: We could
  115. check this using autoconf. */
  116. #ifdef __GNUC__
  117. operatorT X_op : 8;
  118. #else
  119. unsigned char X_op;
  120. #endif
  121. /* Non-zero if X_add_number should be regarded as unsigned. This is
  122. only valid for O_constant expressions. It is only used when an
  123. O_constant must be extended into a bignum (i.e., it is not used
  124. when performing arithmetic on these values).
  125. FIXME: This field is not set very reliably. */
  126. unsigned int X_unsigned : 1;
  127. /* This is used to implement "word size + 1 bit" arithmetic, so that e.g.
  128. expressions used with .sleb128 directives can use the full range available
  129. for an unsigned word, but can also properly represent all values of a
  130. signed word. */
  131. unsigned int X_extrabit : 1;
  132. /* 7 additional bits can be defined if needed. */
  133. /* Machine dependent field */
  134. unsigned short X_md;
  135. } expressionS;
  136. enum expr_mode
  137. {
  138. expr_evaluate,
  139. expr_normal,
  140. expr_defer
  141. };
  142. /* "result" should be type (expressionS *). */
  143. #define expression(result) expr (0, result, expr_normal)
  144. #define expression_and_evaluate(result) expr (0, result, expr_evaluate)
  145. #define deferred_expression(result) expr (0, result, expr_defer)
  146. /* If an expression is O_big, look here for its value. These common
  147. data may be clobbered whenever expr() is called. */
  148. /* Flonums returned here. Big enough to hold most precise flonum. */
  149. extern FLONUM_TYPE generic_floating_point_number;
  150. /* Bignums returned here. */
  151. extern LITTLENUM_TYPE generic_bignum[];
  152. /* Number of littlenums in above. */
  153. #define SIZE_OF_LARGE_NUMBER (20)
  154. typedef char operator_rankT;
  155. extern char get_symbol_name (char **);
  156. extern char restore_line_pointer (char);
  157. extern void expr_begin (void);
  158. extern void expr_set_precedence (void);
  159. extern void expr_set_rank (operatorT, operator_rankT);
  160. extern void add_to_result (expressionS *, offsetT, int);
  161. extern void subtract_from_result (expressionS *, offsetT, int);
  162. extern segT expr (int, expressionS *, enum expr_mode);
  163. extern unsigned int get_single_number (void);
  164. extern symbolS *make_expr_symbol (expressionS * expressionP);
  165. extern int expr_symbol_where (symbolS *, const char **, unsigned int *);
  166. extern void current_location (expressionS *);
  167. extern symbolS *expr_build_uconstant (offsetT);
  168. extern symbolS *expr_build_dot (void);
  169. extern uint32_t generic_bignum_to_int32 (void);
  170. extern uint64_t generic_bignum_to_int64 (void);
  171. extern int resolve_expression (expressionS *);
  172. extern bool literal_prefix_dollar_hex;