Home > Articles > Programming > C#

  • Print
  • + Share This
Like this article? We recommend

Like this article? We recommend

Building Blocks

Memory orderings are the complicated part of the specification; the operations that are allowed are significantly simpler. The syntax varies slightly between C and C++. In C, they're defined in <stdatomic.h> as functions, whereas in C++ they're members of the std::atomic<> family of templates in <atomic>. I'll use the C versions for the rest of this article, but the C++ versions are very similar.

Most of the functions take a memory order as the final argument. For example, a simple atomic increment looks like this:

_Atomic(int) i;
// Implicitly memory_order_seq_cst
atomic_fetch_add(&i, 1);
atomic_fetch_add_explicit(&i, 1, memory_order_relaxed);

This is a single instruction on x86, but on other architectures it's implemented in terms of simpler building blocks. One form is exposed in the compare-and-exchange operation, which is quite complex. It loads a value from an address and compares that value against an existing one; if they're the same, it writes a new value. In some architectures, this is a single instruction. In RISC architectures, it's usually implemented by a pair of linked load and store operations, where the store fails if something has written to the memory address since the load.

The simplest compare-and-exchange in the standard is atomic_compare_exchange_strong(), which takes a pointer to the memory address, a pointer to the old value (which will be updated if the operation fails), and a third pointer to the new value. A simple use would be an atomic update loop, like this:

_Atomic(int) *v;
int old = *atomic_load(v);
do {
      int new = someCalculation(old);
} while(!atomic_compare_exchange_strong(v, *old, new));

This will keep performing the calculation on the value in the memory address and trying to write it until the value in memory is the expected value.

There is also a weak version, which is allowed to fail spuriously. This version should be used if someCalculation() is very cheap. It may generate the same code as the strong version, but in some cases it can generate more-efficient code that might sometimes loop when it shouldn't.

If this example were compiled for ARM or PowerPC, the strong compare-and-exchange operation would use a load-interlocked and store-exclusive instruction pair. The weak version could transform the atomic load into a load-interlocked instruction. If another thread, between the load and the compare-and-exchange, wrote to v, but wrote back the same value, then you would get a spurious failure, but in most cases you would get the same behavior from a shorter instruction sequence.

Both versions come with variants with the _explicit suffix. Unlike most of the atomic operations, which take one memory ordering, these take two: one for the case when they succeed, and one for the case when they fail. This design is particularly useful for implementing locks. If you fail to acquire a lock, you can use a relaxed ordering, but if you succeed then you probably want acquire ordering. Again, this is most useful for RISC architectures. If the store-exclusive instruction succeeds, it will be followed by a memory-barrier instruction. If it fails, it will jump back to before the load-interlinked instruction and start again.

For other operations, you may want to insert explicit memory barriers. The atomic_thread_fence() and atomic_signal_fence() functions take a memory ordering and insert a memory barrier at the correct point. This is useful for optimization in some cases; for example, you can use memory_order_relaxed on a small sequence of operations and then insert an explicit memory_order_seq_cst fence after them, rather than making all of them sequentially consistent. Or you can insert just the fence if an operation gives a specific result.

This article has only given you a fairly broad overview of the C11 and C++11 atomic operations specifications, but hopefully it's enough to see how flexible they are. The design of the new atomic operations is my favorite bit of C11 — clearly, a lot of thought has gone into it.

  • + Share This
  • 🔖 Save To Your Account

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