1================================ 2Source Level Debugging with LLVM 3================================ 4 5.. contents:: 6 :local: 7 8Introduction 9============ 10 11This document is the central repository for all information pertaining to debug 12information in LLVM. It describes the :ref:`actual format that the LLVM debug 13information takes <format>`, which is useful for those interested in creating 14front-ends or dealing directly with the information. Further, this document 15provides specific examples of what debug information for C/C++ looks like. 16 17Philosophy behind LLVM debugging information 18-------------------------------------------- 19 20The idea of the LLVM debugging information is to capture how the important 21pieces of the source-language's Abstract Syntax Tree map onto LLVM code. 22Several design aspects have shaped the solution that appears here. The 23important ones are: 24 25* Debugging information should have very little impact on the rest of the 26 compiler. No transformations, analyses, or code generators should need to 27 be modified because of debugging information. 28 29* LLVM optimizations should interact in :ref:`well-defined and easily described 30 ways <intro_debugopt>` with the debugging information. 31 32* Because LLVM is designed to support arbitrary programming languages, 33 LLVM-to-LLVM tools should not need to know anything about the semantics of 34 the source-level-language. 35 36* Source-level languages are often **widely** different from one another. 37 LLVM should not put any restrictions of the flavor of the source-language, 38 and the debugging information should work with any language. 39 40* With code generator support, it should be possible to use an LLVM compiler 41 to compile a program to native machine code and standard debugging 42 formats. This allows compatibility with traditional machine-code level 43 debuggers, like GDB or DBX. 44 45The approach used by the LLVM implementation is to use a small set of 46:ref:`intrinsic functions <format_common_intrinsics>` to define a mapping 47between LLVM program objects and the source-level objects. The description of 48the source-level program is maintained in LLVM metadata in an 49:ref:`implementation-defined format <ccxx_frontend>` (the C/C++ front-end 50currently uses working draft 7 of the `DWARF 3 standard 51<http://www.eagercon.com/dwarf/dwarf3std.htm>`_). 52 53When a program is being debugged, a debugger interacts with the user and turns 54the stored debug information into source-language specific information. As 55such, a debugger must be aware of the source-language, and is thus tied to a 56specific language or family of languages. 57 58Debug information consumers 59--------------------------- 60 61The role of debug information is to provide meta information normally stripped 62away during the compilation process. This meta information provides an LLVM 63user a relationship between generated code and the original program source 64code. 65 66Currently, there are two backend consumers of debug info: DwarfDebug and 67CodeViewDebug. DwarfDebug produces DWARF suitable for use with GDB, LLDB, and 68other DWARF-based debuggers. :ref:`CodeViewDebug <codeview>` produces CodeView, 69the Microsoft debug info format, which is usable with Microsoft debuggers such 70as Visual Studio and WinDBG. LLVM's debug information format is mostly derived 71from and inspired by DWARF, but it is feasible to translate into other target 72debug info formats such as STABS. 73 74It would also be reasonable to use debug information to feed profiling tools 75for analysis of generated code, or, tools for reconstructing the original 76source from generated code. 77 78.. _intro_debugopt: 79 80Debug information and optimizations 81----------------------------------- 82 83An extremely high priority of LLVM debugging information is to make it interact 84well with optimizations and analysis. In particular, the LLVM debug 85information provides the following guarantees: 86 87* LLVM debug information **always provides information to accurately read 88 the source-level state of the program**, regardless of which LLVM 89 optimizations have been run. :doc:`HowToUpdateDebugInfo` specifies how debug 90 info should be updated in various kinds of code transformations to avoid 91 breaking this guarantee, and how to preserve as much useful debug info as 92 possible. Note that some optimizations may impact the ability to modify the 93 current state of the program with a debugger, such as setting program 94 variables, or calling functions that have been deleted. 95 96* As desired, LLVM optimizations can be upgraded to be aware of debugging 97 information, allowing them to update the debugging information as they 98 perform aggressive optimizations. This means that, with effort, the LLVM 99 optimizers could optimize debug code just as well as non-debug code. 100 101* LLVM debug information does not prevent optimizations from 102 happening (for example inlining, basic block reordering/merging/cleanup, 103 tail duplication, etc). 104 105* LLVM debug information is automatically optimized along with the rest of 106 the program, using existing facilities. For example, duplicate 107 information is automatically merged by the linker, and unused information 108 is automatically removed. 109 110Basically, the debug information allows you to compile a program with 111"``-O0 -g``" and get full debug information, allowing you to arbitrarily modify 112the program as it executes from a debugger. Compiling a program with 113"``-O3 -g``" gives you full debug information that is always available and 114accurate for reading (e.g., you get accurate stack traces despite tail call 115elimination and inlining), but you might lose the ability to modify the program 116and call functions which were optimized out of the program, or inlined away 117completely. 118 119The :doc:`LLVM test-suite <TestSuiteMakefileGuide>` provides a framework to 120test the optimizer's handling of debugging information. It can be run like 121this: 122 123.. code-block:: bash 124 125 % cd llvm/projects/test-suite/MultiSource/Benchmarks # or some other level 126 % make TEST=dbgopt 127 128This will test impact of debugging information on optimization passes. If 129debugging information influences optimization passes then it will be reported 130as a failure. See :doc:`TestingGuide` for more information on LLVM test 131infrastructure and how to run various tests. 132 133.. _format: 134 135Debugging information format 136============================ 137 138LLVM debugging information has been carefully designed to make it possible for 139the optimizer to optimize the program and debugging information without 140necessarily having to know anything about debugging information. In 141particular, the use of metadata avoids duplicated debugging information from 142the beginning, and the global dead code elimination pass automatically deletes 143debugging information for a function if it decides to delete the function. 144 145To do this, most of the debugging information (descriptors for types, 146variables, functions, source files, etc) is inserted by the language front-end 147in the form of LLVM metadata. 148 149Debug information is designed to be agnostic about the target debugger and 150debugging information representation (e.g. DWARF/Stabs/etc). It uses a generic 151pass to decode the information that represents variables, types, functions, 152namespaces, etc: this allows for arbitrary source-language semantics and 153type-systems to be used, as long as there is a module written for the target 154debugger to interpret the information. 155 156To provide basic functionality, the LLVM debugger does have to make some 157assumptions about the source-level language being debugged, though it keeps 158these to a minimum. The only common features that the LLVM debugger assumes 159exist are `source files <LangRef.html#difile>`_, and `program objects 160<LangRef.html#diglobalvariable>`_. These abstract objects are used by a 161debugger to form stack traces, show information about local variables, etc. 162 163This section of the documentation first describes the representation aspects 164common to any source-language. :ref:`ccxx_frontend` describes the data layout 165conventions used by the C and C++ front-ends. 166 167Debug information descriptors are `specialized metadata nodes 168<LangRef.html#specialized-metadata>`_, first-class subclasses of ``Metadata``. 169 170.. _format_common_intrinsics: 171 172Debugger intrinsic functions 173---------------------------- 174 175LLVM uses several intrinsic functions (name prefixed with "``llvm.dbg``") to 176track source local variables through optimization and code generation. 177 178``llvm.dbg.addr`` 179^^^^^^^^^^^^^^^^^^^^ 180 181.. code-block:: llvm 182 183 void @llvm.dbg.addr(metadata, metadata, metadata) 184 185This intrinsic provides information about a local element (e.g., variable). 186The first argument is metadata holding the address of variable, typically a 187static alloca in the function entry block. The second argument is a 188`local variable <LangRef.html#dilocalvariable>`_ containing a description of 189the variable. The third argument is a `complex expression 190<LangRef.html#diexpression>`_. An `llvm.dbg.addr` intrinsic describes the 191*address* of a source variable. 192 193.. code-block:: text 194 195 %i.addr = alloca i32, align 4 196 call void @llvm.dbg.addr(metadata i32* %i.addr, metadata !1, 197 metadata !DIExpression()), !dbg !2 198 !1 = !DILocalVariable(name: "i", ...) ; int i 199 !2 = !DILocation(...) 200 ... 201 %buffer = alloca [256 x i8], align 8 202 ; The address of i is buffer+64. 203 call void @llvm.dbg.addr(metadata [256 x i8]* %buffer, metadata !3, 204 metadata !DIExpression(DW_OP_plus, 64)), !dbg !4 205 !3 = !DILocalVariable(name: "i", ...) ; int i 206 !4 = !DILocation(...) 207 208A frontend should generate exactly one call to ``llvm.dbg.addr`` at the point 209of declaration of a source variable. Optimization passes that fully promote the 210variable from memory to SSA values will replace this call with possibly 211multiple calls to `llvm.dbg.value`. Passes that delete stores are effectively 212partial promotion, and they will insert a mix of calls to ``llvm.dbg.value`` 213and ``llvm.dbg.addr`` to track the source variable value when it is available. 214After optimization, there may be multiple calls to ``llvm.dbg.addr`` describing 215the program points where the variables lives in memory. All calls for the same 216concrete source variable must agree on the memory location. 217 218 219``llvm.dbg.declare`` 220^^^^^^^^^^^^^^^^^^^^ 221 222.. code-block:: llvm 223 224 void @llvm.dbg.declare(metadata, metadata, metadata) 225 226This intrinsic is identical to `llvm.dbg.addr`, except that there can only be 227one call to `llvm.dbg.declare` for a given concrete `local variable 228<LangRef.html#dilocalvariable>`_. It is not control-dependent, meaning that if 229a call to `llvm.dbg.declare` exists and has a valid location argument, that 230address is considered to be the true home of the variable across its entire 231lifetime. This makes it hard for optimizations to preserve accurate debug info 232in the presence of ``llvm.dbg.declare``, so we are transitioning away from it, 233and we plan to deprecate it in future LLVM releases. 234 235 236``llvm.dbg.value`` 237^^^^^^^^^^^^^^^^^^ 238 239.. code-block:: llvm 240 241 void @llvm.dbg.value(metadata, metadata, metadata) 242 243This intrinsic provides information when a user source variable is set to a new 244value. The first argument is the new value (wrapped as metadata). The second 245argument is a `local variable <LangRef.html#dilocalvariable>`_ containing a 246description of the variable. The third argument is a `complex expression 247<LangRef.html#diexpression>`_. 248 249An `llvm.dbg.value` intrinsic describes the *value* of a source variable 250directly, not its address. Note that the value operand of this intrinsic may 251be indirect (i.e, a pointer to the source variable), provided that interpreting 252the complex expression derives the direct value. 253 254Object lifetimes and scoping 255============================ 256 257In many languages, the local variables in functions can have their lifetimes or 258scopes limited to a subset of a function. In the C family of languages, for 259example, variables are only live (readable and writable) within the source 260block that they are defined in. In functional languages, values are only 261readable after they have been defined. Though this is a very obvious concept, 262it is non-trivial to model in LLVM, because it has no notion of scoping in this 263sense, and does not want to be tied to a language's scoping rules. 264 265In order to handle this, the LLVM debug format uses the metadata attached to 266llvm instructions to encode line number and scoping information. Consider the 267following C fragment, for example: 268 269.. code-block:: c 270 271 1. void foo() { 272 2. int X = 21; 273 3. int Y = 22; 274 4. { 275 5. int Z = 23; 276 6. Z = X; 277 7. } 278 8. X = Y; 279 9. } 280 281.. FIXME: Update the following example to use llvm.dbg.addr once that is the 282 default in clang. 283 284Compiled to LLVM, this function would be represented like this: 285 286.. code-block:: text 287 288 ; Function Attrs: nounwind ssp uwtable 289 define void @foo() #0 !dbg !4 { 290 entry: 291 %X = alloca i32, align 4 292 %Y = alloca i32, align 4 293 %Z = alloca i32, align 4 294 call void @llvm.dbg.declare(metadata i32* %X, metadata !11, metadata !13), !dbg !14 295 store i32 21, i32* %X, align 4, !dbg !14 296 call void @llvm.dbg.declare(metadata i32* %Y, metadata !15, metadata !13), !dbg !16 297 store i32 22, i32* %Y, align 4, !dbg !16 298 call void @llvm.dbg.declare(metadata i32* %Z, metadata !17, metadata !13), !dbg !19 299 store i32 23, i32* %Z, align 4, !dbg !19 300 %0 = load i32, i32* %X, align 4, !dbg !20 301 store i32 %0, i32* %Z, align 4, !dbg !21 302 %1 = load i32, i32* %Y, align 4, !dbg !22 303 store i32 %1, i32* %X, align 4, !dbg !23 304 ret void, !dbg !24 305 } 306 307 ; Function Attrs: nounwind readnone 308 declare void @llvm.dbg.declare(metadata, metadata, metadata) #1 309 310 attributes #0 = { nounwind ssp uwtable "less-precise-fpmad"="false" "frame-pointer"="all" "no-infs-fp-math"="false" "no-nans-fp-math"="false" "stack-protector-buffer-size"="8" "unsafe-fp-math"="false" "use-soft-float"="false" } 311 attributes #1 = { nounwind readnone } 312 313 !llvm.dbg.cu = !{!0} 314 !llvm.module.flags = !{!7, !8, !9} 315 !llvm.ident = !{!10} 316 317 !0 = !DICompileUnit(language: DW_LANG_C99, file: !1, producer: "clang version 3.7.0 (trunk 231150) (llvm/trunk 231154)", isOptimized: false, runtimeVersion: 0, emissionKind: FullDebug, enums: !2, retainedTypes: !2, subprograms: !3, globals: !2, imports: !2) 318 !1 = !DIFile(filename: "/dev/stdin", directory: "/Users/dexonsmith/data/llvm/debug-info") 319 !2 = !{} 320 !3 = !{!4} 321 !4 = distinct !DISubprogram(name: "foo", scope: !1, file: !1, line: 1, type: !5, isLocal: false, isDefinition: true, scopeLine: 1, isOptimized: false, retainedNodes: !2) 322 !5 = !DISubroutineType(types: !6) 323 !6 = !{null} 324 !7 = !{i32 2, !"Dwarf Version", i32 2} 325 !8 = !{i32 2, !"Debug Info Version", i32 3} 326 !9 = !{i32 1, !"PIC Level", i32 2} 327 !10 = !{!"clang version 3.7.0 (trunk 231150) (llvm/trunk 231154)"} 328 !11 = !DILocalVariable(name: "X", scope: !4, file: !1, line: 2, type: !12) 329 !12 = !DIBasicType(name: "int", size: 32, align: 32, encoding: DW_ATE_signed) 330 !13 = !DIExpression() 331 !14 = !DILocation(line: 2, column: 9, scope: !4) 332 !15 = !DILocalVariable(name: "Y", scope: !4, file: !1, line: 3, type: !12) 333 !16 = !DILocation(line: 3, column: 9, scope: !4) 334 !17 = !DILocalVariable(name: "Z", scope: !18, file: !1, line: 5, type: !12) 335 !18 = distinct !DILexicalBlock(scope: !4, file: !1, line: 4, column: 5) 336 !19 = !DILocation(line: 5, column: 11, scope: !18) 337 !20 = !DILocation(line: 6, column: 11, scope: !18) 338 !21 = !DILocation(line: 6, column: 9, scope: !18) 339 !22 = !DILocation(line: 8, column: 9, scope: !4) 340 !23 = !DILocation(line: 8, column: 7, scope: !4) 341 !24 = !DILocation(line: 9, column: 3, scope: !4) 342 343 344This example illustrates a few important details about LLVM debugging 345information. In particular, it shows how the ``llvm.dbg.declare`` intrinsic and 346location information, which are attached to an instruction, are applied 347together to allow a debugger to analyze the relationship between statements, 348variable definitions, and the code used to implement the function. 349 350.. code-block:: llvm 351 352 call void @llvm.dbg.declare(metadata i32* %X, metadata !11, metadata !13), !dbg !14 353 ; [debug line = 2:7] [debug variable = X] 354 355The first intrinsic ``%llvm.dbg.declare`` encodes debugging information for the 356variable ``X``. The metadata ``!dbg !14`` attached to the intrinsic provides 357scope information for the variable ``X``. 358 359.. code-block:: text 360 361 !14 = !DILocation(line: 2, column: 9, scope: !4) 362 !4 = distinct !DISubprogram(name: "foo", scope: !1, file: !1, line: 1, type: !5, 363 isLocal: false, isDefinition: true, scopeLine: 1, 364 isOptimized: false, retainedNodes: !2) 365 366Here ``!14`` is metadata providing `location information 367<LangRef.html#dilocation>`_. In this example, scope is encoded by ``!4``, a 368`subprogram descriptor <LangRef.html#disubprogram>`_. This way the location 369information attached to the intrinsics indicates that the variable ``X`` is 370declared at line number 2 at a function level scope in function ``foo``. 371 372Now lets take another example. 373 374.. code-block:: llvm 375 376 call void @llvm.dbg.declare(metadata i32* %Z, metadata !17, metadata !13), !dbg !19 377 ; [debug line = 5:9] [debug variable = Z] 378 379The third intrinsic ``%llvm.dbg.declare`` encodes debugging information for 380variable ``Z``. The metadata ``!dbg !19`` attached to the intrinsic provides 381scope information for the variable ``Z``. 382 383.. code-block:: text 384 385 !18 = distinct !DILexicalBlock(scope: !4, file: !1, line: 4, column: 5) 386 !19 = !DILocation(line: 5, column: 11, scope: !18) 387 388Here ``!19`` indicates that ``Z`` is declared at line number 5 and column 389number 11 inside of lexical scope ``!18``. The lexical scope itself resides 390inside of subprogram ``!4`` described above. 391 392The scope information attached with each instruction provides a straightforward 393way to find instructions covered by a scope. 394 395Object lifetime in optimized code 396================================= 397 398In the example above, every variable assignment uniquely corresponds to a 399memory store to the variable's position on the stack. However in heavily 400optimized code LLVM promotes most variables into SSA values, which can 401eventually be placed in physical registers or memory locations. To track SSA 402values through compilation, when objects are promoted to SSA values an 403``llvm.dbg.value`` intrinsic is created for each assignment, recording the 404variable's new location. Compared with the ``llvm.dbg.declare`` intrinsic: 405 406* A dbg.value terminates the effect of any preceding dbg.values for (any 407 overlapping fragments of) the specified variable. 408* The dbg.value's position in the IR defines where in the instruction stream 409 the variable's value changes. 410* Operands can be constants, indicating the variable is assigned a 411 constant value. 412 413Care must be taken to update ``llvm.dbg.value`` intrinsics when optimization 414passes alter or move instructions and blocks -- the developer could observe such 415changes reflected in the value of variables when debugging the program. For any 416execution of the optimized program, the set of variable values presented to the 417developer by the debugger should not show a state that would never have existed 418in the execution of the unoptimized program, given the same input. Doing so 419risks misleading the developer by reporting a state that does not exist, 420damaging their understanding of the optimized program and undermining their 421trust in the debugger. 422 423Sometimes perfectly preserving variable locations is not possible, often when a 424redundant calculation is optimized out. In such cases, a ``llvm.dbg.value`` 425with operand ``undef`` should be used, to terminate earlier variable locations 426and let the debugger present ``optimized out`` to the developer. Withholding 427these potentially stale variable values from the developer diminishes the 428amount of available debug information, but increases the reliability of the 429remaining information. 430 431To illustrate some potential issues, consider the following example: 432 433.. code-block:: llvm 434 435 define i32 @foo(i32 %bar, i1 %cond) { 436 entry: 437 call @llvm.dbg.value(metadata i32 0, metadata !1, metadata !2) 438 br i1 %cond, label %truebr, label %falsebr 439 truebr: 440 %tval = add i32 %bar, 1 441 call @llvm.dbg.value(metadata i32 %tval, metadata !1, metadata !2) 442 %g1 = call i32 @gazonk() 443 br label %exit 444 falsebr: 445 %fval = add i32 %bar, 2 446 call @llvm.dbg.value(metadata i32 %fval, metadata !1, metadata !2) 447 %g2 = call i32 @gazonk() 448 br label %exit 449 exit: 450 %merge = phi [ %tval, %truebr ], [ %fval, %falsebr ] 451 %g = phi [ %g1, %truebr ], [ %g2, %falsebr ] 452 call @llvm.dbg.value(metadata i32 %merge, metadata !1, metadata !2) 453 call @llvm.dbg.value(metadata i32 %g, metadata !3, metadata !2) 454 %plusten = add i32 %merge, 10 455 %toret = add i32 %plusten, %g 456 call @llvm.dbg.value(metadata i32 %toret, metadata !1, metadata !2) 457 ret i32 %toret 458 } 459 460Containing two source-level variables in ``!1`` and ``!3``. The function could, 461perhaps, be optimized into the following code: 462 463.. code-block:: llvm 464 465 define i32 @foo(i32 %bar, i1 %cond) { 466 entry: 467 %g = call i32 @gazonk() 468 %addoper = select i1 %cond, i32 11, i32 12 469 %plusten = add i32 %bar, %addoper 470 %toret = add i32 %plusten, %g 471 ret i32 %toret 472 } 473 474What ``llvm.dbg.value`` intrinsics should be placed to represent the original variable 475locations in this code? Unfortunately the second, third and fourth 476dbg.values for ``!1`` in the source function have had their operands 477(%tval, %fval, %merge) optimized out. Assuming we cannot recover them, we 478might consider this placement of dbg.values: 479 480.. code-block:: llvm 481 482 define i32 @foo(i32 %bar, i1 %cond) { 483 entry: 484 call @llvm.dbg.value(metadata i32 0, metadata !1, metadata !2) 485 %g = call i32 @gazonk() 486 call @llvm.dbg.value(metadata i32 %g, metadata !3, metadata !2) 487 %addoper = select i1 %cond, i32 11, i32 12 488 %plusten = add i32 %bar, %addoper 489 %toret = add i32 %plusten, %g 490 call @llvm.dbg.value(metadata i32 %toret, metadata !1, metadata !2) 491 ret i32 %toret 492 } 493 494However, this will cause ``!3`` to have the return value of ``@gazonk()`` at 495the same time as ``!1`` has the constant value zero -- a pair of assignments 496that never occurred in the unoptimized program. To avoid this, we must terminate 497the range that ``!1`` has the constant value assignment by inserting an undef 498dbg.value before the dbg.value for ``!3``: 499 500.. code-block:: llvm 501 502 define i32 @foo(i32 %bar, i1 %cond) { 503 entry: 504 call @llvm.dbg.value(metadata i32 0, metadata !1, metadata !2) 505 %g = call i32 @gazonk() 506 call @llvm.dbg.value(metadata i32 undef, metadata !1, metadata !2) 507 call @llvm.dbg.value(metadata i32 %g, metadata !3, metadata !2) 508 %addoper = select i1 %cond, i32 11, i32 12 509 %plusten = add i32 %bar, %addoper 510 %toret = add i32 %plusten, %g 511 call @llvm.dbg.value(metadata i32 %toret, metadata !1, metadata !2) 512 ret i32 %toret 513 } 514 515In general, if any dbg.value has its operand optimized out and cannot be 516recovered, then an undef dbg.value is necessary to terminate earlier variable 517locations. Additional undef dbg.values may be necessary when the debugger can 518observe re-ordering of assignments. 519 520How variable location metadata is transformed during CodeGen 521============================================================ 522 523LLVM preserves debug information throughout mid-level and backend passes, 524ultimately producing a mapping between source-level information and 525instruction ranges. This 526is relatively straightforwards for line number information, as mapping 527instructions to line numbers is a simple association. For variable locations 528however the story is more complex. As each ``llvm.dbg.value`` intrinsic 529represents a source-level assignment of a value to a source variable, the 530variable location intrinsics effectively embed a small imperative program 531within the LLVM IR. By the end of CodeGen, this becomes a mapping from each 532variable to their machine locations over ranges of instructions. 533From IR to object emission, the major transformations which affect variable 534location fidelity are: 535 5361. Instruction Selection 5372. Register allocation 5383. Block layout 539 540each of which are discussed below. In addition, instruction scheduling can 541significantly change the ordering of the program, and occurs in a number of 542different passes. 543 544Some variable locations are not transformed during CodeGen. Stack locations 545specified by ``llvm.dbg.declare`` are valid and unchanging for the entire 546duration of the function, and are recorded in a simple MachineFunction table. 547Location changes in the prologue and epilogue of a function are also ignored: 548frame setup and destruction may take several instructions, require a 549disproportionate amount of debugging information in the output binary to 550describe, and should be stepped over by debuggers anyway. 551 552Variable locations in Instruction Selection and MIR 553--------------------------------------------------- 554 555Instruction selection creates a MIR function from an IR function, and just as 556it transforms ``intermediate`` instructions into machine instructions, so must 557``intermediate`` variable locations become machine variable locations. 558Within IR, variable locations are always identified by a Value, but in MIR 559there can be different types of variable locations. In addition, some IR 560locations become unavailable, for example if the operation of multiple IR 561instructions are combined into one machine instruction (such as 562multiply-and-accumulate) then intermediate Values are lost. To track variable 563locations through instruction selection, they are first separated into 564locations that do not depend on code generation (constants, stack locations, 565allocated virtual registers) and those that do. For those that do, debug 566metadata is attached to SDNodes in SelectionDAGs. After instruction selection 567has occurred and a MIR function is created, if the SDNode associated with debug 568metadata is allocated a virtual register, that virtual register is used as the 569variable location. If the SDNode is folded into a machine instruction or 570otherwise transformed into a non-register, the variable location becomes 571unavailable. 572 573Locations that are unavailable are treated as if they have been optimized out: 574in IR the location would be assigned ``undef`` by a debug intrinsic, and in MIR 575the equivalent location is used. 576 577After MIR locations are assigned to each variable, machine pseudo-instructions 578corresponding to each ``llvm.dbg.value`` and ``llvm.dbg.addr`` intrinsic are 579inserted. There are two forms of this type of instruction. 580 581The first form, ``DBG_VALUE``, appears thus: 582 583.. code-block:: text 584 585 DBG_VALUE %1, $noreg, !123, !DIExpression() 586 587And has the following operands: 588 * The first operand can record the variable location as a register, 589 a frame index, an immediate, or the base address register if the original 590 debug intrinsic referred to memory. ``$noreg`` indicates the variable 591 location is undefined, equivalent to an ``undef`` dbg.value operand. 592 * The type of the second operand indicates whether the variable location is 593 directly referred to by the DBG_VALUE, or whether it is indirect. The 594 ``$noreg`` register signifies the former, an immediate operand (0) the 595 latter. 596 * Operand 3 is the Variable field of the original debug intrinsic. 597 * Operand 4 is the Expression field of the original debug intrinsic. 598 599The second form, ``DBG_VALUE_LIST``, appears thus: 600 601.. code-block:: text 602 603 DBG_VALUE_LIST !123, !DIExpression(DW_OP_LLVM_arg, 0, DW_OP_LLVM_arg, 1, DW_OP_plus), %1, %2 604 605And has the following operands: 606 * The first operand is the Variable field of the original debug intrinsic. 607 * The second operand is the Expression field of the original debug intrinsic. 608 * Any number of operands, from the 3rd onwards, record a sequence of variable 609 location operands, which may take any of the same values as the first 610 operand of the ``DBG_VALUE`` instruction above. These variable location 611 operands are inserted into the final DWARF Expression in positions indicated 612 by the DW_OP_LLVM_arg operator in the `DIExpression 613 <LangRef.html#diexpression>`. 614 615The position at which the DBG_VALUEs are inserted should correspond to the 616positions of their matching ``llvm.dbg.value`` intrinsics in the IR block. As 617with optimization, LLVM aims to preserve the order in which variable 618assignments occurred in the source program. However SelectionDAG performs some 619instruction scheduling, which can reorder assignments (discussed below). 620Function parameter locations are moved to the beginning of the function if 621they're not already, to ensure they're immediately available on function entry. 622 623To demonstrate variable locations during instruction selection, consider 624the following example: 625 626.. code-block:: llvm 627 628 define i32 @foo(i32* %addr) { 629 entry: 630 call void @llvm.dbg.value(metadata i32 0, metadata !3, metadata !DIExpression()), !dbg !5 631 br label %bb1, !dbg !5 632 633 bb1: ; preds = %bb1, %entry 634 %bar.0 = phi i32 [ 0, %entry ], [ %add, %bb1 ] 635 call void @llvm.dbg.value(metadata i32 %bar.0, metadata !3, metadata !DIExpression()), !dbg !5 636 %addr1 = getelementptr i32, i32 *%addr, i32 1, !dbg !5 637 call void @llvm.dbg.value(metadata i32 *%addr1, metadata !3, metadata !DIExpression()), !dbg !5 638 %loaded1 = load i32, i32* %addr1, !dbg !5 639 %addr2 = getelementptr i32, i32 *%addr, i32 %bar.0, !dbg !5 640 call void @llvm.dbg.value(metadata i32 *%addr2, metadata !3, metadata !DIExpression()), !dbg !5 641 %loaded2 = load i32, i32* %addr2, !dbg !5 642 %add = add i32 %bar.0, 1, !dbg !5 643 call void @llvm.dbg.value(metadata i32 %add, metadata !3, metadata !DIExpression()), !dbg !5 644 %added = add i32 %loaded1, %loaded2 645 %cond = icmp ult i32 %added, %bar.0, !dbg !5 646 br i1 %cond, label %bb1, label %bb2, !dbg !5 647 648 bb2: ; preds = %bb1 649 ret i32 0, !dbg !5 650 } 651 652If one compiles this IR with ``llc -o - -start-after=codegen-prepare -stop-after=expand-isel-pseudos -mtriple=x86_64--``, the following MIR is produced: 653 654.. code-block:: text 655 656 bb.0.entry: 657 successors: %bb.1(0x80000000) 658 liveins: $rdi 659 660 %2:gr64 = COPY $rdi 661 %3:gr32 = MOV32r0 implicit-def dead $eflags 662 DBG_VALUE 0, $noreg, !3, !DIExpression(), debug-location !5 663 664 bb.1.bb1: 665 successors: %bb.1(0x7c000000), %bb.2(0x04000000) 666 667 %0:gr32 = PHI %3, %bb.0, %1, %bb.1 668 DBG_VALUE %0, $noreg, !3, !DIExpression(), debug-location !5 669 DBG_VALUE %2, $noreg, !3, !DIExpression(DW_OP_plus_uconst, 4, DW_OP_stack_value), debug-location !5 670 %4:gr32 = MOV32rm %2, 1, $noreg, 4, $noreg, debug-location !5 :: (load 4 from %ir.addr1) 671 %5:gr64_nosp = MOVSX64rr32 %0, debug-location !5 672 DBG_VALUE $noreg, $noreg, !3, !DIExpression(), debug-location !5 673 %1:gr32 = INC32r %0, implicit-def dead $eflags, debug-location !5 674 DBG_VALUE %1, $noreg, !3, !DIExpression(), debug-location !5 675 %6:gr32 = ADD32rm %4, %2, 4, killed %5, 0, $noreg, implicit-def dead $eflags :: (load 4 from %ir.addr2) 676 %7:gr32 = SUB32rr %6, %0, implicit-def $eflags, debug-location !5 677 JB_1 %bb.1, implicit $eflags, debug-location !5 678 JMP_1 %bb.2, debug-location !5 679 680 bb.2.bb2: 681 %8:gr32 = MOV32r0 implicit-def dead $eflags 682 $eax = COPY %8, debug-location !5 683 RET 0, $eax, debug-location !5 684 685Observe first that there is a DBG_VALUE instruction for every ``llvm.dbg.value`` 686intrinsic in the source IR, ensuring no source level assignments go missing. 687Then consider the different ways in which variable locations have been recorded: 688 689* For the first dbg.value an immediate operand is used to record a zero value. 690* The dbg.value of the PHI instruction leads to a DBG_VALUE of virtual register 691 ``%0``. 692* The first GEP has its effect folded into the first load instruction 693 (as a 4-byte offset), but the variable location is salvaged by folding 694 the GEPs effect into the DIExpression. 695* The second GEP is also folded into the corresponding load. However, it is 696 insufficiently simple to be salvaged, and is emitted as a ``$noreg`` 697 DBG_VALUE, indicating that the variable takes on an undefined location. 698* The final dbg.value has its Value placed in virtual register ``%1``. 699 700Instruction Scheduling 701---------------------- 702 703A number of passes can reschedule instructions, notably instruction selection 704and the pre-and-post RA machine schedulers. Instruction scheduling can 705significantly change the nature of the program -- in the (very unlikely) worst 706case the instruction sequence could be completely reversed. In such 707circumstances LLVM follows the principle applied to optimizations, that it is 708better for the debugger not to display any state than a misleading state. 709Thus, whenever instructions are advanced in order of execution, any 710corresponding DBG_VALUE is kept in its original position, and if an instruction 711is delayed then the variable is given an undefined location for the duration 712of the delay. To illustrate, consider this pseudo-MIR: 713 714.. code-block:: text 715 716 %1:gr32 = MOV32rm %0, 1, $noreg, 4, $noreg, debug-location !5 :: (load 4 from %ir.addr1) 717 DBG_VALUE %1, $noreg, !1, !2 718 %4:gr32 = ADD32rr %3, %2, implicit-def dead $eflags 719 DBG_VALUE %4, $noreg, !3, !4 720 %7:gr32 = SUB32rr %6, %5, implicit-def dead $eflags 721 DBG_VALUE %7, $noreg, !5, !6 722 723Imagine that the SUB32rr were moved forward to give us the following MIR: 724 725.. code-block:: text 726 727 %7:gr32 = SUB32rr %6, %5, implicit-def dead $eflags 728 %1:gr32 = MOV32rm %0, 1, $noreg, 4, $noreg, debug-location !5 :: (load 4 from %ir.addr1) 729 DBG_VALUE %1, $noreg, !1, !2 730 %4:gr32 = ADD32rr %3, %2, implicit-def dead $eflags 731 DBG_VALUE %4, $noreg, !3, !4 732 DBG_VALUE %7, $noreg, !5, !6 733 734In this circumstance LLVM would leave the MIR as shown above. Were we to move 735the DBG_VALUE of virtual register %7 upwards with the SUB32rr, we would re-order 736assignments and introduce a new state of the program. Whereas with the solution 737above, the debugger will see one fewer combination of variable values, because 738``!3`` and ``!5`` will change value at the same time. This is preferred over 739misrepresenting the original program. 740 741In comparison, if one sunk the MOV32rm, LLVM would produce the following: 742 743.. code-block:: text 744 745 DBG_VALUE $noreg, $noreg, !1, !2 746 %4:gr32 = ADD32rr %3, %2, implicit-def dead $eflags 747 DBG_VALUE %4, $noreg, !3, !4 748 %7:gr32 = SUB32rr %6, %5, implicit-def dead $eflags 749 DBG_VALUE %7, $noreg, !5, !6 750 %1:gr32 = MOV32rm %0, 1, $noreg, 4, $noreg, debug-location !5 :: (load 4 from %ir.addr1) 751 DBG_VALUE %1, $noreg, !1, !2 752 753Here, to avoid presenting a state in which the first assignment to ``!1`` 754disappears, the DBG_VALUE at the top of the block assigns the variable the 755undefined location, until its value is available at the end of the block where 756an additional DBG_VALUE is added. Were any other DBG_VALUE for ``!1`` to occur 757in the instructions that the MOV32rm was sunk past, the DBG_VALUE for ``%1`` 758would be dropped and the debugger would never observe it in the variable. This 759accurately reflects that the value is not available during the corresponding 760portion of the original program. 761 762Variable locations during Register Allocation 763--------------------------------------------- 764 765To avoid debug instructions interfering with the register allocator, the 766LiveDebugVariables pass extracts variable locations from a MIR function and 767deletes the corresponding DBG_VALUE instructions. Some localized copy 768propagation is performed within blocks. After register allocation, the 769VirtRegRewriter pass re-inserts DBG_VALUE instructions in their original 770positions, translating virtual register references into their physical 771machine locations. To avoid encoding incorrect variable locations, in this 772pass any DBG_VALUE of a virtual register that is not live, is replaced by 773the undefined location. The LiveDebugVariables may insert redundant DBG_VALUEs 774because of virtual register rewriting. These will be subsequently removed by 775the RemoveRedundantDebugValues pass. 776 777LiveDebugValues expansion of variable locations 778----------------------------------------------- 779 780After all optimizations have run and shortly before emission, the 781LiveDebugValues pass runs to achieve two aims: 782 783* To propagate the location of variables through copies and register spills, 784* For every block, to record every valid variable location in that block. 785 786After this pass the DBG_VALUE instruction changes meaning: rather than 787corresponding to a source-level assignment where the variable may change value, 788it asserts the location of a variable in a block, and loses effect outside the 789block. Propagating variable locations through copies and spills is 790straightforwards: determining the variable location in every basic block 791requires the consideration of control flow. Consider the following IR, which 792presents several difficulties: 793 794.. code-block:: text 795 796 define dso_local i32 @foo(i1 %cond, i32 %input) !dbg !12 { 797 entry: 798 br i1 %cond, label %truebr, label %falsebr 799 800 bb1: 801 %value = phi i32 [ %value1, %truebr ], [ %value2, %falsebr ] 802 br label %exit, !dbg !26 803 804 truebr: 805 call void @llvm.dbg.value(metadata i32 %input, metadata !30, metadata !DIExpression()), !dbg !24 806 call void @llvm.dbg.value(metadata i32 1, metadata !23, metadata !DIExpression()), !dbg !24 807 %value1 = add i32 %input, 1 808 br label %bb1 809 810 falsebr: 811 call void @llvm.dbg.value(metadata i32 %input, metadata !30, metadata !DIExpression()), !dbg !24 812 call void @llvm.dbg.value(metadata i32 2, metadata !23, metadata !DIExpression()), !dbg !24 813 %value = add i32 %input, 2 814 br label %bb1 815 816 exit: 817 ret i32 %value, !dbg !30 818 } 819 820Here the difficulties are: 821 822* The control flow is roughly the opposite of basic block order 823* The value of the ``!23`` variable merges into ``%bb1``, but there is no PHI 824 node 825 826As mentioned above, the ``llvm.dbg.value`` intrinsics essentially form an 827imperative program embedded in the IR, with each intrinsic defining a variable 828location. This *could* be converted to an SSA form by mem2reg, in the same way 829that it uses use-def chains to identify control flow merges and insert phi 830nodes for IR Values. However, because debug variable locations are defined for 831every machine instruction, in effect every IR instruction uses every variable 832location, which would lead to a large number of debugging intrinsics being 833generated. 834 835Examining the example above, variable ``!30`` is assigned ``%input`` on both 836conditional paths through the function, while ``!23`` is assigned differing 837constant values on either path. Where control flow merges in ``%bb1`` we would 838want ``!30`` to keep its location (``%input``), but ``!23`` to become undefined 839as we cannot determine at runtime what value it should have in %bb1 without 840inserting a PHI node. mem2reg does not insert the PHI node to avoid changing 841codegen when debugging is enabled, and does not insert the other dbg.values 842to avoid adding very large numbers of intrinsics. 843 844Instead, LiveDebugValues determines variable locations when control 845flow merges. A dataflow analysis is used to propagate locations between blocks: 846when control flow merges, if a variable has the same location in all 847predecessors then that location is propagated into the successor. If the 848predecessor locations disagree, the location becomes undefined. 849 850Once LiveDebugValues has run, every block should have all valid variable 851locations described by DBG_VALUE instructions within the block. Very little 852effort is then required by supporting classes (such as 853DbgEntityHistoryCalculator) to build a map of each instruction to every 854valid variable location, without the need to consider control flow. From 855the example above, it is otherwise difficult to determine that the location 856of variable ``!30`` should flow "up" into block ``%bb1``, but that the location 857of variable ``!23`` should not flow "down" into the ``%exit`` block. 858 859.. _ccxx_frontend: 860 861C/C++ front-end specific debug information 862========================================== 863 864The C and C++ front-ends represent information about the program in a 865format that is effectively identical to `DWARF <http://www.dwarfstd.org/>`_ 866in terms of information content. This allows code generators to 867trivially support native debuggers by generating standard dwarf 868information, and contains enough information for non-dwarf targets to 869translate it as needed. 870 871This section describes the forms used to represent C and C++ programs. Other 872languages could pattern themselves after this (which itself is tuned to 873representing programs in the same way that DWARF does), or they could choose 874to provide completely different forms if they don't fit into the DWARF model. 875As support for debugging information gets added to the various LLVM 876source-language front-ends, the information used should be documented here. 877 878The following sections provide examples of a few C/C++ constructs and 879the debug information that would best describe those constructs. The 880canonical references are the ``DINode`` classes defined in 881``include/llvm/IR/DebugInfoMetadata.h`` and the implementations of the 882helper functions in ``lib/IR/DIBuilder.cpp``. 883 884C/C++ source file information 885----------------------------- 886 887``llvm::Instruction`` provides easy access to metadata attached with an 888instruction. One can extract line number information encoded in LLVM IR using 889``Instruction::getDebugLoc()`` and ``DILocation::getLine()``. 890 891.. code-block:: c++ 892 893 if (DILocation *Loc = I->getDebugLoc()) { // Here I is an LLVM instruction 894 unsigned Line = Loc->getLine(); 895 StringRef File = Loc->getFilename(); 896 StringRef Dir = Loc->getDirectory(); 897 bool ImplicitCode = Loc->isImplicitCode(); 898 } 899 900When the flag ImplicitCode is true then it means that the Instruction has been 901added by the front-end but doesn't correspond to source code written by the user. For example 902 903.. code-block:: c++ 904 905 if (MyBoolean) { 906 MyObject MO; 907 ... 908 } 909 910At the end of the scope the MyObject's destructor is called but it isn't written 911explicitly. This information is useful to avoid to have counters on brackets when 912making code coverage. 913 914C/C++ global variable information 915--------------------------------- 916 917Given an integer global variable declared as follows: 918 919.. code-block:: c 920 921 _Alignas(8) int MyGlobal = 100; 922 923a C/C++ front-end would generate the following descriptors: 924 925.. code-block:: text 926 927 ;; 928 ;; Define the global itself. 929 ;; 930 @MyGlobal = global i32 100, align 8, !dbg !0 931 932 ;; 933 ;; List of debug info of globals 934 ;; 935 !llvm.dbg.cu = !{!1} 936 937 ;; Some unrelated metadata. 938 !llvm.module.flags = !{!6, !7} 939 !llvm.ident = !{!8} 940 941 ;; Define the global variable itself 942 !0 = distinct !DIGlobalVariable(name: "MyGlobal", scope: !1, file: !2, line: 1, type: !5, isLocal: false, isDefinition: true, align: 64) 943 944 ;; Define the compile unit. 945 !1 = distinct !DICompileUnit(language: DW_LANG_C99, file: !2, 946 producer: "clang version 4.0.0", 947 isOptimized: false, runtimeVersion: 0, emissionKind: FullDebug, 948 enums: !3, globals: !4) 949 950 ;; 951 ;; Define the file 952 ;; 953 !2 = !DIFile(filename: "/dev/stdin", 954 directory: "/Users/dexonsmith/data/llvm/debug-info") 955 956 ;; An empty array. 957 !3 = !{} 958 959 ;; The Array of Global Variables 960 !4 = !{!0} 961 962 ;; 963 ;; Define the type 964 ;; 965 !5 = !DIBasicType(name: "int", size: 32, encoding: DW_ATE_signed) 966 967 ;; Dwarf version to output. 968 !6 = !{i32 2, !"Dwarf Version", i32 4} 969 970 ;; Debug info schema version. 971 !7 = !{i32 2, !"Debug Info Version", i32 3} 972 973 ;; Compiler identification 974 !8 = !{!"clang version 4.0.0"} 975 976 977The align value in DIGlobalVariable description specifies variable alignment in 978case it was forced by C11 _Alignas(), C++11 alignas() keywords or compiler 979attribute __attribute__((aligned ())). In other case (when this field is missing) 980alignment is considered default. This is used when producing DWARF output 981for DW_AT_alignment value. 982 983C/C++ function information 984-------------------------- 985 986Given a function declared as follows: 987 988.. code-block:: c 989 990 int main(int argc, char *argv[]) { 991 return 0; 992 } 993 994a C/C++ front-end would generate the following descriptors: 995 996.. code-block:: text 997 998 ;; 999 ;; Define the anchor for subprograms. 1000 ;; 1001 !4 = !DISubprogram(name: "main", scope: !1, file: !1, line: 1, type: !5, 1002 isLocal: false, isDefinition: true, scopeLine: 1, 1003 flags: DIFlagPrototyped, isOptimized: false, 1004 retainedNodes: !2) 1005 1006 ;; 1007 ;; Define the subprogram itself. 1008 ;; 1009 define i32 @main(i32 %argc, i8** %argv) !dbg !4 { 1010 ... 1011 } 1012 1013C++ specific debug information 1014============================== 1015 1016C++ special member functions information 1017---------------------------------------- 1018 1019DWARF v5 introduces attributes defined to enhance debugging information of C++ programs. LLVM can generate (or omit) these appropriate DWARF attributes. In C++ a special member function Ctors, Dtors, Copy/Move Ctors, assignment operators can be declared with C++11 keyword deleted. This is represented in LLVM using spFlags value DISPFlagDeleted. 1020 1021Given a class declaration with copy constructor declared as deleted: 1022 1023.. code-block:: c 1024 1025 class foo { 1026 public: 1027 foo(const foo&) = deleted; 1028 }; 1029 1030A C++ frontend would generate following: 1031 1032.. code-block:: text 1033 1034 !17 = !DISubprogram(name: "foo", scope: !11, file: !1, line: 5, type: !18, scopeLine: 5, flags: DIFlagPublic | DIFlagPrototyped, spFlags: DISPFlagDeleted) 1035 1036and this will produce an additional DWARF attribute as: 1037 1038.. code-block:: text 1039 1040 DW_TAG_subprogram [7] * 1041 DW_AT_name [DW_FORM_strx1] (indexed (00000006) string = "foo") 1042 DW_AT_decl_line [DW_FORM_data1] (5) 1043 ... 1044 DW_AT_deleted [DW_FORM_flag_present] (true) 1045 1046Fortran specific debug information 1047================================== 1048 1049Fortran function information 1050---------------------------- 1051 1052There are a few DWARF attributes defined to support client debugging of Fortran programs. LLVM can generate (or omit) the appropriate DWARF attributes for the prefix-specs of ELEMENTAL, PURE, IMPURE, RECURSIVE, and NON_RECURSIVE. This is done by using the spFlags values: DISPFlagElemental, DISPFlagPure, and DISPFlagRecursive. 1053 1054.. code-block:: fortran 1055 1056 elemental function elem_func(a) 1057 1058a Fortran front-end would generate the following descriptors: 1059 1060.. code-block:: text 1061 1062 !11 = distinct !DISubprogram(name: "subroutine2", scope: !1, file: !1, 1063 line: 5, type: !8, scopeLine: 6, 1064 spFlags: DISPFlagDefinition | DISPFlagElemental, unit: !0, 1065 retainedNodes: !2) 1066 1067and this will materialize an additional DWARF attribute as: 1068 1069.. code-block:: text 1070 1071 DW_TAG_subprogram [3] 1072 DW_AT_low_pc [DW_FORM_addr] (0x0000000000000010 ".text") 1073 DW_AT_high_pc [DW_FORM_data4] (0x00000001) 1074 ... 1075 DW_AT_elemental [DW_FORM_flag_present] (true) 1076 1077There are a few DWARF tags defined to represent Fortran specific constructs i.e DW_TAG_string_type for representing Fortran character(n). In LLVM this is represented as DIStringType. 1078 1079.. code-block:: fortran 1080 1081 character(len=*), intent(in) :: string 1082 1083a Fortran front-end would generate the following descriptors: 1084 1085.. code-block:: text 1086 1087 !DILocalVariable(name: "string", arg: 1, scope: !10, file: !3, line: 4, type: !15) 1088 !DIStringType(name: "character(*)!2", stringLength: !16, stringLengthExpression: !DIExpression(), size: 32) 1089 1090and this will materialize in DWARF tags as: 1091 1092.. code-block:: text 1093 1094 DW_TAG_string_type 1095 DW_AT_name ("character(*)!2") 1096 DW_AT_string_length (0x00000064) 1097 0x00000064: DW_TAG_variable 1098 DW_AT_location (DW_OP_fbreg +16) 1099 DW_AT_type (0x00000083 "integer*8") 1100 ... 1101 DW_AT_artificial (true) 1102 1103Debugging information format 1104============================ 1105 1106Debugging Information Extension for Objective C Properties 1107---------------------------------------------------------- 1108 1109Introduction 1110^^^^^^^^^^^^ 1111 1112Objective C provides a simpler way to declare and define accessor methods using 1113declared properties. The language provides features to declare a property and 1114to let compiler synthesize accessor methods. 1115 1116The debugger lets developer inspect Objective C interfaces and their instance 1117variables and class variables. However, the debugger does not know anything 1118about the properties defined in Objective C interfaces. The debugger consumes 1119information generated by compiler in DWARF format. The format does not support 1120encoding of Objective C properties. This proposal describes DWARF extensions to 1121encode Objective C properties, which the debugger can use to let developers 1122inspect Objective C properties. 1123 1124Proposal 1125^^^^^^^^ 1126 1127Objective C properties exist separately from class members. A property can be 1128defined only by "setter" and "getter" selectors, and be calculated anew on each 1129access. Or a property can just be a direct access to some declared ivar. 1130Finally it can have an ivar "automatically synthesized" for it by the compiler, 1131in which case the property can be referred to in user code directly using the 1132standard C dereference syntax as well as through the property "dot" syntax, but 1133there is no entry in the ``@interface`` declaration corresponding to this ivar. 1134 1135To facilitate debugging, these properties we will add a new DWARF TAG into the 1136``DW_TAG_structure_type`` definition for the class to hold the description of a 1137given property, and a set of DWARF attributes that provide said description. 1138The property tag will also contain the name and declared type of the property. 1139 1140If there is a related ivar, there will also be a DWARF property attribute placed 1141in the ``DW_TAG_member`` DIE for that ivar referring back to the property TAG 1142for that property. And in the case where the compiler synthesizes the ivar 1143directly, the compiler is expected to generate a ``DW_TAG_member`` for that 1144ivar (with the ``DW_AT_artificial`` set to 1), whose name will be the name used 1145to access this ivar directly in code, and with the property attribute pointing 1146back to the property it is backing. 1147 1148The following examples will serve as illustration for our discussion: 1149 1150.. code-block:: objc 1151 1152 @interface I1 { 1153 int n2; 1154 } 1155 1156 @property int p1; 1157 @property int p2; 1158 @end 1159 1160 @implementation I1 1161 @synthesize p1; 1162 @synthesize p2 = n2; 1163 @end 1164 1165This produces the following DWARF (this is a "pseudo dwarfdump" output): 1166 1167.. code-block:: none 1168 1169 0x00000100: TAG_structure_type [7] * 1170 AT_APPLE_runtime_class( 0x10 ) 1171 AT_name( "I1" ) 1172 AT_decl_file( "Objc_Property.m" ) 1173 AT_decl_line( 3 ) 1174 1175 0x00000110 TAG_APPLE_property 1176 AT_name ( "p1" ) 1177 AT_type ( {0x00000150} ( int ) ) 1178 1179 0x00000120: TAG_APPLE_property 1180 AT_name ( "p2" ) 1181 AT_type ( {0x00000150} ( int ) ) 1182 1183 0x00000130: TAG_member [8] 1184 AT_name( "_p1" ) 1185 AT_APPLE_property ( {0x00000110} "p1" ) 1186 AT_type( {0x00000150} ( int ) ) 1187 AT_artificial ( 0x1 ) 1188 1189 0x00000140: TAG_member [8] 1190 AT_name( "n2" ) 1191 AT_APPLE_property ( {0x00000120} "p2" ) 1192 AT_type( {0x00000150} ( int ) ) 1193 1194 0x00000150: AT_type( ( int ) ) 1195 1196Note, the current convention is that the name of the ivar for an 1197auto-synthesized property is the name of the property from which it derives 1198with an underscore prepended, as is shown in the example. But we actually 1199don't need to know this convention, since we are given the name of the ivar 1200directly. 1201 1202Also, it is common practice in ObjC to have different property declarations in 1203the @interface and @implementation - e.g. to provide a read-only property in 1204the interface, and a read-write interface in the implementation. In that case, 1205the compiler should emit whichever property declaration will be in force in the 1206current translation unit. 1207 1208Developers can decorate a property with attributes which are encoded using 1209``DW_AT_APPLE_property_attribute``. 1210 1211.. code-block:: objc 1212 1213 @property (readonly, nonatomic) int pr; 1214 1215.. code-block:: none 1216 1217 TAG_APPLE_property [8] 1218 AT_name( "pr" ) 1219 AT_type ( {0x00000147} (int) ) 1220 AT_APPLE_property_attribute (DW_APPLE_PROPERTY_readonly, DW_APPLE_PROPERTY_nonatomic) 1221 1222The setter and getter method names are attached to the property using 1223``DW_AT_APPLE_property_setter`` and ``DW_AT_APPLE_property_getter`` attributes. 1224 1225.. code-block:: objc 1226 1227 @interface I1 1228 @property (setter=myOwnP3Setter:) int p3; 1229 -(void)myOwnP3Setter:(int)a; 1230 @end 1231 1232 @implementation I1 1233 @synthesize p3; 1234 -(void)myOwnP3Setter:(int)a{ } 1235 @end 1236 1237The DWARF for this would be: 1238 1239.. code-block:: none 1240 1241 0x000003bd: TAG_structure_type [7] * 1242 AT_APPLE_runtime_class( 0x10 ) 1243 AT_name( "I1" ) 1244 AT_decl_file( "Objc_Property.m" ) 1245 AT_decl_line( 3 ) 1246 1247 0x000003cd TAG_APPLE_property 1248 AT_name ( "p3" ) 1249 AT_APPLE_property_setter ( "myOwnP3Setter:" ) 1250 AT_type( {0x00000147} ( int ) ) 1251 1252 0x000003f3: TAG_member [8] 1253 AT_name( "_p3" ) 1254 AT_type ( {0x00000147} ( int ) ) 1255 AT_APPLE_property ( {0x000003cd} ) 1256 AT_artificial ( 0x1 ) 1257 1258New DWARF Tags 1259^^^^^^^^^^^^^^ 1260 1261+-----------------------+--------+ 1262| TAG | Value | 1263+=======================+========+ 1264| DW_TAG_APPLE_property | 0x4200 | 1265+-----------------------+--------+ 1266 1267New DWARF Attributes 1268^^^^^^^^^^^^^^^^^^^^ 1269 1270+--------------------------------+--------+-----------+ 1271| Attribute | Value | Classes | 1272+================================+========+===========+ 1273| DW_AT_APPLE_property | 0x3fed | Reference | 1274+--------------------------------+--------+-----------+ 1275| DW_AT_APPLE_property_getter | 0x3fe9 | String | 1276+--------------------------------+--------+-----------+ 1277| DW_AT_APPLE_property_setter | 0x3fea | String | 1278+--------------------------------+--------+-----------+ 1279| DW_AT_APPLE_property_attribute | 0x3feb | Constant | 1280+--------------------------------+--------+-----------+ 1281 1282New DWARF Constants 1283^^^^^^^^^^^^^^^^^^^ 1284 1285+--------------------------------------+-------+ 1286| Name | Value | 1287+======================================+=======+ 1288| DW_APPLE_PROPERTY_readonly | 0x01 | 1289+--------------------------------------+-------+ 1290| DW_APPLE_PROPERTY_getter | 0x02 | 1291+--------------------------------------+-------+ 1292| DW_APPLE_PROPERTY_assign | 0x04 | 1293+--------------------------------------+-------+ 1294| DW_APPLE_PROPERTY_readwrite | 0x08 | 1295+--------------------------------------+-------+ 1296| DW_APPLE_PROPERTY_retain | 0x10 | 1297+--------------------------------------+-------+ 1298| DW_APPLE_PROPERTY_copy | 0x20 | 1299+--------------------------------------+-------+ 1300| DW_APPLE_PROPERTY_nonatomic | 0x40 | 1301+--------------------------------------+-------+ 1302| DW_APPLE_PROPERTY_setter | 0x80 | 1303+--------------------------------------+-------+ 1304| DW_APPLE_PROPERTY_atomic | 0x100 | 1305+--------------------------------------+-------+ 1306| DW_APPLE_PROPERTY_weak | 0x200 | 1307+--------------------------------------+-------+ 1308| DW_APPLE_PROPERTY_strong | 0x400 | 1309+--------------------------------------+-------+ 1310| DW_APPLE_PROPERTY_unsafe_unretained | 0x800 | 1311+--------------------------------------+-------+ 1312| DW_APPLE_PROPERTY_nullability | 0x1000| 1313+--------------------------------------+-------+ 1314| DW_APPLE_PROPERTY_null_resettable | 0x2000| 1315+--------------------------------------+-------+ 1316| DW_APPLE_PROPERTY_class | 0x4000| 1317+--------------------------------------+-------+ 1318 1319Name Accelerator Tables 1320----------------------- 1321 1322Introduction 1323^^^^^^^^^^^^ 1324 1325The "``.debug_pubnames``" and "``.debug_pubtypes``" formats are not what a 1326debugger needs. The "``pub``" in the section name indicates that the entries 1327in the table are publicly visible names only. This means no static or hidden 1328functions show up in the "``.debug_pubnames``". No static variables or private 1329class variables are in the "``.debug_pubtypes``". Many compilers add different 1330things to these tables, so we can't rely upon the contents between gcc, icc, or 1331clang. 1332 1333The typical query given by users tends not to match up with the contents of 1334these tables. For example, the DWARF spec states that "In the case of the name 1335of a function member or static data member of a C++ structure, class or union, 1336the name presented in the "``.debug_pubnames``" section is not the simple name 1337given by the ``DW_AT_name attribute`` of the referenced debugging information 1338entry, but rather the fully qualified name of the data or function member." 1339So the only names in these tables for complex C++ entries is a fully 1340qualified name. Debugger users tend not to enter their search strings as 1341"``a::b::c(int,const Foo&) const``", but rather as "``c``", "``b::c``" , or 1342"``a::b::c``". So the name entered in the name table must be demangled in 1343order to chop it up appropriately and additional names must be manually entered 1344into the table to make it effective as a name lookup table for debuggers to 1345use. 1346 1347All debuggers currently ignore the "``.debug_pubnames``" table as a result of 1348its inconsistent and useless public-only name content making it a waste of 1349space in the object file. These tables, when they are written to disk, are not 1350sorted in any way, leaving every debugger to do its own parsing and sorting. 1351These tables also include an inlined copy of the string values in the table 1352itself making the tables much larger than they need to be on disk, especially 1353for large C++ programs. 1354 1355Can't we just fix the sections by adding all of the names we need to this 1356table? No, because that is not what the tables are defined to contain and we 1357won't know the difference between the old bad tables and the new good tables. 1358At best we could make our own renamed sections that contain all of the data we 1359need. 1360 1361These tables are also insufficient for what a debugger like LLDB needs. LLDB 1362uses clang for its expression parsing where LLDB acts as a PCH. LLDB is then 1363often asked to look for type "``foo``" or namespace "``bar``", or list items in 1364namespace "``baz``". Namespaces are not included in the pubnames or pubtypes 1365tables. Since clang asks a lot of questions when it is parsing an expression, 1366we need to be very fast when looking up names, as it happens a lot. Having new 1367accelerator tables that are optimized for very quick lookups will benefit this 1368type of debugging experience greatly. 1369 1370We would like to generate name lookup tables that can be mapped into memory 1371from disk, and used as is, with little or no up-front parsing. We would also 1372be able to control the exact content of these different tables so they contain 1373exactly what we need. The Name Accelerator Tables were designed to fix these 1374issues. In order to solve these issues we need to: 1375 1376* Have a format that can be mapped into memory from disk and used as is 1377* Lookups should be very fast 1378* Extensible table format so these tables can be made by many producers 1379* Contain all of the names needed for typical lookups out of the box 1380* Strict rules for the contents of tables 1381 1382Table size is important and the accelerator table format should allow the reuse 1383of strings from common string tables so the strings for the names are not 1384duplicated. We also want to make sure the table is ready to be used as-is by 1385simply mapping the table into memory with minimal header parsing. 1386 1387The name lookups need to be fast and optimized for the kinds of lookups that 1388debuggers tend to do. Optimally we would like to touch as few parts of the 1389mapped table as possible when doing a name lookup and be able to quickly find 1390the name entry we are looking for, or discover there are no matches. In the 1391case of debuggers we optimized for lookups that fail most of the time. 1392 1393Each table that is defined should have strict rules on exactly what is in the 1394accelerator tables and documented so clients can rely on the content. 1395 1396Hash Tables 1397^^^^^^^^^^^ 1398 1399Standard Hash Tables 1400"""""""""""""""""""" 1401 1402Typical hash tables have a header, buckets, and each bucket points to the 1403bucket contents: 1404 1405.. code-block:: none 1406 1407 .------------. 1408 | HEADER | 1409 |------------| 1410 | BUCKETS | 1411 |------------| 1412 | DATA | 1413 `------------' 1414 1415The BUCKETS are an array of offsets to DATA for each hash: 1416 1417.. code-block:: none 1418 1419 .------------. 1420 | 0x00001000 | BUCKETS[0] 1421 | 0x00002000 | BUCKETS[1] 1422 | 0x00002200 | BUCKETS[2] 1423 | 0x000034f0 | BUCKETS[3] 1424 | | ... 1425 | 0xXXXXXXXX | BUCKETS[n_buckets] 1426 '------------' 1427 1428So for ``bucket[3]`` in the example above, we have an offset into the table 14290x000034f0 which points to a chain of entries for the bucket. Each bucket must 1430contain a next pointer, full 32 bit hash value, the string itself, and the data 1431for the current string value. 1432 1433.. code-block:: none 1434 1435 .------------. 1436 0x000034f0: | 0x00003500 | next pointer 1437 | 0x12345678 | 32 bit hash 1438 | "erase" | string value 1439 | data[n] | HashData for this bucket 1440 |------------| 1441 0x00003500: | 0x00003550 | next pointer 1442 | 0x29273623 | 32 bit hash 1443 | "dump" | string value 1444 | data[n] | HashData for this bucket 1445 |------------| 1446 0x00003550: | 0x00000000 | next pointer 1447 | 0x82638293 | 32 bit hash 1448 | "main" | string value 1449 | data[n] | HashData for this bucket 1450 `------------' 1451 1452The problem with this layout for debuggers is that we need to optimize for the 1453negative lookup case where the symbol we're searching for is not present. So 1454if we were to lookup "``printf``" in the table above, we would make a 32-bit 1455hash for "``printf``", it might match ``bucket[3]``. We would need to go to 1456the offset 0x000034f0 and start looking to see if our 32 bit hash matches. To 1457do so, we need to read the next pointer, then read the hash, compare it, and 1458skip to the next bucket. Each time we are skipping many bytes in memory and 1459touching new pages just to do the compare on the full 32 bit hash. All of 1460these accesses then tell us that we didn't have a match. 1461 1462Name Hash Tables 1463"""""""""""""""" 1464 1465To solve the issues mentioned above we have structured the hash tables a bit 1466differently: a header, buckets, an array of all unique 32 bit hash values, 1467followed by an array of hash value data offsets, one for each hash value, then 1468the data for all hash values: 1469 1470.. code-block:: none 1471 1472 .-------------. 1473 | HEADER | 1474 |-------------| 1475 | BUCKETS | 1476 |-------------| 1477 | HASHES | 1478 |-------------| 1479 | OFFSETS | 1480 |-------------| 1481 | DATA | 1482 `-------------' 1483 1484The ``BUCKETS`` in the name tables are an index into the ``HASHES`` array. By 1485making all of the full 32 bit hash values contiguous in memory, we allow 1486ourselves to efficiently check for a match while touching as little memory as 1487possible. Most often checking the 32 bit hash values is as far as the lookup 1488goes. If it does match, it usually is a match with no collisions. So for a 1489table with "``n_buckets``" buckets, and "``n_hashes``" unique 32 bit hash 1490values, we can clarify the contents of the ``BUCKETS``, ``HASHES`` and 1491``OFFSETS`` as: 1492 1493.. code-block:: none 1494 1495 .-------------------------. 1496 | HEADER.magic | uint32_t 1497 | HEADER.version | uint16_t 1498 | HEADER.hash_function | uint16_t 1499 | HEADER.bucket_count | uint32_t 1500 | HEADER.hashes_count | uint32_t 1501 | HEADER.header_data_len | uint32_t 1502 | HEADER_DATA | HeaderData 1503 |-------------------------| 1504 | BUCKETS | uint32_t[n_buckets] // 32 bit hash indexes 1505 |-------------------------| 1506 | HASHES | uint32_t[n_hashes] // 32 bit hash values 1507 |-------------------------| 1508 | OFFSETS | uint32_t[n_hashes] // 32 bit offsets to hash value data 1509 |-------------------------| 1510 | ALL HASH DATA | 1511 `-------------------------' 1512 1513So taking the exact same data from the standard hash example above we end up 1514with: 1515 1516.. code-block:: none 1517 1518 .------------. 1519 | HEADER | 1520 |------------| 1521 | 0 | BUCKETS[0] 1522 | 2 | BUCKETS[1] 1523 | 5 | BUCKETS[2] 1524 | 6 | BUCKETS[3] 1525 | | ... 1526 | ... | BUCKETS[n_buckets] 1527 |------------| 1528 | 0x........ | HASHES[0] 1529 | 0x........ | HASHES[1] 1530 | 0x........ | HASHES[2] 1531 | 0x........ | HASHES[3] 1532 | 0x........ | HASHES[4] 1533 | 0x........ | HASHES[5] 1534 | 0x12345678 | HASHES[6] hash for BUCKETS[3] 1535 | 0x29273623 | HASHES[7] hash for BUCKETS[3] 1536 | 0x82638293 | HASHES[8] hash for BUCKETS[3] 1537 | 0x........ | HASHES[9] 1538 | 0x........ | HASHES[10] 1539 | 0x........ | HASHES[11] 1540 | 0x........ | HASHES[12] 1541 | 0x........ | HASHES[13] 1542 | 0x........ | HASHES[n_hashes] 1543 |------------| 1544 | 0x........ | OFFSETS[0] 1545 | 0x........ | OFFSETS[1] 1546 | 0x........ | OFFSETS[2] 1547 | 0x........ | OFFSETS[3] 1548 | 0x........ | OFFSETS[4] 1549 | 0x........ | OFFSETS[5] 1550 | 0x000034f0 | OFFSETS[6] offset for BUCKETS[3] 1551 | 0x00003500 | OFFSETS[7] offset for BUCKETS[3] 1552 | 0x00003550 | OFFSETS[8] offset for BUCKETS[3] 1553 | 0x........ | OFFSETS[9] 1554 | 0x........ | OFFSETS[10] 1555 | 0x........ | OFFSETS[11] 1556 | 0x........ | OFFSETS[12] 1557 | 0x........ | OFFSETS[13] 1558 | 0x........ | OFFSETS[n_hashes] 1559 |------------| 1560 | | 1561 | | 1562 | | 1563 | | 1564 | | 1565 |------------| 1566 0x000034f0: | 0x00001203 | .debug_str ("erase") 1567 | 0x00000004 | A 32 bit array count - number of HashData with name "erase" 1568 | 0x........ | HashData[0] 1569 | 0x........ | HashData[1] 1570 | 0x........ | HashData[2] 1571 | 0x........ | HashData[3] 1572 | 0x00000000 | String offset into .debug_str (terminate data for hash) 1573 |------------| 1574 0x00003500: | 0x00001203 | String offset into .debug_str ("collision") 1575 | 0x00000002 | A 32 bit array count - number of HashData with name "collision" 1576 | 0x........ | HashData[0] 1577 | 0x........ | HashData[1] 1578 | 0x00001203 | String offset into .debug_str ("dump") 1579 | 0x00000003 | A 32 bit array count - number of HashData with name "dump" 1580 | 0x........ | HashData[0] 1581 | 0x........ | HashData[1] 1582 | 0x........ | HashData[2] 1583 | 0x00000000 | String offset into .debug_str (terminate data for hash) 1584 |------------| 1585 0x00003550: | 0x00001203 | String offset into .debug_str ("main") 1586 | 0x00000009 | A 32 bit array count - number of HashData with name "main" 1587 | 0x........ | HashData[0] 1588 | 0x........ | HashData[1] 1589 | 0x........ | HashData[2] 1590 | 0x........ | HashData[3] 1591 | 0x........ | HashData[4] 1592 | 0x........ | HashData[5] 1593 | 0x........ | HashData[6] 1594 | 0x........ | HashData[7] 1595 | 0x........ | HashData[8] 1596 | 0x00000000 | String offset into .debug_str (terminate data for hash) 1597 `------------' 1598 1599So we still have all of the same data, we just organize it more efficiently for 1600debugger lookup. If we repeat the same "``printf``" lookup from above, we 1601would hash "``printf``" and find it matches ``BUCKETS[3]`` by taking the 32 bit 1602hash value and modulo it by ``n_buckets``. ``BUCKETS[3]`` contains "6" which 1603is the index into the ``HASHES`` table. We would then compare any consecutive 160432 bit hashes values in the ``HASHES`` array as long as the hashes would be in 1605``BUCKETS[3]``. We do this by verifying that each subsequent hash value modulo 1606``n_buckets`` is still 3. In the case of a failed lookup we would access the 1607memory for ``BUCKETS[3]``, and then compare a few consecutive 32 bit hashes 1608before we know that we have no match. We don't end up marching through 1609multiple words of memory and we really keep the number of processor data cache 1610lines being accessed as small as possible. 1611 1612The string hash that is used for these lookup tables is the Daniel J. 1613Bernstein hash which is also used in the ELF ``GNU_HASH`` sections. It is a 1614very good hash for all kinds of names in programs with very few hash 1615collisions. 1616 1617Empty buckets are designated by using an invalid hash index of ``UINT32_MAX``. 1618 1619Details 1620^^^^^^^ 1621 1622These name hash tables are designed to be generic where specializations of the 1623table get to define additional data that goes into the header ("``HeaderData``"), 1624how the string value is stored ("``KeyType``") and the content of the data for each 1625hash value. 1626 1627Header Layout 1628""""""""""""" 1629 1630The header has a fixed part, and the specialized part. The exact format of the 1631header is: 1632 1633.. code-block:: c 1634 1635 struct Header 1636 { 1637 uint32_t magic; // 'HASH' magic value to allow endian detection 1638 uint16_t version; // Version number 1639 uint16_t hash_function; // The hash function enumeration that was used 1640 uint32_t bucket_count; // The number of buckets in this hash table 1641 uint32_t hashes_count; // The total number of unique hash values and hash data offsets in this table 1642 uint32_t header_data_len; // The bytes to skip to get to the hash indexes (buckets) for correct alignment 1643 // Specifically the length of the following HeaderData field - this does not 1644 // include the size of the preceding fields 1645 HeaderData header_data; // Implementation specific header data 1646 }; 1647 1648The header starts with a 32 bit "``magic``" value which must be ``'HASH'`` 1649encoded as an ASCII integer. This allows the detection of the start of the 1650hash table and also allows the table's byte order to be determined so the table 1651can be correctly extracted. The "``magic``" value is followed by a 16 bit 1652``version`` number which allows the table to be revised and modified in the 1653future. The current version number is 1. ``hash_function`` is a ``uint16_t`` 1654enumeration that specifies which hash function was used to produce this table. 1655The current values for the hash function enumerations include: 1656 1657.. code-block:: c 1658 1659 enum HashFunctionType 1660 { 1661 eHashFunctionDJB = 0u, // Daniel J Bernstein hash function 1662 }; 1663 1664``bucket_count`` is a 32 bit unsigned integer that represents how many buckets 1665are in the ``BUCKETS`` array. ``hashes_count`` is the number of unique 32 bit 1666hash values that are in the ``HASHES`` array, and is the same number of offsets 1667are contained in the ``OFFSETS`` array. ``header_data_len`` specifies the size 1668in bytes of the ``HeaderData`` that is filled in by specialized versions of 1669this table. 1670 1671Fixed Lookup 1672"""""""""""" 1673 1674The header is followed by the buckets, hashes, offsets, and hash value data. 1675 1676.. code-block:: c 1677 1678 struct FixedTable 1679 { 1680 uint32_t buckets[Header.bucket_count]; // An array of hash indexes into the "hashes[]" array below 1681 uint32_t hashes [Header.hashes_count]; // Every unique 32 bit hash for the entire table is in this table 1682 uint32_t offsets[Header.hashes_count]; // An offset that corresponds to each item in the "hashes[]" array above 1683 }; 1684 1685``buckets`` is an array of 32 bit indexes into the ``hashes`` array. The 1686``hashes`` array contains all of the 32 bit hash values for all names in the 1687hash table. Each hash in the ``hashes`` table has an offset in the ``offsets`` 1688array that points to the data for the hash value. 1689 1690This table setup makes it very easy to repurpose these tables to contain 1691different data, while keeping the lookup mechanism the same for all tables. 1692This layout also makes it possible to save the table to disk and map it in 1693later and do very efficient name lookups with little or no parsing. 1694 1695DWARF lookup tables can be implemented in a variety of ways and can store a lot 1696of information for each name. We want to make the DWARF tables extensible and 1697able to store the data efficiently so we have used some of the DWARF features 1698that enable efficient data storage to define exactly what kind of data we store 1699for each name. 1700 1701The ``HeaderData`` contains a definition of the contents of each HashData chunk. 1702We might want to store an offset to all of the debug information entries (DIEs) 1703for each name. To keep things extensible, we create a list of items, or 1704Atoms, that are contained in the data for each name. First comes the type of 1705the data in each atom: 1706 1707.. code-block:: c 1708 1709 enum AtomType 1710 { 1711 eAtomTypeNULL = 0u, 1712 eAtomTypeDIEOffset = 1u, // DIE offset, check form for encoding 1713 eAtomTypeCUOffset = 2u, // DIE offset of the compiler unit header that contains the item in question 1714 eAtomTypeTag = 3u, // DW_TAG_xxx value, should be encoded as DW_FORM_data1 (if no tags exceed 255) or DW_FORM_data2 1715 eAtomTypeNameFlags = 4u, // Flags from enum NameFlags 1716 eAtomTypeTypeFlags = 5u, // Flags from enum TypeFlags 1717 }; 1718 1719The enumeration values and their meanings are: 1720 1721.. code-block:: none 1722 1723 eAtomTypeNULL - a termination atom that specifies the end of the atom list 1724 eAtomTypeDIEOffset - an offset into the .debug_info section for the DWARF DIE for this name 1725 eAtomTypeCUOffset - an offset into the .debug_info section for the CU that contains the DIE 1726 eAtomTypeDIETag - The DW_TAG_XXX enumeration value so you don't have to parse the DWARF to see what it is 1727 eAtomTypeNameFlags - Flags for functions and global variables (isFunction, isInlined, isExternal...) 1728 eAtomTypeTypeFlags - Flags for types (isCXXClass, isObjCClass, ...) 1729 1730Then we allow each atom type to define the atom type and how the data for each 1731atom type data is encoded: 1732 1733.. code-block:: c 1734 1735 struct Atom 1736 { 1737 uint16_t type; // AtomType enum value 1738 uint16_t form; // DWARF DW_FORM_XXX defines 1739 }; 1740 1741The ``form`` type above is from the DWARF specification and defines the exact 1742encoding of the data for the Atom type. See the DWARF specification for the 1743``DW_FORM_`` definitions. 1744 1745.. code-block:: c 1746 1747 struct HeaderData 1748 { 1749 uint32_t die_offset_base; 1750 uint32_t atom_count; 1751 Atoms atoms[atom_count0]; 1752 }; 1753 1754``HeaderData`` defines the base DIE offset that should be added to any atoms 1755that are encoded using the ``DW_FORM_ref1``, ``DW_FORM_ref2``, 1756``DW_FORM_ref4``, ``DW_FORM_ref8`` or ``DW_FORM_ref_udata``. It also defines 1757what is contained in each ``HashData`` object -- ``Atom.form`` tells us how large 1758each field will be in the ``HashData`` and the ``Atom.type`` tells us how this data 1759should be interpreted. 1760 1761For the current implementations of the "``.apple_names``" (all functions + 1762globals), the "``.apple_types``" (names of all types that are defined), and 1763the "``.apple_namespaces``" (all namespaces), we currently set the ``Atom`` 1764array to be: 1765 1766.. code-block:: c 1767 1768 HeaderData.atom_count = 1; 1769 HeaderData.atoms[0].type = eAtomTypeDIEOffset; 1770 HeaderData.atoms[0].form = DW_FORM_data4; 1771 1772This defines the contents to be the DIE offset (eAtomTypeDIEOffset) that is 1773encoded as a 32 bit value (DW_FORM_data4). This allows a single name to have 1774multiple matching DIEs in a single file, which could come up with an inlined 1775function for instance. Future tables could include more information about the 1776DIE such as flags indicating if the DIE is a function, method, block, 1777or inlined. 1778 1779The KeyType for the DWARF table is a 32 bit string table offset into the 1780".debug_str" table. The ".debug_str" is the string table for the DWARF which 1781may already contain copies of all of the strings. This helps make sure, with 1782help from the compiler, that we reuse the strings between all of the DWARF 1783sections and keeps the hash table size down. Another benefit to having the 1784compiler generate all strings as DW_FORM_strp in the debug info, is that 1785DWARF parsing can be made much faster. 1786 1787After a lookup is made, we get an offset into the hash data. The hash data 1788needs to be able to deal with 32 bit hash collisions, so the chunk of data 1789at the offset in the hash data consists of a triple: 1790 1791.. code-block:: c 1792 1793 uint32_t str_offset 1794 uint32_t hash_data_count 1795 HashData[hash_data_count] 1796 1797If "str_offset" is zero, then the bucket contents are done. 99.9% of the 1798hash data chunks contain a single item (no 32 bit hash collision): 1799 1800.. code-block:: none 1801 1802 .------------. 1803 | 0x00001023 | uint32_t KeyType (.debug_str[0x0001023] => "main") 1804 | 0x00000004 | uint32_t HashData count 1805 | 0x........ | uint32_t HashData[0] DIE offset 1806 | 0x........ | uint32_t HashData[1] DIE offset 1807 | 0x........ | uint32_t HashData[2] DIE offset 1808 | 0x........ | uint32_t HashData[3] DIE offset 1809 | 0x00000000 | uint32_t KeyType (end of hash chain) 1810 `------------' 1811 1812If there are collisions, you will have multiple valid string offsets: 1813 1814.. code-block:: none 1815 1816 .------------. 1817 | 0x00001023 | uint32_t KeyType (.debug_str[0x0001023] => "main") 1818 | 0x00000004 | uint32_t HashData count 1819 | 0x........ | uint32_t HashData[0] DIE offset 1820 | 0x........ | uint32_t HashData[1] DIE offset 1821 | 0x........ | uint32_t HashData[2] DIE offset 1822 | 0x........ | uint32_t HashData[3] DIE offset 1823 | 0x00002023 | uint32_t KeyType (.debug_str[0x0002023] => "print") 1824 | 0x00000002 | uint32_t HashData count 1825 | 0x........ | uint32_t HashData[0] DIE offset 1826 | 0x........ | uint32_t HashData[1] DIE offset 1827 | 0x00000000 | uint32_t KeyType (end of hash chain) 1828 `------------' 1829 1830Current testing with real world C++ binaries has shown that there is around 1 183132 bit hash collision per 100,000 name entries. 1832 1833Contents 1834^^^^^^^^ 1835 1836As we said, we want to strictly define exactly what is included in the 1837different tables. For DWARF, we have 3 tables: "``.apple_names``", 1838"``.apple_types``", and "``.apple_namespaces``". 1839 1840"``.apple_names``" sections should contain an entry for each DWARF DIE whose 1841``DW_TAG`` is a ``DW_TAG_label``, ``DW_TAG_inlined_subroutine``, or 1842``DW_TAG_subprogram`` that has address attributes: ``DW_AT_low_pc``, 1843``DW_AT_high_pc``, ``DW_AT_ranges`` or ``DW_AT_entry_pc``. It also contains 1844``DW_TAG_variable`` DIEs that have a ``DW_OP_addr`` in the location (global and 1845static variables). All global and static variables should be included, 1846including those scoped within functions and classes. For example using the 1847following code: 1848 1849.. code-block:: c 1850 1851 static int var = 0; 1852 1853 void f () 1854 { 1855 static int var = 0; 1856 } 1857 1858Both of the static ``var`` variables would be included in the table. All 1859functions should emit both their full names and their basenames. For C or C++, 1860the full name is the mangled name (if available) which is usually in the 1861``DW_AT_MIPS_linkage_name`` attribute, and the ``DW_AT_name`` contains the 1862function basename. If global or static variables have a mangled name in a 1863``DW_AT_MIPS_linkage_name`` attribute, this should be emitted along with the 1864simple name found in the ``DW_AT_name`` attribute. 1865 1866"``.apple_types``" sections should contain an entry for each DWARF DIE whose 1867tag is one of: 1868 1869* DW_TAG_array_type 1870* DW_TAG_class_type 1871* DW_TAG_enumeration_type 1872* DW_TAG_pointer_type 1873* DW_TAG_reference_type 1874* DW_TAG_string_type 1875* DW_TAG_structure_type 1876* DW_TAG_subroutine_type 1877* DW_TAG_typedef 1878* DW_TAG_union_type 1879* DW_TAG_ptr_to_member_type 1880* DW_TAG_set_type 1881* DW_TAG_subrange_type 1882* DW_TAG_base_type 1883* DW_TAG_const_type 1884* DW_TAG_file_type 1885* DW_TAG_namelist 1886* DW_TAG_packed_type 1887* DW_TAG_volatile_type 1888* DW_TAG_restrict_type 1889* DW_TAG_atomic_type 1890* DW_TAG_interface_type 1891* DW_TAG_unspecified_type 1892* DW_TAG_shared_type 1893 1894Only entries with a ``DW_AT_name`` attribute are included, and the entry must 1895not be a forward declaration (``DW_AT_declaration`` attribute with a non-zero 1896value). For example, using the following code: 1897 1898.. code-block:: c 1899 1900 int main () 1901 { 1902 int *b = 0; 1903 return *b; 1904 } 1905 1906We get a few type DIEs: 1907 1908.. code-block:: none 1909 1910 0x00000067: TAG_base_type [5] 1911 AT_encoding( DW_ATE_signed ) 1912 AT_name( "int" ) 1913 AT_byte_size( 0x04 ) 1914 1915 0x0000006e: TAG_pointer_type [6] 1916 AT_type( {0x00000067} ( int ) ) 1917 AT_byte_size( 0x08 ) 1918 1919The DW_TAG_pointer_type is not included because it does not have a ``DW_AT_name``. 1920 1921"``.apple_namespaces``" section should contain all ``DW_TAG_namespace`` DIEs. 1922If we run into a namespace that has no name this is an anonymous namespace, and 1923the name should be output as "``(anonymous namespace)``" (without the quotes). 1924Why? This matches the output of the ``abi::cxa_demangle()`` that is in the 1925standard C++ library that demangles mangled names. 1926 1927 1928Language Extensions and File Format Changes 1929^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ 1930 1931Objective-C Extensions 1932"""""""""""""""""""""" 1933 1934"``.apple_objc``" section should contain all ``DW_TAG_subprogram`` DIEs for an 1935Objective-C class. The name used in the hash table is the name of the 1936Objective-C class itself. If the Objective-C class has a category, then an 1937entry is made for both the class name without the category, and for the class 1938name with the category. So if we have a DIE at offset 0x1234 with a name of 1939method "``-[NSString(my_additions) stringWithSpecialString:]``", we would add 1940an entry for "``NSString``" that points to DIE 0x1234, and an entry for 1941"``NSString(my_additions)``" that points to 0x1234. This allows us to quickly 1942track down all Objective-C methods for an Objective-C class when doing 1943expressions. It is needed because of the dynamic nature of Objective-C where 1944anyone can add methods to a class. The DWARF for Objective-C methods is also 1945emitted differently from C++ classes where the methods are not usually 1946contained in the class definition, they are scattered about across one or more 1947compile units. Categories can also be defined in different shared libraries. 1948So we need to be able to quickly find all of the methods and class functions 1949given the Objective-C class name, or quickly find all methods and class 1950functions for a class + category name. This table does not contain any 1951selector names, it just maps Objective-C class names (or class names + 1952category) to all of the methods and class functions. The selectors are added 1953as function basenames in the "``.debug_names``" section. 1954 1955In the "``.apple_names``" section for Objective-C functions, the full name is 1956the entire function name with the brackets ("``-[NSString 1957stringWithCString:]``") and the basename is the selector only 1958("``stringWithCString:``"). 1959 1960Mach-O Changes 1961"""""""""""""" 1962 1963The sections names for the apple hash tables are for non-mach-o files. For 1964mach-o files, the sections should be contained in the ``__DWARF`` segment with 1965names as follows: 1966 1967* "``.apple_names``" -> "``__apple_names``" 1968* "``.apple_types``" -> "``__apple_types``" 1969* "``.apple_namespaces``" -> "``__apple_namespac``" (16 character limit) 1970* "``.apple_objc``" -> "``__apple_objc``" 1971 1972.. _codeview: 1973 1974CodeView Debug Info Format 1975========================== 1976 1977LLVM supports emitting CodeView, the Microsoft debug info format, and this 1978section describes the design and implementation of that support. 1979 1980Format Background 1981----------------- 1982 1983CodeView as a format is clearly oriented around C++ debugging, and in C++, the 1984majority of debug information tends to be type information. Therefore, the 1985overriding design constraint of CodeView is the separation of type information 1986from other "symbol" information so that type information can be efficiently 1987merged across translation units. Both type information and symbol information is 1988generally stored as a sequence of records, where each record begins with a 198916-bit record size and a 16-bit record kind. 1990 1991Type information is usually stored in the ``.debug$T`` section of the object 1992file. All other debug info, such as line info, string table, symbol info, and 1993inlinee info, is stored in one or more ``.debug$S`` sections. There may only be 1994one ``.debug$T`` section per object file, since all other debug info refers to 1995it. If a PDB (enabled by the ``/Zi`` MSVC option) was used during compilation, 1996the ``.debug$T`` section will contain only an ``LF_TYPESERVER2`` record pointing 1997to the PDB. When using PDBs, symbol information appears to remain in the object 1998file ``.debug$S`` sections. 1999 2000Type records are referred to by their index, which is the number of records in 2001the stream before a given record plus ``0x1000``. Many common basic types, such 2002as the basic integral types and unqualified pointers to them, are represented 2003using type indices less than ``0x1000``. Such basic types are built in to 2004CodeView consumers and do not require type records. 2005 2006Each type record may only contain type indices that are less than its own type 2007index. This ensures that the graph of type stream references is acyclic. While 2008the source-level type graph may contain cycles through pointer types (consider a 2009linked list struct), these cycles are removed from the type stream by always 2010referring to the forward declaration record of user-defined record types. Only 2011"symbol" records in the ``.debug$S`` streams may refer to complete, 2012non-forward-declaration type records. 2013 2014Working with CodeView 2015--------------------- 2016 2017These are instructions for some common tasks for developers working to improve 2018LLVM's CodeView support. Most of them revolve around using the CodeView dumper 2019embedded in ``llvm-readobj``. 2020 2021* Testing MSVC's output:: 2022 2023 $ cl -c -Z7 foo.cpp # Use /Z7 to keep types in the object file 2024 $ llvm-readobj --codeview foo.obj 2025 2026* Getting LLVM IR debug info out of Clang:: 2027 2028 $ clang -g -gcodeview --target=x86_64-windows-msvc foo.cpp -S -emit-llvm 2029 2030 Use this to generate LLVM IR for LLVM test cases. 2031 2032* Generate and dump CodeView from LLVM IR metadata:: 2033 2034 $ llc foo.ll -filetype=obj -o foo.obj 2035 $ llvm-readobj --codeview foo.obj > foo.txt 2036 2037 Use this pattern in lit test cases and FileCheck the output of llvm-readobj 2038 2039Improving LLVM's CodeView support is a process of finding interesting type 2040records, constructing a C++ test case that makes MSVC emit those records, 2041dumping the records, understanding them, and then generating equivalent records 2042in LLVM's backend. 2043