Home > Articles > Programming > C/C++

Like this article? We recommend

Like this article? We recommend

Memory Management Guidelines for malloc, calloc, realloc

Memory Management Guidelines for malloc, calloc, realloc

The first guideline is to free memory only if that memory was allocated successfully. This rule sounds obvious, so let's see an example in Listing 4.

Listing 4—Use free only when malloc succeeded.

char* textString = NULL;

textString = malloc(256);
if (textString == NULL) {
cout<< "Failed malloc" << endl;
return NULL;

}

// Use free() only if malloc() succeeded
if (textString != NULL) {
free(textString);
textString = NULL;

}

In Listing 4, we use free() only on an allocated block. Using free() on an unallocated block may result in unexpected behavior. This might be considered a system language detail; that is, the caller of free() is presumed to pass only valid (allocated memory) data. In other words, when you pass an item to free(), you must be sure that it is correct to do so.

Notice the way I set the value of textString to NULL both before allocation and after deallocation in Listing 4. Does this seem like a bit of a waste of time? The fact is, you'll often see this approach in legacy code. We'll see why I do this in the next section, where it will become apparent that when allocating memory we need to maintain state information.

Maintaining Memory Allocation State

Let's say you have code that allocates memory in a number of places. As we saw in Listing 4, when the time comes to deallocate that memory, it's best to know exactly which allocations succeeded and which ones failed. The goal is to avoid attempting to free unallocated memory.

A simple and effective approach to tackling this problem is to initialize all pointers to NULL before memory allocation and then to repeat the exercise just after deallocation. This way, you can be sure that all allocated variables contain an implicit indication of successful or unsuccessful allocation. This is a kind of overloading exercise, where a pointer variable contains information about whether or not it points at anything. If it doesn't point at anything, then it has the value NULL. On the other hand, if a pointer is not NULL, then it points at something valid and hence can be deallocated.

Imagine if, midway through code that allocates multiple blocks of memory, your code throws an exception. Without explicit NULL assignment as described here, it may be difficult to know which variables to free.

One obvious question: Can we live with code that leaks memory?

The Consequences of Memory Leaks

As mentioned earlier, if leaky code in a function or method repeats often enough, the system may eventually run out of physical memory. This is particularly likely on systems that run continuously. Also, even if virtual memory is available (which may not be the case on embedded systems), as physical memory runs low, new allocations may be made in virtual memory. However, you can be fairly certain that, if memory is leaking, some catastrophic failure will likely occur eventually. Memory leakage is therefore a problem best avoided by following some simple guidelines:

  • Set unallocated pointers to NULL.
  • Successful allocations with malloc, calloc, realloc should be paired with calls to free.
  • Allocations with new should be paired with type-specific calls to delete; don't forget to use the array symbol if required.
  • Set deallocated pointers to NULL.
  • Ensure that programmer deallocation responsibilities are known in cases where a library returns allocated memory.

Sadly, there are also other possibilities for getting memory allocation wrong.

Off-by-One Memory Allocation

Aside from the issue of erroneously freeing unallocated memory, another common error can occur when allocating memory to hold a copy of a string. This error can occur as illustrated in Listing 5:

Listing 5—No space is allocated for the string terminator.

char* srcStr = "Hello there";
char* textString = (char*)malloc(strlen(srcStr));
strncpy(textString, srcStr, strlen(srcStr));
// No room for string terminator

The string textString in Listing 5 is copied successfully from srcStr, but now it has no termination character.

In Listing 6, an additional space is allocated for the textString string. This design allows sufficient space to copy the incoming string. For completeness, I've added a few more items to Listing 6 based on the earlier guidelines about deallocation. See if you can figure out why I made the code changes.

Listing 6—One additional space is allocated for the string terminator.

char* srcStr = "Hello there";
char* textString = NULL;
textString = malloc(strlen(srcStr) + 1);
if (textString != NULL) {
  memset(textString, '\0', strlen(srcStr) + 1);
  strncpy(textString, srcStr, strlen(srcStr));
  // Lots more code here
}
if (textString != NULL) {
  free(textString);
  textString = NULL;
}

In Listing 6, sufficient space is allocated for the string. In addition, the newly allocated string is zeroed out, followed by copying in the contents of the incoming string. Notice that I use the strncpy() function, which is safer than strcpy(). This is because strncpy()copies only a defined number of characters. The strcpy() function, on the other hand, copies up to the point where it finds a string-termination character. If you pass an unterminated string into strcpy(), it will copy beyond the end of the supplied incoming string until it finds a termination character. This might result in copying an arbitrarily large amount of memory[md]far beyond the size of the destination pointer.

What does C++ 11 offer when it comes to memory allocation? For one thing, it has what are called unique pointers. Before looking at C++ 11, let me make one important general point about memory leaks.

Memory-Leakage Avoidance Is the Best Cure

I recently had to chase down a memory leak in my own C++ code. The program was running out of memory after continuous operation for a day or so. It turned out that an array allocation wasn't being deleted correctly. The problem was basically as illustrated in Listing 7:

Listing 7—Allocating and freeing an array in C++.

ComplicatedStruct* anArray = NULL;
anArray = new ComplicatedStruct [5000];
//Lots of code here

// Missing a call to
delete []anArray;
anArray = NULL;

In Listing 7, the allocated array is deleted after use, and its memory is returned to the free pool.

The preceding discussion on memory management has focused on legacy codebase issues. What about the use of so-called "smart pointers"? To answer this question, let's turn to C++ 11.

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