1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
|
/*
Copyright (C) 2000-2006 Silicon Graphics, Inc. All Rights Reserved.
Portions Copyright (C) 2007-2010 David Anderson. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it
under the terms of version 2.1 of the GNU Lesser General Public License
as published by the Free Software Foundation.
This program is distributed in the hope that it would be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
Further, this software is distributed without any warranty that it is
free of the rightful claim of any third person regarding infringement
or the like. Any license provided herein, whether implied or
otherwise, applies only to this software file. Patent licenses, if
any, provided herein do not apply to combinations of this program with
other software, or any other product whatsoever.
You should have received a copy of the GNU Lesser General Public
License along with this program; if not, write the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston MA 02110-1301,
USA.
Contact information: Silicon Graphics, Inc., 1500 Crittenden Lane,
Mountain View, CA 94043, or:
http://www.sgi.com
For further information regarding this notice, see:
http://oss.sgi.com/projects/GenInfo/NoticeExplan
*/
/* The address of the Free Software Foundation is
Free Software Foundation, Inc., 51 Franklin St, Fifth Floor,
Boston, MA 02110-1301, USA.
SGI has moved from the Crittenden Lane address.
*/
#include "config.h"
#include "dwarf_incl.h"
#ifdef HAVE_ELF_H
#include <elf.h>
#endif
#include <stdio.h>
#include "dwarf_die_deliv.h"
/*
For a given Dwarf_Debug dbg, this function checks
if a CU that includes the given offset has been read
or not. If yes, it returns the Dwarf_CU_Context
for the CU. Otherwise it returns NULL. Being an
internal routine, it is assumed that a valid dbg
is passed.
**This is a sequential search. May be too slow.
If debug_info and debug_abbrev not loaded, this will
wind up returning NULL. So no need to load before calling
this.
*/
static Dwarf_CU_Context
_dwarf_find_CU_Context(Dwarf_Debug dbg, Dwarf_Off offset)
{
Dwarf_CU_Context cu_context = 0;
if (offset >= dbg->de_info_last_offset)
return (NULL);
if (dbg->de_cu_context != NULL &&
dbg->de_cu_context->cc_next != NULL &&
dbg->de_cu_context->cc_next->cc_debug_info_offset == offset) {
return (dbg->de_cu_context->cc_next);
}
if (dbg->de_cu_context != NULL &&
dbg->de_cu_context->cc_debug_info_offset <= offset) {
for (cu_context = dbg->de_cu_context;
cu_context != NULL; cu_context = cu_context->cc_next) {
if (offset >= cu_context->cc_debug_info_offset &&
offset < cu_context->cc_debug_info_offset +
cu_context->cc_length + cu_context->cc_length_size
+ cu_context->cc_extension_size) {
return (cu_context);
}
}
}
for (cu_context = dbg->de_cu_context_list;
cu_context != NULL; cu_context = cu_context->cc_next) {
if (offset >= cu_context->cc_debug_info_offset &&
offset < cu_context->cc_debug_info_offset +
cu_context->cc_length + cu_context->cc_length_size
+ cu_context->cc_extension_size) {
return (cu_context);
}
}
return (NULL);
}
/*
This routine checks the dwarf_offdie() list of
CU contexts for the right CU context.
*/
static Dwarf_CU_Context
_dwarf_find_offdie_CU_Context(Dwarf_Debug dbg, Dwarf_Off offset)
{
Dwarf_CU_Context cu_context = 0;
for (cu_context = dbg->de_offdie_cu_context;
cu_context != NULL; cu_context = cu_context->cc_next)
if (offset >= cu_context->cc_debug_info_offset &&
offset < cu_context->cc_debug_info_offset +
cu_context->cc_length + cu_context->cc_length_size
+ cu_context->cc_extension_size)
return (cu_context);
return (NULL);
}
/*
This function is used to create a CU Context for
a compilation-unit that begins at offset in
.debug_info. The CU Context is attached to the
list of CU Contexts for this dbg. It is assumed
that the CU at offset has not been read before,
and so do not call this routine before making
sure of this with _dwarf_find_CU_Context().
Returns NULL on error. As always, being an
internal routine, assumes a good dbg.
This function must always set a dwarf error code
before returning NULL. Always.
*/
static Dwarf_CU_Context
_dwarf_make_CU_Context(Dwarf_Debug dbg,
Dwarf_Off offset, Dwarf_Error * error)
{
Dwarf_CU_Context cu_context = 0;
Dwarf_Unsigned length = 0;
Dwarf_Signed abbrev_offset = 0;
Dwarf_Byte_Ptr cu_ptr = 0;
int local_extension_size = 0;
int local_length_size = 0;
cu_context =
(Dwarf_CU_Context) _dwarf_get_alloc(dbg, DW_DLA_CU_CONTEXT, 1);
if (cu_context == NULL) {
_dwarf_error(dbg, error, DW_DLE_ALLOC_FAIL);
return (NULL);
}
cu_context->cc_dbg = dbg;
cu_ptr = (Dwarf_Byte_Ptr) (dbg->de_debug_info.dss_data + offset);
/* READ_AREA_LENGTH updates cu_ptr for consumed bytes */
READ_AREA_LENGTH(dbg, length, Dwarf_Unsigned,
cu_ptr, local_length_size, local_extension_size);
cu_context->cc_length_size = local_length_size;
cu_context->cc_extension_size = local_extension_size;
cu_context->cc_length = (Dwarf_Word) length;
READ_UNALIGNED(dbg, cu_context->cc_version_stamp, Dwarf_Half,
cu_ptr, sizeof(Dwarf_Half));
cu_ptr += sizeof(Dwarf_Half);
READ_UNALIGNED(dbg, abbrev_offset, Dwarf_Signed,
cu_ptr, local_length_size);
cu_ptr += local_length_size;
cu_context->cc_abbrev_offset = (Dwarf_Sword) abbrev_offset;
cu_context->cc_address_size = *(Dwarf_Small *) cu_ptr;
if ((length < CU_VERSION_STAMP_SIZE + local_length_size +
CU_ADDRESS_SIZE_SIZE) ||
(offset + length + local_length_size +
local_extension_size > dbg->de_debug_info.dss_size)) {
dwarf_dealloc(dbg, cu_context, DW_DLA_CU_CONTEXT);
_dwarf_error(dbg, error, DW_DLE_CU_LENGTH_ERROR);
return (NULL);
}
if (cu_context->cc_version_stamp != CURRENT_VERSION_STAMP
&& cu_context->cc_version_stamp != CURRENT_VERSION_STAMP3
&& cu_context->cc_version_stamp != CURRENT_VERSION_STAMP4) {
dwarf_dealloc(dbg, cu_context, DW_DLA_CU_CONTEXT);
_dwarf_error(dbg, error, DW_DLE_VERSION_STAMP_ERROR);
return (NULL);
}
if (abbrev_offset >= dbg->de_debug_abbrev.dss_size) {
dwarf_dealloc(dbg, cu_context, DW_DLA_CU_CONTEXT);
_dwarf_error(dbg, error, DW_DLE_ABBREV_OFFSET_ERROR);
return (NULL);
}
cu_context->cc_abbrev_hash_table =
(Dwarf_Hash_Table) _dwarf_get_alloc(dbg, DW_DLA_HASH_TABLE, 1);
if (cu_context->cc_abbrev_hash_table == NULL) {
_dwarf_error(dbg, error, DW_DLE_ALLOC_FAIL);
return (NULL);
}
cu_context->cc_debug_info_offset = (Dwarf_Word) offset;
dbg->de_info_last_offset =
(Dwarf_Word) (offset + length +
local_extension_size + local_length_size);
if (dbg->de_cu_context_list == NULL) {
dbg->de_cu_context_list = cu_context;
dbg->de_cu_context_list_end = cu_context;
} else {
dbg->de_cu_context_list_end->cc_next = cu_context;
dbg->de_cu_context_list_end = cu_context;
}
return (cu_context);
}
/*
Returns offset of next compilation-unit thru next_cu_offset
pointer.
It basically sequentially moves from one
cu to the next. The current cu is recorded
internally by libdwarf.
The _b form is new for DWARF4 adding new returned fields.
*/
int
dwarf_next_cu_header(Dwarf_Debug dbg,
Dwarf_Unsigned * cu_header_length,
Dwarf_Half * version_stamp,
Dwarf_Unsigned * abbrev_offset,
Dwarf_Half * address_size,
Dwarf_Unsigned * next_cu_offset,
Dwarf_Error * error)
{
return dwarf_next_cu_header_b(dbg,
cu_header_length,
version_stamp,
abbrev_offset,
address_size,
0,0,
next_cu_offset,
error);
}
int
dwarf_next_cu_header_b(Dwarf_Debug dbg,
Dwarf_Unsigned * cu_header_length,
Dwarf_Half * version_stamp,
Dwarf_Unsigned * abbrev_offset,
Dwarf_Half * address_size,
Dwarf_Half * offset_size,
Dwarf_Half * extension_size,
Dwarf_Unsigned * next_cu_offset,
Dwarf_Error * error)
{
/* Offset for current and new CU. */
Dwarf_Unsigned new_offset = 0;
/* CU Context for current CU. */
Dwarf_CU_Context cu_context = 0;
/* ***** BEGIN CODE ***** */
if (dbg == NULL) {
_dwarf_error(NULL, error, DW_DLE_DBG_NULL);
return (DW_DLV_ERROR);
}
/*
Get offset into .debug_info of next CU. If dbg has no context,
this has to be the first one. */
if (dbg->de_cu_context == NULL) {
new_offset = 0;
if (!dbg->de_debug_info.dss_data) {
int res = _dwarf_load_debug_info(dbg, error);
if (res != DW_DLV_OK) {
return res;
}
}
} else {
new_offset = dbg->de_cu_context->cc_debug_info_offset +
dbg->de_cu_context->cc_length +
dbg->de_cu_context->cc_length_size +
dbg->de_cu_context->cc_extension_size;
}
/*
Check that there is room in .debug_info beyond the new offset
for at least a new cu header. If not, return 0 to indicate end
of debug_info section, and reset de_cu_debug_info_offset to
enable looping back through the cu's. */
if ((new_offset + _dwarf_length_of_cu_header_simple(dbg)) >=
dbg->de_debug_info.dss_size) {
dbg->de_cu_context = NULL;
return (DW_DLV_NO_ENTRY);
}
/* Check if this CU has been read before. */
cu_context = _dwarf_find_CU_Context(dbg, new_offset);
/* If not, make CU Context for it. */
if (cu_context == NULL) {
cu_context = _dwarf_make_CU_Context(dbg, new_offset, error);
if (cu_context == NULL) {
/* Error if CU Context could not be made. Since
_dwarf_make_CU_Context has already registered an error
we do not do that here: we let the lower error pass
thru. */
return (DW_DLV_ERROR);
}
}
dbg->de_cu_context = cu_context;
if (cu_header_length != NULL)
*cu_header_length = cu_context->cc_length;
if (version_stamp != NULL)
*version_stamp = cu_context->cc_version_stamp;
if (abbrev_offset != NULL)
*abbrev_offset = cu_context->cc_abbrev_offset;
if (address_size != NULL)
*address_size = cu_context->cc_address_size;
if (offset_size != NULL)
*offset_size = cu_context->cc_length_size;
if (extension_size != NULL)
*extension_size = cu_context->cc_extension_size;
new_offset = new_offset + cu_context->cc_length +
cu_context->cc_length_size + cu_context->cc_extension_size;
*next_cu_offset = new_offset;
return (DW_DLV_OK);
}
/*
This function does two slightly different things
depending on the input flag want_AT_sibling. If
this flag is true, it checks if the input die has
a DW_AT_sibling attribute. If it does it returns
a pointer to the start of the sibling die in the
.debug_info section. Otherwise it behaves the
same as the want_AT_sibling false case.
If the want_AT_sibling flag is false, it returns
a pointer to the immediately adjacent die in the
.debug_info section.
Die_info_end points to the end of the .debug_info
portion for the cu the die belongs to. It is used
to check that the search for the next die does not
cross the end of the current cu. Cu_info_start points
to the start of the .debug_info portion for the
current cu, and is used to add to the offset for
DW_AT_sibling attributes. Finally, has_die_child
is a pointer to a Dwarf_Bool that is set true if
the present die has children, false otherwise.
However, in case want_AT_child is true and the die
has a DW_AT_sibling attribute *has_die_child is set
false to indicate that the children are being skipped.
die_info_end points to the last byte+1 of the cu.
*/
static Dwarf_Byte_Ptr
_dwarf_next_die_info_ptr(Dwarf_Byte_Ptr die_info_ptr,
Dwarf_CU_Context cu_context,
Dwarf_Byte_Ptr die_info_end,
Dwarf_Byte_Ptr cu_info_start,
Dwarf_Bool want_AT_sibling,
Dwarf_Bool * has_die_child)
{
Dwarf_Byte_Ptr info_ptr = 0;
Dwarf_Byte_Ptr abbrev_ptr = 0;
Dwarf_Word abbrev_code = 0;
Dwarf_Abbrev_List abbrev_list;
Dwarf_Half attr = 0;
Dwarf_Half attr_form = 0;
Dwarf_Unsigned offset = 0;
Dwarf_Word leb128_length = 0;
Dwarf_Unsigned utmp = 0;
Dwarf_Debug dbg = 0;
info_ptr = die_info_ptr;
DECODE_LEB128_UWORD(info_ptr, utmp);
abbrev_code = (Dwarf_Word) utmp;
if (abbrev_code == 0) {
return NULL;
}
abbrev_list = _dwarf_get_abbrev_for_code(cu_context, abbrev_code);
if (abbrev_list == NULL) {
return (NULL);
}
dbg = cu_context->cc_dbg;
*has_die_child = abbrev_list->ab_has_child;
abbrev_ptr = abbrev_list->ab_abbrev_ptr;
do {
Dwarf_Unsigned utmp2;
DECODE_LEB128_UWORD(abbrev_ptr, utmp2);
attr = (Dwarf_Half) utmp2;
DECODE_LEB128_UWORD(abbrev_ptr, utmp2);
attr_form = (Dwarf_Half) utmp2;
if (attr_form == DW_FORM_indirect) {
Dwarf_Unsigned utmp6;
/* DECODE_LEB128_UWORD updates info_ptr */
DECODE_LEB128_UWORD(info_ptr, utmp6);
attr_form = (Dwarf_Half) utmp6;
}
if (want_AT_sibling && attr == DW_AT_sibling) {
switch (attr_form) {
case DW_FORM_ref1:
offset = *(Dwarf_Small *) info_ptr;
break;
case DW_FORM_ref2:
/* READ_UNALIGNED does not update info_ptr */
READ_UNALIGNED(dbg, offset, Dwarf_Unsigned,
info_ptr, sizeof(Dwarf_Half));
break;
case DW_FORM_ref4:
READ_UNALIGNED(dbg, offset, Dwarf_Unsigned,
info_ptr, sizeof(Dwarf_ufixed));
break;
case DW_FORM_ref8:
READ_UNALIGNED(dbg, offset, Dwarf_Unsigned,
info_ptr, sizeof(Dwarf_Unsigned));
break;
case DW_FORM_ref_udata:
offset =
_dwarf_decode_u_leb128(info_ptr, &leb128_length);
break;
case DW_FORM_ref_addr:
/* Very unusual. The FORM is intended to refer to
a different CU, but a different CU cannot
be a sibling, can it?
We could ignore this and treat as if no DW_AT_sibling
present. Or derive the offset from it and if
it is in the same CU use it directly.
The offset here is *supposed* to be a global offset,
so adding cu_info_start is wrong to any offset
we find here unless cu_info_start
is zero! Lets pretend there is no DW_AT_sibling
attribute. */
goto no_sibling_attr;
default:
return (NULL);
}
/* Reset *has_die_child to indicate children skipped. */
*has_die_child = false;
/* A value beyond die_info_end indicates an error. Exactly
at die_info_end means 1-past-cu-end and simply means we
are at the end, do not return NULL. Higher level code
will detect that we are at the end. */
if (cu_info_start + offset > die_info_end) {
/* Error case, bad DWARF. */
return (NULL);
}
/* At or before end-of-cu */
return (cu_info_start + offset);
}
no_sibling_attr:
if (attr_form != 0) {
info_ptr += _dwarf_get_size_of_val(cu_context->cc_dbg,
attr_form,
cu_context->cc_address_size,
info_ptr,
cu_context->cc_length_size);
/* It is ok for info_ptr == die_info_end, as we will test
later before using a too-large info_ptr */
if (info_ptr > die_info_end) {
/* More than one-past-end indicates a bug somewhere,
likely bad dwarf generation. */
return (NULL);
}
}
} while (attr != 0 || attr_form != 0);
return (info_ptr);
}
/*
Given a Dwarf_Debug dbg, and a Dwarf_Die die, it returns
a Dwarf_Die for the sibling of die. In case die is NULL,
it returns (thru ptr) a Dwarf_Die for the first die in the current
cu in dbg. Returns DW_DLV_ERROR on error.
It is assumed that every sibling chain including those with
only one element is terminated with a NULL die, except a
chain with only a NULL die.
The algorithm moves from one die to the adjacent one. It
returns when the depth of children it sees equals the number
of sibling chain terminations. A single count, child_depth
is used to track the depth of children and sibling terminations
encountered. Child_depth is incremented when a die has the
Has-Child flag set unless the child happens to be a NULL die.
Child_depth is decremented when a die has Has-Child false,
and the adjacent die is NULL. Algorithm returns when
child_depth is 0.
**NOTE: Do not modify input die, since it is used at the end.
*/
int
dwarf_siblingof(Dwarf_Debug dbg,
Dwarf_Die die,
Dwarf_Die * caller_ret_die, Dwarf_Error * error)
{
Dwarf_Die ret_die = 0;
Dwarf_Byte_Ptr die_info_ptr = 0;
Dwarf_Byte_Ptr cu_info_start = 0;
/* die_info_end points 1-past end of die (once set) */
Dwarf_Byte_Ptr die_info_end = 0;
Dwarf_Word abbrev_code = 0;
Dwarf_Unsigned utmp = 0;
if (dbg == NULL) {
_dwarf_error(NULL, error, DW_DLE_DBG_NULL);
return (DW_DLV_ERROR);
}
if (die == NULL) {
/* Find root die of cu */
/* die_info_end is untouched here, need not be set in this
branch. */
Dwarf_Off off2;
/* If we've not loaded debug_info, de_cu_context will be NULL,
so no need to laod */
if (dbg->de_cu_context == NULL) {
_dwarf_error(dbg, error, DW_DLE_DBG_NO_CU_CONTEXT);
return (DW_DLV_ERROR);
}
off2 = dbg->de_cu_context->cc_debug_info_offset;
die_info_ptr = dbg->de_debug_info.dss_data +
off2 + _dwarf_length_of_cu_header(dbg, off2);
} else {
/* Find sibling die. */
Dwarf_Bool has_child = false;
Dwarf_Sword child_depth = 0;
/* We cannot have a legal die unless debug_info was loaded, so
no need to load debug_info here. */
CHECK_DIE(die, DW_DLV_ERROR);
die_info_ptr = die->di_debug_info_ptr;
if (*die_info_ptr == 0) {
return (DW_DLV_NO_ENTRY);
}
cu_info_start = dbg->de_debug_info.dss_data +
die->di_cu_context->cc_debug_info_offset;
die_info_end = cu_info_start + die->di_cu_context->cc_length +
die->di_cu_context->cc_length_size +
die->di_cu_context->cc_extension_size;
if ((*die_info_ptr) == 0) {
return (DW_DLV_NO_ENTRY);
}
child_depth = 0;
do {
die_info_ptr = _dwarf_next_die_info_ptr(die_info_ptr,
die->di_cu_context,
die_info_end,
cu_info_start, true,
&has_child);
if (die_info_ptr == NULL) {
_dwarf_error(dbg, error, DW_DLE_NEXT_DIE_PTR_NULL);
return (DW_DLV_ERROR);
}
/* die_info_end is one past end. Do not read it!
A test for ``!= die_info_end'' would work as well,
but perhaps < reads more like the meaning. */
if(die_info_ptr < die_info_end) {
if ((*die_info_ptr) == 0 && has_child) {
die_info_ptr++;
has_child = false;
}
}
/* die_info_ptr can be one-past-end. */
if ((die_info_ptr == die_info_end) ||
((*die_info_ptr) == 0)) {
for (; child_depth > 0 && *die_info_ptr == 0;
child_depth--, die_info_ptr++);
} else {
child_depth = has_child ? child_depth + 1 : child_depth;
}
} while (child_depth != 0);
}
/* die_info_ptr > die_info_end is really a bug (possibly in dwarf
generation)(but we are past end, no more DIEs here), whereas
die_info_ptr == die_info_end means 'one past end, no more DIEs
here'. */
if (die != NULL && die_info_ptr >= die_info_end) {
return (DW_DLV_NO_ENTRY);
}
if ((*die_info_ptr) == 0) {
return (DW_DLV_NO_ENTRY);
}
ret_die = (Dwarf_Die) _dwarf_get_alloc(dbg, DW_DLA_DIE, 1);
if (ret_die == NULL) {
_dwarf_error(dbg, error, DW_DLE_ALLOC_FAIL);
return (DW_DLV_ERROR);
}
ret_die->di_debug_info_ptr = die_info_ptr;
ret_die->di_cu_context =
die == NULL ? dbg->de_cu_context : die->di_cu_context;
DECODE_LEB128_UWORD(die_info_ptr, utmp);
abbrev_code = (Dwarf_Word) utmp;
if (abbrev_code == 0) {
/* Zero means a null DIE */
dwarf_dealloc(dbg, ret_die, DW_DLA_DIE);
return (DW_DLV_NO_ENTRY);
}
ret_die->di_abbrev_code = abbrev_code;
ret_die->di_abbrev_list =
_dwarf_get_abbrev_for_code(ret_die->di_cu_context, abbrev_code);
if (ret_die->di_abbrev_list == NULL || (die == NULL &&
ret_die->di_abbrev_list->
ab_tag !=
DW_TAG_compile_unit)) {
dwarf_dealloc(dbg, ret_die, DW_DLA_DIE);
_dwarf_error(dbg, error, DW_DLE_FIRST_DIE_NOT_CU);
return (DW_DLV_ERROR);
}
*caller_ret_die = ret_die;
return (DW_DLV_OK);
}
int
dwarf_child(Dwarf_Die die,
Dwarf_Die * caller_ret_die, Dwarf_Error * error)
{
Dwarf_Byte_Ptr die_info_ptr = 0;
/* die_info_end points one-past-end of die area. */
Dwarf_Byte_Ptr die_info_end = 0;
Dwarf_Die ret_die = 0;
Dwarf_Bool has_die_child = 0;
Dwarf_Debug dbg;
Dwarf_Word abbrev_code = 0;
Dwarf_Unsigned utmp = 0;
CHECK_DIE(die, DW_DLV_ERROR);
dbg = die->di_cu_context->cc_dbg;
die_info_ptr = die->di_debug_info_ptr;
/* NULL die has no child. */
if ((*die_info_ptr) == 0)
return (DW_DLV_NO_ENTRY);
die_info_end = dbg->de_debug_info.dss_data +
die->di_cu_context->cc_debug_info_offset +
die->di_cu_context->cc_length +
die->di_cu_context->cc_length_size +
die->di_cu_context->cc_extension_size;
die_info_ptr =
_dwarf_next_die_info_ptr(die_info_ptr, die->di_cu_context,
die_info_end, NULL, false,
&has_die_child);
if (die_info_ptr == NULL) {
_dwarf_error(dbg, error, DW_DLE_NEXT_DIE_PTR_NULL);
return (DW_DLV_ERROR);
}
if (!has_die_child)
return (DW_DLV_NO_ENTRY);
ret_die = (Dwarf_Die) _dwarf_get_alloc(dbg, DW_DLA_DIE, 1);
if (ret_die == NULL) {
_dwarf_error(dbg, error, DW_DLE_ALLOC_FAIL);
return (DW_DLV_ERROR);
}
ret_die->di_debug_info_ptr = die_info_ptr;
ret_die->di_cu_context = die->di_cu_context;
DECODE_LEB128_UWORD(die_info_ptr, utmp);
abbrev_code = (Dwarf_Word) utmp;
if (abbrev_code == 0) {
/* We have arrived at a null DIE, at the end of a CU or the end
of a list of siblings. */
*caller_ret_die = 0;
dwarf_dealloc(dbg, ret_die, DW_DLA_DIE);
return DW_DLV_NO_ENTRY;
}
ret_die->di_abbrev_code = abbrev_code;
ret_die->di_abbrev_list =
_dwarf_get_abbrev_for_code(die->di_cu_context, abbrev_code);
if (ret_die->di_abbrev_list == NULL) {
dwarf_dealloc(dbg, ret_die, DW_DLA_DIE);
_dwarf_error(dbg, error, DW_DLE_DIE_BAD);
return (DW_DLV_ERROR);
}
*caller_ret_die = ret_die;
return (DW_DLV_OK);
}
/*
Given a (global, not cu_relative) die offset, this returns
a pointer to a DIE thru *new_die.
It is up to the caller to do a
dwarf_dealloc(dbg,*new_die,DW_DLE_DIE);
*/
int
dwarf_offdie(Dwarf_Debug dbg,
Dwarf_Off offset, Dwarf_Die * new_die, Dwarf_Error * error)
{
Dwarf_CU_Context cu_context = 0;
Dwarf_Off new_cu_offset = 0;
Dwarf_Die die = 0;
Dwarf_Byte_Ptr info_ptr = 0;
Dwarf_Unsigned abbrev_code = 0;
Dwarf_Unsigned utmp = 0;
if (dbg == NULL) {
_dwarf_error(NULL, error, DW_DLE_DBG_NULL);
return (DW_DLV_ERROR);
}
cu_context = _dwarf_find_CU_Context(dbg, offset);
if (cu_context == NULL)
cu_context = _dwarf_find_offdie_CU_Context(dbg, offset);
if (cu_context == NULL) {
int res = _dwarf_load_debug_info(dbg, error);
if (res != DW_DLV_OK) {
return res;
}
if (dbg->de_offdie_cu_context_end != NULL) {
Dwarf_CU_Context lcu_context =
dbg->de_offdie_cu_context_end;
new_cu_offset =
lcu_context->cc_debug_info_offset +
lcu_context->cc_length +
lcu_context->cc_length_size +
lcu_context->cc_extension_size;
}
do {
if ((new_cu_offset +
_dwarf_length_of_cu_header_simple(dbg)) >=
dbg->de_debug_info.dss_size) {
_dwarf_error(dbg, error, DW_DLE_OFFSET_BAD);
return (DW_DLV_ERROR);
}
cu_context =
_dwarf_make_CU_Context(dbg, new_cu_offset, error);
if (cu_context == NULL) {
/* Error if CU Context could not be made. Since
_dwarf_make_CU_Context has already registered an
error we do not do that here: we let the lower error
pass thru. */
return (DW_DLV_ERROR);
}
if (dbg->de_offdie_cu_context == NULL) {
dbg->de_offdie_cu_context = cu_context;
dbg->de_offdie_cu_context_end = cu_context;
} else {
dbg->de_offdie_cu_context_end->cc_next = cu_context;
dbg->de_offdie_cu_context_end = cu_context;
}
new_cu_offset = new_cu_offset + cu_context->cc_length +
cu_context->cc_length_size;
} while (offset >= new_cu_offset);
}
die = (Dwarf_Die) _dwarf_get_alloc(dbg, DW_DLA_DIE, 1);
if (die == NULL) {
_dwarf_error(dbg, error, DW_DLE_ALLOC_FAIL);
return (DW_DLV_ERROR);
}
die->di_cu_context = cu_context;
info_ptr = dbg->de_debug_info.dss_data + offset;
die->di_debug_info_ptr = info_ptr;
DECODE_LEB128_UWORD(info_ptr, utmp);
abbrev_code = utmp;
if (abbrev_code == 0) {
/* we are at a null DIE (or there is a bug). */
*new_die = 0;
dwarf_dealloc(dbg, die, DW_DLA_DIE);
return DW_DLV_NO_ENTRY;
}
die->di_abbrev_code = abbrev_code;
die->di_abbrev_list =
_dwarf_get_abbrev_for_code(cu_context, abbrev_code);
if (die->di_abbrev_list == NULL) {
dwarf_dealloc(dbg, die, DW_DLA_DIE);
_dwarf_error(dbg, error, DW_DLE_DIE_ABBREV_LIST_NULL);
return (DW_DLV_ERROR);
}
*new_die = die;
return (DW_DLV_OK);
}
|