Zig Language Reference

Zig is a general-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.

Robust

Behavior is correct even for edge cases such as out of memory.

Optimal

Write programs the best way they can behave and perform.

Reusable

The same code works in many environments which have different constraints.

Maintainable

Precisely communicate intent to the compiler and other programmers. The language imposes a low overhead to reading code and is resilient to changing requirements and environments.

Often the most efficient way to learn something new is to see examples, so this documentation shows how to use each of Zig's features. It is all on one page so you can search with your browser's search tool.

The code samples in this document are compiled and tested as part of the main test suite of Zig.

This HTML document depends on no external files, so you can use it offline.

The Zig Standard Library has its own documentation.

Zig's Standard Library contains commonly used algorithms, data structures, and definitions to help you build programs or libraries. You will see many examples of Zig's Standard Library used in this documentation. To learn more about the Zig Standard Library, visit the link above.

Most of the time, it is more appropriate to write to stderr rather than stdout, and whether or not the message is successfully written to the stream is irrelevant. For this common case, there is a simpler API:

In this case, the {#syntax#}!{#endsyntax#} may be omitted from the return type because no errors are returned from the function.

Zig supports 3 types of comments. Normal comments are ignored, but doc comments and top-level doc comments are used by the compiler to generate the package documentation.

The generated documentation is still experimental, and can be produced with:

There are no multiline comments in Zig (e.g. like /* */ comments in C). This allows Zig to have the property that each line of code can be tokenized out of context.

A doc comment is one that begins with exactly three slashes (i.e. {#syntax#}///{#endsyntax#} but not {#syntax#}////{#endsyntax#}); multiple doc comments in a row are merged together to form a multiline doc comment. The doc comment documents whatever immediately follows it.

Doc comments are only allowed in certain places; it is a compile error to have a doc comment in an unexpected place, such as in the middle of an expression, or just before a non-doc comment.

Doc comments can be interleaved with normal comments. Currently, when producing the package documentation, normal comments are merged with doc comments.

A top-level doc comment is one that begins with two slashes and an exclamation point: {#syntax#}//!{#endsyntax#}; it documents the current module.

It is a compile error if a top-level doc comment is not placed at the start of a {#link|container|Containers#}, before any expressions.

In addition to the integer types above, arbitrary bit-width integers can be referenced by using an identifier of i or u followed by digits. For example, the identifier {#syntax#}i7{#endsyntax#} refers to a signed 7-bit integer. The maximum allowed bit-width of an integer type is {#syntax#}65535{#endsyntax#}.

String literals are constant single-item {#link|Pointers#} to null-terminated byte arrays. The type of string literals encodes both the length, and the fact that they are null-terminated, and thus they can be {#link|coerced|Type Coercion#} to both {#link|Slices#} and {#link|Null-Terminated Pointers|Sentinel-Terminated Pointers#}. Dereferencing string literals converts them to {#link|Arrays#}.

Because Zig source code is {#link|UTF-8 encoded|Source Encoding#}, any non-ASCII bytes appearing within a string literal in source code carry their UTF-8 meaning into the content of the string in the Zig program; the bytes are not modified by the compiler. It is possible to embed non-UTF-8 bytes into a string literal using \xNN notation.

Indexing into a string containing non-ASCII bytes returns individual bytes, whether valid UTF-8 or not.

Unicode code point literals have type {#syntax#}comptime_int{#endsyntax#}, the same as {#link|Integer Literals#}. All {#link|Escape Sequences#} are valid in both string literals and Unicode code point literals.

Note that the maximum valid Unicode scalar value is {#syntax#}0x10ffff{#endsyntax#}.

Multiline string literals have no escapes and can span across multiple lines. To start a multiline string literal, use the {#syntax#}\\{#endsyntax#} token. Just like a comment, the string literal goes until the end of the line. The end of the line is not included in the string literal. However, if the next line begins with {#syntax#}\\{#endsyntax#} then a newline is appended and the string literal continues.

Use the {#syntax#}const{#endsyntax#} keyword to assign a value to an identifier:

{#syntax#}const{#endsyntax#} applies to all of the bytes that the identifier immediately addresses. {#link|Pointers#} have their own const-ness.

If you need a variable that you can modify, use the {#syntax#}var{#endsyntax#} keyword:

Variables must be initialized:

Use {#syntax#}undefined{#endsyntax#} to leave variables uninitialized:

{#syntax#}undefined{#endsyntax#} can be {#link|coerced|Type Coercion#} to any type. Once this happens, it is no longer possible to detect that the value is {#syntax#}undefined{#endsyntax#}. {#syntax#}undefined{#endsyntax#} means the value could be anything, even something that is nonsense according to the type. Translated into English, {#syntax#}undefined{#endsyntax#} means "Not a meaningful value. Using this value would be a bug. The value will be unused, or overwritten before being used."

In {#link|Debug#} mode, Zig writes {#syntax#}0xaa{#endsyntax#} bytes to undefined memory. This is to catch bugs early, and to help detect use of undefined memory in a debugger. However, this behavior is only an implementation feature, not a language semantic, so it is not guaranteed to be observable to code.

Code written within one or more {#syntax#}test{#endsyntax#} declarations can be used to ensure behavior meets expectations:

The testing_introduction.zig code sample tests the {#link|function|Functions#} {#syntax#}addOne{#endsyntax#} to ensure that it returns {#syntax#}42{#endsyntax#} given the input {#syntax#}41{#endsyntax#}. From this test's perspective, the {#syntax#}addOne{#endsyntax#} function is said to be code under test.

zig test is a tool that creates and runs a test build. By default, it builds and runs an executable program using the default test runner provided by the {#link|Zig Standard Library#} as its main entry point. During the build, {#syntax#}test{#endsyntax#} declarations found while {#link|resolving|Root Source File#} the given Zig source file are included for the default test runner to run and report on.

The shell output shown above displays two lines after the zig test command. These lines are printed to standard error by the default test runner:

1/2 testing_introduction.test.expect addOne adds one to 41...

Lines like this indicate which test, out of the total number of tests, is being run. In this case, 1/2 indicates that the first test, out of a total of two tests, is being run. Note that, when the test runner program's standard error is output to the terminal, these lines are cleared when a test succeeds.

2/2 testing_introduction.decltest.addOne...

When the test name is an identifier, the default test runner uses the text decltest instead of test.

All 2 tests passed.

This line indicates the total number of tests that have passed.

Test declarations contain the {#link|keyword|Keyword Reference#} {#syntax#}test{#endsyntax#}, followed by an optional name written as a {#link|string literal|String Literals and Unicode Code Point Literals#} or an {#link|identifier|Identifiers#}, followed by a {#link|block|Blocks#} containing any valid Zig code that is allowed in a {#link|function|Functions#}.

Non-named test blocks always run during test builds and are exempt from {#link|Skip Tests#}.

Test declarations are similar to {#link|Functions#}: they have a return type and a block of code. The implicit return type of {#syntax#}test{#endsyntax#} is the {#link|Error Union Type#} {#syntax#}anyerror!void{#endsyntax#}, and it cannot be changed. When a Zig source file is not built using the zig test tool, the test declarations are omitted from the build.

Test declarations can be written in the same file, where code under test is written, or in a separate Zig source file. Since test declarations are top-level declarations, they are order-independent and can be written before or after the code under test.

Test declarations named using an identifier are doctests. The identifier must refer to another declaration in scope. A doctest, like a {#link|doc comment|Doc Comments#}, serves as documentation for the associated declaration, and will appear in the generated documentation for the declaration.

An effective doctest should be self-contained and focused on the declaration being tested, answering questions a new user might have about its interface or intended usage, while avoiding unnecessary or confusing details. A doctest is not a substitute for a doc comment, but rather a supplement and companion providing a testable, code-driven example, verified by zig test.

The default test runner checks for an {#link|error|Errors#} returned from a test. When a test returns an error, the test is considered a failure and its {#link|error return trace|Error Return Traces#} is output to standard error. The total number of failures will be reported after all tests have run.

One way to skip tests is to filter them out by using the zig test command line parameter --test-filter [text]. This makes the test build only include tests whose name contains the supplied filter text. Note that non-named tests are run even when using the --test-filter [text] command line parameter.

To programmatically skip a test, make a {#syntax#}test{#endsyntax#} return the error {#syntax#}error.SkipZigTest{#endsyntax#} and the default test runner will consider the test as being skipped. The total number of skipped tests will be reported after all tests have run.

When code allocates {#link|Memory#} using the {#link|Zig Standard Library#}'s testing allocator, {#syntax#}std.testing.allocator{#endsyntax#}, the default test runner will report any leaks that are found from using the testing allocator:

Use the {#link|compile variable|Compile Variables#} {#syntax#}@import("builtin").is_test{#endsyntax#} to detect a test build:

The default test runner and the Zig Standard Library's testing namespace output messages to standard error.

The Zig Standard Library's testing namespace contains useful functions to help you create tests. In addition to the expect function, this document uses a couple of more functions as exemplified here:

The Zig Standard Library also contains functions to compare {#link|Slices#}, strings, and more. See the rest of the {#syntax#}std.testing{#endsyntax#} namespace in the {#link|Zig Standard Library#} for more available functions.

zig test has a few command line parameters which affect the compilation. See zig test --help for a full list.

A variable is a unit of {#link|Memory#} storage.

It is generally preferable to use {#syntax#}const{#endsyntax#} rather than {#syntax#}var{#endsyntax#} when declaring a variable. This causes less work for both humans and computers to do when reading code, and creates more optimization opportunities.

The {#syntax#}extern{#endsyntax#} keyword or {#link|@extern#} builtin function can be used to link against a variable that is exported from another object. The {#syntax#}export{#endsyntax#} keyword or {#link|@export#} builtin function can be used to make a variable available to other objects at link time. In both cases, the type of the variable must be C ABI compatible.

Variable identifiers are never allowed to shadow identifiers from an outer scope.

Identifiers must start with an alphabetic character or underscore and may be followed by any number of alphanumeric characters or underscores. They must not overlap with any keywords. See {#link|Keyword Reference#}.

If a name that does not fit these requirements is needed, such as for linking with external libraries, the {#syntax#}@""{#endsyntax#} syntax may be used.

{#link|Container|Containers#} level variables have static lifetime and are order-independent and lazily analyzed. The initialization value of container level variables is implicitly {#link|comptime#}. If a container level variable is {#syntax#}const{#endsyntax#} then its value is {#syntax#}comptime{#endsyntax#}-known, otherwise it is runtime-known.

Container level variables may be declared inside a {#link|struct#}, {#link|union#}, {#link|enum#}, or {#link|opaque#}:

It is also possible to have local variables with static lifetime by using containers inside functions.

A variable may be specified to be a thread-local variable using the {#syntax#}threadlocal{#endsyntax#} keyword, which makes each thread work with a separate instance of the variable:

For {#link|Single Threaded Builds#}, all thread local variables are treated as regular {#link|Container Level Variables#}.

Thread local variables may not be {#syntax#}const{#endsyntax#}.

Local variables occur inside {#link|Functions#}, {#link|comptime#} blocks, and {#link|@cImport#} blocks.

When a local variable is {#syntax#}const{#endsyntax#}, it means that after initialization, the variable's value will not change. If the initialization value of a {#syntax#}const{#endsyntax#} variable is {#link|comptime#}-known, then the variable is also {#syntax#}comptime{#endsyntax#}-known.

A local variable may be qualified with the {#syntax#}comptime{#endsyntax#} keyword. This causes the variable's value to be {#syntax#}comptime{#endsyntax#}-known, and all loads and stores of the variable to happen during semantic analysis of the program, rather than at runtime. All variables declared in a {#syntax#}comptime{#endsyntax#} expression are implicitly {#syntax#}comptime{#endsyntax#} variables.

Integer literals have no size limitation, and if any undefined behavior occurs, the compiler catches it.

However, once an integer value is no longer known at compile-time, it must have a known size, and is vulnerable to undefined behavior.

In this function, values {#syntax#}a{#endsyntax#} and {#syntax#}b{#endsyntax#} are known only at runtime, and thus this division operation is vulnerable to both {#link|Integer Overflow#} and {#link|Division by Zero#}.

Operators such as {#syntax#}+{#endsyntax#} and {#syntax#}-{#endsyntax#} cause undefined behavior on integer overflow. Alternative operators are provided for wrapping and saturating arithmetic on all targets. {#syntax#}+%{#endsyntax#} and {#syntax#}-%{#endsyntax#} perform wrapping arithmetic while {#syntax#}+|{#endsyntax#} and {#syntax#}-|{#endsyntax#} perform saturating arithmetic.

Zig supports arbitrary bit-width integers, referenced by using an identifier of i or u followed by digits. For example, the identifier {#syntax#}i7{#endsyntax#} refers to a signed 7-bit integer. The maximum allowed bit-width of an integer type is {#syntax#}65535{#endsyntax#}. For signed integer types, Zig uses a two's complement representation.

Zig has the following floating point types:

• {#syntax#}f16{#endsyntax#} - IEEE-754-2008 binary16
• {#syntax#}f32{#endsyntax#} - IEEE-754-2008 binary32
• {#syntax#}f64{#endsyntax#} - IEEE-754-2008 binary64
• {#syntax#}f80{#endsyntax#} - IEEE-754-2008 80-bit extended precision
• {#syntax#}f128{#endsyntax#} - IEEE-754-2008 binary128
• {#syntax#}c_longdouble{#endsyntax#} - matches long double for the target C ABI

Float literals have type {#syntax#}comptime_float{#endsyntax#} which is guaranteed to have the same precision and operations of the largest other floating point type, which is {#syntax#}f128{#endsyntax#}.

Float literals {#link|coerce|Type Coercion#} to any floating point type, and to any {#link|integer|Integers#} type when there is no fractional component.

There is no syntax for NaN, infinity, or negative infinity. For these special values, one must use the standard library:

By default floating point operations use {#syntax#}Strict{#endsyntax#} mode, but you can switch to {#syntax#}Optimized{#endsyntax#} mode on a per-block basis:

For this test we have to separate code into two object files - otherwise the optimizer figures out all the values at compile-time, which operates in strict mode.

There is no operator overloading. When you see an operator in Zig, you know that it is doing something from this table, and nothing else.

{#syntax#}a + b
a += b{#endsyntax#}

{#syntax#}2 + 5 == 7{#endsyntax#}

{#syntax#}a +% b
a +%= b{#endsyntax#}

{#syntax#}@as(u32, 0xffffffff) +% 1 == 0{#endsyntax#}

{#syntax#}a +| b
a +|= b{#endsyntax#}

{#syntax#}@as(u8, 255) +| 1 == @as(u8, 255){#endsyntax#}

{#syntax#}a - b
a -= b{#endsyntax#}

{#syntax#}2 - 5 == -3{#endsyntax#}

{#syntax#}a -% b
a -%= b{#endsyntax#}

{#syntax#}@as(u8, 0) -% 1 == 255{#endsyntax#}

{#syntax#}a -| b
a -|= b{#endsyntax#}

{#syntax#}@as(u32, 0) -| 1 == 0{#endsyntax#}

{#syntax#}-a{#endsyntax#}

{#syntax#}-1 == 0 - 1{#endsyntax#}

{#syntax#}-%a{#endsyntax#}

{#syntax#}-%@as(i8, -128) == -128{#endsyntax#}

{#syntax#}a * b
a *= b{#endsyntax#}

{#syntax#}2 * 5 == 10{#endsyntax#}

{#syntax#}a *% b
a *%= b{#endsyntax#}

{#syntax#}@as(u8, 200) *% 2 == 144{#endsyntax#}

{#syntax#}a *| b
a *|= b{#endsyntax#}

{#syntax#}@as(u8, 200) *| 2 == 255{#endsyntax#}

{#syntax#}a / b
a /= b{#endsyntax#}

{#syntax#}10 / 5 == 2{#endsyntax#}

{#syntax#}a % b
a %= b{#endsyntax#}

{#syntax#}10 % 3 == 1{#endsyntax#}

{#syntax#}a << b
a <<= b{#endsyntax#}

{#syntax#}0b1 << 8 == 0b100000000{#endsyntax#}

{#syntax#}a <<| b
a <<|= b{#endsyntax#}

{#syntax#}@as(u8, 1) <<| 8 == 255{#endsyntax#}

{#syntax#}a >> b
a >>= b{#endsyntax#}

{#syntax#}0b1010 >> 1 == 0b101{#endsyntax#}

{#syntax#}a & b
a &= b{#endsyntax#}

{#syntax#}0b011 & 0b101 == 0b001{#endsyntax#}

{#syntax#}a | b
a |= b{#endsyntax#}

{#syntax#}0b010 | 0b100 == 0b110{#endsyntax#}

{#syntax#}a ^ b
a ^= b{#endsyntax#}

{#syntax#}0b011 ^ 0b101 == 0b110{#endsyntax#}

{#syntax#}~a{#endsyntax#}

{#syntax#}~@as(u8, 0b10101111) == 0b01010000{#endsyntax#}

{#syntax#}a orelse b{#endsyntax#}

{#syntax#}const value: ?u32 = null;
const unwrapped = value orelse 1234;
unwrapped == 1234{#endsyntax#}

{#syntax#}a.?{#endsyntax#}

{#syntax#}a orelse unreachable{#endsyntax#}

{#syntax#}const value: ?u32 = 5678;
value.? == 5678{#endsyntax#}

{#syntax#}a catch b
a catch |err| b{#endsyntax#}

{#syntax#}const value: anyerror!u32 = error.Broken;
const unwrapped = value catch 1234;
unwrapped == 1234{#endsyntax#}

{#syntax#}a and b{#endsyntax#}

{#syntax#}(false and true) == false{#endsyntax#}

{#syntax#}a or b{#endsyntax#}

{#syntax#}(false or true) == true{#endsyntax#}

{#syntax#}!a{#endsyntax#}

{#syntax#}!false == true{#endsyntax#}

{#syntax#}a == b{#endsyntax#}

{#syntax#}(1 == 1) == true{#endsyntax#}

{#syntax#}a == null{#endsyntax#}

{#syntax#}const value: ?u32 = null;
(value == null) == true{#endsyntax#}

{#syntax#}a != b{#endsyntax#}

{#syntax#}(1 != 1) == false{#endsyntax#}

{#syntax#}a != null{#endsyntax#}

{#syntax#}const value: ?u32 = null;
(value != null) == false{#endsyntax#}

{#syntax#}a > b{#endsyntax#}

{#syntax#}(2 > 1) == true{#endsyntax#}

{#syntax#}a >= b{#endsyntax#}

{#syntax#}(2 >= 1) == true{#endsyntax#}

{#syntax#}a < b{#endsyntax#}

{#syntax#}(1 < 2) == true{#endsyntax#}

{#syntax#}a <= b{#endsyntax#}

{#syntax#}(1 <= 2) == true{#endsyntax#}

{#syntax#}a ++ b{#endsyntax#}

{#syntax#}const mem = @import("std").mem;
const array1 = [_]u32{1,2};
const array2 = [_]u32{3,4};
const together = array1 ++ array2;
mem.eql(u32, &together, &[_]u32{1,2,3,4}){#endsyntax#}

{#syntax#}a ** b{#endsyntax#}

{#syntax#}const mem = @import("std").mem;
const pattern = "ab" ** 3;
mem.eql(u8, pattern, "ababab"){#endsyntax#}

{#syntax#}a.*{#endsyntax#}

{#syntax#}const x: u32 = 1234;
const ptr = &x;
ptr.* == 1234{#endsyntax#}

{#syntax#}&a{#endsyntax#}

{#syntax#}const x: u32 = 1234;
const ptr = &x;
ptr.* == 1234{#endsyntax#}

{#syntax#}a || b{#endsyntax#}

{#syntax#}const A = error{One};
const B = error{Two};
(A || B) == error{One, Two}{#endsyntax#}

{#syntax#}x() x[] x.y x.* x.?
a!b
x{}
!x -x -%x ~x &x ?x
* / % ** *% *| ||
+ - ++ +% -% +| -|
<< >> <<|
& ^ | orelse catch
== != < > <= >=
and
or
= *= *%= *|= /= %= += +%= +|= -= -%= -|= <<= <<|= >>= &= ^= |={#endsyntax#}

Multidimensional arrays can be created by nesting arrays:

The syntax {#syntax#}[N:x]T{#endsyntax#} describes an array which has a sentinel element of value {#syntax#}x{#endsyntax#} at the index corresponding to the length {#syntax#}N{#endsyntax#}.

A vector is a group of booleans, {#link|Integers#}, {#link|Floats#}, or {#link|Pointers#} which are operated on in parallel, using SIMD instructions if possible. Vector types are created with the builtin function {#link|@Vector#}.

Vectors support the same builtin operators as their underlying base types. These operations are performed element-wise, and return a vector of the same length as the input vectors. This includes:

• Arithmetic ({#syntax#}+{#endsyntax#}, {#syntax#}-{#endsyntax#}, {#syntax#}/{#endsyntax#}, {#syntax#}*{#endsyntax#}, {#syntax#}@divFloor{#endsyntax#}, {#syntax#}@sqrt{#endsyntax#}, {#syntax#}@ceil{#endsyntax#}, {#syntax#}@log{#endsyntax#}, etc.)
• Bitwise operators ({#syntax#}>>{#endsyntax#}, {#syntax#}<<{#endsyntax#}, {#syntax#}&{#endsyntax#}, {#syntax#}|{#endsyntax#}, {#syntax#}~{#endsyntax#}, etc.)
• Comparison operators ({#syntax#}<{#endsyntax#}, {#syntax#}>{#endsyntax#}, {#syntax#}=={#endsyntax#}, etc.)

It is prohibited to use a math operator on a mixture of scalars (individual numbers) and vectors. Zig provides the {#link|@splat#} builtin to easily convert from scalars to vectors, and it supports {#link|@reduce#} and array indexing syntax to convert from vectors to scalars. Vectors also support assignment to and from fixed-length arrays with comptime-known length.

For rearranging elements within and between vectors, Zig provides the {#link|@shuffle#} and {#link|@select#} functions.

Operations on vectors shorter than the target machine's native SIMD size will typically compile to single SIMD instructions, while vectors longer than the target machine's native SIMD size will compile to multiple SIMD instructions. If a given operation doesn't have SIMD support on the target architecture, the compiler will default to operating on each vector element one at a time. Zig supports any comptime-known vector length up to 2^32-1, although small powers of two (2-64) are most typical. Note that excessively long vector lengths (e.g. 2^20) may result in compiler crashes on current versions of Zig.

TODO talk about C ABI interop
TODO consider suggesting std.MultiArrayList

Zig has two kinds of pointers: single-item and many-item.

• {#syntax#}*T{#endsyntax#} - single-item pointer to exactly one item.
  • Supports deref syntax: {#syntax#}ptr.*{#endsyntax#}
  • Supports slice syntax: {#syntax#}ptr[0..1]{#endsyntax#}
  • Supports pointer subtraction: {#syntax#}ptr - ptr{#endsyntax#}
• {#syntax#}[*]T{#endsyntax#} - many-item pointer to unknown number of items.
  • Supports index syntax: {#syntax#}ptr[i]{#endsyntax#}
  • Supports slice syntax: {#syntax#}ptr[start..end]{#endsyntax#} and {#syntax#}ptr[start..]{#endsyntax#}
  • Supports pointer-integer arithmetic: {#syntax#}ptr + int{#endsyntax#}, {#syntax#}ptr - int{#endsyntax#}
  • Supports pointer subtraction: {#syntax#}ptr - ptr{#endsyntax#}
  {#syntax#}T{#endsyntax#} must have a known size, which means that it cannot be {#syntax#}anyopaque{#endsyntax#} or any other {#link|opaque type|opaque#}.

These types are closely related to {#link|Arrays#} and {#link|Slices#}:

• {#syntax#}*[N]T{#endsyntax#} - pointer to N items, same as single-item pointer to an array.
  • Supports index syntax: {#syntax#}array_ptr[i]{#endsyntax#}
  • Supports slice syntax: {#syntax#}array_ptr[start..end]{#endsyntax#}
  • Supports len property: {#syntax#}array_ptr.len{#endsyntax#}
  • Supports pointer subtraction: {#syntax#}array_ptr - array_ptr{#endsyntax#}

• {#syntax#}[]T{#endsyntax#} - is a slice (a fat pointer, which contains a pointer of type {#syntax#}[*]T{#endsyntax#} and a length).
  • Supports index syntax: {#syntax#}slice[i]{#endsyntax#}
  • Supports slice syntax: {#syntax#}slice[start..end]{#endsyntax#}
  • Supports len property: {#syntax#}slice.len{#endsyntax#}

Use {#syntax#}&x{#endsyntax#} to obtain a single-item pointer:

Zig supports pointer arithmetic. It's better to assign the pointer to {#syntax#}[*]T{#endsyntax#} and increment that variable. For example, directly incrementing the pointer from a slice will corrupt it.

In Zig, we generally prefer {#link|Slices#} rather than {#link|Sentinel-Terminated Pointers#}. You can turn an array or pointer into a slice using slice syntax.

Slices have bounds checking and are therefore protected against this kind of undefined behavior. This is one reason we prefer slices to pointers.

Pointers work at compile-time too, as long as the code does not depend on an undefined memory layout:

To convert an integer address into a pointer, use {#syntax#}@ptrFromInt{#endsyntax#}. To convert a pointer to an integer, use {#syntax#}@intFromPtr{#endsyntax#}:

Zig is able to preserve memory addresses in comptime code, as long as the pointer is never dereferenced:

Loads and stores are assumed to not have side effects. If a given load or store should have side effects, such as Memory Mapped Input/Output (MMIO), use {#syntax#}volatile{#endsyntax#}. In the following code, loads and stores with {#syntax#}mmio_ptr{#endsyntax#} are guaranteed to all happen and in the same order as in source code:

Note that {#syntax#}volatile{#endsyntax#} is unrelated to concurrency and {#link|Atomics#}. If you see code that is using {#syntax#}volatile{#endsyntax#} for something other than Memory Mapped Input/Output, it is probably a bug.

{#link|@ptrCast#} converts a pointer's element type to another. This creates a new pointer that can cause undetectable illegal behavior depending on the loads and stores that pass through it. Generally, other kinds of type conversions are preferable to {#syntax#}@ptrCast{#endsyntax#} if possible.

Each type has an alignment - a number of bytes such that, when a value of the type is loaded from or stored to memory, the memory address must be evenly divisible by this number. You can use {#link|@alignOf#} to find out this value for any type.

Alignment depends on the CPU architecture, but is always a power of two, and less than {#syntax#}1 << 29{#endsyntax#}.

In Zig, a pointer type has an alignment value. If the value is equal to the alignment of the underlying type, it can be omitted from the type:

In the same way that a {#syntax#}*i32{#endsyntax#} can be {#link|coerced|Type Coercion#} to a {#syntax#}*const i32{#endsyntax#}, a pointer with a larger alignment can be implicitly cast to a pointer with a smaller alignment, but not vice versa.

You can specify alignment on variables and functions. If you do this, then pointers to them get the specified alignment:

If you have a pointer or a slice that has a small alignment, but you know that it actually has a bigger alignment, use {#link|@alignCast#} to change the pointer into a more aligned pointer. This is a no-op at runtime, but inserts a {#link|safety check|Incorrect Pointer Alignment#}:

This pointer attribute allows a pointer to have address zero. This is only ever needed on the freestanding OS target, where the address zero is mappable. If you want to represent null pointers, use {#link|Optional Pointers#} instead. {#link|Optional Pointers#} with {#syntax#}allowzero{#endsyntax#} are not the same size as pointers. In this code example, if the pointer did not have the {#syntax#}allowzero{#endsyntax#} attribute, this would be a {#link|Pointer Cast Invalid Null#} panic:

The syntax {#syntax#}[*:x]T{#endsyntax#} describes a pointer that has a length determined by a sentinel value. This provides protection against buffer overflow and overreads.

A slice is a pointer and a length. The difference between an array and a slice is that the array's length is part of the type and known at compile-time, whereas the slice's length is known at runtime. Both can be accessed with the {#syntax#}len{#endsyntax#} field.

This is one reason we prefer slices to pointers.

The syntax {#syntax#}[:x]T{#endsyntax#} is a slice which has a runtime-known length and also guarantees a sentinel value at the element indexed by the length. The type does not guarantee that there are no sentinel elements before that. Sentinel-terminated slices allow element access to the {#syntax#}len{#endsyntax#} index.

Sentinel-terminated slices can also be created using a variation of the slice syntax {#syntax#}data[start..end :x]{#endsyntax#}, where {#syntax#}data{#endsyntax#} is a many-item pointer, array or slice and {#syntax#}x{#endsyntax#} is the sentinel value.

Sentinel-terminated slicing asserts that the element in the sentinel position of the backing data is actually the sentinel value. If this is not the case, safety-protected {#link|Undefined Behavior#} results.

Each struct field may have an expression indicating the default field value. Such expressions are executed at {#link|comptime#}, and allow the field to be omitted in a struct literal expression:

Default field values are only appropriate when the data invariants of a struct cannot be violated by omitting that field from an initialization.

For example, here is an inappropriate use of default struct field initialization:

Above you can see the danger of ignoring this principle. The default field values caused the data invariant to be violated, causing illegal behavior.

To fix this, remove the default values from all the struct fields, and provide a named default value:

If a struct value requires a runtime-known value in order to be initialized without violating data invariants, then use an initialization method that accepts those runtime values, and populates the remaining fields.

An {#syntax#}extern struct{#endsyntax#} has in-memory layout matching the C ABI for the target.

If well-defined in-memory layout is not required, {#link|struct#} is a better choice because it places fewer restrictions on the compiler.

See {#link|packed struct#} for a struct that has the ABI of its backing integer, which can be useful for modeling flags.

Unlike normal structs, {#syntax#}packed{#endsyntax#} structs have guaranteed in-memory layout:

• Fields remain in the order declared, least to most significant.
• There is no padding between fields.
• Zig supports arbitrary width {#link|Integers#} and although normally, integers with fewer than 8 bits will still use 1 byte of memory, in packed structs, they use exactly their bit width.
• {#syntax#}bool{#endsyntax#} fields use exactly 1 bit.
• An {#link|enum#} field uses exactly the bit width of its integer tag type.
• A {#link|packed union#} field uses exactly the bit width of the union field with the largest bit width.
• Packed structs support equality operators.

This means that a {#syntax#}packed struct{#endsyntax#} can participate in a {#link|@bitCast#} or a {#link|@ptrCast#} to reinterpret memory. This even works at {#link|comptime#}:

The backing integer is inferred from the fields' total bit width. Optionally, it can be explicitly provided and enforced at compile time:

Zig allows the address to be taken of a non-byte-aligned field:

However, the pointer to a non-byte-aligned field has special properties and cannot be passed when a normal pointer is expected:

In this case, the function {#syntax#}bar{#endsyntax#} cannot be called because the pointer to the non-ABI-aligned field mentions the bit offset, but the function expects an ABI-aligned pointer.

Pointers to non-ABI-aligned fields share the same address as the other fields within their host integer:

This can be observed with {#link|@bitOffsetOf#} and {#link|offsetOf#}:

Packed structs have the same alignment as their backing integer, however, overaligned pointers to packed structs can override this:

It's also possible to set alignment of struct fields:

Equating packed structs results in a comparison of the backing integer, and only works for the `==` and `!=` operators.

Using packed structs with {#link|volatile#} is problematic, and may be a compile error in the future. For details on this subscribe to this issue. TODO update these docs with a recommendation on how to use packed structs with MMIO (the use case for volatile packed structs) once this issue is resolved. Don't worry, there will be a good solution for this use case in zig.

Since all structs are anonymous, Zig infers the type name based on a few rules.

• If the struct is in the initialization expression of a variable, it gets named after that variable.
• If the struct is in the {#syntax#}return{#endsyntax#} expression, it gets named after the function it is returning from, with the parameter values serialized.
• Otherwise, the struct gets a name such as (filename.funcname.__struct_ID).
• If the struct is declared inside another struct, it gets named after both the parent struct and the name inferred by the previous rules, separated by a dot.

Zig allows omitting the struct type of a literal. When the result is {#link|coerced|Type Coercion#}, the struct literal will directly instantiate the {#link|result location|Result Location Semantics#}, with no copy:

The struct type can be inferred. Here the {#link|result location|Result Location Semantics#} does not include a type, and so Zig infers the type:

Anonymous structs can be created without specifying field names, and are referred to as "tuples".

The fields are implicitly named using numbers starting from 0. Because their names are integers, they cannot be accessed with {#syntax#}.{#endsyntax#} syntax without also wrapping them in {#syntax#}@""{#endsyntax#}. Names inside {#syntax#}@""{#endsyntax#} are always recognised as {#link|identifiers|Identifiers#}.

Like arrays, tuples have a .len field, can be indexed (provided the index is comptime-known) and work with the ++ and ** operators. They can also be iterated over with {#link|inline for#}.

By default, enums are not guaranteed to be compatible with the C ABI:

For a C-ABI-compatible enum, provide an explicit tag type to the enum:

Enum literals allow specifying the name of an enum field without specifying the enum type:

A non-exhaustive enum can be created by adding a trailing {#syntax#}_{#endsyntax#} field. The enum must specify a tag type and cannot consume every enumeration value.

{#link|@enumFromInt#} on a non-exhaustive enum involves the safety semantics of {#link|@intCast#} to the integer tag type, but beyond that always results in a well-defined enum value.

A switch on a non-exhaustive enum can include a {#syntax#}_{#endsyntax#} prong as an alternative to an {#syntax#}else{#endsyntax#} prong. With a {#syntax#}_{#endsyntax#} prong the compiler errors if all the known tag names are not handled by the switch.

A bare {#syntax#}union{#endsyntax#} defines a set of possible types that a value can be as a list of fields. Only one field can be active at a time. The in-memory representation of bare unions is not guaranteed. Bare unions cannot be used to reinterpret memory. For that, use {#link|@ptrCast#}, or use an {#link|extern union#} or a {#link|packed union#} which have guaranteed in-memory layout. {#link|Accessing the non-active field|Wrong Union Field Access#} is safety-checked {#link|Undefined Behavior#}:

You can activate another field by assigning the entire union:

In order to use {#link|switch#} with a union, it must be a {#link|Tagged union#}.

To initialize a union when the tag is a {#link|comptime#}-known name, see {#link|@unionInit#}.

Unions can be declared with an enum tag type. This turns the union into a tagged union, which makes it eligible to use with {#link|switch#} expressions. Tagged unions coerce to their tag type: {#link|Type Coercion: Unions and Enums#}.

In order to modify the payload of a tagged union in a switch expression, place a {#syntax#}*{#endsyntax#} before the variable name to make it a pointer:

Unions can be made to infer the enum tag type. Further, unions can have methods just like structs and enums.

{#link|@tagName#} can be used to return a {#link|comptime#} {#syntax#}[:0]const u8{#endsyntax#} value representing the field name:

An {#syntax#}extern union{#endsyntax#} has memory layout guaranteed to be compatible with the target C ABI.

A {#syntax#}packed union{#endsyntax#} has well-defined in-memory layout and is eligible to be in a {#link|packed struct#}.

{#link|Anonymous Struct Literals#} syntax can be used to initialize unions without specifying the type:

{#syntax#}opaque {}{#endsyntax#} declares a new type with an unknown (but non-zero) size and alignment. It can contain declarations the same as {#link|structs|struct#}, {#link|unions|union#}, and {#link|enums|enum#}.

This is typically used for type safety when interacting with C code that does not expose struct details. Example:

Blocks are used to limit the scope of variable declarations:

Blocks are expressions. When labeled, {#syntax#}break{#endsyntax#} can be used to return a value from the block:

Here, {#syntax#}blk{#endsyntax#} can be any name.

{#link|Identifiers#} are never allowed to "hide" other identifiers by using the same name:

Because of this, when you read Zig code you can always rely on an identifier to consistently mean the same thing within the scope it is defined. Note that you can, however, use the same name if the scopes are separate:

An empty block is equivalent to {#syntax#}void{}{#endsyntax#}:

{#syntax#}switch{#endsyntax#} can be used to capture the field values of a {#link|Tagged union#}. Modifications to the field values can be done by placing a {#syntax#}*{#endsyntax#} before the capture variable name, turning it into a pointer.

When a {#syntax#}switch{#endsyntax#} expression does not have an {#syntax#}else{#endsyntax#} clause, it must exhaustively list all the possible values. Failure to do so is a compile error:

{#link|Enum Literals#} can be useful to use with {#syntax#}switch{#endsyntax#} to avoid repetitively specifying {#link|enum#} or {#link|union#} types:

When a switch statement is labeled, it can be referenced from a {#syntax#}break{#endsyntax#} or {#syntax#}continue{#endsyntax#}. {#syntax#}break{#endsyntax#} will return a value from the {#syntax#} switch{#endsyntax#}.

A {#syntax#}continue{#endsyntax#} targeting a switch must have an operand. When executed, it will jump to the matching prong, as if the {#syntax#}switch{#endsyntax#} were executed again with the {#syntax#} continue{#endsyntax#}'s operand replacing the initial switch value.

Semantically, this is equivalent to the following loop:

This can improve clarity of (for example) state machines, where the syntax {#syntax#}continue :sw .next_state{#endsyntax#} is unambiguous, explicit, and immediately understandable.

However, the motivating example is a switch on each element of an array, where using a single switch can improve clarity and performance:

If the operand to {#syntax#}continue{#endsyntax#} is {#link|comptime#}-known, then it can be lowered to an unconditional branch to the relevant case. Such a branch is perfectly predicted, and hence typically very fast to execute.

If the operand is runtime-known, each {#syntax#}continue{#endsyntax#} can embed a conditional branch inline (ideally through a jump table), which allows a CPU to predict its target independently of any other prong. A loop-based lowering would force every branch through the same dispatch point, hindering branch prediction.

Switch prongs can be marked as {#syntax#}inline{#endsyntax#} to generate the prong's body for each possible value it could have, making the captured value {#link|comptime#}.

The {#syntax#}inline{#endsyntax#} keyword may also be combined with ranges:

{#syntax#}inline else{#endsyntax#} prongs can be used as a type safe alternative to {#syntax#}inline for{#endsyntax#} loops:

When using an inline prong switching on an union an additional capture can be used to obtain the union's enum tag value.

A while loop is used to repeatedly execute an expression until some condition is no longer true.

Use {#syntax#}break{#endsyntax#} to exit a while loop early.

Use {#syntax#}continue{#endsyntax#} to jump back to the beginning of the loop.

While loops support a continue expression which is executed when the loop is continued. The {#syntax#}continue{#endsyntax#} keyword respects this expression.

While loops are expressions. The result of the expression is the result of the {#syntax#}else{#endsyntax#} clause of a while loop, which is executed when the condition of the while loop is tested as false.

{#syntax#}break{#endsyntax#}, like {#syntax#}return{#endsyntax#}, accepts a value parameter. This is the result of the {#syntax#}while{#endsyntax#} expression. When you {#syntax#}break{#endsyntax#} from a while loop, the {#syntax#}else{#endsyntax#} branch is not evaluated.

When a {#syntax#}while{#endsyntax#} loop is labeled, it can be referenced from a {#syntax#}break{#endsyntax#} or {#syntax#}continue{#endsyntax#} from within a nested loop:

Just like {#link|if#} expressions, while loops can take an optional as the condition and capture the payload. When {#link|null#} is encountered the loop exits.

When the {#syntax#}|x|{#endsyntax#} syntax is present on a {#syntax#}while{#endsyntax#} expression, the while condition must have an {#link|Optional Type#}.

The {#syntax#}else{#endsyntax#} branch is allowed on optional iteration. In this case, it will be executed on the first null value encountered.

Just like {#link|if#} expressions, while loops can take an error union as the condition and capture the payload or the error code. When the condition results in an error code the else branch is evaluated and the loop is finished.

When the {#syntax#}else |x|{#endsyntax#} syntax is present on a {#syntax#}while{#endsyntax#} expression, the while condition must have an {#link|Error Union Type#}.

While loops can be inlined. This causes the loop to be unrolled, which allows the code to do some things which only work at compile time, such as use types as first class values.

It is recommended to use {#syntax#}inline{#endsyntax#} loops only for one of these reasons:

• You need the loop to execute at {#link|comptime#} for the semantics to work.
• You have a benchmark to prove that forcibly unrolling the loop in this way is measurably faster.

When a {#syntax#}for{#endsyntax#} loop is labeled, it can be referenced from a {#syntax#}break{#endsyntax#} or {#syntax#}continue{#endsyntax#} from within a nested loop:

For loops can be inlined. This causes the loop to be unrolled, which allows the code to do some things which only work at compile time, such as use types as first class values. The capture value and iterator value of inlined for loops are compile-time known.

It is recommended to use {#syntax#}inline{#endsyntax#} loops only for one of these reasons:

• You need the loop to execute at {#link|comptime#} for the semantics to work.
• You have a benchmark to prove that forcibly unrolling the loop in this way is measurably faster.

Executes an expression unconditionally at scope exit.

Defer expressions are evaluated in reverse order.

Inside a defer expression the return statement is not allowed.

In {#link|Debug#} and {#link|ReleaseSafe#} mode {#syntax#}unreachable{#endsyntax#} emits a call to {#syntax#}panic{#endsyntax#} with the message reached unreachable code.

In {#link|ReleaseFast#} and {#link|ReleaseSmall#} mode, the optimizer uses the assumption that {#syntax#}unreachable{#endsyntax#} code will never be hit to perform optimizations.

In fact, this is how {#syntax#}std.debug.assert{#endsyntax#} is implemented:

{#syntax#}noreturn{#endsyntax#} is the type of:

• {#syntax#}break{#endsyntax#}
• {#syntax#}continue{#endsyntax#}
• {#syntax#}return{#endsyntax#}
• {#syntax#}unreachable{#endsyntax#}
• {#syntax#}while (true) {}{#endsyntax#}

When resolving types together, such as {#syntax#}if{#endsyntax#} clauses or {#syntax#}switch{#endsyntax#} prongs, the {#syntax#}noreturn{#endsyntax#} type is compatible with every other type. Consider:

Another use case for {#syntax#}noreturn{#endsyntax#} is the {#syntax#}exit{#endsyntax#} function:

There is a difference between a function body and a function pointer. Function bodies are {#link|comptime#}-only types while function {#link|Pointers#} may be runtime-known.

Primitive types such as {#link|Integers#} and {#link|Floats#} passed as parameters are copied, and then the copy is available in the function body. This is called "passing by value". Copying a primitive type is essentially free and typically involves nothing more than setting a register.

Structs, unions, and arrays can sometimes be more efficiently passed as a reference, since a copy could be arbitrarily expensive depending on the size. When these types are passed as parameters, Zig may choose to copy and pass by value, or pass by reference, whichever way Zig decides will be faster. This is made possible, in part, by the fact that parameters are immutable.

For extern functions, Zig follows the C ABI for passing structs and unions by value.

Function parameters can be declared with {#syntax#}anytype{#endsyntax#} in place of the type. In this case the parameter types will be inferred when the function is called. Use {#link|@TypeOf#} and {#link|@typeInfo#} to get information about the inferred type.

Adding the {#syntax#}inline{#endsyntax#} keyword to a function definition makes that function become semantically inlined at the callsite. This is not a hint to be possibly observed by optimization passes, but has implications on the types and values involved in the function call.

Unlike normal function calls, arguments at an inline function callsite which are compile-time known are treated as {#link|Compile Time Parameters#}. This can potentially propagate all the way to the return value:

If {#syntax#}inline{#endsyntax#} is removed, the test fails with the compile error instead of passing.

It is generally better to let the compiler decide when to inline a function, except for these scenarios:

• To change how many stack frames are in the call stack, for debugging purposes.
• To force comptime-ness of the arguments to propagate to the return value of the function, as in the above example.
• Real world performance measurements demand it.

Note that {#syntax#}inline{#endsyntax#} actually restricts what the compiler is allowed to do. This can harm binary size, compilation speed, and even runtime performance.

An error set is like an {#link|enum#}. However, each error name across the entire compilation gets assigned an unsigned integer greater than 0. You are allowed to declare the same error name more than once, and if you do, it gets assigned the same integer value.

The error set type defaults to a {#syntax#}u16{#endsyntax#}, though if the maximum number of distinct error values is provided via the --error-limit [num] command line parameter an integer type with the minimum number of bits required to represent all of the error values will be used.

You can {#link|coerce|Type Coercion#} an error from a subset to a superset:

But you cannot {#link|coerce|Type Coercion#} an error from a superset to a subset:

There is a shortcut for declaring an error set with only 1 value, and then getting that value:

This is equivalent to:

This becomes useful when using {#link|Inferred Error Sets#}.

{#syntax#}anyerror{#endsyntax#} refers to the global error set. This is the error set that contains all errors in the entire compilation unit. It is a superset of all other error sets and a subset of none of them.

You can {#link|coerce|Type Coercion#} any error set to the global one, and you can explicitly cast an error of the global error set to a non-global one. This inserts a language-level assert to make sure the error value is in fact in the destination error set.

The global error set should generally be avoided because it prevents the compiler from knowing what errors are possible at compile-time. Knowing the error set at compile-time is better for generated documentation and helpful error messages, such as forgetting a possible error value in a {#link|switch#}.

An error set type and normal type can be combined with the {#syntax#}!{#endsyntax#} binary operator to form an error union type. You are likely to use an error union type more often than an error set type by itself.

Here is a function to parse a string into a 64-bit integer:

Notice the return type is {#syntax#}!u64{#endsyntax#}. This means that the function either returns an unsigned 64 bit integer, or an error. We left off the error set to the left of the {#syntax#}!{#endsyntax#}, so the error set is inferred.

Within the function definition, you can see some return statements that return an error, and at the bottom a return statement that returns a {#syntax#}u64{#endsyntax#}. Both types {#link|coerce|Type Coercion#} to {#syntax#}anyerror!u64{#endsyntax#}.

What it looks like to use this function varies depending on what you're trying to do. One of the following:

• You want to provide a default value if it returned an error.
• If it returned an error then you want to return the same error.
• You know with complete certainty it will not return an error, so want to unconditionally unwrap it.
• You want to take a different action for each possible error.

If you want to provide a default value, you can use the {#syntax#}catch{#endsyntax#} binary operator:

In this code, {#syntax#}number{#endsyntax#} will be equal to the successfully parsed string, or a default value of 13. The type of the right hand side of the binary {#syntax#}catch{#endsyntax#} operator must match the unwrapped error union type, or be of type {#syntax#}noreturn{#endsyntax#}.

If you want to provide a default value with {#syntax#}catch{#endsyntax#} after performing some logic, you can combine {#syntax#}catch{#endsyntax#} with named {#link|Blocks#}:

Let's say you wanted to return the error if you got one, otherwise continue with the function logic:

There is a shortcut for this. The {#syntax#}try{#endsyntax#} expression:

{#syntax#}try{#endsyntax#} evaluates an error union expression. If it is an error, it returns from the current function with the same error. Otherwise, the expression results in the unwrapped value.

Maybe you know with complete certainty that an expression will never be an error. In this case you can do this:

Here we know for sure that "1234" will parse successfully. So we put the {#syntax#}unreachable{#endsyntax#} value on the right hand side. {#syntax#}unreachable{#endsyntax#} generates a panic in {#link|Debug#} and {#link|ReleaseSafe#} modes and undefined behavior in {#link|ReleaseFast#} and {#link|ReleaseSmall#} modes. So, while we're debugging the application, if there was a surprise error here, the application would crash appropriately.

You may want to take a different action for every situation. For that, we combine the {#link|if#} and {#link|switch#} expression:

Finally, you may want to handle only some errors. For that, you can capture the unhandled errors in the {#syntax#}else{#endsyntax#} case, which now contains a narrower error set:

You must use the variable capture syntax. If you don't need the variable, you can capture with {#syntax#}_{#endsyntax#} and avoid the {#syntax#}switch{#endsyntax#}.

The other component to error handling is defer statements. In addition to an unconditional {#link|defer#}, Zig has {#syntax#}errdefer{#endsyntax#}, which evaluates the deferred expression on block exit path if and only if the function returned with an error from the block.

Example:

The neat thing about this is that you get robust error handling without the verbosity and cognitive overhead of trying to make sure every exit path is covered. The deallocation code is always directly following the allocation code.

The {#syntax#}errdefer{#endsyntax#} statement can optionally capture the error:

It should be noted that {#syntax#}errdefer{#endsyntax#} statements only last until the end of the block they are written in, and therefore are not run if an error is returned outside of that block:

To ensure that {#syntax#}deallocateFoo{#endsyntax#} is properly called when returning an error, you must add an {#syntax#}errdefer{#endsyntax#} outside of the block:

The fact that errdefers only last for the block they are declared in is especially important when using loops:

Special care must be taken with code that allocates in a loop to make sure that no memory is leaked when returning an error:

A couple of other tidbits about error handling:

• These primitives give enough expressiveness that it's completely practical to have failing to check for an error be a compile error. If you really want to ignore the error, you can add {#syntax#}catch unreachable{#endsyntax#} and get the added benefit of crashing in Debug and ReleaseSafe modes if your assumption was wrong.
• Since Zig understands error types, it can pre-weight branches in favor of errors not occurring. Just a small optimization benefit that is not available in other languages.

An error union is created with the {#syntax#}!{#endsyntax#} binary operator. You can use compile-time reflection to access the child type of an error union:

Use the {#syntax#}||{#endsyntax#} operator to merge two error sets together. The resulting error set contains the errors of both error sets. Doc comments from the left-hand side override doc comments from the right-hand side. In this example, the doc comments for {#syntax#}C.PathNotFound{#endsyntax#} is A doc comment.

This is especially useful for functions which return different error sets depending on {#link|comptime#} branches. For example, the Zig standard library uses {#syntax#}LinuxFileOpenError || WindowsFileOpenError{#endsyntax#} for the error set of opening files.

Because many functions in Zig return a possible error, Zig supports inferring the error set. To infer the error set for a function, prepend the {#syntax#}!{#endsyntax#} operator to the function’s return type, like {#syntax#}!T{#endsyntax#}:

When a function has an inferred error set, that function becomes generic and thus it becomes trickier to do certain things with it, such as obtain a function pointer, or have an error set that is consistent across different build targets. Additionally, inferred error sets are incompatible with recursion.

In these situations, it is recommended to use an explicit error set. You can generally start with an empty error set and let compile errors guide you toward completing the set.

These limitations may be overcome in a future version of Zig.

Error Return Traces show all the points in the code that an error was returned to the calling function. This makes it practical to use {#link|try#} everywhere and then still be able to know what happened if an error ends up bubbling all the way out of your application.

Look closely at this example. This is no stack trace.

You can see that the final error bubbled up was {#syntax#}PermissionDenied{#endsyntax#}, but the original error that started this whole thing was {#syntax#}FileNotFound{#endsyntax#}. In the {#syntax#}bar{#endsyntax#} function, the code handles the original error code, and then returns another one, from the switch statement. Error Return Traces make this clear, whereas a stack trace would look like this:

Here, the stack trace does not explain how the control flow in {#syntax#}bar{#endsyntax#} got to the {#syntax#}hello(){#endsyntax#} call. One would have to open a debugger or further instrument the application in order to find out. The error return trace, on the other hand, shows exactly how the error bubbled up.

This debugging feature makes it easier to iterate quickly on code that robustly handles all error conditions. This means that Zig developers will naturally find themselves writing correct, robust code in order to increase their development pace.

Error Return Traces are enabled by default in {#link|Debug#} and {#link|ReleaseSafe#} builds and disabled by default in {#link|ReleaseFast#} and {#link|ReleaseSmall#} builds.

There are a few ways to activate this error return tracing feature:

• Return an error from main
• An error makes its way to {#syntax#}catch unreachable{#endsyntax#} and you have not overridden the default panic handler
• Use {#link|errorReturnTrace#} to access the current return trace. You can use {#syntax#}std.debug.dumpStackTrace{#endsyntax#} to print it. This function returns comptime-known {#link|null#} when building without error return tracing support.

To analyze performance cost, there are two cases:

• when no errors are returned
• when returning errors

For the case when no errors are returned, the cost is a single memory write operation, only in the first non-failable function in the call graph that calls a failable function, i.e. when a function returning {#syntax#}void{#endsyntax#} calls a function returning {#syntax#}error{#endsyntax#}. This is to initialize this struct in the stack memory:

Here, N is the maximum function call depth as determined by call graph analysis. Recursion is ignored and counts for 2.

A pointer to {#syntax#}StackTrace{#endsyntax#} is passed as a secret parameter to every function that can return an error, but it's always the first parameter, so it can likely sit in a register and stay there.

That's it for the path when no errors occur. It's practically free in terms of performance.

When generating the code for a function that returns an error, just before the {#syntax#}return{#endsyntax#} statement (only for the {#syntax#}return{#endsyntax#} statements that return errors), Zig generates a call to this function:

The cost is 2 math operations plus some memory reads and writes. The memory accessed is constrained and should remain cached for the duration of the error return bubbling.

As for code size cost, 1 function call before a return statement is no big deal. Even so, I have a plan to make the call to {#syntax#}__zig_return_error{#endsyntax#} a tail call, which brings the code size cost down to actually zero. What is a return statement in code without error return tracing can become a jump instruction in code with error return tracing.

One area that Zig provides safety without compromising efficiency or readability is with the optional type.

The question mark symbolizes the optional type. You can convert a type to an optional type by putting a question mark in front of it, like this:

Now the variable {#syntax#}optional_int{#endsyntax#} could be an {#syntax#}i32{#endsyntax#}, or {#syntax#}null{#endsyntax#}.

Instead of integers, let's talk about pointers. Null references are the source of many runtime exceptions, and even stand accused of being the worst mistake of computer science.

Zig does not have them.

Instead, you can use an optional pointer. This secretly compiles down to a normal pointer, since we know we can use 0 as the null value for the optional type. But the compiler can check your work and make sure you don't assign null to something that can't be null.

Typically the downside of not having null is that it makes the code more verbose to write. But, let's compare some equivalent C code and Zig code.

Task: call malloc, if the result is null, return null.

C code

Zig code

Here, Zig is at least as convenient, if not more, than C. And, the type of "ptr" is {#syntax#}[*]u8{#endsyntax#} not {#syntax#}?[*]u8{#endsyntax#}. The {#syntax#}orelse{#endsyntax#} keyword unwrapped the optional type and therefore {#syntax#}ptr{#endsyntax#} is guaranteed to be non-null everywhere it is used in the function.

The other form of checking against NULL you might see looks like this:

In Zig you can accomplish the same thing:

Once again, the notable thing here is that inside the if block, {#syntax#}foo{#endsyntax#} is no longer an optional pointer, it is a pointer, which cannot be null.

One benefit to this is that functions which take pointers as arguments can be annotated with the "nonnull" attribute - __attribute__((nonnull)) in GCC. The optimizer can sometimes make better decisions knowing that pointer arguments cannot be null.

An optional is created by putting {#syntax#}?{#endsyntax#} in front of a type. You can use compile-time reflection to access the child type of an optional:

Just like {#link|undefined#}, {#syntax#}null{#endsyntax#} has its own type, and the only way to use it is to cast it to a different type:

An optional pointer is guaranteed to be the same size as a pointer. The {#syntax#}null{#endsyntax#} of the optional is guaranteed to be address 0.

A type cast converts a value of one type to another. Zig has {#link|Type Coercion#} for conversions that are known to be completely safe and unambiguous, and {#link|Explicit Casts#} for conversions that one would not want to happen on accident. There is also a third kind of type conversion called {#link|Peer Type Resolution#} for the case when a result type must be decided given multiple operand types.

Type coercion occurs when one type is expected, but different type is provided:

Type coercions are only allowed when it is completely unambiguous how to get from one type to another, and the transformation is guaranteed to be safe. There is one exception, which is {#link|C Pointers#}.

Values which have the same representation at runtime can be cast to increase the strictness of the qualifiers, no matter how nested the qualifiers are:

• {#syntax#}const{#endsyntax#} - non-const to const is allowed
• {#syntax#}volatile{#endsyntax#} - non-volatile to volatile is allowed
• {#syntax#}align{#endsyntax#} - bigger to smaller alignment is allowed
• {#link|error sets|Error Set Type#} to supersets is allowed

These casts are no-ops at runtime since the value representation does not change.

In addition, pointers coerce to const optional pointers:

{#link|Integers#} coerce to integer types which can represent every value of the old type, and likewise {#link|Floats#} coerce to float types which can represent every value of the old type.

A compiler error is appropriate because this ambiguous expression leaves the compiler two choices about the coercion.

• Cast {#syntax#}54.0{#endsyntax#} to {#syntax#}comptime_int{#endsyntax#} resulting in {#syntax#}@as(comptime_int, 10){#endsyntax#}, which is casted to {#syntax#}@as(f32, 10){#endsyntax#}
• Cast {#syntax#}5{#endsyntax#} to {#syntax#}comptime_float{#endsyntax#} resulting in {#syntax#}@as(comptime_float, 10.8){#endsyntax#}, which is casted to {#syntax#}@as(f32, 10.8){#endsyntax#}

The payload type of {#link|Optionals#}, as well as {#link|null#}, coerce to the optional type.

Optionals work nested inside the {#link|Error Union Type#}, too:

The payload type of an {#link|Error Union Type#} as well as the {#link|Error Set Type#} coerce to the error union type:

When a number is {#link|comptime#}-known to be representable in the destination type, it may be coerced:

Tagged unions can be coerced to enums, and enums can be coerced to tagged unions when they are {#link|comptime#}-known to be a field of the union that has only one possible value, such as {#link|void#}:

{#link|undefined#} can be coerced to any type.

{#link|Tuples#} can be coerced to arrays, if all of the fields have the same type.

Explicit casts are performed via {#link|Builtin Functions#}. Some explicit casts are safe; some are not. Some explicit casts perform language-level assertions; some do not. Some explicit casts are no-ops at runtime; some are not.

• {#link|@bitCast#} - change type but maintain bit representation
• {#link|@alignCast#} - make a pointer have more alignment
• {#link|@enumFromInt#} - obtain an enum value based on its integer tag value
• {#link|@errorFromInt#} - obtain an error code based on its integer value
• {#link|@errorCast#} - convert to a smaller error set
• {#link|@floatCast#} - convert a larger float to a smaller float
• {#link|@floatFromInt#} - convert an integer to a float value
• {#link|@intCast#} - convert between integer types
• {#link|@intFromBool#} - convert true to 1 and false to 0
• {#link|@intFromEnum#} - obtain the integer tag value of an enum or tagged union
• {#link|@intFromError#} - obtain the integer value of an error code
• {#link|@intFromFloat#} - obtain the integer part of a float value
• {#link|@intFromPtr#} - obtain the address of a pointer
• {#link|@ptrFromInt#} - convert an address to a pointer
• {#link|@ptrCast#} - convert between pointer types
• {#link|@truncate#} - convert between integer types, chopping off bits

Peer Type Resolution occurs in these places:

• {#link|switch#} expressions
• {#link|if#} expressions
• {#link|while#} expressions
• {#link|for#} expressions
• Multiple break statements in a block
• Some {#link|binary operations|Table of Operators#}

This kind of type resolution chooses a type that all peer types can coerce into. Here are some examples:

For some types, {#link|@sizeOf#} is 0:

• {#link|void#}
• The {#link|Integers#} {#syntax#}u0{#endsyntax#} and {#syntax#}i0{#endsyntax#}.
• {#link|Arrays#} and {#link|Vectors#} with len 0, or with an element type that is a zero bit type.
• An {#link|enum#} with only 1 tag.
• A {#link|struct#} with all fields being zero bit types.
• A {#link|union#} with only 1 field which is a zero bit type.

These types can only ever have one possible value, and thus require 0 bits to represent. Code that makes use of these types is not included in the final generated code:

When this turns into machine code, there is no code generated in the body of {#syntax#}entry{#endsyntax#}, even in {#link|Debug#} mode. For example, on x86_64:

0000000000000010 <entry>:
  10:	55                   	push   %rbp
  11:	48 89 e5             	mov    %rsp,%rbp
  14:	5d                   	pop    %rbp
  15:	c3                   	retq   

These assembly instructions do not have any code associated with the void values - they only perform the function call prologue and epilogue.

{#syntax#}void{#endsyntax#} can be useful for instantiating generic types. For example, given a {#syntax#}Map(Key, Value){#endsyntax#}, one can pass {#syntax#}void{#endsyntax#} for the {#syntax#}Value{#endsyntax#} type to make it into a {#syntax#}Set{#endsyntax#}:

Note that this is different from using a dummy value for the hash map value. By using {#syntax#}void{#endsyntax#} as the type of the value, the hash map entry type has no value field, and thus the hash map takes up less space. Further, all the code that deals with storing and loading the value is deleted, as seen above.

{#syntax#}void{#endsyntax#} is distinct from {#syntax#}anyopaque{#endsyntax#}. {#syntax#}void{#endsyntax#} has a known size of 0 bytes, and {#syntax#}anyopaque{#endsyntax#} has an unknown, but non-zero, size.

Expressions of type {#syntax#}void{#endsyntax#} are the only ones whose value can be ignored. For example, ignoring a non-{#syntax#}void{#endsyntax#} expression is a compile error:

However, if the expression has type {#syntax#}void{#endsyntax#}, there will be no error. Expression results can be explicitly ignored by assigning them to {#syntax#}_{#endsyntax#}.

During compilation, every Zig expression and sub-expression is assigned optional result location information. This information dictates what type the expression should have (its result type), and where the resulting value should be placed in memory (its result location). The information is optional in the sense that not every expression has this information: assignment to {#syntax#}_{#endsyntax#}, for instance, does not provide any information about the type of an expression, nor does it provide a concrete memory location to place it in.

As a motivating example, consider the statement {#syntax#}const x: u32 = 42;{#endsyntax#}. The type annotation here provides a result type of {#syntax#}u32{#endsyntax#} to the initialization expression {#syntax#}42{#endsyntax#}, instructing the compiler to coerce this integer (initially of type {#syntax#}comptime_int{#endsyntax#}) to this type. We will see more examples shortly.

This is not an implementation detail: the logic outlined above is codified into the Zig language specification, and is the primary mechanism of type inference in the language. This system is collectively referred to as "Result Location Semantics".

Result types are propagated recursively through expressions where possible. For instance, if the expression {#syntax#}&e{#endsyntax#} has result type {#syntax#}*u32{#endsyntax#}, then {#syntax#}e{#endsyntax#} is given a result type of {#syntax#}u32{#endsyntax#}, allowing the language to perform this coercion before taking a reference.

The result type mechanism is utilized by casting builtins such as {#syntax#}@intCast{#endsyntax#}. Rather than taking as an argument the type to cast to, these builtins use their result type to determine this information. The result type is often known from context; where it is not, the {#syntax#}@as{#endsyntax#} builtin can be used to explicitly provide a result type.

We can break down the result types for each component of a simple expression as follows:

This result type information is useful for the aforementioned cast builtins, as well as to avoid the construction of pre-coercion values, and to avoid the need for explicit type coercions in some cases. The following table details how some common expressions propagate result types, where {#syntax#}x{#endsyntax#} and {#syntax#}y{#endsyntax#} are arbitrary sub-expressions.

In addition to result type information, every expression may be optionally assigned a result location: a pointer to which the value must be directly written. This system can be used to prevent intermediate copies when initializing data structures, which can be important for types which must have a fixed memory address ("pinned" types).

When compiling the simple assignment expression {#syntax#}x = e{#endsyntax#}, many languages would create the temporary value {#syntax#}e{#endsyntax#} on the stack, and then assign it to {#syntax#}x{#endsyntax#}, potentially performing a type coercion in the process. Zig approaches this differently. The expression {#syntax#}e{#endsyntax#} is given a result type matching the type of {#syntax#}x{#endsyntax#}, and a result location of {#syntax#}&x{#endsyntax#}. For many syntactic forms of {#syntax#}e{#endsyntax#}, this has no practical impact. However, it can have important semantic effects when working with more complex syntax forms.

For instance, if the expression {#syntax#}.{ .a = x, .b = y }{#endsyntax#} has a result location of {#syntax#}ptr{#endsyntax#}, then {#syntax#}x{#endsyntax#} is given a result location of {#syntax#}&ptr.a{#endsyntax#}, and {#syntax#}y{#endsyntax#} a result location of {#syntax#}&ptr.b{#endsyntax#}. Without this system, this expression would construct a temporary struct value entirely on the stack, and only then copy it to the destination address. In essence, Zig desugars the assignment {#syntax#}foo = .{ .a = x, .b = y }{#endsyntax#} to the two statements {#syntax#}foo.a = x; foo.b = y;{#endsyntax#}.

This can sometimes be important when assigning an aggregate value where the initialization expression depends on the previous value of the aggregate. The easiest way to demonstrate this is by attempting to swap fields of a struct or array - the following logic looks sound, but in fact is not:

The following table details how some common expressions propagate result locations, where {#syntax#}x{#endsyntax#} and {#syntax#}y{#endsyntax#} are arbitrary sub-expressions. Note that some expressions cannot provide meaningful result locations to sub-expressions, even if they themselves have a result location.

{#syntax#}usingnamespace{#endsyntax#} is a declaration that mixes all the public declarations of the operand, which must be a {#link|struct#}, {#link|union#}, {#link|enum#}, or {#link|opaque#}, into the namespace:

{#syntax#}usingnamespace{#endsyntax#} has an important use case when organizing the public API of a file or package. For example, one might have c.zig with all of the {#link|C imports|Import from C Header File#}:

The above example demonstrates using {#syntax#}pub{#endsyntax#} to qualify the {#syntax#}usingnamespace{#endsyntax#} additionally makes the imported declarations {#syntax#}pub{#endsyntax#}. This can be used to forward declarations, giving precise control over what declarations a given file exposes.

Zig places importance on the concept of whether an expression is known at compile-time. There are a few different places this concept is used, and these building blocks are used to keep the language small, readable, and powerful.

Compile-time parameters is how Zig implements generics. It is compile-time duck typing.

In Zig, types are first-class citizens. They can be assigned to variables, passed as parameters to functions, and returned from functions. However, they can only be used in expressions which are known at compile-time, which is why the parameter {#syntax#}T{#endsyntax#} in the above snippet must be marked with {#syntax#}comptime{#endsyntax#}.

A {#syntax#}comptime{#endsyntax#} parameter means that:

• At the callsite, the value must be known at compile-time, or it is a compile error.
• In the function definition, the value is known at compile-time.

For example, if we were to introduce another function to the above snippet:

This is an error because the programmer attempted to pass a value only known at run-time to a function which expects a value known at compile-time.

Another way to get an error is if we pass a type that violates the type checker when the function is analyzed. This is what it means to have compile-time duck typing.

For example:

On the flip side, inside the function definition with the {#syntax#}comptime{#endsyntax#} parameter, the value is known at compile-time. This means that we actually could make this work for the bool type if we wanted to:

This works because Zig implicitly inlines {#syntax#}if{#endsyntax#} expressions when the condition is known at compile-time, and the compiler guarantees that it will skip analysis of the branch not taken.

This means that the actual function generated for {#syntax#}max{#endsyntax#} in this situation looks like this:

All the code that dealt with compile-time known values is eliminated and we are left with only the necessary run-time code to accomplish the task.

This works the same way for {#syntax#}switch{#endsyntax#} expressions - they are implicitly inlined when the target expression is compile-time known.

In Zig, the programmer can label variables as {#syntax#}comptime{#endsyntax#}. This guarantees to the compiler that every load and store of the variable is performed at compile-time. Any violation of this results in a compile error.

This combined with the fact that we can {#syntax#}inline{#endsyntax#} loops allows us to write a function which is partially evaluated at compile-time and partially at run-time.

For example:

This example is a bit contrived, because the compile-time evaluation component is unnecessary; this code would work fine if it was all done at run-time. But it does end up generating different code. In this example, the function {#syntax#}performFn{#endsyntax#} is generated three different times, for the different values of {#syntax#}prefix_char{#endsyntax#} provided:

Note that this happens even in a debug build. This is not a way to write more optimized code, but it is a way to make sure that what should happen at compile-time, does happen at compile-time. This catches more errors and allows expressiveness that in other languages requires using macros, generated code, or a preprocessor to accomplish.

In Zig, it matters whether a given expression is known at compile-time or run-time. A programmer can use a {#syntax#}comptime{#endsyntax#} expression to guarantee that the expression will be evaluated at compile-time. If this cannot be accomplished, the compiler will emit an error. For example:

It doesn't make sense that a program could call {#syntax#}exit(){#endsyntax#} (or any other external function) at compile-time, so this is a compile error. However, a {#syntax#}comptime{#endsyntax#} expression does much more than sometimes cause a compile error.

Within a {#syntax#}comptime{#endsyntax#} expression:

• All variables are {#syntax#}comptime{#endsyntax#} variables.
• All {#syntax#}if{#endsyntax#}, {#syntax#}while{#endsyntax#}, {#syntax#}for{#endsyntax#}, and {#syntax#}switch{#endsyntax#} expressions are evaluated at compile-time, or emit a compile error if this is not possible.
• All {#syntax#}return{#endsyntax#} and {#syntax#}try{#endsyntax#} expressions are invalid (unless the function itself is called at compile-time).
• All code with runtime side effects or depending on runtime values emits a compile error.
• All function calls cause the compiler to interpret the function at compile-time, emitting a compile error if the function tries to do something that has global runtime side effects.

This means that a programmer can create a function which is called both at compile-time and run-time, with no modification to the function required.

Let's look at an example:

Imagine if we had forgotten the base case of the recursive function and tried to run the tests:

The compiler produces an error which is a stack trace from trying to evaluate the function at compile-time.

Luckily, we used an unsigned integer, and so when we tried to subtract 1 from 0, it triggered undefined behavior, which is always a compile error if the compiler knows it happened. But what would have happened if we used a signed integer?

The compiler is supposed to notice that evaluating this function at compile-time took more than 1000 branches, and thus emits an error and gives up. If the programmer wants to increase the budget for compile-time computation, they can use a built-in function called {#link|@setEvalBranchQuota#} to change the default number 1000 to something else.

However, there is a design flaw in the compiler causing it to stack overflow instead of having the proper behavior here. I'm terribly sorry about that. I hope to get this resolved before the next release.

What if we fix the base case, but put the wrong value in the {#syntax#}expect{#endsyntax#} line?

At {#link|container|Containers#} level (outside of any function), all expressions are implicitly {#syntax#}comptime{#endsyntax#} expressions. This means that we can use functions to initialize complex static data. For example:

When we compile this program, Zig generates the constants with the answer pre-computed. Here are the lines from the generated LLVM IR:

@0 = internal unnamed_addr constant [25 x i32] [i32 2, i32 3, i32 5, i32 7, i32 11, i32 13, i32 17, i32 19, i32 23, i32 29, i32 31, i32 37, i32 41, i32 43, i32 47, i32 53, i32 59, i32 61, i32 67, i32 71, i32 73, i32 79, i32 83, i32 89, i32 97]
@1 = internal unnamed_addr constant i32 1060

Note that we did not have to do anything special with the syntax of these functions. For example, we could call the {#syntax#}sum{#endsyntax#} function as is with a slice of numbers whose length and values were only known at run-time.

Zig uses comptime capabilities to implement generic data structures without introducing any special-case syntax.

Here is an example of a generic {#syntax#}List{#endsyntax#} data structure.

That's it. It's a function that returns an anonymous {#syntax#}struct{#endsyntax#}. For the purposes of error messages and debugging, Zig infers the name {#syntax#}"List(i32)"{#endsyntax#} from the function name and parameters invoked when creating the anonymous struct.

To explicitly give a type a name, we assign it to a constant.

In this example, the {#syntax#}Node{#endsyntax#} struct refers to itself. This works because all top level declarations are order-independent. As long as the compiler can determine the size of the struct, it is free to refer to itself. In this case, {#syntax#}Node{#endsyntax#} refers to itself as a pointer, which has a well-defined size at compile time, so it works fine.

Putting all of this together, let's see how {#syntax#}print{#endsyntax#} works in Zig.

Let's crack open the implementation of this and see how it works:

This is a proof of concept implementation; the actual function in the standard library has more formatting capabilities.

Note that this is not hard-coded into the Zig compiler; this is userland code in the standard library.

When this function is analyzed from our example code above, Zig partially evaluates the function and emits a function that actually looks like this:

{#syntax#}printValue{#endsyntax#} is a function that takes a parameter of any type, and does different things depending on the type:

And now, what happens if we give too many arguments to {#syntax#}print{#endsyntax#}?

Zig gives programmers the tools needed to protect themselves against their own mistakes.

Zig doesn't care whether the format argument is a string literal, only that it is a compile-time known value that can be coerced to a {#syntax#}[]const u8{#endsyntax#}:

This works fine.

Zig does not special case string formatting in the compiler and instead exposes enough power to accomplish this task in userland. It does so without introducing another language on top of Zig, such as a macro language or a preprocessor language. It's Zig all the way down.

For some use cases, it may be necessary to directly control the machine code generated by Zig programs, rather than relying on Zig's code generation. For these cases, one can use inline assembly. Here is an example of implementing Hello, World on x86_64 Linux using inline assembly:

Dissecting the syntax:

For x86 and x86_64 targets, the syntax is AT&T syntax, rather than the more popular Intel syntax. This is due to technical constraints; assembly parsing is provided by LLVM and its support for Intel syntax is buggy and not well tested.

Some day Zig may have its own assembler. This would allow it to integrate more seamlessly into the language, as well as be compatible with the popular NASM syntax. This documentation section will be updated before 1.0.0 is released, with a conclusive statement about the status of AT&T vs Intel/NASM syntax.

Output constraints are still considered to be unstable in Zig, and so LLVM documentation and GCC documentation must be used to understand the semantics.

Note that some breaking changes to output constraints are planned with issue #215.

Input constraints are still considered to be unstable in Zig, and so LLVM documentation and GCC documentation must be used to understand the semantics.

Note that some breaking changes to input constraints are planned with issue #215.

Clobbers are the set of registers whose values will not be preserved by the execution of the assembly code. These do not include output or input registers. The special clobber value of {#syntax#}"memory"{#endsyntax#} means that the assembly causes writes to arbitrary undeclared memory locations - not only the memory pointed to by a declared indirect output.

Failure to declare the full set of clobbers for a given inline assembly expression is unchecked {#link|Undefined Behavior#}.

When an assembly expression occurs in a {#link|container|Containers#} level {#link|comptime#} block, this is global assembly.

This kind of assembly has different rules than inline assembly. First, {#syntax#}volatile{#endsyntax#} is not valid because all global assembly is unconditionally included. Second, there are no inputs, outputs, or clobbers. All global assembly is concatenated verbatim into one long string and assembled together. There are no template substitution rules regarding % as there are in inline assembly expressions.

TODO: @atomic rmw

TODO: builtin atomic memory ordering enum

Async functions regressed with the release of 0.11.0. Their future in the Zig language is unclear due to multiple unsolved problems:

• LLVM's lack of ability to optimize them.
• Third-party debuggers' lack of ability to debug them.
• The cancellation problem.
• Async function pointers preventing the stack size from being known.

These problems are surmountable, but it will take time. The Zig team is currently focused on other priorities.

Builtin functions are provided by the compiler and are prefixed with @. The {#syntax#}comptime{#endsyntax#} keyword on a parameter means that the parameter must be known at compile time.

{#syntax#}@addrSpaceCast(ptr: anytype) anytype{#endsyntax#}

Converts a pointer from one address space to another. The new address space is inferred based on the result type. Depending on the current target and address spaces, this cast may be a no-op, a complex operation, or illegal. If the cast is legal, then the resulting pointer points to the same memory location as the pointer operand. It is always valid to cast a pointer between the same address spaces.

{#syntax#}@addWithOverflow(a: anytype, b: anytype) struct { @TypeOf(a, b), u1 }{#endsyntax#}

Performs {#syntax#}a + b{#endsyntax#} and returns a tuple with the result and a possible overflow bit.

{#syntax#}@alignCast(ptr: anytype) anytype{#endsyntax#}

{#syntax#}ptr{#endsyntax#} can be {#syntax#}*T{#endsyntax#}, {#syntax#}?*T{#endsyntax#}, or {#syntax#}[]T{#endsyntax#}. Changes the alignment of a pointer. The alignment to use is inferred based on the result type.

A {#link|pointer alignment safety check|Incorrect Pointer Alignment#} is added to the generated code to make sure the pointer is aligned as promised.

{#syntax#}@alignOf(comptime T: type) comptime_int{#endsyntax#}

This function returns the number of bytes that this type should be aligned to for the current target to match the C ABI. When the child type of a pointer has this alignment, the alignment can be omitted from the type.

{#syntax#}const assert = @import("std").debug.assert;
comptime {
    assert(*u32 == *align(@alignOf(u32)) u32);
}{#endsyntax#}

The result is a target-specific compile time constant. It is guaranteed to be less than or equal to {#link|@sizeOf(T)|@sizeOf#}.

{#syntax#}@as(comptime T: type, expression) T{#endsyntax#}

Performs {#link|Type Coercion#}. This cast is allowed when the conversion is unambiguous and safe, and is the preferred way to convert between types, whenever possible.

{#syntax#}@atomicLoad(comptime T: type, ptr: *const T, comptime ordering: AtomicOrder) T{#endsyntax#}

This builtin function atomically dereferences a pointer to a {#syntax#}T{#endsyntax#} and returns the value.

{#syntax#}T{#endsyntax#} must be a pointer, a {#syntax#}bool{#endsyntax#}, a float, an integer or an enum.

{#syntax#}AtomicOrder{#endsyntax#} can be found with {#syntax#}@import("std").builtin.AtomicOrder{#endsyntax#}.

{#syntax#}@atomicRmw(comptime T: type, ptr: *T, comptime op: AtomicRmwOp, operand: T, comptime ordering: AtomicOrder) T{#endsyntax#}

This builtin function dereferences a pointer to a {#syntax#}T{#endsyntax#} and atomically modifies the value and returns the previous value.

{#syntax#}T{#endsyntax#} must be a pointer, a {#syntax#}bool{#endsyntax#}, a float, an integer or an enum.

{#syntax#}AtomicOrder{#endsyntax#} can be found with {#syntax#}@import("std").builtin.AtomicOrder{#endsyntax#}.

{#syntax#}AtomicRmwOp{#endsyntax#} can be found with {#syntax#}@import("std").builtin.AtomicRmwOp{#endsyntax#}.

{#syntax#}@atomicStore(comptime T: type, ptr: *T, value: T, comptime ordering: AtomicOrder) void{#endsyntax#}

This builtin function dereferences a pointer to a {#syntax#}T{#endsyntax#} and atomically stores the given value.

{#syntax#}T{#endsyntax#} must be a pointer, a {#syntax#}bool{#endsyntax#}, a float, an integer or an enum.

{#syntax#}AtomicOrder{#endsyntax#} can be found with {#syntax#}@import("std").builtin.AtomicOrder{#endsyntax#}.

{#syntax#}@bitCast(value: anytype) anytype{#endsyntax#}

Converts a value of one type to another type. The return type is the inferred result type.

Asserts that {#syntax#}@sizeOf(@TypeOf(value)) == @sizeOf(DestType){#endsyntax#}.

Asserts that {#syntax#}@typeInfo(DestType) != .pointer{#endsyntax#}. Use {#syntax#}@ptrCast{#endsyntax#} or {#syntax#}@ptrFromInt{#endsyntax#} if you need this.

Can be used for these things for example:

• Convert {#syntax#}f32{#endsyntax#} to {#syntax#}u32{#endsyntax#} bits
• Convert {#syntax#}i32{#endsyntax#} to {#syntax#}u32{#endsyntax#} preserving twos complement

Works at compile-time if {#syntax#}value{#endsyntax#} is known at compile time. It's a compile error to bitcast a value of undefined layout; this means that, besides the restriction from types which possess dedicated casting builtins (enums, pointers, error sets), bare structs, error unions, slices, optionals, and any other type without a well-defined memory layout, also cannot be used in this operation.

{#syntax#}@bitOffsetOf(comptime T: type, comptime field_name: []const u8) comptime_int{#endsyntax#}

Returns the bit offset of a field relative to its containing struct.

For non {#link|packed structs|packed struct#}, this will always be divisible by {#syntax#}8{#endsyntax#}. For packed structs, non-byte-aligned fields will share a byte offset, but they will have different bit offsets.

{#syntax#}@bitSizeOf(comptime T: type) comptime_int{#endsyntax#}

This function returns the number of bits it takes to store {#syntax#}T{#endsyntax#} in memory if the type were a field in a packed struct/union. The result is a target-specific compile time constant.

This function measures the size at runtime. For types that are disallowed at runtime, such as {#syntax#}comptime_int{#endsyntax#} and {#syntax#}type{#endsyntax#}, the result is {#syntax#}0{#endsyntax#}.

{#syntax#}@branchHint(hint: BranchHint) void{#endsyntax#}

Hints to the optimizer how likely a given branch of control flow is to be reached.

{#syntax#}BranchHint{#endsyntax#} can be found with {#syntax#}@import("std").builtin.BranchHint{#endsyntax#}.

This function is only valid as the first statement in a control flow branch, or the first statement in a function.

{#syntax#}@breakpoint() void{#endsyntax#}

This function inserts a platform-specific debug trap instruction which causes debuggers to break there. Unlike for {#syntax#}@trap(){#endsyntax#}, execution may continue after this point if the program is resumed.

This function is only valid within function scope.

{#syntax#}@mulAdd(comptime T: type, a: T, b: T, c: T) T{#endsyntax#}

Fused multiply-add, similar to {#syntax#}(a * b) + c{#endsyntax#}, except only rounds once, and is thus more accurate.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@byteSwap(operand: anytype) T{#endsyntax#}

{#syntax#}@TypeOf(operand){#endsyntax#} must be an integer type or an integer vector type with bit count evenly divisible by 8.

{#syntax#}operand{#endsyntax#} may be an {#link|integer|Integers#} or {#link|vector|Vectors#}.

Swaps the byte order of the integer. This converts a big endian integer to a little endian integer, and converts a little endian integer to a big endian integer.

Note that for the purposes of memory layout with respect to endianness, the integer type should be related to the number of bytes reported by {#link|@sizeOf#} bytes. This is demonstrated with {#syntax#}u24{#endsyntax#}. {#syntax#}@sizeOf(u24) == 4{#endsyntax#}, which means that a {#syntax#}u24{#endsyntax#} stored in memory takes 4 bytes, and those 4 bytes are what are swapped on a little vs big endian system. On the other hand, if {#syntax#}T{#endsyntax#} is specified to be {#syntax#}u24{#endsyntax#}, then only 3 bytes are reversed.

{#syntax#}@bitReverse(integer: anytype) T{#endsyntax#}

{#syntax#}@TypeOf(anytype){#endsyntax#} accepts any integer type or integer vector type.

Reverses the bitpattern of an integer value, including the sign bit if applicable.

For example 0b10110110 ({#syntax#}u8 = 182{#endsyntax#}, {#syntax#}i8 = -74{#endsyntax#}) becomes 0b01101101 ({#syntax#}u8 = 109{#endsyntax#}, {#syntax#}i8 = 109{#endsyntax#}).

{#syntax#}@offsetOf(comptime T: type, comptime field_name: []const u8) comptime_int{#endsyntax#}

Returns the byte offset of a field relative to its containing struct.

{#syntax#}@call(modifier: std.builtin.CallModifier, function: anytype, args: anytype) anytype{#endsyntax#}

Calls a function, in the same way that invoking an expression with parentheses does:

{#syntax#}@call{#endsyntax#} allows more flexibility than normal function call syntax does. The {#syntax#}CallModifier{#endsyntax#} enum is reproduced here:

{#syntax#}@cDefine(comptime name: []const u8, value) void{#endsyntax#}

This function can only occur inside {#syntax#}@cImport{#endsyntax#}.

This appends #define $name $value to the {#syntax#}@cImport{#endsyntax#} temporary buffer.

To define without a value, like this:

#define _GNU_SOURCE

Use the void value, like this:

{#syntax#}@cDefine("_GNU_SOURCE", {}){#endsyntax#}

{#syntax#}@cImport(expression) type{#endsyntax#}

This function parses C code and imports the functions, types, variables, and compatible macro definitions into a new empty struct type, and then returns that type.

{#syntax#}expression{#endsyntax#} is interpreted at compile time. The builtin functions {#syntax#}@cInclude{#endsyntax#}, {#syntax#}@cDefine{#endsyntax#}, and {#syntax#}@cUndef{#endsyntax#} work within this expression, appending to a temporary buffer which is then parsed as C code.

Usually you should only have one {#syntax#}@cImport{#endsyntax#} in your entire application, because it saves the compiler from invoking clang multiple times, and prevents inline functions from being duplicated.

Reasons for having multiple {#syntax#}@cImport{#endsyntax#} expressions would be:

• To avoid a symbol collision, for example if foo.h and bar.h both #define CONNECTION_COUNT
• To analyze the C code with different preprocessor defines

{#syntax#}@cInclude(comptime path: []const u8) void{#endsyntax#}

This function can only occur inside {#syntax#}@cImport{#endsyntax#}.

This appends #include <$path>\n to the {#syntax#}c_import{#endsyntax#} temporary buffer.

{#syntax#}@clz(operand: anytype) anytype{#endsyntax#}

{#syntax#}@TypeOf(operand){#endsyntax#} must be an integer type or an integer vector type.

{#syntax#}operand{#endsyntax#} may be an {#link|integer|Integers#} or {#link|vector|Vectors#}.

Counts the number of most-significant (leading in a big-endian sense) zeroes in an integer - "count leading zeroes".

If {#syntax#}operand{#endsyntax#} is a {#link|comptime#}-known integer, the return type is {#syntax#}comptime_int{#endsyntax#}. Otherwise, the return type is an unsigned integer or vector of unsigned integers with the minimum number of bits that can represent the bit count of the integer type.

If {#syntax#}operand{#endsyntax#} is zero, {#syntax#}@clz{#endsyntax#} returns the bit width of integer type {#syntax#}T{#endsyntax#}.

{#syntax#}@cmpxchgStrong(comptime T: type, ptr: *T, expected_value: T, new_value: T, success_order: AtomicOrder, fail_order: AtomicOrder) ?T{#endsyntax#}

This function performs a strong atomic compare-and-exchange operation, returning {#syntax#}null{#endsyntax#} if the current value is not the given expected value. It's the equivalent of this code, except atomic:

If you are using cmpxchg in a retry loop, {#link|@cmpxchgWeak#} is the better choice, because it can be implemented more efficiently in machine instructions.

{#syntax#}T{#endsyntax#} must be a pointer, a {#syntax#}bool{#endsyntax#}, a float, an integer or an enum.

{#syntax#}@typeInfo(@TypeOf(ptr)).pointer.alignment{#endsyntax#} must be {#syntax#}>= @sizeOf(T).{#endsyntax#}

{#syntax#}AtomicOrder{#endsyntax#} can be found with {#syntax#}@import("std").builtin.AtomicOrder{#endsyntax#}.

{#syntax#}@cmpxchgWeak(comptime T: type, ptr: *T, expected_value: T, new_value: T, success_order: AtomicOrder, fail_order: AtomicOrder) ?T{#endsyntax#}

This function performs a weak atomic compare-and-exchange operation, returning {#syntax#}null{#endsyntax#} if the current value is not the given expected value. It's the equivalent of this code, except atomic:

If you are using cmpxchg in a retry loop, the sporadic failure will be no problem, and {#syntax#}cmpxchgWeak{#endsyntax#} is the better choice, because it can be implemented more efficiently in machine instructions. However if you need a stronger guarantee, use {#link|@cmpxchgStrong#}.

{#syntax#}T{#endsyntax#} must be a pointer, a {#syntax#}bool{#endsyntax#}, a float, an integer or an enum.

{#syntax#}@typeInfo(@TypeOf(ptr)).pointer.alignment{#endsyntax#} must be {#syntax#}>= @sizeOf(T).{#endsyntax#}

{#syntax#}AtomicOrder{#endsyntax#} can be found with {#syntax#}@import("std").builtin.AtomicOrder{#endsyntax#}.

{#syntax#}@compileError(comptime msg: []const u8) noreturn{#endsyntax#}

This function, when semantically analyzed, causes a compile error with the message {#syntax#}msg{#endsyntax#}.

There are several ways that code avoids being semantically checked, such as using {#syntax#}if{#endsyntax#} or {#syntax#}switch{#endsyntax#} with compile time constants, and {#syntax#}comptime{#endsyntax#} functions.

{#syntax#}@compileLog(...) void{#endsyntax#}

This function prints the arguments passed to it at compile-time.

To prevent accidentally leaving compile log statements in a codebase, a compilation error is added to the build, pointing to the compile log statement. This error prevents code from being generated, but does not otherwise interfere with analysis.

This function can be used to do "printf debugging" on compile-time executing code.

{#syntax#}@constCast(value: anytype) DestType{#endsyntax#}

Remove {#syntax#}const{#endsyntax#} qualifier from a pointer.

{#syntax#}@ctz(operand: anytype) anytype{#endsyntax#}

{#syntax#}@TypeOf(operand){#endsyntax#} must be an integer type or an integer vector type.

{#syntax#}operand{#endsyntax#} may be an {#link|integer|Integers#} or {#link|vector|Vectors#}.

Counts the number of least-significant (trailing in a big-endian sense) zeroes in an integer - "count trailing zeroes".

If {#syntax#}operand{#endsyntax#} is a {#link|comptime#}-known integer, the return type is {#syntax#}comptime_int{#endsyntax#}. Otherwise, the return type is an unsigned integer or vector of unsigned integers with the minimum number of bits that can represent the bit count of the integer type.

If {#syntax#}operand{#endsyntax#} is zero, {#syntax#}@ctz{#endsyntax#} returns the bit width of integer type {#syntax#}T{#endsyntax#}.

{#syntax#}@cUndef(comptime name: []const u8) void{#endsyntax#}

This function can only occur inside {#syntax#}@cImport{#endsyntax#}.

This appends #undef $name to the {#syntax#}@cImport{#endsyntax#} temporary buffer.

{#syntax#}@cVaArg(operand: *std.builtin.VaList, comptime T: type) T{#endsyntax#}

Implements the C macro {#syntax#}va_arg{#endsyntax#}.

{#syntax#}@cVaCopy(src: *std.builtin.VaList) std.builtin.VaList{#endsyntax#}

Implements the C macro {#syntax#}va_copy{#endsyntax#}.

{#syntax#}@cVaEnd(src: *std.builtin.VaList) void{#endsyntax#}

Implements the C macro {#syntax#}va_end{#endsyntax#}.

{#syntax#}@cVaStart() std.builtin.VaList{#endsyntax#}

Implements the C macro {#syntax#}va_start{#endsyntax#}. Only valid inside a variadic function.

{#syntax#}@divExact(numerator: T, denominator: T) T{#endsyntax#}

Exact division. Caller guarantees {#syntax#}denominator != 0{#endsyntax#} and {#syntax#}@divTrunc(numerator, denominator) * denominator == numerator{#endsyntax#}.

• {#syntax#}@divExact(6, 3) == 2{#endsyntax#}
• {#syntax#}@divExact(a, b) * b == a{#endsyntax#}

For a function that returns a possible error code, use {#syntax#}@import("std").math.divExact{#endsyntax#}.

{#syntax#}@divFloor(numerator: T, denominator: T) T{#endsyntax#}

Floored division. Rounds toward negative infinity. For unsigned integers it is the same as {#syntax#}numerator / denominator{#endsyntax#}. Caller guarantees {#syntax#}denominator != 0{#endsyntax#} and {#syntax#}!(@typeInfo(T) == .int and T.is_signed and numerator == std.math.minInt(T) and denominator == -1){#endsyntax#}.

• {#syntax#}@divFloor(-5, 3) == -2{#endsyntax#}
• {#syntax#}(@divFloor(a, b) * b) + @mod(a, b) == a{#endsyntax#}

For a function that returns a possible error code, use {#syntax#}@import("std").math.divFloor{#endsyntax#}.

{#syntax#}@divTrunc(numerator: T, denominator: T) T{#endsyntax#}

Truncated division. Rounds toward zero. For unsigned integers it is the same as {#syntax#}numerator / denominator{#endsyntax#}. Caller guarantees {#syntax#}denominator != 0{#endsyntax#} and {#syntax#}!(@typeInfo(T) == .int and T.is_signed and numerator == std.math.minInt(T) and denominator == -1){#endsyntax#}.

• {#syntax#}@divTrunc(-5, 3) == -1{#endsyntax#}
• {#syntax#}(@divTrunc(a, b) * b) + @rem(a, b) == a{#endsyntax#}

For a function that returns a possible error code, use {#syntax#}@import("std").math.divTrunc{#endsyntax#}.

{#syntax#}@embedFile(comptime path: []const u8) *const [N:0]u8{#endsyntax#}

This function returns a compile time constant pointer to null-terminated, fixed-size array with length equal to the byte count of the file given by {#syntax#}path{#endsyntax#}. The contents of the array are the contents of the file. This is equivalent to a {#link|string literal|String Literals and Unicode Code Point Literals#} with the file contents.

{#syntax#}path{#endsyntax#} is absolute or relative to the current file, just like {#syntax#}@import{#endsyntax#}.

{#syntax#}@enumFromInt(integer: anytype) anytype{#endsyntax#}

Converts an integer into an {#link|enum#} value. The return type is the inferred result type.

Attempting to convert an integer with no corresponding value in the enum invokes safety-checked {#link|Undefined Behavior#}. Note that a {#link|non-exhaustive enum|Non-exhaustive enum#} has corresponding values for all integers in the enum's integer tag type: the {#syntax#}_{#endsyntax#} value represents all the remaining unnamed integers in the enum's tag type.

{#syntax#}@errorFromInt(value: std.meta.Int(.unsigned, @bitSizeOf(anyerror))) anyerror{#endsyntax#}

Converts from the integer representation of an error into {#link|The Global Error Set#} type.

It is generally recommended to avoid this cast, as the integer representation of an error is not stable across source code changes.

Attempting to convert an integer that does not correspond to any error results in safety-protected {#link|Undefined Behavior#}.

{#syntax#}@errorName(err: anyerror) [:0]const u8{#endsyntax#}

This function returns the string representation of an error. The string representation of {#syntax#}error.OutOfMem{#endsyntax#} is {#syntax#}"OutOfMem"{#endsyntax#}.

If there are no calls to {#syntax#}@errorName{#endsyntax#} in an entire application, or all calls have a compile-time known value for {#syntax#}err{#endsyntax#}, then no error name table will be generated.

{#syntax#}@errorReturnTrace() ?*builtin.StackTrace{#endsyntax#}

If the binary is built with error return tracing, and this function is invoked in a function that calls a function with an error or error union return type, returns a stack trace object. Otherwise returns {#link|null#}.

{#syntax#}@errorCast(value: anytype) anytype{#endsyntax#}

Converts an error set or error union value from one error set to another error set. The return type is the inferred result type. Attempting to convert an error which is not in the destination error set results in safety-protected {#link|Undefined Behavior#}.

{#syntax#}@export(comptime ptr: *const anyopaque, comptime options: std.builtin.ExportOptions) void{#endsyntax#}

Creates a symbol in the output object file which refers to the target of ptr.

ptr must point to a global variable or a comptime-known constant.

This builtin can be called from a {#link|comptime#} block to conditionally export symbols. When ptr points to a function with the C calling convention and {#syntax#}options.linkage{#endsyntax#} is {#syntax#}.Strong{#endsyntax#}, this is equivalent to the {#syntax#}export{#endsyntax#} keyword used on a function:

This is equivalent to:

Note that even when using {#syntax#}export{#endsyntax#}, the {#syntax#}@"foo"{#endsyntax#} syntax for {#link|identifiers|Identifiers#} can be used to choose any string for the symbol name:

When looking at the resulting object, you can see the symbol is used verbatim:

00000000000001f0 T A function name that is a complete sentence.

{#syntax#}@extern(T: type, comptime options: std.builtin.ExternOptions) T{#endsyntax#}

Creates a reference to an external symbol in the output object file. T must be a pointer type.

{#syntax#}@field(lhs: anytype, comptime field_name: []const u8) (field){#endsyntax#}

Performs field access by a compile-time string. Works on both fields and declarations.

{#syntax#}@fieldParentPtr(comptime field_name: []const u8, field_ptr: *T) anytype{#endsyntax#}

Given a pointer to a field, returns the base pointer of a struct.

{#syntax#}@FieldType(comptime Type: type, comptime field_name: []const u8) type{#endsyntax#}

Given a type and the name of one of its fields, returns the type of that field.

{#syntax#}@floatCast(value: anytype) anytype{#endsyntax#}

Convert from one float type to another. This cast is safe, but may cause the numeric value to lose precision. The return type is the inferred result type.

{#syntax#}@floatFromInt(int: anytype) anytype{#endsyntax#}

Converts an integer to the closest floating point representation. The return type is the inferred result type. To convert the other way, use {#link|@intFromFloat#}. This operation is legal for all values of all integer types.

{#syntax#}@frameAddress() usize{#endsyntax#}

This function returns the base pointer of the current stack frame.

The implications of this are target-specific and not consistent across all platforms. The frame address may not be available in release mode due to aggressive optimizations.

This function is only valid within function scope.

{#syntax#}@hasDecl(comptime Container: type, comptime name: []const u8) bool{#endsyntax#}

Returns whether or not a {#link|container|Containers#} has a declaration matching {#syntax#}name{#endsyntax#}.

{#syntax#}@hasField(comptime Container: type, comptime name: []const u8) bool{#endsyntax#}

Returns whether the field name of a struct, union, or enum exists.

The result is a compile time constant.

It does not include functions, variables, or constants.

{#syntax#}@import(comptime path: []const u8) type{#endsyntax#}

This function finds a zig file corresponding to {#syntax#}path{#endsyntax#} and adds it to the build, if it is not already added.

Zig source files are implicitly structs, with a name equal to the file's basename with the extension truncated. {#syntax#}@import{#endsyntax#} returns the struct type corresponding to the file.

Declarations which have the {#syntax#}pub{#endsyntax#} keyword may be referenced from a different source file than the one they are declared in.

{#syntax#}path{#endsyntax#} can be a relative path or it can be the name of a package. If it is a relative path, it is relative to the file that contains the {#syntax#}@import{#endsyntax#} function call.

The following packages are always available:

• {#syntax#}@import("std"){#endsyntax#} - Zig Standard Library
• {#syntax#}@import("builtin"){#endsyntax#} - Target-specific information The command zig build-exe --show-builtin outputs the source to stdout for reference.
• {#syntax#}@import("root"){#endsyntax#} - Root source file This is usually src/main.zig but depends on what file is built.

{#syntax#}@inComptime() bool{#endsyntax#}

Returns whether the builtin was run in a {#syntax#}comptime{#endsyntax#} context. The result is a compile-time constant.

This can be used to provide alternative, comptime-friendly implementations of functions. It should not be used, for instance, to exclude certain functions from being evaluated at comptime.

{#syntax#}@intCast(int: anytype) anytype{#endsyntax#}

Converts an integer to another integer while keeping the same numerical value. The return type is the inferred result type. Attempting to convert a number which is out of range of the destination type results in safety-protected {#link|Undefined Behavior#}.

To truncate the significant bits of a number out of range of the destination type, use {#link|@truncate#}.

If {#syntax#}T{#endsyntax#} is {#syntax#}comptime_int{#endsyntax#}, then this is semantically equivalent to {#link|Type Coercion#}.

{#syntax#}@intFromBool(value: bool) u1{#endsyntax#}

Converts {#syntax#}true{#endsyntax#} to {#syntax#}@as(u1, 1){#endsyntax#} and {#syntax#}false{#endsyntax#} to {#syntax#}@as(u1, 0){#endsyntax#}.

{#syntax#}@intFromEnum(enum_or_tagged_union: anytype) anytype{#endsyntax#}

Converts an enumeration value into its integer tag type. When a tagged union is passed, the tag value is used as the enumeration value.

If there is only one possible enum value, the result is a {#syntax#}comptime_int{#endsyntax#} known at {#link|comptime#}.

{#syntax#}@intFromError(err: anytype) std.meta.Int(.unsigned, @bitSizeOf(anyerror)){#endsyntax#}

Supports the following types:

• {#link|The Global Error Set#}
• {#link|Error Set Type#}
• {#link|Error Union Type#}

Converts an error to the integer representation of an error.

It is generally recommended to avoid this cast, as the integer representation of an error is not stable across source code changes.

{#syntax#}@intFromFloat(float: anytype) anytype{#endsyntax#}

Converts the integer part of a floating point number to the inferred result type.

If the integer part of the floating point number cannot fit in the destination type, it invokes safety-checked {#link|Undefined Behavior#}.

{#syntax#}@intFromPtr(value: anytype) usize{#endsyntax#}

Converts {#syntax#}value{#endsyntax#} to a {#syntax#}usize{#endsyntax#} which is the address of the pointer. {#syntax#}value{#endsyntax#} can be {#syntax#}*T{#endsyntax#} or {#syntax#}?*T{#endsyntax#}.

To convert the other way, use {#link|@ptrFromInt#}

{#syntax#}@max(...) T{#endsyntax#}

Takes two or more arguments and returns the biggest value included (the maximum). This builtin accepts integers, floats, and vectors of either. In the latter case, the operation is performed element wise.

NaNs are handled as follows: return the biggest non-NaN value included. If all operands are NaN, return NaN.

{#syntax#}@memcpy(noalias dest, noalias source) void{#endsyntax#}

This function copies bytes from one region of memory to another.

{#syntax#}dest{#endsyntax#} must be a mutable slice, a mutable pointer to an array, or a mutable many-item {#link|pointer|Pointers#}. It may have any alignment, and it may have any element type.

{#syntax#}source{#endsyntax#} must be a slice, a pointer to an array, or a many-item {#link|pointer|Pointers#}. It may have any alignment, and it may have any element type.

The {#syntax#}source{#endsyntax#} element type must support {#link|Type Coercion#} into the {#syntax#}dest{#endsyntax#} element type. The element types may have different ABI size, however, that may incur a performance penalty.

Similar to {#link|for#} loops, at least one of {#syntax#}source{#endsyntax#} and {#syntax#}dest{#endsyntax#} must provide a length, and if two lengths are provided, they must be equal.

Finally, the two memory regions must not overlap.

{#syntax#}@memset(dest, elem) void{#endsyntax#}

This function sets all the elements of a memory region to {#syntax#}elem{#endsyntax#}.

{#syntax#}dest{#endsyntax#} must be a mutable slice or a mutable pointer to an array. It may have any alignment, and it may have any element type.

{#syntax#}elem{#endsyntax#} is coerced to the element type of {#syntax#}dest{#endsyntax#}.

For securely zeroing out sensitive contents from memory, you should use {#syntax#}std.crypto.secureZero{#endsyntax#}

{#syntax#}@min(...) T{#endsyntax#}

Takes two or more arguments and returns the smallest value included (the minimum). This builtin accepts integers, floats, and vectors of either. In the latter case, the operation is performed element wise.

NaNs are handled as follows: return the smallest non-NaN value included. If all operands are NaN, return NaN.

{#syntax#}@wasmMemorySize(index: u32) usize{#endsyntax#}

This function returns the size of the Wasm memory identified by {#syntax#}index{#endsyntax#} as an unsigned value in units of Wasm pages. Note that each Wasm page is 64KB in size.

This function is a low level intrinsic with no safety mechanisms usually useful for allocator designers targeting Wasm. So unless you are writing a new allocator from scratch, you should use something like {#syntax#}@import("std").heap.WasmPageAllocator{#endsyntax#}.

{#syntax#}@wasmMemoryGrow(index: u32, delta: usize) isize{#endsyntax#}

This function increases the size of the Wasm memory identified by {#syntax#}index{#endsyntax#} by {#syntax#}delta{#endsyntax#} in units of unsigned number of Wasm pages. Note that each Wasm page is 64KB in size. On success, returns previous memory size; on failure, if the allocation fails, returns -1.

This function is a low level intrinsic with no safety mechanisms usually useful for allocator designers targeting Wasm. So unless you are writing a new allocator from scratch, you should use something like {#syntax#}@import("std").heap.WasmPageAllocator{#endsyntax#}.

{#syntax#}@mod(numerator: T, denominator: T) T{#endsyntax#}

Modulus division. For unsigned integers this is the same as {#syntax#}numerator % denominator{#endsyntax#}. Caller guarantees {#syntax#}denominator > 0{#endsyntax#}, otherwise the operation will result in a {#link|Remainder Division by Zero#} when runtime safety checks are enabled.

• {#syntax#}@mod(-5, 3) == 1{#endsyntax#}
• {#syntax#}(@divFloor(a, b) * b) + @mod(a, b) == a{#endsyntax#}

For a function that returns an error code, see {#syntax#}@import("std").math.mod{#endsyntax#}.

{#syntax#}@mulWithOverflow(a: anytype, b: anytype) struct { @TypeOf(a, b), u1 }{#endsyntax#}

Performs {#syntax#}a * b{#endsyntax#} and returns a tuple with the result and a possible overflow bit.

{#syntax#}@panic(message: []const u8) noreturn{#endsyntax#}

Invokes the panic handler function. By default the panic handler function calls the public {#syntax#}panic{#endsyntax#} function exposed in the root source file, or if there is not one specified, the {#syntax#}std.builtin.default_panic{#endsyntax#} function from {#syntax#}std/builtin.zig{#endsyntax#}.

Generally it is better to use {#syntax#}@import("std").debug.panic{#endsyntax#}. However, {#syntax#}@panic{#endsyntax#} can be useful for 2 scenarios:

• From library code, calling the programmer's panic function if they exposed one in the root source file.
• When mixing C and Zig code, calling the canonical panic implementation across multiple .o files.

{#syntax#}@popCount(operand: anytype) anytype{#endsyntax#}

{#syntax#}@TypeOf(operand){#endsyntax#} must be an integer type.

{#syntax#}operand{#endsyntax#} may be an {#link|integer|Integers#} or {#link|vector|Vectors#}.

Counts the number of bits set in an integer - "population count".

If {#syntax#}operand{#endsyntax#} is a {#link|comptime#}-known integer, the return type is {#syntax#}comptime_int{#endsyntax#}. Otherwise, the return type is an unsigned integer or vector of unsigned integers with the minimum number of bits that can represent the bit count of the integer type.

{#syntax#}@prefetch(ptr: anytype, comptime options: PrefetchOptions) void{#endsyntax#}

This builtin tells the compiler to emit a prefetch instruction if supported by the target CPU. If the target CPU does not support the requested prefetch instruction, this builtin is a no-op. This function has no effect on the behavior of the program, only on the performance characteristics.

The {#syntax#}ptr{#endsyntax#} argument may be any pointer type and determines the memory address to prefetch. This function does not dereference the pointer, it is perfectly legal to pass a pointer to invalid memory to this function and no illegal behavior will result.

{#syntax#}PrefetchOptions{#endsyntax#} can be found with {#syntax#}@import("std").builtin.PrefetchOptions{#endsyntax#}.

{#syntax#}@ptrCast(value: anytype) anytype{#endsyntax#}

Converts a pointer of one type to a pointer of another type. The return type is the inferred result type.

{#link|Optional Pointers#} are allowed. Casting an optional pointer which is {#link|null#} to a non-optional pointer invokes safety-checked {#link|Undefined Behavior#}.

{#syntax#}@ptrCast{#endsyntax#} cannot be used for:

• Removing {#syntax#}const{#endsyntax#} qualifier, use {#link|@constCast#}.
• Removing {#syntax#}volatile{#endsyntax#} qualifier, use {#link|@volatileCast#}.
• Changing pointer address space, use {#link|@addrSpaceCast#}.
• Increasing pointer alignment, use {#link|@alignCast#}.
• Casting a non-slice pointer to a slice, use slicing syntax {#syntax#}ptr[start..end]{#endsyntax#}.

{#syntax#}@ptrFromInt(address: usize) anytype{#endsyntax#}

Converts an integer to a {#link|pointer|Pointers#}. The return type is the inferred result type. To convert the other way, use {#link|@intFromPtr#}. Casting an address of 0 to a destination type which in not {#link|optional|Optional Pointers#} and does not have the {#syntax#}allowzero{#endsyntax#} attribute will result in a {#link|Pointer Cast Invalid Null#} panic when runtime safety checks are enabled.

If the destination pointer type does not allow address zero and {#syntax#}address{#endsyntax#} is zero, this invokes safety-checked {#link|Undefined Behavior#}.

{#syntax#}@rem(numerator: T, denominator: T) T{#endsyntax#}

Remainder division. For unsigned integers this is the same as {#syntax#}numerator % denominator{#endsyntax#}. Caller guarantees {#syntax#}denominator > 0{#endsyntax#}, otherwise the operation will result in a {#link|Remainder Division by Zero#} when runtime safety checks are enabled.

• {#syntax#}@rem(-5, 3) == -2{#endsyntax#}
• {#syntax#}(@divTrunc(a, b) * b) + @rem(a, b) == a{#endsyntax#}

For a function that returns an error code, see {#syntax#}@import("std").math.rem{#endsyntax#}.

{#syntax#}@returnAddress() usize{#endsyntax#}

This function returns the address of the next machine code instruction that will be executed when the current function returns.

The implications of this are target-specific and not consistent across all platforms.

This function is only valid within function scope. If the function gets inlined into a calling function, the returned address will apply to the calling function.

{#syntax#}@select(comptime T: type, pred: @Vector(len, bool), a: @Vector(len, T), b: @Vector(len, T)) @Vector(len, T){#endsyntax#}

Selects values element-wise from {#syntax#}a{#endsyntax#} or {#syntax#}b{#endsyntax#} based on {#syntax#}pred{#endsyntax#}. If {#syntax#}pred[i]{#endsyntax#} is {#syntax#}true{#endsyntax#}, the corresponding element in the result will be {#syntax#}a[i]{#endsyntax#} and otherwise {#syntax#}b[i]{#endsyntax#}.

{#syntax#}@setEvalBranchQuota(comptime new_quota: u32) void{#endsyntax#}

Increase the maximum number of backwards branches that compile-time code execution can use before giving up and making a compile error.

If the {#syntax#}new_quota{#endsyntax#} is smaller than the default quota ({#syntax#}1000{#endsyntax#}) or a previously explicitly set quota, it is ignored.

Example:

Now we use {#syntax#}@setEvalBranchQuota{#endsyntax#}:

{#syntax#}@setFloatMode(comptime mode: FloatMode) void{#endsyntax#}

Changes the current scope's rules about how floating point operations are defined.

• {#syntax#}Strict{#endsyntax#} (default) - Floating point operations follow strict IEEE compliance.
• {#syntax#}Optimized{#endsyntax#} - Floating point operations may do all of the following:
  • Assume the arguments and result are not NaN. Optimizations are required to retain defined behavior over NaNs, but the value of the result is undefined.
  • Assume the arguments and result are not +/-Inf. Optimizations are required to retain defined behavior over +/-Inf, but the value of the result is undefined.
  • Treat the sign of a zero argument or result as insignificant.
  • Use the reciprocal of an argument rather than perform division.
  • Perform floating-point contraction (e.g. fusing a multiply followed by an addition into a fused multiply-add).
  • Perform algebraically equivalent transformations that may change results in floating point (e.g. reassociate).
  This is equivalent to -ffast-math in GCC.

The floating point mode is inherited by child scopes, and can be overridden in any scope. You can set the floating point mode in a struct or module scope by using a comptime block.

{#syntax#}FloatMode{#endsyntax#} can be found with {#syntax#}@import("std").builtin.FloatMode{#endsyntax#}.

{#syntax#}@setRuntimeSafety(comptime safety_on: bool) void{#endsyntax#}

Sets whether runtime safety checks are enabled for the scope that contains the function call.

Note: it is planned to replace {#syntax#}@setRuntimeSafety{#endsyntax#} with @optimizeFor

{#syntax#}@shlExact(value: T, shift_amt: Log2T) T{#endsyntax#}

Performs the left shift operation ({#syntax#}<<{#endsyntax#}). For unsigned integers, the result is {#link|undefined#} if any 1 bits are shifted out. For signed integers, the result is {#link|undefined#} if any bits that disagree with the resultant sign bit are shifted out.

The type of {#syntax#}shift_amt{#endsyntax#} is an unsigned integer with {#syntax#}log2(@typeInfo(T).int.bits){#endsyntax#} bits. This is because {#syntax#}shift_amt >= @typeInfo(T).int.bits{#endsyntax#} is undefined behavior.

{#syntax#}comptime_int{#endsyntax#} is modeled as an integer with an infinite number of bits, meaning that in such case, {#syntax#}@shlExact{#endsyntax#} always produces a result and cannot produce a compile error.

{#syntax#}@shlWithOverflow(a: anytype, shift_amt: Log2T) struct { @TypeOf(a), u1 }{#endsyntax#}

Performs {#syntax#}a << b{#endsyntax#} and returns a tuple with the result and a possible overflow bit.

The type of {#syntax#}shift_amt{#endsyntax#} is an unsigned integer with {#syntax#}log2(@typeInfo(@TypeOf(a)).int.bits){#endsyntax#} bits. This is because {#syntax#}shift_amt >= @typeInfo(@TypeOf(a)).int.bits{#endsyntax#} is undefined behavior.

{#syntax#}@shrExact(value: T, shift_amt: Log2T) T{#endsyntax#}

Performs the right shift operation ({#syntax#}>>{#endsyntax#}). Caller guarantees that the shift will not shift any 1 bits out.

The type of {#syntax#}shift_amt{#endsyntax#} is an unsigned integer with {#syntax#}log2(@typeInfo(T).int.bits){#endsyntax#} bits. This is because {#syntax#}shift_amt >= @typeInfo(T).int.bits{#endsyntax#} is undefined behavior.

{#syntax#}@shuffle(comptime E: type, a: @Vector(a_len, E), b: @Vector(b_len, E), comptime mask: @Vector(mask_len, i32)) @Vector(mask_len, E){#endsyntax#}

Constructs a new {#link|vector|Vectors#} by selecting elements from {#syntax#}a{#endsyntax#} and {#syntax#}b{#endsyntax#} based on {#syntax#}mask{#endsyntax#}.

Each element in {#syntax#}mask{#endsyntax#} selects an element from either {#syntax#}a{#endsyntax#} or {#syntax#}b{#endsyntax#}. Positive numbers select from {#syntax#}a{#endsyntax#} starting at 0. Negative values select from {#syntax#}b{#endsyntax#}, starting at {#syntax#}-1{#endsyntax#} and going down. It is recommended to use the {#syntax#}~{#endsyntax#} operator for indexes from {#syntax#}b{#endsyntax#} so that both indexes can start from {#syntax#}0{#endsyntax#} (i.e. {#syntax#}~@as(i32, 0){#endsyntax#} is {#syntax#}-1{#endsyntax#}).

For each element of {#syntax#}mask{#endsyntax#}, if it or the selected value from {#syntax#}a{#endsyntax#} or {#syntax#}b{#endsyntax#} is {#syntax#}undefined{#endsyntax#}, then the resulting element is {#syntax#}undefined{#endsyntax#}.

{#syntax#}a_len{#endsyntax#} and {#syntax#}b_len{#endsyntax#} may differ in length. Out-of-bounds element indexes in {#syntax#}mask{#endsyntax#} result in compile errors.

If {#syntax#}a{#endsyntax#} or {#syntax#}b{#endsyntax#} is {#syntax#}undefined{#endsyntax#}, it is equivalent to a vector of all {#syntax#}undefined{#endsyntax#} with the same length as the other vector. If both vectors are {#syntax#}undefined{#endsyntax#}, {#syntax#}@shuffle{#endsyntax#} returns a vector with all elements {#syntax#}undefined{#endsyntax#}.

{#syntax#}E{#endsyntax#} must be an {#link|integer|Integers#}, {#link|float|Floats#}, {#link|pointer|Pointers#}, or {#syntax#}bool{#endsyntax#}. The mask may be any vector length, and its length determines the result length.

{#syntax#}@sizeOf(comptime T: type) comptime_int{#endsyntax#}

This function returns the number of bytes it takes to store {#syntax#}T{#endsyntax#} in memory. The result is a target-specific compile time constant.

This size may contain padding bytes. If there were two consecutive T in memory, the padding would be the offset in bytes between element at index 0 and the element at index 1. For {#link|integer|Integers#}, consider whether you want to use {#syntax#}@sizeOf(T){#endsyntax#} or {#syntax#}@typeInfo(T).int.bits{#endsyntax#}.

This function measures the size at runtime. For types that are disallowed at runtime, such as {#syntax#}comptime_int{#endsyntax#} and {#syntax#}type{#endsyntax#}, the result is {#syntax#}0{#endsyntax#}.

{#syntax#}@splat(scalar: anytype) anytype{#endsyntax#}

Produces a vector where each element is the value {#syntax#}scalar{#endsyntax#}. The return type and thus the length of the vector is inferred.

{#syntax#}scalar{#endsyntax#} must be an {#link|integer|Integers#}, {#link|bool|Primitive Types#}, {#link|float|Floats#}, or {#link|pointer|Pointers#}.

{#syntax#}@reduce(comptime op: std.builtin.ReduceOp, value: anytype) E{#endsyntax#}

Transforms a {#link|vector|Vectors#} into a scalar value (of type E) by performing a sequential horizontal reduction of its elements using the specified operator {#syntax#}op{#endsyntax#}.

Not every operator is available for every vector element type:

• Every operator is available for {#link|integer|Integers#} vectors.
• {#syntax#}.And{#endsyntax#}, {#syntax#}.Or{#endsyntax#}, {#syntax#}.Xor{#endsyntax#} are additionally available for {#syntax#}bool{#endsyntax#} vectors,
• {#syntax#}.Min{#endsyntax#}, {#syntax#}.Max{#endsyntax#}, {#syntax#}.Add{#endsyntax#}, {#syntax#}.Mul{#endsyntax#} are additionally available for {#link|floating point|Floats#} vectors,

Note that {#syntax#}.Add{#endsyntax#} and {#syntax#}.Mul{#endsyntax#} reductions on integral types are wrapping; when applied on floating point types the operation associativity is preserved, unless the float mode is set to {#syntax#}Optimized{#endsyntax#}.

{#syntax#}@src() std.builtin.SourceLocation{#endsyntax#}

Returns a {#syntax#}SourceLocation{#endsyntax#} struct representing the function's name and location in the source code. This must be called in a function.

{#syntax#}@sqrt(value: anytype) @TypeOf(value){#endsyntax#}

Performs the square root of a floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@sin(value: anytype) @TypeOf(value){#endsyntax#}

Sine trigonometric function on a floating point number in radians. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@cos(value: anytype) @TypeOf(value){#endsyntax#}

Cosine trigonometric function on a floating point number in radians. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@tan(value: anytype) @TypeOf(value){#endsyntax#}

Tangent trigonometric function on a floating point number in radians. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@exp(value: anytype) @TypeOf(value){#endsyntax#}

Base-e exponential function on a floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@exp2(value: anytype) @TypeOf(value){#endsyntax#}

Base-2 exponential function on a floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@log(value: anytype) @TypeOf(value){#endsyntax#}

Returns the natural logarithm of a floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@log2(value: anytype) @TypeOf(value){#endsyntax#}

Returns the logarithm to the base 2 of a floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@log10(value: anytype) @TypeOf(value){#endsyntax#}

Returns the logarithm to the base 10 of a floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@abs(value: anytype) anytype{#endsyntax#}

Returns the absolute value of an integer or a floating point number. Uses a dedicated hardware instruction when available. The return type is always an unsigned integer of the same bit width as the operand if the operand is an integer. Unsigned integer operands are supported. The builtin cannot overflow for signed integer operands.

Supports {#link|Floats#}, {#link|Integers#} and {#link|Vectors#} of floats or integers.

{#syntax#}@floor(value: anytype) @TypeOf(value){#endsyntax#}

Returns the largest integral value not greater than the given floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@ceil(value: anytype) @TypeOf(value){#endsyntax#}

Returns the smallest integral value not less than the given floating point number. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@trunc(value: anytype) @TypeOf(value){#endsyntax#}

Rounds the given floating point number to an integer, towards zero. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@round(value: anytype) @TypeOf(value){#endsyntax#}

Rounds the given floating point number to the nearest integer. If two integers are equally close, rounds away from zero. Uses a dedicated hardware instruction when available.

Supports {#link|Floats#} and {#link|Vectors#} of floats.

{#syntax#}@subWithOverflow(a: anytype, b: anytype) struct { @TypeOf(a, b), u1 }{#endsyntax#}

Performs {#syntax#}a - b{#endsyntax#} and returns a tuple with the result and a possible overflow bit.

{#syntax#}@tagName(value: anytype) [:0]const u8{#endsyntax#}

Converts an enum value or union value to a string literal representing the name.

If the enum is non-exhaustive and the tag value does not map to a name, it invokes safety-checked {#link|Undefined Behavior#}.

{#syntax#}@This() type{#endsyntax#}

Returns the innermost struct, enum, or union that this function call is inside. This can be useful for an anonymous struct that needs to refer to itself:

When {#syntax#}@This(){#endsyntax#} is used at file scope, it returns a reference to the struct that corresponds to the current file.

{#syntax#}@trap() noreturn{#endsyntax#}

This function inserts a platform-specific trap/jam instruction which can be used to exit the program abnormally. This may be implemented by explicitly emitting an invalid instruction which may cause an illegal instruction exception of some sort. Unlike for {#syntax#}@breakpoint(){#endsyntax#}, execution does not continue after this point.

Outside function scope, this builtin causes a compile error.

{#syntax#}@truncate(integer: anytype) anytype{#endsyntax#}

This function truncates bits from an integer type, resulting in a smaller or same-sized integer type. The return type is the inferred result type.

This function always truncates the significant bits of the integer, regardless of endianness on the target platform.

Calling {#syntax#}@truncate{#endsyntax#} on a number out of range of the destination type is well defined and working code:

Use {#link|@intCast#} to convert numbers guaranteed to fit the destination type.

{#syntax#}@Type(comptime info: std.builtin.Type) type{#endsyntax#}

This function is the inverse of {#link|@typeInfo#}. It reifies type information into a {#syntax#}type{#endsyntax#}.

It is available for the following types:

• {#syntax#}type{#endsyntax#}
• {#syntax#}noreturn{#endsyntax#}
• {#syntax#}void{#endsyntax#}
• {#syntax#}bool{#endsyntax#}
• {#link|Integers#} - The maximum bit count for an integer type is {#syntax#}65535{#endsyntax#}.
• {#link|Floats#}
• {#link|Pointers#}
• {#syntax#}comptime_int{#endsyntax#}
• {#syntax#}comptime_float{#endsyntax#}
• {#syntax#}@TypeOf(undefined){#endsyntax#}
• {#syntax#}@TypeOf(null){#endsyntax#}
• {#link|Arrays#}
• {#link|Optionals#}
• {#link|Error Set Type#}
• {#link|Error Union Type#}
• {#link|Vectors#}
• {#link|opaque#}
• {#syntax#}anyframe{#endsyntax#}
• {#link|struct#}
• {#link|enum#}
• {#link|Enum Literals#}
• {#link|union#}
• {#link|Functions#}

{#syntax#}@typeInfo(comptime T: type) std.builtin.Type{#endsyntax#}

Provides type reflection.

Type information of {#link|structs|struct#}, {#link|unions|union#}, {#link|enums|enum#}, and {#link|error sets|Error Set Type#} has fields which are guaranteed to be in the same order as appearance in the source file.

Type information of {#link|structs|struct#}, {#link|unions|union#}, {#link|enums|enum#}, and {#link|opaques|opaque#} has declarations, which are also guaranteed to be in the same order as appearance in the source file.

{#syntax#}@typeName(T: type) *const [N:0]u8{#endsyntax#}

This function returns the string representation of a type, as an array. It is equivalent to a string literal of the type name. The returned type name is fully qualified with the parent namespace included as part of the type name with a series of dots.

{#syntax#}@TypeOf(...) type{#endsyntax#}

{#syntax#}@TypeOf{#endsyntax#} is a special builtin function that takes any (non-zero) number of expressions as parameters and returns the type of the result, using {#link|Peer Type Resolution#}.

The expressions are evaluated, however they are guaranteed to have no runtime side-effects:

{#syntax#}@unionInit(comptime Union: type, comptime active_field_name: []const u8, init_expr) Union{#endsyntax#}

This is the same thing as {#link|union#} initialization syntax, except that the field name is a {#link|comptime#}-known value rather than an identifier token.

{#syntax#}@unionInit{#endsyntax#} forwards its {#link|result location|Result Location Semantics#} to {#syntax#}init_expr{#endsyntax#}.

{#syntax#}@Vector(len: comptime_int, Element: type) type{#endsyntax#}

Creates {#link|Vectors#}.

{#syntax#}@volatileCast(value: anytype) DestType{#endsyntax#}

Remove {#syntax#}volatile{#endsyntax#} qualifier from a pointer.

{#syntax#}@workGroupId(comptime dimension: u32) u32{#endsyntax#}

Returns the index of the work group in the current kernel invocation in dimension {#syntax#}dimension{#endsyntax#}.

{#syntax#}@workGroupSize(comptime dimension: u32) u32{#endsyntax#}

Returns the number of work items that a work group has in dimension {#syntax#}dimension{#endsyntax#}.

{#syntax#}@workItemId(comptime dimension: u32) u32{#endsyntax#}

Returns the index of the work item in the work group in dimension {#syntax#}dimension{#endsyntax#}. This function returns values between {#syntax#}0{#endsyntax#} (inclusive) and {#syntax#}@workGroupSize(dimension){#endsyntax#} (exclusive).

Zig has four build modes:

• {#link|Debug#} (default)
• {#link|ReleaseFast#}
• {#link|ReleaseSafe#}
• {#link|ReleaseSmall#}

To add standard build options to a build.zig file:

This causes these options to be available:

-Doptimize=Debug

Optimizations off and safety on (default)

-Doptimize=ReleaseSafe

Optimizations on and safety on

-Doptimize=ReleaseFast

Optimizations on and safety off

-Doptimize=ReleaseSmall

Size optimizations on and safety off

• Fast compilation speed
• Safety checks enabled
• Slow runtime performance
• Large binary size
• No reproducible build requirement

• Fast runtime performance
• Safety checks disabled
• Slow compilation speed
• Large binary size
• Reproducible build

• Medium runtime performance
• Safety checks enabled
• Slow compilation speed
• Large binary size
• Reproducible build

• Medium runtime performance
• Safety checks disabled
• Slow compilation speed
• Small binary size
• Reproducible build

Zig has a compile option -fsingle-threaded which has the following effects:

• All {#link|Thread Local Variables#} are treated as regular {#link|Container Level Variables#}.
• The overhead of {#link|Async Functions#} becomes equivalent to function call overhead.
• The {#syntax#}@import("builtin").single_threaded{#endsyntax#} becomes {#syntax#}true{#endsyntax#} and therefore various userland APIs which read this variable become more efficient. For example {#syntax#}std.Mutex{#endsyntax#} becomes an empty data structure and all of its functions become no-ops.

Zig has many instances of undefined behavior. If undefined behavior is detected at compile-time, Zig emits a compile error and refuses to continue. Most undefined behavior that cannot be detected at compile-time can be detected at runtime. In these cases, Zig has safety checks. Safety checks can be disabled on a per-block basis with {#link|@setRuntimeSafety#}. The {#link|ReleaseFast#} and {#link|ReleaseSmall#} build modes disable all safety checks (except where overridden by {#link|@setRuntimeSafety#}) in order to facilitate optimizations.

When a safety check fails, Zig crashes with a stack trace, like this:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

To obtain the maximum value of an unsigned integer, use {#syntax#}std.math.maxInt{#endsyntax#}.

At compile-time:

At runtime:

To truncate bits, use {#link|@truncate#}.

The following operators can cause integer overflow:

• {#syntax#}+{#endsyntax#} (addition)
• {#syntax#}-{#endsyntax#} (subtraction)
• {#syntax#}-{#endsyntax#} (negation)
• {#syntax#}*{#endsyntax#} (multiplication)
• {#syntax#}/{#endsyntax#} (division)
• {#link|@divTrunc#} (division)
• {#link|@divFloor#} (division)
• {#link|@divExact#} (division)

Example with addition at compile-time:

At runtime:

These functions provided by the standard library return possible errors.

• {#syntax#}@import("std").math.add{#endsyntax#}
• {#syntax#}@import("std").math.sub{#endsyntax#}
• {#syntax#}@import("std").math.mul{#endsyntax#}
• {#syntax#}@import("std").math.divTrunc{#endsyntax#}
• {#syntax#}@import("std").math.divFloor{#endsyntax#}
• {#syntax#}@import("std").math.divExact{#endsyntax#}
• {#syntax#}@import("std").math.shl{#endsyntax#}

Example of catching an overflow for addition:

These builtins return a tuple containing whether there was an overflow (as a {#syntax#}u1{#endsyntax#}) and the possibly overflowed bits of the operation:

• {#link|@addWithOverflow#}
• {#link|@subWithOverflow#}
• {#link|@mulWithOverflow#}
• {#link|@shlWithOverflow#}

Example of {#link|@addWithOverflow#}:

These operations have guaranteed wraparound semantics.

• {#syntax#}+%{#endsyntax#} (wraparound addition)
• {#syntax#}-%{#endsyntax#} (wraparound subtraction)
• {#syntax#}-%{#endsyntax#} (wraparound negation)
• {#syntax#}*%{#endsyntax#} (wraparound multiplication)

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

One way to avoid this crash is to test for null instead of assuming non-null, with the {#syntax#}if{#endsyntax#} expression:

At compile-time:

At runtime:

One way to avoid this crash is to test for an error instead of assuming a successful result, with the {#syntax#}if{#endsyntax#} expression:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

At compile-time:

At runtime:

This safety is not available for {#syntax#}extern{#endsyntax#} or {#syntax#}packed{#endsyntax#} unions.

To change the active field of a union, assign the entire union, like this:

To change the active field of a union when a meaningful value for the field is not known, use {#link|undefined#}, like this:

This happens when casting a float to an integer where the float has a value outside the integer type's range.

At compile-time:

At runtime:

This happens when casting a pointer with the address 0 to a pointer which may not have the address 0. For example, {#link|C Pointers#}, {#link|Optional Pointers#}, and {#link|allowzero#} pointers allow address zero, but normal {#link|Pointers#} do not.

At compile-time:

At runtime:

The Zig language performs no memory management on behalf of the programmer. This is why Zig has no runtime, and why Zig code works seamlessly in so many environments, including real-time software, operating system kernels, embedded devices, and low latency servers. As a consequence, Zig programmers must always be able to answer the question:

{#link|Where are the bytes?#}

Like Zig, the C programming language has manual memory management. However, unlike Zig, C has a default allocator - malloc, realloc, and free. When linking against libc, Zig exposes this allocator with {#syntax#}std.heap.c_allocator{#endsyntax#}. However, by convention, there is no default allocator in Zig. Instead, functions which need to allocate accept an {#syntax#}Allocator{#endsyntax#} parameter. Likewise, data structures such as {#syntax#}std.ArrayList{#endsyntax#} accept an {#syntax#}Allocator{#endsyntax#} parameter in their initialization functions:

In the above example, 100 bytes of stack memory are used to initialize a {#syntax#}FixedBufferAllocator{#endsyntax#}, which is then passed to a function. As a convenience there is a global {#syntax#}FixedBufferAllocator{#endsyntax#} available for quick tests at {#syntax#}std.testing.allocator{#endsyntax#}, which will also perform basic leak detection.

Zig has a general purpose allocator available to be imported with {#syntax#}std.heap.GeneralPurposeAllocator{#endsyntax#}. However, it is still recommended to follow the {#link|Choosing an Allocator#} guide.

What allocator to use depends on a number of factors. Here is a flow chart to help you decide:

1. Are you making a library? In this case, best to accept an {#syntax#}Allocator{#endsyntax#} as a parameter and allow your library's users to decide what allocator to use.
2. Are you linking libc? In this case, {#syntax#}std.heap.c_allocator{#endsyntax#} is likely the right choice, at least for your main allocator.
3. Need to use the same allocator in multiple threads? Use one of your choice wrapped around {#syntax#}std.heap.ThreadSafeAllocator{#endsyntax#}
4. Is the maximum number of bytes that you will need bounded by a number known at {#link|comptime#}? In this case, use {#syntax#}std.heap.FixedBufferAllocator{#endsyntax#}.
5. Is your program a command line application which runs from start to end without any fundamental cyclical pattern (such as a video game main loop, or a web server request handler), such that it would make sense to free everything at once at the end? In this case, it is recommended to follow this pattern: {#code|cli_allocation.zig#} When using this kind of allocator, there is no need to free anything manually. Everything gets freed at once with the call to {#syntax#}arena.deinit(){#endsyntax#}.
6. Are the allocations part of a cyclical pattern such as a video game main loop, or a web server request handler? If the allocations can all be freed at once, at the end of the cycle, for example once the video game frame has been fully rendered, or the web server request has been served, then {#syntax#}std.heap.ArenaAllocator{#endsyntax#} is a great candidate. As demonstrated in the previous bullet point, this allows you to free entire arenas at once. Note also that if an upper bound of memory can be established, then {#syntax#}std.heap.FixedBufferAllocator{#endsyntax#} can be used as a further optimization.
7. Are you writing a test, and you want to make sure {#syntax#}error.OutOfMemory{#endsyntax#} is handled correctly? In this case, use {#syntax#}std.testing.FailingAllocator{#endsyntax#}.
8. Are you writing a test? In this case, use {#syntax#}std.testing.allocator{#endsyntax#}.
9. Finally, if none of the above apply, you need a general purpose allocator. Zig's general purpose allocator is available as a function that takes a {#link|comptime#} {#link|struct#} of configuration options and returns a type. Generally, you will set up one {#syntax#}std.heap.GeneralPurposeAllocator{#endsyntax#} in your main function, and then pass it or sub-allocators around to various parts of your application.
10. You can also consider {#link|Implementing an Allocator#}.

String literals such as {#syntax#}"hello"{#endsyntax#} are in the global constant data section. This is why it is an error to pass a string literal to a mutable slice, like this:

However if you make the slice constant, then it works:

Just like string literals, {#syntax#}const{#endsyntax#} declarations, when the value is known at {#link|comptime#}, are stored in the global constant data section. Also {#link|Compile Time Variables#} are stored in the global constant data section.

{#syntax#}var{#endsyntax#} declarations inside functions are stored in the function's stack frame. Once a function returns, any {#link|Pointers#} to variables in the function's stack frame become invalid references, and dereferencing them becomes unchecked {#link|Undefined Behavior#}.

{#syntax#}var{#endsyntax#} declarations at the top level or in {#link|struct#} declarations are stored in the global data section.

The location of memory allocated with {#syntax#}allocator.alloc{#endsyntax#} or {#syntax#}allocator.create{#endsyntax#} is determined by the allocator's implementation.

TODO: thread local variables

Zig programmers can implement their own allocators by fulfilling the Allocator interface. In order to do this one must read carefully the documentation comments in std/mem.zig and then supply a {#syntax#}allocFn{#endsyntax#} and a {#syntax#}resizeFn{#endsyntax#}.

There are many example allocators to look at for inspiration. Look at std/heap.zig and {#syntax#}std.heap.GeneralPurposeAllocator{#endsyntax#}.

Many programming languages choose to handle the possibility of heap allocation failure by unconditionally crashing. By convention, Zig programmers do not consider this to be a satisfactory solution. Instead, {#syntax#}error.OutOfMemory{#endsyntax#} represents heap allocation failure, and Zig libraries return this error code whenever heap allocation failure prevented an operation from completing successfully.

Some have argued that because some operating systems such as Linux have memory overcommit enabled by default, it is pointless to handle heap allocation failure. There are many problems with this reasoning:

• Only some operating systems have an overcommit feature.
  • Linux has it enabled by default, but it is configurable.
  • Windows does not overcommit.
  • Embedded systems do not have overcommit.
  • Hobby operating systems may or may not have overcommit.
• For real-time systems, not only is there no overcommit, but typically the maximum amount of memory per application is determined ahead of time.
• When writing a library, one of the main goals is code reuse. By making code handle allocation failure correctly, a library becomes eligible to be reused in more contexts.
• Although some software has grown to depend on overcommit being enabled, its existence is the source of countless user experience disasters. When a system with overcommit enabled, such as Linux on default settings, comes close to memory exhaustion, the system locks up and becomes unusable. At this point, the OOM Killer selects an application to kill based on heuristics. This non-deterministic decision often results in an important process being killed, and often fails to return the system back to working order.

Recursion is a fundamental tool in modeling software. However it has an often-overlooked problem: unbounded memory allocation.

Recursion is an area of active experimentation in Zig and so the documentation here is not final. You can read a summary of recursion status in the 0.3.0 release notes.

The short summary is that currently recursion works normally as you would expect. Although Zig code is not yet protected from stack overflow, it is planned that a future version of Zig will provide such protection, with some degree of cooperation from Zig code required.

It is the Zig programmer's responsibility to ensure that a {#link|pointer|Pointers#} is not accessed when the memory pointed to is no longer available. Note that a {#link|slice|Slices#} is a form of pointer, in that it references other memory.

In order to prevent bugs, there are some helpful conventions to follow when dealing with pointers. In general, when a function returns a pointer, the documentation for the function should explain who "owns" the pointer. This concept helps the programmer decide when it is appropriate, if ever, to free the pointer.

For example, the function's documentation may say "caller owns the returned memory", in which case the code that calls the function must have a plan for when to free that memory. Probably in this situation, the function will accept an {#syntax#}Allocator{#endsyntax#} parameter.

Sometimes the lifetime of a pointer may be more complicated. For example, the {#syntax#}std.ArrayList(T).items{#endsyntax#} slice has a lifetime that remains valid until the next time the list is resized, such as by appending new elements.

The API documentation for functions and data structures should take great care to explain the ownership and lifetime semantics of pointers. Ownership determines whose responsibility it is to free the memory referenced by the pointer, and lifetime determines the point at which the memory becomes inaccessible (lest {#link|Undefined Behavior#} occur).

Compile variables are accessible by importing the {#syntax#}"builtin"{#endsyntax#} package, which the compiler makes available to every Zig source file. It contains compile-time constants such as the current target, endianness, and release mode.

Example of what is imported with {#syntax#}@import("builtin"){#endsyntax#}:

TODO: explain how root source file finds other files

TODO: pub fn main

TODO: pub fn panic

TODO: if linking with libc you can use export fn main

TODO: order independent top level declarations

TODO: lazy analysis

TODO: using comptime { _ = @import() }

The Zig Build System provides a cross-platform, dependency-free way to declare the logic required to build a project. With this system, the logic to build a project is written in a build.zig file, using the Zig Build System API to declare and configure build artifacts and other tasks.

Some examples of tasks the build system can help with:

• Performing tasks in parallel and caching the results.
• Depending on other projects.
• Providing a package for other projects to depend on.
• Creating build artifacts by executing the Zig compiler. This includes building Zig source code as well as C and C++ source code.
• Capturing user-configured options and using those options to configure the build.
• Surfacing build configuration as {#link|comptime#} values by providing a file that can be {#link|imported|@import#} by Zig code.
• Caching build artifacts to avoid unnecessarily repeating steps.
• Executing build artifacts or system-installed tools.
• Running tests and verifying the output of executing a build artifact matches the expected value.
• Running zig fmt on a codebase or a subset of it.
• Custom tasks.

To use the build system, run zig build --help to see a command-line usage help menu. This will include project-specific options that were declared in the build.zig script.

For the time being, the build system documentation is hosted externally: Build System Documentation

Although Zig is independent of C, and, unlike most other languages, does not depend on libc, Zig acknowledges the importance of interacting with existing C code.

There are a few ways that Zig facilitates C interop.

These have guaranteed C ABI compatibility and can be used like any other type.

• {#syntax#}c_char{#endsyntax#}
• {#syntax#}c_short{#endsyntax#}
• {#syntax#}c_ushort{#endsyntax#}
• {#syntax#}c_int{#endsyntax#}
• {#syntax#}c_uint{#endsyntax#}
• {#syntax#}c_long{#endsyntax#}
• {#syntax#}c_ulong{#endsyntax#}
• {#syntax#}c_longlong{#endsyntax#}
• {#syntax#}c_ulonglong{#endsyntax#}
• {#syntax#}c_longdouble{#endsyntax#}

To interop with the C {#syntax#}void{#endsyntax#} type, use {#syntax#}anyopaque{#endsyntax#}.

The {#syntax#}@cImport{#endsyntax#} builtin function can be used to directly import symbols from .h files:

The {#syntax#}@cImport{#endsyntax#} function takes an expression as a parameter. This expression is evaluated at compile-time and is used to control preprocessor directives and include multiple .h files:

Zig's C translation capability is available as a CLI tool via zig translate-c. It requires a single filename as an argument. It may also take a set of optional flags that are forwarded to clang. It writes the translated file to stdout.

• -I: Specify a search directory for include files. May be used multiple times. Equivalent to clang's -I flag. The current directory is not included by default; use -I. to include it.
• -D: Define a preprocessor macro. Equivalent to clang's -D flag.
• -cflags [flags] --: Pass arbitrary additional command line flags to clang. Note: the list of flags must end with --
• -target: The {#link|target triple|Targets#} for the translated Zig code. If no target is specified, the current host target will be used.

Important! When translating C code with zig translate-c, you must use the same -target triple that you will use when compiling the translated code. In addition, you must ensure that the -cflags used, if any, match the cflags used by code on the target system. Using the incorrect -target or -cflags could result in clang or Zig parse failures, or subtle ABI incompatibilities when linking with C code.

{#syntax#}@cImport{#endsyntax#} and zig translate-c use the same underlying C translation functionality, so on a technical level they are equivalent. In practice, {#syntax#}@cImport{#endsyntax#} is useful as a way to quickly and easily access numeric constants, typedefs, and record types without needing any extra setup. If you need to pass {#link|cflags|Using -target and -cflags#} to clang, or if you would like to edit the translated code, it is recommended to use zig translate-c and save the results to a file. Common reasons for editing the generated code include: changing {#syntax#}anytype{#endsyntax#} parameters in function-like macros to more specific types; changing {#syntax#}[*c]T{#endsyntax#} pointers to {#syntax#}[*]T{#endsyntax#} or {#syntax#}*T{#endsyntax#} pointers for improved type safety; and {#link|enabling or disabling runtime safety|@setRuntimeSafety#} within specific functions.

The C translation feature (whether used via zig translate-c or {#syntax#}@cImport{#endsyntax#}) integrates with the Zig caching system. Subsequent runs with the same source file, target, and cflags will use the cache instead of repeatedly translating the same code.

To see where the cached files are stored when compiling code that uses {#syntax#}@cImport{#endsyntax#}, use the --verbose-cimport flag:

cimport.h contains the file to translate (constructed from calls to {#syntax#}@cInclude{#endsyntax#}, {#syntax#}@cDefine{#endsyntax#}, and {#syntax#}@cUndef{#endsyntax#}), cimport.h.d is the list of file dependencies, and cimport.zig contains the translated output.

Some C constructs cannot be translated to Zig - for example, goto, structs with bitfields, and token-pasting macros. Zig employs demotion to allow translation to continue in the face of non-translatable entities.

Demotion comes in three varieties - {#link|opaque#}, extern, and {#syntax#}@compileError{#endsyntax#}. C structs and unions that cannot be translated correctly will be translated as {#syntax#}opaque{}{#endsyntax#}. Functions that contain opaque types or code constructs that cannot be translated will be demoted to {#syntax#}extern{#endsyntax#} declarations. Thus, non-translatable types can still be used as pointers, and non-translatable functions can be called so long as the linker is aware of the compiled function.

{#syntax#}@compileError{#endsyntax#} is used when top-level definitions (global variables, function prototypes, macros) cannot be translated or demoted. Since Zig uses lazy analysis for top-level declarations, untranslatable entities will not cause a compile error in your code unless you actually use them.

C Translation makes a best-effort attempt to translate function-like macros into equivalent Zig functions. Since C macros operate at the level of lexical tokens, not all C macros can be translated to Zig. Macros that cannot be translated will be demoted to {#syntax#}@compileError{#endsyntax#}. Note that C code which uses macros will be translated without any additional issues (since Zig operates on the pre-processed source with macros expanded). It is merely the macros themselves which may not be translatable to Zig.

Consider the following example:

Note that {#syntax#}foo{#endsyntax#} was translated correctly despite using a non-translatable macro. {#syntax#}MAKELOCAL{#endsyntax#} was demoted to {#syntax#}@compileError{#endsyntax#} since it cannot be expressed as a Zig function; this simply means that you cannot directly use {#syntax#}MAKELOCAL{#endsyntax#} from Zig.

This type is to be avoided whenever possible. The only valid reason for using a C pointer is in auto-generated code from translating C code.

When importing C header files, it is ambiguous whether pointers should be translated as single-item pointers ({#syntax#}*T{#endsyntax#}) or many-item pointers ({#syntax#}[*]T{#endsyntax#}). C pointers are a compromise so that Zig code can utilize translated header files directly.

{#syntax#}[*c]T{#endsyntax#} - C pointer.

• Supports all the syntax of the other two pointer types ({#syntax#}*T{#endsyntax#}) and ({#syntax#}[*]T{#endsyntax#}).
• Coerces to other pointer types, as well as {#link|Optional Pointers#}. When a C pointer is coerced to a non-optional pointer, safety-checked {#link|Undefined Behavior#} occurs if the address is 0.
• Allows address 0. On non-freestanding targets, dereferencing address 0 is safety-checked {#link|Undefined Behavior#}. Optional C pointers introduce another bit to keep track of null, just like {#syntax#}?usize{#endsyntax#}. Note that creating an optional C pointer is unnecessary as one can use normal {#link|Optional Pointers#}.
• Supports {#link|Type Coercion#} to and from integers.
• Supports comparison with integers.
• Does not support Zig-only pointer attributes such as alignment. Use normal {#link|Pointers#} please!

When a C pointer is pointing to a single struct (not an array), dereference the C pointer to access the struct's fields or member data. That syntax looks like this:

{#syntax#}ptr_to_struct.*.struct_member{#endsyntax#}

This is comparable to doing {#syntax#}->{#endsyntax#} in C.

When a C pointer is pointing to an array of structs, the syntax reverts to this:

{#syntax#}ptr_to_struct_array[index].struct_member{#endsyntax#}

Zig supports extern variadic functions.

Variadic functions can be implemented using {#link|@cVaStart#}, {#link|@cVaEnd#}, {#link|@cVaArg#} and {#link|@cVaCopy#}.

One of the primary use cases for Zig is exporting a library with the C ABI for other programming languages to call into. The {#syntax#}export{#endsyntax#} keyword in front of functions, variables, and types causes them to be part of the library API:

To make a static library:

To make a shared library:

Here is an example with the {#link|Zig Build System#}:

{#syntax#}addrspace{#endsyntax#}

{#syntax#}align{#endsyntax#}

{#syntax#}allowzero{#endsyntax#}

{#syntax#}and{#endsyntax#}

{#syntax#}anyframe{#endsyntax#}

{#syntax#}anytype{#endsyntax#}

{#syntax#}asm{#endsyntax#}

{#syntax#}async{#endsyntax#}

{#syntax#}await{#endsyntax#}

{#syntax#}break{#endsyntax#}

{#syntax#}callconv{#endsyntax#}

{#syntax#}catch{#endsyntax#}

{#syntax#}comptime{#endsyntax#}

{#syntax#}const{#endsyntax#}

{#syntax#}continue{#endsyntax#}

{#syntax#}defer{#endsyntax#}

{#syntax#}else{#endsyntax#}

{#syntax#}enum{#endsyntax#}

{#syntax#}errdefer{#endsyntax#}

{#syntax#}error{#endsyntax#}

{#syntax#}export{#endsyntax#}

{#syntax#}extern{#endsyntax#}

{#syntax#}fn{#endsyntax#}

{#syntax#}for{#endsyntax#}

{#syntax#}if{#endsyntax#}

{#syntax#}inline{#endsyntax#}

{#syntax#}linksection{#endsyntax#}

{#syntax#}noalias{#endsyntax#}

{#syntax#}noinline{#endsyntax#}

{#syntax#}nosuspend{#endsyntax#}

{#syntax#}opaque{#endsyntax#}

{#syntax#}or{#endsyntax#}

{#syntax#}orelse{#endsyntax#}

{#syntax#}packed{#endsyntax#}

{#syntax#}pub{#endsyntax#}

{#syntax#}resume{#endsyntax#}

{#syntax#}return{#endsyntax#}

{#syntax#}struct{#endsyntax#}

{#syntax#}suspend{#endsyntax#}

{#syntax#}switch{#endsyntax#}

{#syntax#}test{#endsyntax#}

{#syntax#}threadlocal{#endsyntax#}

{#syntax#}try{#endsyntax#}

{#syntax#}union{#endsyntax#}

{#syntax#}unreachable{#endsyntax#}

{#syntax#}usingnamespace{#endsyntax#}

{#syntax#}var{#endsyntax#}

{#syntax#}volatile{#endsyntax#}

{#syntax#}while{#endsyntax#}