mirror of
https://github.com/ziglang/zig.git
synced 2024-11-15 00:26:57 +00:00
10629 lines
348 KiB
HTML
10629 lines
348 KiB
HTML
<!doctype html>
|
|
<html lang="en">
|
|
<head>
|
|
<meta charset="utf-8">
|
|
<title>Documentation - The Zig Programming Language</title>
|
|
<link rel="icon" href="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAYAAAAf8/9hAAAAgklEQVR4AWMYWuD7EllJIM4G4g4g5oIJ/odhOJ8wToOxSTXgNxDHoeiBMfA4+wGShjyYOCkG/IGqWQziEzYAoUAeiF9D5U+DxEg14DRU7jWIT5IBIOdCxf+A+CQZAAoopEB7QJwBCBwHiip8UYmRdrAlDpIMgApwQZNnNii5Dq0MBgCxxycBnwEd+wAAAABJRU5ErkJggg=="/>
|
|
<style>
|
|
body{
|
|
font-family: system-ui, -apple-system, Roboto, "Segoe UI", sans-serif;
|
|
margin: 0;
|
|
}
|
|
a:not(:hover) {
|
|
text-decoration: none;
|
|
}
|
|
table, th, td {
|
|
border-collapse: collapse;
|
|
border: 1px solid grey;
|
|
}
|
|
th, td {
|
|
padding: 0.1em;
|
|
}
|
|
.t0_1, .t37, .t37_1 {
|
|
font-weight: bold;
|
|
}
|
|
.t2_0 {
|
|
color: grey;
|
|
}
|
|
.t31_1 {
|
|
color: red;
|
|
}
|
|
.t32_1 {
|
|
color: green;
|
|
}
|
|
.t36_1 {
|
|
color: #0086b3;
|
|
}
|
|
.file {
|
|
text-decoration: underline;
|
|
}
|
|
pre,code {
|
|
font-size: 12pt;
|
|
}
|
|
pre > code {
|
|
display: block;
|
|
overflow: auto;
|
|
padding: 0.5em;
|
|
color: #333;
|
|
background: #f8f8f8;
|
|
}
|
|
.table-wrapper {
|
|
width: 100%;
|
|
overflow-y: auto;
|
|
}
|
|
|
|
.tok-kw {
|
|
color: #333;
|
|
font-weight: bold;
|
|
}
|
|
.tok-str {
|
|
color: #d14;
|
|
}
|
|
.tok-builtin {
|
|
color: #0086b3;
|
|
}
|
|
.tok-comment {
|
|
color: #777;
|
|
font-style: italic;
|
|
}
|
|
.tok-fn {
|
|
color: #900;
|
|
font-weight: bold;
|
|
}
|
|
.tok-null {
|
|
color: #008080;
|
|
}
|
|
.tok-number {
|
|
color: #008080;
|
|
}
|
|
.tok-type {
|
|
color: #458;
|
|
font-weight: bold;
|
|
}
|
|
|
|
#main-wrapper {
|
|
display: flex;
|
|
flex-direction: column;
|
|
height: 100vh;
|
|
}
|
|
|
|
#contents-wrapper {
|
|
flex-grow: 1;
|
|
padding: 0 2em;
|
|
}
|
|
|
|
#contents {
|
|
max-width: 60em;
|
|
margin: auto;
|
|
}
|
|
|
|
#index {
|
|
padding: 0 1em;
|
|
}
|
|
|
|
@media screen and (min-width: 1025px) {
|
|
#main-wrapper {
|
|
flex-direction: row;
|
|
}
|
|
#contents-wrapper, #index {
|
|
overflow: auto;
|
|
}
|
|
}
|
|
|
|
h1 a, h2 a, h3 a, h4 a, h5 a {
|
|
text-decoration: none;
|
|
color: #333;
|
|
}
|
|
|
|
a.hdr {
|
|
visibility: hidden;
|
|
}
|
|
h1:hover > a.hdr, h2:hover > a.hdr, h3:hover > a.hdr, h4:hover > a.hdr, h5:hover > a.hdr {
|
|
visibility: visible;
|
|
}
|
|
|
|
@media (prefers-color-scheme: dark) {
|
|
body{
|
|
background-color:#111;
|
|
color: #bbb;
|
|
}
|
|
a {
|
|
color: #88f;
|
|
}
|
|
table, th, td {
|
|
border-color: grey;
|
|
}
|
|
.t2_0 {
|
|
color: grey;
|
|
}
|
|
.t31_1 {
|
|
color: red;
|
|
}
|
|
.t32_1 {
|
|
color: green;
|
|
}
|
|
.t36_1 {
|
|
color: #0086b3;
|
|
}
|
|
pre > code {
|
|
color: #ccc;
|
|
background: #222;
|
|
}
|
|
.tok-kw {
|
|
color: #eee;
|
|
}
|
|
.tok-str {
|
|
color: #2e5;
|
|
}
|
|
.tok-builtin {
|
|
color: #ff894c;
|
|
}
|
|
.tok-comment {
|
|
color: #aa7;
|
|
}
|
|
.tok-fn {
|
|
color: #e33;
|
|
}
|
|
.tok-null {
|
|
color: #ff8080;
|
|
}
|
|
.tok-number {
|
|
color: #ff8080;
|
|
}
|
|
.tok-type {
|
|
color: #68f;
|
|
}
|
|
h1 a, h2 a, h3 a, h4 a, h5 a {
|
|
color: #aaa;
|
|
}
|
|
}
|
|
</style>
|
|
</head>
|
|
<body>
|
|
<div id="main-wrapper">
|
|
<div id="index">
|
|
<a href="https://ziglang.org/documentation/0.1.1/">0.1.1</a> |
|
|
<a href="https://ziglang.org/documentation/0.2.0/">0.2.0</a> |
|
|
<a href="https://ziglang.org/documentation/0.3.0/">0.3.0</a> |
|
|
<a href="https://ziglang.org/documentation/0.4.0/">0.4.0</a> |
|
|
<a href="https://ziglang.org/documentation/0.5.0/">0.5.0</a> |
|
|
<a href="https://ziglang.org/documentation/0.6.0/">0.6.0</a> |
|
|
master
|
|
<h1>Index</h1>
|
|
{#nav#}
|
|
</div>
|
|
<div id="contents-wrapper"><div id="contents">
|
|
{#header_open|Introduction#}
|
|
<p>
|
|
Zig is a general-purpose programming language and toolchain for maintaining
|
|
<strong>robust</strong>, <strong>optimal</strong>, and <strong>reusable</strong> software.
|
|
</p>
|
|
<ul>
|
|
<li><strong>Robust</strong> - behavior is correct even for edge cases such as out of memory.</li>
|
|
<li><strong>Optimal</strong> - write programs the best way they can behave and perform.</li>
|
|
<li><strong>Reusable</strong> - the same code works in many environments which have different
|
|
constraints.</li>
|
|
<li><strong>Maintainable</strong> - 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.</li>
|
|
</ul>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
If you search for something specific in this documentation and do not find it,
|
|
please <a href="https://github.com/ziglang/www.ziglang.org/issues/new?title=I%20searched%20for%20___%20in%20the%20docs%20and%20didn%27t%20find%20it">file an issue</a> or <a href="https://webchat.freenode.net/?channels=%23zig">say something on IRC</a>.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
<a href="https://github.com/ziglang/zig/wiki/FAQ#where-is-the-documentation-for-the-zig-standard-library">Where is the documentation for the Zig standard library?</a>
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Hello World#}
|
|
|
|
{#code_begin|exe|hello#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() !void {
|
|
const stdout = std.io.getStdOut().outStream();
|
|
try stdout.print("Hello, {}!\n", .{"world"});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Usually you don't want to write to stdout. You want to write to stderr. And you
|
|
don't care if it fails. It's more like a <em>warning message</em> that you want
|
|
to emit. For that you can use a simpler API:
|
|
</p>
|
|
{#code_begin|exe|hello#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
pub fn main() void {
|
|
warn("Hello, world!\n", .{});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Note that you can leave off the {#syntax#}!{#endsyntax#} from the return type because {#syntax#}warn{#endsyntax#} cannot fail.
|
|
</p>
|
|
{#see_also|Values|@import|Errors|Root Source File#}
|
|
{#header_close#}
|
|
{#header_open|Comments#}
|
|
{#code_begin|test|comments#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "comments" {
|
|
// Comments in Zig start with "//" and end at the next LF byte (end of line).
|
|
// The below line is a comment, and won't be executed.
|
|
|
|
//assert(false);
|
|
|
|
const x = true; // another comment
|
|
assert(x);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
There are no multiline comments in Zig (e.g. like <code class="c">/* */</code>
|
|
comments in C). This helps allow Zig to have the property that each line
|
|
of code can be tokenized out of context.
|
|
</p>
|
|
{#header_open|Doc comments#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|syntax|doc_comments#}
|
|
/// A structure for storing a timestamp, with nanosecond precision (this is a
|
|
/// multiline doc comment).
|
|
const Timestamp = struct {
|
|
/// The number of seconds since the epoch (this is also a doc comment).
|
|
seconds: i64, // signed so we can represent pre-1970 (not a doc comment)
|
|
/// The number of nanoseconds past the second (doc comment again).
|
|
nanos: u32,
|
|
|
|
/// Returns a `Timestamp` struct representing the Unix epoch; that is, the
|
|
/// moment of 1970 Jan 1 00:00:00 UTC (this is a doc comment too).
|
|
pub fn unixEpoch() Timestamp {
|
|
return Timestamp{
|
|
.seconds = 0,
|
|
.nanos = 0,
|
|
};
|
|
}
|
|
};
|
|
{#code_end#}
|
|
<p>
|
|
Doc comments are only allowed in certain places; eventually, it will
|
|
become 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.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Values#}
|
|
{#code_begin|exe|values#}
|
|
// Top-level declarations are order-independent:
|
|
const warn = std.debug.warn;
|
|
const std = @import("std");
|
|
const os = std.os;
|
|
const assert = std.debug.assert;
|
|
|
|
pub fn main() void {
|
|
// integers
|
|
const one_plus_one: i32 = 1 + 1;
|
|
warn("1 + 1 = {}\n", .{one_plus_one});
|
|
|
|
// floats
|
|
const seven_div_three: f32 = 7.0 / 3.0;
|
|
warn("7.0 / 3.0 = {}\n", .{seven_div_three});
|
|
|
|
// boolean
|
|
warn("{}\n{}\n{}\n", .{
|
|
true and false,
|
|
true or false,
|
|
!true,
|
|
});
|
|
|
|
// optional
|
|
var optional_value: ?[]const u8 = null;
|
|
assert(optional_value == null);
|
|
|
|
warn("\noptional 1\ntype: {}\nvalue: {}\n", .{
|
|
@typeName(@TypeOf(optional_value)),
|
|
optional_value,
|
|
});
|
|
|
|
optional_value = "hi";
|
|
assert(optional_value != null);
|
|
|
|
warn("\noptional 2\ntype: {}\nvalue: {}\n", .{
|
|
@typeName(@TypeOf(optional_value)),
|
|
optional_value,
|
|
});
|
|
|
|
// error union
|
|
var number_or_error: anyerror!i32 = error.ArgNotFound;
|
|
|
|
warn("\nerror union 1\ntype: {}\nvalue: {}\n", .{
|
|
@typeName(@TypeOf(number_or_error)),
|
|
number_or_error,
|
|
});
|
|
|
|
number_or_error = 1234;
|
|
|
|
warn("\nerror union 2\ntype: {}\nvalue: {}\n", .{
|
|
@typeName(@TypeOf(number_or_error)),
|
|
number_or_error,
|
|
});
|
|
}
|
|
{#code_end#}
|
|
{#header_open|Primitive Types#}
|
|
<div class="table-wrapper">
|
|
<table>
|
|
<tr>
|
|
<th>
|
|
Name
|
|
</th>
|
|
<th>
|
|
C Equivalent
|
|
</th>
|
|
<th>
|
|
Description
|
|
</th>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}i8{#endsyntax#}</td>
|
|
<td><code class="c">int8_t</code></td>
|
|
<td>signed 8-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}u8{#endsyntax#}</td>
|
|
<td><code class="c">uint8_t</code></td>
|
|
<td>unsigned 8-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}i16{#endsyntax#}</td>
|
|
<td><code class="c">int16_t</code></td>
|
|
<td>signed 16-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}u16{#endsyntax#}</td>
|
|
<td><code class="c">uint16_t</code></td>
|
|
<td>unsigned 16-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}i32{#endsyntax#}</td>
|
|
<td><code class="c">int32_t</code></td>
|
|
<td>signed 32-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}u32{#endsyntax#}</td>
|
|
<td><code class="c">uint32_t</code></td>
|
|
<td>unsigned 32-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}i64{#endsyntax#}</td>
|
|
<td><code class="c">int64_t</code></td>
|
|
<td>signed 64-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}u64{#endsyntax#}</td>
|
|
<td><code class="c">uint64_t</code></td>
|
|
<td>unsigned 64-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}i128{#endsyntax#}</td>
|
|
<td><code class="c">__int128</code></td>
|
|
<td>signed 128-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}u128{#endsyntax#}</td>
|
|
<td><code class="c">unsigned __int128</code></td>
|
|
<td>unsigned 128-bit integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}isize{#endsyntax#}</td>
|
|
<td><code class="c">intptr_t</code></td>
|
|
<td>signed pointer sized integer</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}usize{#endsyntax#}</td>
|
|
<td><code class="c">uintptr_t</code></td>
|
|
<td>unsigned pointer sized integer</td>
|
|
</tr>
|
|
|
|
<tr>
|
|
<td>{#syntax#}c_short{#endsyntax#}</td>
|
|
<td><code class="c">short</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_ushort{#endsyntax#}</td>
|
|
<td><code class="c">unsigned short</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_int{#endsyntax#}</td>
|
|
<td><code class="c">int</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_uint{#endsyntax#}</td>
|
|
<td><code class="c">unsigned int</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_long{#endsyntax#}</td>
|
|
<td><code class="c">long</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_ulong{#endsyntax#}</td>
|
|
<td><code class="c">unsigned long</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_longlong{#endsyntax#}</td>
|
|
<td><code class="c">long long</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_ulonglong{#endsyntax#}</td>
|
|
<td><code class="c">unsigned long long</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_longdouble{#endsyntax#}</td>
|
|
<td><code class="c">long double</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}c_void{#endsyntax#}</td>
|
|
<td><code class="c">void</code></td>
|
|
<td>for ABI compatibility with C</td>
|
|
</tr>
|
|
|
|
<tr>
|
|
<td>{#syntax#}f16{#endsyntax#}</td>
|
|
<td><code class="c">_Float16</code></td>
|
|
<td>16-bit floating point (10-bit mantissa) IEEE-754-2008 binary16</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}f32{#endsyntax#}</td>
|
|
<td><code class="c">float</code></td>
|
|
<td>32-bit floating point (23-bit mantissa) IEEE-754-2008 binary32</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}f64{#endsyntax#}</td>
|
|
<td><code class="c">double</code></td>
|
|
<td>64-bit floating point (52-bit mantissa) IEEE-754-2008 binary64</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}f128{#endsyntax#}</td>
|
|
<td><code class="c">_Float128</code></td>
|
|
<td>128-bit floating point (112-bit mantissa) IEEE-754-2008 binary128</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}bool{#endsyntax#}</td>
|
|
<td><code class="c">bool</code></td>
|
|
<td>{#syntax#}true{#endsyntax#} or {#syntax#}false{#endsyntax#}</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}void{#endsyntax#}</td>
|
|
<td>(none)</td>
|
|
<td>0 bit type</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}noreturn{#endsyntax#}</td>
|
|
<td>(none)</td>
|
|
<td>the type of {#syntax#}break{#endsyntax#}, {#syntax#}continue{#endsyntax#}, {#syntax#}return{#endsyntax#}, {#syntax#}unreachable{#endsyntax#}, and {#syntax#}while (true) {}{#endsyntax#}</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}type{#endsyntax#}</td>
|
|
<td>(none)</td>
|
|
<td>the type of types</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}anyerror{#endsyntax#}</td>
|
|
<td>(none)</td>
|
|
<td>an error code</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}comptime_int{#endsyntax#}</td>
|
|
<td>(none)</td>
|
|
<td>Only allowed for {#link|comptime#}-known values. The type of integer literals.</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}comptime_float{#endsyntax#}</td>
|
|
<td>(none)</td>
|
|
<td>Only allowed for {#link|comptime#}-known values. The type of float literals.</td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<p>
|
|
In addition to the integer types above, arbitrary bit-width integers can be referenced by using
|
|
an identifier of <code>i</code> or <code>u</code> 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#}.
|
|
</p>
|
|
{#see_also|Integers|Floats|void|Errors|@Type#}
|
|
{#header_close#}
|
|
{#header_open|Primitive Values#}
|
|
<div class="table-wrapper">
|
|
<table>
|
|
<tr>
|
|
<th>
|
|
Name
|
|
</th>
|
|
<th>
|
|
Description
|
|
</th>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}true{#endsyntax#} and {#syntax#}false{#endsyntax#}</td>
|
|
<td>{#syntax#}bool{#endsyntax#} values</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}null{#endsyntax#}</td>
|
|
<td>used to set an optional type to {#syntax#}null{#endsyntax#}</td>
|
|
</tr>
|
|
<tr>
|
|
<td>{#syntax#}undefined{#endsyntax#}</td>
|
|
<td>used to leave a value unspecified</td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
{#see_also|Optionals|undefined#}
|
|
{#header_close#}
|
|
{#header_open|String Literals and Character Literals#}
|
|
<p>
|
|
String literals are single-item constant {#link|Pointers#} to null-terminated UTF-8 encoded 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#}.
|
|
</p>
|
|
<p>
|
|
Character literals have type {#syntax#}comptime_int{#endsyntax#}, the same as
|
|
{#link|Integer Literals#}. All {#link|Escape Sequences#} are valid in both string literals
|
|
and character literals.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
const mem = @import("std").mem;
|
|
|
|
test "string literals" {
|
|
const bytes = "hello";
|
|
assert(@TypeOf(bytes) == *const [5:0]u8);
|
|
assert(bytes.len == 5);
|
|
assert(bytes[1] == 'e');
|
|
assert(bytes[5] == 0);
|
|
assert('e' == '\x65');
|
|
assert('\u{1f4a9}' == 128169);
|
|
assert('💯' == 128175);
|
|
assert(mem.eql(u8, "hello", "h\x65llo"));
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Arrays|Zig Test|Source Encoding#}
|
|
{#header_open|Escape Sequences#}
|
|
<div class="table-wrapper">
|
|
<table>
|
|
<tr>
|
|
<th>
|
|
Escape Sequence
|
|
</th>
|
|
<th>
|
|
Name
|
|
</th>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\n</code></td>
|
|
<td>Newline</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\r</code></td>
|
|
<td>Carriage Return</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\t</code></td>
|
|
<td>Tab</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\\</code></td>
|
|
<td>Backslash</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\'</code></td>
|
|
<td>Single Quote</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\"</code></td>
|
|
<td>Double Quote</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\xNN</code></td>
|
|
<td>hexadecimal 8-bit character code (2 digits)</td>
|
|
</tr>
|
|
<tr>
|
|
<td><code>\u{NNNNNN}</code></td>
|
|
<td>hexadecimal Unicode character code UTF-8 encoded (1 or more digits)</td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<p>Note that the maximum valid Unicode point is {#syntax#}0x10ffff{#endsyntax#}.</p>
|
|
{#header_close#}
|
|
{#header_open|Multiline String Literals#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const hello_world_in_c =
|
|
\\#include <stdio.h>
|
|
\\
|
|
\\int main(int argc, char **argv) {
|
|
\\ printf("hello world\n");
|
|
\\ return 0;
|
|
\\}
|
|
;
|
|
{#code_end#}
|
|
{#see_also|@embedFile#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Assignment#}
|
|
<p>Use the {#syntax#}const{#endsyntax#} keyword to assign a value to an identifier:</p>
|
|
{#code_begin|test_err|cannot assign to constant#}
|
|
const x = 1234;
|
|
|
|
fn foo() void {
|
|
// It works at global scope as well as inside functions.
|
|
const y = 5678;
|
|
|
|
// Once assigned, an identifier cannot be changed.
|
|
y += 1;
|
|
}
|
|
|
|
test "assignment" {
|
|
foo();
|
|
}
|
|
{#code_end#}
|
|
<p>{#syntax#}const{#endsyntax#} applies to all of the bytes that the identifier immediately addresses. {#link|Pointers#} have their own const-ness.</p>
|
|
<p>If you need a variable that you can modify, use the {#syntax#}var{#endsyntax#} keyword:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "var" {
|
|
var y: i32 = 5678;
|
|
|
|
y += 1;
|
|
|
|
assert(y == 5679);
|
|
}
|
|
{#code_end#}
|
|
<p>Variables must be initialized:</p>
|
|
{#code_begin|test_err#}
|
|
test "initialization" {
|
|
var x: i32;
|
|
|
|
x = 1;
|
|
}
|
|
{#code_end#}
|
|
{#header_open|undefined#}
|
|
<p>Use {#syntax#}undefined{#endsyntax#} to leave variables uninitialized:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "init with undefined" {
|
|
var x: i32 = undefined;
|
|
x = 1;
|
|
assert(x == 1);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#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."
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Variables#}
|
|
<p>
|
|
A variable is a unit of {#link|Memory#} storage.
|
|
</p>
|
|
<p>
|
|
Variables are never allowed to shadow identifiers from an outer scope.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_open|Global Variables#}
|
|
<p>
|
|
Global variables are considered to be a top level declaration, which means that they are
|
|
order-independent and lazily analyzed. The initialization value of global variables is implicitly
|
|
{#link|comptime#}. If a global variable is {#syntax#}const{#endsyntax#} then its value is
|
|
{#syntax#}comptime{#endsyntax#}-known, otherwise it is runtime-known.
|
|
</p>
|
|
{#code_begin|test|global_variables#}
|
|
var y: i32 = add(10, x);
|
|
const x: i32 = add(12, 34);
|
|
|
|
test "global variables" {
|
|
assert(x == 46);
|
|
assert(y == 56);
|
|
}
|
|
|
|
fn add(a: i32, b: i32) i32 {
|
|
return a + b;
|
|
}
|
|
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
{#code_end#}
|
|
<p>
|
|
Global variables may be declared inside a {#link|struct#}, {#link|union#}, or {#link|enum#}:
|
|
</p>
|
|
{#code_begin|test|namespaced_global#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "namespaced global variable" {
|
|
assert(foo() == 1235);
|
|
assert(foo() == 1236);
|
|
}
|
|
|
|
fn foo() i32 {
|
|
const S = struct {
|
|
var x: i32 = 1234;
|
|
};
|
|
S.x += 1;
|
|
return S.x;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
The {#syntax#}extern{#endsyntax#} keyword 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.
|
|
</p>
|
|
{#see_also|Exporting a C Library#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Thread Local Variables#}
|
|
<p>A variable may be specified to be a thread-local variable using the
|
|
{#syntax#}threadlocal{#endsyntax#} keyword:</p>
|
|
{#code_begin|test|tls#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
threadlocal var x: i32 = 1234;
|
|
|
|
test "thread local storage" {
|
|
const thread1 = try std.Thread.spawn({}, testTls);
|
|
const thread2 = try std.Thread.spawn({}, testTls);
|
|
testTls({});
|
|
thread1.wait();
|
|
thread2.wait();
|
|
}
|
|
|
|
fn testTls(context: void) void {
|
|
assert(x == 1234);
|
|
x += 1;
|
|
assert(x == 1235);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
For {#link|Single Threaded Builds#}, all thread local variables are treated as {#link|Global Variables#}.
|
|
</p>
|
|
<p>
|
|
Thread local variables may not be {#syntax#}const{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Local Variables#}
|
|
<p>
|
|
Local variables occur inside {#link|Functions#}, {#link|comptime#} blocks, and {#link|@cImport#} blocks.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|test|comptime_vars#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "comptime vars" {
|
|
var x: i32 = 1;
|
|
comptime var y: i32 = 1;
|
|
|
|
x += 1;
|
|
y += 1;
|
|
|
|
assert(x == 2);
|
|
assert(y == 2);
|
|
|
|
if (y != 2) {
|
|
// This compile error never triggers because y is a comptime variable,
|
|
// and so `y != 2` is a comptime value, and this if is statically evaluated.
|
|
@compileError("wrong y value");
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Integers#}
|
|
{#header_open|Integer Literals#}
|
|
{#code_begin|syntax#}
|
|
const decimal_int = 98222;
|
|
const hex_int = 0xff;
|
|
const another_hex_int = 0xFF;
|
|
const octal_int = 0o755;
|
|
const binary_int = 0b11110000;
|
|
|
|
// underscores may be placed between two digits as a visual separator
|
|
const one_billion = 1_000_000_000;
|
|
const binary_mask = 0b1_1111_1111;
|
|
const permissions = 0o7_5_5;
|
|
const big_address = 0xFF80_0000_0000_0000;
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Runtime Integer Values#}
|
|
<p>
|
|
Integer literals have no size limitation, and if any undefined behavior occurs,
|
|
the compiler catches it.
|
|
</p>
|
|
<p>
|
|
However, once an integer value is no longer known at compile-time, it must have a
|
|
known size, and is vulnerable to undefined behavior.
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn divide(a: i32, b: i32) i32 {
|
|
return a / b;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<p>
|
|
Operators such as {#syntax#}+{#endsyntax#} and {#syntax#}-{#endsyntax#} cause undefined behavior on
|
|
integer overflow. Also available are operations such as {#syntax#}+%{#endsyntax#} and
|
|
{#syntax#}-%{#endsyntax#} which are defined to have wrapping arithmetic on all targets.
|
|
</p>
|
|
<p>
|
|
Zig supports arbitrary bit-width integers, referenced by using
|
|
an identifier of <code>i</code> or <code>u</code> 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#}.
|
|
</p>
|
|
{#see_also|Wrapping Operations#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Floats#}
|
|
<p>Zig has the following floating point types:</p>
|
|
<ul>
|
|
<li>{#syntax#}f16{#endsyntax#} - IEEE-754-2008 binary16</li>
|
|
<li>{#syntax#}f32{#endsyntax#} - IEEE-754-2008 binary32</li>
|
|
<li>{#syntax#}f64{#endsyntax#} - IEEE-754-2008 binary64</li>
|
|
<li>{#syntax#}f128{#endsyntax#} - IEEE-754-2008 binary128</li>
|
|
<li>{#syntax#}c_longdouble{#endsyntax#} - matches <code class="c">long double</code> for the target C ABI</li>
|
|
</ul>
|
|
{#header_open|Float Literals#}
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<p>
|
|
Float literals {#link|coerce|Type Coercion#} to any floating point type,
|
|
and to any {#link|integer|Integers#} type when there is no fractional component.
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const floating_point = 123.0E+77;
|
|
const another_float = 123.0;
|
|
const yet_another = 123.0e+77;
|
|
|
|
const hex_floating_point = 0x103.70p-5;
|
|
const another_hex_float = 0x103.70;
|
|
const yet_another_hex_float = 0x103.70P-5;
|
|
|
|
// underscores may be placed between two digits as a visual separator
|
|
const lightspeed = 299_792_458.000_000;
|
|
const nanosecond = 0.000_000_001;
|
|
const more_hex = 0x1234_5678.9ABC_CDEFp-10;
|
|
{#code_end#}
|
|
<p>
|
|
There is no syntax for NaN, infinity, or negative infinity. For these special values,
|
|
one must use the standard library:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const std = @import("std");
|
|
|
|
const inf = std.math.inf(f32);
|
|
const negative_inf = -std.math.inf(f64);
|
|
const nan = std.math.nan(f128);
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Floating Point Operations#}
|
|
<p>By default floating point operations use {#syntax#}Strict{#endsyntax#} mode,
|
|
but you can switch to {#syntax#}Optimized{#endsyntax#} mode on a per-block basis:</p>
|
|
{#code_begin|obj|foo#}
|
|
{#code_release_fast#}
|
|
const std = @import("std");
|
|
const builtin = std.builtin;
|
|
const big = @as(f64, 1 << 40);
|
|
|
|
export fn foo_strict(x: f64) f64 {
|
|
return x + big - big;
|
|
}
|
|
|
|
export fn foo_optimized(x: f64) f64 {
|
|
@setFloatMode(.Optimized);
|
|
return x + big - big;
|
|
}
|
|
{#code_end#}
|
|
<p>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.</p>
|
|
{#code_begin|exe|float_mode#}
|
|
{#code_link_object|foo#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
extern fn foo_strict(x: f64) f64;
|
|
extern fn foo_optimized(x: f64) f64;
|
|
|
|
pub fn main() void {
|
|
const x = 0.001;
|
|
warn("optimized = {}\n", .{foo_optimized(x)});
|
|
warn("strict = {}\n", .{foo_strict(x)});
|
|
}
|
|
{#code_end#}
|
|
{#see_also|@setFloatMode|Division by Zero#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Operators#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_open|Table of Operators#}
|
|
<div class="table-wrapper">
|
|
<table>
|
|
<tr>
|
|
<th>
|
|
Syntax
|
|
</th>
|
|
<th>
|
|
Relevant Types
|
|
</th>
|
|
<th>
|
|
Description
|
|
</th>
|
|
<th>
|
|
Example
|
|
</th>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a + b
|
|
a += b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Addition.
|
|
<ul>
|
|
<li>Can cause {#link|overflow|Default Operations#} for integers.</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
<li>See also {#link|@addWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}2 + 5 == 7{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a +% b
|
|
a +%= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Wrapping Addition.
|
|
<ul>
|
|
<li>Guaranteed to have twos-complement wrapping behavior.</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
<li>See also {#link|@addWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}@as(u32, std.math.maxInt(u32)) +% 1 == 0{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a - b
|
|
a -= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Subtraction.
|
|
<ul>
|
|
<li>Can cause {#link|overflow|Default Operations#} for integers.</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
<li>See also {#link|@subWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}2 - 5 == -3{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a -% b
|
|
a -%= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Wrapping Subtraction.
|
|
<ul>
|
|
<li>Guaranteed to have twos-complement wrapping behavior.</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
<li>See also {#link|@subWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}@as(u32, 0) -% 1 == std.math.maxInt(u32){#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}-a{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Negation.
|
|
<ul>
|
|
<li>Can cause {#link|overflow|Default Operations#} for integers.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}-1 == 0 - 1{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}-%a{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Wrapping Negation.
|
|
<ul>
|
|
<li>Guaranteed to have twos-complement wrapping behavior.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}-%@as(i32, std.math.minInt(i32)) == std.math.minInt(i32){#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a * b
|
|
a *= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Multiplication.
|
|
<ul>
|
|
<li>Can cause {#link|overflow|Default Operations#} for integers.</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
<li>See also {#link|@mulWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}2 * 5 == 10{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a *% b
|
|
a *%= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Wrapping Multiplication.
|
|
<ul>
|
|
<li>Guaranteed to have twos-complement wrapping behavior.</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
<li>See also {#link|@mulWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}@as(u8, 200) *% 2 == 144{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a / b
|
|
a /= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Division.
|
|
<ul>
|
|
<li>Can cause {#link|overflow|Default Operations#} for integers.</li>
|
|
<li>Can cause {#link|Division by Zero#} for integers.</li>
|
|
<li>Can cause {#link|Division by Zero#} for floats in {#link|FloatMode.Optimized Mode|Floating Point Operations#}.</li>
|
|
<li>For non-compile-time-known signed integers, must use
|
|
{#link|@divTrunc#},
|
|
{#link|@divFloor#}, or
|
|
{#link|@divExact#} instead of {#syntax#}/{#endsyntax#}.
|
|
</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}10 / 5 == 2{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a % b
|
|
a %= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Remainder Division.
|
|
<ul>
|
|
<li>Can cause {#link|Division by Zero#} for integers.</li>
|
|
<li>Can cause {#link|Division by Zero#} for floats in {#link|FloatMode.Optimized Mode|Floating Point Operations#}.</li>
|
|
<li>For non-compile-time-known signed integers, must use
|
|
{#link|@rem#} or
|
|
{#link|@mod#} instead of {#syntax#}%{#endsyntax#}.
|
|
</li>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}10 % 3 == 1{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a << b
|
|
a <<= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Bit Shift Left.
|
|
<ul>
|
|
<li>{#syntax#}b{#endsyntax#} must be {#link|comptime-known|comptime#} or have a type with log2 number of bits as {#syntax#}a{#endsyntax#}.</li>
|
|
<li>See also {#link|@shlExact#}.</li>
|
|
<li>See also {#link|@shlWithOverflow#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}1 << 8 == 256{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a >> b
|
|
a >>= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Bit Shift Right.
|
|
<ul>
|
|
<li>{#syntax#}b{#endsyntax#} must be {#link|comptime-known|comptime#} or have a type with log2 number of bits as {#syntax#}a{#endsyntax#}.</li>
|
|
<li>See also {#link|@shrExact#}.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}10 >> 1 == 5{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a & b
|
|
a &= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Bitwise AND.
|
|
<ul>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}0b011 & 0b101 == 0b001{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a | b
|
|
a |= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Bitwise OR.
|
|
<ul>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}0b010 | 0b100 == 0b110{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a ^ b
|
|
a ^= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>Bitwise XOR.
|
|
<ul>
|
|
<li>Invokes {#link|Peer Type Resolution#} for the operands.</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}0b011 ^ 0b101 == 0b110{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}~a{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Bitwise NOT.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}~@as(u8, 0b10101111) == 0b01010000{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a orelse b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Optionals#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>If {#syntax#}a{#endsyntax#} is {#syntax#}null{#endsyntax#},
|
|
returns {#syntax#}b{#endsyntax#} ("default value"),
|
|
otherwise returns the unwrapped value of {#syntax#}a{#endsyntax#}.
|
|
Note that {#syntax#}b{#endsyntax#} may be a value of type {#link|noreturn#}.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const value: ?u32 = null;
|
|
const unwrapped = value orelse 1234;
|
|
unwrapped == 1234{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a.?{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Optionals#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Equivalent to:
|
|
<pre>{#syntax#}a orelse unreachable{#endsyntax#}</pre>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const value: ?u32 = 5678;
|
|
value.? == 5678{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a catch b
|
|
a catch |err| b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Error Unions|Errors#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>If {#syntax#}a{#endsyntax#} is an {#syntax#}error{#endsyntax#},
|
|
returns {#syntax#}b{#endsyntax#} ("default value"),
|
|
otherwise returns the unwrapped value of {#syntax#}a{#endsyntax#}.
|
|
Note that {#syntax#}b{#endsyntax#} may be a value of type {#link|noreturn#}.
|
|
{#syntax#}err{#endsyntax#} is the {#syntax#}error{#endsyntax#} and is in scope of the expression {#syntax#}b{#endsyntax#}.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const value: anyerror!u32 = error.Broken;
|
|
const unwrapped = value catch 1234;
|
|
unwrapped == 1234{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a and b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|bool|Primitive Types#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
If {#syntax#}a{#endsyntax#} is {#syntax#}false{#endsyntax#}, returns {#syntax#}false{#endsyntax#}
|
|
without evaluating {#syntax#}b{#endsyntax#}. Otherwise, returns {#syntax#}b{#endsyntax#}.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(false and true) == false{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a or b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|bool|Primitive Types#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
If {#syntax#}a{#endsyntax#} is {#syntax#}true{#endsyntax#}, returns {#syntax#}true{#endsyntax#}
|
|
without evaluating {#syntax#}b{#endsyntax#}. Otherwise, returns {#syntax#}b{#endsyntax#}.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}false or true == true{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}!a{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|bool|Primitive Types#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Boolean NOT.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}!false == true{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a == b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
<li>{#link|bool|Primitive Types#}</li>
|
|
<li>{#link|type|Primitive Types#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}true{#endsyntax#} if a and b are equal, otherwise returns {#syntax#}false{#endsyntax#}.
|
|
Invokes {#link|Peer Type Resolution#} for the operands.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(1 == 1) == true{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a == null{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Optionals#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}true{#endsyntax#} if a is {#syntax#}null{#endsyntax#}, otherwise returns {#syntax#}false{#endsyntax#}.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const value: ?u32 = null;
|
|
value == null{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a != b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
<li>{#link|bool|Primitive Types#}</li>
|
|
<li>{#link|type|Primitive Types#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}false{#endsyntax#} if a and b are equal, otherwise returns {#syntax#}true{#endsyntax#}.
|
|
Invokes {#link|Peer Type Resolution#} for the operands.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(1 != 1) == false{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a > b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}true{#endsyntax#} if a is greater than b, otherwise returns {#syntax#}false{#endsyntax#}.
|
|
Invokes {#link|Peer Type Resolution#} for the operands.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(2 > 1) == true{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a >= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}true{#endsyntax#} if a is greater than or equal to b, otherwise returns {#syntax#}false{#endsyntax#}.
|
|
Invokes {#link|Peer Type Resolution#} for the operands.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(2 >= 1) == true{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a < b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}true{#endsyntax#} if a is less than b, otherwise returns {#syntax#}false{#endsyntax#}.
|
|
Invokes {#link|Peer Type Resolution#} for the operands.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(1 < 2) == true{#endsyntax#}></pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a <= b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Integers#}</li>
|
|
<li>{#link|Floats#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Returns {#syntax#}true{#endsyntax#} if a is less than or equal to b, otherwise returns {#syntax#}false{#endsyntax#}.
|
|
Invokes {#link|Peer Type Resolution#} for the operands.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}(1 <= 2) == true{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a ++ b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Arrays#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Array concatenation.
|
|
<ul>
|
|
<li>Only available when {#syntax#}a{#endsyntax#} and {#syntax#}b{#endsyntax#} are {#link|compile-time known|comptime#}.
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#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#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a ** b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Arrays#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Array multiplication.
|
|
<ul>
|
|
<li>Only available when {#syntax#}a{#endsyntax#} and {#syntax#}b{#endsyntax#} are {#link|compile-time known|comptime#}.
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const mem = @import("std").mem;
|
|
const pattern = "ab" ** 3;
|
|
mem.eql(u8, pattern, "ababab"){#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a.*{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Pointers#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
Pointer dereference.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const x: u32 = 1234;
|
|
const ptr = &x;
|
|
ptr.* == 1234{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}&a{#endsyntax#}</pre></td>
|
|
<td>
|
|
All types
|
|
</td>
|
|
<td>
|
|
Address of.
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const x: u32 = 1234;
|
|
const ptr = &x;
|
|
ptr.* == 1234{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><pre>{#syntax#}a || b{#endsyntax#}</pre></td>
|
|
<td>
|
|
<ul>
|
|
<li>{#link|Error Set Type#}</li>
|
|
</ul>
|
|
</td>
|
|
<td>
|
|
{#link|Merging Error Sets#}
|
|
</td>
|
|
<td>
|
|
<pre>{#syntax#}const A = error{One};
|
|
const B = error{Two};
|
|
(A || B) == error{One, Two}{#endsyntax#}</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
{#header_close#}
|
|
{#header_open|Precedence#}
|
|
<pre>{#syntax#}x() x[] x.y
|
|
a!b
|
|
!x -x -%x ~x &x ?x
|
|
x{} x.* x.?
|
|
! * / % ** *% ||
|
|
+ - ++ +% -%
|
|
<< >>
|
|
& ^ |
|
|
== != < > <= >=
|
|
and
|
|
or
|
|
orelse catch
|
|
= *= /= %= += -= <<= >>= &= ^= |={#endsyntax#}</pre>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Arrays#}
|
|
{#code_begin|test|arrays#}
|
|
const assert = @import("std").debug.assert;
|
|
const mem = @import("std").mem;
|
|
|
|
// array literal
|
|
const message = [_]u8{ 'h', 'e', 'l', 'l', 'o' };
|
|
|
|
// get the size of an array
|
|
comptime {
|
|
assert(message.len == 5);
|
|
}
|
|
|
|
// A string literal is a pointer to an array literal.
|
|
const same_message = "hello";
|
|
|
|
comptime {
|
|
assert(mem.eql(u8, &message, same_message));
|
|
}
|
|
|
|
test "iterate over an array" {
|
|
var sum: usize = 0;
|
|
for (message) |byte| {
|
|
sum += byte;
|
|
}
|
|
assert(sum == 'h' + 'e' + 'l' * 2 + 'o');
|
|
}
|
|
|
|
// modifiable array
|
|
var some_integers: [100]i32 = undefined;
|
|
|
|
test "modify an array" {
|
|
for (some_integers) |*item, i| {
|
|
item.* = @intCast(i32, i);
|
|
}
|
|
assert(some_integers[10] == 10);
|
|
assert(some_integers[99] == 99);
|
|
}
|
|
|
|
// array concatenation works if the values are known
|
|
// at compile time
|
|
const part_one = [_]i32{ 1, 2, 3, 4 };
|
|
const part_two = [_]i32{ 5, 6, 7, 8 };
|
|
const all_of_it = part_one ++ part_two;
|
|
comptime {
|
|
assert(mem.eql(i32, &all_of_it, &[_]i32{ 1, 2, 3, 4, 5, 6, 7, 8 }));
|
|
}
|
|
|
|
// remember that string literals are arrays
|
|
const hello = "hello";
|
|
const world = "world";
|
|
const hello_world = hello ++ " " ++ world;
|
|
comptime {
|
|
assert(mem.eql(u8, hello_world, "hello world"));
|
|
}
|
|
|
|
// ** does repeating patterns
|
|
const pattern = "ab" ** 3;
|
|
comptime {
|
|
assert(mem.eql(u8, pattern, "ababab"));
|
|
}
|
|
|
|
// initialize an array to zero
|
|
const all_zero = [_]u16{0} ** 10;
|
|
|
|
comptime {
|
|
assert(all_zero.len == 10);
|
|
assert(all_zero[5] == 0);
|
|
}
|
|
|
|
// use compile-time code to initialize an array
|
|
var fancy_array = init: {
|
|
var initial_value: [10]Point = undefined;
|
|
for (initial_value) |*pt, i| {
|
|
pt.* = Point{
|
|
.x = @intCast(i32, i),
|
|
.y = @intCast(i32, i) * 2,
|
|
};
|
|
}
|
|
break :init initial_value;
|
|
};
|
|
const Point = struct {
|
|
x: i32,
|
|
y: i32,
|
|
};
|
|
|
|
test "compile-time array initalization" {
|
|
assert(fancy_array[4].x == 4);
|
|
assert(fancy_array[4].y == 8);
|
|
}
|
|
|
|
// call a function to initialize an array
|
|
var more_points = [_]Point{makePoint(3)} ** 10;
|
|
fn makePoint(x: i32) Point {
|
|
return Point{
|
|
.x = x,
|
|
.y = x * 2,
|
|
};
|
|
}
|
|
test "array initialization with function calls" {
|
|
assert(more_points[4].x == 3);
|
|
assert(more_points[4].y == 6);
|
|
assert(more_points.len == 10);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|for|Slices#}
|
|
|
|
{#header_open|Anonymous List Literals#}
|
|
<p>Similar to {#link|Enum Literals#} and {#link|Anonymous Struct Literals#}
|
|
the type can be omitted from array literals:</p>
|
|
{#code_begin|test|anon_list#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "anonymous list literal syntax" {
|
|
var array: [4]u8 = .{11, 22, 33, 44};
|
|
assert(array[0] == 11);
|
|
assert(array[1] == 22);
|
|
assert(array[2] == 33);
|
|
assert(array[3] == 44);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
If there is no type in the result location then an anonymous list literal actually
|
|
turns into a {#link|struct#} with numbered field names:
|
|
</p>
|
|
{#code_begin|test|infer_list_literal#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "fully anonymous list literal" {
|
|
dump(.{ @as(u32, 1234), @as(f64, 12.34), true, "hi"});
|
|
}
|
|
|
|
fn dump(args: var) void {
|
|
assert(args.@"0" == 1234);
|
|
assert(args.@"1" == 12.34);
|
|
assert(args.@"2");
|
|
assert(args.@"3"[0] == 'h');
|
|
assert(args.@"3"[1] == 'i');
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Multidimensional Arrays#}
|
|
<p>
|
|
Mutlidimensional arrays can be created by nesting arrays:
|
|
</p>
|
|
{#code_begin|test|multidimensional#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const mat4x4 = [4][4]f32{
|
|
[_]f32{ 1.0, 0.0, 0.0, 0.0 },
|
|
[_]f32{ 0.0, 1.0, 0.0, 1.0 },
|
|
[_]f32{ 0.0, 0.0, 1.0, 0.0 },
|
|
[_]f32{ 0.0, 0.0, 0.0, 1.0 },
|
|
};
|
|
test "multidimensional arrays" {
|
|
// Access the 2D array by indexing the outer array, and then the inner array.
|
|
assert(mat4x4[1][1] == 1.0);
|
|
|
|
// Here we iterate with for loops.
|
|
for (mat4x4) |row, row_index| {
|
|
for (row) |cell, column_index| {
|
|
if (row_index == column_index) {
|
|
assert(cell == 1.0);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Sentinel-Terminated Arrays#}
|
|
<p>
|
|
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 {#syntax#}len{#endsyntax#}.
|
|
</p>
|
|
{#code_begin|test|null_terminated_array#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "null terminated array" {
|
|
const array = [_:0]u8 {1, 2, 3, 4};
|
|
|
|
assert(@TypeOf(array) == [4:0]u8);
|
|
assert(array.len == 4);
|
|
assert(array[4] == 0);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Sentinel-Terminated Pointers|Sentinel-Terminated Slices#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Vectors#}
|
|
<p>
|
|
A vector is a group of {#link|Integers#}, {#link|Floats#}, or {#link|Pointers#} which are operated on
|
|
in parallel using a single instruction ({#link|SIMD#}). Vector types are created with the builtin function {#link|@Type#},
|
|
or using the shorthand as {#syntax#}std.meta.Vector{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
TODO talk about C ABI interop
|
|
</p>
|
|
{#header_open|SIMD#}
|
|
<p>
|
|
TODO Zig's SIMD abilities are just beginning to be fleshed out. Here are some talking points to update the
|
|
docs with:
|
|
* What kind of operations can you do? All the operations on integers and floats? What about mixing scalar and vector?
|
|
* How to convert to/from vectors/arrays
|
|
* How to access individual elements from vectors, how to loop over the elements
|
|
* "shuffle"
|
|
* Advice on writing high perf software, how to abstract the best way
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Pointers#}
|
|
<p>
|
|
Zig has two kinds of pointers:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}*T{#endsyntax#} - pointer to exactly one item.
|
|
<ul>
|
|
<li>Supports deref syntax: {#syntax#}ptr.*{#endsyntax#}</li>
|
|
</ul>
|
|
</li>
|
|
<li>{#syntax#}[*]T{#endsyntax#} - pointer to unknown number of items.
|
|
<ul>
|
|
<li>Supports index syntax: {#syntax#}ptr[i]{#endsyntax#}</li>
|
|
<li>Supports slice syntax: {#syntax#}ptr[start..end]{#endsyntax#}</li>
|
|
<li>Supports pointer arithmetic: {#syntax#}ptr + x{#endsyntax#}, {#syntax#}ptr - x{#endsyntax#}</li>
|
|
<li>{#syntax#}T{#endsyntax#} must have a known size, which means that it cannot be
|
|
{#syntax#}c_void{#endsyntax#} or any other {#link|opaque type|Opaque Types#}.</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<p>These types are closely related to {#link|Arrays#} and {#link|Slices#}:</p>
|
|
<ul>
|
|
<li>{#syntax#}*[N]T{#endsyntax#} - pointer to N items, same as single-item pointer to array.
|
|
<ul>
|
|
<li>Supports index syntax: {#syntax#}array_ptr[i]{#endsyntax#}</li>
|
|
<li>Supports slice syntax: {#syntax#}array_ptr[start..end]{#endsyntax#}</li>
|
|
<li>Supports len property: {#syntax#}array_ptr.len{#endsyntax#}</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<ul>
|
|
<li>{#syntax#}[]T{#endsyntax#} - pointer to runtime-known number of items.
|
|
<ul>
|
|
<li>Supports index syntax: {#syntax#}slice[i]{#endsyntax#}</li>
|
|
<li>Supports slice syntax: {#syntax#}slice[start..end]{#endsyntax#}</li>
|
|
<li>Supports len property: {#syntax#}slice.len{#endsyntax#}</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<p>Use {#syntax#}&x{#endsyntax#} to obtain a single-item pointer:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "address of syntax" {
|
|
// Get the address of a variable:
|
|
const x: i32 = 1234;
|
|
const x_ptr = &x;
|
|
|
|
// Dereference a pointer:
|
|
assert(x_ptr.* == 1234);
|
|
|
|
// When you get the address of a const variable, you get a const pointer to a single item.
|
|
assert(@TypeOf(x_ptr) == *const i32);
|
|
|
|
// If you want to mutate the value, you'd need an address of a mutable variable:
|
|
var y: i32 = 5678;
|
|
const y_ptr = &y;
|
|
assert(@TypeOf(y_ptr) == *i32);
|
|
y_ptr.* += 1;
|
|
assert(y_ptr.* == 5679);
|
|
}
|
|
|
|
test "pointer array access" {
|
|
// Taking an address of an individual element gives a
|
|
// pointer to a single item. This kind of pointer
|
|
// does not support pointer arithmetic.
|
|
var array = [_]u8{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
|
|
const ptr = &array[2];
|
|
assert(@TypeOf(ptr) == *u8);
|
|
|
|
assert(array[2] == 3);
|
|
ptr.* += 1;
|
|
assert(array[2] == 4);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Slices have bounds checking and are therefore protected
|
|
against this kind of undefined behavior. This is one reason
|
|
we prefer slices to pointers.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "pointer slicing" {
|
|
var array = [_]u8{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
|
|
const slice = array[2..4];
|
|
assert(slice.len == 2);
|
|
|
|
assert(array[3] == 4);
|
|
slice[1] += 1;
|
|
assert(array[3] == 5);
|
|
}
|
|
{#code_end#}
|
|
<p>Pointers work at compile-time too, as long as the code does not depend on
|
|
an undefined memory layout:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "comptime pointers" {
|
|
comptime {
|
|
var x: i32 = 1;
|
|
const ptr = &x;
|
|
ptr.* += 1;
|
|
x += 1;
|
|
assert(ptr.* == 3);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>To convert an integer address into a pointer, use {#syntax#}@intToPtr{#endsyntax#}.
|
|
To convert a pointer to an integer, use {#syntax#}@ptrToInt{#endsyntax#}:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "@ptrToInt and @intToPtr" {
|
|
const ptr = @intToPtr(*i32, 0xdeadbee0);
|
|
const addr = @ptrToInt(ptr);
|
|
assert(@TypeOf(addr) == usize);
|
|
assert(addr == 0xdeadbee0);
|
|
}
|
|
{#code_end#}
|
|
<p>Zig is able to preserve memory addresses in comptime code, as long as
|
|
the pointer is never dereferenced:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "comptime @intToPtr" {
|
|
comptime {
|
|
// Zig is able to do this at compile-time, as long as
|
|
// ptr is never dereferenced.
|
|
const ptr = @intToPtr(*i32, 0xdeadbee0);
|
|
const addr = @ptrToInt(ptr);
|
|
assert(@TypeOf(addr) == usize);
|
|
assert(addr == 0xdeadbee0);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Optional Pointers|@intToPtr|@ptrToInt|C Pointers|Pointers to Zero Bit Types#}
|
|
{#header_open|volatile#}
|
|
<p>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:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "volatile" {
|
|
const mmio_ptr = @intToPtr(*volatile u8, 0x12345678);
|
|
assert(@TypeOf(mmio_ptr) == *volatile u8);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
<p>
|
|
To convert one pointer type to another, use {#link|@ptrCast#}. This is an unsafe
|
|
operation that Zig cannot protect you against. Use {#syntax#}@ptrCast{#endsyntax#} only when other
|
|
conversions are not possible.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "pointer casting" {
|
|
const bytes align(@alignOf(u32)) = [_]u8{ 0x12, 0x12, 0x12, 0x12 };
|
|
const u32_ptr = @ptrCast(*const u32, &bytes);
|
|
assert(u32_ptr.* == 0x12121212);
|
|
|
|
// Even this example is contrived - there are better ways to do the above than
|
|
// pointer casting. For example, using a slice narrowing cast:
|
|
const u32_value = std.mem.bytesAsSlice(u32, bytes[0..])[0];
|
|
assert(u32_value == 0x12121212);
|
|
|
|
// And even another way, the most straightforward way to do it:
|
|
assert(@bitCast(u32, bytes) == 0x12121212);
|
|
}
|
|
|
|
test "pointer child type" {
|
|
// pointer types have a `child` field which tells you the type they point to.
|
|
assert((*u32).Child == u32);
|
|
}
|
|
{#code_end#}
|
|
{#header_open|Alignment#}
|
|
<p>
|
|
Each type has an <strong>alignment</strong> - 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.
|
|
</p>
|
|
<p>
|
|
Alignment depends on the CPU architecture, but is always a power of two, and
|
|
less than {#syntax#}1 << 29{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "variable alignment" {
|
|
var x: i32 = 1234;
|
|
const align_of_i32 = @alignOf(@TypeOf(x));
|
|
assert(@TypeOf(&x) == *i32);
|
|
assert(*i32 == *align(align_of_i32) i32);
|
|
if (std.Target.current.cpu.arch == .x86_64) {
|
|
assert((*i32).alignment == 4);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>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.
|
|
</p>
|
|
<p>
|
|
You can specify alignment on variables and functions. If you do this, then
|
|
pointers to them get the specified alignment:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
var foo: u8 align(4) = 100;
|
|
|
|
test "global variable alignment" {
|
|
assert(@TypeOf(&foo).alignment == 4);
|
|
assert(@TypeOf(&foo) == *align(4) u8);
|
|
const as_pointer_to_array: *[1]u8 = &foo;
|
|
const as_slice: []u8 = as_pointer_to_array;
|
|
assert(@TypeOf(as_slice) == []align(4) u8);
|
|
}
|
|
|
|
fn derp() align(@sizeOf(usize) * 2) i32 { return 1234; }
|
|
fn noop1() align(1) void {}
|
|
fn noop4() align(4) void {}
|
|
|
|
test "function alignment" {
|
|
assert(derp() == 1234);
|
|
assert(@TypeOf(noop1) == fn() align(1) void);
|
|
assert(@TypeOf(noop4) == fn() align(4) void);
|
|
noop1();
|
|
noop4();
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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#}:
|
|
</p>
|
|
{#code_begin|test_safety|incorrect alignment#}
|
|
const std = @import("std");
|
|
|
|
test "pointer alignment safety" {
|
|
var array align(4) = [_]u32{ 0x11111111, 0x11111111 };
|
|
const bytes = std.mem.sliceAsBytes(array[0..]);
|
|
std.debug.assert(foo(bytes) == 0x11111111);
|
|
}
|
|
fn foo(bytes: []u8) u32 {
|
|
const slice4 = bytes[1..5];
|
|
const int_slice = std.mem.bytesAsSlice(u32, @alignCast(4, slice4));
|
|
return int_slice[0];
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|allowzero#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|test|allowzero#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "allowzero" {
|
|
var zero: usize = 0;
|
|
var ptr = @intToPtr(*allowzero i32, zero);
|
|
assert(@ptrToInt(ptr) == 0);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Sentinel-Terminated Pointers#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|exe_build_err#}
|
|
{#link_libc#}
|
|
const std = @import("std");
|
|
|
|
// This is also available as `std.c.printf`.
|
|
pub extern "c" fn printf(format: [*:0]const u8, ...) c_int;
|
|
|
|
pub fn main() anyerror!void {
|
|
_ = printf("Hello, world!\n"); // OK
|
|
|
|
const msg = "Hello, world!\n";
|
|
const non_null_terminated_msg: [msg.len]u8 = msg.*;
|
|
_ = printf(&non_null_terminated_msg);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Sentinel-Terminated Slices|Sentinel-Terminated Arrays#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Slices#}
|
|
{#code_begin|test_safety|index out of bounds#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "basic slices" {
|
|
var array = [_]i32{ 1, 2, 3, 4 };
|
|
// 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 `len` field.
|
|
var known_at_runtime_zero: usize = 0;
|
|
const slice = array[known_at_runtime_zero..array.len];
|
|
assert(&slice[0] == &array[0]);
|
|
assert(slice.len == array.len);
|
|
|
|
// Using the address-of operator on a slice gives a pointer to a single
|
|
// item, while using the `ptr` field gives an unknown length pointer.
|
|
assert(@TypeOf(slice.ptr) == [*]i32);
|
|
assert(@TypeOf(&slice[0]) == *i32);
|
|
assert(@ptrToInt(slice.ptr) == @ptrToInt(&slice[0]));
|
|
|
|
// Slices have array bounds checking. If you try to access something out
|
|
// of bounds, you'll get a safety check failure:
|
|
slice[10] += 1;
|
|
|
|
// Note that `slice.ptr` does not invoke safety checking, while `&slice[0]`
|
|
// asserts that the slice has len >= 1.
|
|
}
|
|
{#code_end#}
|
|
<p>This is one reason we prefer slices to pointers.</p>
|
|
{#code_begin|test|slices#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
const mem = std.mem;
|
|
const fmt = std.fmt;
|
|
|
|
test "using slices for strings" {
|
|
// Zig has no concept of strings. String literals are const pointers to
|
|
// arrays of u8, and by convention parameters that are "strings" are
|
|
// expected to be UTF-8 encoded slices of u8.
|
|
// Here we coerce [5]u8 to []const u8
|
|
const hello: []const u8 = "hello";
|
|
const world: []const u8 = "世界";
|
|
|
|
var all_together: [100]u8 = undefined;
|
|
// You can use slice syntax on an array to convert an array into a slice.
|
|
const all_together_slice = all_together[0..];
|
|
// String concatenation example.
|
|
const hello_world = try fmt.bufPrint(all_together_slice, "{} {}", .{ hello, world });
|
|
|
|
// Generally, you can use UTF-8 and not worry about whether something is a
|
|
// string. If you don't need to deal with individual characters, no need
|
|
// to decode.
|
|
assert(mem.eql(u8, hello_world, "hello 世界"));
|
|
}
|
|
|
|
test "slice pointer" {
|
|
var array: [10]u8 = undefined;
|
|
const ptr = &array;
|
|
|
|
// You can use slicing syntax to convert a pointer into a slice:
|
|
const slice = ptr[0..5];
|
|
slice[2] = 3;
|
|
assert(slice[2] == 3);
|
|
// The slice is mutable because we sliced a mutable pointer.
|
|
// Furthermore, it is actually a pointer to an array, since the start
|
|
// and end indexes were both comptime-known.
|
|
assert(@TypeOf(slice) == *[5]u8);
|
|
|
|
// You can also slice a slice:
|
|
const slice2 = slice[2..3];
|
|
assert(slice2.len == 1);
|
|
assert(slice2[0] == 3);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Pointers|for|Arrays#}
|
|
|
|
{#header_open|Sentinel-Terminated Slices#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|test|null_terminated_slice#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "null terminated slice" {
|
|
const slice: [:0]const u8 = "hello";
|
|
|
|
assert(slice.len == 5);
|
|
assert(slice[5] == 0);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Sentinel-Terminated Pointers|Sentinel-Terminated Arrays#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|struct#}
|
|
{#code_begin|test|structs#}
|
|
// Declare a struct.
|
|
// Zig gives no guarantees about the order of fields and the size of
|
|
// the struct but the fields are guaranteed to be ABI-aligned.
|
|
const Point = struct {
|
|
x: f32,
|
|
y: f32,
|
|
};
|
|
|
|
// Maybe we want to pass it to OpenGL so we want to be particular about
|
|
// how the bytes are arranged.
|
|
const Point2 = packed struct {
|
|
x: f32,
|
|
y: f32,
|
|
};
|
|
|
|
|
|
// Declare an instance of a struct.
|
|
const p = Point {
|
|
.x = 0.12,
|
|
.y = 0.34,
|
|
};
|
|
|
|
// Maybe we're not ready to fill out some of the fields.
|
|
var p2 = Point {
|
|
.x = 0.12,
|
|
.y = undefined,
|
|
};
|
|
|
|
// Structs can have methods
|
|
// Struct methods are not special, they are only namespaced
|
|
// functions that you can call with dot syntax.
|
|
const Vec3 = struct {
|
|
x: f32,
|
|
y: f32,
|
|
z: f32,
|
|
|
|
pub fn init(x: f32, y: f32, z: f32) Vec3 {
|
|
return Vec3 {
|
|
.x = x,
|
|
.y = y,
|
|
.z = z,
|
|
};
|
|
}
|
|
|
|
pub fn dot(self: Vec3, other: Vec3) f32 {
|
|
return self.x * other.x + self.y * other.y + self.z * other.z;
|
|
}
|
|
};
|
|
|
|
const assert = @import("std").debug.assert;
|
|
test "dot product" {
|
|
const v1 = Vec3.init(1.0, 0.0, 0.0);
|
|
const v2 = Vec3.init(0.0, 1.0, 0.0);
|
|
assert(v1.dot(v2) == 0.0);
|
|
|
|
// Other than being available to call with dot syntax, struct methods are
|
|
// not special. You can reference them as any other declaration inside
|
|
// the struct:
|
|
assert(Vec3.dot(v1, v2) == 0.0);
|
|
}
|
|
|
|
// Structs can have global declarations.
|
|
// Structs can have 0 fields.
|
|
const Empty = struct {
|
|
pub const PI = 3.14;
|
|
};
|
|
test "struct namespaced variable" {
|
|
assert(Empty.PI == 3.14);
|
|
assert(@sizeOf(Empty) == 0);
|
|
|
|
// you can still instantiate an empty struct
|
|
const does_nothing = Empty {};
|
|
}
|
|
|
|
// struct field order is determined by the compiler for optimal performance.
|
|
// however, you can still calculate a struct base pointer given a field pointer:
|
|
fn setYBasedOnX(x: *f32, y: f32) void {
|
|
const point = @fieldParentPtr(Point, "x", x);
|
|
point.y = y;
|
|
}
|
|
test "field parent pointer" {
|
|
var point = Point {
|
|
.x = 0.1234,
|
|
.y = 0.5678,
|
|
};
|
|
setYBasedOnX(&point.x, 0.9);
|
|
assert(point.y == 0.9);
|
|
}
|
|
|
|
// You can return a struct from a function. This is how we do generics
|
|
// in Zig:
|
|
fn LinkedList(comptime T: type) type {
|
|
return struct {
|
|
pub const Node = struct {
|
|
prev: ?*Node,
|
|
next: ?*Node,
|
|
data: T,
|
|
};
|
|
|
|
first: ?*Node,
|
|
last: ?*Node,
|
|
len: usize,
|
|
};
|
|
}
|
|
|
|
test "linked list" {
|
|
// Functions called at compile-time are memoized. This means you can
|
|
// do this:
|
|
assert(LinkedList(i32) == LinkedList(i32));
|
|
|
|
var list = LinkedList(i32) {
|
|
.first = null,
|
|
.last = null,
|
|
.len = 0,
|
|
};
|
|
assert(list.len == 0);
|
|
|
|
// Since types are first class values you can instantiate the type
|
|
// by assigning it to a variable:
|
|
const ListOfInts = LinkedList(i32);
|
|
assert(ListOfInts == LinkedList(i32));
|
|
|
|
var node = ListOfInts.Node {
|
|
.prev = null,
|
|
.next = null,
|
|
.data = 1234,
|
|
};
|
|
var list2 = LinkedList(i32) {
|
|
.first = &node,
|
|
.last = &node,
|
|
.len = 1,
|
|
};
|
|
assert(list2.first.?.data == 1234);
|
|
}
|
|
{#code_end#}
|
|
|
|
{#header_open|Default Field Values#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const Foo = struct {
|
|
a: i32 = 1234,
|
|
b: i32,
|
|
};
|
|
|
|
test "default struct initialization fields" {
|
|
const x = Foo{
|
|
.b = 5,
|
|
};
|
|
if (x.a + x.b != 1239) {
|
|
@compileError("it's even comptime known!");
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|extern struct#}
|
|
<p>An {#syntax#}extern struct{#endsyntax#} has in-memory layout guaranteed to match the
|
|
C ABI for the target.</p>
|
|
<p>This kind of struct should only be used for compatibility with the C ABI. Every other
|
|
use case should be solved with {#link|packed struct#} or normal {#link|struct#}.</p>
|
|
{#see_also|extern union|extern enum#}
|
|
{#header_close#}
|
|
|
|
{#header_open|packed struct#}
|
|
<p>
|
|
Unlike normal structs, {#syntax#}packed{#endsyntax#} structs have guaranteed in-memory layout:
|
|
</p>
|
|
<ul>
|
|
<li>Fields remain in the order declared.</li>
|
|
<li>There is no padding between fields.</li>
|
|
<li>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.
|
|
</li>
|
|
<li>{#syntax#}bool{#endsyntax#} fields use exactly 1 bit.</li>
|
|
<li>A {#link|packed enum#} field uses exactly the bit width of its integer tag type.</li>
|
|
<li>A {#link|packed union#} field uses exactly the bit width of the union field with
|
|
the largest bit width.</li>
|
|
<li>Non-ABI-aligned fields are packed into the smallest possible
|
|
ABI-aligned integers in accordance with the target endianness.
|
|
</li>
|
|
</ul>
|
|
<p>
|
|
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#}:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const builtin = std.builtin;
|
|
const assert = std.debug.assert;
|
|
|
|
const Full = packed struct {
|
|
number: u16,
|
|
};
|
|
const Divided = packed struct {
|
|
half1: u8,
|
|
quarter3: u4,
|
|
quarter4: u4,
|
|
};
|
|
|
|
test "@bitCast between packed structs" {
|
|
doTheTest();
|
|
comptime doTheTest();
|
|
}
|
|
|
|
fn doTheTest() void {
|
|
assert(@sizeOf(Full) == 2);
|
|
assert(@sizeOf(Divided) == 2);
|
|
var full = Full{ .number = 0x1234 };
|
|
var divided = @bitCast(Divided, full);
|
|
switch (builtin.endian) {
|
|
.Big => {
|
|
assert(divided.half1 == 0x12);
|
|
assert(divided.quarter3 == 0x3);
|
|
assert(divided.quarter4 == 0x4);
|
|
},
|
|
.Little => {
|
|
assert(divided.half1 == 0x34);
|
|
assert(divided.quarter3 == 0x2);
|
|
assert(divided.quarter4 == 0x1);
|
|
},
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Zig allows the address to be taken of a non-byte-aligned field:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const BitField = packed struct {
|
|
a: u3,
|
|
b: u3,
|
|
c: u2,
|
|
};
|
|
|
|
var foo = BitField{
|
|
.a = 1,
|
|
.b = 2,
|
|
.c = 3,
|
|
};
|
|
|
|
test "pointer to non-byte-aligned field" {
|
|
const ptr = &foo.b;
|
|
assert(ptr.* == 2);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
However, the pointer to a non-byte-aligned field has special properties and cannot
|
|
be passed when a normal pointer is expected:
|
|
</p>
|
|
{#code_begin|test_err|expected type#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const BitField = packed struct {
|
|
a: u3,
|
|
b: u3,
|
|
c: u2,
|
|
};
|
|
|
|
var bit_field = BitField{
|
|
.a = 1,
|
|
.b = 2,
|
|
.c = 3,
|
|
};
|
|
|
|
test "pointer to non-bit-aligned field" {
|
|
assert(bar(&bit_field.b) == 2);
|
|
}
|
|
|
|
fn bar(x: *const u3) u3 {
|
|
return x.*;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
In this case, the function {#syntax#}bar{#endsyntax#} cannot be called becuse the pointer
|
|
to the non-ABI-aligned field mentions the bit offset, but the function expects an ABI-aligned pointer.
|
|
</p>
|
|
<p>
|
|
Pointers to non-ABI-aligned fields share the same address as the other fields within their host integer:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const BitField = packed struct {
|
|
a: u3,
|
|
b: u3,
|
|
c: u2,
|
|
};
|
|
|
|
var bit_field = BitField{
|
|
.a = 1,
|
|
.b = 2,
|
|
.c = 3,
|
|
};
|
|
|
|
test "pointer to non-bit-aligned field" {
|
|
assert(@ptrToInt(&bit_field.a) == @ptrToInt(&bit_field.b));
|
|
assert(@ptrToInt(&bit_field.a) == @ptrToInt(&bit_field.c));
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This can be observed with {#link|@bitOffsetOf#} and {#link|byteOffsetOf#}:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const BitField = packed struct {
|
|
a: u3,
|
|
b: u3,
|
|
c: u2,
|
|
};
|
|
|
|
test "pointer to non-bit-aligned field" {
|
|
comptime {
|
|
assert(@bitOffsetOf(BitField, "a") == 0);
|
|
assert(@bitOffsetOf(BitField, "b") == 3);
|
|
assert(@bitOffsetOf(BitField, "c") == 6);
|
|
|
|
assert(@byteOffsetOf(BitField, "a") == 0);
|
|
assert(@byteOffsetOf(BitField, "b") == 0);
|
|
assert(@byteOffsetOf(BitField, "c") == 0);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Packed structs have 1-byte alignment. However if you have an overaligned pointer to a packed struct,
|
|
Zig should correctly understand the alignment of fields. However there is
|
|
<a href="https://github.com/ziglang/zig/issues/1994">a bug</a>:
|
|
</p>
|
|
{#code_begin|test_err#}
|
|
const S = packed struct {
|
|
a: u32,
|
|
b: u32,
|
|
};
|
|
test "overaligned pointer to packed struct" {
|
|
var foo: S align(4) = undefined;
|
|
const ptr: *align(4) S = &foo;
|
|
const ptr_to_b: *u32 = &ptr.b;
|
|
}
|
|
{#code_end#}
|
|
<p>When this bug is fixed, the above test in the documentation will unexpectedly pass, which will
|
|
cause the test suite to fail, notifying the bug fixer to update these docs.
|
|
</p>
|
|
<p>
|
|
It's also
|
|
<a href="https://github.com/ziglang/zig/issues/1512">planned to be able to set alignment of struct fields</a>.
|
|
</p>
|
|
<p>
|
|
Using packed structs with {#link|volatile#} is problematic, and may be a compile error in the future.
|
|
For details on this subscribe to
|
|
<a href="https://github.com/ziglang/zig/issues/1761">this issue</a>.
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Struct Naming#}
|
|
<p>Since all structs are anonymous, Zig infers the type name based on a few rules.</p>
|
|
<ul>
|
|
<li>If the struct is in the initialization expression of a variable, it gets named after
|
|
that variable.</li>
|
|
<li>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.</li>
|
|
<li>Otherwise, the struct gets a name such as <code>(anonymous struct at file.zig:7:38)</code>.</li>
|
|
</ul>
|
|
{#code_begin|exe|struct_name#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
const Foo = struct {};
|
|
std.debug.warn("variable: {}\n", .{@typeName(Foo)});
|
|
std.debug.warn("anonymous: {}\n", .{@typeName(struct {})});
|
|
std.debug.warn("function: {}\n", .{@typeName(List(i32))});
|
|
}
|
|
|
|
fn List(comptime T: type) type {
|
|
return struct {
|
|
x: T,
|
|
};
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Anonymous Struct Literals#}
|
|
<p>
|
|
Zig allows omitting the struct type of a literal. When the result is {#link|coerced|Type Coercion#},
|
|
the struct literal will directly instantiate the result location, with no copy:
|
|
</p>
|
|
{#code_begin|test|struct_result#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Point = struct {x: i32, y: i32};
|
|
|
|
test "anonymous struct literal" {
|
|
var pt: Point = .{
|
|
.x = 13,
|
|
.y = 67,
|
|
};
|
|
assert(pt.x == 13);
|
|
assert(pt.y == 67);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
The struct type can be inferred. Here the result location does not include a type, and
|
|
so Zig infers the type:
|
|
</p>
|
|
{#code_begin|test|struct_anon#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "fully anonymous struct" {
|
|
dump(.{
|
|
.int = @as(u32, 1234),
|
|
.float = @as(f64, 12.34),
|
|
.b = true,
|
|
.s = "hi",
|
|
});
|
|
}
|
|
|
|
fn dump(args: var) void {
|
|
assert(args.int == 1234);
|
|
assert(args.float == 12.34);
|
|
assert(args.b);
|
|
assert(args.s[0] == 'h');
|
|
assert(args.s[1] == 'i');
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#see_also|comptime|@fieldParentPtr#}
|
|
{#header_close#}
|
|
{#header_open|enum#}
|
|
{#code_begin|test|enums#}
|
|
const assert = @import("std").debug.assert;
|
|
const mem = @import("std").mem;
|
|
|
|
// Declare an enum.
|
|
const Type = enum {
|
|
Ok,
|
|
NotOk,
|
|
};
|
|
|
|
// Declare a specific instance of the enum variant.
|
|
const c = Type.Ok;
|
|
|
|
// If you want access to the ordinal value of an enum, you
|
|
// can specify the tag type.
|
|
const Value = enum(u2) {
|
|
Zero,
|
|
One,
|
|
Two,
|
|
};
|
|
|
|
// Now you can cast between u2 and Value.
|
|
// The ordinal value starts from 0, counting up for each member.
|
|
test "enum ordinal value" {
|
|
assert(@enumToInt(Value.Zero) == 0);
|
|
assert(@enumToInt(Value.One) == 1);
|
|
assert(@enumToInt(Value.Two) == 2);
|
|
}
|
|
|
|
// You can override the ordinal value for an enum.
|
|
const Value2 = enum(u32) {
|
|
Hundred = 100,
|
|
Thousand = 1000,
|
|
Million = 1000000,
|
|
};
|
|
test "set enum ordinal value" {
|
|
assert(@enumToInt(Value2.Hundred) == 100);
|
|
assert(@enumToInt(Value2.Thousand) == 1000);
|
|
assert(@enumToInt(Value2.Million) == 1000000);
|
|
}
|
|
|
|
// Enums can have methods, the same as structs and unions.
|
|
// Enum methods are not special, they are only namespaced
|
|
// functions that you can call with dot syntax.
|
|
const Suit = enum {
|
|
Clubs,
|
|
Spades,
|
|
Diamonds,
|
|
Hearts,
|
|
|
|
pub fn isClubs(self: Suit) bool {
|
|
return self == Suit.Clubs;
|
|
}
|
|
};
|
|
test "enum method" {
|
|
const p = Suit.Spades;
|
|
assert(!p.isClubs());
|
|
}
|
|
|
|
// An enum variant of different types can be switched upon.
|
|
const Foo = enum {
|
|
String,
|
|
Number,
|
|
None,
|
|
};
|
|
test "enum variant switch" {
|
|
const p = Foo.Number;
|
|
const what_is_it = switch (p) {
|
|
Foo.String => "this is a string",
|
|
Foo.Number => "this is a number",
|
|
Foo.None => "this is a none",
|
|
};
|
|
assert(mem.eql(u8, what_is_it, "this is a number"));
|
|
}
|
|
|
|
// @TagType can be used to access the integer tag type of an enum.
|
|
const Small = enum {
|
|
One,
|
|
Two,
|
|
Three,
|
|
Four,
|
|
};
|
|
test "@TagType" {
|
|
assert(@TagType(Small) == u2);
|
|
}
|
|
|
|
// @typeInfo tells us the field count and the fields names:
|
|
test "@typeInfo" {
|
|
assert(@typeInfo(Small).Enum.fields.len == 4);
|
|
assert(mem.eql(u8, @typeInfo(Small).Enum.fields[1].name, "Two"));
|
|
}
|
|
|
|
// @tagName gives a []const u8 representation of an enum value:
|
|
test "@tagName" {
|
|
assert(mem.eql(u8, @tagName(Small.Three), "Three"));
|
|
}
|
|
{#code_end#}
|
|
{#see_also|@typeInfo|@tagName|@sizeOf#}
|
|
|
|
{#header_open|extern enum#}
|
|
<p>
|
|
By default, enums are not guaranteed to be compatible with the C ABI:
|
|
</p>
|
|
{#code_begin|obj_err|parameter of type 'Foo' not allowed in function with calling convention 'C'#}
|
|
const Foo = enum { A, B, C };
|
|
export fn entry(foo: Foo) void { }
|
|
{#code_end#}
|
|
<p>
|
|
For a C-ABI-compatible enum, use {#syntax#}extern enum{#endsyntax#}:
|
|
</p>
|
|
{#code_begin|obj#}
|
|
const Foo = extern enum { A, B, C };
|
|
export fn entry(foo: Foo) void { }
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|packed enum#}
|
|
<p>By default, the size of enums is not guaranteed.</p>
|
|
<p>{#syntax#}packed enum{#endsyntax#} causes the size of the enum to be the same as the size of the
|
|
integer tag type of the enum:</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
|
|
test "packed enum" {
|
|
const Number = packed enum(u8) {
|
|
One,
|
|
Two,
|
|
Three,
|
|
};
|
|
std.debug.assert(@sizeOf(Number) == @sizeOf(u8));
|
|
}
|
|
{#code_end#}
|
|
<p>This makes the enum eligible to be in a {#link|packed struct#}.</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Enum Literals#}
|
|
<p>
|
|
Enum literals allow specifying the name of an enum field without specifying the enum type:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Color = enum {
|
|
Auto,
|
|
Off,
|
|
On,
|
|
};
|
|
|
|
test "enum literals" {
|
|
const color1: Color = .Auto;
|
|
const color2 = Color.Auto;
|
|
assert(color1 == color2);
|
|
}
|
|
|
|
test "switch using enum literals" {
|
|
const color = Color.On;
|
|
const result = switch (color) {
|
|
.Auto => false,
|
|
.On => true,
|
|
.Off => false,
|
|
};
|
|
assert(result);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Non-exhaustive enum#}
|
|
<p>
|
|
A Non-exhaustive enum can be created by adding a trailing '_' field.
|
|
It must specify a tag type and cannot consume every enumeration value.
|
|
</p>
|
|
<p>
|
|
{#link|@intToEnum#} on a non-exhaustive enum cannot fail.
|
|
</p>
|
|
<p>
|
|
A switch on a non-exhaustive enum can include a '_' prong as an alternative to an {#syntax#}else{#endsyntax#} prong
|
|
with the difference being that it makes it a compile error if all the known tag names are not handled by the switch.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Number = enum(u8) {
|
|
One,
|
|
Two,
|
|
Three,
|
|
_,
|
|
};
|
|
|
|
test "switch on non-exhaustive enum" {
|
|
const number = Number.One;
|
|
const result = switch (number) {
|
|
.One => true,
|
|
.Two,
|
|
.Three => false,
|
|
_ => false,
|
|
};
|
|
assert(result);
|
|
const is_one = switch (number) {
|
|
.One => true,
|
|
else => false,
|
|
};
|
|
assert(is_one);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|union#}
|
|
<p>
|
|
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#}:
|
|
</p>
|
|
{#code_begin|test_err|inactive union field#}
|
|
const Payload = union {
|
|
Int: i64,
|
|
Float: f64,
|
|
Bool: bool,
|
|
};
|
|
test "simple union" {
|
|
var payload = Payload{ .Int = 1234 };
|
|
payload.Float = 12.34;
|
|
}
|
|
{#code_end#}
|
|
<p>You can activate another field by assigning the entire union:</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Payload = union {
|
|
Int: i64,
|
|
Float: f64,
|
|
Bool: bool,
|
|
};
|
|
test "simple union" {
|
|
var payload = Payload{ .Int = 1234 };
|
|
assert(payload.Int == 1234);
|
|
payload = Payload{ .Float = 12.34 };
|
|
assert(payload.Float == 12.34);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
In order to use {#link|switch#} with a union, it must be a {#link|Tagged union#}.
|
|
</p>
|
|
<p>
|
|
To initialize a union when the tag is a {#link|comptime#}-known name, see {#link|@unionInit#}.
|
|
</p>
|
|
|
|
{#header_open|Tagged union#}
|
|
<p>Unions can be declared with an enum tag type.
|
|
This turns the union into a <em>tagged</em> union, which makes it eligible
|
|
to use with {#link|switch#} expressions. One can use {#link|@TagType#} to
|
|
obtain the enum type from the union type.
|
|
Tagged unions coerce to their tag type: {#link|Type Coercion: unions and enums#}.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const ComplexTypeTag = enum {
|
|
Ok,
|
|
NotOk,
|
|
};
|
|
const ComplexType = union(ComplexTypeTag) {
|
|
Ok: u8,
|
|
NotOk: void,
|
|
};
|
|
|
|
test "switch on tagged union" {
|
|
const c = ComplexType{ .Ok = 42 };
|
|
assert(@as(ComplexTypeTag, c) == ComplexTypeTag.Ok);
|
|
|
|
switch (c) {
|
|
ComplexTypeTag.Ok => |value| assert(value == 42),
|
|
ComplexTypeTag.NotOk => unreachable,
|
|
}
|
|
}
|
|
|
|
test "@TagType" {
|
|
assert(@TagType(ComplexType) == ComplexTypeTag);
|
|
}
|
|
|
|
test "coerce to enum" {
|
|
const c1 = ComplexType{ .Ok = 42 };
|
|
const c2 = ComplexType.NotOk;
|
|
|
|
assert(c1 == .Ok);
|
|
assert(c2 == .NotOk);
|
|
}
|
|
{#code_end#}
|
|
<p>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:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const ComplexTypeTag = enum {
|
|
Ok,
|
|
NotOk,
|
|
};
|
|
const ComplexType = union(ComplexTypeTag) {
|
|
Ok: u8,
|
|
NotOk: void,
|
|
};
|
|
|
|
test "modify tagged union in switch" {
|
|
var c = ComplexType{ .Ok = 42 };
|
|
assert(@as(ComplexTypeTag, c) == ComplexTypeTag.Ok);
|
|
|
|
switch (c) {
|
|
ComplexTypeTag.Ok => |*value| value.* += 1,
|
|
ComplexTypeTag.NotOk => unreachable,
|
|
}
|
|
|
|
assert(c.Ok == 43);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Unions can be made to infer the enum tag type.
|
|
Further, unions can have methods just like structs and enums.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Variant = union(enum) {
|
|
Int: i32,
|
|
Bool: bool,
|
|
|
|
// void can be omitted when inferring enum tag type.
|
|
None,
|
|
|
|
fn truthy(self: Variant) bool {
|
|
return switch (self) {
|
|
Variant.Int => |x_int| x_int != 0,
|
|
Variant.Bool => |x_bool| x_bool,
|
|
Variant.None => false,
|
|
};
|
|
}
|
|
};
|
|
|
|
test "union method" {
|
|
var v1 = Variant{ .Int = 1 };
|
|
var v2 = Variant{ .Bool = false };
|
|
|
|
assert(v1.truthy());
|
|
assert(!v2.truthy());
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#link|@tagName#} can be used to return a {#link|comptime#}
|
|
{#syntax#}[]const u8{#endsyntax#} value representing the field name:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Small2 = union(enum) {
|
|
A: i32,
|
|
B: bool,
|
|
C: u8,
|
|
};
|
|
test "@tagName" {
|
|
assert(std.mem.eql(u8, @tagName(Small2.C), "C"));
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|extern union#}
|
|
<p>
|
|
An {#syntax#}extern union{#endsyntax#} has memory layout guaranteed to be compatible with
|
|
the target C ABI.
|
|
</p>
|
|
{#see_also|extern struct#}
|
|
{#header_close#}
|
|
|
|
{#header_open|packed union#}
|
|
<p>A {#syntax#}packed union{#endsyntax#} has well-defined in-memory layout and is eligible
|
|
to be in a {#link|packed struct#}.
|
|
{#header_close#}
|
|
|
|
{#header_open|Anonymous Union Literals#}
|
|
<p>{#link|Anonymous Struct Literals#} syntax can be used to initialize unions without specifying
|
|
the type:</p>
|
|
{#code_begin|test|anon_union#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Number = union {
|
|
int: i32,
|
|
float: f64,
|
|
};
|
|
|
|
test "anonymous union literal syntax" {
|
|
var i: Number = .{.int = 42};
|
|
var f = makeNumber();
|
|
assert(i.int == 42);
|
|
assert(f.float == 12.34);
|
|
}
|
|
|
|
fn makeNumber() Number {
|
|
return .{.float = 12.34};
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_close#}
|
|
|
|
{#header_open|blocks#}
|
|
<p>
|
|
Blocks are used to limit the scope of variable declarations:
|
|
</p>
|
|
{#code_begin|test_err|undeclared identifier#}
|
|
test "access variable after block scope" {
|
|
{
|
|
var x: i32 = 1;
|
|
}
|
|
x += 1;
|
|
}
|
|
{#code_end#}
|
|
<p>Blocks are expressions. When labeled, {#syntax#}break{#endsyntax#} can be used
|
|
to return a value from the block:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "labeled break from labeled block expression" {
|
|
var y: i32 = 123;
|
|
|
|
const x = blk: {
|
|
y += 1;
|
|
break :blk y;
|
|
};
|
|
assert(x == 124);
|
|
assert(y == 124);
|
|
}
|
|
{#code_end#}
|
|
<p>Here, {#syntax#}blk{#endsyntax#} can be any name.</p>
|
|
{#see_also|Labeled while|Labeled for#}
|
|
|
|
{#header_open|Shadowing#}
|
|
<p>It is never allowed for an identifier to "hide" another one by using the same name:</p>
|
|
{#code_begin|test_err|redefinition#}
|
|
const pi = 3.14;
|
|
|
|
test "inside test block" {
|
|
// Let's even go inside another block
|
|
{
|
|
var pi: i32 = 1234;
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Because of this, when you read Zig code you can rely on an identifier always meaning the same thing,
|
|
within the scope it is defined. Note that you can, however use the same name if the scopes are separate:
|
|
</p>
|
|
{#code_begin|test#}
|
|
test "separate scopes" {
|
|
{
|
|
const pi = 3.14;
|
|
}
|
|
{
|
|
var pi: bool = true;
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|switch#}
|
|
{#code_begin|test|switch#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "switch simple" {
|
|
const a: u64 = 10;
|
|
const zz: u64 = 103;
|
|
|
|
// All branches of a switch expression must be able to be coerced to a
|
|
// common type.
|
|
//
|
|
// Branches cannot fallthrough. If fallthrough behavior is desired, combine
|
|
// the cases and use an if.
|
|
const b = switch (a) {
|
|
// Multiple cases can be combined via a ','
|
|
1, 2, 3 => 0,
|
|
|
|
// Ranges can be specified using the ... syntax. These are inclusive
|
|
// both ends.
|
|
5...100 => 1,
|
|
|
|
// Branches can be arbitrarily complex.
|
|
101 => blk: {
|
|
const c: u64 = 5;
|
|
break :blk c * 2 + 1;
|
|
},
|
|
|
|
// Switching on arbitrary expressions is allowed as long as the
|
|
// expression is known at compile-time.
|
|
zz => zz,
|
|
comptime blk: {
|
|
const d: u32 = 5;
|
|
const e: u32 = 100;
|
|
break :blk d + e;
|
|
} => 107,
|
|
|
|
// The else branch catches everything not already captured.
|
|
// Else branches are mandatory unless the entire range of values
|
|
// is handled.
|
|
else => 9,
|
|
};
|
|
|
|
assert(b == 1);
|
|
}
|
|
|
|
// Switch expressions can be used outside a function:
|
|
const os_msg = switch (std.Target.current.os.tag) {
|
|
.linux => "we found a linux user",
|
|
else => "not a linux user",
|
|
};
|
|
|
|
// Inside a function, switch statements implicitly are compile-time
|
|
// evaluated if the target expression is compile-time known.
|
|
test "switch inside function" {
|
|
switch (std.Target.current.os.tag) {
|
|
.fuchsia => {
|
|
// On an OS other than fuchsia, block is not even analyzed,
|
|
// so this compile error is not triggered.
|
|
// On fuchsia this compile error would be triggered.
|
|
@compileError("fuchsia not supported");
|
|
},
|
|
else => {},
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "switch on tagged union" {
|
|
const Point = struct {
|
|
x: u8,
|
|
y: u8,
|
|
};
|
|
const Item = union(enum) {
|
|
A: u32,
|
|
C: Point,
|
|
D,
|
|
E: u32,
|
|
};
|
|
|
|
var a = Item{ .C = Point{ .x = 1, .y = 2 } };
|
|
|
|
// Switching on more complex enums is allowed.
|
|
const b = switch (a) {
|
|
// A capture group is allowed on a match, and will return the enum
|
|
// value matched. If the payload types of both cases are the same
|
|
// they can be put into the same switch prong.
|
|
Item.A, Item.E => |item| item,
|
|
|
|
// A reference to the matched value can be obtained using `*` syntax.
|
|
Item.C => |*item| blk: {
|
|
item.*.x += 1;
|
|
break :blk 6;
|
|
},
|
|
|
|
// No else is required if the types cases was exhaustively handled
|
|
Item.D => 8,
|
|
};
|
|
|
|
assert(b == 6);
|
|
assert(a.C.x == 2);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|comptime|enum|@compileError|Compile Variables#}
|
|
|
|
{#header_open|Exhaustive Switching#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|test_err|not handled in switch#}
|
|
const Color = enum {
|
|
Auto,
|
|
Off,
|
|
On,
|
|
};
|
|
|
|
test "exhaustive switching" {
|
|
const color = Color.Off;
|
|
switch (color) {
|
|
Color.Auto => {},
|
|
Color.On => {},
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Switching with Enum Literals#}
|
|
<p>
|
|
{#link|Enum Literals#} can be useful to use with {#syntax#}switch{#endsyntax#} to avoid
|
|
repetitively specifying {#link|enum#} or {#link|union#} types:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Color = enum {
|
|
Auto,
|
|
Off,
|
|
On,
|
|
};
|
|
|
|
test "enum literals with switch" {
|
|
const color = Color.Off;
|
|
const result = switch (color) {
|
|
.Auto => false,
|
|
.On => false,
|
|
.Off => true,
|
|
};
|
|
assert(result);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|while#}
|
|
<p>
|
|
A while loop is used to repeatedly execute an expression until
|
|
some condition is no longer true.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while basic" {
|
|
var i: usize = 0;
|
|
while (i < 10) {
|
|
i += 1;
|
|
}
|
|
assert(i == 10);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Use {#syntax#}break{#endsyntax#} to exit a while loop early.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while break" {
|
|
var i: usize = 0;
|
|
while (true) {
|
|
if (i == 10)
|
|
break;
|
|
i += 1;
|
|
}
|
|
assert(i == 10);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Use {#syntax#}continue{#endsyntax#} to jump back to the beginning of the loop.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while continue" {
|
|
var i: usize = 0;
|
|
while (true) {
|
|
i += 1;
|
|
if (i < 10)
|
|
continue;
|
|
break;
|
|
}
|
|
assert(i == 10);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
While loops support a continue expression which is executed when the loop
|
|
is continued. The {#syntax#}continue{#endsyntax#} keyword respects this expression.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while loop continue expression" {
|
|
var i: usize = 0;
|
|
while (i < 10) : (i += 1) {}
|
|
assert(i == 10);
|
|
}
|
|
|
|
test "while loop continue expression, more complicated" {
|
|
var i: usize = 1;
|
|
var j: usize = 1;
|
|
while (i * j < 2000) : ({ i *= 2; j *= 3; }) {
|
|
const my_ij = i * j;
|
|
assert(my_ij < 2000);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while else" {
|
|
assert(rangeHasNumber(0, 10, 5));
|
|
assert(!rangeHasNumber(0, 10, 15));
|
|
}
|
|
|
|
fn rangeHasNumber(begin: usize, end: usize, number: usize) bool {
|
|
var i = begin;
|
|
return while (i < end) : (i += 1) {
|
|
if (i == number) {
|
|
break true;
|
|
}
|
|
} else false;
|
|
}
|
|
{#code_end#}
|
|
{#header_open|Labeled while#}
|
|
<p>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:</p>
|
|
{#code_begin|test#}
|
|
test "nested break" {
|
|
outer: while (true) {
|
|
while (true) {
|
|
break :outer;
|
|
}
|
|
}
|
|
}
|
|
|
|
test "nested continue" {
|
|
var i: usize = 0;
|
|
outer: while (i < 10) : (i += 1) {
|
|
while (true) {
|
|
continue :outer;
|
|
}
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|while with Optionals#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
When the {#syntax#}|x|{#endsyntax#} syntax is present on a {#syntax#}while{#endsyntax#} expression,
|
|
the while condition must have an {#link|Optional Type#}.
|
|
</p>
|
|
<p>
|
|
The {#syntax#}else{#endsyntax#} branch is allowed on optional iteration. In this case, it will
|
|
be executed on the first null value encountered.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while null capture" {
|
|
var sum1: u32 = 0;
|
|
numbers_left = 3;
|
|
while (eventuallyNullSequence()) |value| {
|
|
sum1 += value;
|
|
}
|
|
assert(sum1 == 3);
|
|
|
|
var sum2: u32 = 0;
|
|
numbers_left = 3;
|
|
while (eventuallyNullSequence()) |value| {
|
|
sum2 += value;
|
|
} else {
|
|
assert(sum2 == 3);
|
|
}
|
|
}
|
|
|
|
var numbers_left: u32 = undefined;
|
|
fn eventuallyNullSequence() ?u32 {
|
|
return if (numbers_left == 0) null else blk: {
|
|
numbers_left -= 1;
|
|
break :blk numbers_left;
|
|
};
|
|
}
|
|
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|while with Error Unions#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#code_begin|test|while#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "while error union capture" {
|
|
var sum1: u32 = 0;
|
|
numbers_left = 3;
|
|
while (eventuallyErrorSequence()) |value| {
|
|
sum1 += value;
|
|
} else |err| {
|
|
assert(err == error.ReachedZero);
|
|
}
|
|
}
|
|
|
|
var numbers_left: u32 = undefined;
|
|
|
|
fn eventuallyErrorSequence() anyerror!u32 {
|
|
return if (numbers_left == 0) error.ReachedZero else blk: {
|
|
numbers_left -= 1;
|
|
break :blk numbers_left;
|
|
};
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|inline while#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "inline while loop" {
|
|
comptime var i = 0;
|
|
var sum: usize = 0;
|
|
inline while (i < 3) : (i += 1) {
|
|
const T = switch (i) {
|
|
0 => f32,
|
|
1 => i8,
|
|
2 => bool,
|
|
else => unreachable,
|
|
};
|
|
sum += typeNameLength(T);
|
|
}
|
|
assert(sum == 9);
|
|
}
|
|
|
|
fn typeNameLength(comptime T: type) usize {
|
|
return @typeName(T).len;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
It is recommended to use {#syntax#}inline{#endsyntax#} loops only for one of these reasons:
|
|
</p>
|
|
<ul>
|
|
<li>You need the loop to execute at {#link|comptime#} for the semantics to work.</li>
|
|
<li>
|
|
You have a benchmark to prove that forcibly unrolling the loop in this way is measurably faster.
|
|
</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#see_also|if|Optionals|Errors|comptime|unreachable#}
|
|
{#header_close#}
|
|
{#header_open|for#}
|
|
{#code_begin|test|for#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "for basics" {
|
|
const items = [_]i32 { 4, 5, 3, 4, 0 };
|
|
var sum: i32 = 0;
|
|
|
|
// For loops iterate over slices and arrays.
|
|
for (items) |value| {
|
|
// Break and continue are supported.
|
|
if (value == 0) {
|
|
continue;
|
|
}
|
|
sum += value;
|
|
}
|
|
assert(sum == 16);
|
|
|
|
// To iterate over a portion of a slice, reslice.
|
|
for (items[0..1]) |value| {
|
|
sum += value;
|
|
}
|
|
assert(sum == 20);
|
|
|
|
// To access the index of iteration, specify a second capture value.
|
|
// This is zero-indexed.
|
|
var sum2: i32 = 0;
|
|
for (items) |value, i| {
|
|
assert(@TypeOf(i) == usize);
|
|
sum2 += @intCast(i32, i);
|
|
}
|
|
assert(sum2 == 10);
|
|
}
|
|
|
|
test "for reference" {
|
|
var items = [_]i32 { 3, 4, 2 };
|
|
|
|
// Iterate over the slice by reference by
|
|
// specifying that the capture value is a pointer.
|
|
for (items) |*value| {
|
|
value.* += 1;
|
|
}
|
|
|
|
assert(items[0] == 4);
|
|
assert(items[1] == 5);
|
|
assert(items[2] == 3);
|
|
}
|
|
|
|
test "for else" {
|
|
// For allows an else attached to it, the same as a while loop.
|
|
var items = [_]?i32 { 3, 4, null, 5 };
|
|
|
|
// For loops can also be used as expressions.
|
|
// Similar to while loops, when you break from a for loop, the else branch is not evaluated.
|
|
var sum: i32 = 0;
|
|
const result = for (items) |value| {
|
|
if (value != null) {
|
|
sum += value.?;
|
|
}
|
|
} else blk: {
|
|
assert(sum == 12);
|
|
break :blk sum;
|
|
};
|
|
assert(result == 12);
|
|
}
|
|
{#code_end#}
|
|
{#header_open|Labeled for#}
|
|
<p>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:</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "nested break" {
|
|
var count: usize = 0;
|
|
outer: for ([_]i32{ 1, 2, 3, 4, 5 }) |_| {
|
|
for ([_]i32{ 1, 2, 3, 4, 5 }) |_| {
|
|
count += 1;
|
|
break :outer;
|
|
}
|
|
}
|
|
assert(count == 1);
|
|
}
|
|
|
|
test "nested continue" {
|
|
var count: usize = 0;
|
|
outer: for ([_]i32{ 1, 2, 3, 4, 5, 6, 7, 8 }) |_| {
|
|
for ([_]i32{ 1, 2, 3, 4, 5 }) |_| {
|
|
count += 1;
|
|
continue :outer;
|
|
}
|
|
}
|
|
|
|
assert(count == 8);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|inline for#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "inline for loop" {
|
|
const nums = [_]i32{2, 4, 6};
|
|
var sum: usize = 0;
|
|
inline for (nums) |i| {
|
|
const T = switch (i) {
|
|
2 => f32,
|
|
4 => i8,
|
|
6 => bool,
|
|
else => unreachable,
|
|
};
|
|
sum += typeNameLength(T);
|
|
}
|
|
assert(sum == 9);
|
|
}
|
|
|
|
fn typeNameLength(comptime T: type) usize {
|
|
return @typeName(T).len;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
It is recommended to use {#syntax#}inline{#endsyntax#} loops only for one of these reasons:
|
|
</p>
|
|
<ul>
|
|
<li>You need the loop to execute at {#link|comptime#} for the semantics to work.</li>
|
|
<li>
|
|
You have a benchmark to prove that forcibly unrolling the loop in this way is measurably faster.
|
|
</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#see_also|while|comptime|Arrays|Slices#}
|
|
{#header_close#}
|
|
{#header_open|if#}
|
|
{#code_begin|test|if#}
|
|
// If expressions have three uses, corresponding to the three types:
|
|
// * bool
|
|
// * ?T
|
|
// * anyerror!T
|
|
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "if expression" {
|
|
// If expressions are used instead of a ternary expression.
|
|
const a: u32 = 5;
|
|
const b: u32 = 4;
|
|
const result = if (a != b) 47 else 3089;
|
|
assert(result == 47);
|
|
}
|
|
|
|
test "if boolean" {
|
|
// If expressions test boolean conditions.
|
|
const a: u32 = 5;
|
|
const b: u32 = 4;
|
|
if (a != b) {
|
|
assert(true);
|
|
} else if (a == 9) {
|
|
unreachable;
|
|
} else {
|
|
unreachable;
|
|
}
|
|
}
|
|
|
|
test "if optional" {
|
|
// If expressions test for null.
|
|
|
|
const a: ?u32 = 0;
|
|
if (a) |value| {
|
|
assert(value == 0);
|
|
} else {
|
|
unreachable;
|
|
}
|
|
|
|
const b: ?u32 = null;
|
|
if (b) |value| {
|
|
unreachable;
|
|
} else {
|
|
assert(true);
|
|
}
|
|
|
|
// The else is not required.
|
|
if (a) |value| {
|
|
assert(value == 0);
|
|
}
|
|
|
|
// To test against null only, use the binary equality operator.
|
|
if (b == null) {
|
|
assert(true);
|
|
}
|
|
|
|
// Access the value by reference using a pointer capture.
|
|
var c: ?u32 = 3;
|
|
if (c) |*value| {
|
|
value.* = 2;
|
|
}
|
|
|
|
if (c) |value| {
|
|
assert(value == 2);
|
|
} else {
|
|
unreachable;
|
|
}
|
|
}
|
|
|
|
test "if error union" {
|
|
// If expressions test for errors.
|
|
// Note the |err| capture on the else.
|
|
|
|
const a: anyerror!u32 = 0;
|
|
if (a) |value| {
|
|
assert(value == 0);
|
|
} else |err| {
|
|
unreachable;
|
|
}
|
|
|
|
const b: anyerror!u32 = error.BadValue;
|
|
if (b) |value| {
|
|
unreachable;
|
|
} else |err| {
|
|
assert(err == error.BadValue);
|
|
}
|
|
|
|
// The else and |err| capture is strictly required.
|
|
if (a) |value| {
|
|
assert(value == 0);
|
|
} else |_| {}
|
|
|
|
// To check only the error value, use an empty block expression.
|
|
if (b) |_| {} else |err| {
|
|
assert(err == error.BadValue);
|
|
}
|
|
|
|
// Access the value by reference using a pointer capture.
|
|
var c: anyerror!u32 = 3;
|
|
if (c) |*value| {
|
|
value.* = 9;
|
|
} else |err| {
|
|
unreachable;
|
|
}
|
|
|
|
if (c) |value| {
|
|
assert(value == 9);
|
|
} else |err| {
|
|
unreachable;
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Optionals|Errors#}
|
|
{#header_close#}
|
|
{#header_open|defer#}
|
|
{#code_begin|test|defer#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
const warn = std.debug.warn;
|
|
|
|
// defer will execute an expression at the end of the current scope.
|
|
fn deferExample() usize {
|
|
var a: usize = 1;
|
|
|
|
{
|
|
defer a = 2;
|
|
a = 1;
|
|
}
|
|
assert(a == 2);
|
|
|
|
a = 5;
|
|
return a;
|
|
}
|
|
|
|
test "defer basics" {
|
|
assert(deferExample() == 5);
|
|
}
|
|
|
|
// If multiple defer statements are specified, they will be executed in
|
|
// the reverse order they were run.
|
|
fn deferUnwindExample() void {
|
|
warn("\n", .{});
|
|
|
|
defer {
|
|
warn("1 ", .{});
|
|
}
|
|
defer {
|
|
warn("2 ", .{});
|
|
}
|
|
if (false) {
|
|
// defers are not run if they are never executed.
|
|
defer {
|
|
warn("3 ", .{});
|
|
}
|
|
}
|
|
}
|
|
|
|
test "defer unwinding" {
|
|
deferUnwindExample();
|
|
}
|
|
|
|
// The errdefer keyword is similar to defer, but will only execute if the
|
|
// scope returns with an error.
|
|
//
|
|
// This is especially useful in allowing a function to clean up properly
|
|
// on error, and replaces goto error handling tactics as seen in c.
|
|
fn deferErrorExample(is_error: bool) !void {
|
|
warn("\nstart of function\n", .{});
|
|
|
|
// This will always be executed on exit
|
|
defer {
|
|
warn("end of function\n", .{});
|
|
}
|
|
|
|
errdefer {
|
|
warn("encountered an error!\n", .{});
|
|
}
|
|
|
|
if (is_error) {
|
|
return error.DeferError;
|
|
}
|
|
}
|
|
|
|
test "errdefer unwinding" {
|
|
deferErrorExample(false) catch {};
|
|
deferErrorExample(true) catch {};
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Errors#}
|
|
{#header_close#}
|
|
{#header_open|unreachable#}
|
|
<p>
|
|
In {#syntax#}Debug{#endsyntax#} and {#syntax#}ReleaseSafe{#endsyntax#} mode, and when using <code>zig test</code>,
|
|
{#syntax#}unreachable{#endsyntax#} emits a call to {#syntax#}panic{#endsyntax#} with the message <code>reached unreachable code</code>.
|
|
</p>
|
|
<p>
|
|
In {#syntax#}ReleaseFast{#endsyntax#} mode, the optimizer uses the assumption that {#syntax#}unreachable{#endsyntax#} code
|
|
will never be hit to perform optimizations. However, <code>zig test</code> even in {#syntax#}ReleaseFast{#endsyntax#} mode
|
|
still emits {#syntax#}unreachable{#endsyntax#} as calls to {#syntax#}panic{#endsyntax#}.
|
|
</p>
|
|
{#header_open|Basics#}
|
|
{#code_begin|test#}
|
|
// unreachable is used to assert that control flow will never happen upon a
|
|
// particular location:
|
|
test "basic math" {
|
|
const x = 1;
|
|
const y = 2;
|
|
if (x + y != 3) {
|
|
unreachable;
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>In fact, this is how assert is implemented:</p>
|
|
{#code_begin|test_err#}
|
|
fn assert(ok: bool) void {
|
|
if (!ok) unreachable; // assertion failure
|
|
}
|
|
|
|
// This test will fail because we hit unreachable.
|
|
test "this will fail" {
|
|
assert(false);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|At Compile-Time#}
|
|
{#code_begin|test_err|unreachable code#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "type of unreachable" {
|
|
comptime {
|
|
// The type of unreachable is noreturn.
|
|
|
|
// However this assertion will still fail because
|
|
// evaluating unreachable at compile-time is a compile error.
|
|
|
|
assert(@TypeOf(unreachable) == noreturn);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Zig Test|Build Mode|comptime#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|noreturn#}
|
|
<p>
|
|
{#syntax#}noreturn{#endsyntax#} is the type of:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}break{#endsyntax#}</li>
|
|
<li>{#syntax#}continue{#endsyntax#}</li>
|
|
<li>{#syntax#}return{#endsyntax#}</li>
|
|
<li>{#syntax#}unreachable{#endsyntax#}</li>
|
|
<li>{#syntax#}while (true) {}{#endsyntax#}</li>
|
|
</ul>
|
|
<p>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:
|
|
</p>
|
|
{#code_begin|test#}
|
|
fn foo(condition: bool, b: u32) void {
|
|
const a = if (condition) b else return;
|
|
@panic("do something with a");
|
|
}
|
|
test "noreturn" {
|
|
foo(false, 1);
|
|
}
|
|
{#code_end#}
|
|
<p>Another use case for {#syntax#}noreturn{#endsyntax#} is the {#syntax#}exit{#endsyntax#} function:</p>
|
|
{#code_begin|test#}
|
|
{#target_windows#}
|
|
pub extern "kernel32" fn ExitProcess(exit_code: c_uint) callconv(.Stdcall) noreturn;
|
|
|
|
test "foo" {
|
|
const value = bar() catch ExitProcess(1);
|
|
assert(value == 1234);
|
|
}
|
|
|
|
fn bar() anyerror!u32 {
|
|
return 1234;
|
|
}
|
|
|
|
const assert = @import("std").debug.assert;
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Functions#}
|
|
{#code_begin|test|functions#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
// Functions are declared like this
|
|
fn add(a: i8, b: i8) i8 {
|
|
if (a == 0) {
|
|
return b;
|
|
}
|
|
|
|
return a + b;
|
|
}
|
|
|
|
// The export specifier makes a function externally visible in the generated
|
|
// object file, and makes it use the C ABI.
|
|
export fn sub(a: i8, b: i8) i8 { return a - b; }
|
|
|
|
// The extern specifier is used to declare a function that will be resolved
|
|
// at link time, when linking statically, or at runtime, when linking
|
|
// dynamically.
|
|
// The callconv specifier changes the calling convention of the function.
|
|
extern "kernel32" fn ExitProcess(exit_code: u32) callconv(.Stdcall) noreturn;
|
|
extern "c" fn atan2(a: f64, b: f64) f64;
|
|
|
|
// The @setCold builtin tells the optimizer that a function is rarely called.
|
|
fn abort() noreturn {
|
|
@setCold(true);
|
|
while (true) {}
|
|
}
|
|
|
|
// The naked calling convention makes a function not have any function prologue or epilogue.
|
|
// This can be useful when integrating with assembly.
|
|
fn _start() callconv(.Naked) noreturn {
|
|
abort();
|
|
}
|
|
|
|
// The inline specifier forces a function to be inlined at all call sites.
|
|
// If the function cannot be inlined, it is a compile-time error.
|
|
inline fn shiftLeftOne(a: u32) u32 {
|
|
return a << 1;
|
|
}
|
|
|
|
// The pub specifier allows the function to be visible when importing.
|
|
// Another file can use @import and call sub2
|
|
pub fn sub2(a: i8, b: i8) i8 { return a - b; }
|
|
|
|
// Functions can be used as values and are equivalent to pointers.
|
|
const call2_op = fn (a: i8, b: i8) i8;
|
|
fn do_op(fn_call: call2_op, op1: i8, op2: i8) i8 {
|
|
return fn_call(op1, op2);
|
|
}
|
|
|
|
test "function" {
|
|
assert(do_op(add, 5, 6) == 11);
|
|
assert(do_op(sub2, 5, 6) == -1);
|
|
}
|
|
{#code_end#}
|
|
<p>Function values are like pointers:</p>
|
|
{#code_begin|obj#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
comptime {
|
|
assert(@TypeOf(foo) == fn()void);
|
|
assert(@sizeOf(fn()void) == @sizeOf(?fn()void));
|
|
}
|
|
|
|
fn foo() void { }
|
|
{#code_end#}
|
|
{#header_open|Pass-by-value Parameters#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const Point = struct {
|
|
x: i32,
|
|
y: i32,
|
|
};
|
|
|
|
fn foo(point: Point) i32 {
|
|
// Here, `point` could be a reference, or a copy. The function body
|
|
// can ignore the difference and treat it as a value. Be very careful
|
|
// taking the address of the parameter - it should be treated as if
|
|
// the address will become invalid when the function returns.
|
|
return point.x + point.y;
|
|
}
|
|
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "pass struct to function" {
|
|
assert(foo(Point{ .x = 1, .y = 2 }) == 3);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
For extern functions, Zig follows the C ABI for passing structs and unions by value.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Function Parameter Type Inference#}
|
|
<p>
|
|
Function parameters can be declared with {#syntax#}var{#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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
fn addFortyTwo(x: var) @TypeOf(x) {
|
|
return x + 42;
|
|
}
|
|
|
|
test "fn type inference" {
|
|
assert(addFortyTwo(1) == 43);
|
|
assert(@TypeOf(addFortyTwo(1)) == comptime_int);
|
|
var y: i64 = 2;
|
|
assert(addFortyTwo(y) == 44);
|
|
assert(@TypeOf(addFortyTwo(y)) == i64);
|
|
}
|
|
{#code_end#}
|
|
|
|
{#header_close#}
|
|
{#header_open|Function Reflection#}
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "fn reflection" {
|
|
assert(@TypeOf(assert).ReturnType == void);
|
|
assert(@TypeOf(assert).is_var_args == false);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Errors#}
|
|
{#header_open|Error Set Type#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
The number of unique error values across the entire compilation should determine the size of the error set type.
|
|
However right now it is hard coded to be a {#syntax#}u16{#endsyntax#}. See <a href="https://github.com/ziglang/zig/issues/786">#768</a>.
|
|
</p>
|
|
<p>
|
|
You can {#link|coerce|Type Coercion#} an error from a subset to a superset:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
|
|
const FileOpenError = error {
|
|
AccessDenied,
|
|
OutOfMemory,
|
|
FileNotFound,
|
|
};
|
|
|
|
const AllocationError = error {
|
|
OutOfMemory,
|
|
};
|
|
|
|
test "coerce subset to superset" {
|
|
const err = foo(AllocationError.OutOfMemory);
|
|
std.debug.assert(err == FileOpenError.OutOfMemory);
|
|
}
|
|
|
|
fn foo(err: AllocationError) FileOpenError {
|
|
return err;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
But you cannot {#link|coerce|Type Coercion#} an error from a superset to a subset:
|
|
</p>
|
|
{#code_begin|test_err|not a member of destination error set#}
|
|
const FileOpenError = error {
|
|
AccessDenied,
|
|
OutOfMemory,
|
|
FileNotFound,
|
|
};
|
|
|
|
const AllocationError = error {
|
|
OutOfMemory,
|
|
};
|
|
|
|
test "coerce superset to subset" {
|
|
foo(FileOpenError.OutOfMemory) catch {};
|
|
}
|
|
|
|
fn foo(err: FileOpenError) AllocationError {
|
|
return err;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
There is a shortcut for declaring an error set with only 1 value, and then getting that value:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const err = error.FileNotFound;
|
|
{#code_end#}
|
|
<p>This is equivalent to:</p>
|
|
{#code_begin|syntax#}
|
|
const err = (error {FileNotFound}).FileNotFound;
|
|
{#code_end#}
|
|
<p>
|
|
This becomes useful when using {#link|Inferred Error Sets#}.
|
|
</p>
|
|
{#header_open|The Global Error Set#}
|
|
<p>{#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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Error Union Type#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Here is a function to parse a string into a 64-bit integer:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const maxInt = std.math.maxInt;
|
|
|
|
pub fn parseU64(buf: []const u8, radix: u8) !u64 {
|
|
var x: u64 = 0;
|
|
|
|
for (buf) |c| {
|
|
const digit = charToDigit(c);
|
|
|
|
if (digit >= radix) {
|
|
return error.InvalidChar;
|
|
}
|
|
|
|
// x *= radix
|
|
if (@mulWithOverflow(u64, x, radix, &x)) {
|
|
return error.Overflow;
|
|
}
|
|
|
|
// x += digit
|
|
if (@addWithOverflow(u64, x, digit, &x)) {
|
|
return error.Overflow;
|
|
}
|
|
}
|
|
|
|
return x;
|
|
}
|
|
|
|
fn charToDigit(c: u8) u8 {
|
|
return switch (c) {
|
|
'0' ... '9' => c - '0',
|
|
'A' ... 'Z' => c - 'A' + 10,
|
|
'a' ... 'z' => c - 'a' + 10,
|
|
else => maxInt(u8),
|
|
};
|
|
}
|
|
|
|
test "parse u64" {
|
|
const result = try parseU64("1234", 10);
|
|
std.debug.assert(result == 1234);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<p>
|
|
What it looks like to use this function varies depending on what you're
|
|
trying to do. One of the following:
|
|
</p>
|
|
<ul>
|
|
<li>You want to provide a default value if it returned an error.</li>
|
|
<li>If it returned an error then you want to return the same error.</li>
|
|
<li>You know with complete certainty it will not return an error, so want to unconditionally unwrap it.</li>
|
|
<li>You want to take a different action for each possible error.</li>
|
|
</ul>
|
|
{#header_open|catch#}
|
|
<p>If you want to provide a default value, you can use the {#syntax#}catch{#endsyntax#} binary operator:</p>
|
|
{#code_begin|syntax#}
|
|
fn doAThing(str: []u8) void {
|
|
const number = parseU64(str, 10) catch 13;
|
|
// ...
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|try#}
|
|
<p>Let's say you wanted to return the error if you got one, otherwise continue with the
|
|
function logic:</p>
|
|
{#code_begin|syntax#}
|
|
fn doAThing(str: []u8) !void {
|
|
const number = parseU64(str, 10) catch |err| return err;
|
|
// ...
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
There is a shortcut for this. The {#syntax#}try{#endsyntax#} expression:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn doAThing(str: []u8) !void {
|
|
const number = try parseU64(str, 10);
|
|
// ...
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
{#header_close#}
|
|
<p>
|
|
Maybe you know with complete certainty that an expression will never be an error.
|
|
In this case you can do this:
|
|
</p>
|
|
{#code_begin|syntax#}const number = parseU64("1234", 10) catch unreachable;{#code_end#}
|
|
<p>
|
|
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 Debug and ReleaseSafe modes and undefined behavior in ReleaseFast mode. So, while we're debugging the
|
|
application, if there <em>was</em> a surprise error here, the application would crash
|
|
appropriately.
|
|
</p>
|
|
<p>
|
|
Finally, you may want to take a different action for every situation. For that, we combine
|
|
the {#link|if#} and {#link|switch#} expression:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn doAThing(str: []u8) void {
|
|
if (parseU64(str, 10)) |number| {
|
|
doSomethingWithNumber(number);
|
|
} else |err| switch (err) {
|
|
error.Overflow => {
|
|
// handle overflow...
|
|
},
|
|
// we promise that InvalidChar won't happen (or crash in debug mode if it does)
|
|
error.InvalidChar => unreachable,
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_open|errdefer#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Example:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn createFoo(param: i32) !Foo {
|
|
const foo = try tryToAllocateFoo();
|
|
// now we have allocated foo. we need to free it if the function fails.
|
|
// but we want to return it if the function succeeds.
|
|
errdefer deallocateFoo(foo);
|
|
|
|
const tmp_buf = allocateTmpBuffer() orelse return error.OutOfMemory;
|
|
// tmp_buf is truly a temporary resource, and we for sure want to clean it up
|
|
// before this block leaves scope
|
|
defer deallocateTmpBuffer(tmp_buf);
|
|
|
|
if (param > 1337) return error.InvalidParam;
|
|
|
|
// here the errdefer will not run since we're returning success from the function.
|
|
// but the defer will run!
|
|
return foo;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
<p>
|
|
A couple of other tidbits about error handling:
|
|
</p>
|
|
<ul>
|
|
<li>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.
|
|
</li>
|
|
<li>
|
|
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.
|
|
</li>
|
|
</ul>
|
|
{#see_also|defer|if|switch#}
|
|
|
|
<p>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:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "error union" {
|
|
var foo: anyerror!i32 = undefined;
|
|
|
|
// Coerce from child type of an error union:
|
|
foo = 1234;
|
|
|
|
// Coerce from an error set:
|
|
foo = error.SomeError;
|
|
|
|
// Use compile-time reflection to access the payload type of an error union:
|
|
comptime assert(@TypeOf(foo).Payload == i32);
|
|
|
|
// Use compile-time reflection to access the error set type of an error union:
|
|
comptime assert(@TypeOf(foo).ErrorSet == anyerror);
|
|
}
|
|
{#code_end#}
|
|
{#header_open|Merging Error Sets#}
|
|
<p>
|
|
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 <code>A doc comment</code>.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const A = error{
|
|
NotDir,
|
|
|
|
/// A doc comment
|
|
PathNotFound,
|
|
};
|
|
const B = error{
|
|
OutOfMemory,
|
|
|
|
/// B doc comment
|
|
PathNotFound,
|
|
};
|
|
|
|
const C = A || B;
|
|
|
|
fn foo() C!void {
|
|
return error.NotDir;
|
|
}
|
|
|
|
test "merge error sets" {
|
|
if (foo()) {
|
|
@panic("unexpected");
|
|
} else |err| switch (err) {
|
|
error.OutOfMemory => @panic("unexpected"),
|
|
error.PathNotFound => @panic("unexpected"),
|
|
error.NotDir => {},
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Inferred Error Sets#}
|
|
<p>
|
|
Because many functions in Zig return a possible error, Zig supports inferring the error set.
|
|
To infer the error set for a function, use this syntax:
|
|
</p>
|
|
{#code_begin|test#}
|
|
// With an inferred error set
|
|
pub fn add_inferred(comptime T: type, a: T, b: T) !T {
|
|
var answer: T = undefined;
|
|
return if (@addWithOverflow(T, a, b, &answer)) error.Overflow else answer;
|
|
}
|
|
|
|
// With an explicit error set
|
|
pub fn add_explicit(comptime T: type, a: T, b: T) Error!T {
|
|
var answer: T = undefined;
|
|
return if (@addWithOverflow(T, a, b, &answer)) error.Overflow else answer;
|
|
}
|
|
|
|
const Error = error {
|
|
Overflow,
|
|
};
|
|
|
|
const std = @import("std");
|
|
|
|
test "inferred error set" {
|
|
if (add_inferred(u8, 255, 1)) |_| unreachable else |err| switch (err) {
|
|
error.Overflow => {}, // ok
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
These limitations may be overcome in a future version of Zig.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Error Return Traces#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|exe_err#}
|
|
pub fn main() !void {
|
|
try foo(12);
|
|
}
|
|
|
|
fn foo(x: i32) !void {
|
|
if (x >= 5) {
|
|
try bar();
|
|
} else {
|
|
try bang2();
|
|
}
|
|
}
|
|
|
|
fn bar() !void {
|
|
if (baz()) {
|
|
try quux();
|
|
} else |err| switch (err) {
|
|
error.FileNotFound => try hello(),
|
|
else => try another(),
|
|
}
|
|
}
|
|
|
|
fn baz() !void {
|
|
try bang1();
|
|
}
|
|
|
|
fn quux() !void {
|
|
try bang2();
|
|
}
|
|
|
|
fn hello() !void {
|
|
try bang2();
|
|
}
|
|
|
|
fn another() !void {
|
|
try bang1();
|
|
}
|
|
|
|
fn bang1() !void {
|
|
return error.FileNotFound;
|
|
}
|
|
|
|
fn bang2() !void {
|
|
return error.PermissionDenied;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Look closely at this example. This is no stack trace.
|
|
</p>
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|exe_err#}
|
|
pub fn main() void {
|
|
foo(12);
|
|
}
|
|
|
|
fn foo(x: i32) void {
|
|
if (x >= 5) {
|
|
bar();
|
|
} else {
|
|
bang2();
|
|
}
|
|
}
|
|
|
|
fn bar() void {
|
|
if (baz()) {
|
|
quux();
|
|
} else {
|
|
hello();
|
|
}
|
|
}
|
|
|
|
fn baz() bool {
|
|
return bang1();
|
|
}
|
|
|
|
fn quux() void {
|
|
bang2();
|
|
}
|
|
|
|
fn hello() void {
|
|
bang2();
|
|
}
|
|
|
|
fn bang1() bool {
|
|
return false;
|
|
}
|
|
|
|
fn bang2() void {
|
|
@panic("PermissionDenied");
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
There are a few ways to activate this error return tracing feature:
|
|
</p>
|
|
<ul>
|
|
<li>Return an error from main</li>
|
|
<li>An error makes its way to {#syntax#}catch unreachable{#endsyntax#} and you have not overridden the default panic handler</li>
|
|
<li>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.</li>
|
|
</ul>
|
|
{#header_open|Implementation Details#}
|
|
<p>
|
|
To analyze performance cost, there are two cases:
|
|
</p>
|
|
<ul>
|
|
<li>when no errors are returned</li>
|
|
<li>when returning errors</li>
|
|
</ul>
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
pub const StackTrace = struct {
|
|
index: usize,
|
|
instruction_addresses: [N]usize,
|
|
};
|
|
{#code_end#}
|
|
<p>
|
|
Here, N is the maximum function call depth as determined by call graph analysis. Recursion is ignored and counts for 2.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
That's it for the path when no errors occur. It's practically free in terms of performance.
|
|
</p>
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
// marked as "no-inline" in LLVM IR
|
|
fn __zig_return_error(stack_trace: *StackTrace) void {
|
|
stack_trace.instruction_addresses[stack_trace.index] = @returnAddress();
|
|
stack_trace.index = (stack_trace.index + 1) % N;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
As for code size cost, 1 function call before a return statement is no big deal. Even so,
|
|
I have <a href="https://github.com/ziglang/zig/issues/690">a plan</a> 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.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Optionals#}
|
|
<p>
|
|
One area that Zig provides safety without compromising efficiency or
|
|
readability is with the optional type.
|
|
</p>
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
// normal integer
|
|
const normal_int: i32 = 1234;
|
|
|
|
// optional integer
|
|
const optional_int: ?i32 = 5678;
|
|
{#code_end#}
|
|
<p>
|
|
Now the variable {#syntax#}optional_int{#endsyntax#} could be an {#syntax#}i32{#endsyntax#}, or {#syntax#}null{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
Instead of integers, let's talk about pointers. Null references are the source of many runtime
|
|
exceptions, and even stand accused of being
|
|
<a href="https://www.lucidchart.com/techblog/2015/08/31/the-worst-mistake-of-computer-science/">the worst mistake of computer science</a>.
|
|
</p>
|
|
<p>Zig does not have them.</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Task: call malloc, if the result is null, return null.
|
|
</p>
|
|
<p>C code</p>
|
|
<pre><code class="cpp">// malloc prototype included for reference
|
|
void *malloc(size_t size);
|
|
|
|
struct Foo *do_a_thing(void) {
|
|
char *ptr = malloc(1234);
|
|
if (!ptr) return NULL;
|
|
// ...
|
|
}</code></pre>
|
|
<p>Zig code</p>
|
|
{#code_begin|syntax#}
|
|
// malloc prototype included for reference
|
|
extern fn malloc(size: size_t) ?*u8;
|
|
|
|
fn doAThing() ?*Foo {
|
|
const ptr = malloc(1234) orelse return null;
|
|
// ...
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Here, Zig is at least as convenient, if not more, than C. And, the type of "ptr"
|
|
is {#syntax#}*u8{#endsyntax#} <em>not</em> {#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.
|
|
</p>
|
|
<p>
|
|
The other form of checking against NULL you might see looks like this:
|
|
</p>
|
|
<pre><code class="cpp">void do_a_thing(struct Foo *foo) {
|
|
// do some stuff
|
|
|
|
if (foo) {
|
|
do_something_with_foo(foo);
|
|
}
|
|
|
|
// do some stuff
|
|
}</code></pre>
|
|
<p>
|
|
In Zig you can accomplish the same thing:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn doAThing(optional_foo: ?*Foo) void {
|
|
// do some stuff
|
|
|
|
if (optional_foo) |foo| {
|
|
doSomethingWithFoo(foo);
|
|
}
|
|
|
|
// do some stuff
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
One benefit to this is that functions which take pointers as arguments can
|
|
be annotated with the "nonnull" attribute - <code>__attribute__((nonnull))</code> in
|
|
<a href="https://gcc.gnu.org/onlinedocs/gcc-4.0.0/gcc/Function-Attributes.html">GCC</a>.
|
|
The optimizer can sometimes make better decisions knowing that pointer arguments
|
|
cannot be null.
|
|
</p>
|
|
{#header_open|Optional Type#}
|
|
<p>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:</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "optional type" {
|
|
// Declare an optional and coerce from null:
|
|
var foo: ?i32 = null;
|
|
|
|
// Coerce from child type of an optional
|
|
foo = 1234;
|
|
|
|
// Use compile-time reflection to access the child type of the optional:
|
|
comptime assert(@TypeOf(foo).Child == i32);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|null#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const optional_value: ?i32 = null;
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Optional Pointers#}
|
|
<p>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.</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "optional pointers" {
|
|
// Pointers cannot be null. If you want a null pointer, use the optional
|
|
// prefix `?` to make the pointer type optional.
|
|
var ptr: ?*i32 = null;
|
|
|
|
var x: i32 = 1;
|
|
ptr = &x;
|
|
|
|
assert(ptr.?.* == 1);
|
|
|
|
// Optional pointers are the same size as normal pointers, because pointer
|
|
// value 0 is used as the null value.
|
|
assert(@sizeOf(?*i32) == @sizeOf(*i32));
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Casting#}
|
|
<p>
|
|
A <strong>type cast</strong> 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.
|
|
</p>
|
|
{#header_open|Type Coercion#}
|
|
<p>
|
|
Type coercion occurs when one type is expected, but different type is provided:
|
|
</p>
|
|
{#code_begin|test#}
|
|
test "type coercion - variable declaration" {
|
|
var a: u8 = 1;
|
|
var b: u16 = a;
|
|
}
|
|
|
|
test "type coercion - function call" {
|
|
var a: u8 = 1;
|
|
foo(a);
|
|
}
|
|
|
|
fn foo(b: u16) void {}
|
|
|
|
test "type coercion - @as builtin" {
|
|
var a: u8 = 1;
|
|
var b = @as(u16, a);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#header_open|Type Coercion: Stricter Qualification#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}const{#endsyntax#} - non-const to const is allowed</li>
|
|
<li>{#syntax#}volatile{#endsyntax#} - non-volatile to volatile is allowed</li>
|
|
<li>{#syntax#}align{#endsyntax#} - bigger to smaller alignment is allowed </li>
|
|
<li>{#link|error sets|Error Set Type#} to supersets is allowed</li>
|
|
</ul>
|
|
<p>
|
|
These casts are no-ops at runtime since the value representation does not change.
|
|
</p>
|
|
{#code_begin|test#}
|
|
test "type coercion - const qualification" {
|
|
var a: i32 = 1;
|
|
var b: *i32 = &a;
|
|
foo(b);
|
|
}
|
|
|
|
fn foo(a: *const i32) void {}
|
|
{#code_end#}
|
|
<p>
|
|
In addition, pointers coerce to const optional pointers:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
const mem = std.mem;
|
|
|
|
test "cast *[1][*]const u8 to [*]const ?[*]const u8" {
|
|
const window_name = [1][*]const u8{"window name"};
|
|
const x: [*]const ?[*]const u8 = &window_name;
|
|
assert(mem.eql(u8, std.mem.spanZ(@ptrCast([*:0]const u8, x[0].?)), "window name"));
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: Integer and Float Widening#}
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
const mem = std.mem;
|
|
|
|
test "integer widening" {
|
|
var a: u8 = 250;
|
|
var b: u16 = a;
|
|
var c: u32 = b;
|
|
var d: u64 = c;
|
|
var e: u64 = d;
|
|
var f: u128 = e;
|
|
assert(f == a);
|
|
}
|
|
|
|
test "implicit unsigned integer to signed integer" {
|
|
var a: u8 = 250;
|
|
var b: i16 = a;
|
|
assert(b == 250);
|
|
}
|
|
|
|
test "float widening" {
|
|
// Note: there is an open issue preventing this from working on aarch64:
|
|
// https://github.com/ziglang/zig/issues/3282
|
|
if (std.Target.current.cpu.arch == .aarch64) return error.SkipZigTest;
|
|
|
|
var a: f16 = 12.34;
|
|
var b: f32 = a;
|
|
var c: f64 = b;
|
|
var d: f128 = c;
|
|
assert(d == a);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: Arrays and Pointers#}
|
|
{#code_begin|test|coerce_arrays_and_ptrs#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
// This cast exists primarily so that string literals can be
|
|
// passed to functions that accept const slices. However
|
|
// it is probably going to be removed from the language when
|
|
// https://github.com/ziglang/zig/issues/265 is implemented.
|
|
test "[N]T to []const T" {
|
|
var x1: []const u8 = "hello";
|
|
var x2: []const u8 = &[5]u8{ 'h', 'e', 'l', 'l', 111 };
|
|
assert(std.mem.eql(u8, x1, x2));
|
|
|
|
var y: []const f32 = &[2]f32{ 1.2, 3.4 };
|
|
assert(y[0] == 1.2);
|
|
}
|
|
|
|
// Likewise, it works when the destination type is an error union.
|
|
test "[N]T to E![]const T" {
|
|
var x1: anyerror![]const u8 = "hello";
|
|
var x2: anyerror![]const u8 = &[5]u8{ 'h', 'e', 'l', 'l', 111 };
|
|
assert(std.mem.eql(u8, try x1, try x2));
|
|
|
|
var y: anyerror![]const f32 = &[2]f32{ 1.2, 3.4 };
|
|
assert((try y)[0] == 1.2);
|
|
}
|
|
|
|
// Likewise, it works when the destination type is an optional.
|
|
test "[N]T to ?[]const T" {
|
|
var x1: ?[]const u8 = "hello";
|
|
var x2: ?[]const u8 = &[5]u8{ 'h', 'e', 'l', 'l', 111 };
|
|
assert(std.mem.eql(u8, x1.?, x2.?));
|
|
|
|
var y: ?[]const f32 = &[2]f32{ 1.2, 3.4 };
|
|
assert(y.?[0] == 1.2);
|
|
}
|
|
|
|
// In this cast, the array length becomes the slice length.
|
|
test "*[N]T to []T" {
|
|
var buf: [5]u8 = "hello".*;
|
|
const x: []u8 = &buf;
|
|
assert(std.mem.eql(u8, x, "hello"));
|
|
|
|
const buf2 = [2]f32{ 1.2, 3.4 };
|
|
const x2: []const f32 = &buf2;
|
|
assert(std.mem.eql(f32, x2, &[2]f32{ 1.2, 3.4 }));
|
|
}
|
|
|
|
// Single-item pointers to arrays can be coerced to
|
|
// unknown length pointers.
|
|
test "*[N]T to [*]T" {
|
|
var buf: [5]u8 = "hello".*;
|
|
const x: [*]u8 = &buf;
|
|
assert(x[4] == 'o');
|
|
// x[5] would be an uncaught out of bounds pointer dereference!
|
|
}
|
|
|
|
// Likewise, it works when the destination type is an optional.
|
|
test "*[N]T to ?[*]T" {
|
|
var buf: [5]u8 = "hello".*;
|
|
const x: ?[*]u8 = &buf;
|
|
assert(x.?[4] == 'o');
|
|
}
|
|
|
|
// Single-item pointers can be cast to len-1 single-item arrays.
|
|
test "*T to *[1]T" {
|
|
var x: i32 = 1234;
|
|
const y: *[1]i32 = &x;
|
|
const z: [*]i32 = y;
|
|
assert(z[0] == 1234);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|C Pointers#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: Optionals#}
|
|
<p>
|
|
The payload type of {#link|Optionals#}, as well as {#link|null#}, coerce to the optional type.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "coerce to optionals" {
|
|
const x: ?i32 = 1234;
|
|
const y: ?i32 = null;
|
|
|
|
assert(x.? == 1234);
|
|
assert(y == null);
|
|
}
|
|
{#code_end#}
|
|
<p>It works nested inside the {#link|Error Union Type#}, too:</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "coerce to optionals wrapped in error union" {
|
|
const x: anyerror!?i32 = 1234;
|
|
const y: anyerror!?i32 = null;
|
|
|
|
assert((try x).? == 1234);
|
|
assert((try y) == null);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: Error Unions#}
|
|
<p>The payload type of an {#link|Error Union Type#} as well as the {#link|Error Set Type#}
|
|
coerce to the error union type:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "coercion to error unions" {
|
|
const x: anyerror!i32 = 1234;
|
|
const y: anyerror!i32 = error.Failure;
|
|
|
|
assert((try x) == 1234);
|
|
std.testing.expectError(error.Failure, y);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: Compile-Time Known Numbers#}
|
|
<p>When a number is {#link|comptime#}-known to be representable in the destination type,
|
|
it may be coerced:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "coercing large integer type to smaller one when value is comptime known to fit" {
|
|
const x: u64 = 255;
|
|
const y: u8 = x;
|
|
assert(y == 255);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: unions and enums#}
|
|
<p>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#}:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const E = enum {
|
|
One,
|
|
Two,
|
|
Three,
|
|
};
|
|
|
|
const U = union(E) {
|
|
One: i32,
|
|
Two: f32,
|
|
Three,
|
|
};
|
|
|
|
test "coercion between unions and enums" {
|
|
var u = U{ .Two = 12.34 };
|
|
var e: E = u;
|
|
assert(e == E.Two);
|
|
|
|
const three = E.Three;
|
|
var another_u: U = three;
|
|
assert(another_u == E.Three);
|
|
}
|
|
{#code_end#}
|
|
{#see_also|union|enum#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: Zero Bit Types#}
|
|
<p>{#link|Zero Bit Types#} may be coerced to single-item {#link|Pointers#},
|
|
regardless of const.</p>
|
|
<p>TODO document the reasoning for this</p>
|
|
<p>TODO document whether vice versa should work and why</p>
|
|
{#code_begin|test#}
|
|
test "coercion of zero bit types" {
|
|
var x: void = {};
|
|
var y: *void = x;
|
|
//var z: void = y; // TODO
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Type Coercion: undefined#}
|
|
<p>{#link|undefined#} can be cast to any type.</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Explicit Casts#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<ul>
|
|
<li>{#link|@bitCast#} - change type but maintain bit representation</li>
|
|
<li>{#link|@alignCast#} - make a pointer have more alignment</li>
|
|
<li>{#link|@boolToInt#} - convert true to 1 and false to 0</li>
|
|
<li>{#link|@enumToInt#} - obtain the integer tag value of an enum or tagged union</li>
|
|
<li>{#link|@errSetCast#} - convert to a smaller error set</li>
|
|
<li>{#link|@errorToInt#} - obtain the integer value of an error code</li>
|
|
<li>{#link|@floatCast#} - convert a larger float to a smaller float</li>
|
|
<li>{#link|@floatToInt#} - obtain the integer part of a float value</li>
|
|
<li>{#link|@intCast#} - convert between integer types</li>
|
|
<li>{#link|@intToEnum#} - obtain an enum value based on its integer tag value</li>
|
|
<li>{#link|@intToError#} - obtain an error code based on its integer value</li>
|
|
<li>{#link|@intToFloat#} - convert an integer to a float value</li>
|
|
<li>{#link|@intToPtr#} - convert an address to a pointer</li>
|
|
<li>{#link|@ptrCast#} - convert between pointer types</li>
|
|
<li>{#link|@ptrToInt#} - obtain the address of a pointer</li>
|
|
<li>{#link|@truncate#} - convert between integer types, chopping off bits</li>
|
|
</ul>
|
|
{#header_close#}
|
|
|
|
{#header_open|Peer Type Resolution#}
|
|
<p>Peer Type Resolution occurs in these places:</p>
|
|
<ul>
|
|
<li>{#link|switch#} expressions</li>
|
|
<li>{#link|if#} expressions</li>
|
|
<li>{#link|while#} expressions</li>
|
|
<li>{#link|for#} expressions</li>
|
|
<li>Multiple break statements in a block</li>
|
|
<li>Some {#link|binary operations|Table of Operators#}</li>
|
|
</ul>
|
|
<p>
|
|
This kind of type resolution chooses a type that all peer types can coerce into. Here are
|
|
some examples:
|
|
</p>
|
|
{#code_begin|test|peer_type_resolution#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
const mem = std.mem;
|
|
|
|
test "peer resolve int widening" {
|
|
var a: i8 = 12;
|
|
var b: i16 = 34;
|
|
var c = a + b;
|
|
assert(c == 46);
|
|
assert(@TypeOf(c) == i16);
|
|
}
|
|
|
|
test "peer resolve arrays of different size to const slice" {
|
|
assert(mem.eql(u8, boolToStr(true), "true"));
|
|
assert(mem.eql(u8, boolToStr(false), "false"));
|
|
comptime assert(mem.eql(u8, boolToStr(true), "true"));
|
|
comptime assert(mem.eql(u8, boolToStr(false), "false"));
|
|
}
|
|
fn boolToStr(b: bool) []const u8 {
|
|
return if (b) "true" else "false";
|
|
}
|
|
|
|
test "peer resolve array and const slice" {
|
|
testPeerResolveArrayConstSlice(true);
|
|
comptime testPeerResolveArrayConstSlice(true);
|
|
}
|
|
fn testPeerResolveArrayConstSlice(b: bool) void {
|
|
const value1 = if (b) "aoeu" else @as([]const u8, "zz");
|
|
const value2 = if (b) @as([]const u8, "zz") else "aoeu";
|
|
assert(mem.eql(u8, value1, "aoeu"));
|
|
assert(mem.eql(u8, value2, "zz"));
|
|
}
|
|
|
|
test "peer type resolution: ?T and T" {
|
|
assert(peerTypeTAndOptionalT(true, false).? == 0);
|
|
assert(peerTypeTAndOptionalT(false, false).? == 3);
|
|
comptime {
|
|
assert(peerTypeTAndOptionalT(true, false).? == 0);
|
|
assert(peerTypeTAndOptionalT(false, false).? == 3);
|
|
}
|
|
}
|
|
fn peerTypeTAndOptionalT(c: bool, b: bool) ?usize {
|
|
if (c) {
|
|
return if (b) null else @as(usize, 0);
|
|
}
|
|
|
|
return @as(usize, 3);
|
|
}
|
|
|
|
test "peer type resolution: *[0]u8 and []const u8" {
|
|
assert(peerTypeEmptyArrayAndSlice(true, "hi").len == 0);
|
|
assert(peerTypeEmptyArrayAndSlice(false, "hi").len == 1);
|
|
comptime {
|
|
assert(peerTypeEmptyArrayAndSlice(true, "hi").len == 0);
|
|
assert(peerTypeEmptyArrayAndSlice(false, "hi").len == 1);
|
|
}
|
|
}
|
|
fn peerTypeEmptyArrayAndSlice(a: bool, slice: []const u8) []const u8 {
|
|
if (a) {
|
|
return &[_]u8{};
|
|
}
|
|
|
|
return slice[0..1];
|
|
}
|
|
test "peer type resolution: *[0]u8, []const u8, and anyerror![]u8" {
|
|
{
|
|
var data = "hi".*;
|
|
const slice = data[0..];
|
|
assert((try peerTypeEmptyArrayAndSliceAndError(true, slice)).len == 0);
|
|
assert((try peerTypeEmptyArrayAndSliceAndError(false, slice)).len == 1);
|
|
}
|
|
comptime {
|
|
var data = "hi".*;
|
|
const slice = data[0..];
|
|
assert((try peerTypeEmptyArrayAndSliceAndError(true, slice)).len == 0);
|
|
assert((try peerTypeEmptyArrayAndSliceAndError(false, slice)).len == 1);
|
|
}
|
|
}
|
|
fn peerTypeEmptyArrayAndSliceAndError(a: bool, slice: []u8) anyerror![]u8 {
|
|
if (a) {
|
|
return &[_]u8{};
|
|
}
|
|
|
|
return slice[0..1];
|
|
}
|
|
|
|
test "peer type resolution: *const T and ?*T" {
|
|
const a = @intToPtr(*const usize, 0x123456780);
|
|
const b = @intToPtr(?*usize, 0x123456780);
|
|
assert(a == b);
|
|
assert(b == a);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Zero Bit Types#}
|
|
<p>For some types, {#link|@sizeOf#} is 0:</p>
|
|
<ul>
|
|
<li>{#link|void#}</li>
|
|
<li>The {#link|Integers#} {#syntax#}u0{#endsyntax#} and {#syntax#}i0{#endsyntax#}.</li>
|
|
<li>{#link|Arrays#} and {#link|Vectors#} with len 0, or with an element type that is a zero bit type.</li>
|
|
<li>An {#link|enum#} with only 1 tag.</li>
|
|
<li>A {#link|struct#} with all fields being zero bit types.</li>
|
|
<li>A {#link|union#} with only 1 field which is a zero bit type.</li>
|
|
<li>{#link|Pointers to Zero Bit Types#} are themselves zero bit types.</li>
|
|
</ul>
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
export fn entry() void {
|
|
var x: void = {};
|
|
var y: void = {};
|
|
x = y;
|
|
}
|
|
{#code_end#}
|
|
<p>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:</p>
|
|
<pre><code>0000000000000010 <entry>:
|
|
10: 55 push %rbp
|
|
11: 48 89 e5 mov %rsp,%rbp
|
|
14: 5d pop %rbp
|
|
15: c3 retq </code></pre>
|
|
<p>These assembly instructions do not have any code associated with the void values -
|
|
they only perform the function call prologue and epilog.</p>
|
|
|
|
{#header_open|void#}
|
|
<p>
|
|
{#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#}:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "turn HashMap into a set with void" {
|
|
var map = std.HashMap(i32, void, hash_i32, eql_i32).init(std.testing.allocator);
|
|
defer map.deinit();
|
|
|
|
_ = try map.put(1, {});
|
|
_ = try map.put(2, {});
|
|
|
|
assert(map.contains(2));
|
|
assert(!map.contains(3));
|
|
|
|
_ = map.remove(2);
|
|
assert(!map.contains(2));
|
|
}
|
|
|
|
fn hash_i32(x: i32) u32 {
|
|
return @bitCast(u32, x);
|
|
}
|
|
|
|
fn eql_i32(a: i32, b: i32) bool {
|
|
return a == b;
|
|
}
|
|
{#code_end#}
|
|
<p>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.
|
|
</p>
|
|
<p>
|
|
{#syntax#}void{#endsyntax#} is distinct from {#syntax#}c_void{#endsyntax#}, which is defined like this:
|
|
{#syntax#}pub const c_void = @Type(.Opaque);{#endsyntax#}.
|
|
{#syntax#}void{#endsyntax#} has a known size of 0 bytes, and {#syntax#}c_void{#endsyntax#} has an unknown, but non-zero, size.
|
|
</p>
|
|
<p>
|
|
Expressions of type {#syntax#}void{#endsyntax#} are the only ones whose value can be ignored. For example:
|
|
</p>
|
|
{#code_begin|test_err|expression value is ignored#}
|
|
test "ignoring expression value" {
|
|
foo();
|
|
}
|
|
|
|
fn foo() i32 {
|
|
return 1234;
|
|
}
|
|
{#code_end#}
|
|
<p>However, if the expression has type {#syntax#}void{#endsyntax#}, there will be no error. Function return values can also be explicitly ignored by assigning them to {#syntax#}_{#endsyntax#}. </p>
|
|
{#code_begin|test#}
|
|
test "void is ignored" {
|
|
returnsVoid();
|
|
}
|
|
|
|
test "explicitly ignoring expression value" {
|
|
_ = foo();
|
|
}
|
|
|
|
fn returnsVoid() void {}
|
|
|
|
fn foo() i32 {
|
|
return 1234;
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Pointers to Zero Bit Types#}
|
|
<p>Pointers to zero bit types also have zero bits. They always compare equal to each other:</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "pointer to empty struct" {
|
|
const Empty = struct {};
|
|
var a = Empty{};
|
|
var b = Empty{};
|
|
var ptr_a = &a;
|
|
var ptr_b = &b;
|
|
comptime assert(ptr_a == ptr_b);
|
|
}
|
|
{#code_end#}
|
|
<p>The type being pointed to can only ever be one value; therefore loads and stores are
|
|
never generated. {#link|ptrToInt#} and {#link|intToPtr#} are not allowed:</p>
|
|
{#code_begin|test_err#}
|
|
const Empty = struct {};
|
|
|
|
test "@ptrToInt for pointer to zero bit type" {
|
|
var a = Empty{};
|
|
_ = @ptrToInt(&a);
|
|
}
|
|
|
|
test "@intToPtr for pointer to zero bit type" {
|
|
_ = @intToPtr(*Empty, 0x1);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Result Location Semantics#}
|
|
<p>
|
|
<a href="https://github.com/ziglang/zig/issues/2809">TODO add documentation for this</a>
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|usingnamespace#}
|
|
<p>
|
|
{#syntax#}usingnamespace{#endsyntax#} is a top level declaration that imports all the public declarations of
|
|
the operand, which must be a {#link|struct#}, {#link|union#}, or {#link|enum#}, into the current scope:
|
|
</p>
|
|
{#code_begin|test|usingnamespace#}
|
|
usingnamespace @import("std");
|
|
|
|
test "using std namespace" {
|
|
debug.assert(true);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Instead of the above pattern, it is generally recommended to explicitly alias individual declarations.
|
|
However, {#syntax#}usingnamespace{#endsyntax#} has an important use case when organizing the public
|
|
API of a file or package. For example, one might have <code>c.zig</code> with all of the
|
|
{#link|C imports|Import from C Header File#}:
|
|
</p>
|
|
<pre>{#syntax#}
|
|
pub usingnamespace @cImport({
|
|
@cInclude("epoxy/gl.h");
|
|
@cInclude("GLFW/glfw3.h");
|
|
@cDefine("STBI_ONLY_PNG", "");
|
|
@cDefine("STBI_NO_STDIO", "");
|
|
@cInclude("stb_image.h");
|
|
});
|
|
{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|comptime#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_open|Introducing the Compile-Time Concept#}
|
|
{#header_open|Compile-Time Parameters#}
|
|
<p>
|
|
Compile-time parameters is how Zig implements generics. It is compile-time duck typing.
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn max(comptime T: type, a: T, b: T) T {
|
|
return if (a > b) a else b;
|
|
}
|
|
fn gimmeTheBiggerFloat(a: f32, b: f32) f32 {
|
|
return max(f32, a, b);
|
|
}
|
|
fn gimmeTheBiggerInteger(a: u64, b: u64) u64 {
|
|
return max(u64, a, b);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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 <em>compile-time</em>,
|
|
which is why the parameter {#syntax#}T{#endsyntax#} in the above snippet must be marked with {#syntax#}comptime{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
A {#syntax#}comptime{#endsyntax#} parameter means that:
|
|
</p>
|
|
<ul>
|
|
<li>At the callsite, the value must be known at compile-time, or it is a compile error.</li>
|
|
<li>In the function definition, the value is known at compile-time.</li>
|
|
</ul>
|
|
<p>
|
|
For example, if we were to introduce another function to the above snippet:
|
|
</p>
|
|
{#code_begin|test_err|values of type 'type' must be comptime known#}
|
|
fn max(comptime T: type, a: T, b: T) T {
|
|
return if (a > b) a else b;
|
|
}
|
|
test "try to pass a runtime type" {
|
|
foo(false);
|
|
}
|
|
fn foo(condition: bool) void {
|
|
const result = max(
|
|
if (condition) f32 else u64,
|
|
1234,
|
|
5678);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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 <em>compile-time duck typing</em>.
|
|
</p>
|
|
<p>
|
|
For example:
|
|
</p>
|
|
{#code_begin|test_err|operator not allowed for type 'bool'#}
|
|
fn max(comptime T: type, a: T, b: T) T {
|
|
return if (a > b) a else b;
|
|
}
|
|
test "try to compare bools" {
|
|
_ = max(bool, true, false);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|test#}
|
|
fn max(comptime T: type, a: T, b: T) T {
|
|
if (T == bool) {
|
|
return a or b;
|
|
} else if (a > b) {
|
|
return a;
|
|
} else {
|
|
return b;
|
|
}
|
|
}
|
|
test "try to compare bools" {
|
|
@import("std").debug.assert(max(bool, false, true) == true);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
This means that the actual function generated for {#syntax#}max{#endsyntax#} in this situation looks like
|
|
this:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn max(a: bool, b: bool) bool {
|
|
return a or b;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
This works the same way for {#syntax#}switch{#endsyntax#} expressions - they are implicitly inlined
|
|
when the target expression is compile-time known.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Compile-Time Variables#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
For example:
|
|
</p>
|
|
{#code_begin|test|comptime_vars#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
const CmdFn = struct {
|
|
name: []const u8,
|
|
func: fn(i32) i32,
|
|
};
|
|
|
|
const cmd_fns = [_]CmdFn{
|
|
CmdFn {.name = "one", .func = one},
|
|
CmdFn {.name = "two", .func = two},
|
|
CmdFn {.name = "three", .func = three},
|
|
};
|
|
fn one(value: i32) i32 { return value + 1; }
|
|
fn two(value: i32) i32 { return value + 2; }
|
|
fn three(value: i32) i32 { return value + 3; }
|
|
|
|
fn performFn(comptime prefix_char: u8, start_value: i32) i32 {
|
|
var result: i32 = start_value;
|
|
comptime var i = 0;
|
|
inline while (i < cmd_fns.len) : (i += 1) {
|
|
if (cmd_fns[i].name[0] == prefix_char) {
|
|
result = cmd_fns[i].func(result);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
test "perform fn" {
|
|
assert(performFn('t', 1) == 6);
|
|
assert(performFn('o', 0) == 1);
|
|
assert(performFn('w', 99) == 99);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
// From the line:
|
|
// assert(performFn('t', 1) == 6);
|
|
fn performFn(start_value: i32) i32 {
|
|
var result: i32 = start_value;
|
|
result = two(result);
|
|
result = three(result);
|
|
return result;
|
|
}
|
|
{#code_end#}
|
|
{#code_begin|syntax#}
|
|
// From the line:
|
|
// assert(performFn('o', 0) == 1);
|
|
fn performFn(start_value: i32) i32 {
|
|
var result: i32 = start_value;
|
|
result = one(result);
|
|
return result;
|
|
}
|
|
{#code_end#}
|
|
{#code_begin|syntax#}
|
|
// From the line:
|
|
// assert(performFn('w', 99) == 99);
|
|
fn performFn(start_value: i32) i32 {
|
|
var result: i32 = start_value;
|
|
return result;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Note that this happens even in a debug build; in a release build these generated functions still
|
|
pass through rigorous LLVM optimizations. The important thing to note, however, is not that this
|
|
is a way to write more optimized code, but that it is a way to make sure that what <em>should</em> happen
|
|
at compile-time, <em>does</em> happen at compile-time. This catches more errors and as demonstrated
|
|
later in this article, allows expressiveness that in other languages requires using macros,
|
|
generated code, or a preprocessor to accomplish.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Compile-Time Expressions#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|test_err|unable to evaluate constant expression#}
|
|
extern fn exit() noreturn;
|
|
|
|
test "foo" {
|
|
comptime {
|
|
exit();
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Within a {#syntax#}comptime{#endsyntax#} expression:
|
|
</p>
|
|
<ul>
|
|
<li>All variables are {#syntax#}comptime{#endsyntax#} variables.</li>
|
|
<li>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.</li>
|
|
<li>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 run-time side effects.</li>
|
|
</ul>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Let's look at an example:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
fn fibonacci(index: u32) u32 {
|
|
if (index < 2) return index;
|
|
return fibonacci(index - 1) + fibonacci(index - 2);
|
|
}
|
|
|
|
test "fibonacci" {
|
|
// test fibonacci at run-time
|
|
assert(fibonacci(7) == 13);
|
|
|
|
// test fibonacci at compile-time
|
|
comptime {
|
|
assert(fibonacci(7) == 13);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Imagine if we had forgotten the base case of the recursive function and tried to run the tests:
|
|
</p>
|
|
{#code_begin|test_err|operation caused overflow#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
fn fibonacci(index: u32) u32 {
|
|
//if (index < 2) return index;
|
|
return fibonacci(index - 1) + fibonacci(index - 2);
|
|
}
|
|
|
|
test "fibonacci" {
|
|
comptime {
|
|
assert(fibonacci(7) == 13);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
The compiler produces an error which is a stack trace from trying to evaluate the
|
|
function at compile-time.
|
|
</p>
|
|
<p>
|
|
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?
|
|
</p>
|
|
{#code_begin|test_err|evaluation exceeded 1000 backwards branches#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
fn fibonacci(index: i32) i32 {
|
|
//if (index < 2) return index;
|
|
return fibonacci(index - 1) + fibonacci(index - 2);
|
|
}
|
|
|
|
test "fibonacci" {
|
|
comptime {
|
|
assert(fibonacci(7) == 13);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
The compiler noticed that evaluating this function at compile-time took a long time,
|
|
and thus emitted a compile error and gave 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.
|
|
</p>
|
|
<p>
|
|
What if we fix the base case, but put the wrong value in the {#syntax#}assert{#endsyntax#} line?
|
|
</p>
|
|
{#code_begin|test_err|unable to evaluate constant expression#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
fn fibonacci(index: i32) i32 {
|
|
if (index < 2) return index;
|
|
return fibonacci(index - 1) + fibonacci(index - 2);
|
|
}
|
|
|
|
test "fibonacci" {
|
|
comptime {
|
|
assert(fibonacci(7) == 99999);
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
What happened is Zig started interpreting the {#syntax#}assert{#endsyntax#} function with the
|
|
parameter {#syntax#}ok{#endsyntax#} set to {#syntax#}false{#endsyntax#}. When the interpreter hit
|
|
{#syntax#}unreachable{#endsyntax#} it emitted a compile error, because reaching unreachable
|
|
code is undefined behavior, and undefined behavior causes a compile error if it is detected
|
|
at compile-time.
|
|
</p>
|
|
|
|
<p>
|
|
In the global scope (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:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const first_25_primes = firstNPrimes(25);
|
|
const sum_of_first_25_primes = sum(&first_25_primes);
|
|
|
|
fn firstNPrimes(comptime n: usize) [n]i32 {
|
|
var prime_list: [n]i32 = undefined;
|
|
var next_index: usize = 0;
|
|
var test_number: i32 = 2;
|
|
while (next_index < prime_list.len) : (test_number += 1) {
|
|
var test_prime_index: usize = 0;
|
|
var is_prime = true;
|
|
while (test_prime_index < next_index) : (test_prime_index += 1) {
|
|
if (test_number % prime_list[test_prime_index] == 0) {
|
|
is_prime = false;
|
|
break;
|
|
}
|
|
}
|
|
if (is_prime) {
|
|
prime_list[next_index] = test_number;
|
|
next_index += 1;
|
|
}
|
|
}
|
|
return prime_list;
|
|
}
|
|
|
|
fn sum(numbers: []const i32) i32 {
|
|
var result: i32 = 0;
|
|
for (numbers) |x| {
|
|
result += x;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
test "variable values" {
|
|
@import("std").debug.assert(sum_of_first_25_primes == 1060);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
When we compile this program, Zig generates the constants
|
|
with the answer pre-computed. Here are the lines from the generated LLVM IR:
|
|
</p>
|
|
<pre><code class="llvm">@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</code></pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Generic Data Structures#}
|
|
<p>
|
|
Zig uses these capabilities to implement generic data structures without introducing any
|
|
special-case syntax. If you followed along so far, you may already know how to create a
|
|
generic data structure.
|
|
</p>
|
|
<p>
|
|
Here is an example of a generic {#syntax#}List{#endsyntax#} data structure, that we will instantiate with
|
|
the type {#syntax#}i32{#endsyntax#}. In Zig we refer to the type as {#syntax#}List(i32){#endsyntax#}.
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn List(comptime T: type) type {
|
|
return struct {
|
|
items: []T,
|
|
len: usize,
|
|
};
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
To keep the language small and uniform, all aggregate types in Zig are anonymous. To give a type
|
|
a name, we assign it to a constant:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const Node = struct {
|
|
next: *Node,
|
|
name: []u8,
|
|
};
|
|
{#code_end#}
|
|
<p>
|
|
This works because all top level declarations are order-independent, and as long as there isn't
|
|
an actual infinite regression, values can refer to themselves, directly or indirectly. In this case,
|
|
{#syntax#}Node{#endsyntax#} refers to itself as a pointer, which is not actually an infinite regression, so
|
|
it works fine.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Case Study: printf in Zig#}
|
|
<p>
|
|
Putting all of this together, let's see how {#syntax#}printf{#endsyntax#} works in Zig.
|
|
</p>
|
|
{#code_begin|exe|printf#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
const a_number: i32 = 1234;
|
|
const a_string = "foobar";
|
|
|
|
pub fn main() void {
|
|
warn("here is a string: '{}' here is a number: {}\n", .{a_string, a_number});
|
|
}
|
|
{#code_end#}
|
|
|
|
<p>
|
|
Let's crack open the implementation of this and see how it works:
|
|
</p>
|
|
|
|
{#code_begin|syntax#}
|
|
/// Calls print and then flushes the buffer.
|
|
pub fn printf(self: *OutStream, comptime format: []const u8, args: var) anyerror!void {
|
|
const State = enum {
|
|
Start,
|
|
OpenBrace,
|
|
CloseBrace,
|
|
};
|
|
|
|
comptime var start_index: usize = 0;
|
|
comptime var state = State.Start;
|
|
comptime var next_arg: usize = 0;
|
|
|
|
inline for (format) |c, i| {
|
|
switch (state) {
|
|
State.Start => switch (c) {
|
|
'{' => {
|
|
if (start_index < i) try self.write(format[start_index..i]);
|
|
state = State.OpenBrace;
|
|
},
|
|
'}' => {
|
|
if (start_index < i) try self.write(format[start_index..i]);
|
|
state = State.CloseBrace;
|
|
},
|
|
else => {},
|
|
},
|
|
State.OpenBrace => switch (c) {
|
|
'{' => {
|
|
state = State.Start;
|
|
start_index = i;
|
|
},
|
|
'}' => {
|
|
try self.printValue(args[next_arg]);
|
|
next_arg += 1;
|
|
state = State.Start;
|
|
start_index = i + 1;
|
|
},
|
|
else => @compileError("Unknown format character: " ++ c),
|
|
},
|
|
State.CloseBrace => switch (c) {
|
|
'}' => {
|
|
state = State.Start;
|
|
start_index = i;
|
|
},
|
|
else => @compileError("Single '}' encountered in format string"),
|
|
},
|
|
}
|
|
}
|
|
comptime {
|
|
if (args.len != next_arg) {
|
|
@compileError("Unused arguments");
|
|
}
|
|
if (state != State.Start) {
|
|
@compileError("Incomplete format string: " ++ format);
|
|
}
|
|
}
|
|
if (start_index < format.len) {
|
|
try self.write(format[start_index..format.len]);
|
|
}
|
|
try self.flush();
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This is a proof of concept implementation; the actual function in the standard library has more
|
|
formatting capabilities.
|
|
</p>
|
|
<p>
|
|
Note that this is not hard-coded into the Zig compiler; this is userland code in the standard library.
|
|
</p>
|
|
<p>
|
|
When this function is analyzed from our example code above, Zig partially evaluates the function
|
|
and emits a function that actually looks like this:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
pub fn printf(self: *OutStream, arg0: i32, arg1: []const u8) !void {
|
|
try self.write("here is a string: '");
|
|
try self.printValue(arg0);
|
|
try self.write("' here is a number: ");
|
|
try self.printValue(arg1);
|
|
try self.write("\n");
|
|
try self.flush();
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#syntax#}printValue{#endsyntax#} is a function that takes a parameter of any type, and does different things depending
|
|
on the type:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
pub fn printValue(self: *OutStream, value: var) !void {
|
|
switch (@typeInfo(@TypeOf(value))) {
|
|
.Int => {
|
|
return self.printInt(T, value);
|
|
},
|
|
.Float => {
|
|
return self.printFloat(T, value);
|
|
},
|
|
else => {
|
|
@compileError("Unable to print type '" ++ @typeName(T) ++ "'");
|
|
},
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
And now, what happens if we give too many arguments to {#syntax#}printf{#endsyntax#}?
|
|
</p>
|
|
{#code_begin|test_err|Unused arguments#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
const a_number: i32 = 1234;
|
|
const a_string = "foobar";
|
|
|
|
test "printf too many arguments" {
|
|
warn("here is a string: '{}' here is a number: {}\n", .{
|
|
a_string,
|
|
a_number,
|
|
a_number,
|
|
});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Zig gives programmers the tools needed to protect themselves against their own mistakes.
|
|
</p>
|
|
<p>
|
|
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#}:
|
|
</p>
|
|
{#code_begin|exe|printf#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
const a_number: i32 = 1234;
|
|
const a_string = "foobar";
|
|
const fmt = "here is a string: '{}' here is a number: {}\n";
|
|
|
|
pub fn main() void {
|
|
warn(fmt, .{a_string, a_number});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This works fine.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
{#see_also|inline while|inline for#}
|
|
{#header_close#}
|
|
{#header_open|Assembly#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|exe#}
|
|
{#target_linux_x86_64#}
|
|
pub fn main() noreturn {
|
|
const msg = "hello world\n";
|
|
_ = syscall3(SYS_write, STDOUT_FILENO, @ptrToInt(msg), msg.len);
|
|
_ = syscall1(SYS_exit, 0);
|
|
unreachable;
|
|
}
|
|
|
|
pub const SYS_write = 1;
|
|
pub const SYS_exit = 60;
|
|
|
|
pub const STDOUT_FILENO = 1;
|
|
|
|
pub fn syscall1(number: usize, arg1: usize) usize {
|
|
return asm volatile ("syscall"
|
|
: [ret] "={rax}" (-> usize)
|
|
: [number] "{rax}" (number),
|
|
[arg1] "{rdi}" (arg1)
|
|
: "rcx", "r11"
|
|
);
|
|
}
|
|
|
|
pub fn syscall3(number: usize, arg1: usize, arg2: usize, arg3: usize) usize {
|
|
return asm volatile ("syscall"
|
|
: [ret] "={rax}" (-> usize)
|
|
: [number] "{rax}" (number),
|
|
[arg1] "{rdi}" (arg1),
|
|
[arg2] "{rsi}" (arg2),
|
|
[arg3] "{rdx}" (arg3)
|
|
: "rcx", "r11"
|
|
);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Dissecting the syntax:
|
|
</p>
|
|
<pre>{#syntax#}// Inline assembly is an expression which returns a value.
|
|
// the `asm` keyword begins the expression.
|
|
_ = asm
|
|
// `volatile` is an optional modifier that tells Zig this
|
|
// inline assembly expression has side-effects. Without
|
|
// `volatile`, Zig is allowed to delete the inline assembly
|
|
// code if the result is unused.
|
|
volatile (
|
|
// Next is a comptime string which is the assembly code.
|
|
// Inside this string one may use `%[ret]`, `%[number]`,
|
|
// or `%[arg1]` where a register is expected, to specify
|
|
// the register that Zig uses for the argument or return value,
|
|
// if the register constraint strings are used. However in
|
|
// the below code, this is not used. A literal `%` can be
|
|
// obtained by escaping it with a double percent: `%%`.
|
|
// Often multiline string syntax comes in handy here.
|
|
\\syscall
|
|
// Next is the output. It is possible in the future Zig will
|
|
// support multiple outputs, depending on how
|
|
// https://github.com/ziglang/zig/issues/215 is resolved.
|
|
// It is allowed for there to be no outputs, in which case
|
|
// this colon would be directly followed by the colon for the inputs.
|
|
:
|
|
// This specifies the name to be used in `%[ret]` syntax in
|
|
// the above assembly string. This example does not use it,
|
|
// but the syntax is mandatory.
|
|
[ret]
|
|
// Next is the output constraint string. This feature is still
|
|
// considered unstable in Zig, and so LLVM/GCC documentation
|
|
// must be used to understand the semantics.
|
|
// http://releases.llvm.org/10.0.0/docs/LangRef.html#inline-asm-constraint-string
|
|
// https://gcc.gnu.org/onlinedocs/gcc/Extended-Asm.html
|
|
// In this example, the constraint string means "the result value of
|
|
// this inline assembly instruction is whatever is in $rax".
|
|
"={rax}"
|
|
// Next is either a value binding, or `->` and then a type. The
|
|
// type is the result type of the inline assembly expression.
|
|
// If it is a value binding, then `%[ret]` syntax would be used
|
|
// to refer to the register bound to the value.
|
|
(-> usize)
|
|
// Next is the list of inputs.
|
|
// The constraint for these inputs means, "when the assembly code is
|
|
// executed, $rax shall have the value of `number` and $rdi shall have
|
|
// the value of `arg1`". Any number of input parameters is allowed,
|
|
// including none.
|
|
: [number] "{rax}" (number),
|
|
[arg1] "{rdi}" (arg1)
|
|
// Next is the list of clobbers. These declare a set of registers whose
|
|
// values will not be preserved by the execution of this assembly code.
|
|
// These do not include output or input registers. The special clobber
|
|
// value of "memory" means that the assembly writes to arbitrary undeclared
|
|
// memory locations - not only the memory pointed to by a declared indirect
|
|
// output. In this example we list $rcx and $r11 because it is known the
|
|
// kernel syscall does not preserve these registers.
|
|
: "rcx", "r11"
|
|
);{#endsyntax#}</pre>
|
|
<p>
|
|
For i386 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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_open|Output Constraints#}
|
|
<p>
|
|
Output constraints are still considered to be unstable in Zig, and
|
|
so
|
|
<a href="http://releases.llvm.org/10.0.0/docs/LangRef.html#inline-asm-constraint-string">LLVM documentation</a>
|
|
and
|
|
<a href="https://gcc.gnu.org/onlinedocs/gcc/Extended-Asm.html">GCC documentation</a>
|
|
must be used to understand the semantics.
|
|
</p>
|
|
<p>
|
|
Note that some breaking changes to output constraints are planned with
|
|
<a href="https://github.com/ziglang/zig/issues/215">issue #215</a>.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Input Constraints#}
|
|
<p>
|
|
Input constraints are still considered to be unstable in Zig, and
|
|
so
|
|
<a href="http://releases.llvm.org/10.0.0/docs/LangRef.html#inline-asm-constraint-string">LLVM documentation</a>
|
|
and
|
|
<a href="https://gcc.gnu.org/onlinedocs/gcc/Extended-Asm.html">GCC documentation</a>
|
|
must be used to understand the semantics.
|
|
</p>
|
|
<p>
|
|
Note that some breaking changes to input constraints are planned with
|
|
<a href="https://github.com/ziglang/zig/issues/215">issue #215</a>.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Clobbers#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Failure to declare the full set of clobbers for a given inline assembly
|
|
expression is unchecked {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Global Assembly#}
|
|
<p>
|
|
When an assembly expression occurs in a top level {#link|comptime#} block, this is
|
|
<strong>global assembly</strong>.
|
|
</p>
|
|
<p>
|
|
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
|
|
<code>%</code> as there are in inline assembly expressions.
|
|
</p>
|
|
{#code_begin|test|global-asm#}
|
|
{#target_linux_x86_64#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
comptime {
|
|
asm (
|
|
\\.global my_func;
|
|
\\.type my_func, @function;
|
|
\\my_func:
|
|
\\ lea (%rdi,%rsi,1),%eax
|
|
\\ retq
|
|
);
|
|
}
|
|
|
|
extern fn my_func(a: i32, b: i32) i32;
|
|
|
|
test "global assembly" {
|
|
assert(my_func(12, 34) == 46);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Atomics#}
|
|
<p>TODO: @fence()</p>
|
|
<p>TODO: @atomic rmw</p>
|
|
<p>TODO: builtin atomic memory ordering enum</p>
|
|
{#header_close#}
|
|
{#header_open|Async Functions#}
|
|
<p>
|
|
When a function is called, a frame is pushed to the stack,
|
|
the function runs until it reaches a return statement, and then the frame is popped from the stack.
|
|
At the callsite, the following code does not run until the function returns.
|
|
</p>
|
|
<p>
|
|
An async function is a function whose callsite is split into an {#syntax#}async{#endsyntax#} initiation,
|
|
followed by an {#syntax#}await{#endsyntax#} completion. Its frame is
|
|
provided explicitly by the caller, and it can be suspended and resumed any number of times.
|
|
</p>
|
|
<p>
|
|
Zig infers that a function is {#syntax#}async{#endsyntax#} when it observes that the function contains
|
|
a <strong>suspension point</strong>. Async functions can be called the same as normal functions. A
|
|
function call of an async function is a suspend point.
|
|
</p>
|
|
{#header_open|Suspend and Resume#}
|
|
<p>
|
|
At any point, a function may suspend itself. This causes control flow to
|
|
return to the callsite (in the case of the first suspension),
|
|
or resumer (in the case of subsequent suspensions).
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
var x: i32 = 1;
|
|
|
|
test "suspend with no resume" {
|
|
var frame = async func();
|
|
assert(x == 2);
|
|
}
|
|
|
|
fn func() void {
|
|
x += 1;
|
|
suspend;
|
|
// This line is never reached because the suspend has no matching resume.
|
|
x += 1;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
In the same way that each allocation should have a corresponding free,
|
|
Each {#syntax#}suspend{#endsyntax#} should have a corresponding {#syntax#}resume{#endsyntax#}.
|
|
A <strong>suspend block</strong> allows a function to put a pointer to its own
|
|
frame somewhere, for example into an event loop, even if that action will perform a
|
|
{#syntax#}resume{#endsyntax#} operation on a different thread.
|
|
{#link|@frame#} provides access to the async function frame pointer.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
var the_frame: anyframe = undefined;
|
|
var result = false;
|
|
|
|
test "async function suspend with block" {
|
|
_ = async testSuspendBlock();
|
|
assert(!result);
|
|
resume the_frame;
|
|
assert(result);
|
|
}
|
|
|
|
fn testSuspendBlock() void {
|
|
suspend {
|
|
comptime assert(@TypeOf(@frame()) == *@Frame(testSuspendBlock));
|
|
the_frame = @frame();
|
|
}
|
|
result = true;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#syntax#}suspend{#endsyntax#} causes a function to be {#syntax#}async{#endsyntax#}.
|
|
</p>
|
|
|
|
{#header_open|Resuming from Suspend Blocks#}
|
|
<p>
|
|
Upon entering a {#syntax#}suspend{#endsyntax#} block, the async function is already considered
|
|
suspended, and can be resumed. For example, if you started another kernel thread,
|
|
and had that thread call {#syntax#}resume{#endsyntax#} on the frame pointer provided by the
|
|
{#link|@frame#}, the new thread would begin executing after the suspend
|
|
block, while the old thread continued executing the suspend block.
|
|
</p>
|
|
<p>
|
|
However, the async function can be directly resumed from the suspend block, in which case it
|
|
never returns to its resumer and continues executing.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "resume from suspend" {
|
|
var my_result: i32 = 1;
|
|
_ = async testResumeFromSuspend(&my_result);
|
|
std.debug.assert(my_result == 2);
|
|
}
|
|
fn testResumeFromSuspend(my_result: *i32) void {
|
|
suspend {
|
|
resume @frame();
|
|
}
|
|
my_result.* += 1;
|
|
suspend;
|
|
my_result.* += 1;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This is guaranteed to tail call, and therefore will not cause a new stack frame.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Async and Await#}
|
|
<p>
|
|
In the same way that every {#syntax#}suspend{#endsyntax#} has a matching
|
|
{#syntax#}resume{#endsyntax#}, every {#syntax#}async{#endsyntax#} has a matching {#syntax#}await{#endsyntax#}.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "async and await" {
|
|
// Here we have an exception where we do not match an async
|
|
// with an await. The test block is not async and so cannot
|
|
// have a suspend point in it.
|
|
// This is well-defined behavior, and everything is OK here.
|
|
// Note however that there would be no way to collect the
|
|
// return value of amain, if it were something other than void.
|
|
_ = async amain();
|
|
}
|
|
|
|
fn amain() void {
|
|
var frame = async func();
|
|
comptime assert(@TypeOf(frame) == @Frame(func));
|
|
|
|
const ptr: anyframe->void = &frame;
|
|
const any_ptr: anyframe = ptr;
|
|
|
|
resume any_ptr;
|
|
await ptr;
|
|
}
|
|
|
|
fn func() void {
|
|
suspend;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
The {#syntax#}await{#endsyntax#} keyword is used to coordinate with an async function's
|
|
{#syntax#}return{#endsyntax#} statement.
|
|
</p>
|
|
<p>
|
|
{#syntax#}await{#endsyntax#} is a suspend point, and takes as an operand anything that
|
|
coerces to {#syntax#}anyframe->T{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
There is a common misconception that {#syntax#}await{#endsyntax#} resumes the target function.
|
|
It is the other way around: it suspends until the target function completes.
|
|
In the event that the target function has already completed, {#syntax#}await{#endsyntax#}
|
|
does not suspend; instead it copies the
|
|
return value directly from the target function's frame.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
var the_frame: anyframe = undefined;
|
|
var final_result: i32 = 0;
|
|
|
|
test "async function await" {
|
|
seq('a');
|
|
_ = async amain();
|
|
seq('f');
|
|
resume the_frame;
|
|
seq('i');
|
|
assert(final_result == 1234);
|
|
assert(std.mem.eql(u8, &seq_points, "abcdefghi"));
|
|
}
|
|
fn amain() void {
|
|
seq('b');
|
|
var f = async another();
|
|
seq('e');
|
|
final_result = await f;
|
|
seq('h');
|
|
}
|
|
fn another() i32 {
|
|
seq('c');
|
|
suspend {
|
|
seq('d');
|
|
the_frame = @frame();
|
|
}
|
|
seq('g');
|
|
return 1234;
|
|
}
|
|
|
|
var seq_points = [_]u8{0} ** "abcdefghi".len;
|
|
var seq_index: usize = 0;
|
|
|
|
fn seq(c: u8) void {
|
|
seq_points[seq_index] = c;
|
|
seq_index += 1;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
In general, {#syntax#}suspend{#endsyntax#} is lower level than {#syntax#}await{#endsyntax#}. Most application
|
|
code will use only {#syntax#}async{#endsyntax#} and {#syntax#}await{#endsyntax#}, but event loop
|
|
implementations will make use of {#syntax#}suspend{#endsyntax#} internally.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Async Function Example#}
|
|
<p>
|
|
Putting all of this together, here is an example of typical
|
|
{#syntax#}async{#endsyntax#}/{#syntax#}await{#endsyntax#} usage:
|
|
</p>
|
|
{#code_begin|exe|async#}
|
|
const std = @import("std");
|
|
const Allocator = std.mem.Allocator;
|
|
|
|
pub fn main() void {
|
|
_ = async amainWrap();
|
|
|
|
// Typically we would use an event loop to manage resuming async functions,
|
|
// but in this example we hard code what the event loop would do,
|
|
// to make things deterministic.
|
|
resume global_file_frame;
|
|
resume global_download_frame;
|
|
}
|
|
|
|
fn amainWrap() void {
|
|
amain() catch |e| {
|
|
std.debug.warn("{}\n", .{e});
|
|
if (@errorReturnTrace()) |trace| {
|
|
std.debug.dumpStackTrace(trace.*);
|
|
}
|
|
std.process.exit(1);
|
|
};
|
|
}
|
|
|
|
fn amain() !void {
|
|
const allocator = std.heap.page_allocator;
|
|
var download_frame = async fetchUrl(allocator, "https://example.com/");
|
|
var awaited_download_frame = false;
|
|
errdefer if (!awaited_download_frame) {
|
|
if (await download_frame) |r| allocator.free(r) else |_| {}
|
|
};
|
|
|
|
var file_frame = async readFile(allocator, "something.txt");
|
|
var awaited_file_frame = false;
|
|
errdefer if (!awaited_file_frame) {
|
|
if (await file_frame) |r| allocator.free(r) else |_| {}
|
|
};
|
|
|
|
awaited_file_frame = true;
|
|
const file_text = try await file_frame;
|
|
defer allocator.free(file_text);
|
|
|
|
awaited_download_frame = true;
|
|
const download_text = try await download_frame;
|
|
defer allocator.free(download_text);
|
|
|
|
std.debug.warn("download_text: {}\n", .{download_text});
|
|
std.debug.warn("file_text: {}\n", .{file_text});
|
|
}
|
|
|
|
var global_download_frame: anyframe = undefined;
|
|
fn fetchUrl(allocator: *Allocator, url: []const u8) ![]u8 {
|
|
const result = try std.mem.dupe(allocator, u8, "this is the downloaded url contents");
|
|
errdefer allocator.free(result);
|
|
suspend {
|
|
global_download_frame = @frame();
|
|
}
|
|
std.debug.warn("fetchUrl returning\n", .{});
|
|
return result;
|
|
}
|
|
|
|
var global_file_frame: anyframe = undefined;
|
|
fn readFile(allocator: *Allocator, filename: []const u8) ![]u8 {
|
|
const result = try std.mem.dupe(allocator, u8, "this is the file contents");
|
|
errdefer allocator.free(result);
|
|
suspend {
|
|
global_file_frame = @frame();
|
|
}
|
|
std.debug.warn("readFile returning\n", .{});
|
|
return result;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Now we remove the {#syntax#}suspend{#endsyntax#} and {#syntax#}resume{#endsyntax#} code, and
|
|
observe the same behavior, with one tiny difference:
|
|
</p>
|
|
{#code_begin|exe|blocking#}
|
|
const std = @import("std");
|
|
const Allocator = std.mem.Allocator;
|
|
|
|
pub fn main() void {
|
|
_ = async amainWrap();
|
|
}
|
|
|
|
fn amainWrap() void {
|
|
amain() catch |e| {
|
|
std.debug.warn("{}\n", .{e});
|
|
if (@errorReturnTrace()) |trace| {
|
|
std.debug.dumpStackTrace(trace.*);
|
|
}
|
|
std.process.exit(1);
|
|
};
|
|
}
|
|
|
|
fn amain() !void {
|
|
const allocator = std.heap.page_allocator;
|
|
var download_frame = async fetchUrl(allocator, "https://example.com/");
|
|
var awaited_download_frame = false;
|
|
errdefer if (!awaited_download_frame) {
|
|
if (await download_frame) |r| allocator.free(r) else |_| {}
|
|
};
|
|
|
|
var file_frame = async readFile(allocator, "something.txt");
|
|
var awaited_file_frame = false;
|
|
errdefer if (!awaited_file_frame) {
|
|
if (await file_frame) |r| allocator.free(r) else |_| {}
|
|
};
|
|
|
|
awaited_file_frame = true;
|
|
const file_text = try await file_frame;
|
|
defer allocator.free(file_text);
|
|
|
|
awaited_download_frame = true;
|
|
const download_text = try await download_frame;
|
|
defer allocator.free(download_text);
|
|
|
|
std.debug.warn("download_text: {}\n", .{download_text});
|
|
std.debug.warn("file_text: {}\n", .{file_text});
|
|
}
|
|
|
|
fn fetchUrl(allocator: *Allocator, url: []const u8) ![]u8 {
|
|
const result = try std.mem.dupe(allocator, u8, "this is the downloaded url contents");
|
|
errdefer allocator.free(result);
|
|
std.debug.warn("fetchUrl returning\n", .{});
|
|
return result;
|
|
}
|
|
|
|
fn readFile(allocator: *Allocator, filename: []const u8) ![]u8 {
|
|
const result = try std.mem.dupe(allocator, u8, "this is the file contents");
|
|
errdefer allocator.free(result);
|
|
std.debug.warn("readFile returning\n", .{});
|
|
return result;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Previously, the {#syntax#}fetchUrl{#endsyntax#} and {#syntax#}readFile{#endsyntax#} functions suspended,
|
|
and were resumed in an order determined by the {#syntax#}main{#endsyntax#} function. Now,
|
|
since there are no suspend points, the order of the printed "... returning" messages
|
|
is determined by the order of {#syntax#}async{#endsyntax#} callsites.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_close#}
|
|
{#header_open|Builtin Functions|2col#}
|
|
<p>
|
|
Builtin functions are provided by the compiler and are prefixed with <code>@</code>.
|
|
The {#syntax#}comptime{#endsyntax#} keyword on a parameter means that the parameter must be known
|
|
at compile time.
|
|
</p>
|
|
{#header_open|@addWithOverflow#}
|
|
<pre>{#syntax#}@addWithOverflow(comptime T: type, a: T, b: T, result: *T) bool{#endsyntax#}</pre>
|
|
<p>
|
|
Performs {#syntax#}result.* = a + b{#endsyntax#}. If overflow or underflow occurs,
|
|
stores the overflowed bits in {#syntax#}result{#endsyntax#} and returns {#syntax#}true{#endsyntax#}.
|
|
If no overflow or underflow occurs, returns {#syntax#}false{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@alignCast#}
|
|
<pre>{#syntax#}@alignCast(comptime alignment: u29, ptr: var) var{#endsyntax#}</pre>
|
|
<p>
|
|
{#syntax#}ptr{#endsyntax#} can be {#syntax#}*T{#endsyntax#}, {#syntax#}fn(){#endsyntax#}, {#syntax#}?*T{#endsyntax#},
|
|
{#syntax#}?fn(){#endsyntax#}, or {#syntax#}[]T{#endsyntax#}. It returns the same type as {#syntax#}ptr{#endsyntax#}
|
|
except with the alignment adjusted to the new value.
|
|
</p>
|
|
<p>A {#link|pointer alignment safety check|Incorrect Pointer Alignment#} is added
|
|
to the generated code to make sure the pointer is aligned as promised.</p>
|
|
|
|
{#header_close#}
|
|
{#header_open|@alignOf#}
|
|
<pre>{#syntax#}@alignOf(comptime T: type) comptime_int{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<pre>{#syntax#}const assert = @import("std").debug.assert;
|
|
comptime {
|
|
assert(*u32 == *align(@alignOf(u32)) u32);
|
|
}{#endsyntax#}</pre>
|
|
<p>
|
|
The result is a target-specific compile time constant. It is guaranteed to be
|
|
less than or equal to {#link|@sizeOf(T)|@sizeOf#}.
|
|
</p>
|
|
{#see_also|Alignment#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@as#}
|
|
<pre>{#syntax#}@as(comptime T: type, expression) T{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@asyncCall#}
|
|
<pre>{#syntax#}@asyncCall(frame_buffer: []align(@alignOf(@Frame(anyAsyncFunction))) u8, result_ptr, function_ptr, args: ...) anyframe->T{#endsyntax#}</pre>
|
|
<p>
|
|
{#syntax#}@asyncCall{#endsyntax#} performs an {#syntax#}async{#endsyntax#} call on a function pointer,
|
|
which may or may not be an {#link|async function|Async Functions#}.
|
|
</p>
|
|
<p>
|
|
The provided {#syntax#}frame_buffer{#endsyntax#} must be large enough to fit the entire function frame.
|
|
This size can be determined with {#link|@frameSize#}. To provide a too-small buffer
|
|
invokes safety-checked {#link|Undefined Behavior#}.
|
|
</p>
|
|
<p>
|
|
{#syntax#}result_ptr{#endsyntax#} is optional ({#link|null#} may be provided). If provided,
|
|
the function call will write its result directly to the result pointer, which will be available to
|
|
read after {#link|await|Async and Await#} completes. Any result location provided to
|
|
{#syntax#}await{#endsyntax#} will copy the result from {#syntax#}result_ptr{#endsyntax#}.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "async fn pointer in a struct field" {
|
|
var data: i32 = 1;
|
|
const Foo = struct {
|
|
bar: fn (*i32) callconv(.Async) void,
|
|
};
|
|
var foo = Foo{ .bar = func };
|
|
var bytes: [64]u8 align(@alignOf(@Frame(func))) = undefined;
|
|
const f = @asyncCall(&bytes, {}, foo.bar, &data);
|
|
assert(data == 2);
|
|
resume f;
|
|
assert(data == 4);
|
|
}
|
|
|
|
fn func(y: *i32) void {
|
|
defer y.* += 2;
|
|
y.* += 1;
|
|
suspend;
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@atomicLoad#}
|
|
<pre>{#syntax#}@atomicLoad(comptime T: type, ptr: *const T, comptime ordering: builtin.AtomicOrder) T{#endsyntax#}</pre>
|
|
<p>
|
|
This builtin function atomically dereferences a pointer and returns the value.
|
|
</p>
|
|
<p>
|
|
{#syntax#}T{#endsyntax#} must be a {#syntax#}bool{#endsyntax#}, a float,
|
|
an integer or an enum.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@atomicRmw#}
|
|
<pre>{#syntax#}@atomicRmw(comptime T: type, ptr: *T, comptime op: builtin.AtomicRmwOp, operand: T, comptime ordering: builtin.AtomicOrder) T{#endsyntax#}</pre>
|
|
<p>
|
|
This builtin function atomically modifies memory and then returns the previous value.
|
|
</p>
|
|
<p>
|
|
{#syntax#}T{#endsyntax#} must be a {#syntax#}bool{#endsyntax#}, a float,
|
|
an integer or an enum.
|
|
</p>
|
|
<p>
|
|
Supported operations:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}.Xchg{#endsyntax#} - stores the operand unmodified. Supports enums, integers and floats.</li>
|
|
<li>{#syntax#}.Add{#endsyntax#} - for integers, twos complement wraparound addition.
|
|
Also supports {#link|Floats#}.</li>
|
|
<li>{#syntax#}.Sub{#endsyntax#} - for integers, twos complement wraparound subtraction.
|
|
Also supports {#link|Floats#}.</li>
|
|
<li>{#syntax#}.And{#endsyntax#} - bitwise and</li>
|
|
<li>{#syntax#}.Nand{#endsyntax#} - bitwise nand</li>
|
|
<li>{#syntax#}.Or{#endsyntax#} - bitwise or</li>
|
|
<li>{#syntax#}.Xor{#endsyntax#} - bitwise xor</li>
|
|
<li>{#syntax#}.Max{#endsyntax#} - stores the operand if it is larger. Supports integers and floats.</li>
|
|
<li>{#syntax#}.Min{#endsyntax#} - stores the operand if it is smaller. Supports integers and floats.</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|@atomicStore#}
|
|
<pre>{#syntax#}@atomicStore(comptime T: type, ptr: *T, value: T, comptime ordering: builtin.AtomicOrder) void{#endsyntax#}</pre>
|
|
<p>
|
|
This builtin function atomically stores a value.
|
|
</p>
|
|
<p>
|
|
{#syntax#}T{#endsyntax#} must be a {#syntax#}bool{#endsyntax#}, a float,
|
|
an integer or an enum.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@bitCast#}
|
|
<pre>{#syntax#}@bitCast(comptime DestType: type, value: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts a value of one type to another type.
|
|
</p>
|
|
<p>
|
|
Asserts that {#syntax#}@sizeOf(@TypeOf(value)) == @sizeOf(DestType){#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
Asserts that {#syntax#}@typeInfo(DestType) != .Pointer{#endsyntax#}. Use {#syntax#}@ptrCast{#endsyntax#} or {#syntax#}@intToPtr{#endsyntax#} if you need this.
|
|
</p>
|
|
<p>
|
|
Can be used for these things for example:
|
|
</p>
|
|
<ul>
|
|
<li>Convert {#syntax#}f32{#endsyntax#} to {#syntax#}u32{#endsyntax#} bits</li>
|
|
<li>Convert {#syntax#}i32{#endsyntax#} to {#syntax#}u32{#endsyntax#} preserving twos complement</li>
|
|
</ul>
|
|
<p>
|
|
Works at compile-time if {#syntax#}value{#endsyntax#} is known at compile time. It's a compile error to bitcast a struct to a scalar type of the same size since structs have undefined layout. However if the struct is packed then it works.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@bitOffsetOf#}
|
|
<pre>{#syntax#}@bitOffsetOf(comptime T: type, comptime field_name: []const u8) comptime_int{#endsyntax#}</pre>
|
|
<p>
|
|
Returns the bit offset of a field relative to its containing struct.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#see_also|@byteOffsetOf#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@boolToInt#}
|
|
<pre>{#syntax#}@boolToInt(value: bool) u1{#endsyntax#}</pre>
|
|
<p>
|
|
Converts {#syntax#}true{#endsyntax#} to {#syntax#}u1(1){#endsyntax#} and {#syntax#}false{#endsyntax#} to
|
|
{#syntax#}u1(0){#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
If the value is known at compile-time, the return type is {#syntax#}comptime_int{#endsyntax#}
|
|
instead of {#syntax#}u1{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@bitSizeOf#}
|
|
<pre>{#syntax#}@bitSizeOf(comptime T: type) comptime_int{#endsyntax#}</pre>
|
|
<p>
|
|
This function returns the number of bits it takes to store {#syntax#}T{#endsyntax#} in memory.
|
|
The result is a target-specific compile time constant.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#see_also|@sizeOf|@typeInfo#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@breakpoint#}
|
|
<pre>{#syntax#}@breakpoint(){#endsyntax#}</pre>
|
|
<p>
|
|
This function inserts a platform-specific debug trap instruction which causes
|
|
debuggers to break there.
|
|
</p>
|
|
<p>
|
|
This function is only valid within function scope.
|
|
</p>
|
|
|
|
{#header_close#}
|
|
{#header_open|@mulAdd#}
|
|
<pre>{#syntax#}@mulAdd(comptime T: type, a: T, b: T, c: T) T{#endsyntax#}</pre>
|
|
<p>
|
|
Fused multiply add, similar to {#syntax#}(a * b) + c{#endsyntax#}, except
|
|
only rounds once, and is thus more accurate.
|
|
</p>
|
|
<p>
|
|
Supports Floats and Vectors of floats.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@byteSwap#}
|
|
<pre>{#syntax#}@byteSwap(comptime T: type, operand: T) T{#endsyntax#}</pre>
|
|
<p>{#syntax#}T{#endsyntax#} must be an integer type with bit count evenly divisible by 8.</p>
|
|
<p>{#syntax#}operand{#endsyntax#} may be an {#link|integer|Integers#} or {#link|vector|Vectors#}.</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@bitReverse#}
|
|
<pre>{#syntax#}@bitReverse(comptime T: type, integer: T) T{#endsyntax#}</pre>
|
|
<p>{#syntax#}T{#endsyntax#} accepts any integer type.</p>
|
|
<p>
|
|
Reverses the bitpattern of an integer value, including the sign bit if applicable.
|
|
</p>
|
|
<p>
|
|
For example 0b10110110 ({#syntax#}u8 = 182{#endsyntax#}, {#syntax#}i8 = -74{#endsyntax#})
|
|
becomes 0b01101101 ({#syntax#}u8 = 109{#endsyntax#}, {#syntax#}i8 = 109{#endsyntax#}).
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@byteOffsetOf#}
|
|
<pre>{#syntax#}@byteOffsetOf(comptime T: type, comptime field_name: []const u8) comptime_int{#endsyntax#}</pre>
|
|
<p>
|
|
Returns the byte offset of a field relative to its containing struct.
|
|
</p>
|
|
{#see_also|@bitOffsetOf#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@call#}
|
|
<pre>{#syntax#}@call(options: std.builtin.CallOptions, function: var, args: var) var{#endsyntax#}</pre>
|
|
<p>
|
|
Calls a function, in the same way that invoking an expression with parentheses does:
|
|
</p>
|
|
{#code_begin|test|call#}
|
|
const assert = @import("std").debug.assert;
|
|
|
|
test "noinline function call" {
|
|
assert(@call(.{}, add, .{3, 9}) == 12);
|
|
}
|
|
|
|
fn add(a: i32, b: i32) i32 {
|
|
return a + b;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#syntax#}@call{#endsyntax#} allows more flexibility than normal function call syntax does. The
|
|
{#syntax#}CallOptions{#endsyntax#} struct is reproduced here:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
pub const CallOptions = struct {
|
|
modifier: Modifier = .auto,
|
|
stack: ?[]align(std.Target.stack_align) u8 = null,
|
|
|
|
pub const Modifier = enum {
|
|
/// Equivalent to function call syntax.
|
|
auto,
|
|
|
|
/// Equivalent to async keyword used with function call syntax.
|
|
async_kw,
|
|
|
|
/// Prevents tail call optimization. This guarantees that the return
|
|
/// address will point to the callsite, as opposed to the callsite's
|
|
/// callsite. If the call is otherwise required to be tail-called
|
|
/// or inlined, a compile error is emitted instead.
|
|
never_tail,
|
|
|
|
/// Guarantees that the call will not be inlined. If the call is
|
|
/// otherwise required to be inlined, a compile error is emitted instead.
|
|
never_inline,
|
|
|
|
/// Asserts that the function call will not suspend. This allows a
|
|
/// non-async function to call an async function.
|
|
no_async,
|
|
|
|
/// Guarantees that the call will be generated with tail call optimization.
|
|
/// If this is not possible, a compile error is emitted instead.
|
|
always_tail,
|
|
|
|
/// Guarantees that the call will inlined at the callsite.
|
|
/// If this is not possible, a compile error is emitted instead.
|
|
always_inline,
|
|
|
|
/// Evaluates the call at compile-time. If the call cannot be completed at
|
|
/// compile-time, a compile error is emitted instead.
|
|
compile_time,
|
|
};
|
|
};
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@cDefine#}
|
|
<pre>{#syntax#}@cDefine(comptime name: []u8, value){#endsyntax#}</pre>
|
|
<p>
|
|
This function can only occur inside {#syntax#}@cImport{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
This appends <code>#define $name $value</code> to the {#syntax#}@cImport{#endsyntax#}
|
|
temporary buffer.
|
|
</p>
|
|
<p>
|
|
To define without a value, like this:
|
|
</p>
|
|
<pre><code class="c">#define _GNU_SOURCE</code></pre>
|
|
<p>
|
|
Use the void value, like this:
|
|
</p>
|
|
<pre>{#syntax#}@cDefine("_GNU_SOURCE", {}){#endsyntax#}</pre>
|
|
{#see_also|Import from C Header File|@cInclude|@cImport|@cUndef|void#}
|
|
{#header_close#}
|
|
{#header_open|@cImport#}
|
|
<pre>{#syntax#}@cImport(expression) type{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Reasons for having multiple {#syntax#}@cImport{#endsyntax#} expressions would be:
|
|
</p>
|
|
<ul>
|
|
<li>To avoid a symbol collision, for example if foo.h and bar.h both <code>#define CONNECTION_COUNT</code></li>
|
|
<li>To analyze the C code with different preprocessor defines</li>
|
|
</ul>
|
|
{#see_also|Import from C Header File|@cInclude|@cDefine|@cUndef#}
|
|
{#header_close#}
|
|
{#header_open|@cInclude#}
|
|
<pre>{#syntax#}@cInclude(comptime path: []u8){#endsyntax#}</pre>
|
|
<p>
|
|
This function can only occur inside {#syntax#}@cImport{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
This appends <code>#include <$path>\n</code> to the {#syntax#}c_import{#endsyntax#}
|
|
temporary buffer.
|
|
</p>
|
|
{#see_also|Import from C Header File|@cImport|@cDefine|@cUndef#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@clz#}
|
|
<pre>{#syntax#}@clz(comptime T: type, integer: T){#endsyntax#}</pre>
|
|
<p>
|
|
This function counts the number of most-significant (leading in a big-Endian sense) zeroes in {#syntax#}integer{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
If {#syntax#}integer{#endsyntax#} is known at {#link|comptime#},
|
|
the return type is {#syntax#}comptime_int{#endsyntax#}.
|
|
Otherwise, the return type is an unsigned integer with the minimum number
|
|
of bits that can represent the bit count of the integer type.
|
|
</p>
|
|
<p>
|
|
If {#syntax#}integer{#endsyntax#} is zero, {#syntax#}@clz{#endsyntax#} returns the bit width
|
|
of integer type {#syntax#}T{#endsyntax#}.
|
|
</p>
|
|
{#see_also|@ctz|@popCount#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@cmpxchgStrong#}
|
|
<pre>{#syntax#}@cmpxchgStrong(comptime T: type, ptr: *T, expected_value: T, new_value: T, success_order: AtomicOrder, fail_order: AtomicOrder) ?T{#endsyntax#}</pre>
|
|
<p>
|
|
This function performs a strong atomic compare exchange operation. It's the equivalent of this code,
|
|
except atomic:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn cmpxchgStrongButNotAtomic(comptime T: type, ptr: *T, expected_value: T, new_value: T) ?T {
|
|
const old_value = ptr.*;
|
|
if (old_value == expected_value) {
|
|
ptr.* = new_value;
|
|
return null;
|
|
} else {
|
|
return old_value;
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
If you are using cmpxchg in a loop, {#link|@cmpxchgWeak#} is the better choice, because it can be implemented
|
|
more efficiently in machine instructions.
|
|
</p>
|
|
<p>
|
|
{#syntax#}T{#endsyntax#} must be a {#syntax#}bool{#endsyntax#}, a float,
|
|
an integer or an enum.
|
|
</p>
|
|
<p>{#syntax#}@TypeOf(ptr).alignment{#endsyntax#} must be {#syntax#}>= @sizeOf(T).{#endsyntax#}</p>
|
|
{#see_also|Compile Variables|cmpxchgWeak#}
|
|
{#header_close#}
|
|
{#header_open|@cmpxchgWeak#}
|
|
<pre>{#syntax#}@cmpxchgWeak(comptime T: type, ptr: *T, expected_value: T, new_value: T, success_order: AtomicOrder, fail_order: AtomicOrder) ?T{#endsyntax#}</pre>
|
|
<p>
|
|
This function performs a weak atomic compare exchange operation. It's the equivalent of this code,
|
|
except atomic:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
fn cmpxchgWeakButNotAtomic(comptime T: type, ptr: *T, expected_value: T, new_value: T) ?T {
|
|
const old_value = ptr.*;
|
|
if (old_value == expected_value and usuallyTrueButSometimesFalse()) {
|
|
ptr.* = new_value;
|
|
return null;
|
|
} else {
|
|
return old_value;
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
If you are using cmpxchg in a 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#}.
|
|
</p>
|
|
<p>
|
|
{#syntax#}T{#endsyntax#} must be a {#syntax#}bool{#endsyntax#}, a float,
|
|
an integer or an enum.
|
|
</p>
|
|
<p>{#syntax#}@TypeOf(ptr).alignment{#endsyntax#} must be {#syntax#}>= @sizeOf(T).{#endsyntax#}</p>
|
|
{#see_also|Compile Variables|cmpxchgStrong#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@compileError#}
|
|
<pre>{#syntax#}@compileError(comptime msg: []u8){#endsyntax#}</pre>
|
|
<p>
|
|
This function, when semantically analyzed, causes a compile error with the
|
|
message {#syntax#}msg{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@compileLog#}
|
|
<pre>{#syntax#}@compileLog(args: ...){#endsyntax#}</pre>
|
|
<p>
|
|
This function prints the arguments passed to it at compile-time.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
This function can be used to do "printf debugging" on
|
|
compile-time executing code.
|
|
</p>
|
|
{#code_begin|test_err|found compile log statement#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
const num1 = blk: {
|
|
var val1: i32 = 99;
|
|
@compileLog("comptime val1 = ", val1);
|
|
val1 = val1 + 1;
|
|
break :blk val1;
|
|
};
|
|
|
|
test "main" {
|
|
@compileLog("comptime in main");
|
|
|
|
warn("Runtime in main, num1 = {}.\n", .{num1});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
will ouput:
|
|
</p>
|
|
<p>
|
|
If all {#syntax#}@compileLog{#endsyntax#} calls are removed or
|
|
not encountered by analysis, the
|
|
program compiles successfully and the generated executable prints:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
const num1 = blk: {
|
|
var val1: i32 = 99;
|
|
val1 = val1 + 1;
|
|
break :blk val1;
|
|
};
|
|
|
|
test "main" {
|
|
warn("Runtime in main, num1 = {}.\n", .{num1});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@ctz#}
|
|
<pre>{#syntax#}@ctz(comptime T: type, integer: T){#endsyntax#}</pre>
|
|
<p>
|
|
This function counts the number of least-significant (trailing in a big-Endian sense) zeroes in {#syntax#}integer{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
If {#syntax#}integer{#endsyntax#} is known at {#link|comptime#},
|
|
the return type is {#syntax#}comptime_int{#endsyntax#}.
|
|
Otherwise, the return type is an unsigned integer with the minimum number
|
|
of bits that can represent the bit count of the integer type.
|
|
</p>
|
|
<p>
|
|
If {#syntax#}integer{#endsyntax#} is zero, {#syntax#}@ctz{#endsyntax#} returns
|
|
the bit width of integer type {#syntax#}T{#endsyntax#}.
|
|
</p>
|
|
{#see_also|@clz|@popCount#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@cUndef#}
|
|
<pre>{#syntax#}@cUndef(comptime name: []u8){#endsyntax#}</pre>
|
|
<p>
|
|
This function can only occur inside {#syntax#}@cImport{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
This appends <code>#undef $name</code> to the {#syntax#}@cImport{#endsyntax#}
|
|
temporary buffer.
|
|
</p>
|
|
{#see_also|Import from C Header File|@cImport|@cDefine|@cInclude#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@divExact#}
|
|
<pre>{#syntax#}@divExact(numerator: T, denominator: T) T{#endsyntax#}</pre>
|
|
<p>
|
|
Exact division. Caller guarantees {#syntax#}denominator != 0{#endsyntax#} and
|
|
{#syntax#}@divTrunc(numerator, denominator) * denominator == numerator{#endsyntax#}.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}@divExact(6, 3) == 2{#endsyntax#}</li>
|
|
<li>{#syntax#}@divExact(a, b) * b == a{#endsyntax#}</li>
|
|
</ul>
|
|
<p>For a function that returns a possible error code, use {#syntax#}@import("std").math.divExact{#endsyntax#}.</p>
|
|
{#see_also|@divTrunc|@divFloor#}
|
|
{#header_close#}
|
|
{#header_open|@divFloor#}
|
|
<pre>{#syntax#}@divFloor(numerator: T, denominator: T) T{#endsyntax#}</pre>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}@divFloor(-5, 3) == -2{#endsyntax#}</li>
|
|
<li>{#syntax#}@divFloor(a, b) + @mod(a, b) == a{#endsyntax#}</li>
|
|
</ul>
|
|
<p>For a function that returns a possible error code, use {#syntax#}@import("std").math.divFloor{#endsyntax#}.</p>
|
|
{#see_also|@divTrunc|@divExact#}
|
|
{#header_close#}
|
|
{#header_open|@divTrunc#}
|
|
<pre>{#syntax#}@divTrunc(numerator: T, denominator: T) T{#endsyntax#}</pre>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}@divTrunc(-5, 3) == -1{#endsyntax#}</li>
|
|
<li>{#syntax#}@divTrunc(a, b) + @rem(a, b) == a{#endsyntax#}</li>
|
|
</ul>
|
|
<p>For a function that returns a possible error code, use {#syntax#}@import("std").math.divTrunc{#endsyntax#}.</p>
|
|
{#see_also|@divFloor|@divExact#}
|
|
{#header_close#}
|
|
{#header_open|@embedFile#}
|
|
<pre>{#syntax#}@embedFile(comptime path: []const u8) *const [X:0]u8{#endsyntax#}</pre>
|
|
<p>
|
|
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 Character Literals#}
|
|
with the file contents.
|
|
</p>
|
|
<p>
|
|
{#syntax#}path{#endsyntax#} is absolute or relative to the current file, just like {#syntax#}@import{#endsyntax#}.
|
|
</p>
|
|
{#see_also|@import#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@enumToInt#}
|
|
<pre>{#syntax#}@enumToInt(enum_or_tagged_union: var) var{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an enumeration value into its integer tag type. When a tagged union is passed,
|
|
the tag value is used as the enumeration value.
|
|
</p>
|
|
<p>
|
|
If there is only one possible enum value, the resut is a {#syntax#}comptime_int{#endsyntax#}
|
|
known at {#link|comptime#}.
|
|
</p>
|
|
{#see_also|@intToEnum#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@errorName#}
|
|
<pre>{#syntax#}@errorName(err: anyerror) []const u8{#endsyntax#}</pre>
|
|
<p>
|
|
This function returns the string representation of an error. The string representation
|
|
of {#syntax#}error.OutOfMem{#endsyntax#} is {#syntax#}"OutOfMem"{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@errorReturnTrace#}
|
|
<pre>{#syntax#}@errorReturnTrace() ?*builtin.StackTrace{#endsyntax#}</pre>
|
|
<p>
|
|
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 `null`.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@errorToInt#}
|
|
<pre>{#syntax#}@errorToInt(err: var) std.meta.IntType(false, @sizeOf(anyerror) * 8){#endsyntax#}</pre>
|
|
<p>
|
|
Supports the following types:
|
|
</p>
|
|
<ul>
|
|
<li>{#link|The Global Error Set#}</li>
|
|
<li>{#link|Error Set Type#}</li>
|
|
<li>{#link|Error Union Type#}</li>
|
|
</ul>
|
|
<p>
|
|
Converts an error to the integer representation of an error.
|
|
</p>
|
|
<p>
|
|
It is generally recommended to avoid this
|
|
cast, as the integer representation of an error is not stable across source code changes.
|
|
</p>
|
|
{#see_also|@intToError#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@errSetCast#}
|
|
<pre>{#syntax#}@errSetCast(comptime T: DestType, value: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an error value from one error set to another error set. Attempting to convert an error
|
|
which is not in the destination error set results in safety-protected {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@export#}
|
|
<pre>{#syntax#}@export(target: var, comptime options: std.builtin.ExportOptions) void{#endsyntax#}</pre>
|
|
<p>
|
|
Creates a symbol in the output object file.
|
|
</p>
|
|
<p>
|
|
This function can be called from a {#link|comptime#} block to conditionally export symbols.
|
|
When {#syntax#}target{#endsyntax#} is 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:
|
|
</p>
|
|
{#code_begin|obj#}
|
|
comptime {
|
|
@export(internalName, .{ .name = "foo", .linkage = .Strong });
|
|
}
|
|
|
|
fn internalName() callconv(.C) void {}
|
|
{#code_end#}
|
|
<p>This is equivalent to:</p>
|
|
{#code_begin|obj#}
|
|
export fn foo() void {}
|
|
{#code_end#}
|
|
<p>Note that even when using {#syntax#}export{#endsyntax#}, {#syntax#}@"foo"{#endsyntax#} syntax can
|
|
be used to choose any string for the symbol name:</p>
|
|
{#code_begin|obj#}
|
|
export fn @"A function name that is a complete sentence."() void {}
|
|
{#code_end#}
|
|
<p>
|
|
When looking at the resulting object, you can see the symbol is used verbatim:
|
|
</p>
|
|
<pre>00000000000001f0 T A function name that is a complete sentence.</pre>
|
|
{#see_also|Exporting a C Library#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@fence#}
|
|
<pre>{#syntax#}@fence(order: AtomicOrder){#endsyntax#}</pre>
|
|
<p>
|
|
The {#syntax#}fence{#endsyntax#} function is used to introduce happens-before edges between operations.
|
|
</p>
|
|
<p>
|
|
{#syntax#}AtomicOrder{#endsyntax#} can be found with {#syntax#}@import("builtin").AtomicOrder{#endsyntax#}.
|
|
</p>
|
|
{#see_also|Compile Variables#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@field#}
|
|
<pre>{#syntax#}@field(lhs: var, comptime field_name: []const u8) (field){#endsyntax#}</pre>
|
|
<p>Performs field access by a compile-time string.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
|
|
const Point = struct {
|
|
x: u32,
|
|
y: u32
|
|
};
|
|
|
|
test "field access by string" {
|
|
const assert = std.debug.assert;
|
|
var p = Point {.x = 0, .y = 0};
|
|
|
|
@field(p, "x") = 4;
|
|
@field(p, "y") = @field(p, "x") + 1;
|
|
|
|
assert(@field(p, "x") == 4);
|
|
assert(@field(p, "y") == 5);
|
|
}
|
|
{#code_end#}
|
|
|
|
{#header_close#}
|
|
|
|
{#header_open|@fieldParentPtr#}
|
|
<pre>{#syntax#}@fieldParentPtr(comptime ParentType: type, comptime field_name: []const u8,
|
|
field_ptr: *T) *ParentType{#endsyntax#}</pre>
|
|
<p>
|
|
Given a pointer to a field, returns the base pointer of a struct.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@floatCast#}
|
|
<pre>{#syntax#}@floatCast(comptime DestType: type, value: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Convert from one float type to another. This cast is safe, but may cause the
|
|
numeric value to lose precision.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@floatToInt#}
|
|
<pre>{#syntax#}@floatToInt(comptime DestType: type, float: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts the integer part of a floating point number to the destination type.
|
|
</p>
|
|
<p>
|
|
If the integer part of the floating point number cannot fit in the destination type,
|
|
it invokes safety-checked {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#see_also|@intToFloat#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@frame#}
|
|
<pre>{#syntax#}@frame() *@Frame(func){#endsyntax#}</pre>
|
|
<p>
|
|
This function returns a pointer to the frame for a given function. This type
|
|
can be {#link|coerced|Type Coercion#} to {#syntax#}anyframe->T{#endsyntax#} and
|
|
to {#syntax#}anyframe{#endsyntax#}, where {#syntax#}T{#endsyntax#} is the return type
|
|
of the function in scope.
|
|
</p>
|
|
<p>
|
|
This function does not mark a suspension point, but it does cause the function in scope
|
|
to become an {#link|async function|Async Functions#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@Frame#}
|
|
<pre>{#syntax#}@Frame(func: var) type{#endsyntax#}</pre>
|
|
<p>
|
|
This function returns the frame type of a function. This works for {#link|Async Functions#}
|
|
as well as any function without a specific calling convention.
|
|
</p>
|
|
<p>
|
|
This type is suitable to be used as the return type of {#link|async|Async and Await#} which
|
|
allows one to, for example, heap-allocate an async function frame:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
|
|
test "heap allocated frame" {
|
|
const frame = try std.heap.page_allocator.create(@Frame(func));
|
|
frame.* = async func();
|
|
}
|
|
|
|
fn func() void {
|
|
suspend;
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@frameAddress#}
|
|
<pre>{#syntax#}@frameAddress() usize{#endsyntax#}</pre>
|
|
<p>
|
|
This function returns the base pointer of the current stack frame.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
This function is only valid within function scope.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@frameSize#}
|
|
<pre>{#syntax#}@frameSize() usize{#endsyntax#}</pre>
|
|
<p>
|
|
This is the same as {#syntax#}@sizeOf(@Frame(func)){#endsyntax#}, where {#syntax#}func{#endsyntax#}
|
|
may be runtime-known.
|
|
</p>
|
|
<p>
|
|
This function is typically used in conjunction with {#link|@asyncCall#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@hasDecl#}
|
|
<pre>{#syntax#}@hasDecl(comptime Container: type, comptime name: []const u8) bool{#endsyntax#}</pre>
|
|
<p>
|
|
Returns whether or not a {#link|struct#}, {#link|enum#}, or {#link|union#} has a declaration
|
|
matching {#syntax#}name{#endsyntax#}.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
const Foo = struct {
|
|
nope: i32,
|
|
|
|
pub var blah = "xxx";
|
|
const hi = 1;
|
|
};
|
|
|
|
test "@hasDecl" {
|
|
assert(@hasDecl(Foo, "blah"));
|
|
|
|
// Even though `hi` is private, @hasDecl returns true because this test is
|
|
// in the same file scope as Foo. It would return false if Foo was declared
|
|
// in a different file.
|
|
assert(@hasDecl(Foo, "hi"));
|
|
|
|
// @hasDecl is for declarations; not fields.
|
|
assert(!@hasDecl(Foo, "nope"));
|
|
assert(!@hasDecl(Foo, "nope1234"));
|
|
}
|
|
{#code_end#}
|
|
{#see_also|@hasField#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@hasField#}
|
|
<pre>{#syntax#}@hasField(comptime Container: type, comptime name: []const u8) bool{#endsyntax#}</pre>
|
|
<p>Returns whether the field name of a struct, union, or enum exists.</p>
|
|
<p>
|
|
The result is a compile time constant.
|
|
</p>
|
|
<p>
|
|
It does not include functions, variables, or constants.
|
|
</p>
|
|
{#see_also|@hasDecl#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@import#}
|
|
<pre>{#syntax#}@import(comptime path: []u8) type{#endsyntax#}</pre>
|
|
<p>
|
|
This function finds a zig file corresponding to {#syntax#}path{#endsyntax#} and adds it to the build,
|
|
if it is not already added.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
Declarations which have the {#syntax#}pub{#endsyntax#} keyword may be referenced from a different
|
|
source file than the one they are declared in.
|
|
</p>
|
|
<p>
|
|
{#syntax#}path{#endsyntax#} can be a relative or absolute 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.
|
|
</p>
|
|
<p>
|
|
The following packages are always available:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}@import("std"){#endsyntax#} - Zig Standard Library</li>
|
|
<li>{#syntax#}@import("builtin"){#endsyntax#} - Compiler-provided types and variables.
|
|
The command <code>zig builtin</code> outputs the source to stdout for reference.
|
|
</li>
|
|
</ul>
|
|
{#see_also|Compile Variables|@embedFile#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@intCast#}
|
|
<pre>{#syntax#}@intCast(comptime DestType: type, int: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an integer to another integer while keeping the same numerical value.
|
|
Attempting to convert a number which is out of range of the destination type results in
|
|
safety-protected {#link|Undefined Behavior#}.
|
|
</p>
|
|
<p>
|
|
If {#syntax#}T{#endsyntax#} is {#syntax#}comptime_int{#endsyntax#},
|
|
then this is semantically equivalent to {#link|Type Coercion#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@intToEnum#}
|
|
<pre>{#syntax#}@intToEnum(comptime DestType: type, int_value: @TagType(DestType)) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an integer into an {#link|enum#} value.
|
|
</p>
|
|
<p>
|
|
Attempting to convert an integer which represents no value in the chosen enum type invokes
|
|
safety-checked {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#see_also|@enumToInt#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@intToError#}
|
|
<pre>{#syntax#}@intToError(value: std.meta.IntType(false, @sizeOf(anyerror) * 8)) anyerror{#endsyntax#}</pre>
|
|
<p>
|
|
Converts from the integer representation of an error into {#link|The Global Error Set#} type.
|
|
</p>
|
|
<p>
|
|
It is generally recommended to avoid this
|
|
cast, as the integer representation of an error is not stable across source code changes.
|
|
</p>
|
|
<p>
|
|
Attempting to convert an integer that does not correspond to any error results in
|
|
safety-protected {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#see_also|@errorToInt#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@intToFloat#}
|
|
<pre>{#syntax#}@intToFloat(comptime DestType: type, int: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an integer to the closest floating point representation. To convert the other way, use {#link|@floatToInt#}. This cast is always safe.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@intToPtr#}
|
|
<pre>{#syntax#}@intToPtr(comptime DestType: type, address: usize) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an integer to a {#link|pointer|Pointers#}. To convert the other way, use {#link|@ptrToInt#}.
|
|
</p>
|
|
<p>
|
|
If the destination pointer type does not allow address zero and {#syntax#}address{#endsyntax#}
|
|
is zero, this invokes safety-checked {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@memcpy#}
|
|
<pre>{#syntax#}@memcpy(noalias dest: [*]u8, noalias source: [*]const u8, byte_count: usize){#endsyntax#}</pre>
|
|
<p>
|
|
This function copies bytes from one region of memory to another. {#syntax#}dest{#endsyntax#} and
|
|
{#syntax#}source{#endsyntax#} are both pointers and must not overlap.
|
|
</p>
|
|
<p>
|
|
This function is a low level intrinsic with no safety mechanisms. Most code
|
|
should not use this function, instead using something like this:
|
|
</p>
|
|
<pre>{#syntax#}for (source[0..byte_count]) |b, i| dest[i] = b;{#endsyntax#}</pre>
|
|
<p>
|
|
The optimizer is intelligent enough to turn the above snippet into a memcpy.
|
|
</p>
|
|
<p>There is also a standard library function for this:</p>
|
|
<pre>{#syntax#}const mem = @import("std").mem;
|
|
mem.copy(u8, dest[0..byte_count], source[0..byte_count]);{#endsyntax#}</pre>
|
|
{#header_close#}
|
|
|
|
{#header_open|@memset#}
|
|
<pre>{#syntax#}@memset(dest: [*]u8, c: u8, byte_count: usize){#endsyntax#}</pre>
|
|
<p>
|
|
This function sets a region of memory to {#syntax#}c{#endsyntax#}. {#syntax#}dest{#endsyntax#} is a pointer.
|
|
</p>
|
|
<p>
|
|
This function is a low level intrinsic with no safety mechanisms. Most
|
|
code should not use this function, instead using something like this:
|
|
</p>
|
|
<pre>{#syntax#}for (dest[0..byte_count]) |*b| b.* = c;{#endsyntax#}</pre>
|
|
<p>
|
|
The optimizer is intelligent enough to turn the above snippet into a memset.
|
|
</p>
|
|
<p>There is also a standard library function for this:</p>
|
|
<pre>{#syntax#}const mem = @import("std").mem;
|
|
mem.set(u8, dest, c);{#endsyntax#}</pre>
|
|
{#header_close#}
|
|
|
|
{#header_open|@wasmMemorySize#}
|
|
<pre>{#syntax#}@wasmMemorySize(index: u32) u32{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#see_also|@wasmMemoryGrow#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@wasmMemoryGrow#}
|
|
<pre>{#syntax#}@wasmMemoryGrow(index: u32, delta: u32) i32{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const builtin = @import("builtin");
|
|
const assert = std.debug.assert;
|
|
|
|
test "@wasmMemoryGrow" {
|
|
if (builtin.arch != .wasm32) return error.SkipZigTest;
|
|
|
|
var prev = @wasmMemorySize(0);
|
|
assert(prev == @wasmMemoryGrow(0, 1));
|
|
assert(prev + 1 == @wasmMemorySize(0));
|
|
}
|
|
{#code_end#}
|
|
{#see_also|@wasmMemorySize#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@mod#}
|
|
<pre>{#syntax#}@mod(numerator: T, denominator: T) T{#endsyntax#}</pre>
|
|
<p>
|
|
Modulus division. For unsigned integers this is the same as
|
|
{#syntax#}numerator % denominator{#endsyntax#}. Caller guarantees {#syntax#}denominator > 0{#endsyntax#}.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}@mod(-5, 3) == 1{#endsyntax#}</li>
|
|
<li>{#syntax#}@divFloor(a, b) + @mod(a, b) == a{#endsyntax#}</li>
|
|
</ul>
|
|
<p>For a function that returns an error code, see {#syntax#}@import("std").math.mod{#endsyntax#}.</p>
|
|
{#see_also|@rem#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@mulWithOverflow#}
|
|
<pre>{#syntax#}@mulWithOverflow(comptime T: type, a: T, b: T, result: *T) bool{#endsyntax#}</pre>
|
|
<p>
|
|
Performs {#syntax#}result.* = a * b{#endsyntax#}. If overflow or underflow occurs,
|
|
stores the overflowed bits in {#syntax#}result{#endsyntax#} and returns {#syntax#}true{#endsyntax#}.
|
|
If no overflow or underflow occurs, returns {#syntax#}false{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@panic#}
|
|
<pre>{#syntax#}@panic(message: []const u8) noreturn{#endsyntax#}</pre>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<p>Generally it is better to use {#syntax#}@import("std").debug.panic{#endsyntax#}.
|
|
However, {#syntax#}@panic{#endsyntax#} can be useful for 2 scenarios:
|
|
</p>
|
|
<ul>
|
|
<li>From library code, calling the programmer's panic function if they exposed one in the root source file.</li>
|
|
<li>When mixing C and Zig code, calling the canonical panic implementation across multiple .o files.</li>
|
|
</ul>
|
|
{#see_also|Root Source File#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@popCount#}
|
|
<pre>{#syntax#}@popCount(comptime T: type, integer: T){#endsyntax#}</pre>
|
|
<p>Counts the number of bits set in an integer.</p>
|
|
<p>
|
|
If {#syntax#}integer{#endsyntax#} is known at {#link|comptime#},
|
|
the return type is {#syntax#}comptime_int{#endsyntax#}.
|
|
Otherwise, the return type is an unsigned integer with the minimum number
|
|
of bits that can represent the bit count of the integer type.
|
|
</p>
|
|
{#see_also|@ctz|@clz#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@ptrCast#}
|
|
<pre>{#syntax#}@ptrCast(comptime DestType: type, value: var) DestType{#endsyntax#}</pre>
|
|
<p>
|
|
Converts a pointer of one type to a pointer of another type.
|
|
</p>
|
|
<p>
|
|
{#link|Optional Pointers#} are allowed. Casting an optional pointer which is {#link|null#}
|
|
to a non-optional pointer invokes safety-checked {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@ptrToInt#}
|
|
<pre>{#syntax#}@ptrToInt(value: var) usize{#endsyntax#}</pre>
|
|
<p>
|
|
Converts {#syntax#}value{#endsyntax#} to a {#syntax#}usize{#endsyntax#} which is the address of the pointer. {#syntax#}value{#endsyntax#} can be one of these types:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}*T{#endsyntax#}</li>
|
|
<li>{#syntax#}?*T{#endsyntax#}</li>
|
|
<li>{#syntax#}fn(){#endsyntax#}</li>
|
|
<li>{#syntax#}?fn(){#endsyntax#}</li>
|
|
</ul>
|
|
<p>To convert the other way, use {#link|@intToPtr#}</p>
|
|
|
|
{#header_close#}
|
|
|
|
{#header_open|@rem#}
|
|
<pre>{#syntax#}@rem(numerator: T, denominator: T) T{#endsyntax#}</pre>
|
|
<p>
|
|
Remainder division. For unsigned integers this is the same as
|
|
{#syntax#}numerator % denominator{#endsyntax#}. Caller guarantees {#syntax#}denominator > 0{#endsyntax#}.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}@rem(-5, 3) == -2{#endsyntax#}</li>
|
|
<li>{#syntax#}@divTrunc(a, b) + @rem(a, b) == a{#endsyntax#}</li>
|
|
</ul>
|
|
<p>For a function that returns an error code, see {#syntax#}@import("std").math.rem{#endsyntax#}.</p>
|
|
{#see_also|@mod#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@returnAddress#}
|
|
<pre>{#syntax#}@returnAddress() usize{#endsyntax#}</pre>
|
|
<p>
|
|
This function returns the address of the next machine code instruction that will be executed
|
|
when the current function returns.
|
|
</p>
|
|
<p>
|
|
The implications of this are target specific and not consistent across
|
|
all platforms.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@setAlignStack#}
|
|
<pre>{#syntax#}@setAlignStack(comptime alignment: u29){#endsyntax#}</pre>
|
|
<p>
|
|
Ensures that a function will have a stack alignment of at least {#syntax#}alignment{#endsyntax#} bytes.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@setCold#}
|
|
<pre>{#syntax#}@setCold(is_cold: bool){#endsyntax#}</pre>
|
|
<p>
|
|
Tells the optimizer that a function is rarely called.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@setEvalBranchQuota#}
|
|
<pre>{#syntax#}@setEvalBranchQuota(new_quota: usize){#endsyntax#}</pre>
|
|
<p>
|
|
Changes the maximum number of backwards branches that compile-time code
|
|
execution can use before giving up and making a compile error.
|
|
</p>
|
|
<p>
|
|
If the {#syntax#}new_quota{#endsyntax#} is smaller than the default quota ({#syntax#}1000{#endsyntax#}) or
|
|
a previously explicitly set quota, it is ignored.
|
|
</p>
|
|
<p>
|
|
Example:
|
|
</p>
|
|
{#code_begin|test_err|evaluation exceeded 1000 backwards branches#}
|
|
test "foo" {
|
|
comptime {
|
|
var i = 0;
|
|
while (i < 1001) : (i += 1) {}
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>Now we use {#syntax#}@setEvalBranchQuota{#endsyntax#}:</p>
|
|
{#code_begin|test#}
|
|
test "foo" {
|
|
comptime {
|
|
@setEvalBranchQuota(1001);
|
|
var i = 0;
|
|
while (i < 1001) : (i += 1) {}
|
|
}
|
|
}
|
|
{#code_end#}
|
|
|
|
{#see_also|comptime#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@setFloatMode#}
|
|
<pre>{#syntax#}@setFloatMode(mode: @import("builtin").FloatMode){#endsyntax#}</pre>
|
|
<p>
|
|
Sets the floating point mode of the current scope. Possible values are:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
pub const FloatMode = enum {
|
|
Strict,
|
|
Optimized,
|
|
};
|
|
{#code_end#}
|
|
<ul>
|
|
<li>
|
|
{#syntax#}Strict{#endsyntax#} (default) - Floating point operations follow strict IEEE compliance.
|
|
</li>
|
|
<li>
|
|
{#syntax#}Optimized{#endsyntax#} - Floating point operations may do all of the following:
|
|
<ul>
|
|
<li>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.</li>
|
|
<li>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.</li>
|
|
<li>Treat the sign of a zero argument or result as insignificant.</li>
|
|
<li>Use the reciprocal of an argument rather than perform division.</li>
|
|
<li>Perform floating-point contraction (e.g. fusing a multiply followed by an addition into a fused multiply-and-add).</li>
|
|
<li>Perform algebraically equivalent transformations that may change results in floating point (e.g. reassociate).</li>
|
|
</ul>
|
|
This is equivalent to <code>-ffast-math</code> in GCC.
|
|
</li>
|
|
</ul>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#see_also|Floating Point Operations#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@setRuntimeSafety#}
|
|
<pre>{#syntax#}@setRuntimeSafety(safety_on: bool){#endsyntax#}</pre>
|
|
<p>
|
|
Sets whether runtime safety checks are enabled for the scope that contains the function call.
|
|
</p>
|
|
{#code_begin|test_safety|integer overflow#}
|
|
{#code_release_fast#}
|
|
test "@setRuntimeSafety" {
|
|
// The builtin applies to the scope that it is called in. So here, integer overflow
|
|
// will not be caught in ReleaseFast and ReleaseSmall modes:
|
|
// var x: u8 = 255;
|
|
// x += 1; // undefined behavior in ReleaseFast/ReleaseSmall modes.
|
|
{
|
|
// However this block has safety enabled, so safety checks happen here,
|
|
// even in ReleaseFast and ReleaseSmall modes.
|
|
@setRuntimeSafety(true);
|
|
var x: u8 = 255;
|
|
x += 1;
|
|
|
|
{
|
|
// The value can be overridden at any scope. So here integer overflow
|
|
// would not be caught in any build mode.
|
|
@setRuntimeSafety(false);
|
|
// var x: u8 = 255;
|
|
// x += 1; // undefined behavior in all build modes.
|
|
}
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<p>Note: it is <a href="https://github.com/ziglang/zig/issues/978">planned</a> to replace
|
|
{#syntax#}@setRuntimeSafety{#endsyntax#} with <code>@optimizeFor</code></p>
|
|
|
|
{#header_close#}
|
|
|
|
{#header_open|@shlExact#}
|
|
<pre>{#syntax#}@shlExact(value: T, shift_amt: Log2T) T{#endsyntax#}</pre>
|
|
<p>
|
|
Performs the left shift operation ({#syntax#}<<{#endsyntax#}). Caller guarantees
|
|
that the shift will not shift any 1 bits out.
|
|
</p>
|
|
<p>
|
|
The type of {#syntax#}shift_amt{#endsyntax#} is an unsigned integer with {#syntax#}log2(T.bit_count){#endsyntax#} bits.
|
|
This is because {#syntax#}shift_amt >= T.bit_count{#endsyntax#} is undefined behavior.
|
|
</p>
|
|
{#see_also|@shrExact|@shlWithOverflow#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@shlWithOverflow#}
|
|
<pre>{#syntax#}@shlWithOverflow(comptime T: type, a: T, shift_amt: Log2T, result: *T) bool{#endsyntax#}</pre>
|
|
<p>
|
|
Performs {#syntax#}result.* = a << b{#endsyntax#}. If overflow or underflow occurs,
|
|
stores the overflowed bits in {#syntax#}result{#endsyntax#} and returns {#syntax#}true{#endsyntax#}.
|
|
If no overflow or underflow occurs, returns {#syntax#}false{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
The type of {#syntax#}shift_amt{#endsyntax#} is an unsigned integer with {#syntax#}log2(T.bit_count){#endsyntax#} bits.
|
|
This is because {#syntax#}shift_amt >= T.bit_count{#endsyntax#} is undefined behavior.
|
|
</p>
|
|
{#see_also|@shlExact|@shrExact#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@shrExact#}
|
|
<pre>{#syntax#}@shrExact(value: T, shift_amt: Log2T) T{#endsyntax#}</pre>
|
|
<p>
|
|
Performs the right shift operation ({#syntax#}>>{#endsyntax#}). Caller guarantees
|
|
that the shift will not shift any 1 bits out.
|
|
</p>
|
|
<p>
|
|
The type of {#syntax#}shift_amt{#endsyntax#} is an unsigned integer with {#syntax#}log2(T.bit_count){#endsyntax#} bits.
|
|
This is because {#syntax#}shift_amt >= T.bit_count{#endsyntax#} is undefined behavior.
|
|
</p>
|
|
{#see_also|@shlExact|@shlWithOverflow#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@shuffle#}
|
|
<pre>{#syntax#}@shuffle(comptime E: type, a: std.meta.Vector(a_len, E), b: std.meta.Vector(b_len, E), comptime mask: std.meta.Vector(mask_len, i32)) std.meta.Vector(mask_len, E){#endsyntax#}</pre>
|
|
<p>
|
|
Constructs a new {#link|vector|Vectors#} by selecting elements from {#syntax#}a{#endsyntax#} and
|
|
{#syntax#}b{#endsyntax#} based on {#syntax#}mask{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
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 from 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#}).
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
<p>
|
|
{#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.
|
|
</p>
|
|
{#see_also|SIMD#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@sizeOf#}
|
|
<pre>{#syntax#}@sizeOf(comptime T: type) comptime_int{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
This size may contain padding bytes. If there were two consecutive T in memory, this 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#}.
|
|
</p>
|
|
<p>
|
|
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#}.
|
|
</p>
|
|
{#see_also|@bitSizeOf|@typeInfo#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@splat#}
|
|
<pre>{#syntax#}@splat(comptime len: u32, scalar: var) std.meta.Vector(len, @TypeOf(scalar)){#endsyntax#}</pre>
|
|
<p>
|
|
Produces a vector of length {#syntax#}len{#endsyntax#} where each element is the value
|
|
{#syntax#}scalar{#endsyntax#}:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "vector @splat" {
|
|
const scalar: u32 = 5;
|
|
const result = @splat(4, scalar);
|
|
comptime assert(@TypeOf(result) == std.meta.Vector(4, u32));
|
|
assert(std.mem.eql(u32, &@as([4]u32, result), &[_]u32{ 5, 5, 5, 5 }));
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
{#syntax#}scalar{#endsyntax#} must be an {#link|integer|Integers#}, {#link|bool|Primitive Types#},
|
|
{#link|float|Floats#}, or {#link|pointer|Pointers#}.
|
|
</p>
|
|
{#see_also|Vectors|@shuffle#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@sqrt#}
|
|
<pre>{#syntax#}@sqrt(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Performs the square root of a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@sin#}
|
|
<pre>{#syntax#}@sin(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Sine trigometric function on a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@cos#}
|
|
<pre>{#syntax#}@cos(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Cosine trigometric function on a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@exp#}
|
|
<pre>{#syntax#}@exp(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Base-e exponential function on a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@exp2#}
|
|
<pre>{#syntax#}@exp2(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Base-2 exponential function on a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@log#}
|
|
<pre>{#syntax#}@log(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Returns the natural logarithm of a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@log2#}
|
|
<pre>{#syntax#}@log2(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Returns the logarithm to the base 2 of a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@log10#}
|
|
<pre>{#syntax#}@log10(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Returns the logarithm to the base 10 of a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@fabs#}
|
|
<pre>{#syntax#}@fabs(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Returns the absolute value of a floating point number. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@floor#}
|
|
<pre>{#syntax#}@floor(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Returns the largest integral value not greater than the given floating point number.
|
|
Uses a dedicated hardware instruction when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@ceil#}
|
|
<pre>{#syntax#}@ceil(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Returns the largest integral value not less than the given floating point number.
|
|
Uses a dedicated hardware instruction when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@trunc#}
|
|
<pre>{#syntax#}@trunc(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Rounds the given floating point number to an integer, towards zero.
|
|
Uses a dedicated hardware instruction when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|@round#}
|
|
<pre>{#syntax#}@round(value: var) @TypeOf(value){#endsyntax#}</pre>
|
|
<p>
|
|
Rounds the given floating point number to an integer, away from zero. Uses a dedicated hardware instruction
|
|
when available.
|
|
</p>
|
|
<p>
|
|
Supports {#link|Floats#} and {#link|Vectors#} of floats, with the caveat that
|
|
<a href="https://github.com/ziglang/zig/issues/4026">some float operations are not yet implemented for all float types</a>.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@subWithOverflow#}
|
|
<pre>{#syntax#}@subWithOverflow(comptime T: type, a: T, b: T, result: *T) bool{#endsyntax#}</pre>
|
|
<p>
|
|
Performs {#syntax#}result.* = a - b{#endsyntax#}. If overflow or underflow occurs,
|
|
stores the overflowed bits in {#syntax#}result{#endsyntax#} and returns {#syntax#}true{#endsyntax#}.
|
|
If no overflow or underflow occurs, returns {#syntax#}false{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@tagName#}
|
|
<pre>{#syntax#}@tagName(value: var) []const u8{#endsyntax#}</pre>
|
|
<p>
|
|
Converts an enum value or union value to a slice of bytes representing the name.</p><p>If the enum is non-exhaustive and the tag value does not map to a name, it invokes safety-checked {#link|Undefined Behavior#}.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@TagType#}
|
|
<pre>{#syntax#}@TagType(T: type) type{#endsyntax#}</pre>
|
|
<p>
|
|
For an enum, returns the integer type that is used to store the enumeration value.
|
|
</p>
|
|
<p>
|
|
For a union, returns the enum type that is used to store the tag value.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@This#}
|
|
<pre>{#syntax#}@This() type{#endsyntax#}</pre>
|
|
<p>
|
|
Returns the innermost struct or union that this function call is inside.
|
|
This can be useful for an anonymous struct that needs to refer to itself:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "@This()" {
|
|
var items = [_]i32{ 1, 2, 3, 4 };
|
|
const list = List(i32){ .items = items[0..] };
|
|
assert(list.length() == 4);
|
|
}
|
|
|
|
fn List(comptime T: type) type {
|
|
return struct {
|
|
const Self = @This();
|
|
|
|
items: []T,
|
|
|
|
fn length(self: Self) usize {
|
|
return self.items.len;
|
|
}
|
|
};
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
When {#syntax#}@This(){#endsyntax#} is used at global scope, it returns a reference to the
|
|
struct that corresponds to the current file.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@truncate#}
|
|
<pre>{#syntax#}@truncate(comptime T: type, integer: var) T{#endsyntax#}</pre>
|
|
<p>
|
|
This function truncates bits from an integer type, resulting in a smaller
|
|
or same-sized integer type.
|
|
</p>
|
|
<p>
|
|
The following produces safety-checked {#link|Undefined Behavior#}:
|
|
</p>
|
|
{#code_begin|test_err|cast truncated bits#}
|
|
test "integer cast panic" {
|
|
var a: u16 = 0xabcd;
|
|
var b: u8 = @intCast(u8, a);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
However this is well defined and working code:
|
|
</p>
|
|
{#code_begin|test|truncate#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "integer truncation" {
|
|
var a: u16 = 0xabcd;
|
|
var b: u8 = @truncate(u8, a);
|
|
assert(b == 0xcd);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This function always truncates the significant bits of the integer, regardless
|
|
of endianness on the target platform.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@Type#}
|
|
<pre>{#syntax#}@Type(comptime info: @import("builtin").TypeInfo) type{#endsyntax#}</pre>
|
|
<p>
|
|
This function is the inverse of {#link|@typeInfo#}. It reifies type information
|
|
into a {#syntax#}type{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
It is available for the following types:
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}type{#endsyntax#}</li>
|
|
<li>{#syntax#}noreturn{#endsyntax#}</li>
|
|
<li>{#syntax#}void{#endsyntax#}</li>
|
|
<li>{#syntax#}bool{#endsyntax#}</li>
|
|
<li>{#link|Integers#} - The maximum bit count for an integer type is {#syntax#}65535{#endsyntax#}.</li>
|
|
<li>{#link|Floats#}</li>
|
|
<li>{#link|Pointers#}</li>
|
|
<li>{#syntax#}comptime_int{#endsyntax#}</li>
|
|
<li>{#syntax#}comptime_float{#endsyntax#}</li>
|
|
<li>{#syntax#}@TypeOf(undefined){#endsyntax#}</li>
|
|
<li>{#syntax#}@TypeOf(null){#endsyntax#}</li>
|
|
<li>{#link|Arrays#}</li>
|
|
<li>{#link|Optionals#}</li>
|
|
<li>{#link|Error Union Type#}</li>
|
|
<li>{#link|Vectors#}</li>
|
|
<li>{#link|Opaque Types#}</li>
|
|
<li>AnyFrame</li>
|
|
</ul>
|
|
<p>
|
|
For these types it is a
|
|
<a href="https://github.com/ziglang/zig/issues/2907">TODO in the compiler to implement</a>:
|
|
</p>
|
|
<ul>
|
|
<li>ErrorSet</li>
|
|
<li>Enum</li>
|
|
<li>FnFrame</li>
|
|
<li>EnumLiteral</li>
|
|
</ul>
|
|
<p>
|
|
For these types, {#syntax#}@Type{#endsyntax#} is not available.
|
|
<a href="https://github.com/ziglang/zig/issues/383">There is an open proposal to allow unions and structs</a>.
|
|
</p>
|
|
<ul>
|
|
<li>{#link|union#}</li>
|
|
<li>{#link|Functions#}</li>
|
|
<li>BoundFn</li>
|
|
<li>{#link|struct#}</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|@typeInfo#}
|
|
<pre>{#syntax#}@typeInfo(comptime T: type) @import("std").builtin.TypeInfo{#endsyntax#}</pre>
|
|
<p>
|
|
Provides type reflection.
|
|
</p>
|
|
<p>
|
|
For {#link|structs|struct#}, {#link|unions|union#}, {#link|enums|enum#}, and
|
|
{#link|error sets|Error Set Type#}, the fields are guaranteed to be in the same
|
|
order as declared. For declarations, the order is unspecified.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|@typeName#}
|
|
<pre>{#syntax#}@typeName(T: type) [N]u8{#endsyntax#}</pre>
|
|
<p>
|
|
This function returns the string representation of a type, as
|
|
an array. It is equivalent to a string literal of the type name.
|
|
</p>
|
|
|
|
{#header_close#}
|
|
|
|
{#header_open|@TypeOf#}
|
|
<pre>{#syntax#}@TypeOf(...) type{#endsyntax#}</pre>
|
|
<p>
|
|
{#syntax#}@TypeOf{#endsyntax#} is a special builtin function that takes any (nonzero) number of expressions
|
|
as parameters and returns the type of the result, using {#link|Peer Type Resolution#}.
|
|
</p>
|
|
<p>
|
|
The expressions are evaluated, however they are guaranteed to have no <em>runtime</em> side-effects:
|
|
</p>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "no runtime side effects" {
|
|
var data: i32 = 0;
|
|
const T = @TypeOf(foo(i32, &data));
|
|
comptime assert(T == i32);
|
|
assert(data == 0);
|
|
}
|
|
|
|
fn foo(comptime T: type, ptr: *T) T {
|
|
ptr.* += 1;
|
|
return ptr.*;
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|@unionInit#}
|
|
<pre>{#syntax#}@unionInit(comptime Union: type, comptime active_field_name: []const u8, init_expr) Union{#endsyntax#}</pre>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
{#syntax#}@unionInit{#endsyntax#} forwards its {#link|result location|Result Location Semantics#} to {#syntax#}init_expr{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Opaque Types#}
|
|
{#syntax#}@Type(.Opaque){#endsyntax#} creates a new type with an unknown (but non-zero) size and alignment.
|
|
</p>
|
|
<p>
|
|
This is typically used for type safety when interacting with C code that does not expose struct details.
|
|
Example:
|
|
</p>
|
|
{#code_begin|test_err|expected type '*Derp', found '*Wat'#}
|
|
const Derp = @Type(.Opaque);
|
|
const Wat = @Type(.Opaque);
|
|
|
|
extern fn bar(d: *Derp) void;
|
|
fn foo(w: *Wat) callconv(.C) void {
|
|
bar(w);
|
|
}
|
|
|
|
test "call foo" {
|
|
foo(undefined);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Build Mode#}
|
|
<p>
|
|
Zig has four build modes:
|
|
</p>
|
|
<ul>
|
|
<li>{#link|Debug#} (default)</li>
|
|
<li>{#link|ReleaseFast#}</li>
|
|
<li>{#link|ReleaseSafe#}</li>
|
|
<li>{#link|ReleaseSmall#}</li>
|
|
</ul>
|
|
<p>
|
|
To add standard build options to a <code>build.zig</code> file:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const Builder = @import("std").build.Builder;
|
|
|
|
pub fn build(b: *Builder) void {
|
|
const exe = b.addExecutable("example", "example.zig");
|
|
exe.setBuildMode(b.standardReleaseOptions());
|
|
b.default_step.dependOn(&exe.step);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This causes these options to be available:
|
|
</p>
|
|
<pre><code class="shell"> -Drelease-safe=[bool] optimizations on and safety on
|
|
-Drelease-fast=[bool] optimizations on and safety off
|
|
-Drelease-small=[bool] size optimizations on and safety off</code></pre>
|
|
{#header_open|Debug#}
|
|
<pre><code class="shell">$ zig build-exe example.zig</code></pre>
|
|
<ul>
|
|
<li>Fast compilation speed</li>
|
|
<li>Safety checks enabled</li>
|
|
<li>Slow runtime performance</li>
|
|
<li>Large binary size</li>
|
|
<li>No reproducible build requirement</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|ReleaseFast#}
|
|
<pre><code class="shell">$ zig build-exe example.zig --release-fast</code></pre>
|
|
<ul>
|
|
<li>Fast runtime performance</li>
|
|
<li>Safety checks disabled</li>
|
|
<li>Slow compilation speed</li>
|
|
<li>Large binary size</li>
|
|
<li>Reproducible build</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|ReleaseSafe#}
|
|
<pre><code class="shell">$ zig build-exe example.zig --release-safe</code></pre>
|
|
<ul>
|
|
<li>Medium runtime performance</li>
|
|
<li>Safety checks enabled</li>
|
|
<li>Slow compilation speed</li>
|
|
<li>Large binary size</li>
|
|
<li>Reproducible build</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|ReleaseSmall#}
|
|
<pre><code class="shell">$ zig build-exe example.zig --release-small</code></pre>
|
|
<ul>
|
|
<li>Medium runtime performance</li>
|
|
<li>Safety checks disabled</li>
|
|
<li>Slow compilation speed</li>
|
|
<li>Small binary size</li>
|
|
<li>Reproducible build</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#see_also|Compile Variables|Zig Build System|Undefined Behavior#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Single Threaded Builds#}
|
|
<p>Zig has a compile option <code>--single-threaded</code> which has the following effects:</p>
|
|
<ul>
|
|
<li>All {#link|Thread Local Variables#} are treated as {#link|Global Variables#}.</li>
|
|
<li>The overhead of {#link|Async Functions#} becomes equivalent to function call overhead.</li>
|
|
<li>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.</li>
|
|
</ul>
|
|
{#header_close#}
|
|
|
|
{#header_open|Undefined Behavior#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
When a safety check fails, Zig crashes with a stack trace, like this:
|
|
</p>
|
|
{#code_begin|test_err|reached unreachable code#}
|
|
test "safety check" {
|
|
unreachable;
|
|
}
|
|
{#code_end#}
|
|
{#header_open|Reaching Unreachable Code#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|unable to evaluate constant expression#}
|
|
comptime {
|
|
assert(false);
|
|
}
|
|
fn assert(ok: bool) void {
|
|
if (!ok) unreachable; // assertion failure
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
std.debug.assert(false);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Index out of Bounds#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|index 5 outside array of size 5#}
|
|
comptime {
|
|
const array: [5]u8 = "hello".*;
|
|
const garbage = array[5];
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
pub fn main() void {
|
|
var x = foo("hello");
|
|
}
|
|
|
|
fn foo(x: []const u8) u8 {
|
|
return x[5];
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Cast Negative Number to Unsigned Integer#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|cannot cast negative value -1 to unsigned integer type 'u32'#}
|
|
comptime {
|
|
const value: i32 = -1;
|
|
const unsigned = @intCast(u32, value);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var value: i32 = -1;
|
|
var unsigned = @intCast(u32, value);
|
|
std.debug.warn("value: {}\n", .{unsigned});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
To obtain the maximum value of an unsigned integer, use {#syntax#}std.math.maxInt{#endsyntax#}.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Cast Truncates Data#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|integer value 300 cannot be coerced to type 'u8'#}
|
|
comptime {
|
|
const spartan_count: u16 = 300;
|
|
const byte = @intCast(u8, spartan_count);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var spartan_count: u16 = 300;
|
|
const byte = @intCast(u8, spartan_count);
|
|
std.debug.warn("value: {}\n", .{byte});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
To truncate bits, use {#link|@truncate#}.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Integer Overflow#}
|
|
{#header_open|Default Operations#}
|
|
<p>The following operators can cause integer overflow:</p>
|
|
<ul>
|
|
<li>{#syntax#}+{#endsyntax#} (addition)</li>
|
|
<li>{#syntax#}-{#endsyntax#} (subtraction)</li>
|
|
<li>{#syntax#}-{#endsyntax#} (negation)</li>
|
|
<li>{#syntax#}*{#endsyntax#} (multiplication)</li>
|
|
<li>{#syntax#}/{#endsyntax#} (division)</li>
|
|
<li>{#link|@divTrunc#} (division)</li>
|
|
<li>{#link|@divFloor#} (division)</li>
|
|
<li>{#link|@divExact#} (division)</li>
|
|
</ul>
|
|
<p>Example with addition at compile-time:</p>
|
|
{#code_begin|test_err|operation caused overflow#}
|
|
comptime {
|
|
var byte: u8 = 255;
|
|
byte += 1;
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var byte: u8 = 255;
|
|
byte += 1;
|
|
std.debug.warn("value: {}\n", .{byte});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Standard Library Math Functions#}
|
|
<p>These functions provided by the standard library return possible errors.</p>
|
|
<ul>
|
|
<li>{#syntax#}@import("std").math.add{#endsyntax#}</li>
|
|
<li>{#syntax#}@import("std").math.sub{#endsyntax#}</li>
|
|
<li>{#syntax#}@import("std").math.mul{#endsyntax#}</li>
|
|
<li>{#syntax#}@import("std").math.divTrunc{#endsyntax#}</li>
|
|
<li>{#syntax#}@import("std").math.divFloor{#endsyntax#}</li>
|
|
<li>{#syntax#}@import("std").math.divExact{#endsyntax#}</li>
|
|
<li>{#syntax#}@import("std").math.shl{#endsyntax#}</li>
|
|
</ul>
|
|
<p>Example of catching an overflow for addition:</p>
|
|
{#code_begin|exe_err#}
|
|
const math = @import("std").math;
|
|
const warn = @import("std").debug.warn;
|
|
pub fn main() !void {
|
|
var byte: u8 = 255;
|
|
|
|
byte = if (math.add(u8, byte, 1)) |result| result else |err| {
|
|
warn("unable to add one: {}\n", .{@errorName(err)});
|
|
return err;
|
|
};
|
|
|
|
warn("result: {}\n", .{byte});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Builtin Overflow Functions#}
|
|
<p>
|
|
These builtins return a {#syntax#}bool{#endsyntax#} of whether or not overflow
|
|
occurred, as well as returning the overflowed bits:
|
|
</p>
|
|
<ul>
|
|
<li>{#link|@addWithOverflow#}</li>
|
|
<li>{#link|@subWithOverflow#}</li>
|
|
<li>{#link|@mulWithOverflow#}</li>
|
|
<li>{#link|@shlWithOverflow#}</li>
|
|
</ul>
|
|
<p>
|
|
Example of {#link|@addWithOverflow#}:
|
|
</p>
|
|
{#code_begin|exe#}
|
|
const warn = @import("std").debug.warn;
|
|
pub fn main() void {
|
|
var byte: u8 = 255;
|
|
|
|
var result: u8 = undefined;
|
|
if (@addWithOverflow(u8, byte, 10, &result)) {
|
|
warn("overflowed result: {}\n", .{result});
|
|
} else {
|
|
warn("result: {}\n", .{result});
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Wrapping Operations#}
|
|
<p>
|
|
These operations have guaranteed wraparound semantics.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}+%{#endsyntax#} (wraparound addition)</li>
|
|
<li>{#syntax#}-%{#endsyntax#} (wraparound subtraction)</li>
|
|
<li>{#syntax#}-%{#endsyntax#} (wraparound negation)</li>
|
|
<li>{#syntax#}*%{#endsyntax#} (wraparound multiplication)</li>
|
|
</ul>
|
|
{#code_begin|test#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
const minInt = std.math.minInt;
|
|
const maxInt = std.math.maxInt;
|
|
|
|
test "wraparound addition and subtraction" {
|
|
const x: i32 = maxInt(i32);
|
|
const min_val = x +% 1;
|
|
assert(min_val == minInt(i32));
|
|
const max_val = min_val -% 1;
|
|
assert(max_val == maxInt(i32));
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Exact Left Shift Overflow#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|operation caused overflow#}
|
|
comptime {
|
|
const x = @shlExact(@as(u8, 0b01010101), 2);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var x: u8 = 0b01010101;
|
|
var y = @shlExact(x, 2);
|
|
std.debug.warn("value: {}\n", .{y});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Exact Right Shift Overflow#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|exact shift shifted out 1 bits#}
|
|
comptime {
|
|
const x = @shrExact(@as(u8, 0b10101010), 2);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var x: u8 = 0b10101010;
|
|
var y = @shrExact(x, 2);
|
|
std.debug.warn("value: {}\n", .{y});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Division by Zero#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|division by zero#}
|
|
comptime {
|
|
const a: i32 = 1;
|
|
const b: i32 = 0;
|
|
const c = a / b;
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var a: u32 = 1;
|
|
var b: u32 = 0;
|
|
var c = a / b;
|
|
std.debug.warn("value: {}\n", .{c});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Remainder Division by Zero#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|division by zero#}
|
|
comptime {
|
|
const a: i32 = 10;
|
|
const b: i32 = 0;
|
|
const c = a % b;
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var a: u32 = 10;
|
|
var b: u32 = 0;
|
|
var c = a % b;
|
|
std.debug.warn("value: {}\n", .{c});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Exact Division Remainder#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|exact division had a remainder#}
|
|
comptime {
|
|
const a: u32 = 10;
|
|
const b: u32 = 3;
|
|
const c = @divExact(a, b);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var a: u32 = 10;
|
|
var b: u32 = 3;
|
|
var c = @divExact(a, b);
|
|
std.debug.warn("value: {}\n", .{c});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Attempt to Unwrap Null#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|unable to unwrap null#}
|
|
comptime {
|
|
const optional_number: ?i32 = null;
|
|
const number = optional_number.?;
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var optional_number: ?i32 = null;
|
|
var number = optional_number.?;
|
|
std.debug.warn("value: {}\n", .{number});
|
|
}
|
|
{#code_end#}
|
|
<p>One way to avoid this crash is to test for null instead of assuming non-null, with
|
|
the {#syntax#}if{#endsyntax#} expression:</p>
|
|
{#code_begin|exe|test#}
|
|
const warn = @import("std").debug.warn;
|
|
pub fn main() void {
|
|
const optional_number: ?i32 = null;
|
|
|
|
if (optional_number) |number| {
|
|
warn("got number: {}\n", .{number});
|
|
} else {
|
|
warn("it's null\n", .{});
|
|
}
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Optionals#}
|
|
{#header_close#}
|
|
{#header_open|Attempt to Unwrap Error#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|caught unexpected error 'UnableToReturnNumber'#}
|
|
comptime {
|
|
const number = getNumberOrFail() catch unreachable;
|
|
}
|
|
|
|
fn getNumberOrFail() !i32 {
|
|
return error.UnableToReturnNumber;
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
const number = getNumberOrFail() catch unreachable;
|
|
std.debug.warn("value: {}\n", .{number});
|
|
}
|
|
|
|
fn getNumberOrFail() !i32 {
|
|
return error.UnableToReturnNumber;
|
|
}
|
|
{#code_end#}
|
|
<p>One way to avoid this crash is to test for an error instead of assuming a successful result, with
|
|
the {#syntax#}if{#endsyntax#} expression:</p>
|
|
{#code_begin|exe#}
|
|
const warn = @import("std").debug.warn;
|
|
|
|
pub fn main() void {
|
|
const result = getNumberOrFail();
|
|
|
|
if (result) |number| {
|
|
warn("got number: {}\n", .{number});
|
|
} else |err| {
|
|
warn("got error: {}\n", .{@errorName(err)});
|
|
}
|
|
}
|
|
|
|
fn getNumberOrFail() !i32 {
|
|
return error.UnableToReturnNumber;
|
|
}
|
|
{#code_end#}
|
|
{#see_also|Errors#}
|
|
{#header_close#}
|
|
{#header_open|Invalid Error Code#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|integer value 11 represents no error#}
|
|
comptime {
|
|
const err = error.AnError;
|
|
const number = @errorToInt(err) + 10;
|
|
const invalid_err = @intToError(number);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() void {
|
|
var err = error.AnError;
|
|
var number = @errorToInt(err) + 500;
|
|
var invalid_err = @intToError(number);
|
|
std.debug.warn("value: {}\n", .{number});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Invalid Enum Cast#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|has no tag matching integer value 3#}
|
|
const Foo = enum {
|
|
A,
|
|
B,
|
|
C,
|
|
};
|
|
comptime {
|
|
const a: u2 = 3;
|
|
const b = @intToEnum(Foo, a);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
const Foo = enum {
|
|
A,
|
|
B,
|
|
C,
|
|
};
|
|
|
|
pub fn main() void {
|
|
var a: u2 = 3;
|
|
var b = @intToEnum(Foo, a);
|
|
std.debug.warn("value: {}\n", .{@tagName(b)});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Invalid Error Set Cast#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|error.B not a member of error set 'Set2'#}
|
|
const Set1 = error{
|
|
A,
|
|
B,
|
|
};
|
|
const Set2 = error{
|
|
A,
|
|
C,
|
|
};
|
|
comptime {
|
|
_ = @errSetCast(Set2, Set1.B);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
const Set1 = error{
|
|
A,
|
|
B,
|
|
};
|
|
const Set2 = error{
|
|
A,
|
|
C,
|
|
};
|
|
pub fn main() void {
|
|
foo(Set1.B);
|
|
}
|
|
fn foo(set1: Set1) void {
|
|
const x = @errSetCast(Set2, set1);
|
|
std.debug.warn("value: {}\n", .{x});
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Incorrect Pointer Alignment#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|pointer address 0x1 is not aligned to 4 bytes#}
|
|
comptime {
|
|
const ptr = @intToPtr(*align(1) i32, 0x1);
|
|
const aligned = @alignCast(4, ptr);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const mem = @import("std").mem;
|
|
pub fn main() !void {
|
|
var array align(4) = [_]u32{ 0x11111111, 0x11111111 };
|
|
const bytes = mem.sliceAsBytes(array[0..]);
|
|
if (foo(bytes) != 0x11111111) return error.Wrong;
|
|
}
|
|
fn foo(bytes: []u8) u32 {
|
|
const slice4 = bytes[1..5];
|
|
const int_slice = mem.bytesAsSlice(u32, @alignCast(4, slice4));
|
|
return int_slice[0];
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
{#header_open|Wrong Union Field Access#}
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|accessing union field 'float' while field 'int' is set#}
|
|
comptime {
|
|
var f = Foo{ .int = 42 };
|
|
f.float = 12.34;
|
|
}
|
|
|
|
const Foo = union {
|
|
float: f32,
|
|
int: u32,
|
|
};
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
const std = @import("std");
|
|
|
|
const Foo = union {
|
|
float: f32,
|
|
int: u32,
|
|
};
|
|
|
|
pub fn main() void {
|
|
var f = Foo{ .int = 42 };
|
|
bar(&f);
|
|
}
|
|
|
|
fn bar(f: *Foo) void {
|
|
f.float = 12.34;
|
|
std.debug.warn("value: {}\n", .{f.float});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This safety is not available for {#syntax#}extern{#endsyntax#} or {#syntax#}packed{#endsyntax#} unions.
|
|
</p>
|
|
<p>
|
|
To change the active field of a union, assign the entire union, like this:
|
|
</p>
|
|
{#code_begin|exe#}
|
|
const std = @import("std");
|
|
|
|
const Foo = union {
|
|
float: f32,
|
|
int: u32,
|
|
};
|
|
|
|
pub fn main() void {
|
|
var f = Foo{ .int = 42 };
|
|
bar(&f);
|
|
}
|
|
|
|
fn bar(f: *Foo) void {
|
|
f.* = Foo{ .float = 12.34 };
|
|
std.debug.warn("value: {}\n", .{f.float});
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
To change the active field of a union when a meaningful value for the field is not known,
|
|
use {#link|undefined#}, like this:
|
|
</p>
|
|
{#code_begin|exe#}
|
|
const std = @import("std");
|
|
|
|
const Foo = union {
|
|
float: f32,
|
|
int: u32,
|
|
};
|
|
|
|
pub fn main() void {
|
|
var f = Foo{ .int = 42 };
|
|
f = Foo{ .float = undefined };
|
|
bar(&f);
|
|
std.debug.warn("value: {}\n", .{f.float});
|
|
}
|
|
|
|
fn bar(f: *Foo) void {
|
|
f.float = 12.34;
|
|
}
|
|
{#code_end#}
|
|
{#see_also|union|extern union#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Out of Bounds Float to Integer Cast#}
|
|
<p>TODO</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Pointer Cast Invalid Null#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>At compile-time:</p>
|
|
{#code_begin|test_err|null pointer casted to type#}
|
|
comptime {
|
|
const opt_ptr: ?*i32 = null;
|
|
const ptr = @ptrCast(*i32, opt_ptr);
|
|
}
|
|
{#code_end#}
|
|
<p>At runtime:</p>
|
|
{#code_begin|exe_err#}
|
|
pub fn main() void {
|
|
var opt_ptr: ?*i32 = null;
|
|
var ptr = @ptrCast(*i32, opt_ptr);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
|
|
{#header_close#}
|
|
{#header_open|Memory#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
<p>{#link|Where are the bytes?#}</p>
|
|
<p>
|
|
Like Zig, the C programming language has manual memory management. However, unlike Zig,
|
|
C has a default allocator - <code>malloc</code>, <code>realloc</code>, and <code>free</code>.
|
|
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:
|
|
</p>
|
|
{#code_begin|test|allocator#}
|
|
const std = @import("std");
|
|
const Allocator = std.mem.Allocator;
|
|
const assert = std.debug.assert;
|
|
|
|
test "using an allocator" {
|
|
var buffer: [100]u8 = undefined;
|
|
const allocator = &std.heap.FixedBufferAllocator.init(&buffer).allocator;
|
|
const result = try concat(allocator, "foo", "bar");
|
|
assert(std.mem.eql(u8, "foobar", result));
|
|
}
|
|
|
|
fn concat(allocator: *Allocator, a: []const u8, b: []const u8) ![]u8 {
|
|
const result = try allocator.alloc(u8, a.len + b.len);
|
|
std.mem.copy(u8, result, a);
|
|
std.mem.copy(u8, result[a.len..], b);
|
|
return result;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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 do perform basic leak detection.
|
|
</p>
|
|
<p>
|
|
Currently Zig has no general purpose allocator, but there is
|
|
<a href="https://github.com/andrewrk/zig-general-purpose-allocator/">one under active development</a>.
|
|
Once it is merged into the Zig standard library it will become available to import
|
|
with {#syntax#}std.heap.default_allocator{#endsyntax#}. However, it will still be recommended to
|
|
follow the {#link|Choosing an Allocator#} guide.
|
|
</p>
|
|
|
|
{#header_open|Choosing an Allocator#}
|
|
<p>What allocator to use depends on a number of factors. Here is a flow chart to help you decide:
|
|
</p>
|
|
<ol>
|
|
<li>
|
|
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.
|
|
</li>
|
|
<li>Are you linking libc? In this case, {#syntax#}std.heap.c_allocator{#endsyntax#} is likely
|
|
the right choice, at least for your main allocator.</li>
|
|
<li>
|
|
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#} or
|
|
{#syntax#}std.heap.ThreadSafeFixedBufferAllocator{#endsyntax#} depending on whether you need
|
|
thread-safety or not.
|
|
</li>
|
|
<li>
|
|
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_begin|exe|cli_allocation#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() !void {
|
|
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
|
|
defer arena.deinit();
|
|
|
|
const allocator = &arena.allocator;
|
|
|
|
const ptr = try allocator.create(i32);
|
|
std.debug.warn("ptr={*}\n", .{ptr});
|
|
}
|
|
{#code_end#}
|
|
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#}.
|
|
</li>
|
|
<li>
|
|
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.
|
|
</li>
|
|
<li>
|
|
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#}.
|
|
</li>
|
|
<li>
|
|
Finally, if none of the above apply, you need a general purpose allocator. Zig does not
|
|
yet have a general purpose allocator in the standard library,
|
|
<a href="https://github.com/andrewrk/zig-general-purpose-allocator/">but one is being actively developed</a>.
|
|
You can also consider {#link|Implementing an Allocator#}.
|
|
</li>
|
|
</ol>
|
|
{#header_close#}
|
|
|
|
{#header_open|Where are the bytes?#}
|
|
<p>String literals such as {#syntax#}"foo"{#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:
|
|
</p>
|
|
{#code_begin|test_err|expected type '[]u8'#}
|
|
fn foo(s: []u8) void {}
|
|
|
|
test "string literal to mutable slice" {
|
|
foo("hello");
|
|
}
|
|
{#code_end#}
|
|
<p>However if you make the slice constant, then it works:</p>
|
|
{#code_begin|test|strlit#}
|
|
fn foo(s: []const u8) void {}
|
|
|
|
test "string literal to constant slice" {
|
|
foo("hello");
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Just like string literals, `const` 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.
|
|
</p>
|
|
<p>
|
|
`var` 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#}.
|
|
</p>
|
|
<p>
|
|
`var` declarations at the top level or in {#link|struct#} declarations are stored in the global
|
|
data section.
|
|
</p>
|
|
<p>
|
|
The location of memory allocated with {#syntax#}allocator.alloc{#endsyntax#} or
|
|
{#syntax#}allocator.create{#endsyntax#} is determined by the allocator's implementation.
|
|
</p>
|
|
<p>TODO: thread local variables</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Implementing an Allocator#}
|
|
<p>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#}reallocFn{#endsyntax#} and a {#syntax#}shrinkFn{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
There are many example allocators to look at for inspiration. Look at std/heap.zig and
|
|
at this
|
|
<a href="https://github.com/andrewrk/zig-general-purpose-allocator/">work-in-progress general purpose allocator</a>.
|
|
TODO: once <a href="https://github.com/ziglang/zig/issues/21">#21</a> is done, link to the docs
|
|
here.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Heap Allocation Failure#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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:
|
|
</p>
|
|
<ul>
|
|
<li>Only some operating systems have an overcommit feature.
|
|
<ul>
|
|
<li>Linux has it enabled by default, but it is configurable.</li>
|
|
<li>Windows does not overcommit.</li>
|
|
<li>Embedded systems do not have overcommit.</li>
|
|
<li>Hobby operating systems may or may not have overcommit.</li>
|
|
</ul>
|
|
</li>
|
|
<li>
|
|
For real-time systems, not only is there no overcommit, but typically the maximum amount
|
|
of memory per application is determined ahead of time.
|
|
</li>
|
|
<li>
|
|
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.
|
|
</li>
|
|
<li>
|
|
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.
|
|
</li>
|
|
</ul>
|
|
{#header_close#}
|
|
|
|
{#header_open|Recursion#}
|
|
<p>
|
|
Recursion is a fundamental tool in modeling software. However it has an often-overlooked problem:
|
|
unbounded memory allocation.
|
|
</p>
|
|
<p>
|
|
Recursion is an area of active experimentation in Zig and so the documentation here is not final.
|
|
You can read a
|
|
<a href="https://ziglang.org/download/0.3.0/release-notes.html#recursion">summary of recursion status in the 0.3.0 release notes</a>.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Lifetime and Ownership#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
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).
|
|
</p>
|
|
{#header_close#}
|
|
|
|
{#header_close#}
|
|
{#header_open|Compile Variables#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const builtin = @import("builtin");
|
|
const separator = if (builtin.os == builtin.Os.windows) '\\' else '/';
|
|
{#code_end#}
|
|
<p>
|
|
Example of what is imported with {#syntax#}@import("builtin"){#endsyntax#}:
|
|
</p>
|
|
{#builtin#}
|
|
{#see_also|Build Mode#}
|
|
{#header_close#}
|
|
{#header_open|Root Source File#}
|
|
<p>TODO: explain how root source file finds other files</p>
|
|
<p>TODO: pub fn main</p>
|
|
<p>TODO: pub fn panic</p>
|
|
<p>TODO: if linking with libc you can use export fn main</p>
|
|
<p>TODO: order independent top level declarations</p>
|
|
<p>TODO: lazy analysis</p>
|
|
<p>TODO: using comptime { _ = @import() }</p>
|
|
{#header_close#}
|
|
{#header_open|Zig Test#}
|
|
<p>
|
|
<code>zig test</code> is a tool that can be used to quickly build and run Zig code
|
|
to make sure behavior meets expectations. {#syntax#}@import("builtin").is_test{#endsyntax#}
|
|
is available for code to detect whether the current build is a test build.
|
|
</p>
|
|
{#code_begin|test|detect_test#}
|
|
const std = @import("std");
|
|
const builtin = std.builtin;
|
|
const assert = std.debug.assert;
|
|
|
|
test "builtin.is_test" {
|
|
assert(builtin.is_test);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
Zig has lazy top level declaration analysis, which means that if a function is not called,
|
|
or otherwise used, it is not analyzed. This means that there may be an undiscovered
|
|
compile error in a function because it is never called.
|
|
</p>
|
|
{#code_begin|test|unused_fn#}
|
|
fn unused() i32 {
|
|
return "wrong return type";
|
|
}
|
|
test "unused function" { }
|
|
{#code_end#}
|
|
<p>
|
|
Note that, while in {#link|Debug#} and {#link|ReleaseSafe#} modes, {#link|unreachable#} emits a
|
|
call to {#link|@panic#}, in {#link|ReleaseFast#} and {#link|ReleaseSmall#} modes, it is really
|
|
undefined behavior. The implementation of {#syntax#}std.debug.assert{#endsyntax#} is as
|
|
simple as:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
pub fn assert(ok: bool) void {
|
|
if (!ok) unreachable;
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
This means that when testing in ReleaseFast or ReleaseSmall mode, {#syntax#}assert{#endsyntax#}
|
|
is not sufficient to check the result of a computation:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const std = @import("std");
|
|
const assert = std.debug.assert;
|
|
|
|
test "assert in release fast mode" {
|
|
assert(false);
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
When compiling this test in {#link|ReleaseFast#} mode, it invokes unchecked
|
|
{#link|Undefined Behavior#}. Since that could do anything, this documentation
|
|
cannot show you the output.
|
|
</p>
|
|
<p>
|
|
Better practice for checking the output when testing is to use {#syntax#}std.testing.expect{#endsyntax#}:
|
|
</p>
|
|
{#code_begin|test_err|test failure#}
|
|
{#code_release_fast#}
|
|
const std = @import("std");
|
|
const expect = std.testing.expect;
|
|
|
|
test "assert in release fast mode" {
|
|
expect(false);
|
|
}
|
|
{#code_end#}
|
|
<p>See the rest of the {#syntax#}std.testing{#endsyntax#} namespace for more available functions.</p>
|
|
<p>
|
|
<code>zig test</code> has a few command line parameters which affect the compilation. See
|
|
<code>zig --help</code> for a full list. The most interesting one is <code>--test-filter [text]</code>.
|
|
This makes the test build only include tests whose name contains the supplied filter text.
|
|
Again, thanks to lazy analysis, this can allow you to narrow a build to only a few functions in
|
|
isolation.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Zig Build System#}
|
|
<p>TODO: explain purpose, it's supposed to replace make/cmake</p>
|
|
<p>TODO: example of building a zig executable</p>
|
|
<p>TODO: example of building a C library</p>
|
|
{#header_close#}
|
|
{#header_open|C#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
There are a few ways that Zig facilitates C interop.
|
|
</p>
|
|
{#header_open|C Type Primitives#}
|
|
<p>
|
|
These have guaranteed C ABI compatibility and can be used like any other type.
|
|
</p>
|
|
<ul>
|
|
<li>{#syntax#}c_short{#endsyntax#}</li>
|
|
<li>{#syntax#}c_ushort{#endsyntax#}</li>
|
|
<li>{#syntax#}c_int{#endsyntax#}</li>
|
|
<li>{#syntax#}c_uint{#endsyntax#}</li>
|
|
<li>{#syntax#}c_long{#endsyntax#}</li>
|
|
<li>{#syntax#}c_ulong{#endsyntax#}</li>
|
|
<li>{#syntax#}c_longlong{#endsyntax#}</li>
|
|
<li>{#syntax#}c_ulonglong{#endsyntax#}</li>
|
|
<li>{#syntax#}c_longdouble{#endsyntax#}</li>
|
|
<li>{#syntax#}c_void{#endsyntax#}</li>
|
|
</ul>
|
|
{#see_also|Primitive Types#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Import from C Header File#}
|
|
<p>
|
|
The {#syntax#}@cImport{#endsyntax#} builtin function can be used
|
|
to directly import symbols from .h files:
|
|
</p>
|
|
{#code_begin|exe#}
|
|
{#link_libc#}
|
|
const c = @cImport({
|
|
// See https://github.com/ziglang/zig/issues/515
|
|
@cDefine("_NO_CRT_STDIO_INLINE", "1");
|
|
@cInclude("stdio.h");
|
|
});
|
|
pub fn main() void {
|
|
_ = c.printf("hello\n");
|
|
}
|
|
{#code_end#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
{#code_begin|syntax#}
|
|
const builtin = @import("builtin");
|
|
|
|
const c = @cImport({
|
|
@cDefine("NDEBUG", builtin.mode == .ReleaseFast);
|
|
if (something) {
|
|
@cDefine("_GNU_SOURCE", {});
|
|
}
|
|
@cInclude("stdlib.h");
|
|
if (something) {
|
|
@cUndef("_GNU_SOURCE");
|
|
}
|
|
@cInclude("soundio.h");
|
|
});
|
|
{#code_end#}
|
|
{#see_also|@cImport|@cInclude|@cDefine|@cUndef|@import#}
|
|
{#header_close#}
|
|
|
|
{#header_open|C Pointers#}
|
|
<p>
|
|
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.
|
|
</p>
|
|
<p>
|
|
When importing C header files, it is ambiguous whether pointers should be translated as
|
|
single-item pointers ({#syntax#}*T{#endsyntax#}) or unknown-length pointers ({#syntax#}[*]T{#endsyntax#}).
|
|
C pointers are a compromise so that Zig code can utilize translated header files directly.
|
|
</p>
|
|
<p>{#syntax#}[*c]T{#endsyntax#} - C pointer.</p>
|
|
<ul>
|
|
<li>Supports all the syntax of the other two pointer types.</li>
|
|
<li>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.
|
|
</li>
|
|
<li>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#}.
|
|
</li>
|
|
<li>Supports {#link|Type Coercion#} to and from integers.</li>
|
|
<li>Supports comparison with integers.</li>
|
|
<li>Does not support Zig-only pointer attributes such as alignment. Use normal {#link|Pointers#}
|
|
please!</li>
|
|
</ul>
|
|
<p>When a C pointer is pointing to a single struct (not an array), deference the C pointer to
|
|
access to the struct's fields or member data. That syntax looks like
|
|
this: </p>
|
|
<p>{#syntax#}ptr_to_struct.*.struct_member{#endsyntax#}</p>
|
|
<p>This is comparable to doing {#syntax#}->{#endsyntax#} in C.</p>
|
|
<p> When a C pointer is pointing to an array of structs, the syntax reverts to this:</p>
|
|
<p>{#syntax#}ptr_to_struct_array[index].struct_member{#endsyntax#}</p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Exporting a C Library#}
|
|
<p>
|
|
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:
|
|
</p>
|
|
<p class="file">mathtest.zig</p>
|
|
{#code_begin|syntax#}
|
|
export fn add(a: i32, b: i32) i32 {
|
|
return a + b;
|
|
}
|
|
{#code_end#}
|
|
<p>To make a static library:</p>
|
|
<pre><code class="shell">$ zig build-lib mathtest.zig
|
|
</code></pre>
|
|
<p>To make a shared library:</p>
|
|
<pre><code class="shell">$ zig build-lib mathtest.zig -dynamic
|
|
</code></pre>
|
|
<p>Here is an example with the {#link|Zig Build System#}:</p>
|
|
<p class="file">test.c</p>
|
|
<pre><code class="cpp">// This header is generated by zig from mathtest.zig
|
|
#include "mathtest.h"
|
|
#include <stdio.h>
|
|
|
|
int main(int argc, char **argv) {
|
|
int32_t result = add(42, 1337);
|
|
printf("%d\n", result);
|
|
return 0;
|
|
}</code></pre>
|
|
<p class="file">build.zig</p>
|
|
{#code_begin|syntax#}
|
|
const Builder = @import("std").build.Builder;
|
|
|
|
pub fn build(b: *Builder) void {
|
|
const lib = b.addSharedLibrary("mathtest", "mathtest.zig", b.version(1, 0, 0));
|
|
|
|
const exe = b.addExecutable("test", null);
|
|
exe.addCSourceFile("test.c", &[_][]const u8{"-std=c99"});
|
|
exe.linkLibrary(lib);
|
|
exe.linkSystemLibrary("c");
|
|
|
|
b.default_step.dependOn(&exe.step);
|
|
|
|
const run_cmd = exe.run();
|
|
|
|
const test_step = b.step("test", "Test the program");
|
|
test_step.dependOn(&run_cmd.step);
|
|
}
|
|
{#code_end#}
|
|
<p class="file">terminal</p>
|
|
<pre><code class="shell">$ zig build test
|
|
1379
|
|
</code></pre>
|
|
{#see_also|export#}
|
|
{#header_close#}
|
|
{#header_open|Mixing Object Files#}
|
|
<p>
|
|
You can mix Zig object files with any other object files that respect the C ABI. Example:
|
|
</p>
|
|
<p class="file">base64.zig</p>
|
|
{#code_begin|syntax#}
|
|
const base64 = @import("std").base64;
|
|
|
|
export fn decode_base_64(
|
|
dest_ptr: [*]u8,
|
|
dest_len: usize,
|
|
source_ptr: [*]const u8,
|
|
source_len: usize,
|
|
) usize {
|
|
const src = source_ptr[0..source_len];
|
|
const dest = dest_ptr[0..dest_len];
|
|
const base64_decoder = base64.standard_decoder_unsafe;
|
|
const decoded_size = base64_decoder.calcSize(src);
|
|
base64_decoder.decode(dest[0..decoded_size], src);
|
|
return decoded_size;
|
|
}
|
|
{#code_end#}
|
|
<p class="file">test.c</p>
|
|
<pre><code class="cpp">// This header is generated by zig from base64.zig
|
|
#include "base64.h"
|
|
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
|
|
int main(int argc, char **argv) {
|
|
const char *encoded = "YWxsIHlvdXIgYmFzZSBhcmUgYmVsb25nIHRvIHVz";
|
|
char buf[200];
|
|
|
|
size_t len = decode_base_64(buf, 200, encoded, strlen(encoded));
|
|
buf[len] = 0;
|
|
puts(buf);
|
|
|
|
return 0;
|
|
}</code></pre>
|
|
<p class="file">build.zig</p>
|
|
{#code_begin|syntax#}
|
|
const Builder = @import("std").build.Builder;
|
|
|
|
pub fn build(b: *Builder) void {
|
|
const obj = b.addObject("base64", "base64.zig");
|
|
|
|
const exe = b.addExecutable("test", null);
|
|
exe.addCSourceFile("test.c", &[_][]const u8{"-std=c99"});
|
|
exe.addObject(obj);
|
|
exe.linkSystemLibrary("c");
|
|
exe.install();
|
|
}
|
|
{#code_end#}
|
|
<p class="file">terminal</p>
|
|
<pre><code class="shell">$ zig build
|
|
$ ./zig-cache/bin/test
|
|
all your base are belong to us</code></pre>
|
|
{#see_also|Targets|Zig Build System#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|WebAssembly#}
|
|
<p>Zig supports building for WebAssembly out of the box.</p>
|
|
{#header_open|Freestanding#}
|
|
<p>For host environments like the web browser and nodejs, build as a library using the freestanding OS target.
|
|
Here's an example of running Zig code compiled to WebAssembly with nodejs.</p>
|
|
{#code_begin|lib|math#}
|
|
{#target_wasm#}
|
|
extern fn print(i32) void;
|
|
|
|
export fn add(a: i32, b: i32) void {
|
|
print(a + b);
|
|
}
|
|
{#code_end#}
|
|
{#header_close#}
|
|
<p class="file">test.js</p>
|
|
<pre><code>const fs = require('fs');
|
|
const source = fs.readFileSync("./math.wasm");
|
|
const typedArray = new Uint8Array(source);
|
|
|
|
WebAssembly.instantiate(typedArray, {
|
|
env: {
|
|
print: (result) => { console.log(`The result is ${result}`); }
|
|
}}).then(result => {
|
|
const add = result.instance.exports.add;
|
|
add(1, 2);
|
|
});</code></pre>
|
|
<pre><code>$ node test.js
|
|
The result is 3</code></pre>
|
|
{#header_open|WASI#}
|
|
<p>Zig's support for WebAssembly System Interface (WASI) is under active development.
|
|
Example of using the standard library and reading command line arguments:</p>
|
|
{#code_begin|exe|wasi#}
|
|
{#target_wasi#}
|
|
const std = @import("std");
|
|
|
|
pub fn main() !void {
|
|
// TODO a better default allocator that isn't as wasteful!
|
|
const args = try std.process.argsAlloc(std.heap.page_allocator);
|
|
defer std.process.argsFree(std.heap.page_allocator, args);
|
|
|
|
for (args) |arg, i| {
|
|
std.debug.warn("{}: {}\n", .{i, arg});
|
|
}
|
|
}
|
|
{#code_end#}
|
|
<pre><code>$ wasmer run wasi.wasm 123 hello
|
|
0: wasi.wasm
|
|
1: 123
|
|
2: hello</code></pre>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Targets#}
|
|
<p>
|
|
Zig supports generating code for all targets that LLVM supports. Here is
|
|
what it looks like to execute <code>zig targets</code> on a Linux x86_64
|
|
computer:
|
|
</p>
|
|
<pre><code class="shell">$ zig targets
|
|
Architectures:
|
|
arm
|
|
v8_4a
|
|
v8_3a
|
|
v8_2a
|
|
v8_1a
|
|
v8
|
|
v8r
|
|
v8m_baseline
|
|
v8m_mainline
|
|
v7
|
|
v7em
|
|
v7m
|
|
v7s
|
|
v7k
|
|
v7ve
|
|
v6
|
|
v6m
|
|
v6k
|
|
v6t2
|
|
v5
|
|
v5te
|
|
v4t
|
|
armeb
|
|
v8_4a
|
|
v8_3a
|
|
v8_2a
|
|
v8_1a
|
|
v8
|
|
v8r
|
|
v8m_baseline
|
|
v8m_mainline
|
|
v7
|
|
v7em
|
|
v7m
|
|
v7s
|
|
v7k
|
|
v7ve
|
|
v6
|
|
v6m
|
|
v6k
|
|
v6t2
|
|
v5
|
|
v5te
|
|
v4t
|
|
aarch64
|
|
v8_4a
|
|
v8_3a
|
|
v8_2a
|
|
v8_1a
|
|
v8
|
|
v8r
|
|
v8m_baseline
|
|
v8m_mainline
|
|
aarch64_be
|
|
v8_4a
|
|
v8_3a
|
|
v8_2a
|
|
v8_1a
|
|
v8
|
|
v8r
|
|
v8m_baseline
|
|
v8m_mainline
|
|
avr
|
|
bpfel
|
|
bpfeb
|
|
hexagon
|
|
mips
|
|
mipsel
|
|
mips64
|
|
mips64el
|
|
msp430
|
|
powerpc
|
|
powerpc64
|
|
powerpc64le
|
|
r600
|
|
amdgcn
|
|
riscv32
|
|
riscv64
|
|
sparc
|
|
sparcv9
|
|
sparcel
|
|
s390x
|
|
thumb
|
|
v8_4a
|
|
v8_3a
|
|
v8_2a
|
|
v8_1a
|
|
v8
|
|
v8r
|
|
v8m_baseline
|
|
v8m_mainline
|
|
v7
|
|
v7em
|
|
v7m
|
|
v7s
|
|
v7k
|
|
v7ve
|
|
v6
|
|
v6m
|
|
v6k
|
|
v6t2
|
|
v5
|
|
v5te
|
|
v4t
|
|
thumbeb
|
|
v8_4a
|
|
v8_3a
|
|
v8_2a
|
|
v8_1a
|
|
v8
|
|
v8r
|
|
v8m_baseline
|
|
v8m_mainline
|
|
v7
|
|
v7em
|
|
v7m
|
|
v7s
|
|
v7k
|
|
v7ve
|
|
v6
|
|
v6m
|
|
v6k
|
|
v6t2
|
|
v5
|
|
v5te
|
|
v4t
|
|
i386
|
|
x86_64 (native)
|
|
xcore
|
|
nvptx
|
|
nvptx64
|
|
lanai
|
|
wasm32
|
|
wasm64
|
|
|
|
Operating Systems:
|
|
freestanding
|
|
ananas
|
|
cloudabi
|
|
dragonfly
|
|
freebsd
|
|
fuchsia
|
|
ios
|
|
kfreebsd
|
|
linux (native)
|
|
lv2
|
|
macosx
|
|
netbsd
|
|
openbsd
|
|
solaris
|
|
windows
|
|
haiku
|
|
minix
|
|
rtems
|
|
nacl
|
|
cnk
|
|
aix
|
|
cuda
|
|
nvcl
|
|
amdhsa
|
|
ps4
|
|
elfiamcu
|
|
tvos
|
|
watchos
|
|
mesa3d
|
|
contiki
|
|
amdpal
|
|
zen
|
|
uefi
|
|
|
|
C ABIs:
|
|
none
|
|
gnu (native)
|
|
gnuabin32
|
|
gnuabi64
|
|
gnueabi
|
|
gnueabihf
|
|
gnux32
|
|
code16
|
|
eabi
|
|
eabihf
|
|
android
|
|
musl
|
|
musleabi
|
|
musleabihf
|
|
msvc
|
|
itanium
|
|
cygnus
|
|
coreclr
|
|
simulator
|
|
|
|
Available libcs:
|
|
aarch64_be-linux-gnu
|
|
aarch64_be-linux-musl
|
|
aarch64-linux-gnu
|
|
aarch64-linux-musleabi
|
|
armeb-linux-gnueabi
|
|
armeb-linux-gnueabihf
|
|
armeb-linux-musleabi
|
|
armeb-linux-musleabihf
|
|
arm-linux-gnueabi
|
|
arm-linux-gnueabihf
|
|
arm-linux-musleabi
|
|
arm-linux-musleabihf
|
|
i386-linux-gnu
|
|
i386-linux-musl
|
|
mips64el-linux-gnuabi64
|
|
mips64el-linux-gnuabin32
|
|
mips64el-linux-musl
|
|
mips64-linux-gnuabi64
|
|
mips64-linux-gnuabin32
|
|
mips64-linux-musl
|
|
mipsel-linux-gnu
|
|
mipsel-linux-musl
|
|
mips-linux-gnu
|
|
mips-linux-musl
|
|
nios2-linux-gnu
|
|
powerpc64le-linux-gnu
|
|
powerpc64le-linux-musl
|
|
powerpc64-linux-gnu
|
|
powerpc64-linux-musl
|
|
powerpc-linux-gnu
|
|
powerpc-linux-musl
|
|
riscv32-linux-musl
|
|
riscv64-linux-gnu
|
|
riscv64-linux-musl
|
|
s390x-linux-gnu
|
|
s390x-linux-musl
|
|
sparc-linux-gnu
|
|
sparcv9-linux-gnu
|
|
wasm32-freestanding-musl
|
|
x86_64-linux-gnu
|
|
x86_64-linux-gnux32
|
|
x86_64-linux-musl</code></pre>
|
|
<p>
|
|
The Zig Standard Library ({#syntax#}@import("std"){#endsyntax#}) has architecture, environment, and operating system
|
|
abstractions, and thus takes additional work to support more platforms.
|
|
Not all standard library code requires operating system abstractions, however,
|
|
so things such as generic data structures work on all above platforms.
|
|
</p>
|
|
<p>The current list of targets supported by the Zig Standard Library is:</p>
|
|
<ul>
|
|
<li>Linux x86_64</li>
|
|
<li>Windows x86_64</li>
|
|
<li>macOS x86_64</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|Style Guide#}
|
|
<p>
|
|
These coding conventions are not enforced by the compiler, but they are shipped in
|
|
this documentation along with the compiler in order to provide a point of
|
|
reference, should anyone wish to point to an authority on agreed upon Zig
|
|
coding style.
|
|
</p>
|
|
{#header_open|Whitespace#}
|
|
<ul>
|
|
<li>
|
|
4 space indentation
|
|
</li>
|
|
<li>
|
|
Open braces on same line, unless you need to wrap.
|
|
</li>
|
|
<li>If a list of things is longer than 2, put each item on its own line and
|
|
exercise the ability to put an extra comma at the end.
|
|
</li>
|
|
<li>
|
|
Line length: aim for 100; use common sense.
|
|
</li>
|
|
</ul>
|
|
{#header_close#}
|
|
{#header_open|Names#}
|
|
<p>
|
|
Roughly speaking: {#syntax#}camelCaseFunctionName{#endsyntax#}, {#syntax#}TitleCaseTypeName{#endsyntax#},
|
|
{#syntax#}snake_case_variable_name{#endsyntax#}. More precisely:
|
|
</p>
|
|
<ul>
|
|
<li>
|
|
If {#syntax#}x{#endsyntax#} is a {#syntax#}type{#endsyntax#}
|
|
then {#syntax#}x{#endsyntax#} should be {#syntax#}TitleCase{#endsyntax#}, unless it
|
|
is a {#syntax#}struct{#endsyntax#} with 0 fields and is never meant to be instantiated,
|
|
in which case it is considered to be a "namespace" and uses {#syntax#}snake_case{#endsyntax#}.
|
|
</li>
|
|
<li>
|
|
If {#syntax#}x{#endsyntax#} is callable, and {#syntax#}x{#endsyntax#}'s return type is
|
|
{#syntax#}type{#endsyntax#}, then {#syntax#}x{#endsyntax#} should be {#syntax#}TitleCase{#endsyntax#}.
|
|
</li>
|
|
<li>
|
|
If {#syntax#}x{#endsyntax#} is otherwise callable, then {#syntax#}x{#endsyntax#} should
|
|
be {#syntax#}camelCase{#endsyntax#}.
|
|
</li>
|
|
<li>
|
|
Otherwise, {#syntax#}x{#endsyntax#} should be {#syntax#}snake_case{#endsyntax#}.
|
|
</li>
|
|
</ul>
|
|
<p>
|
|
Acronyms, initialisms, proper nouns, or any other word that has capitalization
|
|
rules in written English are subject to naming conventions just like any other
|
|
word. Even acronyms that are only 2 letters long are subject to these
|
|
conventions.
|
|
</p>
|
|
<p>
|
|
File names fall into two categories: types and namespaces. If the file
|
|
(implicity a struct) has top level fields, it should be named like any
|
|
other struct with fields using {#syntax#}TitleCase{#endsyntax#}. Otherwise,
|
|
it should use {#syntax#}snake_case{#endsyntax#}. Directory names should be
|
|
{#syntax#}snake_case{#endsyntax#}.
|
|
</p>
|
|
<p>
|
|
These are general rules of thumb; if it makes sense to do something different,
|
|
do what makes sense. For example, if there is an established convention such as
|
|
{#syntax#}ENOENT{#endsyntax#}, follow the established convention.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_open|Examples#}
|
|
{#code_begin|syntax#}
|
|
const namespace_name = @import("dir_name/file_name.zig");
|
|
const TypeName = @import("dir_name/TypeName.zig");
|
|
var global_var: i32 = undefined;
|
|
const const_name = 42;
|
|
const primitive_type_alias = f32;
|
|
const string_alias = []u8;
|
|
|
|
const StructName = struct {
|
|
field: i32,
|
|
};
|
|
const StructAlias = StructName;
|
|
|
|
fn functionName(param_name: TypeName) void {
|
|
var functionPointer = functionName;
|
|
functionPointer();
|
|
functionPointer = otherFunction;
|
|
functionPointer();
|
|
}
|
|
const functionAlias = functionName;
|
|
|
|
fn ListTemplateFunction(comptime ChildType: type, comptime fixed_size: usize) type {
|
|
return List(ChildType, fixed_size);
|
|
}
|
|
|
|
fn ShortList(comptime T: type, comptime n: usize) type {
|
|
return struct {
|
|
field_name: [n]T,
|
|
fn methodName() void {}
|
|
};
|
|
}
|
|
|
|
// The word XML loses its casing when used in Zig identifiers.
|
|
const xml_document =
|
|
\\<?xml version="1.0" encoding="UTF-8"?>
|
|
\\<document>
|
|
\\</document>
|
|
;
|
|
const XmlParser = struct {
|
|
field: i32,
|
|
};
|
|
|
|
// The initials BE (Big Endian) are just another word in Zig identifier names.
|
|
fn readU32Be() u32 {}
|
|
{#code_end#}
|
|
<p>
|
|
See the Zig Standard Library for more examples.
|
|
</p>
|
|
{#header_close#}
|
|
{#header_close#}
|
|
{#header_open|Source Encoding#}
|
|
<p>Zig source code is encoded in UTF-8. An invalid UTF-8 byte sequence results in a compile error.</p>
|
|
<p>Throughout all zig source code (including in comments), some codepoints are never allowed:</p>
|
|
<ul>
|
|
<li>Ascii control characters, except for U+000a (LF): U+0000 - U+0009, U+000b - U+0001f, U+007f. (Note that Windows line endings (CRLF) are not allowed, and hard tabs are not allowed.)</li>
|
|
<li>Non-Ascii Unicode line endings: U+0085 (NEL), U+2028 (LS), U+2029 (PS).</li>
|
|
</ul>
|
|
<p>The codepoint U+000a (LF) (which is encoded as the single-byte value 0x0a) is the line terminator character. This character always terminates a line of zig source code (except possibly the last line of the file).</p>
|
|
<p>For some discussion on the rationale behind these design decisions, see <a href="https://github.com/ziglang/zig/issues/663">issue #663</a></p>
|
|
{#header_close#}
|
|
|
|
{#header_open|Keyword Reference#}
|
|
<p>
|
|
TODO the rest of the keywords. Most of these can just be links to the relevant section.
|
|
</p>
|
|
{#header_open|Keyword: pub#}
|
|
<p>The {#syntax#}pub{#endsyntax#} in front of a top level declaration makes the
|
|
declaration available to reference from a different file than the one it is declared in.</p>
|
|
{#see_also|@import#}
|
|
{#header_close#}
|
|
{#header_close#}
|
|
|
|
{#header_open|Grammar#}
|
|
<pre><code>Root <- skip ContainerMembers eof
|
|
|
|
# *** Top level ***
|
|
ContainerMembers
|
|
<- TestDecl ContainerMembers
|
|
/ TopLevelComptime ContainerMembers
|
|
/ KEYWORD_pub? TopLevelDecl ContainerMembers
|
|
/ ContainerField COMMA ContainerMembers
|
|
/ ContainerField
|
|
/
|
|
|
|
TestDecl <- KEYWORD_test STRINGLITERALSINGLE Block
|
|
|
|
TopLevelComptime <- KEYWORD_comptime BlockExpr
|
|
|
|
TopLevelDecl
|
|
<- (KEYWORD_export / KEYWORD_extern STRINGLITERALSINGLE? / KEYWORD_inline)? FnProto (SEMICOLON / Block)
|
|
/ (KEYWORD_export / KEYWORD_extern STRINGLITERALSINGLE?)? KEYWORD_threadlocal? VarDecl
|
|
/ KEYWORD_usingnamespace Expr SEMICOLON
|
|
|
|
FnProto <- KEYWORD_fn IDENTIFIER? LPAREN ParamDeclList RPAREN ByteAlign? LinkSection? EXCLAMATIONMARK? (KEYWORD_var / TypeExpr)
|
|
|
|
VarDecl <- (KEYWORD_const / KEYWORD_var) IDENTIFIER (COLON TypeExpr)? ByteAlign? LinkSection? (EQUAL Expr)? SEMICOLON
|
|
|
|
ContainerField <- KEYWORD_comptime? IDENTIFIER (COLON TypeExpr)? (EQUAL Expr)?
|
|
|
|
# *** Block Level ***
|
|
Statement
|
|
<- KEYWORD_comptime? VarDecl
|
|
/ KEYWORD_comptime BlockExprStatement
|
|
/ KEYWORD_nosuspend BlockExprStatement
|
|
/ KEYWORD_suspend (SEMICOLON / BlockExprStatement)
|
|
/ KEYWORD_defer BlockExprStatement
|
|
/ KEYWORD_errdefer BlockExprStatement
|
|
/ IfStatement
|
|
/ LabeledStatement
|
|
/ SwitchExpr
|
|
/ AssignExpr SEMICOLON
|
|
|
|
IfStatement
|
|
<- IfPrefix BlockExpr ( KEYWORD_else Payload? Statement )?
|
|
/ IfPrefix AssignExpr ( SEMICOLON / KEYWORD_else Payload? Statement )
|
|
|
|
LabeledStatement <- BlockLabel? (Block / LoopStatement)
|
|
|
|
LoopStatement <- KEYWORD_inline? (ForStatement / WhileStatement)
|
|
|
|
ForStatement
|
|
<- ForPrefix BlockExpr ( KEYWORD_else Statement )?
|
|
/ ForPrefix AssignExpr ( SEMICOLON / KEYWORD_else Statement )
|
|
|
|
WhileStatement
|
|
<- WhilePrefix BlockExpr ( KEYWORD_else Payload? Statement )?
|
|
/ WhilePrefix AssignExpr ( SEMICOLON / KEYWORD_else Payload? Statement )
|
|
|
|
BlockExprStatement
|
|
<- BlockExpr
|
|
/ AssignExpr SEMICOLON
|
|
|
|
BlockExpr <- BlockLabel? Block
|
|
|
|
# *** Expression Level ***
|
|
AssignExpr <- Expr (AssignOp Expr)?
|
|
|
|
Expr <- KEYWORD_try* BoolOrExpr
|
|
|
|
BoolOrExpr <- BoolAndExpr (KEYWORD_or BoolAndExpr)*
|
|
|
|
BoolAndExpr <- CompareExpr (KEYWORD_and CompareExpr)*
|
|
|
|
CompareExpr <- BitwiseExpr (CompareOp BitwiseExpr)?
|
|
|
|
BitwiseExpr <- BitShiftExpr (BitwiseOp BitShiftExpr)*
|
|
|
|
BitShiftExpr <- AdditionExpr (BitShiftOp AdditionExpr)*
|
|
|
|
AdditionExpr <- MultiplyExpr (AdditionOp MultiplyExpr)*
|
|
|
|
MultiplyExpr <- PrefixExpr (MultiplyOp PrefixExpr)*
|
|
|
|
PrefixExpr <- PrefixOp* PrimaryExpr
|
|
|
|
PrimaryExpr
|
|
<- AsmExpr
|
|
/ IfExpr
|
|
/ KEYWORD_break BreakLabel? Expr?
|
|
/ KEYWORD_comptime Expr
|
|
/ KEYWORD_nosuspend Expr
|
|
/ KEYWORD_continue BreakLabel?
|
|
/ KEYWORD_resume Expr
|
|
/ KEYWORD_return Expr?
|
|
/ BlockLabel? LoopExpr
|
|
/ Block
|
|
/ CurlySuffixExpr
|
|
|
|
IfExpr <- IfPrefix Expr (KEYWORD_else Payload? Expr)?
|
|
|
|
Block <- LBRACE Statement* RBRACE
|
|
|
|
LoopExpr <- KEYWORD_inline? (ForExpr / WhileExpr)
|
|
|
|
ForExpr <- ForPrefix Expr (KEYWORD_else Expr)?
|
|
|
|
WhileExpr <- WhilePrefix Expr (KEYWORD_else Payload? Expr)?
|
|
|
|
CurlySuffixExpr <- TypeExpr InitList?
|
|
|
|
InitList
|
|
<- LBRACE FieldInit (COMMA FieldInit)* COMMA? RBRACE
|
|
/ LBRACE Expr (COMMA Expr)* COMMA? RBRACE
|
|
/ LBRACE RBRACE
|
|
|
|
TypeExpr <- PrefixTypeOp* ErrorUnionExpr
|
|
|
|
ErrorUnionExpr <- SuffixExpr (EXCLAMATIONMARK TypeExpr)?
|
|
|
|
SuffixExpr
|
|
<- KEYWORD_async PrimaryTypeExpr SuffixOp* FnCallArguments
|
|
/ PrimaryTypeExpr (SuffixOp / FnCallArguments)*
|
|
|
|
PrimaryTypeExpr
|
|
<- BUILTINIDENTIFIER FnCallArguments
|
|
/ CHAR_LITERAL
|
|
/ ContainerDecl
|
|
/ DOT IDENTIFIER
|
|
/ DOT InitList
|
|
/ ErrorSetDecl
|
|
/ FLOAT
|
|
/ FnProto
|
|
/ GroupedExpr
|
|
/ LabeledTypeExpr
|
|
/ IDENTIFIER
|
|
/ IfTypeExpr
|
|
/ INTEGER
|
|
/ KEYWORD_comptime TypeExpr
|
|
/ KEYWORD_error DOT IDENTIFIER
|
|
/ KEYWORD_false
|
|
/ KEYWORD_null
|
|
/ KEYWORD_anyframe
|
|
/ KEYWORD_true
|
|
/ KEYWORD_undefined
|
|
/ KEYWORD_unreachable
|
|
/ STRINGLITERAL
|
|
/ SwitchExpr
|
|
|
|
ContainerDecl <- (KEYWORD_extern / KEYWORD_packed)? ContainerDeclAuto
|
|
|
|
ErrorSetDecl <- KEYWORD_error LBRACE IdentifierList RBRACE
|
|
|
|
GroupedExpr <- LPAREN Expr RPAREN
|
|
|
|
IfTypeExpr <- IfPrefix TypeExpr (KEYWORD_else Payload? TypeExpr)?
|
|
|
|
LabeledTypeExpr
|
|
<- BlockLabel Block
|
|
/ BlockLabel? LoopTypeExpr
|
|
|
|
LoopTypeExpr <- KEYWORD_inline? (ForTypeExpr / WhileTypeExpr)
|
|
|
|
ForTypeExpr <- ForPrefix TypeExpr (KEYWORD_else TypeExpr)?
|
|
|
|
WhileTypeExpr <- WhilePrefix TypeExpr (KEYWORD_else Payload? TypeExpr)?
|
|
|
|
SwitchExpr <- KEYWORD_switch LPAREN Expr RPAREN LBRACE SwitchProngList RBRACE
|
|
|
|
# *** Assembly ***
|
|
AsmExpr <- KEYWORD_asm KEYWORD_volatile? LPAREN STRINGLITERAL AsmOutput? RPAREN
|
|
|
|
AsmOutput <- COLON AsmOutputList AsmInput?
|
|
|
|
AsmOutputItem <- LBRACKET IDENTIFIER RBRACKET STRINGLITERAL LPAREN (MINUSRARROW TypeExpr / IDENTIFIER) RPAREN
|
|
|
|
AsmInput <- COLON AsmInputList AsmClobbers?
|
|
|
|
AsmInputItem <- LBRACKET IDENTIFIER RBRACKET STRINGLITERAL LPAREN Expr RPAREN
|
|
|
|
AsmClobbers <- COLON StringList
|
|
|
|
# *** Helper grammar ***
|
|
BreakLabel <- COLON IDENTIFIER
|
|
|
|
BlockLabel <- IDENTIFIER COLON
|
|
|
|
FieldInit <- DOT IDENTIFIER EQUAL Expr
|
|
|
|
WhileContinueExpr <- COLON LPAREN AssignExpr RPAREN
|
|
|
|
LinkSection <- KEYWORD_linksection LPAREN Expr RPAREN
|
|
|
|
ParamDecl <- (KEYWORD_noalias / KEYWORD_comptime)? (IDENTIFIER COLON)? ParamType
|
|
|
|
ParamType
|
|
<- KEYWORD_var
|
|
/ DOT3
|
|
/ TypeExpr
|
|
|
|
# Control flow prefixes
|
|
IfPrefix <- KEYWORD_if LPAREN Expr RPAREN PtrPayload?
|
|
|
|
WhilePrefix <- KEYWORD_while LPAREN Expr RPAREN PtrPayload? WhileContinueExpr?
|
|
|
|
ForPrefix <- KEYWORD_for LPAREN Expr RPAREN PtrIndexPayload
|
|
|
|
# Payloads
|
|
Payload <- PIPE IDENTIFIER PIPE
|
|
|
|
PtrPayload <- PIPE ASTERISK? IDENTIFIER PIPE
|
|
|
|
PtrIndexPayload <- PIPE ASTERISK? IDENTIFIER (COMMA IDENTIFIER)? PIPE
|
|
|
|
|
|
# Switch specific
|
|
SwitchProng <- SwitchCase EQUALRARROW PtrPayload? AssignExpr
|
|
|
|
SwitchCase
|
|
<- SwitchItem (COMMA SwitchItem)* COMMA?
|
|
/ KEYWORD_else
|
|
|
|
SwitchItem <- Expr (DOT3 Expr)?
|
|
|
|
# Operators
|
|
AssignOp
|
|
<- ASTERISKEQUAL
|
|
/ SLASHEQUAL
|
|
/ PERCENTEQUAL
|
|
/ PLUSEQUAL
|
|
/ MINUSEQUAL
|
|
/ LARROW2EQUAL
|
|
/ RARROW2EQUAL
|
|
/ AMPERSANDEQUAL
|
|
/ CARETEQUAL
|
|
/ PIPEEQUAL
|
|
/ ASTERISKPERCENTEQUAL
|
|
/ PLUSPERCENTEQUAL
|
|
/ MINUSPERCENTEQUAL
|
|
/ EQUAL
|
|
|
|
CompareOp
|
|
<- EQUALEQUAL
|
|
/ EXCLAMATIONMARKEQUAL
|
|
/ LARROW
|
|
/ RARROW
|
|
/ LARROWEQUAL
|
|
/ RARROWEQUAL
|
|
|
|
BitwiseOp
|
|
<- AMPERSAND
|
|
/ CARET
|
|
/ PIPE
|
|
/ KEYWORD_orelse
|
|
/ KEYWORD_catch Payload?
|
|
|
|
BitShiftOp
|
|
<- LARROW2
|
|
/ RARROW2
|
|
|
|
AdditionOp
|
|
<- PLUS
|
|
/ MINUS
|
|
/ PLUS2
|
|
/ PLUSPERCENT
|
|
/ MINUSPERCENT
|
|
|
|
MultiplyOp
|
|
<- PIPE2
|
|
/ ASTERISK
|
|
/ SLASH
|
|
/ PERCENT
|
|
/ ASTERISK2
|
|
/ ASTERISKPERCENT
|
|
|
|
PrefixOp
|
|
<- EXCLAMATIONMARK
|
|
/ MINUS
|
|
/ TILDE
|
|
/ MINUSPERCENT
|
|
/ AMPERSAND
|
|
/ KEYWORD_try
|
|
/ KEYWORD_await
|
|
|
|
PrefixTypeOp
|
|
<- QUESTIONMARK
|
|
/ KEYWORD_anyframe MINUSRARROW
|
|
/ ArrayTypeStart (ByteAlign / KEYWORD_const / KEYWORD_volatile / KEYWORD_allowzero)*
|
|
/ PtrTypeStart (KEYWORD_align LPAREN Expr (COLON INTEGER COLON INTEGER)? RPAREN / KEYWORD_const / KEYWORD_volatile / KEYWORD_allowzero)*
|
|
|
|
SuffixOp
|
|
<- LBRACKET Expr (DOT2 Expr?)? RBRACKET
|
|
/ DOT IDENTIFIER
|
|
/ DOTASTERISK
|
|
/ DOTQUESTIONMARK
|
|
|
|
FnCallArguments <- LPAREN ExprList RPAREN
|
|
|
|
# Ptr specific
|
|
ArrayTypeStart <- LBRACKET Expr? RBRACKET
|
|
|
|
PtrTypeStart
|
|
<- ASTERISK
|
|
/ ASTERISK2
|
|
/ PTRUNKNOWN
|
|
/ PTRC
|
|
|
|
# ContainerDecl specific
|
|
ContainerDeclAuto <- ContainerDeclType LBRACE ContainerMembers RBRACE
|
|
|
|
ContainerDeclType
|
|
<- (KEYWORD_struct / KEYWORD_enum) (LPAREN Expr RPAREN)?
|
|
/ KEYWORD_union (LPAREN (KEYWORD_enum (LPAREN Expr RPAREN)? / Expr) RPAREN)?
|
|
|
|
# Alignment
|
|
ByteAlign <- KEYWORD_align LPAREN Expr RPAREN
|
|
|
|
# Lists
|
|
IdentifierList <- (IDENTIFIER COMMA)* IDENTIFIER?
|
|
|
|
SwitchProngList <- (SwitchProng COMMA)* SwitchProng?
|
|
|
|
AsmOutputList <- (AsmOutputItem COMMA)* AsmOutputItem?
|
|
|
|
AsmInputList <- (AsmInputItem COMMA)* AsmInputItem?
|
|
|
|
StringList <- (STRINGLITERAL COMMA)* STRINGLITERAL?
|
|
|
|
ParamDeclList <- (ParamDecl COMMA)* ParamDecl?
|
|
|
|
ExprList <- (Expr COMMA)* Expr?
|
|
|
|
# *** Tokens ***
|
|
eof <- !.
|
|
hex <- [0-9a-fA-F]
|
|
char_escape
|
|
<- "\\x" hex hex
|
|
/ "\\u{" hex+ "}"
|
|
/ "\\" [nr\\t'"]
|
|
char_char
|
|
<- char_escape
|
|
/ [^\\'\n]
|
|
string_char
|
|
<- char_escape
|
|
/ [^\\"\n]
|
|
|
|
line_comment <- '//'[^\n]*
|
|
line_string <- ("\\\\" [^\n]* [ \n]*)+
|
|
skip <- ([ \n] / line_comment)*
|
|
|
|
CHAR_LITERAL <- "'" char_char "'" skip
|
|
FLOAT
|
|
<- "0x" hex+ "." hex+ ([pP] [-+]? hex+)? skip
|
|
/ [0-9]+ "." [0-9]+ ([eE] [-+]? [0-9]+)? skip
|
|
/ "0x" hex+ "."? [pP] [-+]? hex+ skip
|
|
/ [0-9]+ "."? [eE] [-+]? [0-9]+ skip
|
|
INTEGER
|
|
<- "0b" [01]+ skip
|
|
/ "0o" [0-7]+ skip
|
|
/ "0x" hex+ skip
|
|
/ [0-9]+ skip
|
|
STRINGLITERALSINGLE <- "\"" string_char* "\"" skip
|
|
STRINGLITERAL
|
|
<- STRINGLITERALSINGLE
|
|
/ line_string skip
|
|
IDENTIFIER
|
|
<- !keyword [A-Za-z_] [A-Za-z0-9_]* skip
|
|
/ "@\"" string_char* "\"" skip
|
|
BUILTINIDENTIFIER <- "@"[A-Za-z_][A-Za-z0-9_]* skip
|
|
|
|
|
|
AMPERSAND <- '&' ![=] skip
|
|
AMPERSANDEQUAL <- '&=' skip
|
|
ASTERISK <- '*' ![*%=] skip
|
|
ASTERISK2 <- '**' skip
|
|
ASTERISKEQUAL <- '*=' skip
|
|
ASTERISKPERCENT <- '*%' ![=] skip
|
|
ASTERISKPERCENTEQUAL <- '*%=' skip
|
|
CARET <- '^' ![=] skip
|
|
CARETEQUAL <- '^=' skip
|
|
COLON <- ':' skip
|
|
COMMA <- ',' skip
|
|
DOT <- '.' ![*.?] skip
|
|
DOT2 <- '..' ![.] skip
|
|
DOT3 <- '...' skip
|
|
DOTASTERISK <- '.*' skip
|
|
DOTQUESTIONMARK <- '.?' skip
|
|
EQUAL <- '=' ![>=] skip
|
|
EQUALEQUAL <- '==' skip
|
|
EQUALRARROW <- '=>' skip
|
|
EXCLAMATIONMARK <- '!' ![=] skip
|
|
EXCLAMATIONMARKEQUAL <- '!=' skip
|
|
LARROW <- '<' ![<=] skip
|
|
LARROW2 <- '<<' ![=] skip
|
|
LARROW2EQUAL <- '<<=' skip
|
|
LARROWEQUAL <- '<=' skip
|
|
LBRACE <- '{' skip
|
|
LBRACKET <- '[' ![*] skip
|
|
LPAREN <- '(' skip
|
|
MINUS <- '-' ![%=>] skip
|
|
MINUSEQUAL <- '-=' skip
|
|
MINUSPERCENT <- '-%' ![=] skip
|
|
MINUSPERCENTEQUAL <- '-%=' skip
|
|
MINUSRARROW <- '->' skip
|
|
PERCENT <- '%' ![=] skip
|
|
PERCENTEQUAL <- '%=' skip
|
|
PIPE <- '|' ![|=] skip
|
|
PIPE2 <- '||' skip
|
|
PIPEEQUAL <- '|=' skip
|
|
PLUS <- '+' ![%+=] skip
|
|
PLUS2 <- '++' skip
|
|
PLUSEQUAL <- '+=' skip
|
|
PLUSPERCENT <- '+%' ![=] skip
|
|
PLUSPERCENTEQUAL <- '+%=' skip
|
|
PTRC <- '[*c]' skip
|
|
PTRUNKNOWN <- '[*]' skip
|
|
QUESTIONMARK <- '?' skip
|
|
RARROW <- '>' ![>=] skip
|
|
RARROW2 <- '>>' ![=] skip
|
|
RARROW2EQUAL <- '>>=' skip
|
|
RARROWEQUAL <- '>=' skip
|
|
RBRACE <- '}' skip
|
|
RBRACKET <- ']' skip
|
|
RPAREN <- ')' skip
|
|
SEMICOLON <- ';' skip
|
|
SLASH <- '/' ![=] skip
|
|
SLASHEQUAL <- '/=' skip
|
|
TILDE <- '~' skip
|
|
|
|
end_of_word <- ![a-zA-Z0-9_] skip
|
|
KEYWORD_align <- 'align' end_of_word
|
|
KEYWORD_allowzero <- 'allowzero' end_of_word
|
|
KEYWORD_and <- 'and' end_of_word
|
|
KEYWORD_anyframe <- 'anyframe' end_of_word
|
|
KEYWORD_asm <- 'asm' end_of_word
|
|
KEYWORD_async <- 'async' end_of_word
|
|
KEYWORD_await <- 'await' end_of_word
|
|
KEYWORD_break <- 'break' end_of_word
|
|
KEYWORD_catch <- 'catch' end_of_word
|
|
KEYWORD_comptime <- 'comptime' end_of_word
|
|
KEYWORD_const <- 'const' end_of_word
|
|
KEYWORD_continue <- 'continue' end_of_word
|
|
KEYWORD_defer <- 'defer' end_of_word
|
|
KEYWORD_else <- 'else' end_of_word
|
|
KEYWORD_enum <- 'enum' end_of_word
|
|
KEYWORD_errdefer <- 'errdefer' end_of_word
|
|
KEYWORD_error <- 'error' end_of_word
|
|
KEYWORD_export <- 'export' end_of_word
|
|
KEYWORD_extern <- 'extern' end_of_word
|
|
KEYWORD_false <- 'false' end_of_word
|
|
KEYWORD_fn <- 'fn' end_of_word
|
|
KEYWORD_for <- 'for' end_of_word
|
|
KEYWORD_if <- 'if' end_of_word
|
|
KEYWORD_inline <- 'inline' end_of_word
|
|
KEYWORD_noalias <- 'noalias' end_of_word
|
|
KEYWORD_nosuspend <- 'nosuspend' end_of_word
|
|
KEYWORD_null <- 'null' end_of_word
|
|
KEYWORD_or <- 'or' end_of_word
|
|
KEYWORD_orelse <- 'orelse' end_of_word
|
|
KEYWORD_packed <- 'packed' end_of_word
|
|
KEYWORD_pub <- 'pub' end_of_word
|
|
KEYWORD_resume <- 'resume' end_of_word
|
|
KEYWORD_return <- 'return' end_of_word
|
|
KEYWORD_linksection <- 'linksection' end_of_word
|
|
KEYWORD_struct <- 'struct' end_of_word
|
|
KEYWORD_suspend <- 'suspend' end_of_word
|
|
KEYWORD_switch <- 'switch' end_of_word
|
|
KEYWORD_test <- 'test' end_of_word
|
|
KEYWORD_threadlocal <- 'threadlocal' end_of_word
|
|
KEYWORD_true <- 'true' end_of_word
|
|
KEYWORD_try <- 'try' end_of_word
|
|
KEYWORD_undefined <- 'undefined' end_of_word
|
|
KEYWORD_union <- 'union' end_of_word
|
|
KEYWORD_unreachable <- 'unreachable' end_of_word
|
|
KEYWORD_usingnamespace <- 'usingnamespace' end_of_word
|
|
KEYWORD_var <- 'var' end_of_word
|
|
KEYWORD_volatile <- 'volatile' end_of_word
|
|
KEYWORD_while <- 'while' end_of_word
|
|
|
|
keyword <- KEYWORD_align / KEYWORD_and / KEYWORD_allowzero / KEYWORD_asm
|
|
/ KEYWORD_async / KEYWORD_await / KEYWORD_break
|
|
/ KEYWORD_catch / KEYWORD_comptime / KEYWORD_const / KEYWORD_continue
|
|
/ KEYWORD_defer / KEYWORD_else / KEYWORD_enum / KEYWORD_errdefer
|
|
/ KEYWORD_error / KEYWORD_export / KEYWORD_extern / KEYWORD_false
|
|
/ KEYWORD_fn / KEYWORD_for / KEYWORD_if / KEYWORD_inline
|
|
/ KEYWORD_noalias / KEYWORD_null / KEYWORD_or
|
|
/ KEYWORD_orelse / KEYWORD_packed / KEYWORD_anyframe / KEYWORD_pub
|
|
/ KEYWORD_resume / KEYWORD_return / KEYWORD_linksection
|
|
/ KEYWORD_struct / KEYWORD_suspend
|
|
/ KEYWORD_switch / KEYWORD_test / KEYWORD_threadlocal / KEYWORD_true / KEYWORD_try
|
|
/ KEYWORD_undefined / KEYWORD_union / KEYWORD_unreachable
|
|
/ KEYWORD_usingnamespace / KEYWORD_var / KEYWORD_volatile / KEYWORD_while</code></pre>
|
|
{#header_close#}
|
|
{#header_open|Zen#}
|
|
<ul>
|
|
<li>Communicate intent precisely.</li>
|
|
<li>Edge cases matter.</li>
|
|
<li>Favor reading code over writing code.</li>
|
|
<li>Only one obvious way to do things.</li>
|
|
<li>Runtime crashes are better than bugs.</li>
|
|
<li>Compile errors are better than runtime crashes.</li>
|
|
<li>Incremental improvements.</li>
|
|
<li>Avoid local maximums.</li>
|
|
<li>Reduce the amount one must remember.</li>
|
|
<li>Minimize energy spent on coding style.</li>
|
|
<li>Resource deallocation must succeed.</li>
|
|
<li>Together we serve end users.</li>
|
|
</ul>
|
|
{#header_close#}
|
|
</div></div>
|
|
</div>
|
|
</body>
|
|
</html>
|