📄 content.htm
字号:
<DT><A HREF="CH08/CH08-1.html#HEADING1-311"><B>8.7 </B>- Procedures</A><DT><A HREF="CH08/CH08-2.html#HEADING2-1"><B>8.8 </B>- Segments</A> <DT><A HREF="CH08/CH08-2.html#HEADING2-16"><B>8.8.1 </B>- Segment Names</A><DT><A HREF="CH08/CH08-2.html#HEADING2-48"><B>8.8.2 </B>- Segment LoadingOrder</A> <DT><A HREF="CH08/CH08-2.html#HEADING2-72"><B>8.8.3 </B>- Segment Operands</A><DT><A HREF="CH08/CH08-2.html#HEADING2-74"><B>8.8.3.1 </B>- The ALIGN Type</A><DT><A HREF="CH08/CH08-2.html#HEADING2-164"><B>8.8.3.2 </B>- The COMBINEType</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-1"><B>8.8.4 </B>- The CLASS Type</A><DT><A HREF="CH08/CH08-3.html#HEADING3-34"><B>8.8.5 </B>- The Read-onlyOperand</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-42"><B>8.8.6 </B>- The USE16, USE32,and FLAT Options</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-55"><B>8.8.7 </B>- Typical SegmentDefinitions</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-76"><B>8.8.8 </B>- Why You WouldWant to Control the Loading Order</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-94"><B>8.8.9 </B>- Segment Prefixes</A><DT><A HREF="CH08/CH08-3.html#HEADING3-98"><B>8.8.10 </B>- Controlling Segmentswith the ASSUME Directive</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-192"><B>8.8.11 </B>- Combining Segments:The GROUP Directive</A> <DT><A HREF="CH08/CH08-3.html#HEADING3-295"><B>8.8.12 </B>- Why Even BotherWith Segments?</A> <DT><A HREF="CH08/CH08-4.html#HEADING4-1"><B>8.9 </B>- The END Directive</A><DT><A HREF="CH08/CH08-4.html#HEADING4-4"><B>8.10 </B>- Variables</A> <DT><A HREF="CH08/CH08-4.html#HEADING4-13"><B>8.11 </B>- Label Types</A><DT><A HREF="CH08/CH08-4.html#HEADING4-15"><B>8.11.1 </B>- How to Give aSymbol a Particular Type</A> <DT><A HREF="CH08/CH08-4.html#HEADING4-42"><B>8.11.2 </B>- Label Values</A><DT><A HREF="CH08/CH08-4.html#HEADING4-44"><B>8.11.3 </B>- Type Conflicts</A><DT><A HREF="CH08/CH08-4.html#HEADING4-69"><B>8.12 </B>- Address Expressions</A><DT><A HREF="CH08/CH08-4.html#HEADING4-83"><B>8.12.1 </B>- Symbol Typesand Addressing Modes</A> <DT><A HREF="CH08/CH08-4.html#HEADING4-101"><B>8.12.2 </B>- Arithmetic andLogical Operators</A> <DT><A HREF="CH08/CH08-4.html#HEADING4-147"><B>8.12.3 </B>- Coercion</A><DT><A HREF="CH08/CH08-5.html#HEADING5-1"><B>8.12.4 </B>- Type Operators</A><DT><A HREF="CH08/CH08-5.html#HEADING5-135"><B>8.12.5 </B>- Operator Precedence</A><DT><A HREF="CH08/CH08-6.html#HEADING6-1"><B>8.13 </B>- Conditional Assembly</A><DT><A HREF="CH08/CH08-6.html#HEADING6-10"><B>8.13.1 </B>- IF Directive</A><DT><A HREF="CH08/CH08-6.html#HEADING6-36"><B>8.13.2 </B>- IFE directive</A><DT><A HREF="CH08/CH08-6.html#HEADING6-38"><B>8.13.3 </B>- IFDEF and IFNDEF</A><DT><A HREF="CH08/CH08-6.html#HEADING6-51"><B>8.13.4 </B>- IFB, IFNB</A><DT><A HREF="CH08/CH08-6.html#HEADING6-69"><B>8.13.5 </B>- IFIDN, IFDIF,IFIDNI, and IFDIFI</A> <DT><A HREF="CH08/CH08-7.html#HEADING7-1"><B>8.14 </B>- Macros</A> <DT><A HREF="CH08/CH08-7.html#HEADING7-3"><B>8.14.1 </B>- Procedural Macros</A><DT><A HREF="CH08/CH08-7.html#HEADING7-192"><B>8.14.2 </B>- Macros vs. 80x86Procedures </A><DT><A HREF="CH08/CH08-7.html#HEADING7-248"><B>8.14.3 </B>- The LOCAL Directive</A><DT><A HREF="CH08/CH08-7.html#HEADING7-276"><B>8.14.4 </B>- The EXITM Directive</A><DT><A HREF="CH08/CH08-7.html#HEADING7-288"><B>8.14.5 </B>- Macro ParameterExpansion and Macro Operators</A> <DT><A HREF="CH08/CH08-7.html#HEADING7-389"><B>8.14.6 </B>- A Sample Macroto Implement For Loops</A> <DT><A HREF="CH08/CH08-8.html#HEADING8-1"><B>8.14.7 </B>- Macro Functions</A><DT><A HREF="CH08/CH08-8.html#HEADING8-39"><B>8.14.8 </B>- Predefined Macros,Macro Functions, and Symbols</A> <DT><A HREF="CH08/CH08-8.html#HEADING8-125"><B>8.14.9 </B>- Macros vs. TextEquates</A> <DT><A HREF="CH08/CH08-8.html#HEADING8-130"><B>8.14.10 </B>- Macros: Goodand Bad News</A> <DT><A HREF="CH08/CH08-9.html#HEADING9-1"><B>8.15 </B>- Repeat Operations</A><DT><A HREF="CH08/CH08-9.html#HEADING9-51"><B>8.16 </B>- The FOR and FORCMacro Operations</A> <DT><A HREF="CH08/CH08-9.html#HEADING9-90"><B>8.17 </B>- The WHILE MacroOperation</A> <DT><A HREF="CH08/CH08-9.html#HEADING9-100"><B>8.18 </B>- Macro Parameters</A><DT><A HREF="CH08/CH08-10.html#HEADING10-1"><B>8.19 </B>- Controlling theListing</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-3"><B>8.19.1 </B>- The ECHO and%OUT Directives</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-5"><B>8.19.2 </B>- The TITLE Directive</A><DT><A HREF="CH08/CH08-10.html#HEADING10-10"><B>8.19.3 </B>- The SUBTTLDirective</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-15"><B>8.19.4 </B>- The PAGE Directive</A><DT><A HREF="CH08/CH08-10.html#HEADING10-26"><B>8.19.5 </B>- The .LIST,.NOLIST, and .XLIST Directives</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-32"><B>8.19.6 </B>- Other ListingDirectives</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-34"><B>8.20 </B>- Managing LargePrograms</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-41"><B>8.20.1 </B>- The INCLUDEDirective</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-56"><B>8.20.2 </B>- The PUBLIC,EXTERN, and EXTRN Directives</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-109"><B>8.20.3 </B>- The EXTERNDEFDirective</A> <DT><A HREF="CH08/CH08-10.html#HEADING10-131"><B>8.21 </B>- Make Files</A><DT><A HREF="CH08/CH08-11.html#HEADING11-1"><B>8.22 </B>- Sample Program</A><DT><A HREF="CH08/CH08-11.html#HEADING11-3"><B>8.22.1 </B>- EX8.MAK</A><DT><A HREF="CH08/CH08-11.html#HEADING11-20"><B>8.22.2 </B>- Matrix.A</A><DT><A HREF="CH08/CH08-11.html#HEADING11-103"><B>8.22.3 </B>- EX8.ASM</A><DT><A HREF="CH08/CH08-11.html#HEADING11-686"><B>8.22.4 </B>- GETI.ASM</A><DT><A HREF="CH08/CH08-11.html#HEADING11-785"><B>8.22.5 </B>- GetArray.ASM</A><DT><A HREF="CH08/CH08-11.html#HEADING11-885"><B>8.22.6 </B>- XProduct.ASM</A></DL><BR>8.23 Laboratory Exercises <BR>8.23.1 Near vs. Far Procedures <BR>8.23.2 Data Alignment Exercises <BR>8.23.3 Equate Exercise <BR>8.23.4 IFDEF Exercise <BR>8.23.5 Make File Exercise <BR>8.24 Programming Projects <BR>8.25 Summary <BR>8.26 Questions <BR><BR><A NAME="HEADING1-400"></A><HR><DL><DT><A HREF="CH09/CH09-1.html"><B>Chapter Nine </B>- Arithmeticand Logical Operations</A> <DT><A HREF="CH09/CH09-1.html#HEADING1-2"><B>9.0 </B>- Chapter Overview</A><DT><A HREF="CH09/CH09-1.html#HEADING1-34"><B>9.1 </B>- Arithmetic Expressions</A><DT><A HREF="CH09/CH09-1.html#HEADING1-45"><B>9.1.1 </B>- Simple Assignments</A><DT><A HREF="CH09/CH09-1.html#HEADING1-64"><B>9.1.2 </B>- Simple Expressions</A><DT><A HREF="CH09/CH09-1.html#HEADING1-154"><B>9.1.3 </B>- Complex Expressions</A><DT><A HREF="CH09/CH09-1.html#HEADING1-309"><B>9.1.4 </B>- Commutative Operators</A><DT><A HREF="CH09/CH09-2.html#HEADING2-1"><B>9.2 </B>- Logical (Boolean)Expressions</A> <DT><A HREF="CH09/CH09-3.html#HEADING3-1"><B>9.3 </B>- Multiprecision Operations</A><DT><A HREF="CH09/CH09-3.html#HEADING3-3"><B>9.3.1 </B>- MultiprecisionAddition Operations </A><DT><A HREF="CH09/CH09-3.html#HEADING3-65"><B>9.3.2 </B>- MultiprecisionSubtraction Operations</A> <DT><A HREF="CH09/CH09-3.html#HEADING3-100"><B>9.3.3 </B>- Extended PrecisionComparisons</A> <DT><A HREF="CH09/CH09-4.html#HEADING4-1"><B>9.3.4 </B>- Extended PrecisionMultiplication</A> <DT><A HREF="CH09/CH09-4.html#HEADING4-99"><B>9.3.5 </B>- Extended PrecisionDivision</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-1"><B>9.3.6 </B>- Extended PrecisionNEG Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-44"><B>9.3.7 </B>- Extended PrecisionAND Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-54"><B>9.3.8 </B>- Extended PrecisionOR Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-65"><B>9.3.9 </B>- Extended PrecisionXOR Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-73"><B>9.3.10 </B>- Extended PrecisionNOT Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-79"><B>9.3.11 </B>- Extended PrecisionShift Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-128"><B>9.3.12 </B>- Extended PrecisionRotate Operations</A> <DT><A HREF="CH09/CH09-5.html#HEADING5-148"><B>9.4 </B>- Operating on DifferentSized Operands</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-1"><B>9.5 </B>- Machine and ArithmeticIdioms</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-3"><B>9.5.1 </B>- Multiplying WithoutMUL and IMUL</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-39"><B>9.5.2 </B>- Division WithoutDIV and IDIV</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-49"><B>9.5.3 </B>- Using AND to ComputeRemainders</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-64"><B>9.5.4 </B>- Implementing Modulo-nCounters with AND</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-72"><B>9.5.5 </B>- Testing an ExtendedPrecision Value for 0FFFF..FFh</A> <DT><A HREF="CH09/CH09-6.html#HEADING6-83"><B>9.5.6 </B>- TEST Operations</A><DT><A HREF="CH09/CH09-6.html#HEADING6-106"><B>9.5.7 </B>- Testing Signswith the XOR Instruction</A> <DT><A HREF="CH09/CH09-7.html#HEADING7-1"><B>9.6 </B>- Masking Operations</A><DT><A HREF="CH09/CH09-7.html#HEADING7-3"><B>9.6.1 </B>- Masking Operationswith the AND Instruction</A> <DT><A HREF="CH09/CH09-7.html#HEADING7-6"><B>9.6.2 </B>- Masking Operationswith the OR Instruction</A> <DT><A HREF="CH09/CH09-7.html#HEADING7-9"><B>9.7 </B>- Packing and UnpackingData Types</A> <DT><A HREF="CH09/CH09-7.html#HEADING7-65"><B>9.8 </B>- Tables</A> <DT><A HREF="CH09/CH09-7.html#HEADING7-68"><B>9.8.1 </B>- Function Computationvia Table Look Up</A> <DT><A HREF="CH09/CH09-7.html#HEADING7-162"><B>9.8.2 </B>- Domain Conditioning</A><DT><A HREF="CH09/CH09-7.html#HEADING7-190"><B>9.8.3 </B>- Generating Tables</A><DT><A HREF="CH09/CH09-8.html#HEADING8-1"><B>9.9 </B>- Sample Programs</A><DT><A HREF="CH09/CH09-8.html#HEADING8-3"><B>9.9.1 </B>- Converting ArithmeticExpressions to Assembly Language</A> <DT><A HREF="CH09/CH09-8.html#HEADING8-151"><B>9.9.2 </B>- Boolean OperationsExample</A> <DT><A HREF="CH09/CH09-8.html#HEADING8-327"><B>9.9.3 </B>- 64-bit IntegerI/O</A> <DT><A HREF="CH09/CH09-8.html#HEADING8-558"><B>9.9.4 </B>- Packing and UnpackingDate Data Types</A> </DL><BR><BR>9.10 Laboratory Exercises <BR>9.10.1 Debugging Programs with CodeView <BR>9.10.2 Debugging Strategies <BR>9.10.2.1 Locating Infinite Loops <BR>9.10.2.2 Incorrect Computations <BR>9.10.2.3 Illegal Instructions/Infinite Loops Part II <BR>9.10.3 Debug Exercise I: Using CodeView to Find Bugs in a Calculation <BR>9.10.4 Software Delay Loop Exercises <BR>9.11 Programming Projects <BR>9.12 Summary <BR>9.13 Questions <BR><BR><A NAME="HEADING1-455"></A><HR><DL><DT><A HREF="CH10/CH10-1.html"><B>Chapter 10 </B>- Control Structures</A><DT><A HREF="CH10/CH10-1.html#HEADING1-2"><B>10.0 </B>- Chapter Overview</A><DT><A HREF="CH10/CH10-1.html#HEADING1-22"><B>10.1 </B>- Introduction toDecisions</A> <DT><A HREF="CH10/CH10-1.html#HEADING1-72"><B>10.2 </B>- IF..THEN..ELSESequences</A> <DT><A HREF="CH10/CH10-2.html#HEADING2-1"><B>10.3 </B>- CASE Statements</A><DT><A HREF="CH10/CH10-2.html#HEADING2-187"><B>10.4 </B>- State Machinesand Indirect Jumps</A> <DT><A HREF="CH10/CH10-2.html#HEADING2-270"><B>10.5 </B>- Spaghetti Code</A><DT><A HREF="CH10/CH10-3.html#HEADING3-1"><B>10.6 </B>- Loops</A> <DT><A HREF="CH10/CH10-3.html#HEADING3-4"><B>10.6.1 </B>- While Loops</A><DT><A HREF="CH10/CH10-3.html#HEADING3-37"><B>10.6.2 </B>- Repeat..UntilLoops</A> <DT><A HREF="CH10/CH10-3.html#HEADING3-51"><B>10.6.3 </B>- LOOP..ENDLOOPLoops</A> <DT><A HREF="CH10/CH10-3.html#HEADING3-80"><B>10.6.4 </B>- FOR Loops</A><DT><A HREF="CH10/CH10-3.html#HEADING3-135"><B>10.7 </B>- Register Usageand Loops</A> <DT><A HREF="CH10/CH10-4.html#HEADING4-1"><B>10.8 </B>- Performance Improvements</A><DT><A HREF="CH10/CH10-4.html#HEADING4-3"><B>10.8.1 </B>- Moving the TerminationCondition to the End of a Loop</A> <DT><A HREF="CH10/CH10-4.html#HEADING4-67"><B>10.8.2 </B>- Executing theLoop Backwards</A> <DT><A HREF="CH10/CH10-4.html#HEADING4-94"><B>10.8.3 </B>- Loop InvariantComputations</A> <DT><A HREF="CH10/CH10-4.html#HEADING4-175"><B>10.8.4 </B>- Unraveling Loops</A><DT><A HREF="CH10/CH10-4.html#HEADING4-204"><B>10.8.5 </B>- Induction Variables</A><DT><A HREF="CH10/CH10-4.html#HEADING4-243"><B>10.8.6 </B>- Other PerformanceImprovements</A> <DT><A HREF="CH10/CH10-5.html#HEADING5-1"><B>10.9 </B>- Nested Statements</A><DT><A HREF="CH10/CH10-5.html#HEADING5-101"><B>10.10 </B>- Timing DelayLoops</A> <DT><A HREF="CH10/CH10-6.html#HEADING6-1"><B>10.11 </B>- Sample Program</A></DL><BR><BR>10.12 Laboratory Exercises <BR>10.12.1 The Physics of Sound <BR>10.12.2 The Fundamentals of Music <BR>10.12.3 The Physics of Music <BR>10.12.4 The 8253/8254 Timer Chip <BR>10.12.5 Programming the Timer Chip to Produce Musical Tones <BR>10.12.6 Putting it All Together <BR>10.12.7 Amazing Grace Exercise <BR>10.13 Programming Projects <BR>10.14 Summary <BR>10.15 Questions <BR><BR><A NAME="HEADING1-490"></A><HR><DL><DT><A HREF="CH11/CH11-1.html"><B>Chapter Eleven </B>- Proceduresand Functions</A> <DT><A HREF="CH11/CH11-1.html#HEADING1-4"><B>11.0 </B>- Chapter Overview</A><DT><A HREF="CH11/CH11-1.html#HEADING1-28"><B>11.1 </B>- Procedures</A>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -