The Art of Assembly Language, 2nd Edition

Name: The Art of Assembly Language, 2nd Edition
Brand: No Starch Press
Price: 46.99 EUR
Availability: OnlineOnly

Randall Hyde(Autor*in)

No Starch Press

Erschienen am 1. März 2010

760 Seiten

E-Book

ePUB ohne DRM

Systemvoraussetzungen

978-1-59327-301-9 (ISBN)

46,99 €inkl. 7% MwSt.

Systemvoraussetzungen

für ePUB ohne DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Person

Inhalt

Intro
The Art of Assembly Language
PRAISE FOR THE FIRST EDITION OF THE ART OF ASSEMBLY LANGUAGE
ACKNOWLEDGMENTS
First Edition
Second Edition
1. HELLO, WORLD OF ASSEMBLY LANGUAGE
1.1 The Anatomy of an HLA Program
1.2 Running Your First HLA Program
1.3 Some Basic HLA Data Declarations
1.4 Boolean Values
1.5 Character Values
1.6 An Introduction to the Intel 80x86 CPU Family
1.7 The Memory Subsystem
1.8 Some Basic Machine Instructions
1.9 Some Basic HLA Control Structures
1.9.1 Boolean Expressions in HLA Statements
1.9.2 The HLA if..then..elseif..else..endif Statement
1.9.3 Conjunction, Disjunction, and Negation in Boolean Expressions
1.9.4 The while..endwhile Statement
1.9.5 The for..endfor Statement
1.9.6 The repeat..until Statement
1.9.7 The break and breakif Statements
1.9.8 The forever..endfor Statement
1.9.9 The try..exception..endtry Statement
1.10 Introduction to the HLA Standard Library
1.10.1 Predefined Constants in the stdio Module
1.10.2 Standard In and Standard Out
1.10.3 The stdout.newln Routine
1.10.4 The stdout.putiX Routines
1.10.5 The stdout.putiXSize Routines
1.10.6 The stdout.put Routine
1.10.7 The stdin.getc Routine
1.10.8 The stdin.geti X Routines
1.10.9 The stdin.readLn and stdin.flushInput Routines
1.10.10 The stdin.get Routine
1.11 Additional Details About try..endtry
1.11.1 Nesting try..endtry Statements
1.11.2 The unprotected Clause in a try..endtry Statement
1.11.3 The anyexception Clause in a try..endtry Statement
1.11.4 Registers and the try..endtry Statement
1.12 High-Level Assembly Language vs. Low-Level Assembly Language
1.13 For More Information
2. DATA REPRESENTATION
2.1 Numbering Systems
2.1.1 A Review of the Decimal System
2.1.2 The Binary Numbering System
2.1.3 Binary Formats
2.2 The Hexadecimal Numbering System
2.3 Data Organization
2.3.1 Bits
2.3.2 Nibbles
2.3.3 Bytes
2.3.4 Words
2.3.5 Double Words
2.3.6 Quad Words and Long Words
2.4 Arithmetic Operations on Binary and Hexadecimal Numbers
2.5 A Note About Numbers vs. Representation
2.6 Logical Operations on Bits
2.7 Logical Operations on Binary Numbers and Bit Strings
2.8 Signed and Unsigned Numbers
2.9 Sign Extension, Zero Extension, Contraction, and Saturation
2.10 Shifts and Rotates
2.11 Bit Fields and Packed Data
2.12 An Introduction to Floating-Point Arithmetic
2.12.1 IEEE Floating-Point Formats
2.12.2 HLA Support for Floating-Point Values
2.13 Binary-Coded Decimal Representation
2.14 Characters
2.14.1 The ASCII Character Encoding
2.14.2 HLA Support for ASCII Characters
2.15 The Unicode Character Set
2.16 For More Information
3. MEMORY ACCESS AND ORGANIZATION
3.1 The 80x86 Addressing Modes
3.1.1 80x86 Register Addressing Modes
3.1.2 80x86 32-Bit Memory Addressing Modes
3.1.2.1 The Displacement-Only Addressing Mode
3.1.2.2 The Register-Indirect Addressing Modes
3.1.2.3 Indexed Addressing Modes
3.1.2.4 Variations on the Indexed Addressing Mode
3.1.2.5 Scaled-Indexed Addressing Modes
3.1.2.6 Addressing Mode Wrap-up
3.2 Runtime Memory Organization
3.2.1 The code Section
3.2.2 The static Section
3.2.3 The readonly Data Section
3.2.4 The storage Section
3.2.5 The @nostorage Attribute
3.2.6 The var Section
3.2.7 Organization of Declaration Sections Within Your Programs
3.3 How HLA Allocates Memory for Variables
3.4 HLA Support for Data Alignment
3.5 Address Expressions
3.6 Type Coercion
3.7 Register Type Coercion
3.8 The stack Segment and the push and pop Instructions
3.8.1 The Basic push Instruction
3.8.2 The Basic pop Instruction
3.8.3 Preserving Registers with the push and pop Instructions
3.9 The Stack Is a LIFO Data Structure
3.9.1 Other push and pop Instructions
3.9.2 Removing Data from the Stack Without Popping It
3.10 Accessing Data You've Pushed onto the Stack Without Popping It
3.11 Dynamic Memory Allocation and the Heap Segment
3.12 The inc and dec Instructions
3.13 Obtaining the Address of a Memory Object
3.14 For More Information
4. CONSTANTS, VARIABLES, AND DATA TYPES
4.1 Some Additional Instructions: intmul, bound, into
4.2 HLA Constant and Value Declarations
4.2.1 Constant Types
4.2.2 String and Character Literal Constants
4.2.3 String and Text Constants in the const Section
4.2.4 Constant Expressions
4.2.5 Multiple const Sections and Their Order in an HLA Program
4.2.6 The HLA val Section
4.2.7 Modifying val Objects at Arbitrary Points in Your Programs
4.3 The HLA Type Section
4.4 enum and HLA Enumerated Data Types
4.5 Pointer Data Types
4.5.1 Using Pointers in Assembly Language
4.5.2 Declaring Pointers in HLA
4.5.3 Pointer Constants and Pointer Constant Expressions
4.5.4 Pointer Variables and Dynamic Memory Allocation
4.5.5 Common Pointer Problems
4.6 Composite Data Types
4.7 Character Strings
4.8 HLA Strings
4.9 Accessing the Characters Within a String
4.10 The HLA String Module and Other String-Related Routines
4.11 In-Memory Conversions
4.12 Character Sets
4.13 Character Set Implementation in HLA
4.14 HLA Character Set Constants and Character Set Expressions
4.15 Character Set Support in the HLA Standard Library
4.16 Using Character Sets in Your HLA Programs
4.17 Arrays
4.18 Declaring Arrays in Your HLA Programs
4.19 HLA Array Constants
4.20 Accessing Elements of a Single-Dimensional Array
4.21 Sorting an Array of Values
4.22 Multidimensional Arrays
4.22.1 Row-Major Ordering
4.22.2 Column-Major Ordering
4.23 Allocating Storage for Multidimensional Arrays
4.24 Accessing Multidimensional Array Elements in Assembly Language
4.25 Records
4.26 Record Constants
4.27 Arrays of Records
4.28 Arrays/Records as Record Fields
4.29 Aligning Fields Within a Record
4.30 Pointers to Records
4.31 Unions
4.32 Anonymous Unions
4.33 Variant Types
4.34 Namespaces
4.35 Dynamic Arrays in Assembly Language
4.36 For More Information
5. PROCEDURES AND UNITS
5.1 Procedures
5.2 Saving the State of the Machine
5.3 Prematurely Returning from a Procedure
5.4 Local Variables
5.5 Other Local and Global Symbol Types
5.6 Parameters
5.6.1 Pass by Value
5.6.2 Pass by Reference
5.7 Functions and Function Results
5.7.1 Returning Function Results
5.7.2 Instruction Composition in HLA
5.7.3 The HLA @returns Option in Procedures
5.8 Recursion
5.9 Forward Procedures
5.10 HLA v2.0 Procedure Declarations
5.11 Low-Level Procedures and the call Instruction
5.12 Procedures and the Stack
5.13 Activation Records
5.14 The Standard Entry Sequence
5.15 The Standard Exit Sequence
5.16 Low-Level Implementation of Automatic (Local) Variables
5.17 Low-Level Parameter Implementation
5.17.1 Passing Parameters in Registers
5.17.2 Passing Parameters in the Code Stream
5.17.3 Passing Parameters on the Stack
5.17.3.1 Accessing Value Parameters on the Stack
5.17.3.2 Passing Value Parameters on the Stack
5.17.3.3 Accessing Reference Parameters on the Stack
5.17.3.4 Passing Reference Parameters on the Stack
5.17.3.5 Passing Formal Parameters as Actual Parameters
5.17.3.6 HLA Hybrid Parameter-Passing Facilities
5.17.3.7 Mixing Register and Stack-Based Parameters
5.18 Procedure Pointers
5.19 Procedural Parameters
5.20 Untyped Reference Parameters
5.21 Managing Large Programs
5.22 The #include Directive
5.23 Ignoring Duplicate #include Operations
5.24 Units and the external Directive
5.24.1 Behavior of the external Directive
5.24.2 Header Files in HLA
5.25 Namespace Pollution
5.26 For More Information
6. ARITHMETIC
6.1 80x86 Integer Arithmetic Instructions
6.1.1 The mul and imul Instructions
6.1.2 The div and idiv Instructions
6.1.3 The cmp Instruction
6.1.4 The setcc Instructions
6.1.5 The test Instruction
6.2 Arithmetic Expressions
6.2.1 Simple Assignments
6.2.2 Simple Expressions
6.2.3 Complex Expressions
6.2.4 Commutative Operators
6.3 Logical (Boolean) Expressions
6.4 Machine and Arithmetic Idioms
6.4.1 Multiplying without mul, imul, or intmul
6.4.2 Division Without div or idiv
6.4.3 Implementing Modulo-N Counters with and
6.5 Floating-Point Arithmetic
6.5.1 FPU Registers
6.5.1.1 FPU Data Registers
6.5.1.2 The FPU Control Register
6.5.1.3 The FPU Status Register
6.5.2 FPU Data Types
6.5.3 The FPU Instruction Set
6.5.4 FPU Data Movement Instructions
6.5.4.1 The fld Instruction
6.5.4.2 The fst and fstp Instructions
6.5.4.3 The fxch Instruction
6.5.5 Conversions
6.5.5.1 The fild Instruction
6.5.5.2 The fist, fistp, and fisttp Instructions
6.5.5.3 The fbld and fbstp Instructions
6.5.6 Arithmetic Instructions
6.5.6.1 The fadd and faddp Instructions
6.5.6.2 The fsub, fsubp, fsubr, and fsurpb Instructions
6.5.6.3 The fmul and fmulp Instructions
6.5.6.4 The fdiv, fdivp, fdivr, and fdivrp Instructions
6.5.6.5 The fsqrt Instruction
6.5.6.6 The fprem and fprem1 Instructions
6.5.6.7 The frndint Instruction
6.5.6.8 The fabs Instruction
6.5.6.9 The fchs Instruction
6.5.7 Comparison Instructions
6.5.7.1 The fcom, fcomp, and fcompp Instructions
6.5.7.2 The fcomi and fcomip Instructions
6.5.7.3 The ftst Instruction
6.5.8 Constant Instructions
6.5.9 Transcendental Instructions
6.5.9.1 The f2xm1 Instruction
6.5.9.2 The fsin, fcos, and fsincos Instructions
6.5.9.3 The fptan Instruction
6.5.9.4 The fpatan Instruction
6.5.9.5 The fyl2x Instruction
6.5.9.6 The fyl2xp1 Instruction
6.5.10 Miscellaneous Instructions
6.5.10.1 The finit and fninit Instructions
6.5.10.2 The fldcw and fstcw Instructions
6.5.10.3 The fclex and fnclex Instructions
6.5.10.4 The fstsw and fnstsw Instructions
6.5.11 Integer Operations
6.6 Converting Floating-Point Expressions to Assembly Language
6.6.1 Converting Arithmetic Expressions to Postfix Notation
6.6.2 Converting Postfix Notation to Assembly Language
6.7 HLA Standard Library Support for Floating-Point Arithmetic
6.8 For More Information
7. LOW-LEVEL CONTROL STRUCTURES
7.1 Low-Level Control Structures
7.2 Statement Labels
7.3 Unconditional Transfer of Control (jmp)
7.4 The Conditional Jump Instructions
7.5 "Medium-Level" Control Structures: jt and jf
7.6 Implementing Common Control Structures in Assembly Language
7.7 Introduction to Decisions
7.7.1 if..then..else Sequences
7.7.2 Translating HLA if Statements into Pure Assembly Language
if( flag_specification ) then stmts endif
if( register ) then stmts endif
if( !register ) then stmts endif
if( boolean_variable ) then stmts endif
if( !boolean_variable ) then stmts endif
if( mem_reg relop mem_reg_const ) then stmts endif
if( reg/mem in LowConst..HiConst ) then stmts endif
if( reg/mem not in LowConst..HiConst ) then stmts endif
7.7.3 Implementing Complex if Statements Using Complete Boolean Evaluation
7.7.4 Short-Circuit Boolean Evaluation
7.7.5 Short-Circuit vs. Complete Boolean Evaluation
7.7.6 Efficient Implementation of if Statements in Assembly Language
7.7.6.1 Know Your Data!
7.7.6.2 Rearranging Expressions
7.7.6.3 Destructuring Your Code
7.7.6.4 Calculation Rather Than Branching
7.7.7 switch/case Statements
7.8 State Machines and Indirect Jumps
7.9 Spaghetti Code
7.10 Loops
7.10.1 while Loops
7.10.2 repeat..until Loops
7.10.3 forever..endfor Loops
7.10.4 for Loops
7.10.5 The break and continue Statements
forever..continue..endfor
while..continue..endwhile
for..continue..endfor
repeat..continue..until
7.10.6 Register Usage and Loops
7.11 Performance Improvements
7.11.1 Moving the Termination Condition to the End of a Loop
7.11.2 Executing the Loop Backwards
7.11.3 Loop-Invariant Computations
7.11.4 Unraveling Loops
7.11.5 Induction Variables
7.12 Hybrid Control Structures in HLA
7.13 For More Information
8. ADVANCED ARITHMETIC
8.1 Multiprecision Operations
8.1.1 HLA Standard Library Support for Extended-Precision Operations
8.1.2 Multiprecision Addition Operations
8.1.3 Multiprecision Subtraction Operations
8.1.4 Extended-Precision Comparisons
8.1.5 Extended-Precision Multiplication
8.1.6 Extended-Precision Division
8.1.7 Extended-Precision neg Operations
8.1.8 Extended-Precision and Operations
8.1.9 Extended-Precision or Operations
8.1.10 Extended-Precision xor Operations
8.1.11 Extended-Precision not Operations
8.1.12 Extended-Precision Shift Operations
8.1.13 Extended-Precision Rotate Operations
8.1.14 Extended-Precision I/O
8.1.14.1 Extended-Precision Hexadecimal Output
8.1.14.2 Extended-Precision Unsigned Decimal Output
8.1.14.3 Extended-Precision Signed Decimal Output
8.1.14.4 Extended-Precision Formatted Output
8.1.14.5 Extended-Precision Input Routines
8.1.14.6 Extended-Precision Hexadecimal Input
8.1.14.7 Extended-Precision Unsigned Decimal Input
8.1.14.8 Extended-Precision Signed Decimal Input
8.2 Operating on Different-Size Operands
8.3 Decimal Arithmetic
8.3.1 Literal BCD Constants
8.3.2 The 80x86 daa and das Instructions
8.3.3 The 80x86 aaa, aas, aam, and aad Instructions
8.3.4 Packed Decimal Arithmetic Using the FPU
8.4 Tables
8.4.1 Function Computation via Table Lookup
8.4.2 Domain Conditioning
8.4.3 Generating Tables
8.4.4 Table Lookup Performance
8.5 For More Information
9. MACROS AND THE HLA COMPILE-TIME LANGUAGE
9.1 Introduction to the Compile-Time Language (CTL)
9.2 The #print and #error Statements
9.3 Compile-Time Constants and Variables
9.4 Compile-Time Expressions and Operators
9.5 Compile-Time Functions
9.5.1 Type-Conversion Compile-Time Functions
9.5.2 Numeric Compile-Time Functions
9.5.3 Character-Classification Compile-Time Functions
9.5.4 Compile-Time String Functions
9.5.5 Compile-Time Symbol Information
9.5.6 Miscellaneous Compile-Time Functions
9.5.7 Compile-Time Type Conversions of Text Objects
9.6 Conditional Compilation (Compile-Time Decisions)
9.7 Repetitive Compilation (Compile-Time Loops)
9.8 Macros (Compile-Time Procedures)
9.8.1 Standard Macros
9.8.2 Macro Parameters
9.8.2.1 Standard Macro Parameter Expansion
9.8.2.2 Macros with a Variable Number of Parameters
9.8.2.3 Required vs. Optional Macro Parameters
9.8.3 Local Symbols in a Macro
9.8.4 Macros as Compile-Time Procedures
9.8.5 Simulating Function Overloading with Macros
9.9 Writing Compile-Time "Programs
9.9.1 Constructing Data Tables at Compile Time
9.9.2 Unrolling Loops
9.10 Using Macros in Different Source Files
9.11 For More Information
10. BIT MANIPULATION
10.1 What Is Bit Data, Anyway?
10.2 Instructions That Manipulate Bits
10.3 The Carry Flag as a Bit Accumulator
10.4 Packing and Unpacking Bit Strings
10.5 Coalescing Bit Sets and Distributing Bit Strings
10.6 Packed Arrays of Bit Strings
10.7 Searching for a Bit
10.8 Counting Bits
10.9 Reversing a Bit String
10.10 Merging Bit Strings
10.11 Extracting Bit Strings
10.12 Searching for a Bit Pattern
10.13 The HLA Standard Library Bits Module
10.14 For More Information
11. THE STRING INSTRUCTIONS
11.1 The 80x86 String Instructions
11.1.1 How the String Instructions Operate
11.1.2 The rep/repe/repz and repnz/repne Prefixes
11.1.3 The Direction Flag
11.1.4 The movs Instruction
11.1.5 The cmps Instruction
11.1.6 The scas Instruction
11.1.7 The stos Instruction
11.1.8 The lods Instruction
11.1.9 Building Complex String Functions from lods and stos
11.2 Performance of the 80x86 String Instructions
11.3 For More Information
12. CLASSES AND OBJECTS
12.1 General Principles
12.2 Classes in HLA
12.3 Objects
12.4 Inheritance
12.5 Overriding
12.6 Virtual Methods vs. Static Procedures
12.7 Writing Class Methods and Procedures
12.8 Object Implementation
12.8.1 Virtual Method Tables
12.8.2 Object Representation with Inheritance
12.9 Constructors and Object Initialization
12.9.1 Dynamic Object Allocation Within the Constructor
12.9.2 Constructors and Inheritance
12.9.3 Constructor Parameters and Procedure Overloading
12.10 Destructors
12.11 HLA's _initialize_ and _finalize_ Strings
12.12 Abstract Methods
12.13 Runtime Type Information
12.14 Calling Base Class Methods
12.15 For More Information
A. ASCII CHARACTER SET
COLOPHON
UPDATES

Systemvoraussetzungen

Als PDF speichern Als Link merken