Assembly language

From Wikipedia, the free encyclopedia - View original article

Jump to: navigation, search
See the terminology section below for information regarding inconsistent use of the terms assembly and assembler.
Motorola MC6800 Assembly listing, showing original assembly language and the assembled form

An assembly language is a low-level programming language for a computer, or other programmable device, in which there is a very strong (generally one-to-one) correspondence between the language and the architecture's machine code instructions. Each assembly language is specific to a particular computer architecture, in contrast to most high-level programming languages, which are generally portable across multiple architectures, but require interpreting or compiling.

Assembly language is converted into executable machine code by a utility program referred to as an assembler; the conversion process is referred to as assembly, or assembling the code.

Assembly language uses a mnemonic to represent each low-level machine instruction or operation. Typical operations require one or more operands in order to form a complete instruction, and most assemblers can therefore take labels, symbols and expressions as operands to represent addresses and other constants, freeing the programmer from tedious manual calculations. Macro assemblers include a macroinstruction facility so that (parameterized) assembly language text can be represented by a name, and that name can be used to insert the expanded text into other code. Many assemblers offer additional mechanisms to facilitate program development, to control the assembly process, and to aid debugging.

Key concepts[edit]


An assembler is a program which creates object code by translating combinations of mnemonics and syntax for operations and addressing modes into their numerical equivalents. This representation typically includes an operation code ("opcode") as well as other control bits.[1] The assembler also calculates constant expressions and resolves symbolic names for memory locations and other entities.[2] The use of symbolic references is a key feature of assemblers, saving tedious calculations and manual address updates after program modifications. Most assemblers also include macro facilities for performing textual substitution—e.g., to generate common short sequences of instructions as inline, instead of called subroutines.

Some assemblers may also be able to perform some simple types of instruction set-specific optimizations. One concrete example of this may be the ubiquitous x86 assemblers from various vendors. Most of them are able to perform jump-instruction replacements (long jumps replaced by short or relative jumps) in any number of passes, on request. Others may even do simple rearrangement or insertion of instructions, such as some assemblers for RISC architectures that can help optimize a sensible instruction scheduling to exploit the CPU pipeline as efficiently as possible.[citation needed]

Like early programming languages such as Fortran, Algol, Cobol and Lisp, assemblers have been available since the 1950s and the first generations of text based computer interfaces. However, assemblers came first as they are far simpler to write than compilers for high-level languages. This is because each mnemonic along with the addressing modes and operands of an instruction translates rather directly into the numeric representations of that particular instruction, without much context or analysis. There have also been several classes of translators and semi automatic code generators with properties similar to both assembly and high level languages, with speedcode as perhaps one of the better known examples.

There may be several assemblers with different syntax for a particular CPU or instruction set architecture. For instance, an instruction to add memory data to a register in a x86-family processor might be add eax,[ebx], in original Intel syntax, whereas this would be written addl (%ebx),%eax in the AT&T syntax used by the GNU Assembler. Despite different appearances, different syntactic forms generally generate the same numeric machine code, see further below. A single assembler may also have different modes in order to support variations in syntactic forms as well as their exact semantic interpretations (such as FASM-syntax, TASM-syntax, ideal mode etc., in the special case of x86 assembly programming).

Number of passes[edit]

There are two types of assemblers based on how many passes through the source are needed to produce the executable program.

In both cases, the assembler must be able to determine the size of each instruction on the initial passes in order to calculate the addresses of subsequent symbols. This means that if the size of an operation referring to an operand defined later depends on the type or distance of the operand, the assembler will make a pessimistic estimate when first encountering the operation, and if necessary pad it with one or more "no-operation" instructions in a later pass or the errata. In an assembler with peephole optimization, addresses may be recalculated between passes to allow replacing pessimistic code with code tailored to the exact distance from the target.

The original reason for the use of one-pass assemblers was speed of assembly— often a second pass would require rewinding and rereading a tape or rereading a deck of cards. With modern computers this has ceased to be an issue. The advantage of the multi-pass assembler is that the absence of errata makes the linking process (or the program load if the assembler directly produces executable code) faster.[3]

High-level assemblers[edit]

More sophisticated high-level assemblers provide language abstractions such as:

See Language design below for more details.

Assembly language[edit]

A program written in assembly language consists of a series of (mnemonic) processor instructions and meta-statements (known variously as directives, pseudo-instructions and pseudo-ops), comments and data. Assembly language instructions usually consist of an opcode mnemonic followed by a list of data, arguments or parameters.[5] These are translated by an assembler into machine language instructions that can be loaded into memory and executed.

For example, the instruction below tells an x86/IA-32 processor to move an immediate 8-bit value into a register. The binary code for this instruction is 10110 followed by a 3-bit identifier for which register to use. The identifier for the AL register is 000, so the following machine code loads the AL register with the data 01100001.[6]

 10110000 01100001 

This binary computer code can be made more human-readable by expressing it in hexadecimal as follows.

 B0 61 

Here, B0 means 'Move a copy of the following value into AL', and 61 is a hexadecimal representation of the value 01100001, which is 97 in decimal. Intel assembly language provides the mnemonic MOV (an abbreviation of move) for instructions such as this, so the machine code above can be written as follows in assembly language, complete with an explanatory comment if required, after the semicolon. This is much easier to read and to remember.

 MOV AL, 61h       ; Load AL with 97 decimal (61 hex) 

In some assembly languages the same mnemonic such as MOV may be used for a family of related instructions for loading, copying and moving data, whether these are immediate values, values in registers, or memory locations pointed to by values in registers. Other assemblers may use separate opcode mnemonics such as L for "move memory to register", ST for "move register to memory", LR for "move register to register", MVI for "move immediate operand to memory", etc.

The Intel opcode 10110000 (B0) copies an 8-bit value into the AL register, while 10110001 (B1) moves it into CL and 10110010 (B2) does so into DL. Assembly language examples for these follow.[6]

 MOV AL, 1h        ; Load AL with immediate value 1 MOV CL, 2h        ; Load CL with immediate value 2 MOV DL, 3h        ; Load DL with immediate value 3 

The syntax of MOV can also be more complex as the following examples show.[7]

 MOV EAX, [EBX]	  ; Move the 4 bytes in memory at the address contained in EBX into EAX MOV [ESI+EAX], CL ; Move the contents of CL into the byte at address ESI+EAX 

In each case, the MOV mnemonic is translated directly into an opcode in the ranges 88-8E, A0-A3, B0-B8, C6 or C7 by an assembler, and the programmer does not have to know or remember which.[6]

Transforming assembly language into machine code is the job of an assembler, and the reverse can at least partially be achieved by a disassembler. Unlike high-level languages, there is usually a one-to-one correspondence between simple assembly statements and machine language instructions. However, in some cases, an assembler may provide pseudoinstructions (essentially macros) which expand into several machine language instructions to provide commonly needed functionality. For example, for a machine that lacks a "branch if greater or equal" instruction, an assembler may provide a pseudoinstruction that expands to the machine's "set if less than" and "branch if zero (on the result of the set instruction)". Most full-featured assemblers also provide a rich macro language (discussed below) which is used by vendors and programmers to generate more complex code and data sequences.

Each computer architecture has its own machine language. Computers differ in the number and type of operations they support, in the different sizes and numbers of registers, and in the representations of data in storage. While most general-purpose computers are able to carry out essentially the same functionality, the ways they do so differ; the corresponding assembly languages reflect these differences.

Multiple sets of mnemonics or assembly-language syntax may exist for a single instruction set, typically instantiated in different assembler programs. In these cases, the most popular one is usually that supplied by the manufacturer and used in its documentation.

Sample Code[edit]

The following sample code implements the Euler's totient function in MIPS assembly language:[citation needed]

  .text  .globl main 	  main: 		  la $a0, query					 #First the query 		  li $v0, 4 		  syscall 		  li $v0, 5					 #Read the input 		  syscall 		  move $t0, $v0					 #store the value in a temporary variable 		                                                 #store the base values in $t1, $t2 	 							 # $t1 iterates from m-1 to 1 								 # $t2 maintains a counter of the number of coprimes less than m   		 sub $t1, $t0, 1 		 li $t2, 0    	 tot: 		 blez $t1, done  				#termination condition 		 move $a0, $t0					#Argument passing 		 move $a1, $t1   				#Argument passing  		 jal gcd						#to GCD function 		 sub $t3, $v0, 1 					 		 beqz $t3, inc   				#checking if gcd is one 		 addi $t1, $t1, -1				#decrementing the iterator 		 b tot    	  inc: 		  addi $t2, $t2, 1				#incrementing the counter 		  addi $t1, $t1, -1				#decrementing the iterator 	 	  b tot   	  gcd:							#recursive definition 	         addi $sp, $sp, -12          	 sw $a1, 8($sp)  		 sw $a0, 4($sp)                  sw $ra, 0($sp)  		 move $v0, $a0					 		 beqz $a1, gcd_return			        #termination condition 		 move $t4, $a0					#computing GCD 		 move $a0, $a1 	 	 remu $a1, $t4, $a1  		 jal gcd 		 lw $a1, 8($sp) 		 lw $a0, 4($sp)   	 gcd_return: 		 lw $ra, 0($sp) 		 addi $sp, $sp, 12 		 jr $ra   	 done:							 #print the result 								 #first the message 		 la $a0, result_msg 		 li $v0, 4 		 syscall 								 #then the value 		 move $a0, $t2 		 li $v0, 1 		 syscall 								 #exit 		 li $v0, 10 		 syscall     .data 	 query: .asciiz "Input m =  " 	 result_msg: .asciiz "Totient(m) =  " 

Language design[edit]

Basic elements[edit]

There is a large degree of diversity in the way the authors of assemblers categorize statements and in the nomenclature that they use. In particular, some describe anything other than a machine mnemonic or extended mnemonic as a pseudo-operation (pseudo-op). A typical assembly language consists of 3 types of instruction statements that are used to define program operations:

Opcode mnemonics and extended mnemonics[edit]

Instructions (statements) in assembly language are generally very simple, unlike those in high-level language. Generally, a mnemonic is a symbolic name for a single executable machine language instruction (an opcode), and there is at least one opcode mnemonic defined for each machine language instruction. Each instruction typically consists of an operation or opcode plus zero or more operands. Most instructions refer to a single value, or a pair of values. Operands can be immediate (value coded in the instruction itself), registers specified in the instruction or implied, or the addresses of data located elsewhere in storage. This is determined by the underlying processor architecture: the assembler merely reflects how this architecture works. Extended mnemonics are often used to specify a combination of an opcode with a specific operand, e.g., the System/360 assemblers use B as an extended mnemonic for BC with a mask of 15 and NOP ("NO OPeration" - do nothing for one step) for BC with a mask of 0.

Extended mnemonics are often used to support specialized uses of instructions, often for purposes not obvious from the instruction name. For example, many CPU's do not have an explicit NOP instruction, but do have instructions that can be used for the purpose. In 8086 CPUs the instruction xchg ax,ax is used for nop, with nop being a pseudo-opcode to encode the instruction xchg ax,ax. Some disassemblers recognize this and will decode the xchg ax,ax instruction as nop. Similarly, IBM assemblers for System/360 and System/370 use the extended mnemonics NOP and NOPR for BC and BCR with zero masks. For the SPARC architecture, these are known as synthetic instructions.[8]

Some assemblers also support simple built-in macro-instructions that generate two or more machine instructions. For instance, with some Z80 assemblers the instruction ld hl,bc is recognized to generate ld l,c followed by ld h,b.[9] These are sometimes known as pseudo-opcodes.

Mnemonics are arbitrary symbols; in 1985 the IEEE published Standard 694 for a uniform set of mnemonics to be used by all assemblers. The standard has since been withdrawn.

Data directives[edit]

There are instructions used to define data elements to hold data and variables. They define the type of data, the length and the alignment of data. These instructions can also define whether the data is available to outside programs (programs assembled separately) or only to the program in which the data section is defined. Some assemblers classify these as pseudo-ops.

Assembly directives[edit]

Assembly directives, also called pseudo-opcodes, pseudo-operations or pseudo-ops, are instructions that are executed by an assembler at assembly time, not by a CPU at run time. The names of pseudo-ops often start with a dot to distinguish them from machine instructions. Pseudo-ops can make the assembly of the program dependent on parameters input by a programmer, so that one program can be assembled different ways, perhaps for different applications. Or, a pseudo-op can be used to manipulate presentation of a program to make it easier to read and maintain. Another common use of pseudo-ops is to reserve storage areas for run-time data and optionally initialize their contents to known values.

Symbolic assemblers let programmers associate arbitrary names (labels or symbols) with memory locations and various constants. Usually, every constant and variable is given a name so instructions can reference those locations by name, thus promoting self-documenting code. In executable code, the name of each subroutine is associated with its entry point, so any calls to a subroutine can use its name. Inside subroutines, GOTO destinations are given labels. Some assemblers support local symbols which are lexically distinct from normal symbols (e.g., the use of "10$" as a GOTO destination).

Some assemblers, such as NASM provide flexible symbol management, letting programmers manage different namespaces, automatically calculate offsets within data structures, and assign labels that refer to literal values or the result of simple computations performed by the assembler. Labels can also be used to initialize constants and variables with relocatable addresses.

Assembly languages, like most other computer languages, allow comments to be added to program source code that will be ignored during assembly. Judicious commenting is essential in assembly language programs, as the meaning and purpose of a sequence of binary machine instructions can be difficult to determine. The "raw" (uncommented) assembly language generated by compilers or disassemblers is quite difficult to read when changes must be made.


Many assemblers support predefined macros, and others support programmer-defined (and repeatedly re-definable) macros involving sequences of text lines in which variables and constants are embedded. This sequence of text lines may include opcodes or directives. Once a macro has been defined its name may be used in place of a mnemonic. When the assembler processes such a statement, it replaces the statement with the text lines associated with that macro, then processes them as if they existed in the source code file (including, in some assemblers, expansion of any macros existing in the replacement text). Macros in this sense date to IBM autocoders of the 1950s.[citation needed]

Note that this definition of "macro" is slightly different from the use of the term in other contexts, like the C programming language. C macros created through the #define directive typically are just one line, or a few lines at most. Assembler macro instructions can be lengthy "programs" by themselves, executed by interpretation by the assembler during assembly.

Since macros can have 'short' names but expand to several or indeed many lines of code, they can be used to make assembly language programs appear to be far shorter, requiring fewer lines of source code, as with higher level languages. They can also be used to add higher levels of structure to assembly programs, optionally introduce embedded debugging code via parameters and other similar features.

Macro assemblers often allow macros to take parameters. Some assemblers include quite sophisticated macro languages, incorporating such high-level language elements as optional parameters, symbolic variables, conditionals, string manipulation, and arithmetic operations, all usable during the execution of a given macro, and allowing macros to save context or exchange information. Thus a macro might generate numerous assembly language instructions or data definitions, based on the macro arguments. This could be used to generate record-style data structures or "unrolled" loops, for example, or could generate entire algorithms based on complex parameters. An organization using assembly language that has been heavily extended using such a macro suite can be considered to be working in a higher-level language, since such programmers are not working with a computer's lowest-level conceptual elements.

Macros were used to customize large scale software systems for specific customers in the mainframe era and were also used by customer personnel to satisfy their employers' needs by making specific versions of manufacturer operating systems. This was done, for example, by systems programmers working with IBM's Conversational Monitor System / Virtual Machine (VM/CMS) and with IBM's "real time transaction processing" add-ons, Customer Information Control System CICS, and ACP/TPF, the airline/financial system that began in the 1970s and still runs many large computer reservations systems (CRS) and credit card systems today.

It was also possible to use solely the macro processing abilities of an assembler to generate code written in completely different languages, for example, to generate a version of a program in COBOL using a pure macro assembler program containing lines of COBOL code inside assembly time operators instructing the assembler to generate arbitrary code.

This was because, as was realized in the 1960s, the concept of "macro processing" is independent of the concept of "assembly", the former being in modern terms more word processing, text processing, than generating object code. The concept of macro processing appeared, and appears, in the C programming language, which supports "preprocessor instructions" to set variables, and make conditional tests on their values. Note that unlike certain previous macro processors inside assemblers, the C preprocessor was not Turing-complete because it lacked the ability to either loop or "go to", the latter allowing programs to loop.

Despite the power of macro processing, it fell into disuse in many high level languages (major exceptions being C/C++ and PL/I) while remaining a perennial for assemblers.

Macro parameter substitution is strictly by name: at macro processing time, the value of a parameter is textually substituted for its name. The most famous class of bugs resulting was the use of a parameter that itself was an expression and not a simple name when the macro writer expected a name. In the macro: foo: macro a load a*b the intention was that the caller would provide the name of a variable, and the "global" variable or constant b would be used to multiply "a". If foo is called with the parameter a-c, the macro expansion of load a-c*b occurs. To avoid any possible ambiguity, users of macro processors can parenthesize formal parameters inside macro definitions, or callers can parenthesize the input parameters.[10]

Support for structured programming[edit]

Some assemblers have incorporated structured programming elements to encode execution flow. The earliest example of this approach was in the Concept-14 macro set, originally proposed by Dr. H.D. Mills (March 1970), and implemented by Marvin Kessler at IBM's Federal Systems Division, which extended the S/360 macro assembler with IF/ELSE/ENDIF and similar control flow blocks.[11] This was a way to reduce or eliminate the use of GOTO operations in assembly code, one of the main factors causing spaghetti code in assembly language. This approach was widely accepted in the early '80s (the latter days of large-scale assembly language use).

A curious design was A-natural, a "stream-oriented" assembler for 8080/Z80 processors[citation needed] from Whitesmiths Ltd. (developers of the Unix-like Idris operating system, and what was reported to be the first commercial C compiler). The language was classified as an assembler, because it worked with raw machine elements such as opcodes, registers, and memory references; but it incorporated an expression syntax to indicate execution order. Parentheses and other special symbols, along with block-oriented structured programming constructs, controlled the sequence of the generated instructions. A-natural was built as the object language of a C compiler, rather than for hand-coding, but its logical syntax won some fans.

There has been little apparent demand for more sophisticated assemblers since the decline of large-scale assembly language development.[12] In spite of that, they are still being developed and applied in cases where resource constraints or peculiarities in the target system's architecture prevent the effective use of higher-level languages.[13]

Use of assembly language[edit]

Historical perspective[edit]

Assembly languages date to the introduction of the stored-program computer. The Electronic Delay Storage Automatic Calculator (EDSAC) (1949) had an assembler called initial orders featuring one-letter mnemonics.[14] Nathaniel Rochester wrote an assembler for an IBM 701 (1954). SOAP (Symbolic Optimal Assembly Program) (1955) was an assembly language for the IBM 650 computer written by Stan Poley.[15]

Assembly languages eliminated much of the error-prone and time-consuming first-generation programming needed with the earliest computers, freeing programmers from tedium such as remembering numeric codes and calculating addresses. They were once widely used for all sorts of programming. However, by the 1980s (1990s on microcomputers), their use had largely been supplanted by higher-level languages, in the search for improved programming productivity. Today assembly language is still used for direct hardware manipulation, access to specialized processor instructions, or to address critical performance issues. Typical uses are device drivers, low-level embedded systems, and real-time systems.

Historically, numerous programs have been written entirely in assembly language. Operating systems were entirely written in assembly language until the introduction of the Burroughs MCP (1961), which was written in Executive Systems Problem Oriented Language (ESPOL), an Algol dialect. Many commercial applications were written in assembly language as well, including a large amount of the IBM mainframe software written by large corporations. COBOL, FORTRAN and some PL/I eventually displaced much of this work, although a number of large organizations retained assembly-language application infrastructures well into the 1990s.

Most early microcomputers relied on hand-coded assembly language, including most operating systems and large applications. This was because these systems had severe resource constraints, imposed idiosyncratic memory and display architectures, and provided limited, buggy system services. Perhaps more important was the lack of first-class high-level language compilers suitable for microcomputer use. A psychological factor may have also played a role: the first generation of microcomputer programmers retained a hobbyist, "wires and pliers" attitude.

In a more commercial context, the biggest reasons for using assembly language were minimal bloat (size), minimal overhead, greater speed, and reliability.

Typical examples of large assembly language programs from this time are IBM PC DOS operating systems and early applications such as the spreadsheet program Lotus 1-2-3. Even into the 1990s, most console video games were written in assembly, including most games for the Mega Drive/Genesis and the Super Nintendo Entertainment System.[citation needed] According to some[who?] industry insiders, the assembly language was the best computer language to use to get the best performance out of the Sega Saturn, a console that was notoriously challenging to develop and program games for.[16] The arcade game NBA Jam (1993) is another example.

Assembly language has long been the primary development language for many popular home computers of the 1980s and 1990s (such as the Sinclair ZX Spectrum, Commodore 64, Commodore Amiga, and Atari ST). This was in large part because interpreted BASIC dialects on these systems offered insufficient execution speed, as well as insufficient facilities to take full advantage of the available hardware on these systems. Some systems even have an integrated development environment (IDE) with highly advanced debugging and macro facilities.

The Assembler for the VIC-20 was written by Don French and published by French Silk. At 1,639 bytes in length, its author believes it is the smallest symbolic assembler ever written. The assembler supported the usual symbolic addressing and the definition of character strings or hex strings. It also allowed address expressions which could be combined with addition, subtraction, multiplication, division, logical AND, logical OR, and exponentiation operators.[17]

Current usage[edit]

There have always been debates over the usefulness and performance of assembly language relative to high-level languages. Assembly language has specific niche uses where it is important; see below. Assembler can be used to optimize for speed or optimize for size. In the case of speed optimization, modern optimizing compilers are claimed[18] to render high-level languages into code that can run as fast as hand-written assembly, despite the counter-examples that can be found.[19][20][21] The complexity of modern processors and memory sub-systems makes effective optimization increasingly difficult for compilers, as well as assembly programmers.[22][23] Moreover increasing processor performance has meant that most CPUs sit idle most of the time,[24] with delays caused by predictable bottlenecks such as cache misses, I/O operations and paging. This has made raw code execution speed a non-issue for many programmers.

There are some situations in which developers might choose to use assembly language:

Assembly language is still taught in most computer science and electronic engineering programs. Although few programmers today regularly work with assembly language as a tool, the underlying concepts remain very important. Such fundamental topics as binary arithmetic, memory allocation, stack processing, character set encoding, interrupt processing, and compiler design would be hard to study in detail without a grasp of how a computer operates at the hardware level. Since a computer's behavior is fundamentally defined by its instruction set, the logical way to learn such concepts is to study an assembly language. Most modern computers have similar instruction sets. Therefore, studying a single assembly language is sufficient to learn: I) the basic concepts; II) to recognize situations where the use of assembly language might be appropriate; and III) to see how efficient executable code can be created from high-level languages. [28] This is analogous to children needing to learn the basic arithmetic operations (e.g., long division), although calculators are widely used for all except the most trivial calculations.

Typical applications[edit]

Related terminology[edit]

List of assemblers for different computer architectures[edit]

Main article: List of assemblers

Further details[edit]

For any given personal computer, mainframe, embedded system, and game console, both past and present, at least one – possibly dozens – of assemblers have been written. For some examples, see the list of assemblers.

On Unix systems, the assembler is traditionally called as, although it is not a single body of code, being typically written anew for each port. A number of Unix variants use GAS.

Within processor groups, each assembler has its own dialect. Sometimes, some assemblers can read another assembler's dialect, for example, TASM can read old MASM code, but not the reverse. FASM and NASM have similar syntax, but each support different macros that could make them difficult to translate to each other. The basics are all the same, but the advanced features will differ.[34]

Also, assembly can sometimes be portable across different operating systems on the same type of CPU. Calling conventions between operating systems often differ slightly or not at all, and with care it is possible to gain some portability in assembly language, usually by linking with a C library that does not change between operating systems.[citation needed] An instruction set simulator can process the object code/ binary of any assembler to achieve portability even across platforms with an overhead no greater than a typical bytecode interpreter.[citation needed] This is similar to use of microcode to achieve compatibility across a processor family.

Some higher level computer languages, such as C and Borland Pascal, support inline assembly where sections of assembly code, in practice usually brief, can be embedded into the high level language code. The Forth language commonly contains an assembler used in CODE words.

An emulator can be used to debug assembly-language programs.

Example listing of assembly language source code[edit]

The following is a partial listing generated by the NASM, an assembler for 32-bit Intel x86 CPUs. The code is for a subroutine, not a complete program.

  1.                       ;----------------------------------------------------------- 
  2.                       ; zstr_count: 
  3.                       ; Counts a zero-terminated ASCII string to determine its size 
  4.                       ; in:   eax = start address of the zero terminated string 
  5.                       ; out:  ecx = count = the length of the string 
  7.                       zstr_count:                   ; Entry point 
  8.  00000030 B9FFFFFFFF      mov  ecx, -1              ; Init the loop counter, pre-decrement 
  9.                                                     ;  to compensate for the increment 
  10.                       .loop: 
  11.  00000035 41              inc  ecx                  ; Add 1 to the loop counter 
  12.  00000036 803C0800        cmp  byte [eax + ecx], 0  ; Compare the value at the string's 
  13.                                                     ;  [starting memory address Plus the 
  14.                                                     ;  loop offset], to zero 
  15.  0000003A 75F9            jne  .loop                ; If the memory value is not zero, 
  16.                                                     ;  then jump to the label called '.loop', 
  17.                                                     ;  otherwise continue to the next line 
  18.                       .done: 
  19.                                                     ; We don't do a final increment, 
  20.                                                     ;  because even though the count is base 1, 
  21.                                                     ;  we do not include the zero terminator in the 
  22.                                                     ;  string's length 
  23.  0000003C C3              ret                       ; Return to the calling program 

The first column (from the left) is simply the line number in the listing and is otherwise meaningless. The second column is the relative address, in hex, of where the code will be placed in memory. The third column is the actual compiled code. For instance, B9 is the x86 opcode for the MOV ECX instruction; FFFFFFFF is the value −1 in two's-complement binary form.

Names suffixed with colons (:) are symbolic labels; the labels do not create code, they are simply a way to tell the assembler that those locations have symbolic names. The .done label is only present for clarity of where the program ends, it does not serve any other purpose. Prefixing a period (.) on a label is a feature of the assembler, declaring the label as being local to the subroutine.

See also[edit]


  1. ^ Whether these bitgroups are orthogonal, or to what extent they are, depends on the CPU and instruction set design at hand.
  2. ^ a b David Salomon (1993). Assemblers and Loaders
  3. ^ Beck, Leland L. (1996). "2". System Software: An Introduction to Systems Programming. Addison Wesley. 
  4. ^ Hyde, Randall. "Chapter 12 – Classes and Objects". The Art of Assembly Language, 2nd Edition. No Starch Press. © 2010.
  5. ^ Intel Architecture Software Developer's Manual, Volume 2: Instruction Set Reference. Intel Corporation. 1999. Retrieved 18 November 2010. 
  6. ^ a b c Intel Architecture Software Developer's Manual, Volume 2: Instruction Set Reference. Intel Corporation. 1999. pp. 442 and 35. Retrieved 18 November 2010. 
  7. ^ Evans, David (2006). "x86 Assembly Guide". University of Virginia. Retrieved 18 November 2010. 
  8. ^ "The SPARC Architecture Manual, Version 8". SPARC, International. 1992. 
  9. ^ Z80 Op Codes for ZINT. Retrieved on 2013-07-21.
  10. ^ "Macros (C/C++), MSDN Library for Visual Studio 2008". Microsoft Corp. Retrieved 2010-06-22. 
  11. ^ "Concept 14 Macros". MVS Software. Retrieved May 25, 2009. 
  12. ^ "assembly language: Definition and Much More from". Retrieved 2008-06-19. 
  13. ^ Provinciano, Brian. "NESHLA: The High Level, Open Source, 6502 Assembler for the Nintendo Entertainment System". 
  14. ^ Salomon. Assemblers and Loaders. p. 7. Retrieved 2012-01-17. 
  15. ^ "The IBM 650 Magnetic Drum Calculator". Retrieved 2012-01-17. 
  16. ^ Eidolon's Inn: SegaBase Saturn
  17. ^ Jim Lawless (2004-05-21). "Speaking with Don French : The Man Behind the French Silk Assembler Tools". Archived from the original on 21 August 2008. Retrieved 2008-07-25. 
  18. ^ Rusling, David A. "The Linux Kernel". Retrieved Mar 11, 2012. 
  19. ^ a b "Writing the Fastest Code, by Hand, for Fun: A Human Computer Keeps Speeding Up Chips". New York Times, John Markoff. 2005-11-28. Retrieved 2010-03-04. 
  20. ^ "Bit-field-badness". 2010-01-30. Archived from the original on 5 February 2010. Retrieved 2010-03-04. 
  21. ^ "GCC makes a mess". 2009-05-13. Archived from the original on 16 March 2010. Retrieved 2010-03-04. 
  22. ^ Randall Hyde. "The Great Debate". Archived from the original on 16 June 2008. Retrieved 2008-07-03. 
  23. ^ "Code sourcery fails again". 2010-01-30. Archived from the original on 2 April 2010. Retrieved 2010-03-04. 
  24. ^ Click, Cliff. "A Crash Course in Modern Hardware". Retrieved May 1, 2014. 
  25. ^ "BLAS Benchmark-August2008". 2008-08-01. Retrieved 2010-03-04. 
  26. ^ "x264.git/common/x86/dct-32.asm". 2010-09-29. Retrieved 2010-09-29. 
  27. ^ "68K Programming in Fargo II". Archived from the original on 2 July 2008. Retrieved 2008-07-03. 
  28. ^ Hyde, Randall (1996-09-30). "Foreword ("Why would anyone learn this stuff?"), op. cit.". Archived from the original on 25 March 2010. Retrieved 2010-03-05. 
  29. ^ Technically BAL was only the assembler for BPS; the others were macro assemblers.
  30. ^ Stroustrup, Bjarne (1986). The C++ Programming Language. Addison-Wesley. ISBN 0-201-12078-X. C++ was primarily designed so that the author and his friends would not have to program in assembler, C, or various modern high-level languages. [use of the term assembler to mean assembly language] 
  31. ^ Saxon, James; Plette, William (1962). "Programming the IBM 1401". Prentice-Hall. LoC 62-20615. [use of the term assembly program] 
  32. ^ Microsoft Corporation. "MASM: Directives & Pseudo-Opcodes". Retrieved March 19, 2011. 
  33. ^ (John Daintith, ed.) A Dictionary of Computing: "meta-assembler"
  34. ^ Randall Hyde. "Which Assembler is the Best?". Archived from the original on 18 October 2007. Retrieved 2007-10-19. 

Further reading[edit]

External links[edit]