What kind of compiled language is c language?
What is compilation mode?
Compilation mode refers to how to place program code and data in memory, how to allocate stacks, and confirm the occupied memory size and how to access them. When the memory mode (compilation mode) is specified, the language The compiler will compile and organize the program according to the pre-selected memory mode.
C language provides 6 compilation modes, these 6 modes are: Tiny, Small, Medium, Compact, Large ) and giant mode (Huge). Users can choose according to their own program size and needs.
C language compilation mode-Micro mode (Tiny)--near pointer
In micro mode, the data and code in the program are placed in the same section, that is They do not exceed 64KB. In micro mode, the segment addresses of the code segment, stack segment and data segment are all the same, that is, CS=DS=SS=ES.
C language compilation mode—Small mode (Small)
In small mode, the code in the program is placed in the 64KB code segment, and the data is placed in the 64KB within the data segment. In small mode, the stack segment, additional data segment and data segment all point to the same address. They are combined into one, that is, DS=SS=ES. The pointers are all near. Generally, programs are compiled in small mode.
C language compilation mode—Medium mode (Medium)
In Medium mode, all data is placed in the 64KB data segment, so near is used in the data segment. The amount of code can be greater than 64KB (allowed to reach 1MB), so it can be used in different code segments (far remote pointers). Code modules from different source files are placed in different code sections.
C language compilation mode—Compact mode (Compact)
In compact mode, when the amount of data exceeds 64KB, it can be placed in multiple data segments. The data segments The pointer inside is (far). The amount of code does not exceed 64KB and is within one segment, so the pointers within the code segment are near. However, in this mode, static data still cannot exceed 64KB, and the heap uses far pointers to access. Code, static data, stack, and heap each have their own segments. There are only far piles, not near piles.
C language compilation mode—Large mode (Large)
In large mode, both code and data use far pointers, and both can reach 1MB. Static data, stack, and heap are the same as compact mode, and code is the same as medium mode. Static data remains the same as in compact mode and cannot exceed 64KB.
C language compilation mode—Huge mode (Huge)
In huge mode, both the code segment and the data segment use far pointers, and the code is distributed in different code segments , the data is also distributed in different data segments, they come from different source programs, and there is only one large stack. And the static data size is allowed to exceed 64KB.
Recommended tutorial: C language tutorial
The above is the detailed content of What kind of compiled language is c language?. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

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

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

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 readdir function in the Debian system is a system call used to read directory contents and is often used in C programming. This article will explain how to integrate readdir with other tools to enhance its functionality. Method 1: Combining C language program and pipeline First, write a C program to call the readdir function and output the result: #include#include#include#includeintmain(intargc,char*argv[]){DIR*dir;structdirent*entry;if(argc!=2){

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.

ABI compatibility in C refers to whether binary code generated by different compilers or versions can be compatible without recompilation. 1. Function calling conventions, 2. Name modification, 3. Virtual function table layout, 4. Structure and class layout are the main aspects involved.

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.

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

How to output a countdown in C? Answer: Use loop statements. Steps: 1. Define the variable n and store the countdown number to output; 2. Use the while loop to continuously print n until n is less than 1; 3. In the loop body, print out the value of n; 4. At the end of the loop, subtract n by 1 to output the next smaller reciprocal.

C language functions include definitions, calls and declarations. Function definition specifies function name, parameters and return type, function body implements functions; function calls execute functions and provide parameters; function declarations inform the compiler of function type. Value pass is used for parameter pass, pay attention to the return type, maintain a consistent code style, and handle errors in functions. Mastering this knowledge can help write elegant, robust C code.
