Contents ix 3.2 Program Encodings 169 3.2.1 Machine-Level Code 170 3.2.2 Code Examples 172 3.2.3 Notes on Formatting 175 3.3 Data Formats 177- 3.4 Accessing Informiation 179 3.4.1 Operand Specifiers.180 3.4.2 Data Movement Instryctions 182 3.4.3 Data Moyement Example 186 I 3.4.4 Pushing and Popping Stack Data 189 3.5 Arithmetic and Logical Operations 191 3.5.1 Load Effective Address 191 3.5.2 Unary and Binary Operations 194 3.5.3 Shift Operations 194 3.5.4 Discussion,196 g 3.5.5 Special Arithmetic Operations 197 3.6 Control 200' 3.6.1 Condition Codes 201 3.6.2 Accessing the Condition Codes 202 3.6.3 Jump Instructions 205 3.6.4 Jump Instruction Encodings 207 3.6.5 Implementing Conditional Branches with Conditional Control 209 3.6.6 Implementing Conditional Branches.with Conditional Moves 214s 3.6.7 Loops 220 3.6.8 Switch Statements 232 3.7 Procedures 238 9 3.7.1 The Run-Time Stack 239 3.7.2 Control Transfer 241 3.7.3 Data Transfer 245 3.7.4 Local Storage on the Stack 248 3.7.5 Local Storage in Registers 251 3.7.6 Recursive Procedures 253 3.8 Array Allocation and Access 255 3.8.1 Basic Principles 255 1 3.8.2 Pointer Arithmetic 257 3.8.3 Nested Arrays 258 3.8.4 Fixed-Size Arrays 260, 14 3.8.5 Variable-Size Arrays 2623.2 Program Encodings 169 3.3 3.4 3.5 3.6 3.2.l Machine-Level Code 170 3.2.2 Code Examples 172 3.2.3 Notes on Formatting 175 Data Formats 177· (I ' 11 Accessing Infonrlation 17~ 3.4.l , (!peranq,Speciflers. 180 " 3.4.2 'Data Movell).ent Instwcti<;ms , 1~2 3.4.3 Data Moyement Exllmple 0 186 3.4.4 Pushing and' Poppi~g Stack Data Arithmetic and Logical Operations 191 3.5.1 Load Effective Address 191 i89 3.5.2 Unary and Bi~ary 9peqtip,J!~r 194 3.5.3 Shift Operations 194 3.5.4 ,. Disc_u~sion, 196 , 3.5.5 Special Arithmetic Operatio11s 197 Control 200' 3.6.1 Condition Codes 201 l J I ' " f;t I ·'\ ,, • ' l 3.6.2 Accessing the Condition Codes 202 · • ~· , 3.6.3 Jump Instructions 205 • 3.6.4 Jump Instruction Encodings 207 3.6.5 Impleme9ting Conditional Branches with Conditional ·Control 209 3.6.6 Implementing.Conditional Branches.with Conditional Moves 214 > 3.6.7 Loops 220 3.6.8 Switch Statements 232 3.7 Procedures 238 3.7'.l The Run-Turie, Stack 23~ 3.7.2 Control Transfer 241 3.7.3 Data Transfer 245 3.7.4 3.7.5 3.7.6 Local Storage on the Stack 248 • • J Local Storage m Registers 251 Recursive Procedure~ 253 " "· 3.8 :Array Allocati91)-~nd Access 255 3.8.1 Basic Principles 255 3.8.2 Pointer Arithmetic 257 3.8.3 Nested Arrays 258 3.8.4 Fixed-Size Arrays 260, 3.8.5 Variable-Size Arrays 262 , , " ; l " Co,ntents- ix { ,, ') '