1*9712c20fSFrederick Mayle // Copyright 2010 Google LLC
2*9712c20fSFrederick Mayle //
3*9712c20fSFrederick Mayle // Redistribution and use in source and binary forms, with or without
4*9712c20fSFrederick Mayle // modification, are permitted provided that the following conditions are
5*9712c20fSFrederick Mayle // met:
6*9712c20fSFrederick Mayle //
7*9712c20fSFrederick Mayle // * Redistributions of source code must retain the above copyright
8*9712c20fSFrederick Mayle // notice, this list of conditions and the following disclaimer.
9*9712c20fSFrederick Mayle // * Redistributions in binary form must reproduce the above
10*9712c20fSFrederick Mayle // copyright notice, this list of conditions and the following disclaimer
11*9712c20fSFrederick Mayle // in the documentation and/or other materials provided with the
12*9712c20fSFrederick Mayle // distribution.
13*9712c20fSFrederick Mayle // * Neither the name of Google LLC nor the names of its
14*9712c20fSFrederick Mayle // contributors may be used to endorse or promote products derived from
15*9712c20fSFrederick Mayle // this software without specific prior written permission.
16*9712c20fSFrederick Mayle //
17*9712c20fSFrederick Mayle // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*9712c20fSFrederick Mayle // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*9712c20fSFrederick Mayle // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*9712c20fSFrederick Mayle // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*9712c20fSFrederick Mayle // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*9712c20fSFrederick Mayle // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*9712c20fSFrederick Mayle // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*9712c20fSFrederick Mayle // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*9712c20fSFrederick Mayle // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*9712c20fSFrederick Mayle // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*9712c20fSFrederick Mayle // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*9712c20fSFrederick Mayle
29*9712c20fSFrederick Mayle // Original author: Jim Blandy <[email protected]> <[email protected]>
30*9712c20fSFrederick Mayle
31*9712c20fSFrederick Mayle // dwarf2diehandler.cc: Implement the dwarf2reader::DieDispatcher class.
32*9712c20fSFrederick Mayle // See dwarf2diehandler.h for details.
33*9712c20fSFrederick Mayle
34*9712c20fSFrederick Mayle #ifdef HAVE_CONFIG_H
35*9712c20fSFrederick Mayle #include <config.h> // Must come first
36*9712c20fSFrederick Mayle #endif
37*9712c20fSFrederick Mayle
38*9712c20fSFrederick Mayle #include <assert.h>
39*9712c20fSFrederick Mayle #include <stdint.h>
40*9712c20fSFrederick Mayle
41*9712c20fSFrederick Mayle #include <string>
42*9712c20fSFrederick Mayle
43*9712c20fSFrederick Mayle #include "common/dwarf/dwarf2diehandler.h"
44*9712c20fSFrederick Mayle #include "common/using_std_string.h"
45*9712c20fSFrederick Mayle
46*9712c20fSFrederick Mayle namespace google_breakpad {
47*9712c20fSFrederick Mayle
~DIEDispatcher()48*9712c20fSFrederick Mayle DIEDispatcher::~DIEDispatcher() {
49*9712c20fSFrederick Mayle while (!die_handlers_.empty()) {
50*9712c20fSFrederick Mayle HandlerStack& entry = die_handlers_.top();
51*9712c20fSFrederick Mayle if (entry.handler_ != root_handler_)
52*9712c20fSFrederick Mayle delete entry.handler_;
53*9712c20fSFrederick Mayle die_handlers_.pop();
54*9712c20fSFrederick Mayle }
55*9712c20fSFrederick Mayle }
56*9712c20fSFrederick Mayle
StartCompilationUnit(uint64_t offset,uint8_t address_size,uint8_t offset_size,uint64_t cu_length,uint8_t dwarf_version)57*9712c20fSFrederick Mayle bool DIEDispatcher::StartCompilationUnit(uint64_t offset, uint8_t address_size,
58*9712c20fSFrederick Mayle uint8_t offset_size, uint64_t cu_length,
59*9712c20fSFrederick Mayle uint8_t dwarf_version) {
60*9712c20fSFrederick Mayle return root_handler_->StartCompilationUnit(offset, address_size,
61*9712c20fSFrederick Mayle offset_size, cu_length,
62*9712c20fSFrederick Mayle dwarf_version);
63*9712c20fSFrederick Mayle }
64*9712c20fSFrederick Mayle
StartDIE(uint64_t offset,enum DwarfTag tag)65*9712c20fSFrederick Mayle bool DIEDispatcher::StartDIE(uint64_t offset, enum DwarfTag tag) {
66*9712c20fSFrederick Mayle // The stack entry for the parent of this DIE, if there is one.
67*9712c20fSFrederick Mayle HandlerStack* parent = die_handlers_.empty() ? NULL : &die_handlers_.top();
68*9712c20fSFrederick Mayle
69*9712c20fSFrederick Mayle // Does this call indicate that we're done receiving the parent's
70*9712c20fSFrederick Mayle // attributes' values? If so, call its EndAttributes member function.
71*9712c20fSFrederick Mayle if (parent && parent->handler_ && !parent->reported_attributes_end_) {
72*9712c20fSFrederick Mayle parent->reported_attributes_end_ = true;
73*9712c20fSFrederick Mayle if (!parent->handler_->EndAttributes()) {
74*9712c20fSFrederick Mayle // Finish off this handler now. and edit *PARENT to indicate that
75*9712c20fSFrederick Mayle // we don't want to visit any of the children.
76*9712c20fSFrederick Mayle parent->handler_->Finish();
77*9712c20fSFrederick Mayle if (parent->handler_ != root_handler_)
78*9712c20fSFrederick Mayle delete parent->handler_;
79*9712c20fSFrederick Mayle parent->handler_ = NULL;
80*9712c20fSFrederick Mayle return false;
81*9712c20fSFrederick Mayle }
82*9712c20fSFrederick Mayle }
83*9712c20fSFrederick Mayle
84*9712c20fSFrederick Mayle // Find a handler for this DIE.
85*9712c20fSFrederick Mayle DIEHandler* handler;
86*9712c20fSFrederick Mayle if (parent) {
87*9712c20fSFrederick Mayle if (parent->handler_)
88*9712c20fSFrederick Mayle // Ask the parent to find a handler.
89*9712c20fSFrederick Mayle handler = parent->handler_->FindChildHandler(offset, tag);
90*9712c20fSFrederick Mayle else
91*9712c20fSFrederick Mayle // No parent handler means we're not interested in any of our
92*9712c20fSFrederick Mayle // children.
93*9712c20fSFrederick Mayle handler = NULL;
94*9712c20fSFrederick Mayle } else {
95*9712c20fSFrederick Mayle // This is the root DIE. For a non-root DIE, the parent's handler
96*9712c20fSFrederick Mayle // decides whether to visit it, but the root DIE has no parent
97*9712c20fSFrederick Mayle // handler, so we have a special method on the root DIE handler
98*9712c20fSFrederick Mayle // itself to decide.
99*9712c20fSFrederick Mayle if (root_handler_->StartRootDIE(offset, tag))
100*9712c20fSFrederick Mayle handler = root_handler_;
101*9712c20fSFrederick Mayle else
102*9712c20fSFrederick Mayle handler = NULL;
103*9712c20fSFrederick Mayle }
104*9712c20fSFrederick Mayle
105*9712c20fSFrederick Mayle // Push a handler stack entry for this new handler. As an
106*9712c20fSFrederick Mayle // optimization, we don't push NULL-handler entries on top of other
107*9712c20fSFrederick Mayle // NULL-handler entries; we just let the oldest such entry stand for
108*9712c20fSFrederick Mayle // the whole subtree.
109*9712c20fSFrederick Mayle if (handler || !parent || parent->handler_) {
110*9712c20fSFrederick Mayle HandlerStack entry;
111*9712c20fSFrederick Mayle entry.offset_ = offset;
112*9712c20fSFrederick Mayle entry.handler_ = handler;
113*9712c20fSFrederick Mayle entry.reported_attributes_end_ = false;
114*9712c20fSFrederick Mayle die_handlers_.push(entry);
115*9712c20fSFrederick Mayle }
116*9712c20fSFrederick Mayle
117*9712c20fSFrederick Mayle return handler != NULL;
118*9712c20fSFrederick Mayle }
119*9712c20fSFrederick Mayle
EndDIE(uint64_t offset)120*9712c20fSFrederick Mayle void DIEDispatcher::EndDIE(uint64_t offset) {
121*9712c20fSFrederick Mayle assert(!die_handlers_.empty());
122*9712c20fSFrederick Mayle HandlerStack* entry = &die_handlers_.top();
123*9712c20fSFrederick Mayle if (entry->handler_) {
124*9712c20fSFrederick Mayle // This entry had better be the handler for this DIE.
125*9712c20fSFrederick Mayle assert(entry->offset_ == offset);
126*9712c20fSFrederick Mayle // If a DIE has no children, this EndDIE call indicates that we're
127*9712c20fSFrederick Mayle // done receiving its attributes' values.
128*9712c20fSFrederick Mayle if (!entry->reported_attributes_end_)
129*9712c20fSFrederick Mayle entry->handler_->EndAttributes(); // Ignore return value: no children.
130*9712c20fSFrederick Mayle entry->handler_->Finish();
131*9712c20fSFrederick Mayle if (entry->handler_ != root_handler_)
132*9712c20fSFrederick Mayle delete entry->handler_;
133*9712c20fSFrederick Mayle } else {
134*9712c20fSFrederick Mayle // If this DIE is within a tree we're ignoring, then don't pop the
135*9712c20fSFrederick Mayle // handler stack: that entry stands for the whole tree.
136*9712c20fSFrederick Mayle if (entry->offset_ != offset)
137*9712c20fSFrederick Mayle return;
138*9712c20fSFrederick Mayle }
139*9712c20fSFrederick Mayle die_handlers_.pop();
140*9712c20fSFrederick Mayle }
141*9712c20fSFrederick Mayle
ProcessAttributeUnsigned(uint64_t offset,enum DwarfAttribute attr,enum DwarfForm form,uint64_t data)142*9712c20fSFrederick Mayle void DIEDispatcher::ProcessAttributeUnsigned(uint64_t offset,
143*9712c20fSFrederick Mayle enum DwarfAttribute attr,
144*9712c20fSFrederick Mayle enum DwarfForm form,
145*9712c20fSFrederick Mayle uint64_t data) {
146*9712c20fSFrederick Mayle HandlerStack& current = die_handlers_.top();
147*9712c20fSFrederick Mayle // This had better be an attribute of the DIE we were meant to handle.
148*9712c20fSFrederick Mayle assert(offset == current.offset_);
149*9712c20fSFrederick Mayle current.handler_->ProcessAttributeUnsigned(attr, form, data);
150*9712c20fSFrederick Mayle }
151*9712c20fSFrederick Mayle
ProcessAttributeSigned(uint64_t offset,enum DwarfAttribute attr,enum DwarfForm form,int64_t data)152*9712c20fSFrederick Mayle void DIEDispatcher::ProcessAttributeSigned(uint64_t offset,
153*9712c20fSFrederick Mayle enum DwarfAttribute attr,
154*9712c20fSFrederick Mayle enum DwarfForm form,
155*9712c20fSFrederick Mayle int64_t data) {
156*9712c20fSFrederick Mayle HandlerStack& current = die_handlers_.top();
157*9712c20fSFrederick Mayle // This had better be an attribute of the DIE we were meant to handle.
158*9712c20fSFrederick Mayle assert(offset == current.offset_);
159*9712c20fSFrederick Mayle current.handler_->ProcessAttributeSigned(attr, form, data);
160*9712c20fSFrederick Mayle }
161*9712c20fSFrederick Mayle
ProcessAttributeReference(uint64_t offset,enum DwarfAttribute attr,enum DwarfForm form,uint64_t data)162*9712c20fSFrederick Mayle void DIEDispatcher::ProcessAttributeReference(uint64_t offset,
163*9712c20fSFrederick Mayle enum DwarfAttribute attr,
164*9712c20fSFrederick Mayle enum DwarfForm form,
165*9712c20fSFrederick Mayle uint64_t data) {
166*9712c20fSFrederick Mayle HandlerStack& current = die_handlers_.top();
167*9712c20fSFrederick Mayle // This had better be an attribute of the DIE we were meant to handle.
168*9712c20fSFrederick Mayle assert(offset == current.offset_);
169*9712c20fSFrederick Mayle current.handler_->ProcessAttributeReference(attr, form, data);
170*9712c20fSFrederick Mayle }
171*9712c20fSFrederick Mayle
ProcessAttributeBuffer(uint64_t offset,enum DwarfAttribute attr,enum DwarfForm form,const uint8_t * data,uint64_t len)172*9712c20fSFrederick Mayle void DIEDispatcher::ProcessAttributeBuffer(uint64_t offset,
173*9712c20fSFrederick Mayle enum DwarfAttribute attr,
174*9712c20fSFrederick Mayle enum DwarfForm form,
175*9712c20fSFrederick Mayle const uint8_t* data,
176*9712c20fSFrederick Mayle uint64_t len) {
177*9712c20fSFrederick Mayle HandlerStack& current = die_handlers_.top();
178*9712c20fSFrederick Mayle // This had better be an attribute of the DIE we were meant to handle.
179*9712c20fSFrederick Mayle assert(offset == current.offset_);
180*9712c20fSFrederick Mayle current.handler_->ProcessAttributeBuffer(attr, form, data, len);
181*9712c20fSFrederick Mayle }
182*9712c20fSFrederick Mayle
ProcessAttributeString(uint64_t offset,enum DwarfAttribute attr,enum DwarfForm form,const string & data)183*9712c20fSFrederick Mayle void DIEDispatcher::ProcessAttributeString(uint64_t offset,
184*9712c20fSFrederick Mayle enum DwarfAttribute attr,
185*9712c20fSFrederick Mayle enum DwarfForm form,
186*9712c20fSFrederick Mayle const string& data) {
187*9712c20fSFrederick Mayle HandlerStack& current = die_handlers_.top();
188*9712c20fSFrederick Mayle // This had better be an attribute of the DIE we were meant to handle.
189*9712c20fSFrederick Mayle assert(offset == current.offset_);
190*9712c20fSFrederick Mayle current.handler_->ProcessAttributeString(attr, form, data);
191*9712c20fSFrederick Mayle }
192*9712c20fSFrederick Mayle
ProcessAttributeSignature(uint64_t offset,enum DwarfAttribute attr,enum DwarfForm form,uint64_t signature)193*9712c20fSFrederick Mayle void DIEDispatcher::ProcessAttributeSignature(uint64_t offset,
194*9712c20fSFrederick Mayle enum DwarfAttribute attr,
195*9712c20fSFrederick Mayle enum DwarfForm form,
196*9712c20fSFrederick Mayle uint64_t signature) {
197*9712c20fSFrederick Mayle HandlerStack& current = die_handlers_.top();
198*9712c20fSFrederick Mayle // This had better be an attribute of the DIE we were meant to handle.
199*9712c20fSFrederick Mayle assert(offset == current.offset_);
200*9712c20fSFrederick Mayle current.handler_->ProcessAttributeSignature(attr, form, signature);
201*9712c20fSFrederick Mayle }
202*9712c20fSFrederick Mayle
203*9712c20fSFrederick Mayle } // namespace google_breakpad
204