Home > Articles > Programming > C/C++

Automatic Reference Counting in Objective-C, Part 2: The Details

In the second of a two-part series, David Chisnall, author of The Objective-C Phrasebook, takes a look at how Automatic Reference Counting interoperates with C and C++, and how some of the optimizations work.
Like this article? We recommend

Like this article? We recommend

In Part I, we looked at the basic ideas behind ARC and how it works in pure Objective-C code. In this article, we'll go a bit deeper and see how it works with the C memory model, with Objective-C++, and what the compiler is doing to make it fast.

How It Works

When you compile code using ARC, the compiler inserts calls to functions like objc_retain() and objc_release(). These are inserted, rather than -retain and -release message sends, for several reasons. They are smaller and faster than message sends, easier for the optimizer to recognize, faster, and easier to inline.

The optimizer is very important. The implementation of ARC is split into three components. The compiler front end generates calls to these functions. The optimizer removes as many as it can, and the runtime library implements the required functions.

The fact that the optimization is all done on the LLVM intermediate representation, rather than in the front end, is very helpful because it means that it's useable by other compilers. I've written a Smalltalk compiler that generates code that is binary-compatible with LLVM. I can now make it use the ARC functions, rather than its own retain/release code, and it will use the same LLVM optimizations.

The optimizer uses local balancing: It assumes that every function is safe with respect to maintaining valid pointers, and will attempt to remove redundant retain and release operations on this assumption. The optimizer is still a bit of a work-in-progress, but it already works quite well.

Some of its transforms are quite simple. As well as the primitive runtime calls, the ABI also defines some combined versions, such as objc_retainAutorelease(), which is a combination of objc_retain() followed by objc_autorelease(), and objc_storeWeak(), which releases the old value and retains the new one. The optimizer will try to use the combined versions where possible. In the worst case they'll have similar performance, but it's also possible to implement them more efficiently in the runtime. Even if they're slightly slower, you'd still save from only having one call and from the smaller code required for one call than two.

The next set of optimizations is more interesting. It tries to remove redundant calls. For example, consider something like:

    [x someMessage];
    [x someOtherMessage];

This seems pretty stupid, but the front end can emit it because part of the design of ARC is to avoid the need for the front end to do complex flow analysis. The optimizer can simplify it to:

    [x someMessage];
    [x someOtherMessage];

This is even more important with things like loops. If there's a retain-release pair on a loop invariant, then they can be hoisted to either side of the loop. If you look at the source code for the optimizer, you'll see a lot of planned optimizations that aren't finished yet. In particular, it's possible to transform autorelease into release in a lot of cases.

Earlier, I talked about using a __autoreleasing id for a return value to catch an autoreleased return value. This reduces the number of retain/release calls, so you have something like:

    id a = foo();
    // a is autoreleased, so will be deallcoated later

Instead of:

    id a = objc_retainAutoreleasedReturnValue(foo());

This may seem better, but often isn't. The autoreleased object may not be collected for some time. It will take up some space in the autorelease pool and will be wasting RAM. The optimizer will (in the future) try to convert the first form into the latter. This increases the code size slightly, but means that short-lived objects are really short-lived objects. They won't sit around using RAM until the end of the run loop.

The objc_retainAutoreleasedReturnValue() call is particularly clever. If the value has just been autoreleased and returned, then rather than retaining it, this un-autoreleases it. Conceptually, it removes the object from the autorelease pool, but in fact it removes it from some thread-local storage, where it was inserted instead of being put in the autorelease pool. This allows functions to return non-owning references without the need to fill up the autorelease pool and artificially extend the lives of temporary objects.

A more interesting form of this optimization is also planned. Autorelease pools are now created and destroyed in a way that it's easy for the optimizer to modify. For example, if you do something like:


The optimizer can see where obj will be deallocated and turn the autorelease into a release. This looks like a weird thing to do, but the ARC optimizers can run after inlining, and it's entirely possible that a function that returns an autoreleased value will be inlined into a function that creates an autorelease pool.

More interestingly, the optimizer can insert the autoreleasepool push and pop functions itself, if it determines that a lot of short-lived objects are going to be created. It may do this around loops, for example, but it's most likely that this will run as a profile-driven optimization at some point in the future. This is possible because the optimizer can now easily extend the life of temporary objects by calling objc_retain() on them before objc_autoreleasePoolPop() and then objc_autorelease() after, for the ones that need to persist beyond where it's inserted an autoreleasepool scope.

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