1. Changelog
1.1. Revision 7 - June 27th, 2022
-
Rename
tois_empty
, per C++ Standards Committee request.if_empty -
Make sure
andprefix
are optional alongsidesuffix
and to be voted on separately.if_empty -
Add an example for
withif_empty
.limit ( 0 ) -
Make sure it is a constraint violation to encounter unrecognized embed parameters: move specification of preprocessor parameters to their own thing in the frontmatter of the preprocessor text entirely.
-
Explain the decisions for § 4.2.1 Parameters. These do not represent a change in the actual design, just a clarification requested by WG21 (the intent was to produce warnings/errors on unrecognized parameters, which this now allows by specifying it as a constraint rather than leaving it up to attribute wording).
-
We do not mention the word "attribute" or use "attribute"-based tokens at all here. We use different grammar terms to fully disambiguate between using attributes versus preprocessor parameters.
-
Explain some of the poll results from WG21 (same explanation as found in WG21 in the C++ version of this paper), in § 2.1 June 2022 Virtual C++ Meeting.
-
Add some explanations and showings for
versus__has_embed
/suffix
/prefix
-style of parameters in § 6.1 __has_embed(…) == 2, suffix/prefix/if_empty parameters, both, or neither?.if_empty
1.2. Revision 6 - June 17th, 2022
-
Editorial changes were made to the paper. These changes are non-consequential:
-
Moved
examples to the proper OPTIONAL section.is_empty -
Moved
examples to the embed parameter wording sub-clause.prefix
-
-
Added a history section explaining some of the pre-proposal steps this proposal went through to reach the form it is in today in § 6.2 Why a Preprocessor Directive, Specifically?.
-
Add the letter of support sent in to the C Standards and Shepherd’s Oasis, LLC in § 3.3 Support.
1.3. Revision 5 - April 12th, 2022
-
Additional syntax changes based on feedback from Joseph Myers, Hubert Tong, and users.
-
Minor wording tweaks and typo clean up.
-
An implementation available in Godbolt (since last revision as well and noted below).
-
The paper’s source code has been refactored:
-
Separated WG21 paper from WG14 paper.
-
Core paper together (rationale, reasoning), included in both C and C++ papers since rationale is identical.
-
-
Changed
to match feedback from last standards meeting, nominally that an empty resource returns__has_embed
instead of2
(but both decay to a truthy value during preprocessor conditional inclusion expressions). Modified by the wording and the prose in § 4.4 __has_embed.1 -
As a reaction to this, the
embed parameter is an optional part of the proposal, as explained in § 4.2.1.3 Empty Signifier. This did affect a user in an impactful manner but the new functionality is fine, but has some downsides w.r.t. "repeating yourself".is_empty
-
-
The wording for the limit parameter (in the embed parameter sub-clauses) adjusted to perform macro expansion, at least once. Exact wording may need help.
1.4. Revision 4 - February 7th, 2022
-
Clean up syntax.
-
Reimplement and deploy extension in Clang to ensure an implementation of named parameters work.
-
Change wording to encapsulate the new fixes.
-
Removed C++ wording to focus on C wording for this document.
1.5. Revision 3 - May 15th, 2021
-
Added post C meeting fixes to prepare for hopeful success next meeting.
-
Added 2 more examples to C and C++ wording.
-
Vastly improved wording and reduced ambiguities in syntax and semantics.
-
Fixed various wording issues.
1.6. Revision 2 - October 25th, 2020
-
Added post C++ meeting notes and discussion.
-
Removed type or bit specifications from the
directive.#embed -
Moved "Type Flexibility" section and related notes to the Appendix as they are now unpursued.
1.7. Revision 1 - April 10th, 2020
-
Added post C meeting notes and discussion.
-
Added discussion of potential endianness.
-
Improved wording section at the end to be more detailed in handling preprocessor (which does not understand types).
1.8. Revision 0 - January 5th, 2020
-
Initial release! 🎉
2. Polls & Votes
The votes for the C Committee are as follows:
-
Y: Ye
-
N: Nay
-
A: Abstain
The votes for the C++ Committee as as follows:
-
SF: Strongly in Favor
-
F: In Favor
-
N: Neutral
-
A: Against
-
SA: Strongly Against
2.1. June 2022 Virtual C++ Meeting
"EWG encourages P1967 to define the form of vendor extensions as parameters to
?"
SF | F | N | A | SA |
---|---|---|---|---|
4 | 4 | 3 | 1 | 0 |
This was the result of consensus. The extensive discussion also made it clear that we must make sure that unrecognized embed parameters, due to them changing how an initializer may be formed, must be considered ill-formed. Users may get around this by using
. To dispel the notion that they may be optional, frontmatter wording was added to cover this case.
Part of the discussion during this meeting was also whether or not the case for emptiness was useful. We moved the empty-based parameters to OPTIONAL pieces of wording, and expect to forward each of these on independent votes asides from the base proposal. This captures the sentiment of folks who may not have spoken up a lot during the meeting but nevertheless felt uneasy: we can simply go with whatever the poll says next meeting.
We took the feedback to rename
to
, since it is a better name for a "do-something-if-predicate-is-true" style attribute.
2.2. January/February 2022 C Meeting
"Does WG14 want the embed parameter specification as shown in N2898?"
Y | N | A |
---|---|---|
12 | 2 | 8 |
From the January/February 2022 Meeting Minutes, Summary of Decisions:
WG14 wants the embed parameter specification as shown in N2898.
We interpret this as consensus. We keep the parameters but make the one that folks were questioning (
) optional in response to the feedback during and after the meeting.
2.3. December 2020 Virtual C Meeting
"Do we want to allow #embed to appear in any context that is different from an initialization of a character array?"
Y | N | A |
---|---|---|
5 | 8 | 6 |
"Leaning in the direction of no but not clear." The paper author after consideration chose to keep this as-is right now. Discussion of the feature meant that trying to ban this from different contexts meant that a naïve, separated-preprocessor implementation would be banned and it would require special compiler magic to diagnose. Others pointed out that just trying to leave it "unspecified whether it works outside of the initialization of an array or not" is very dangerous to portability. The author agrees with this assessment and therefore will leave it as-is. The goal of this feature is to enable implementers to use the magic if they so choose, as an implementation detail and a Quality of Implementation selling point. Vendors who provide a simple expansion may not see improvements to throughput and speed of translation but that is their choice as an implementer. Therefore, we cannot do anything which would require them or any preprocessor implementation to traffic in magic directives unless they want to.
2.4. April 2020 Virtual C Meeting
"We want to have a proper preprocessor
over a
-based directive."
This had UNANIMOUS CONSENT to pursue a proper preprocessor directive and NOT use the
syntax. It is noted that the author deems this to be the best decision!
The following poll was later superseded in the C and C++ Committees.
"We want to specify embed as using
rather than
." (2-way poll.)
Y | N | A |
---|---|---|
10 | 2 | 3 |
-
Y: 10 bits-per-element (Ye)
-
N: 2 type-based (Nay)
-
A: 4 Abstain (Abstain)
This poll will be a bit harder to accommodate properly. Using a
that produces a numeric constant means that the max-length specifier is now ambiguous. The syntax of the directive may need to change to accommodate further exploration.
3. Introduction
For well over 40 years, people have been trying to plant data into executables for varying reasons. Whether it is to provide a base image with which to flash hardware in a hard reset, icons that get packaged with an application, or scripts that are intrinsically tied to the program at compilation time, there has always been a strong need to couple and ship binary data with an application.
Neither C nor C++ makes this easy for users to do, resulting in many individuals reaching for utilities such as
, writing python scripts, or engaging in highly platform-specific linker calls to set up
variables pointing at their data. Each of these approaches come with benefits and drawbacks. For example, while working with the linker directly allows injection of very large amounts of data (5 MB and upwards), it does not allow accessing that data at any other point except runtime. Conversely, doing all of these things portably across systems and additionally maintaining the dependencies of all these resources and files in build systems both like and unlike
is a tedious task.
Thusly, we propose a new preprocessor directive whose sole purpose is to be
, but for binary data:
.
3.1. Motivation
The reason this needs a new language feature is simple: current source-level encodings of "producing binary" to the compiler are incredibly inefficient both ergonomically and mechanically. Creating a brace-delimited list of numbers in C comes with baggage in the form of how numbers and lists are formatted. C’s preprocessor and the forcing of tokenization also forces an unavoidable cost to lexer and parser handling of values.
Therefore, using arrays with specific initialized values of any significant size becomes borderline impossible. One would think this old problem would be work-around-able in a succinct manner. Given how old this desire is (that comp.std.c thread is not even the oldest recorded feature request), proper solutions would have arisen. Unfortunately, that could not be farther from the truth. Even the compilers themselves suffer build time and memory usage degradation, as contributors to the LLVM compiler ran the gamut of the biggest problems that motivate this proposal in a matter of a week or two earlier this very year. Luke is not alone in his frustrations: developers all over suffer from the inability to include binary in their program quickly and perform exceptional gymnastics to get around the compiler’s inability to handle these cases.
C developer progress is impeded regarding the inability to handle this use case, and it leaves both old and new programmers wanting.
Finally, Microsoft has an ABI problem with its maximum string literal size that cannot be solved using string literals or anything treated like string literals, as the LLVM thread and the thread from Claire Xen make clear. It has also frustrated both C an C++ programmers alike, despite their best efforts. It was so frustrating that even extended-C-and-C++-compilers, like Circle, solve this problem with custom directives.
3.2. But How Expensive Is This?
Many different options as opposed to this proposal were seriously evaluated. Implementations were attempted in at least 2 production-use compilers, and more in private. To give an idea of usage and size, here are results for various compilers on a machine with the following specification:
-
Intel Core i7 @ 2.60 GHz
-
24.0 GB RAM
-
Debian Sid or Windows 10
-
Method: Execute command hundreds of times, stare extremely hard at
/Task Managerhtop
While
and
work well for getting accurate timing information and can be run several times in a loop to produce a good average value, tracking memory consumption without intrusive efforts was much harder and thusly relied on OS reporting with fixed-interval probes. Memory usage is therefore approximate and may not represent the actual maximum of consumed memory. All of these are using the latest compiler built from source if available, or the latest technology preview if available. Optimizations at
(GCC & Clang style)/
(MSVC style) or equivalent were employed to generate the final executable.
3.2.1. Speed
Strategy | 40 kilobytes | 400 kilobytes | 4 megabytes | 40 megabytes |
---|---|---|---|---|
GCC
| 0.236 s | 0.231 s | 0.300 s | 1.069 s |
-generated GCC
| 0.406 s | 2.135 s | 23.567 s | 225.290 s |
-generated Clang
| 0.366 s | 1.063 s | 8.309 s | 83.250 s |
-generated MSVC
| 0.552 s | 3.806 s | 52.397 s | Out of Memory |
3.2.2. Memory Size
Strategy | 40 kilobytes | 400 kilobytes | 4 megabytes | 40 megabytes |
---|---|---|---|---|
GCC
| 17.26 MB | 17.96 MB | 53.42 MB | 341.72 MB |
-generated GCC
| 24.85 MB | 134.34 MB | 1,347.00 MB | 12,622.00 MB |
-generated Clang
| 41.83 MB | 103.76 MB | 718.00 MB | 7,116.00 MB |
-generated MSVC
| ~48.60 MB | ~477.30 MB | ~5,280.00 MB | Out of Memory |
3.2.3. Analysis
The numbers here are not reassuring that compiler developers can reduce the memory and compilation time burdens with regard to large initializer lists. Furthermore, privately owned compilers and other static analysis tools perform almost exponentially worse here, taking vastly more memory and thrashing CPUs to 100% for several minutes (to sometimes several hours if e.g. the Swap is engaged due to lack of main memory). Every compiler must always consume a certain amount of memory in a relationship directly linear to the number of tokens produced. After that, it is largely implementation-dependent what happens to the data.
The GNU Compiler Collection (GCC) uses a tree representation and has many places where it spawns extra "garbage", as its called in the various bug reports and work items from implementers. There has been a 16+ year effort on the part of GCC to reduce its memory usage and speed up initializers (C Bug Report and C++ Bug Report). Significant improvements have been made and there is plenty of room for GCC to improve here with respect to compiler and memory size. Somewhat unfortunately, one of the current changes in flight for GCC is the removal of all location information beyond the 256th initializer of large arrays in order to save on space. This technique is not viable for static analysis compilers that promise to recreate source code exactly as was written, and therefore discarding location or token information for large initializers is not a viable cross-implementation strategy.
LLVM’s Clang, on the other hand, is much more optimized. They maintain a much better scaling and ratio but still suffer the pain of their token overhead and Abstract Syntax Tree representation, though to a much lesser degree than GCC. A bug report was filed but talk from two prominent LLVM/Clang developers made it clear that optimizing things any further would require an extremely large refactor of parser internals with a lot of added functionality, with potentially dubious gains. As part of this proposal, the implementation provided does attempt to do some of these optimizations, and follows some of the work done in this post to try and prove memory and file size savings. (The savings in trying to optimize parsing large array literals were "around 10%", compared to the order-of-magnitude gains from
and similar techniques).
Microsoft Visual C (MSVC) scales the worst of all the compilers, even when given the benefit of being on its native operating system. Both Clang and GCC outperform MSVC on Windows 10 or WINE as of the time of writing.
Linker tricks on all platforms perform better with time (though slower than
implementation), but force the data to be optimizer-opaque (even on the most aggressive "Link Time Optimization" or "Whole Program Optimization" modes compilers had). Linker tricks are also exceptionally non-portable: whether it is the
assembly command supported by certain compilers, specific invocations of
/
or others, non-portability plagues their usefulness in writing Cross-Platform C (see Appendix for listing of techniques). This makes C decidedly unlike the "portable assembler" advertised by its proponents (and my Professors and co-workers).
3.3. Support
To say that
enjoys broad C Community support is an understatement. In all the years we have written proposals for C and C++, this is the only one where someone physically mailed us a letter - from a different country - directly to the Standards Body to try and make a case for the feature directly, rather than what was already in the paper:
This is just one of hundreds of messages sent over time digitally, with participants from everywhere in the European Union (France, Germany, Spain, Czech Republic, Switzerland, Denmark, etc.) to East and Southern Asia (China, Japan, Vietnam, etc.) and many, many more from North and South America (including Canada, Brazil, Argentina, etc.). There has been a clear and present need to solve this problem for quite some time now.
4. Design
There are two design goals at play here, sculpted to specifically cover industry standard practices with build systems and C programs.
The first is to enable developers to get binary content quickly and easily into their applications. This can be icons/images, scripts, tiny sound effects, hardcoded firmware binaries, and more. In order to support this use case, this feature was designed for simplicity and builds upon widespread existing practice.
The second is extensibility. We recognize that talking to arbitrary places on either the file system, network, or similar has different requirements. After feedback from an implementer about syntax for extensions, we reached out to various users of the beta builds or custom builds using
-like things. It turns out many of them have needs that, since they are the ones building and in some cases patching over/maintaining their compiler, have needs for extensible parameters that can be passed to
directives. Therefore, we structured the syntax in a way that is favorable to "simple" scanning tools but powerful enough to handle arbitrary directives and future extension points.
4.1. Goal: Simplicity and Familiarity
Providing a directive that mirrors
makes it natural and easy to understand and use this new directive. It accepts both chevron-delimited (
) and quote-delimited (
) strings like
does. This matches the way people have been generating files to
in their programs, libraries and applications: matching the semantics here preserves the same mental model. This makes it easy to teach and use, since it follows the same principles:
/* default is unsigned char */ const unsigned char icon_display_data [] = { #embed "art.png" }; /* specify any type which can be initialized form integer constant expressions will do */ const char reset_blob [] = { #embed "data.bin" };
Because of its design, it also lends itself to being usable in a wide variety of contexts and with a wide variety of vendor extensions. For example:
/* attributes work just as well */ const signed char aligned_data_str [] __attribute__ (( aligned ( 8 ))) = { #embed "attributes.xml" };
The above code obeys the alignment requirements for an implementation that understands GCC directives, without needing to add special support in the
directive for it: it is just another array initializer, like everything else.
4.1.1. Existing Practice - Search Paths
It follows the same implementation experience guidelines as
by leaving the search paths implementation defined, with the understanding that implementations are not monsters and will generally provide
/
and other related flags as their users require for their systems. This gives implementers the space they need to serve the needs of their constituency.
4.1.2. Existing Practice - Discoverable and Distributable
Build systems today understand the make dependency format, typically through use of the compiler flags
and friends. This sees widespread support, from CMake, Meson and Bazel to ninja and make. Even VC++ has a version of this flag --
-- that gets parsed by build systems.
This preprocessor directive fits perfectly into existing build architecture by being discoverable in the same way with the same tooling formats. It also blends perfectly with existing distributed build systems which preprocess their files with
before sending it up to the build farm, as
and
do.
4.2. Syntax
The syntax for this feature is for an extensible preprocessor directive. The general form is:
where
refers to the syntax of
/
/
/
that is already part of the grammar. The syntax takes after many existing extensions in many preprocessor implementations and specifications, including OpenMP, Clang
s, Microsoft
s, and more. The named parameters was a recommendation by an implementer
This syntax keeps the header-name, enclosed in angle brackets or quotation marks, first to allow a "simple" preprocessing tool to quickly scan for all the necessary dependency names without having to parse any of the names or parameters that come after. Both standard names and vendor/implementation-specific names can also be accommodated in the list of parameters, allowing for specific vendor extensions in a consistent manner while the standard can take the normal
names.
4.2.1. Parameters
One of the things that’s critical about
is that, because it works with binary resources, those resources have characteristics very much different from source and header files present in a typical filesystem. There may be need for authentication (possibly networked), permission, access, additional processing (new-line normalization), and more that can be somewhat similarly specified through the implementation-defined parameters already available through the C and C++ Standards' "
" function.
However, adding a "mode" string similar to
, while extensible, is archaic and hard to check. Therefore, the syntax allows for multiple "named parameters", encapsulated in parentheses, and marked with
as a form of "namespacing" identifiers similar to
attribute-style syntax. However, parameters do not have the balanced square bracket
delimiters, and just use the
form with an optional parentheses-enclosed list of arguments.
Furthermore, parameters as defined in this proposal may open the door to better vendor-quality preprocessor parameters. They are defined generically and they are set to be a constraint violation (C) or make the program ill-formed (C++) if they are not recognized. This is why they are not named "attributes" and steer very far away from the attribute naming in this revision of the paper.
Some example parameters including interpreting the binary data as "text" rather than a bitstream with
, providing authenticated access with
,
to change the element of each entry produced, and more. These are all things vendors have indicated they might support for their use cases.
4.2.1.1. Limit Parameter
The earliest adopters and testers of the implementation reported problems when trying to access POSIX-style
devices and pseudo-files that do not have a logical limitation. These "infinity files" served as the motivation for introducing the "limit" parameter; there are a number of resources which are logically infinite and thusly having a compiler read all of the data would result an Out of Memory error, much like with
if someone did
.
The limit parameter is specified after the resource name in
, like so:
const int please_dont_oom_kill_me [] = { #embed "/dev/urandom" limit(512) };
This prevents locking compilers in an infinite loop of reading from potentially limitless resources. Note the parameter is a hard upper bound, and not an exact requirement. A resource may expand to a 16-element list rather than a 512-element list, and that is entirely expected behavior. The limit is the number of elements allowed up to the maximum for this type.
This does not provide a form of "timeout" for e.g. resources stored on a Network File System or an inactivity limit or similar. Implementations that utilize support for more robust handling of resource location schemes like Uniform Resource Identifiers (URIs) that may interface with resources that take extensive amounts of time to locate should provide implementation-defined extensions for timeout or inactivity checks.
4.2.1.2. Non-Empty Prefix and Suffix
Something pointed out by others using this preprocessor directive is a problem similar to
: when placing this parameter with other tokens before or after the
directive, it sometimes made it hard to properly anticipate whether a file was empty or not.
The
proposal includes a prefix and suffix entry that applies if and only if the resource is non-empty:
const unsigned char null_terminated_file_data [] = { #embed "might_be_empty.txt" \ prefix(0xEF, 0xBB, 0xBF, ) /* UTF-8 BOM */ \ suffix(,) 0 // always null-terminated };
and
only work if the
resource is not empty. If a user wants a prefix or suffix that appears unconditionally, they can simply just type the tokens they want before and after: there is nothing to be gained from adding a standards-mandated prefix and suffix that works in both the empty and non-empty case.
We do not want to entirely lose that user’s use case, however, so we have made the
/
parameters an optional part of the wording, to be voted on as a separate piece.
4.2.1.3. Empty Signifier
This is for the case when the given resource exists, but it is empty. This allows a user to have a sequence of tokens between the parentheses passed to the
parameter here:
.
If
exists but is empty, this will replace the directive with the (potentially macro expanded) contents between the parentheses of the
parameter. This can also be combined with a
parameter to always have the
token return. This can be useful for macro-expanded integer constant expressions that may end up being 0.
An example program
:
int main () { #define SOME_CONSTANT 0 return #embed </dev/urandom> if_empty(0) limit(SOME_CONSTANT) ; }
This program will expand to the equivalent of
if
is 0, or a single (random)
value if it is 1. (If
is greater than 1, it produces a comma-delimited list of integers, which gets treated as a sequence to the comma operator after the
keyword. Some compilers warn about the left-hand operands having no effect.)
Previously, this was the only way to detect that the resource was empty. This functionality can be substituted with having to use
with the same contents and specifically check for the return value of
. While this change create some repeating-yourself friction in the identifier, there was only 1 user who actually needed the if_empty signifier, and that was only because they were using it to replace it with a very particularly sized and shaped data array. The
technique worked just fine for them as well at the cost of some repetition (to check for embed parameters), and after some discussion with the user it was deemed okay to switch to this syntax, since during the discussion of
in the January/February 2022 WG14 C Standards Committee Meeting it was commented on that there were too many signifiers.
We do not want to entirely lose that user’s use case, however, so we have made the
parameter an optional part of the wording, to be voted on as a separate piece.
4.2.1.4. Why is __param_name__
part of the grammar?
This is specifically at the request of the C Committee. There are plenty of places where
/
/
may be preexisting macro names. Thus, following the same rationale of other preprocessor-hardened names (such as attributes in the C standard), names that are prefixed and suffixed by a double underscore (e.g.,
,
, and similar) behave identically to their non-underscore counterparts. This is to aid in differentiation to prevent macro collisions, and is featured as part of the style of attributes in C++.
This feature will only be part of the C version of the proposal, as C++ does not have a similar rule for its attributes and therefore has no precedent amongst C++ compilers. (We expect that dual-C-and-C++ compilers will support both spellings in the interest of ease-of-shared-implementation.)
4.3. Constant Expressions
Both C and C++ compilers have rich constant folding capabilities. While C compilers only acknowledge a fraction of what is possible by larger implementations like MSVC, Clang, and GCC, C++ has an entire built-in compile-time programming bit, called
. Most typical solutions cannot be used as constant expressions because they are hidden behind run-time or link-time mechanisms (
, or the resource compiler
on Windows, or the static library archiving tools). This means that many algorithms and data components which could strongly benefit from having direct access to the values of the integer constants do not because the compiler cannot "see" the data, or because Whole Program Optimization cannot be aggressive enough to do anything with those values at that point in the compilation (i.e., during the final linking stage).
This makes
especially powerful, since it guarantees these values are available as-if it was written by as a sequence of integers whose values fit within an
.
4.4. __has_embed
C and C++ both support a
. It makes sense to have an analogous
identifier. It can take a
or
resource name identifier, as well as additional arguments to let vendors pass in any additional arguments they need to properly access the file (following the same parameters passed to the directive).
evaluates to:
-
if the resource is not found or any parameter in the0
does not exist; or,embed - parameter - list -
if the resource is found, it is not empty, and the1
(including the vendor-specific ones) are supported; or,embed - parameter - list -
if the resource is found, it is empty, and the2
(including the vendor-specific ones) are supported.embed - parameter - list
This may raise questions of "TOCTTOU" (Time of Check to Time of Use) problems, but we already have these problems between
and
. They are also already solved by existing implementations. For example, the LLVM/Clang compiler uses
and
abstractions which cache files. GCC’s "libcpp" (not its C++ library but it’s preprocessor library) will cache already-opened files (up to a limit). Any TOCTTOU problems have already been managed and provided for using the current
infrastructure of these compilers, and if any compiler wants a more streamlined and consistent experience they should deploy whatever Quality of Implementation (QoI) they see fit to achieve that goal.
Finally, note that this directive DOES expand to
if a given parameters that the implementation does not support. This makes it easier to determine if a given vendor-specific embed directive is supported. In fact, support can be checked in most cases by using a combination of
and
:
int main () { #if __has_embed ("bits.bin" clang::element_type(short)) // load "short" values directly from memory short meow [] = { #embed "bits.bin" clang::element_type(short) }; #else // no support for implementation-specifid // clang::element_type parameter unsigned char meow_bytes [] = { #embed "bits.bin" }; unsigned short meow [] = { /* parse meow_bytes into short values by-hand! */ }; #endif return 0 ; }
For the C proposal, the wording for
returning
is optional, as it depends on whether or not the C Committee would like to solve this problem in one specific direction or another.
4.5. Bit Blasting: Endianness
What would happen if you did
into an
fread ?
int that’s my answer 🙂
– Isabella Muerte
It’s a simple answer. While we may not be reading into
, the idea here is that the interpretation of the directive is meant to get as close to directly copying the bitstream, as is possible. A compiler-magic based implementation like the ones provided as part of this paper have no endianness issues, but an implementation which writes out integer literals may need to be careful of host vs. target endianness to make sure it serializes correctly to the final binary. As a litmus test, the following code -- given a suitably sized
resource -- should return
:
#include <cstdio>#include <cstring>int main () { const unsigned char foo0 [] = { #embed "foo.bin" }; const unsigned char foo1 [ sizeof ( foo0 )]; std :: FILE * fp = std :: fopen ( "foo.bin" ); if ( fp == nullptr ) { return 1 ; } std :: size_t foo1_read = std :: fread ( foo1 , 1 , sizeof ( foo1 ), fp ); if ( foo1_read != sizeof ( foo1 )) { return 1 ; } if ( memcmp ( & foo0 [ 0 ], & foo1 [ 0 ], sizeof ( foo0 )) != 0 ) { return 1 ; } return 0 ; }
If the same file during both translation and execution,
, is used here, this program should always return
. This is what the wording below attempts to achieve. Note that this is always a concern already, due to
and other target environment-specific variables that already exist; implementations have always been responsible for handling differences between the host and the target and this directive is no different. If the
of the host vs. the target is the same, then the directive is more simple. If it is not, then an implementation will have to perform translation.
5. Implementation Experience
An implementation of this functionality is available in branches of both GCC and Clang, accessible right now with an internet connection through the online utility Compiler Explorer. The Clang compiler with this functionality is called "x86-64 clang (thephd.dev)" in the Compiler Explorer UI:
int main () { return #embed </dev/urandom> limit(1) ; }
6. Alternative Syntax
There were previous concerns about the syntax using pragma-like syntax and more. WG14 voted to keep the syntax as a plain
preprocessor directive, unanimously.
Previously, different syntax was used to specify the limit and other kinds of parameters. These have been normalized to be a suffix of attribute-like parameters, at the request of an implementer and the C++ Standards Committee discussion of the paper in June 2021. It has had hugely positive feedback and users have reported the new syntax to be clearer, while other implementers have stated this is much better for them and the platforms for which they intend to add additional embed parameters.
6.1. __has_embed ( …) == 2
, suffix
/prefix
/if_empty
parameters, both, or neither?
This proposal contains two different ways to handle empty parameters. Both are optionally included in this proposal to be voted on by WG21 (C++) and WG14 (C) respectively. While
can be used specifically to check if a resource is empty (by checking if it expands to a value of
),
,
, and
reduce the complexity of the series of necessary checks in order to handle specific situations. For example, let’s take a common situation of checking if a resource is empty, and if it isn’t simply defaulting some data to be empty:
static_assert ( CHAR_BIT == 8 , "expects an 8-bit char." ); const unsigned char raw_data [] = { #if __has_embed(<some_file.txt>) == 2 // file is empty #else // file has content, or implementation defined search fails (errors) # embed <some_file.txt> , // need the extra ',' in this case #endif 0 , 0 };
Now, let’s add checks for platform-specific-data, using just
as before:
static_assert ( CHAR_BIT == 8 , "expects an 8-bit char." ); const unsigned char raw_data [] = { #if __has_embed(<some_file.txt> acme::open_mode("x,nt")) == 1 // supports the directive: very nice! # embed <some_file.txt> acme::open_mode("x,nt") #elif __has_embed(<some_file.txt>) == 2 // file is empty: nothing needed #else // file has content, or implementation defined search fails (errors) # embed <some_file.txt> , // need the extra ',' in this case #endif 0 , 0 };
Each new condition adds yet another branch. In the case of something like a
which supports doing "direct binary translation into a sequence of objects with type
" or similar, this can become a very lengthy list of supported directives. This does not necessarily mean a world with the empty-handling parameters is more helpful:
is still needed to check whether implementation-defined parameters are allowed:
static_assert ( CHAR_BIT == 8 , "expects an 8-bit char." ); const unsigned char raw_data [] = { #if __has_embed(<some_file.txt> acme::open_mode("x,nt")) // supports the directive: very nice! # embed <some_file.txt> acme::open_mode("x,nt") #else // file has content, is empty, or implementation defined // search fails (errors) suffix takes care of adding the // necessary comma if it’s empty # embed <some_file.txt> suffix(,) 0 , 0 #endif };
We only lose a single
branch here. For more involved or complicated code that cares even more deeply about adding prefixes (UTF-8 prefixes) or different kinds of suffixes / empty-handlers, the reduction for handling empty cases may drop much more. For the case where we’re not worried about special vendor extensions at all, the code is shorter:
static_assert ( CHAR_BIT == 8 , "expects an 8-bit char." ); const unsigned char raw_data [] = { // file has content, or implementation defined search fails (errors) // suffix takes care of adding the necessary comma #embed <some_file.txt> suffix(,) 0 , 0 // need the extra ',' in this case };
We do not actually have a terrible preference about how much we would like to force users to make the ladder of
/
. We introduced the parameter-based approach for empty files before we introduced the tri-state
replacement value in the preprocessor. Users found the fix for empty files targeted and helpful, but perhaps that is not the best "general purpose" solution. The "general purpose" solution does make doing tests potentially complex, but maybe that complexity results in an overall more pleasant and coherent experience.
We leave it up to the Committee to pick one, the other, neither, or both of the given ways of handling empty files (and, importantly, staving off errors from empty contiguous sequences, C-style arrays in particular).
6.2. Why a Preprocessor Directive, Specifically?
Although the reasoning is scattered around the paper, it may be illuminating to explain the full "etymology" of the preprocessor directive of
and why it came to be. Originally,
was conceived not by the authors of this paper, but as a C++ feature (potentially portable to C) using a String Literal of the form
or
. This proposal was soundly rejected by WG21, despite having one of the strongest champions it could possibly have presenting it (the original author of the paper could not make Committee Meetings). There was much confusion about whether or not this functionality would include a null terminator (some argued "yes", because it was the form of a string literal; others argued "no"). There was also the confusion between what it meant to include the file as a "text" file versus a "binary" file (the
versus
prefixes). Furthermore, there was the question of what kind of data would come out on the other side (
for "text" data,
for binary?).
From there, the authors of this paper worked to explore a new version that was, effectively, language magic. This was done because, very long ago, solutions around doing
or similar were (colloquially) rejected from both WG21 and WG14, with various different reasons. This is where the C++-shaped
came from, and forms the basis of the C++ proposal [p1040r6]. It was meant to be filled in using either directly compiler-based language magic such as a built-in (like
), or using compiler-specific extensions such as
([incbin]) but mightily improved to be usable as a constant expression. This approach found great traction until tool vendors and tool developers within compiler groups complained that such a construct - especially in C++ - would allow evaluation of more than just String Literals as the entry into
. This is partly a feature, as it meant that reading a file and pulling file names from it could reuse the included data to then feed it back into the magic directive to read another file, resulting in the ability to parse e.g. GLSL shader files or JSON files which referenced other JSON files into read-only, compiled memory. Unfortunately, such ability means that it is beyond the Phase 1-5, preprocessor abilities of C and C++ compilers, and dependencies must be computed at what is typically known as "Semantic Analysis" time in compilers.
This also proved problematic for tool developers outside of the C++ Standards Committee. Correspondence with Henry Miller of the
(distributed build tool) development list over e-mail revealed that while he would be comfortable just having a loosely-based "best effort" approach to finding file names from any
function call. He indicated some preference for a more static version that could allow him to find all potentially-included files without any risk of false-positives or other issues, that a simple tool like
could handle.
This is where
was conceived. While it loses the ability to be used recursively with itself like the language-magic version in C++, it retains the following important qualities for all stakeholders involved:
-
the directive can be read using basic preprocessing tools;
-
the directive has parameters that come after the core
part, which means current infrastructure around parsing similar#embed "file.txt"
files is retained;#include -
the directive does not need any information or computation from beyond Phase 4 of compilation; and,
-
the directive does not have any questions of "encoding" or "null termination" like the File String Literals proposal.
This is the version that stayed in development since around late 2018, and has been continuously iterated over. The syntax was changed once, to accommodate the trailing parameter list, as suggested by both compiler developers and end-users several times during the course of its development. The trailing parameter list was also the most powerful way to allow compiler extensions that did special behaviors, as it was incredibly clear that many vendors had extensions for data, attributes for variables, and more they wanted to feed into
and the various types it initialized. It took some time to smith the wording into the form that works best, but importantly the wording from the beginning had the following two goals in mind:
-
a low-effort quality of implementation would still work validly in all places it could conceivably be used (which is anywhere, since it’s a preprocessor directive); and,
-
a high-effort quality of implementation could significantly speed up the inclusion of binary resources in a program.
Notably, the first was important for users. They did not want something that would only be conditionally supported. The latter is important for both users and vendors: Microsoft needs a way to get out of its String Literal Maximum Limit ABI problems and a way to store data quickly, as every other compiler even on its preferred platform (Windows 7, 8, 8.1, and 10) are outperformed by other compilers simply initializing data arrays in a big, brace-delimited array. In order to solve for the bug reports talked about earlier ([nonius-visual-c-error], [llvm-string-init-fail], [gcc-large-init-bug-c], and more) vendors need the capability to provide a fast built-in or internal token implementation for speed purposes. This has been validated by implementation efforts outside of the authors here, in the QAC Compiler by Alex Gilding. With the authors currently privately and publicly supporting implementations of
, Sean Baxter’s own implementation of embed styled slightly differently for the Circle compiler, and the implementation work by Alex, that brings us to 4 compilers (Clang, GCC, Circle, QAC) - private and commercially available - with experience and reported order-of-magnitude (and in some cases, two orders-of-magnitude) improvements on compilation and loading speed of data arrays previously stored in a variety of other manners, including linkers.
It is a long-battled, well-storied work of shared and community effort to solve a long-standing problem for C and C++. It gives vendors a way out of having to write increasingly integer-list-initialization-specific optimized parsers, and lets users connect C to the best binary and storage compression system they already know how to use with their existing implementations: the filesystem. It also prevents low-effort quality of implementations from being excluded from the feature set, making it feasible even for compilers such as the famous 8cc hobby compiler.
This is why
is in the form it has ultimately ended up in.
7. Wording
This wording is relative to C’s latest working draft.
📝 Editor’s Note: The ✨ characters are intentional. They represent stand-ins to be replaced by the editor.
7.1. Modify 6.4, paragraph 4
If the input stream has been parsed into preprocessing tokens up to a given character, the next preprocessing token is the longest sequence of characters that could constitute a preprocessing token. There is one exception to this rule:
header name preprocessing tokens are recognized only withinheader name preprocessing tokens are recognized only withinpreprocessing directives, in
#include expressions, and in implementation-defined locations within #pragma directives.
__has_include and
#include preprocessing directives, in
#embed and
__has_include expressions, as well as in implementation-defined locations within
__has_embed directives. In such contexts, a sequence of characters that could be either a header name or a string literal is recognized as the former.
#pragma
7.2. Add another control-line production to §6.10 Preprocessing Directives, Syntax, paragraph 1 and a new paragraph for the Semantics
control-line:
…
- # embed pp-tokens new-line
…pp-parameter:
pp-parameter-name pp-parameter-clauseopt
pp-parameter-name:
pp-standard-parameter
pp-prefixed-parameter
pp-standard-parameter:
identifier
pp-prefixed-parameter:
identifier :: identifier
pp-parameter-clause:
( pp-balanced-token-sequenceopt )
pp-balanced-token-sequence:
pp-balanced-token
pp-balanced-token-sequence pp-balanced-token
pp-balanced-token:
( pp-balanced-token-sequenceopt )
[ pp-balanced-token-sequenceopt ]
{ pp-balanced-token-sequenceopt }
any pp-token other than a parenthesis, a bracket, or a brace
embed-parameter-sequence:
pp-parameter
embed-parameter-sequence pp-parameter
…DescriptionSome preprocessing directives take additional information by the use of preprocessor parameters. A preprocessing parameter (pp-parameter) shall be either a preprocessor prefixed parameter (identified by a pp-prefixed-parameter, for implementation-defined preprocessor parameters) or a preprocessor standard parameter (identified with a pp-standard-parameter, for pp-parameters specified by this document).
In all aspects, a preprocessor standard parameter specified by this document as an identifier
and an identifier of the form
pp_param shall behave the same when used as a preprocessor parameter, except for the spelling.
__pp_param__ EXAMPLE Thus, the preprocessor parameters on the two binary resource inclusion directives (6.10.✨):
#embed "boop.h" limit(5) #embed "boop.h" __limit__(5) behave the same, and can be freely interchanged. Implementations are encouraged to behave similarly for preprocessor parameters (including preprocessor prefixed parameters) they provide.
ConstraintsA preprocessor parameter shall be either a preprocessor standard parameter, or an implementation-defined preprocessor prefixed parameter.FN0✨)
…FN0✨) An unrecognized preprocessor prefixed parameter is a constraint violation, except within has_embed expressions (6.10.1).
7.3. Modify §6.10.1 Conditional inclusion to include a new "has-embed-expression" production by modifying paragraph 1, then modify the following paragraphs:
Syntax…has-include-expression:
__has_include ( header-name )
__has_include ( header-name-tokens )
has-embed-expression:
__has_embed ( header-name embed-parameter-sequenceopt )
__has_embed ( header-name-tokens pp-balanced-token-sequenceopt )
…The expression that controls conditional inclusion shall be an integer constant expression except that: identifiers (including those lexically identical to keywords) are interpreted as described below182) and it may contain zero or more defined macro expressions, has_include expressions, has_embed expressions, and/or has_c_attribute expressions as unary operator expressions.
…The second forms of the has_include expression and has_embed expression are considered only if the first form does not match, in which case the preprocessing tokens are processed just as in normal text.…The resource (6.10.✨) identified by the header-name preprocessing token sequence in each contained has_embed expression is searched for as if those preprocessing token were the pp-tokens in a
directive, except that no further macro expansion is performed. Such a directive shall satisfy the syntactic requirements of a
#embed directive. The has_embed expression evaluates to:
#embed
— 0 if the search fails or if any of the embed parameters in the embed parameter sequence specified are not supported by the implementation for the
directive; or,
#embed — 1 if the search for the resource succeeds and all embed parameters in the embed parameter sequence specified are supported by the implementation for the
directive.
#embed NOTE 1 Unrecognized preprocessor prefixed parameters in has_embed expressions is not a constraint violation and instead causes the expression to be evaluate to 0, as specified above.
…SemanticsThe
,
#ifdef ,
#ifndef , and
#elifdef , and the defined conditional inclusion operator, shall treat
#elifndef ,
__has_include , and
__has_embed as if they were the name of defined macros. The identifiers
__has_c_attribute ,
__has_include , and
__has_embed shall not appear in any context not mentioned in this subclause.
__has_c_attribute …EXAMPLE: A combination of(6.10.8.1) and
__FILE__ could be used to check for support of specific implementation extensions for the
__has_embed directive’s parameters.
#embed #if __has_embed(__FILE__ ext::token(0xB055)) #define DESCRIPTION "Supports extended token embed" #else #define DESCRIPTION "Does not support extended token embed" #endif EXAMPLE: The below snippet uses
to check for support of a specific implementation-defined embed parameter, and otherwise uses standard behavior to produce the same effect.
__has_embed void parse_into_s ( short * ptr , unsigned char * ptr_bytes , unsigned long long size ); int main () { #if __has_embed ("bits.bin" ds9000::element_type(short)) /* Implementation extension: create short integers from the */ /* translation environment resource into */ /* a sequence of integer constants */ short meow [] = { #embed "bits.bin" ds9000::element_type(short) }; #elif __has_embed ("bits.bin") /* no support for implementation-specific */ /* ds9000::element_type(short) parameter */ const unsigned char meow_bytes [] = { #embed "bits.bin" }; short meow [ sizeof ( meow_bytes ) / sizeof ( short )] = {}; /* parse meow_bytes into short values by-hand! */ parse_into_s ( meow , meow_bytes , sizeof ( meow_bytes )); #else #error "cannot find bits.bin resource" #endif return ( int )( meow [ 0 ] + meow [( sizeof ( meow ) / sizeof ( * meow )) - 1 ]); } …Forward references: … Mandatory macros (6.10.8.1) …
7.4. Add a new sub-clause as §6.10.✨ to §6.10 Preprocessing Directives, preferably after §6.10.2 Source file inclusion
6.10.✨ Binary resource inclusion6.10.✨.1preprocessing directive
#embed A resource is a source of data accessible from the translation environment. An embed parameter is a single preprocessor parameter in the embed parameter sequence. It has an implementation resource width, which is the implementation-defined size in bits of the located resource. It also has a resource width, which is either:
— the number of bits as computed from the optionally-provided
embed parameter (6.10.✨.2), if present; or,
limit — the implementation resource width.
An embed parameter sequence is a whitespace-delimited list of preprocessor parameters which may modify the result of the replacement for the
preprocessing directive.
#embed ConstraintsAn
directive shall identify a resource that can be processed by the implementation as a binary data sequence given the provided embed parameters.
#embed Embed parameters not specified in this document shall be implementation-defined. Implementation-defined embed parameters may change the below-defined semantics of the directive; otherwise,
directives which do not contain implementation-defined embed parameters shall behave as described in this document.
#embed A resource is considered empty when its resource width is zero.Let embed element width be either:
— an integer constant expression greater than zero determined by an implementation-defined embed parameter; or,
—
.
CHAR_BIT The result of
shall be zero.FN1✨)
( resource width ) % ( embed element width ) SemanticsThe expansion of a
directive is a token sequence formed from the list of integer constant expressions described below. The group of tokens for each integer constant expression in the list is separated in the token sequence from the group of tokens for the previous integer constant expression in the list by a comma. The sequence neither begins nor ends in a comma. If the list of integer constant expressions is empty, the token sequence is empty. The directive is replaced by its expansion and, with the presence of certain embed parameters, additional or replacement token sequences.
#embed A preprocessing directive of the form
# embed
h-char-sequence
< embed-parameter-sequenceopt new-line
> searches a sequence of implementation-defined places for a resource identified uniquely by the specified sequence between the
and
< . The search for the named resource is done in an implementation-defined manner.
> A preprocessing directive of the form
# embed " q-char-sequence " embed-parameter-sequenceopt new-line
searches a sequence of implementation-defined places for a resource identified uniquely by the specified sequence between the
delimiters. The search for the named resource is done in an implementation-defined manner. If this search is not supported, or if the search fails, the directive is reprocessed as if it read
"
# embed
h-char-sequence
< embed-parameter-sequenceopt new-line
> with the identical contained q-char-sequence (including
characters, if any) from the original directive.
> Either form of the
directive specified previously behave as specified below. The values of the integer constant expressions in the expanded sequence is determined by an implementation-defined mapping of the resource’s data. Each integer constant expression’s value is in the range from
#embed to
0 , inclusiveFN2✨).
( 2 embed element width ) - 1 If the list of integer constant expressions:
— is used to initialize an array of a type compatible with
, or compatible with
unsigned char if
char cannot hold negative values; or,
char — the embed element width is equal to
(5.2.4.2.1),
CHAR_BIT then the contents of the initialized elements of the array are as-if the resource’s binary data is
into the array at translation time.
fread A preprocessing directive of the form
# embed pp-tokens new-line
(that does not match one of the two previous forms) is permitted. The preprocessing tokens after embed in the directive are processed just as in normal text. (Each identifier currently defined as a macro name is replaced by its replacement list of preprocessing tokens.) The directive resulting after all replacements shall match one of the two previous formsFN3✨). The method by which a sequence of preprocessing tokens between a
and a
< preprocessing token pair or a pair of
> characters is combined into a single resource name preprocessing token is implementation-defined.
" An embed parameter with a preprocessor parameter token that is one of the following is a standard embed parameter:
limit The significance of these standard embed parameters is specified below.
FN1✨) This constraint helps ensure data is neither filled with padding values nor truncated in a given environment, and helps ensure the data is portable with respect to usages of
with character type arrays initialized from the data.
memcpy FN2✨) For example, an embed element width of 8 will yield a range of values from 0 to 255, inclusive.
FN3✨) Note that adjacent string literals are not concatenated into a single string literal (see the translation phases in 5.1.1.2); thus, an expansion that results in two string literals is an invalid directive.
Recommended PracticeThe
directive is meant to translate binary data in resources to sequence of integer constant expressions in a way that preserves the value of the resource’s bit stream where possible.
#embed Implementations should take into account translation-time bit and byte orders as well as execution time bit and byte orders to more appropriately represent the resource’s binary data from the directive. This maximizes the chance that, if the resource referenced at translation time through the
directive is the same one accessed through execution-time means, the data that is e.g.
#embed or similar into contiguous storage will compare bit-for-bit equal to an array of character type initialized from an
fread directive’s expanded contents.
#embed EXAMPLE Placing a small image resource.
#include <stddef.h>void have_you_any_wool ( const unsigned char * , size_t ); int main ( int , char * []) { static const unsigned char baa_baa [] = { #embed "black_sheep.ico" }; have_you_any_wool ( baa_baa , sizeof ( baa_baa )); return 0 ; } EXAMPLE This snippet:
int main ( int , char * []) { static const unsigned char coefficients [] = { #embed "only_8_bits.bin" // potential constraint violation }; return 0 ; } may violate the constraint that
must be 0. The 8 bits might not be evenly divisible by the embed element width (e.g., on a system where
( resource width ) % ( embed element width ) is 16). Issuing a diagnostic in this case may aid in portability by calling attention to potentially incompatible expectations between implementations and their resources.
CHAR_BIT EXAMPLE Initialization of non-arrays.
Non-array types can still be initialized since the directive produces a comma-delimited lists of integer constant expressions, a single integer constant expression, or nothing.int main () { /* Braces may be kept or elided as per normal initialization rules */ int i = { #embed "i.dat" }; /* i value is [0, 2^(embed element width)) first entry */ int i2 = #embed "i.dat" ; /* valid if i.dat produces 1 value, i2 value is [0, 2^(embed element width)) */ struct s { double a , b , c ; struct { double e , f , g ; }; double h , i , j ; }; struct s x = { /* initializes each element in order according to initialization rules with comma-separated list of integer constant expressions inside of braces */ #embed "s.dat" }; return 0 ; } EXAMPLE Equivalency of bit sequence and bit order between a translation-time read and an execution-time read of the same resource/file.
#include <string.h>#include <stddef.h>#include <stdio.h>int main () { static const unsigned char embed_data [] = { #embed <data.dat> }; const size_t f_size = sizeof ( embed_data ); unsigned char f_data [ f_size ]; FILE * f_source = fopen ( "data.dat" , "rb" ); if ( f_source == NULL); return 1 ; char * f_ptr = ( char * ) & f_data [ 0 ]; if ( fread ( f_ptr , 1 , f_size , f_source ) != f_size ) { fclose ( f_source ); return 1 ; } fclose ( f_source ); int is_same = memcmp ( & embed_data [ 0 ], f_ptr , f_size ); // if both operations refers to the same resource/file at // execution time and translation time, "is_same" should be 0 return is_same == 0 ? 0 : 1 ; }
7.5. Add 3 new sub-clauses as §6.10.✨.2, under §6.10.✨ Binary resource inclusion
6.10.✨.2parameter
limit ConstraintsThe
standard embed parameter may appear zero times or one time in the embed parameter sequence. Its preprocessor argument clause shall be present and have the form:
limit
( constant-expression )
and shall be an integer constant expression. The integer constant expression shall not evaluate to a value less than 0.
The token
shall not appear within the pp-balanced-token-sequence.
defined SemanticsThe embed parameter with a preprocessor parameter token
denotes a balanced preprocessing token sequence that will be used to compute the resource width. Independently of any macro replacement done previously (e.g. when matching the form of
limit ), the constant expression is evaluated after the balanced preprocessing token sequence is processed as in normal text, using the rules specified for conditional inclusion (6.10.1), with the exception that any defined macro expressions are not permitted.
#embed The resource width is:
— 0, if the integer constant expression evaluates to 0; or,
— the implementation resource width if it is less than the embed element width multiplied by the integer constant expression; or,
— the embed element width multiplied by the integer constant expression, if it is less than or equal to the implementation resource width.
EXAMPLE Checking the first 4 elements of a sound resource.
#include <assert.h>int main ( int , char * []) { static const char sound_signature [] = { #embed <sdk/jump.wav> limit(2+2) }; static_assert (( sizeof ( sound_signature ) / sizeof ( * sound_signature )) == 4 , "There should only be 4 elements in this array." ); // verify PCM WAV resource assert ( sound_signature [ 0 ] == 'R' ); assert ( sound_signature [ 1 ] == 'I' ); assert ( sound_signature [ 2 ] == 'F' ); assert ( sound_signature [ 3 ] == 'F' ); assert ( sizeof ( sound_signature ) == 4 ); return 0 ; } EXAMPLE Similar to a previous example, except it illustrates macro expansion specifically done for the
parameter.
limit ( …) #include <assert.h>#define TWO_PLUS_TWO 2+2 int main ( int , char * []) { const char sound_signature [] = { /* the token sequence within the parentheses for the "limit" parameter undergoes macro expansion, at least once, resulting in #embed <sdk/jump.wav> limit(2+2) */ #embed <sdk/jump.wav> limit(TWO_PLUS_TWO) }; static_assert (( sizeof ( sound_signature ) / sizeof ( * sound_signature )) == 4 , "There should only be 4 elements in this array." ); // verify PCM WAV resource assert ( sound_signature [ 0 ] == 'R' ); assert ( sound_signature [ 1 ] == 'I' ); assert ( sound_signature [ 2 ] == 'F' ); assert ( sound_signature [ 3 ] == 'F' ); assert ( sizeof ( sound_signature ) == 4 ); return 0 ; } EXAMPLE A potential constraint violation from a resource that may not have enough information in an environment that has a
greater than 24.
CHAR_BIT int main ( int , char * []) { const unsigned char arr [] = { #embed "24_bits.bin" limit(1) // may be a constraint violation }; return 0 ; }
7.6. OPTIONAL Modify §6.10.1 Conditional inclusion for __has_embed
expressions to return 2
alongside the above changes in paragraph 6
…The resource (6.10.✨) identified by the header-name preprocessing token sequence in each contained has_embed expression is searched for as if those preprocessing token were the pp-tokens in a
directive, except that no further macro expansion is performed. Such a directive shall satisfy the syntactic requirements of a
#embed directive. The has_embed expression evaluates to:
#embed
— 0 if the search fails or if any of the embed parameters in the embed parameter sequence specified are not supported by the implementation for the
directive; or,
#embed — 1 if the search for the resource succeeds and all embed parameters in the embed parameter sequence specified are supported by the implementation for the
directive and the resource is not empty; or,
#embed - — 2 if the search for the resource succeeds and all embed parameters in the embed parameter sequence specified are supported by the implementation for the
directive and the resource is empty.
#embed NOTE 1 Unrecognized preprocessor prefixed parameters in has_embed expressions is not a constraint violation and instead causes the expression to be evaluate to 0, as specified above.
…EXAMPLE This resource is considered empty due to the
embed parameter, always, including in
limit ( 0 ) expressions.
__has_embed int main () { #if __has_embed(</owo/uwurandom> limit(0)) == 2 // if </owo/uwurandom> exits, this // token sequence is always taken. return 0 ; #else // the resource does not exist #error "The resource does not exist" #endif }
7.7. OPTIONAL Add 3 new sub-clauses as §6.10.✨.3-5, under §6.10.✨ Binary resource inclusion and add an additional modification to the above changes' paragraph 14
An embed parameter with a preprocessing parameter token that is one of the following is a standard embed parameter:
limit
prefix
suffix
if_empty …
6.10.✨.3parameter
prefix ConstraintsThe
standard embed parameter may appear zero times or one time in the embed parameter sequence. Its preprocessor parameter clause shall be present and have the form:
prefix
( pp-balanced-token-sequenceopt )
SemanticsThe embed parameter with a preprocessor parameter token
denotes a balanced preprocessing token sequence within its preprocessor argument clause that will be placed immediately before the result of the associated
prefix directive’s expansion, if any.
#embed If the resource is empty, then
has no effect and is ignored.
prefix EXAMPLE A null-terminated character array with a prefix value and suffix set of additional tokens when the resource is not empty.
#include <string.h>#include <assert.h>#ifndef SHADER_TARGET #define SHADER_TARGET "ches.glsl" #endif extern char * merp ; void init_data () { const char whl [] = { #embed SHADER_TARGET \ prefix(0xEF, 0xBB, 0xBF, ) /* UTF-8 BOM */ \ suffix(,) 0 }; // always null terminated, // contains BOM if not-empty int is_good = ( sizeof ( whl ) == 1 && whl [ 0 ] == '\0' ) || ( whl [ 0 ] == '\xEF' && whl [ 1 ] == '\xBB' && whl [ 2 ] == '\xBF' && whl [ sizeof ( whl ) - 1 ] == '\0' ); assert ( is_good ); strcpy ( merp , whl ); } 6.10.✨.4parameter
suffix ConstraintsThe
standard embed parameter may appear zero times or one time in the embed parameter sequence. Its preprocessor argument clause shall be present and have the form:
suffix
( pp-balanced-token-sequenceopt )
SemanticsThe embed parameter with a preprocessing parameter token
denotes a balanced preprocessing token sequence within its preprocessor argument clause that will be placed immediately after the result of the associated
suffix directive’s expansion.
#embed If the resource is empty, then
has no effect and is ignored.
suffix EXAMPLE Extra elements added to array initializer.
#include <string.h>#ifndef SHADER_TARGET #define SHADER_TARGET "edith-impl.glsl" #endif extern char * null_term_shader_data ; void fill_in_data () { const char internal_data [] = { #embed SHADER_TARGET \ suffix(,) 0 }; strcpy ( null_term_shader_data , internal_data ); } 6.10.✨.5parameter
if_empty ConstraintsThe
standard embed parameter may appear zero times or one time in the embed parameter sequence. Its preprocessor argument clause shall be present and have the form:
if_empty
( pp-balanced-token-sequenceopt )
SemanticsThe embed parameter with a preprocessing parameter token
denotes a balanced preprocessing token sequence within its preprocessor argument clause that will replace the
if_empty directive entirely.
#embed If the resource is not empty, then
has no effect and is ignored.
if_empty EXAMPLE This resource is considered empty due to the
embed parameter, always. This program always returns 0, even if the resource is searched for and found successfully by the implementation.
limit ( 0 ) int main () { return #embed </owo/uwurandom> limit(0) prefix(1) if_empty(0) ; // becomes: // return 0; } EXAMPLE An example similar to using the
embed parameter, but changed slightly.
suffix #include <string.h>#ifndef SHADER_TARGET #define SHADER_TARGET "edith-impl.glsl" #endif extern char * null_term_shader_data ; void fill_in_data () { const char internal_data [] = { #embed SHADER_TARGET \ suffix(, 0) \ if_empty(0) }; strcpy ( null_term_shader_data , internal_data ); } EXAMPLE This resource is considered empty due to the
embed parameter, always, which means any
limit ( 0 ) expressions replace the directive as specified above.
if_empty int main () { return #include </owo/uwurandom>limit(0) if_empty(24) ; } becomes:
int main () { return 24 ; }
8. Acknowledgements
Thank you to Alex Gilding for bolstering this proposal with additional ideas and motivation. Thank you to Aaron Ballman, David Keaton, and Rajan Bhakta for early feedback on this proposal. Thank you to the
for bouncing lots of ideas off the idea in their Discord. Thank you to Hubert Tong for refining the proposal’s implementation-defined extension points.
Thank you to the Lounge<C++> for their continued support, and to rmf for the valuable early implementation feedback.
9. Appendix
9.1. Existing Tools
This section categorizes some of the platform-specific techniques used to work with C++ and some of the challenges they face. Other techniques used include pre-processing data, link-time based tooling, and assembly-time runtime loading. They are detailed below, for a complete picture of today’s landscape of options. They include both C and C++ options.
9.1.1. Pre-Processing Tools
-
Run the tool over the data (
) to obtain the generated file (xxd - i xxd_data . bin > xxd_data . h
) and add a null terminator if necessary:xxd_data . h
unsigned char xxd_data_bin [] = { 0x48 , 0x65 , 0x6c , 0x6c , 0x6f , 0x2c , 0x20 , 0x57 , 0x6f , 0x72 , 0x6c , 0x64 , 0x0a , 0x00 }; unsigned int xxd_data_bin_len = 13 ;
-
Compile
:main . c
#include <stdlib.h>#include <stdio.h>// prefix as const, // even if it generates some warnings in g++/clang++ const #include "xxd_data.h"int main () { const char * data = reinterpret_cast < const char *> ( xxd_data_bin ); puts ( data ); // Hello, World! return 0 ; }
Others still use python or other small scripting languages as part of their build process, outputting data in the exact C++ format that they require.
There are problems with the
or similar tool-based approach. Tokenization and Parsing data-as-source-code adds an enormous overhead to actually reading and making that data available.
Binary data as C(++) arrays provide the overhead of having to comma-delimit every single byte present, it also requires that the compiler verify every entry in that array is a valid literal or entry according to the C++ language.
This scales poorly with larger files, and build times suffer for any non-trivial binary file, especially when it scales into Megabytes in size (e.g., firmware and similar).
9.1.2. python
Other companies are forced to create their own ad-hoc tools to embed data and files into their C++ code. MongoDB uses a custom python script, just to format their data for compiler consumption:
import os import sys def jsToHeader ( target , source ): outFile = target h = [ '#include "mongo/base/string_data.h"' , '#include "mongo/scripting/engine.h"' , 'namespace mongo {' , 'namespace JSFiles{' , ] def lineToChars ( s ): return ',' . join ( str( ord( c )) for c in ( s . rstrip () + ' \n ' )) + ',' for s in source : filename = str( s ) objname = os . path . split ( filename )[ 1 ] . split ( '.' )[ 0 ] stringname = '_jscode_raw_' + objname h . append ( 'constexpr char ' + stringname + "[] = {" ) with open( filename , 'r' ) as f : for line in f : h . append ( lineToChars ( line )) h . append ( "0};" ) # symbols aren’t exported w/o this h . append ( 'extern const JSFile %s ;' % objname ) h . append ( 'const JSFile %s = { " %s ", StringData( %s , sizeof( %s ) - 1) };' % ( objname , filename . replace ( ' \\ ' , '/' ), stringname , stringname )) h . append ( "} // namespace JSFiles" ) h . append ( "} // namespace mongo" ) h . append ( "" ) text = ' \n ' . join ( h ) with open( outFile , 'wb' ) as out : try : out . write ( text ) finally : out . close () if __name__== "__main__" : if len( sys . argv ) < 3 : print"Must specify [target] [source] " sys . exit ( 1 ) jsToHeader ( sys . argv [ 1 ], sys . argv [ 2 :])
MongoDB were brave enough to share their code with me and make public the things they have to do: other companies have shared many similar concerns, but do not have the same bravery. We thank MongoDB for sharing.
9.1.3. ld
A complete example (does not compile on Visual C++):
-
Have a file ld_data.bin with the contents
.Hello , World ! -
Run
.ld - r binary - o ld_data . o ld_data . bin -
Compile the following
withmain . cpp
:gcc - std = c ++ 17 ld_data . o main . cpp
#include <stdlib.h>#include <stdio.h>#define STRINGIZE_(x) #x #define STRINGIZE(x) STRINGIZE_(x) #ifdef __APPLE__ #include <mach-o/getsect.h>#define DECLARE_LD_(LNAME) extern const unsigned char _section$__DATA__##LNAME[]; #define LD_NAME_(LNAME) _section$__DATA__##LNAME #define LD_SIZE_(LNAME) (getsectbyLNAME("__DATA", "__" STRINGIZE(LNAME))->size) #define DECLARE_LD(LNAME) DECLARE_LD_(LNAME) #define LD_NAME(LNAME) LD_NAME_(LNAME) #define LD_SIZE(LNAME) LD_SIZE_(LNAME) #elif (defined __MINGW32__) /* mingw */ #define DECLARE_LD(LNAME) \ extern const unsigned char binary_##LNAME##_start[]; \ extern const unsigned char binary_##LNAME##_end[]; #define LD_NAME(LNAME) binary_##LNAME##_start #define LD_SIZE(LNAME) ((binary_##LNAME##_end) - (binary_##LNAME##_start)) #define DECLARE_LD(LNAME) DECLARE_LD_(LNAME) #define LD_NAME(LNAME) LD_NAME_(LNAME) #define LD_SIZE(LNAME) LD_SIZE_(LNAME) #else /* gnu/linux ld */ #define DECLARE_LD_(LNAME) \ extern const unsigned char _binary_##LNAME##_start[]; \ extern const unsigned char _binary_##LNAME##_end[]; #define LD_NAME_(LNAME) _binary_##LNAME##_start #define LD_SIZE_(LNAME) ((_binary_##LNAME##_end) - (_binary_##LNAME##_start)) #define DECLARE_LD(LNAME) DECLARE_LD_(LNAME) #define LD_NAME(LNAME) LD_NAME_(LNAME) #define LD_SIZE(LNAME) LD_SIZE_(LNAME) #endif DECLARE_LD ( ld_data_bin ); int main () { const char * p_data = reinterpret_cast < const char *> ( LD_NAME ( ld_data_bin )); // impossible, not null-terminated //puts(p_data); // must copy instead return 0 ; }
This scales a little bit better in terms of raw compilation time but is shockingly OS, vendor and platform specific in ways that novice developers would not be able to handle fully. The macros are required to erase differences, lest subtle differences in name will destroy one’s ability to use these macros effectively. We omitted the code for handling VC++ resource files because it is excessively verbose than what is present here.
N.B.: Because these declarations are
, the values in the array cannot be accessed at compilation/translation-time.
9.1.4. incbin
There is a tool called
which is a 3rd party attempt at pulling files in at "assembly time". Its approach is incredibly similar to
, with the caveat that files must be shipped with their binary. It unfortunately falls prey to the same problems of cross-platform woes when dealing with Visual C, requiring additional pre-processing to work out in full.
9.1.5. xxd
, but done Raw
Some people cannot even use the
tool on their platforms because it cannot be used. This is the case where tools need to be able to package things, and therefore their build tools need to accommodate for not having their information. The way to help save for this is to create other small utilities that effectively duplicate the tools, but in different ways.
This has affected packaging of Debian-style packages on multiple distributions.
9.2. Type Flexibility
Note: As per the vote in the September C++ Evolution Working Group Meeting, Type Flexibility is not being pursued in the preprocessor for various implementation and support splitting concerns.
A type can be specified after the
to view the data in a very specific manner. This allows data to initialized as exactly that type.
Type flexibility was not pursued for various implementation concerns. Chief among them was single-purpose preprocessors that did not have access to frontend information. This meant it was very hard to make a system that was both preprocessor conformant but did not require e.g.
information at the point of preprocessor invocation. Therefore, the type flexibility feature was pulled from
and will be conglomerated in other additions such as
or
.
/* specify a type-name to change array type */ const int shorten_flac [] = { #embed int "stripped_music.flac" };
The contents of the resource are mapped in an implementation-defined manner to the data, such that it will use
bits for each element. If the file does not have enough bits to fill out a multiple of
bits, then a diagnostic is required. Furthermore, we require that the type passed to
that must one of the following fundamental types, signed or unsigned, spelled exactly in this manner:
-
,char
,unsigned char signed char -
,short
,unsigned short signed short -
,int
,unsigned int signed int -
,long
,unsigned long signed long -
,long long
,unsigned long long signed long long
More types can be supported by the implementation if the implementation so chooses (both the GCC and Clang prototypes described below support more than this). The reason exactly these types are required is because these are the only types for which there is a suitable way to obtain their size at pre-processor time. Quoting from §5.2.4.2.1, paragraph 1:
The values given below shall be replaced by constant expressions suitable for use in
preprocessing directives.
#if
This means that the types above have a specific size that can be properly initialized by a preprocessor entirely independent of a proper C frontend, without needing to know more than how to be a preprocessor. Originally, the proposal required that every use of
is accompanied by a
(or, in the case of C++,
). Instead, the proposal now lets the implementation "figure it out" on an implementation-by-implementation basis.