Consuming APIs in C: a practical guide for modern developers
Today, consuming web APIs is a common practice for exchanging data between applications. Tutorials on consuming APIs in languages like JavaScript, Python, or PHP are plentiful, but C—often associated with system-level programming—is rarely considered for this purpose. However, C is perfectly capable of handling API requests, making it a viable choice for scenarios like Point of Sale (PoS) systems, IoT devices, or embedded applications, where C is already used for its efficiency and low-level control.
This article explores how to consume APIs in C, leveraging the libcurl library. By the end, you'll understand how to fetch and process data from APIs using C, and why this approach is relevant even in modern development.
Why use C for consuming APIs?
While higher-level languages dominate web development, C is still a practical choice for consuming APIs in specific use cases:
- Performance: C provides high performance and minimal overhead, making it suitable for resource-constrained environments like IoT devices.
- Control: direct memory management allows fine-tuned optimization, especially for embedded systems.
- Interoperability: C’s widespread use means it integrates well with system-level operations, such as controlling hardware, sensors, or other peripherals.
- Longevity: applications built in C often have long lifespans, especially in industries like retail or manufacturing.
Introducing libcurl: the tool for HTTP in C
To consume APIs in C, libcurl is the go-to library. It’s an open-source, portable, and feature-rich library for handling network requests over HTTP, HTTPS, FTP, and more. It supports:
- Making GET, POST, and other HTTP requests.
- Handling headers and authentication.
- Processing responses efficiently.
Basic steps for consuming an API in C
Let’s walk through the process of consuming an API using C, focusing on a real-world example of fetching JSON data.
Setup and installation
To use libcurl, you need to install it on your system. For most Linux distributions, this can be done with:
sudo apt-get install libcurl4-openssl-dev
On Windows, you can download precompiled binaries from the libcurl website: https://curl.se/download.html
On macOS if you use Homebrew you can install it via
brew install curl
Structuring your C program
A simple C program to fetch data from an API involves the following components:
- Initializing libcurl.
- Configuring the API request (URL, HTTP method, headers, etc.).
- Receiving and storing the response.
- Cleaning up resources.
Here’s an example program to fetch JSON data from a public API:
sudo apt-get install libcurl4-openssl-dev
Steps to run
Save the code in a file, e.g., get.c.
Compile it with the following command:
brew install curl
Run the compiled program:
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <curl/curl.h> // Struct to hold response data struct Memory { char *response; size_t size; }; // Callback function to handle the data received from the API static size_t ResponseCallback(void *contents, size_t size, size_t nmemb, void *userp) { size_t totalSize = size * nmemb; struct Memory *mem = (struct Memory *)userp; printf(". %zu %zu\n", size, nmemb); char *ptr = realloc(mem->response, mem->size + totalSize + 1); if (ptr == NULL) { printf("Not enough memory to allocate buffer.\n"); return 0; } mem->response = ptr; memcpy(&(mem->response[mem->size]), contents, totalSize); mem->size += totalSize; mem->response[mem->size] = '<pre class="brush:php;toolbar:false">gcc get.c -o get -lcurl
Understanding the callback mechanism in HTTP responses with libcurl
When working with libcurl to handle HTTP responses in C, it’s important to understand the behavior of the callback function. The callback function you define to process the response data, such as the ResponseCallback function, may be invoked multiple times for a single HTTP response. Here’s why and how this works.
Why is the callback invoked multiple times?
The callback mechanism in libcurl is designed to handle data efficiently and flexibly. Instead of waiting for the entire response to be downloaded before processing it, libcurl processes the response in smaller chunks, calling your callback function as each chunk is received.
This behavior allows:
- Efficient Memory Usage: by processing chunks incrementally, you avoid the need to allocate a large block of memory upfront for the entire response.
- Streamed Processing: you can process or act on each chunk as it arrives, which is useful for streaming large responses or handling data in real-time.
How Does It Work?
Each time a chunk of data is received from the server, libcurl calls your callback function. The size of each chunk depends on network conditions, buffer sizes, and libcurl’s internal logic.
The callback has to accumulate the chunks, ultimately reconstructing the full response.
Here’s an example sequence:
- The server starts sending the response.
- libcurl receives the first chunk and calls the callback.
- The callback processes or stores the chunk.
- libcurl receives the next chunk and calls the callback again.
- This process continues until the entire response is received.
Step-by-Step source code explanation for ResponseCallback function
The ResponseCallback is the function called when data is received by libcurl.
Function Declaration
sudo apt-get install libcurl4-openssl-dev
- void *contents: this is a pointer to the data received from the server. libcurl provides this buffer and fills it with the data it downloads.
- size_t size and size_t nmemb: These represent the size of each memory block (size) and the number of blocks (nmemb). Together, size * nmemb gives the total size of the data received in this chunk.
- void *userp: this is a user-defined pointer passed to the callback function via curl_easy_setopt(curl, CURLOPT_WRITEDATA, ...). In this example, it's a pointer to a struct Memory object, which stores the full response.
Calculate total data size
brew install curl
This computes the total size of the current chunk of data received by multiplying the size of one block (size) with the number of blocks (nmemb).
For example, if the server sends 8 blocks of 256 bytes each, totalSize will be 8 * 256 = 2048 bytes.
Access user data (struct Memory)
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <curl/curl.h> // Struct to hold response data struct Memory { char *response; size_t size; }; // Callback function to handle the data received from the API static size_t ResponseCallback(void *contents, size_t size, size_t nmemb, void *userp) { size_t totalSize = size * nmemb; struct Memory *mem = (struct Memory *)userp; printf(". %zu %zu\n", size, nmemb); char *ptr = realloc(mem->response, mem->size + totalSize + 1); if (ptr == NULL) { printf("Not enough memory to allocate buffer.\n"); return 0; } mem->response = ptr; memcpy(&(mem->response[mem->size]), contents, totalSize); mem->size += totalSize; mem->response[mem->size] = '<pre class="brush:php;toolbar:false">gcc get.c -o get -lcurl
The userp pointer is cast to a struct Memory *. This struct was passed earlier in the main program and is used to accumulate the received data.
The struct Memory is defined as:
./get
- response: a dynamically allocated string that stores the downloaded data.
- size: the current size of the response string.
Reallocate memory
static size_t ResponseCallback(void *contents, size_t size, size_t nmemb, void *userp)
Resizes the response buffer to accommodate the new data chunk:
- mem->size: the current size of the buffer.
- totalSize: The size of the new chunk.
- 1: Space for the null-terminator (
The above is the detailed content of Consuming APIs in C: a practical guide for modern developers. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.

The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.

The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.

C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.

Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.
