1f194280342e4624225f794c17be6b65753904de
[yosys.git] / backends / cxxrtl / cxxrtl_capi.h
1 /*
2 * yosys -- Yosys Open SYnthesis Suite
3 *
4 * Copyright (C) 2020 whitequark <whitequark@whitequark.org>
5 *
6 * Permission to use, copy, modify, and/or distribute this software for any
7 * purpose with or without fee is hereby granted.
8 *
9 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16 *
17 */
18
19 #ifndef CXXRTL_CAPI_H
20 #define CXXRTL_CAPI_H
21
22 // This file is a part of the CXXRTL C API. It should be used together with `cxxrtl_capi.cc`.
23 //
24 // The CXXRTL C API makes it possible to drive CXXRTL designs using C or any other language that
25 // supports the C ABI, for example, Python. It does not provide a way to implement black boxes.
26
27 #include <stddef.h>
28 #include <stdint.h>
29 #include <assert.h>
30
31 #ifdef __cplusplus
32 extern "C" {
33 #endif
34
35 // Opaque reference to a design toplevel.
36 //
37 // A design toplevel can only be used to create a design handle.
38 typedef struct _cxxrtl_toplevel *cxxrtl_toplevel;
39
40 // The constructor for a design toplevel is provided as a part of generated code for that design.
41 // Its prototype matches:
42 //
43 // cxxrtl_toplevel <design-name>_create();
44
45 // Opaque reference to a design handle.
46 //
47 // A design handle is required by all operations in the C API.
48 typedef struct _cxxrtl_handle *cxxrtl_handle;
49
50 // Create a design handle from a design toplevel.
51 //
52 // The `design` is consumed by this operation and cannot be used afterwards.
53 cxxrtl_handle cxxrtl_create(cxxrtl_toplevel design);
54
55 // Release all resources used by a design and its handle.
56 void cxxrtl_destroy(cxxrtl_handle handle);
57
58 // Evaluate the design, propagating changes on inputs to the `next` value of internal state and
59 // output wires.
60 //
61 // Returns 1 if the design is known to immediately converge, 0 otherwise.
62 int cxxrtl_eval(cxxrtl_handle handle);
63
64 // Commit the design, replacing the `curr` value of internal state and output wires with the `next`
65 // value.
66 //
67 // Return 1 if any of the `curr` values were updated, 0 otherwise.
68 int cxxrtl_commit(cxxrtl_handle handle);
69
70 // Simulate the design to a fixed point.
71 //
72 // Returns the number of delta cycles.
73 size_t cxxrtl_step(cxxrtl_handle handle);
74
75 // Type of a simulated object.
76 enum cxxrtl_type {
77 // Values correspond to singly buffered netlist nodes, i.e. nodes driven exclusively by
78 // combinatorial cells, or toplevel input nodes.
79 //
80 // Values can be inspected via the `curr` pointer. If the `next` pointer is NULL, the value is
81 // driven by a constant and can never be modified. Otherwise, the value can be modified through
82 // the `next` pointer (which is equal to `curr` if not NULL). Note that changes to the bits
83 // driven by combinatorial cells will be ignored.
84 //
85 // Values always have depth 1.
86 CXXRTL_VALUE = 0,
87
88 // Wires correspond to doubly buffered netlist nodes, i.e. nodes driven, at least in part, by
89 // storage cells, or by combinatorial cells that are a part of a feedback path.
90 //
91 // Wires can be inspected via the `curr` pointer and modified via the `next` pointer (which are
92 // distinct for wires). Note that changes to the bits driven by combinatorial cells will be
93 // ignored.
94 //
95 // Wires always have depth 1.
96 CXXRTL_WIRE = 1,
97
98 // Memories correspond to memory cells.
99 //
100 // Memories can be inspected and modified via the `curr` pointer. Due to a limitation of this
101 // API, memories cannot yet be modified in a guaranteed race-free way, and the `next` pointer is
102 // always NULL.
103 CXXRTL_MEMORY = 2,
104
105 // Aliases correspond to netlist nodes driven by another node such that their value is always
106 // exactly equal, or driven by a constant value.
107 //
108 // Aliases can be inspected via the `curr` pointer. They cannot be modified, and the `next`
109 // pointer is always NULL.
110 CXXRTL_ALIAS = 3,
111
112 // More object types may be added in the future, but the existing ones will never change.
113 };
114
115 // Description of a simulated object.
116 //
117 // The `data` array can be accessed directly to inspect and, if applicable, modify the bits
118 // stored in the object.
119 struct cxxrtl_object {
120 // Type of the object.
121 //
122 // All objects have the same memory layout determined by `width` and `depth`, but the type
123 // determines all other properties of the object.
124 uint32_t type; // actually `enum cxxrtl_type`
125
126 // Width of the object in bits.
127 size_t width;
128
129 // Index of the least significant bit.
130 size_t lsb_at;
131
132 // Depth of the object. Only meaningful for memories; for other objects, always 1.
133 size_t depth;
134
135 // Index of the first word. Only meaningful for memories; for other objects, always 0;
136 size_t zero_at;
137
138 // Bits stored in the object, as 32-bit chunks, least significant bits first.
139 //
140 // The width is rounded up to a multiple of 32; the padding bits are always set to 0 by
141 // the simulation code, and must be always written as 0 when modified by user code.
142 // In memories, every element is stored contiguously. Therefore, the total number of chunks
143 // in any object is `((width + 31) / 32) * depth`.
144 //
145 // To allow the simulation to be partitioned into multiple independent units communicating
146 // through wires, the bits are double buffered. To avoid race conditions, user code should
147 // always read from `curr` and write to `next`. The `curr` pointer is always valid; for objects
148 // that cannot be modified, or cannot be modified in a race-free way, `next` is NULL.
149 uint32_t *curr;
150 uint32_t *next;
151
152 // More description fields may be added in the future, but the existing ones will never change.
153 };
154
155 // Retrieve description of a simulated object.
156 //
157 // The `name` is the full hierarchical name of the object in the Yosys notation, where public names
158 // have a `\` prefix and hierarchy levels are separated by single spaces. For example, if
159 // the top-level module instantiates a module `foo`, which in turn contains a wire `bar`, the full
160 // hierarchical name is `\foo \bar`.
161 //
162 // The storage of a single abstract object may be split (usually with the `splitnets` pass) into
163 // many physical parts, all of which correspond to the same hierarchical name. To handle such cases,
164 // this function returns an array and writes its length to `parts`. The array is sorted by `lsb_at`.
165 //
166 // Returns the object parts if it was found, NULL otherwise. The returned parts are valid until
167 // the design is destroyed.
168 struct cxxrtl_object *cxxrtl_get_parts(cxxrtl_handle handle, const char *name, size_t *parts);
169
170 // Retrieve description of a single part simulated object.
171 //
172 // This function is a shortcut for the most common use of `cxxrtl_get_parts`. It asserts that,
173 // if the object exists, it consists of a single part. If assertions are disabled, it returns NULL
174 // for multi-part objects.
175 inline struct cxxrtl_object *cxxrtl_get(cxxrtl_handle handle, const char *name) {
176 size_t parts = 0;
177 struct cxxrtl_object *object = cxxrtl_get_parts(handle, name, &parts);
178 assert(object == NULL || parts == 1);
179 if (object == NULL || parts == 1)
180 return object;
181 return NULL;
182 }
183
184 // Enumerate simulated objects.
185 //
186 // For every object in the simulation, `callback` is called with the provided `data`, the full
187 // hierarchical name of the object (see `cxxrtl_get` for details), and the object parts.
188 // The provided `name` and `object` values are valid until the design is destroyed.
189 void cxxrtl_enum(cxxrtl_handle handle, void *data,
190 void (*callback)(void *data, const char *name,
191 struct cxxrtl_object *object, size_t parts));
192
193 #ifdef __cplusplus
194 }
195 #endif
196
197 #endif