✳flâneur — a map of the web's best reading

Assembly Language - Algorithmica

en.algorithmica.org · 1,823 words · saved by 1 readers

CPUs are controlled with machine language, which is just a stream of binary-encoded instructions that specify A much more human-friendly rendition of machine language, called assembly language, uses mnemonic codes to refer to machine code instructions and symbolic names to refer to registers and other storage locations. Jumping right into it, here is how you add two numbers (*c = *a + *b) in Arm assembly: Here is the same operation in x86 assembly: Assembly is very simple in the sense that it doesn’t have many syntactical constructions compared to high-level programming languages. From what you can observe from the examples above: Assembly is a very minimal language because it needs to be. It reflects the machine language as closely as possible, up to the point where there is almost 1:1 correspondence between machine code and assembly. In fact, you can turn any compiled program back into its assembly form using a process called disassembly1 — although everything non-essential like comm

CPUs are controlled with machine language , which is just a stream of binary-encoded instructions that specify the instruction number (called opcode ), what its operands are (if there are any), and where to store the result (if one is produced). A much more human-friendly rendition of machine language, called assembly language , uses mnemonic codes to refer to machine code instructions and symbolic names to refer to registers and other storage locations. Jumping right into it, here is how you add two numbers ( *c = *a + *b ) in Arm assembly: ; *a = x0, *b = x1, *c = x2 ldr w0 , [ x0 ] ; load 4

Explore this link on the map →

related reading