ACM Home Page
Please provide us with feedback. Feedback
A fully-non-transparent approach to the code location problem
Full text PdfPdf (187 KB)
Source ACM International Conference Proceeding Series; Vol. 296 archive
Proceedings of the 11th international workshop on Software & compilers for embedded systems table of contents
Munich, Germany
SESSION: Validation and simulation table of contents
Pages 61-68  
Year of Publication: 2008
Authors
Hugo Venturini  Verimag -- Grenoble, France and STMicroelectronics -- Crolles, France
Frédéric Riss  STMicroelectronics -- Crolles, France
Jean-Claude Fernandez  Verimag -- Grenoble, France
Miguel Santana  STMicroelectronics -- Crolles, France
Sponsors
: Artist2 European NoE
EDAA : European Design and Automation Association
SIGBED: ACM Special Interest Group on Embedded Systems
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In the context of embedded systems such as cell-phones, PDA or cars and planes software, optimizations of code are required because of timing and memory constraints imposed. Many problems arise when trying to debug optimized code. One of them is the irrelevance of the mapping between the source code and the optimized target program: the Code Location Problem. This paper proposes a solution to this problem in the case of highly optimized code in the context of embedded systems.

Two approaches exist: non-transparent and transparent debugging. Our approach is non-transparent. The idea is to reveal the execution of the optimized program to the user so the latter understands the mapping to the source code in spite of transformations applied to the program. We do not emulate the execution of the unoptimized program. We make good use of the programmer's knowledge of its development platform. Standard debuggers do not provide the required mechanisms while compilers do not provide the relevant debug information. We propose a novel method to maintain accurate debug information when optimizing at compilation and we experiment this method on the MMDSP+ C compiler and the IDBug debugger.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ACE Associated Compiler Experts bv. CoSy Compilers, Overview of Construction and Operation. White paper, 24 Apr. 2003.
 
2
A.-R. Adl-Tabatabai. Source Level Debugging of Globally Optimized Code. PhD thesis, Carnegie Mellon University, Pittsburgh PA 15213-3891, June 1996.
3
4
 
5
6
7
8
 
9
DWARF Debugging Information Format Workgroup, A Workgroup of the Free Standards Group, http://dwarf.freestandards.org/. The DWARF Debugging Standard.
 
10
L. Gerard, D. Pilat, F. Riss, S. Laheurte, M. Santana, and H. Venturini. IDBug Technology, Benefits and Added-value. White Paper, STMicroelectronics, F-38921 Crolles France, jul 2005.
11
 
12
 
13
 
14
R. M. Stallman, R. Pesch, S. Shebs, et al. Debugging with GDB: The GNU Source-Level Debugger. Free Software Foundation, 2002.
 
15
L. V. J. Streepy, G. Brooks, T. Buyse, M. Chiarelli, M. Garzione, G. Hansen, D. Lingle, S. Simmons, and J. Woods. Cxdb a new view on optimization. In Proceedings of Supercomputer Debugging Workshop, pages 1--22, November 1991.
 
16
17
 
18
C. M. Tice and S. L. Graham. Key instructions: Solving the code location problem for optimized code. 2000.
19
 
20
 
21
P. T. Zellweger. Interactions between high-level debugging and optimised code. PhD thesis, Computer Science Division, University of California, Berkeley, 1984.
 
22
P. T. Zellweger. Interactive source-level debugging of optimized programs. Research Report CSL-84-5, Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California 94304, May 1984.

Collaborative Colleagues:
Hugo Venturini: colleagues
Frédéric Riss: colleagues
Jean-Claude Fernandez: colleagues
Miguel Santana: colleagues