Home > Articles > Security > Software Security

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

Like this article? We recommend

Memory Woes

The C memory model divides memory into two locations—the heap and the stack. Memory on the heap is allocated and freed manually. Memory on the stack is lexically scoped; it's allocated automatically when a block is entered and freed when the block is left.

This practice leads to problems when passing data back to a calling function. For structures, the obvious thing to do is simply return the structure. When this is compiled, the caller is responsible for allocating the structure and passes a pointer to the callee, which then copies the data into this space. If you pass a structure back through a lot of function calls, however, this results in a lot of copying.

Worse, this doesn't work at all for dynamically sized data. Consider something like sprintf(). This analog of printf() writes to a buffer rather than to the standard output. The problem with sprintf is that the caller needs to know the length of the buffer, which isn't always easy—in fact, it requires implementing a lot of sprintf in the caller.

In fact, it's almost impossible to use sprintf safely. You need to specify lengths for every single element in your format string. (This is why snprintf was created.) This can result in truncation (which can also cause security problems, and we'll come back to that later), so some libc implementations also include asprintf().

The asprintf() function is like sprintf, except that it allocates its own buffer using malloc. This prevents suffering from truncation or overflow. Unfortunately, it exposes a new problem: When should the caller free pointers returned by the callee?

A lot of C code has this problem. The solution is typically to put "the caller must free the returned pointer" in the documentation for a function. Unfortunately, this practice makes it very difficult to glance at a piece of code and see whether it's valid. One solution is to wrap every pointer return in something like this:

typedef struct _RefCountedBuffer
{
    void *buffer;
    int refcount;
    void (free*)(struct _RefCountedBuffer*);
} *RefCountedBuffer;

When you return a pointer, you create one of these structures and set refcount to 1. When you receive one, you always call a function that decrements the refcount and calls the associated free() function if it reaches zero.

This technique will be familiar to Objective-C programmers, because OpenStep implements a similar mechanism. GNUstep goes one step further, providing ASSIGN() and DESTROY() macros. These macros make memory bugs a lot more rare, and we can do something similar in pure C.

First, we need to define retain() and release() functions:

RefCountedBuffer retain(RefCountedBuffer *buf)
{
    buffer->refcount++;
    return buffer;
}

void release(RefCountedBuffer *buf)
{
    buf->refcount--;
    if (buf->refcount == 0)
        buf->free(buf);
}

Note that these are simplified versions of the functions you would really need. The most obvious problem is that they're not thread-safe. The ++ and -- operators are usually compiled down to a sequence of load, add (or subtract), store. If two threads to a retain at once (for example), they might both do the load before either has done the store, and one retain will be lost. You can get around this problem by using CPU-specific assembly language or GCC intrinsics for atomic operations.

Once you have these functions defined, you can define SET and FREE macros like this:

#define SET(var, val) do {    RefCountedBuffer __tmp = retain(val);    if (NULL != var)        release(var)    var = __tmp;    } while(0)

Note that you retain the new value before releasing the old one, which avoids problems in the case where the new and old values are the same. The corresponding FREE() macro is quite simple:

#define FREE(var) do {    release(var)    var = NULL;    } while(0)

This macro ensures that every pointer is always set to NULL after freeing it. Even if you don't use reference counting, this practice is worthwhile.

If you use both of these macros, you'll have very few equals signs in your code. This makes it easy to look through and find cases where you might have memory-related bugs.

Reference counting is a good solution for read-only data. You can return some internal component of a large data structure as a reference, not deleting it from the original structure until it's finished in both uses—as long as it's wrapped in a RefCountedBuffer structure in both cases.

This design doesn't solve our original problem of something like asprintf, however. It wants to return a string that's often used only in the caller. For this, allocating on the heap and wrapping in a reference counting structure is overkill. What you want is a way of allocating the space in the caller's stack frame.

The designers of the Dovecot IMAP server have an elegant solution. In addition to the normal control stack, they provide a separate data stack and an analog of asprintf that uses it. The caller first calls a function that allocates a new data stack frame. It then calls the asprintf() analog, which allocates space on the data stack for the result and returns. This remains valid until the caller pops the top data stack frame.

Because the control and data stacks move at different speeds, you can easily return data on the data stack. As long as the function that created a data stack frame also destroys it, you have no problems. The flow for something like asprintf() is to first create a data stack frame, and then call asprintf(), which allocates space in the current data stack frame and puts the result into it. You use the result and then pop the current stack frame.

Nothing stops you from having multiple independent memory regions. You can use mmap() on /dev/zero to allocate a contiguous blob of memory somewhere and do whatever you want in it. One possible idea is to allocate a data stack that moves at the same speed as the control stack. Use this trick for all arrays that you would otherwise allocate on the stack. Unlike the control stack, this can grow upward in memory. You can make it relocatable by always addressing it via a global pointer to the start; for example, with macros like these:

#define NEW_ARRAY(type, name, elements) __attribute__((cleanup(popDataStack)))    type *name = dataStackCalloc(sizeof(type), elements)

The __attribute__(cleanup) part is a GCC extension. It causes the popDataStack() function to be called with a pointer to the variable as the argument when the variable goes out of scope. You now have a pointer to something in the data stack. Rather than employing direct access, you might have macros that add this address to a pointer. This setup allows the size of your data stack to keep growing until you don't have enough contiguous memory free to store all of it.

You can still run over the end of an array, however. You won't clobber a return address, but you'll potentially overwrite some data or have other problems. You can avoid going over the end of the data stack by using the mprotect() call on the last page in the stack to remove all access rights. Most malloc() implementations have a debugging mode that inserts this sort of guard page after every allocation. You can do this by making your data stack a stripe of accessible and inaccessible pages, with every array allocated so that it ends just before an inaccessible page, but this system is quite costly. A sensible operating system won't allocate any real memory for the guard pages, but you'll waste a lot of space in the gaps from the start of pages to the start of arrays, and you'll use a lot of address space.

  • + 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.

Overview


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.

Surveys

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.

Newsletters

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.

Security


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

Children


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

Marketing


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.

Choice/Opt-out


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.

Links


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