Computer Systems: A Programmer's Perspective (3rd Edition)
Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
Question
Book Icon
Chapter 7.5, Problem 7.1PP
Program Plan Intro

Sections in relocatable object files:

There are many sections in a relocatable object file. They are given below:

  • “.text”:
    • It is the machine code of the compiled program.
  • “.rodata”:
    • This section is used to read only the data in the format such as
      • Strings in “printf” statements.
      • Jump tables for switch statements.
  • “.data”:
    • This section is used in the initialized “C” variables of global variable and static “C” variables.
    • Local “C” variables are initialized at execution time on the stack.
      • It does not show in either the “.data” or “.bss” sections.
  • “.bss”:
    • It is used in the uninitialized global and static “C” variables, along with any global or static variables that are assigned to zero.
  • “.symtab”:
    • It is a symbol table.
    • It contains the information about functions and global variables that are defined and referenced in the program.
  • “.rel.text”:
    • This section contains a list of locations in the “.text” section.
      • It will require to be changed once the linker merges this object file with others.
  • “.rel.data”:
    • This section contains relocation information for any global variables that are referenced or defined by the module.
  • “.debug”:
    • It is a symbol table for debugging
    • It contains entries for following
      • Definition of Local variables, global variables and typedefs variables and original “C” source file.
  • “.line”:
    • It is a mapping between line numbers in the given program
      • That is in original “C” source program and machine code instructions in the “.text” section.
  • “.strtab”:
    • It is a string table.
      • It contains symbol tables in the “.symtab” and “.debug” sections.
      • It is the table for section names in the section headers.

Blurred answer
Students have asked these similar questions
Dijkstra's Algorithm (part 1).  Consider the network shown below, and Dijkstra’s link-state algorithm. Here, we are interested in computing the least cost path from node E (note: the start node here is E) to all other nodes using Dijkstra's algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the "Step 0" row in the table below showing the link state algorithm’s execution by matching the table entries (i), (ii), (iii), and (iv) with their values.  Write down your final [correct] answer, as you‘ll need it for the next question.
4. |z + 5 - 5i| = 7
14. dz, C: |z❘ C: |z❘ = 0.6 ze² - 2iz H
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage