What is ODR-Use in C and When is a Definition Required?
Understanding "odr-use" in C
In C , the concept of "one definition rule" (ODR) ensures that for each entity declared in multiple compilation units, there exists only one definition. However, determining when a definition is necessary can be confusing. The term "odr-use" comes into play in this context.
According to the C Standard, a variable or function is odr-used:
- If its name appears in a potentially-evaluated expression and is not an object suitable for constant expression evaluation.
- In the case of a non-overloaded function, if its name appears in a potentially-evaluated expression or in a set of candidate functions selected by overload resolution.
This definition is a bit abstract, so let's simplify it. Odr-use essentially means that an entity is used in such a way that it must be defined somewhere in the program. This includes actual usage, such as calling a function or accessing a variable, as well as potential usage, such as being a candidate for overload resolution.
In the case of class template member functions, they are only instantiated (and therefore defined) if they are odr-used. This means that they must be called, or the class itself must be instantiated with that member function being virtual.
The standard relies on this principle to prevent unnecessary instantiation. For example, the std::list::sort function requires operator< on its elements. By declaring the list with an element type that doesn't support operator<, as long as sort is not called, the member function will not be instantiated.
Understanding odr-use is crucial for avoiding errors related to missing definitions and multiple definitions in multiple compilation units. By following these rules, programmers can write robust and maintainable C code.
The above is the detailed content of What is ODR-Use in C and When is a Definition Required?. 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

AI Hentai Generator
Generate AI Hentai for free.

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



This article explains the C Standard Template Library (STL), focusing on its core components: containers, iterators, algorithms, and functors. It details how these interact to enable generic programming, improving code efficiency and readability t

This article details efficient STL algorithm usage in C . It emphasizes data structure choice (vectors vs. lists), algorithm complexity analysis (e.g., std::sort vs. std::partial_sort), iterator usage, and parallel execution. Common pitfalls like

Article discusses effective use of rvalue references in C for move semantics, perfect forwarding, and resource management, highlighting best practices and performance improvements.(159 characters)

This article details effective exception handling in C , covering try, catch, and throw mechanics. It emphasizes best practices like RAII, avoiding unnecessary catch blocks, and logging exceptions for robust code. The article also addresses perf

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.

C 20 ranges enhance data manipulation with expressiveness, composability, and efficiency. They simplify complex transformations and integrate into existing codebases for better performance and maintainability.

The article discusses using move semantics in C to enhance performance by avoiding unnecessary copying. It covers implementing move constructors and assignment operators, using std::move, and identifies key scenarios and pitfalls for effective appl

The article discusses dynamic dispatch in C , its performance costs, and optimization strategies. It highlights scenarios where dynamic dispatch impacts performance and compares it with static dispatch, emphasizing trade-offs between performance and
