Home > Articles > Programming

A Light Introduction to ARM Assembly

Most modern mobile and embedded platforms use ARM chips. These are among the last places where programming in an assembly language actually makes sense. David Chisnall looks at why and gives a gentle introduction to ARM assembly.
Like this article? We recommend

These days, most developers can get away without writing any assembly code. There are only really two cases where it's ever applicable:

  • Where you have some performance-critical code and your C compiler doesn't do a good enough job.
  • Where your high(er)-level language isn't sufficiently expressive.

The first case is increasingly rare. Compilers keep getting better, and CPUs keep getting faster. WordPerfect for DOS was originally written entirely in 8086 assembly to achieve the speed it required, and it didn't even do WYSIWYG editing. Today, Google Docs manages to do more, yet is written in JavaScript. No one cares that it doesn't run on a 4.77MHz 16-bit processor with 128KB of RAM.

The latter is slightly more common. Some things are simply impossible to do in C. A simple example is a trampoline that calls another function with the same arguments. This is not possible to implement in C in the general case.

I recently had to implement a trampoline like this for the GNUstep Objective-C runtime's version of imp_implementationForBlock(). To understand how this works, you need to understand how Objective-C methods and blocks are implemented. There's a full explanation in my Objective-C Phrasebook, but I'll try to give a summary here:

An Objective-C method has two hidden parameters, named self and _cmd. The first is a pointer to the receiver; the second is the selector that was used to look up the method. There's a more detailed explanation of why in my book, if you're interested in how Objective-C really works. A block has one hidden argument (the block structure).

The imp_implementationForBlock() function is used to turn the latter into the former. It must, at runtime, create a new function that, when called, will move the receiver from the first argument to the second and load the block into the first.

In C, it would be something vaguely like this:

id block_trampoline(id self, SEL _cmd)
    block->invoke(block, self);

Of course, this is a very simplified version that ignores where the block comes from (in the real version, it's loaded from the word before the start of the function) and ignores what happens if the block takes any arguments other than self. This is only three ARM instructions, but it's impossible to implement in the general case in C. The assembly version just moves the object pointer from register 1 to register 0, loads the block pointer into register 1, and then loads the block's invoke field into the program counter register (which achieves a jump).

This particular example is interesting because the same trampoline can be copied repeatedly. To simplify things, I stored the block and its invoke pointer immediately before the trampoline. This is one fairly common use of assembly: generating a snippet of code that you can then duplicate at runtime. Every time you call imp_implementationForBlock(), the runtime will copy this little trampoline into a new bit of memory and return a function for you to use. This is similar to how GCC implements nested functions, but can be done entirely at runtime.

Generally, the rule should always be that if you can do something without writing assembly, and it's fast enough, then you should. For example, a lot of older projects used assembly code for vector or atomic operations. These are now typically provided as compiler intrinsics and can be a lot more portable. For example, an atomic add operation is different on every architecture, but a compiler intrinsic can be the same.

Calling Assembly Code

There are several ways of inserting assembly code into a project. The simplest is to create a separate compilation unit for the assembly code. You can then call functions written in it as if they were C functions.

This requires you to understand the calling conventions of the architecture. Fortunately, for ARM these are quite simple. ARM has 16 registers and uses the first four to pass integer (and pointer) arguments and the first two to return integer results. Arguments after these are passed on the stack.

Passing floating-point arguments is a lot more complex because it depends on the ABI. In hard-float mode, they are passed in floating-point registers. This is problematic if the CPU doesn't have a floating-point unit (FPU) because it means that every instruction copying the value to or from the register causes a trap and must be emulated in the kernel. In soft-float mode, they are passed in integer registers. This is problematic if you do have an FPU, because every move between the FPU and integer units causes a pipeline stall (and typically a 15-cycle penalty). One simple hack to work around this is to pass pointers to floating-point values that are stored on the stack. This is actually used in quite a lot of C code on ARM.

There are two ways of calling into assembly code from C. The simplest is to make the compiler do all of the complex work for you. You can do this using inline assembly, like this:

int atomic_add_or_fail(int *addr, int a)
    int ret;
    asm (
         "     ldrex r0, [%1]     \n"
         "     add   r0, r0, %2   \n"
         "     strex %0, r0, [%1] \n" 
         : "=r" (ret)
         : "r" (addr), "r" (a)
         : "r0");
    return !ret;

This is a simple function that attempts to atomically add the value passed in the second argument to the value in the address passed as the first. It returns 0 if the operation failed and 1 if it succeeded.

This uses two instructions that are relatively recent additions to the ARM architecture: load and store exclusive, with the ldrex and strex mnemonics, respectively. The ldrex instruction loads the value into a register and sets the address in the exclusive monitor. The corresponding store exclusive will fail if the memory address has been written to since the load.

The instruction in the middle is an add instruction, similar to the one that you will find on any RISC architecture. This, like all ARM arithmetic operations, takes three operands. The first is the destination and the next two are the operands.

Typically you would simply retry this if it failed, but you may want some version with bounded running time—for example, trying this 100 times and giving up if it can't successfully update the memory address.

This uses GNU-syntax inline assembly. The first three lines in the asm block contain assembly code. The remainder tells the compiler how to insert it into the code. The first of these is the list of output registers; here "=r" means register used for output and the (ret) means that the ret variable should be used. The next line contains the input registers. The final line contains the list of registers that we clobbered (i.e., ones whose state is not preserved across this assembly snippet).

The other thing to notice about this example is that I'm using %0 and so on in place of some register arguments. This example only uses one explicit register: register 0. The other registers will be allocated by the compiler. The advantage of this approach is that the compiler's register allocator can pick ones to use. Remember that, although this looks like a stand-alone function, it may be inlined subsequently, and then some of the registers may be in use.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020