Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Support for printing Fortran values for GDB, the GNU debugger. |
22abf04a | 2 | Copyright 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2003 |
b6ba6518 | 3 | Free Software Foundation, Inc. |
c906108c SS |
4 | Contributed by Motorola. Adapted from the C definitions by Farooq Butt |
5 | (fmbutt@engage.sps.mot.com), additionally worked over by Stan Shebs. | |
6 | ||
c5aa993b | 7 | This file is part of GDB. |
c906108c | 8 | |
c5aa993b JM |
9 | This program is free software; you can redistribute it and/or modify |
10 | it under the terms of the GNU General Public License as published by | |
11 | the Free Software Foundation; either version 2 of the License, or | |
12 | (at your option) any later version. | |
c906108c | 13 | |
c5aa993b JM |
14 | This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
c906108c | 18 | |
c5aa993b JM |
19 | You should have received a copy of the GNU General Public License |
20 | along with this program; if not, write to the Free Software | |
21 | Foundation, Inc., 59 Temple Place - Suite 330, | |
22 | Boston, MA 02111-1307, USA. */ | |
c906108c SS |
23 | |
24 | #include "defs.h" | |
25 | #include "gdb_string.h" | |
26 | #include "symtab.h" | |
27 | #include "gdbtypes.h" | |
28 | #include "expression.h" | |
29 | #include "value.h" | |
c906108c SS |
30 | #include "valprint.h" |
31 | #include "language.h" | |
c5aa993b | 32 | #include "f-lang.h" |
c906108c SS |
33 | #include "frame.h" |
34 | #include "gdbcore.h" | |
35 | #include "command.h" | |
fe898f56 | 36 | #include "block.h" |
c906108c SS |
37 | |
38 | #if 0 | |
a14ed312 | 39 | static int there_is_a_visible_common_named (char *); |
c906108c SS |
40 | #endif |
41 | ||
a14ed312 KB |
42 | extern void _initialize_f_valprint (void); |
43 | static void info_common_command (char *, int); | |
44 | static void list_all_visible_commons (char *); | |
d9fcf2fb JM |
45 | static void f77_print_array (struct type *, char *, CORE_ADDR, |
46 | struct ui_file *, int, int, int, | |
47 | enum val_prettyprint); | |
48 | static void f77_print_array_1 (int, int, struct type *, char *, | |
49 | CORE_ADDR, struct ui_file *, int, int, int, | |
4371f367 DL |
50 | enum val_prettyprint, |
51 | int *elts); | |
d9fcf2fb JM |
52 | static void f77_create_arrayprint_offset_tbl (struct type *, |
53 | struct ui_file *); | |
a14ed312 | 54 | static void f77_get_dynamic_length_of_aggregate (struct type *); |
c906108c | 55 | |
c5aa993b | 56 | int f77_array_offset_tbl[MAX_FORTRAN_DIMS + 1][2]; |
c906108c SS |
57 | |
58 | /* Array which holds offsets to be applied to get a row's elements | |
59 | for a given array. Array also holds the size of each subarray. */ | |
60 | ||
61 | /* The following macro gives us the size of the nth dimension, Where | |
c5aa993b | 62 | n is 1 based. */ |
c906108c SS |
63 | |
64 | #define F77_DIM_SIZE(n) (f77_array_offset_tbl[n][1]) | |
65 | ||
c5aa993b | 66 | /* The following gives us the offset for row n where n is 1-based. */ |
c906108c SS |
67 | |
68 | #define F77_DIM_OFFSET(n) (f77_array_offset_tbl[n][0]) | |
69 | ||
c5aa993b | 70 | int |
fba45db2 | 71 | f77_get_dynamic_lowerbound (struct type *type, int *lower_bound) |
c906108c | 72 | { |
c5aa993b JM |
73 | CORE_ADDR current_frame_addr; |
74 | CORE_ADDR ptr_to_lower_bound; | |
75 | ||
c906108c SS |
76 | switch (TYPE_ARRAY_LOWER_BOUND_TYPE (type)) |
77 | { | |
78 | case BOUND_BY_VALUE_ON_STACK: | |
8b36eed8 | 79 | current_frame_addr = get_frame_base (deprecated_selected_frame); |
c5aa993b | 80 | if (current_frame_addr > 0) |
c906108c | 81 | { |
c5aa993b JM |
82 | *lower_bound = |
83 | read_memory_integer (current_frame_addr + | |
c906108c SS |
84 | TYPE_ARRAY_LOWER_BOUND_VALUE (type), |
85 | 4); | |
86 | } | |
87 | else | |
88 | { | |
c5aa993b JM |
89 | *lower_bound = DEFAULT_LOWER_BOUND; |
90 | return BOUND_FETCH_ERROR; | |
c906108c | 91 | } |
c5aa993b JM |
92 | break; |
93 | ||
c906108c SS |
94 | case BOUND_SIMPLE: |
95 | *lower_bound = TYPE_ARRAY_LOWER_BOUND_VALUE (type); | |
c5aa993b JM |
96 | break; |
97 | ||
98 | case BOUND_CANNOT_BE_DETERMINED: | |
99 | error ("Lower bound may not be '*' in F77"); | |
100 | break; | |
101 | ||
c906108c | 102 | case BOUND_BY_REF_ON_STACK: |
8b36eed8 | 103 | current_frame_addr = get_frame_base (deprecated_selected_frame); |
c5aa993b | 104 | if (current_frame_addr > 0) |
c906108c | 105 | { |
c5aa993b | 106 | ptr_to_lower_bound = |
0d540cdf KD |
107 | read_memory_typed_address (current_frame_addr + |
108 | TYPE_ARRAY_LOWER_BOUND_VALUE (type), | |
109 | builtin_type_void_data_ptr); | |
c5aa993b | 110 | *lower_bound = read_memory_integer (ptr_to_lower_bound, 4); |
c906108c SS |
111 | } |
112 | else | |
113 | { | |
c5aa993b JM |
114 | *lower_bound = DEFAULT_LOWER_BOUND; |
115 | return BOUND_FETCH_ERROR; | |
c906108c | 116 | } |
c5aa993b JM |
117 | break; |
118 | ||
119 | case BOUND_BY_REF_IN_REG: | |
120 | case BOUND_BY_VALUE_IN_REG: | |
121 | default: | |
c906108c | 122 | error ("??? unhandled dynamic array bound type ???"); |
c5aa993b | 123 | break; |
c906108c SS |
124 | } |
125 | return BOUND_FETCH_OK; | |
126 | } | |
127 | ||
c5aa993b | 128 | int |
fba45db2 | 129 | f77_get_dynamic_upperbound (struct type *type, int *upper_bound) |
c906108c SS |
130 | { |
131 | CORE_ADDR current_frame_addr = 0; | |
c5aa993b JM |
132 | CORE_ADDR ptr_to_upper_bound; |
133 | ||
c906108c SS |
134 | switch (TYPE_ARRAY_UPPER_BOUND_TYPE (type)) |
135 | { | |
136 | case BOUND_BY_VALUE_ON_STACK: | |
8b36eed8 | 137 | current_frame_addr = get_frame_base (deprecated_selected_frame); |
c5aa993b | 138 | if (current_frame_addr > 0) |
c906108c | 139 | { |
c5aa993b JM |
140 | *upper_bound = |
141 | read_memory_integer (current_frame_addr + | |
c906108c SS |
142 | TYPE_ARRAY_UPPER_BOUND_VALUE (type), |
143 | 4); | |
144 | } | |
145 | else | |
146 | { | |
c5aa993b JM |
147 | *upper_bound = DEFAULT_UPPER_BOUND; |
148 | return BOUND_FETCH_ERROR; | |
c906108c | 149 | } |
c5aa993b JM |
150 | break; |
151 | ||
c906108c SS |
152 | case BOUND_SIMPLE: |
153 | *upper_bound = TYPE_ARRAY_UPPER_BOUND_VALUE (type); | |
c5aa993b JM |
154 | break; |
155 | ||
156 | case BOUND_CANNOT_BE_DETERMINED: | |
c906108c | 157 | /* we have an assumed size array on our hands. Assume that |
c5aa993b JM |
158 | upper_bound == lower_bound so that we show at least |
159 | 1 element.If the user wants to see more elements, let | |
160 | him manually ask for 'em and we'll subscript the | |
161 | array and show him */ | |
c906108c | 162 | f77_get_dynamic_lowerbound (type, upper_bound); |
c5aa993b JM |
163 | break; |
164 | ||
c906108c | 165 | case BOUND_BY_REF_ON_STACK: |
8b36eed8 | 166 | current_frame_addr = get_frame_base (deprecated_selected_frame); |
c5aa993b | 167 | if (current_frame_addr > 0) |
c906108c | 168 | { |
c5aa993b | 169 | ptr_to_upper_bound = |
0d540cdf KD |
170 | read_memory_typed_address (current_frame_addr + |
171 | TYPE_ARRAY_UPPER_BOUND_VALUE (type), | |
172 | builtin_type_void_data_ptr); | |
c5aa993b | 173 | *upper_bound = read_memory_integer (ptr_to_upper_bound, 4); |
c906108c SS |
174 | } |
175 | else | |
176 | { | |
c5aa993b | 177 | *upper_bound = DEFAULT_UPPER_BOUND; |
c906108c SS |
178 | return BOUND_FETCH_ERROR; |
179 | } | |
c5aa993b JM |
180 | break; |
181 | ||
182 | case BOUND_BY_REF_IN_REG: | |
183 | case BOUND_BY_VALUE_IN_REG: | |
184 | default: | |
c906108c | 185 | error ("??? unhandled dynamic array bound type ???"); |
c5aa993b | 186 | break; |
c906108c SS |
187 | } |
188 | return BOUND_FETCH_OK; | |
189 | } | |
190 | ||
c5aa993b | 191 | /* Obtain F77 adjustable array dimensions */ |
c906108c SS |
192 | |
193 | static void | |
fba45db2 | 194 | f77_get_dynamic_length_of_aggregate (struct type *type) |
c906108c SS |
195 | { |
196 | int upper_bound = -1; | |
c5aa993b JM |
197 | int lower_bound = 1; |
198 | int retcode; | |
199 | ||
c906108c SS |
200 | /* Recursively go all the way down into a possibly multi-dimensional |
201 | F77 array and get the bounds. For simple arrays, this is pretty | |
202 | easy but when the bounds are dynamic, we must be very careful | |
203 | to add up all the lengths correctly. Not doing this right | |
204 | will lead to horrendous-looking arrays in parameter lists. | |
c5aa993b | 205 | |
c906108c | 206 | This function also works for strings which behave very |
c5aa993b JM |
207 | similarly to arrays. */ |
208 | ||
209 | if (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY | |
210 | || TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_STRING) | |
c906108c | 211 | f77_get_dynamic_length_of_aggregate (TYPE_TARGET_TYPE (type)); |
c5aa993b JM |
212 | |
213 | /* Recursion ends here, start setting up lengths. */ | |
214 | retcode = f77_get_dynamic_lowerbound (type, &lower_bound); | |
c906108c | 215 | if (retcode == BOUND_FETCH_ERROR) |
c5aa993b JM |
216 | error ("Cannot obtain valid array lower bound"); |
217 | ||
218 | retcode = f77_get_dynamic_upperbound (type, &upper_bound); | |
c906108c | 219 | if (retcode == BOUND_FETCH_ERROR) |
c5aa993b JM |
220 | error ("Cannot obtain valid array upper bound"); |
221 | ||
222 | /* Patch in a valid length value. */ | |
223 | ||
c906108c SS |
224 | TYPE_LENGTH (type) = |
225 | (upper_bound - lower_bound + 1) * TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type))); | |
c5aa993b | 226 | } |
c906108c SS |
227 | |
228 | /* Function that sets up the array offset,size table for the array | |
c5aa993b | 229 | type "type". */ |
c906108c | 230 | |
c5aa993b | 231 | static void |
fba45db2 | 232 | f77_create_arrayprint_offset_tbl (struct type *type, struct ui_file *stream) |
c906108c SS |
233 | { |
234 | struct type *tmp_type; | |
235 | int eltlen; | |
236 | int ndimen = 1; | |
c5aa993b JM |
237 | int upper, lower, retcode; |
238 | ||
239 | tmp_type = type; | |
240 | ||
241 | while ((TYPE_CODE (tmp_type) == TYPE_CODE_ARRAY)) | |
c906108c SS |
242 | { |
243 | if (TYPE_ARRAY_UPPER_BOUND_TYPE (tmp_type) == BOUND_CANNOT_BE_DETERMINED) | |
c5aa993b JM |
244 | fprintf_filtered (stream, "<assumed size array> "); |
245 | ||
c906108c SS |
246 | retcode = f77_get_dynamic_upperbound (tmp_type, &upper); |
247 | if (retcode == BOUND_FETCH_ERROR) | |
c5aa993b JM |
248 | error ("Cannot obtain dynamic upper bound"); |
249 | ||
250 | retcode = f77_get_dynamic_lowerbound (tmp_type, &lower); | |
c906108c | 251 | if (retcode == BOUND_FETCH_ERROR) |
c5aa993b JM |
252 | error ("Cannot obtain dynamic lower bound"); |
253 | ||
c906108c | 254 | F77_DIM_SIZE (ndimen) = upper - lower + 1; |
c5aa993b | 255 | |
c906108c | 256 | tmp_type = TYPE_TARGET_TYPE (tmp_type); |
c5aa993b | 257 | ndimen++; |
c906108c | 258 | } |
c5aa993b | 259 | |
c906108c SS |
260 | /* Now we multiply eltlen by all the offsets, so that later we |
261 | can print out array elements correctly. Up till now we | |
262 | know an offset to apply to get the item but we also | |
263 | have to know how much to add to get to the next item */ | |
c5aa993b | 264 | |
c906108c | 265 | ndimen--; |
c5aa993b | 266 | eltlen = TYPE_LENGTH (tmp_type); |
c906108c SS |
267 | F77_DIM_OFFSET (ndimen) = eltlen; |
268 | while (--ndimen > 0) | |
269 | { | |
270 | eltlen *= F77_DIM_SIZE (ndimen + 1); | |
271 | F77_DIM_OFFSET (ndimen) = eltlen; | |
272 | } | |
273 | } | |
274 | ||
4371f367 DL |
275 | |
276 | ||
c906108c SS |
277 | /* Actual function which prints out F77 arrays, Valaddr == address in |
278 | the superior. Address == the address in the inferior. */ | |
c5aa993b | 279 | static void |
fba45db2 KB |
280 | f77_print_array_1 (int nss, int ndimensions, struct type *type, char *valaddr, |
281 | CORE_ADDR address, struct ui_file *stream, int format, | |
4371f367 DL |
282 | int deref_ref, int recurse, enum val_prettyprint pretty, |
283 | int *elts) | |
c906108c SS |
284 | { |
285 | int i; | |
c5aa993b | 286 | |
c906108c SS |
287 | if (nss != ndimensions) |
288 | { | |
4371f367 | 289 | for (i = 0; i < F77_DIM_SIZE (nss) && *elts < print_max; i++) |
c906108c SS |
290 | { |
291 | fprintf_filtered (stream, "( "); | |
292 | f77_print_array_1 (nss + 1, ndimensions, TYPE_TARGET_TYPE (type), | |
c5aa993b JM |
293 | valaddr + i * F77_DIM_OFFSET (nss), |
294 | address + i * F77_DIM_OFFSET (nss), | |
4371f367 | 295 | stream, format, deref_ref, recurse, pretty, elts); |
c906108c SS |
296 | fprintf_filtered (stream, ") "); |
297 | } | |
4371f367 DL |
298 | if (*elts >= print_max && i < F77_DIM_SIZE (nss)) { |
299 | fprintf_filtered (stream, "..."); | |
300 | } | |
c906108c SS |
301 | } |
302 | else | |
303 | { | |
4371f367 | 304 | for (i = 0; (i < F77_DIM_SIZE (nss) && (*elts) < print_max); i++ , (*elts)++) |
c906108c SS |
305 | { |
306 | val_print (TYPE_TARGET_TYPE (type), | |
307 | valaddr + i * F77_DIM_OFFSET (ndimensions), | |
c5aa993b | 308 | 0, |
c906108c | 309 | address + i * F77_DIM_OFFSET (ndimensions), |
c5aa993b | 310 | stream, format, deref_ref, recurse, pretty); |
c906108c SS |
311 | |
312 | if (i != (F77_DIM_SIZE (nss) - 1)) | |
c5aa993b JM |
313 | fprintf_filtered (stream, ", "); |
314 | ||
4371f367 | 315 | if ((( *elts) == print_max - 1) &&(i != (F77_DIM_SIZE (nss) - 1))) |
c906108c SS |
316 | fprintf_filtered (stream, "..."); |
317 | } | |
318 | } | |
319 | } | |
320 | ||
321 | /* This function gets called to print an F77 array, we set up some | |
322 | stuff and then immediately call f77_print_array_1() */ | |
323 | ||
c5aa993b | 324 | static void |
fba45db2 KB |
325 | f77_print_array (struct type *type, char *valaddr, CORE_ADDR address, |
326 | struct ui_file *stream, int format, int deref_ref, int recurse, | |
327 | enum val_prettyprint pretty) | |
c906108c | 328 | { |
c5aa993b | 329 | int ndimensions; |
4371f367 | 330 | int elts = 0; |
c5aa993b JM |
331 | |
332 | ndimensions = calc_f77_array_dims (type); | |
333 | ||
c906108c SS |
334 | if (ndimensions > MAX_FORTRAN_DIMS || ndimensions < 0) |
335 | error ("Type node corrupt! F77 arrays cannot have %d subscripts (%d Max)", | |
336 | ndimensions, MAX_FORTRAN_DIMS); | |
c5aa993b | 337 | |
c906108c SS |
338 | /* Since F77 arrays are stored column-major, we set up an |
339 | offset table to get at the various row's elements. The | |
c5aa993b | 340 | offset table contains entries for both offset and subarray size. */ |
c906108c | 341 | |
c5aa993b JM |
342 | f77_create_arrayprint_offset_tbl (type, stream); |
343 | ||
344 | f77_print_array_1 (1, ndimensions, type, valaddr, address, stream, format, | |
4371f367 | 345 | deref_ref, recurse, pretty, &elts); |
c5aa993b | 346 | } |
c906108c | 347 | \f |
c5aa993b | 348 | |
c906108c SS |
349 | /* Print data of type TYPE located at VALADDR (within GDB), which came from |
350 | the inferior at address ADDRESS, onto stdio stream STREAM according to | |
351 | FORMAT (a letter or 0 for natural format). The data at VALADDR is in | |
352 | target byte order. | |
c5aa993b | 353 | |
c906108c SS |
354 | If the data are a string pointer, returns the number of string characters |
355 | printed. | |
c5aa993b | 356 | |
c906108c SS |
357 | If DEREF_REF is nonzero, then dereference references, otherwise just print |
358 | them like pointers. | |
c5aa993b | 359 | |
c906108c SS |
360 | The PRETTY parameter controls prettyprinting. */ |
361 | ||
362 | int | |
fba45db2 KB |
363 | f_val_print (struct type *type, char *valaddr, int embedded_offset, |
364 | CORE_ADDR address, struct ui_file *stream, int format, | |
365 | int deref_ref, int recurse, enum val_prettyprint pretty) | |
c906108c | 366 | { |
c5aa993b | 367 | register unsigned int i = 0; /* Number of characters printed */ |
c906108c SS |
368 | struct type *elttype; |
369 | LONGEST val; | |
370 | CORE_ADDR addr; | |
c5aa993b | 371 | |
c906108c SS |
372 | CHECK_TYPEDEF (type); |
373 | switch (TYPE_CODE (type)) | |
374 | { | |
c5aa993b | 375 | case TYPE_CODE_STRING: |
c906108c SS |
376 | f77_get_dynamic_length_of_aggregate (type); |
377 | LA_PRINT_STRING (stream, valaddr, TYPE_LENGTH (type), 1, 0); | |
378 | break; | |
c5aa993b | 379 | |
c906108c | 380 | case TYPE_CODE_ARRAY: |
c5aa993b JM |
381 | fprintf_filtered (stream, "("); |
382 | f77_print_array (type, valaddr, address, stream, format, | |
383 | deref_ref, recurse, pretty); | |
c906108c SS |
384 | fprintf_filtered (stream, ")"); |
385 | break; | |
386 | #if 0 | |
387 | /* Array of unspecified length: treat like pointer to first elt. */ | |
388 | valaddr = (char *) &address; | |
389 | /* FALL THROUGH */ | |
c5aa993b | 390 | #endif |
c906108c SS |
391 | case TYPE_CODE_PTR: |
392 | if (format && format != 's') | |
393 | { | |
394 | print_scalar_formatted (valaddr, type, format, 0, stream); | |
395 | break; | |
396 | } | |
397 | else | |
398 | { | |
399 | addr = unpack_pointer (type, valaddr); | |
400 | elttype = check_typedef (TYPE_TARGET_TYPE (type)); | |
c5aa993b | 401 | |
c906108c SS |
402 | if (TYPE_CODE (elttype) == TYPE_CODE_FUNC) |
403 | { | |
404 | /* Try to print what function it points to. */ | |
405 | print_address_demangle (addr, stream, demangle); | |
406 | /* Return value is irrelevant except for string pointers. */ | |
407 | return 0; | |
408 | } | |
c5aa993b | 409 | |
c906108c | 410 | if (addressprint && format != 's') |
d4f3574e | 411 | fprintf_filtered (stream, "0x%s", paddr_nz (addr)); |
c5aa993b | 412 | |
c906108c SS |
413 | /* For a pointer to char or unsigned char, also print the string |
414 | pointed to, unless pointer is null. */ | |
415 | if (TYPE_LENGTH (elttype) == 1 | |
416 | && TYPE_CODE (elttype) == TYPE_CODE_INT | |
417 | && (format == 0 || format == 's') | |
418 | && addr != 0) | |
419 | i = val_print_string (addr, -1, TYPE_LENGTH (elttype), stream); | |
c5aa993b | 420 | |
c906108c SS |
421 | /* Return number of characters printed, plus one for the |
422 | terminating null if we have "reached the end". */ | |
423 | return (i + (print_max && i != print_max)); | |
424 | } | |
425 | break; | |
c5aa993b | 426 | |
c906108c SS |
427 | case TYPE_CODE_FUNC: |
428 | if (format) | |
429 | { | |
430 | print_scalar_formatted (valaddr, type, format, 0, stream); | |
431 | break; | |
432 | } | |
433 | /* FIXME, we should consider, at least for ANSI C language, eliminating | |
c5aa993b | 434 | the distinction made between FUNCs and POINTERs to FUNCs. */ |
c906108c SS |
435 | fprintf_filtered (stream, "{"); |
436 | type_print (type, "", stream, -1); | |
437 | fprintf_filtered (stream, "} "); | |
438 | /* Try to print what function it points to, and its address. */ | |
439 | print_address_demangle (address, stream, demangle); | |
440 | break; | |
c5aa993b | 441 | |
c906108c SS |
442 | case TYPE_CODE_INT: |
443 | format = format ? format : output_format; | |
444 | if (format) | |
445 | print_scalar_formatted (valaddr, type, format, 0, stream); | |
446 | else | |
447 | { | |
448 | val_print_type_code_int (type, valaddr, stream); | |
449 | /* C and C++ has no single byte int type, char is used instead. | |
450 | Since we don't know whether the value is really intended to | |
451 | be used as an integer or a character, print the character | |
452 | equivalent as well. */ | |
453 | if (TYPE_LENGTH (type) == 1) | |
454 | { | |
455 | fputs_filtered (" ", stream); | |
456 | LA_PRINT_CHAR ((unsigned char) unpack_long (type, valaddr), | |
457 | stream); | |
458 | } | |
459 | } | |
460 | break; | |
c5aa993b | 461 | |
c906108c SS |
462 | case TYPE_CODE_FLT: |
463 | if (format) | |
464 | print_scalar_formatted (valaddr, type, format, 0, stream); | |
465 | else | |
466 | print_floating (valaddr, type, stream); | |
467 | break; | |
c5aa993b | 468 | |
c906108c SS |
469 | case TYPE_CODE_VOID: |
470 | fprintf_filtered (stream, "VOID"); | |
471 | break; | |
c5aa993b | 472 | |
c906108c SS |
473 | case TYPE_CODE_ERROR: |
474 | fprintf_filtered (stream, "<error type>"); | |
475 | break; | |
c5aa993b | 476 | |
c906108c SS |
477 | case TYPE_CODE_RANGE: |
478 | /* FIXME, we should not ever have to print one of these yet. */ | |
479 | fprintf_filtered (stream, "<range type>"); | |
480 | break; | |
c5aa993b | 481 | |
c906108c SS |
482 | case TYPE_CODE_BOOL: |
483 | format = format ? format : output_format; | |
484 | if (format) | |
485 | print_scalar_formatted (valaddr, type, format, 0, stream); | |
486 | else | |
487 | { | |
c5aa993b JM |
488 | val = 0; |
489 | switch (TYPE_LENGTH (type)) | |
c906108c SS |
490 | { |
491 | case 1: | |
492 | val = unpack_long (builtin_type_f_logical_s1, valaddr); | |
c5aa993b JM |
493 | break; |
494 | ||
495 | case 2: | |
c906108c | 496 | val = unpack_long (builtin_type_f_logical_s2, valaddr); |
c5aa993b JM |
497 | break; |
498 | ||
499 | case 4: | |
c906108c | 500 | val = unpack_long (builtin_type_f_logical, valaddr); |
c5aa993b JM |
501 | break; |
502 | ||
c906108c SS |
503 | default: |
504 | error ("Logicals of length %d bytes not supported", | |
505 | TYPE_LENGTH (type)); | |
c5aa993b | 506 | |
c906108c | 507 | } |
c5aa993b JM |
508 | |
509 | if (val == 0) | |
c906108c | 510 | fprintf_filtered (stream, ".FALSE."); |
c5aa993b JM |
511 | else if (val == 1) |
512 | fprintf_filtered (stream, ".TRUE."); | |
513 | else | |
514 | /* Not a legitimate logical type, print as an integer. */ | |
515 | { | |
516 | /* Bash the type code temporarily. */ | |
517 | TYPE_CODE (type) = TYPE_CODE_INT; | |
518 | f_val_print (type, valaddr, 0, address, stream, format, | |
519 | deref_ref, recurse, pretty); | |
520 | /* Restore the type code so later uses work as intended. */ | |
521 | TYPE_CODE (type) = TYPE_CODE_BOOL; | |
522 | } | |
c906108c SS |
523 | } |
524 | break; | |
c5aa993b | 525 | |
c906108c SS |
526 | case TYPE_CODE_COMPLEX: |
527 | switch (TYPE_LENGTH (type)) | |
528 | { | |
c5aa993b JM |
529 | case 8: |
530 | type = builtin_type_f_real; | |
531 | break; | |
532 | case 16: | |
533 | type = builtin_type_f_real_s8; | |
534 | break; | |
535 | case 32: | |
536 | type = builtin_type_f_real_s16; | |
537 | break; | |
c906108c | 538 | default: |
c5aa993b | 539 | error ("Cannot print out complex*%d variables", TYPE_LENGTH (type)); |
c906108c SS |
540 | } |
541 | fputs_filtered ("(", stream); | |
542 | print_floating (valaddr, type, stream); | |
543 | fputs_filtered (",", stream); | |
9af97293 | 544 | print_floating (valaddr + TYPE_LENGTH (type), type, stream); |
c906108c SS |
545 | fputs_filtered (")", stream); |
546 | break; | |
c5aa993b | 547 | |
c906108c SS |
548 | case TYPE_CODE_UNDEF: |
549 | /* This happens (without TYPE_FLAG_STUB set) on systems which don't use | |
c5aa993b JM |
550 | dbx xrefs (NO_DBX_XREFS in gcc) if a file has a "struct foo *bar" |
551 | and no complete type for struct foo in that file. */ | |
c906108c SS |
552 | fprintf_filtered (stream, "<incomplete type>"); |
553 | break; | |
c5aa993b | 554 | |
c906108c SS |
555 | default: |
556 | error ("Invalid F77 type code %d in symbol table.", TYPE_CODE (type)); | |
557 | } | |
558 | gdb_flush (stream); | |
559 | return 0; | |
560 | } | |
561 | ||
562 | static void | |
fba45db2 | 563 | list_all_visible_commons (char *funname) |
c906108c | 564 | { |
c5aa993b JM |
565 | SAVED_F77_COMMON_PTR tmp; |
566 | ||
c906108c | 567 | tmp = head_common_list; |
c5aa993b | 568 | |
c906108c | 569 | printf_filtered ("All COMMON blocks visible at this level:\n\n"); |
c5aa993b | 570 | |
c906108c SS |
571 | while (tmp != NULL) |
572 | { | |
762f08a3 | 573 | if (strcmp (tmp->owning_function, funname) == 0) |
c5aa993b JM |
574 | printf_filtered ("%s\n", tmp->name); |
575 | ||
c906108c SS |
576 | tmp = tmp->next; |
577 | } | |
578 | } | |
579 | ||
580 | /* This function is used to print out the values in a given COMMON | |
581 | block. It will always use the most local common block of the | |
c5aa993b | 582 | given name */ |
c906108c | 583 | |
c5aa993b | 584 | static void |
fba45db2 | 585 | info_common_command (char *comname, int from_tty) |
c906108c | 586 | { |
c5aa993b JM |
587 | SAVED_F77_COMMON_PTR the_common; |
588 | COMMON_ENTRY_PTR entry; | |
c906108c SS |
589 | struct frame_info *fi; |
590 | register char *funname = 0; | |
591 | struct symbol *func; | |
c5aa993b | 592 | |
c906108c SS |
593 | /* We have been told to display the contents of F77 COMMON |
594 | block supposedly visible in this function. Let us | |
595 | first make sure that it is visible and if so, let | |
c5aa993b JM |
596 | us display its contents */ |
597 | ||
6e7f8b9c | 598 | fi = deprecated_selected_frame; |
c5aa993b | 599 | |
c906108c | 600 | if (fi == NULL) |
c5aa993b JM |
601 | error ("No frame selected"); |
602 | ||
c906108c | 603 | /* The following is generally ripped off from stack.c's routine |
c5aa993b JM |
604 | print_frame_info() */ |
605 | ||
bdd78e62 | 606 | func = find_pc_function (get_frame_pc (fi)); |
c906108c SS |
607 | if (func) |
608 | { | |
609 | /* In certain pathological cases, the symtabs give the wrong | |
c5aa993b JM |
610 | function (when we are in the first function in a file which |
611 | is compiled without debugging symbols, the previous function | |
612 | is compiled with debugging symbols, and the "foo.o" symbol | |
613 | that is supposed to tell us where the file with debugging symbols | |
614 | ends has been truncated by ar because it is longer than 15 | |
615 | characters). | |
616 | ||
617 | So look in the minimal symbol tables as well, and if it comes | |
618 | up with a larger address for the function use that instead. | |
619 | I don't think this can ever cause any problems; there shouldn't | |
620 | be any minimal symbols in the middle of a function. | |
621 | FIXME: (Not necessarily true. What about text labels) */ | |
622 | ||
bdd78e62 | 623 | struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (get_frame_pc (fi)); |
c5aa993b | 624 | |
c906108c | 625 | if (msymbol != NULL |
c5aa993b | 626 | && (SYMBOL_VALUE_ADDRESS (msymbol) |
c906108c | 627 | > BLOCK_START (SYMBOL_BLOCK_VALUE (func)))) |
22abf04a | 628 | funname = DEPRECATED_SYMBOL_NAME (msymbol); |
c906108c | 629 | else |
22abf04a | 630 | funname = DEPRECATED_SYMBOL_NAME (func); |
c906108c SS |
631 | } |
632 | else | |
633 | { | |
634 | register struct minimal_symbol *msymbol = | |
bdd78e62 | 635 | lookup_minimal_symbol_by_pc (get_frame_pc (fi)); |
c5aa993b | 636 | |
c906108c | 637 | if (msymbol != NULL) |
22abf04a | 638 | funname = DEPRECATED_SYMBOL_NAME (msymbol); |
c906108c | 639 | } |
c5aa993b | 640 | |
c906108c | 641 | /* If comname is NULL, we assume the user wishes to see the |
c5aa993b JM |
642 | which COMMON blocks are visible here and then return */ |
643 | ||
c906108c SS |
644 | if (comname == 0) |
645 | { | |
646 | list_all_visible_commons (funname); | |
c5aa993b | 647 | return; |
c906108c | 648 | } |
c5aa993b JM |
649 | |
650 | the_common = find_common_for_function (comname, funname); | |
651 | ||
c906108c SS |
652 | if (the_common) |
653 | { | |
762f08a3 | 654 | if (strcmp (comname, BLANK_COMMON_NAME_LOCAL) == 0) |
c906108c | 655 | printf_filtered ("Contents of blank COMMON block:\n"); |
c5aa993b JM |
656 | else |
657 | printf_filtered ("Contents of F77 COMMON block '%s':\n", comname); | |
658 | ||
659 | printf_filtered ("\n"); | |
660 | entry = the_common->entries; | |
661 | ||
c906108c SS |
662 | while (entry != NULL) |
663 | { | |
22abf04a | 664 | printf_filtered ("%s = ", DEPRECATED_SYMBOL_NAME (entry->symbol)); |
c5aa993b JM |
665 | print_variable_value (entry->symbol, fi, gdb_stdout); |
666 | printf_filtered ("\n"); | |
667 | entry = entry->next; | |
c906108c SS |
668 | } |
669 | } | |
c5aa993b | 670 | else |
c906108c | 671 | printf_filtered ("Cannot locate the common block %s in function '%s'\n", |
c5aa993b | 672 | comname, funname); |
c906108c SS |
673 | } |
674 | ||
675 | /* This function is used to determine whether there is a | |
c5aa993b | 676 | F77 common block visible at the current scope called 'comname'. */ |
c906108c SS |
677 | |
678 | #if 0 | |
679 | static int | |
fba45db2 | 680 | there_is_a_visible_common_named (char *comname) |
c906108c | 681 | { |
c5aa993b | 682 | SAVED_F77_COMMON_PTR the_common; |
c906108c SS |
683 | struct frame_info *fi; |
684 | register char *funname = 0; | |
685 | struct symbol *func; | |
c5aa993b | 686 | |
c906108c | 687 | if (comname == NULL) |
c5aa993b JM |
688 | error ("Cannot deal with NULL common name!"); |
689 | ||
6e7f8b9c | 690 | fi = deprecated_selected_frame; |
c5aa993b | 691 | |
c906108c | 692 | if (fi == NULL) |
c5aa993b JM |
693 | error ("No frame selected"); |
694 | ||
c906108c | 695 | /* The following is generally ripped off from stack.c's routine |
c5aa993b JM |
696 | print_frame_info() */ |
697 | ||
c906108c SS |
698 | func = find_pc_function (fi->pc); |
699 | if (func) | |
700 | { | |
701 | /* In certain pathological cases, the symtabs give the wrong | |
c5aa993b JM |
702 | function (when we are in the first function in a file which |
703 | is compiled without debugging symbols, the previous function | |
704 | is compiled with debugging symbols, and the "foo.o" symbol | |
705 | that is supposed to tell us where the file with debugging symbols | |
706 | ends has been truncated by ar because it is longer than 15 | |
707 | characters). | |
708 | ||
709 | So look in the minimal symbol tables as well, and if it comes | |
710 | up with a larger address for the function use that instead. | |
711 | I don't think this can ever cause any problems; there shouldn't | |
712 | be any minimal symbols in the middle of a function. | |
713 | FIXME: (Not necessarily true. What about text labels) */ | |
714 | ||
c906108c | 715 | struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (fi->pc); |
c5aa993b | 716 | |
c906108c | 717 | if (msymbol != NULL |
c5aa993b | 718 | && (SYMBOL_VALUE_ADDRESS (msymbol) |
c906108c | 719 | > BLOCK_START (SYMBOL_BLOCK_VALUE (func)))) |
22abf04a | 720 | funname = DEPRECATED_SYMBOL_NAME (msymbol); |
c906108c | 721 | else |
22abf04a | 722 | funname = DEPRECATED_SYMBOL_NAME (func); |
c906108c SS |
723 | } |
724 | else | |
725 | { | |
c5aa993b JM |
726 | register struct minimal_symbol *msymbol = |
727 | lookup_minimal_symbol_by_pc (fi->pc); | |
728 | ||
c906108c | 729 | if (msymbol != NULL) |
22abf04a | 730 | funname = DEPRECATED_SYMBOL_NAME (msymbol); |
c906108c | 731 | } |
c5aa993b JM |
732 | |
733 | the_common = find_common_for_function (comname, funname); | |
734 | ||
c906108c SS |
735 | return (the_common ? 1 : 0); |
736 | } | |
737 | #endif | |
738 | ||
739 | void | |
fba45db2 | 740 | _initialize_f_valprint (void) |
c906108c SS |
741 | { |
742 | add_info ("common", info_common_command, | |
743 | "Print out the values contained in a Fortran COMMON block."); | |
744 | if (xdb_commands) | |
c5aa993b JM |
745 | add_com ("lc", class_info, info_common_command, |
746 | "Print out the values contained in a Fortran COMMON block."); | |
c906108c | 747 | } |