1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
|
.. Copyright (C) 2014 Free Software Foundation, Inc.
Originally contributed by David Malcolm <dmalcolm@redhat.com>
This is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see
<http://www.gnu.org/licenses/>.
.. default-domain:: cpp
Expressions
===========
Rvalues
-------
.. class:: gccjit::rvalue
A :class:`gccjit::rvalue` is an expression that can be computed. It is a
subclass of :class:`gccjit::object`, and is a thin wrapper around
:c:type:`gcc_jit_rvalue *` from the C API.
It can be simple, e.g.:
* an integer value e.g. `0` or `42`
* a string literal e.g. `"Hello world"`
* a variable e.g. `i`. These are also lvalues (see below).
or compound e.g.:
* a unary expression e.g. `!cond`
* a binary expression e.g. `(a + b)`
* a function call e.g. `get_distance (&player_ship, &target)`
* etc.
Every rvalue has an associated type, and the API will check to ensure
that types match up correctly (otherwise the context will emit an error).
.. function:: gccjit::type gccjit::rvalue::get_type ()
Get the type of this rvalue.
Simple expressions
******************
.. function:: gccjit::rvalue \
gccjit::context::new_rvalue (gccjit::type numeric_type, \
int value) const
Given a numeric type (integer or floating point), build an rvalue for
the given constant :c:type:`int` value.
.. function:: gccjit::rvalue \
gccjit::context::new_rvalue (gccjit::type numeric_type, \
long value) const
Given a numeric type (integer or floating point), build an rvalue for
the given constant :c:type:`long` value.
.. function:: gccjit::rvalue \
gccjit::context::zero (gccjit::type numeric_type) const
Given a numeric type (integer or floating point), get the rvalue for
zero. Essentially this is just a shortcut for:
.. code-block:: c++
ctxt.new_rvalue (numeric_type, 0)
.. function:: gccjit::rvalue \
gccjit::context::one (gccjit::type numeric_type) const
Given a numeric type (integer or floating point), get the rvalue for
zero. Essentially this is just a shortcut for:
.. code-block:: c++
ctxt.new_rvalue (numeric_type, 1)
.. function:: gccjit::rvalue \
gccjit::context::new_rvalue (gccjit::type numeric_type, \
double value) const
Given a numeric type (integer or floating point), build an rvalue for
the given constant :c:type:`double` value.
.. function:: gccjit::rvalue \
gccjit::context::new_rvalue (gccjit::type pointer_type, \
void *value) const
Given a pointer type, build an rvalue for the given address.
.. function:: gccjit::rvalue \
gccjit::context::new_rvalue (const std::string &value) const
Generate an rvalue of type :c:data:`GCC_JIT_TYPE_CONST_CHAR_PTR` for
the given string. This is akin to a string literal.
Unary Operations
****************
.. function:: gccjit::rvalue \
gccjit::context::new_unary_op (enum gcc_jit_unary_op, \
gccjit::type result_type, \
gccjit::rvalue rvalue, \
gccjit::location loc)
Build a unary operation out of an input rvalue.
Parameter ``loc`` is optional.
This is a thin wrapper around the C API's
:c:func:`gcc_jit_context_new_unary_op` and the available unary
operations are documented there.
There are shorter ways to spell the various specific kinds of unary
operation:
.. function:: gccjit::rvalue \
gccjit::context::new_minus (gccjit::type result_type, \
gccjit::rvalue a, \
gccjit::location loc)
Negate an arithmetic value; for example:
.. code-block:: c++
gccjit::rvalue negpi = ctxt.new_minus (t_double, pi);
builds the equivalent of this C expression:
.. code-block:: c
-pi
.. function:: gccjit::rvalue \
new_bitwise_negate (gccjit::type result_type, \
gccjit::rvalue a, \
gccjit::location loc)
Bitwise negation of an integer value (one's complement); for example:
.. code-block:: c++
gccjit::rvalue mask = ctxt.new_bitwise_negate (t_int, a);
builds the equivalent of this C expression:
.. code-block:: c
~a
.. function:: gccjit::rvalue \
new_logical_negate (gccjit::type result_type, \
gccjit::rvalue a, \
gccjit::location loc)
Logical negation of an arithmetic or pointer value; for example:
.. code-block:: c++
gccjit::rvalue guard = ctxt.new_logical_negate (t_bool, cond);
builds the equivalent of this C expression:
.. code-block:: c
!cond
The most concise way to spell them is with overloaded operators:
.. function:: gccjit::rvalue operator- (gccjit::rvalue a)
.. code-block:: c++
gccjit::rvalue negpi = -pi;
.. function:: gccjit::rvalue operator~ (gccjit::rvalue a)
.. code-block:: c++
gccjit::rvalue mask = ~a;
.. function:: gccjit::rvalue operator! (gccjit::rvalue a)
.. code-block:: c++
gccjit::rvalue guard = !cond;
Binary Operations
*****************
.. function:: gccjit::rvalue\
gccjit::context::new_binary_op (enum gcc_jit_binary_op, \
gccjit::type result_type, \
gccjit::rvalue a, \
gccjit::rvalue b, \
gccjit::location loc)
Build a binary operation out of two constituent rvalues.
Parameter ``loc`` is optional.
This is a thin wrapper around the C API's
:c:func:`gcc_jit_context_new_binary_op` and the available binary
operations are documented there.
There are shorter ways to spell the various specific kinds of binary
operation:
.. function:: gccjit::rvalue \
gccjit::context::new_plus (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_minus (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_mult (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_divide (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_modulo (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_bitwise_and (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_bitwise_xor (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_bitwise_or (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_logical_and (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_logical_or (gccjit::type result_type, \
gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
The most concise way to spell them is with overloaded operators:
.. function:: gccjit::rvalue operator+ (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue sum = a + b;
.. function:: gccjit::rvalue operator- (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue diff = a - b;
.. function:: gccjit::rvalue operator* (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue prod = a * b;
.. function:: gccjit::rvalue operator/ (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue result = a / b;
.. function:: gccjit::rvalue operator% (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue mod = a % b;
.. function:: gccjit::rvalue operator& (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue x = a & b;
.. function:: gccjit::rvalue operator^ (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue x = a ^ b;
.. function:: gccjit::rvalue operator| (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue x = a | b;
.. function:: gccjit::rvalue operator&& (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = a && b;
.. function:: gccjit::rvalue operator|| (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = a || b;
These can of course be combined, giving a terse way to build compound
expressions:
.. code-block:: c++
gccjit::rvalue discriminant = (b * b) - (four * a * c);
Comparisons
***********
.. function:: gccjit::rvalue \
gccjit::context::new_comparison (enum gcc_jit_comparison,\
gccjit::rvalue a, \
gccjit::rvalue b, \
gccjit::location loc)
Build a boolean rvalue out of the comparison of two other rvalues.
Parameter ``loc`` is optional.
This is a thin wrapper around the C API's
:c:func:`gcc_jit_context_new_comparison` and the available kinds
of comparison are documented there.
There are shorter ways to spell the various specific kinds of binary
operation:
.. function:: gccjit::rvalue \
gccjit::context::new_eq (gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_ne (gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_lt (gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_le (gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_gt (gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
.. function:: gccjit::rvalue \
gccjit::context::new_ge (gccjit::rvalue a, gccjit::rvalue b, \
gccjit::location loc)
The most concise way to spell them is with overloaded operators:
.. function:: gccjit::rvalue \
operator== (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = (a == ctxt.zero (t_int));
.. function:: gccjit::rvalue \
operator!= (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = (i != j);
.. function:: gccjit::rvalue \
operator< (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = i < n;
.. function:: gccjit::rvalue \
operator<= (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = i <= n;
.. function:: gccjit::rvalue \
operator> (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = (ch > limit);
.. function:: gccjit::rvalue \
operator>= (gccjit::rvalue a, gccjit::rvalue b)
.. code-block:: c++
gccjit::rvalue cond = (score >= ctxt.new_rvalue (t_int, 100));
.. TODO: beyond this point
Function calls
**************
.. function:: gcc_jit_rvalue *\
gcc_jit_context_new_call (gcc_jit_context *ctxt,\
gcc_jit_location *loc,\
gcc_jit_function *func,\
int numargs , gcc_jit_rvalue **args)
Given a function and the given table of argument rvalues, construct a
call to the function, with the result as an rvalue.
.. note::
:func:`gccjit::context::new_call` merely builds a
:class:`gccjit::rvalue` i.e. an expression that can be evaluated,
perhaps as part of a more complicated expression.
The call *won't* happen unless you add a statement to a function
that evaluates the expression.
For example, if you want to call a function and discard the result
(or to call a function with ``void`` return type), use
:func:`gccjit::block::add_eval`:
.. code-block:: c++
/* Add "(void)printf (arg0, arg1);". */
block.add_eval (ctxt.new_call (printf_func, arg0, arg1));
Type-coercion
*************
.. function:: gccjit::rvalue \
gccjit::context::new_cast (gccjit::rvalue rvalue,\
gccjit::type type, \
gccjit::location loc)
Given an rvalue of T, construct another rvalue of another type.
Currently only a limited set of conversions are possible:
* int <-> float
* int <-> bool
* P* <-> Q*, for pointer types P and Q
Lvalues
-------
.. class:: gccjit::lvalue
An lvalue is something that can of the *left*-hand side of an assignment:
a storage area (such as a variable). It is a subclass of
:class:`gccjit::rvalue`, where the rvalue is computed by reading from the
storage area.
It iss a thin wrapper around :c:type:`gcc_jit_lvalue *` from the C API.
.. function:: gccjit::rvalue \
gccjit::lvalue::get_address (gccjit::location loc)
Take the address of an lvalue; analogous to:
.. code-block:: c
&(EXPR)
in C.
Parameter "loc" is optional.
Global variables
****************
.. function:: gccjit::lvalue \
gccjit::context::new_global (gccjit::type type, \
const char *name, \
gccjit::location loc)
Add a new global variable of the given type and name to the context.
Working with pointers, structs and unions
-----------------------------------------
.. function:: gccjit::lvalue \
gccjit::rvalue::dereference (gccjit::location loc)
Given an rvalue of pointer type ``T *``, dereferencing the pointer,
getting an lvalue of type ``T``. Analogous to:
.. code-block:: c++
*(EXPR)
in C.
Parameter "loc" is optional.
If you don't need to specify the location, this can also be expressed using
an overloaded operator:
.. function:: gccjit::lvalue \
gccjit::rvalue::operator* ();
.. code-block:: c++
gccjit::lvalue content = *ptr;
Field access is provided separately for both lvalues and rvalues:
.. function:: gccjit::lvalue \
gccjit::lvalue::access_field (gccjit::field field, \
gccjit::location loc)
Given an lvalue of struct or union type, access the given field,
getting an lvalue of the field's type. Analogous to:
.. code-block:: c++
(EXPR).field = ...;
in C.
.. function:: gccjit::rvalue \
gccjit::rvalue::access_field (gccjit::field field, \
gccjit::location loc)
Given an rvalue of struct or union type, access the given field
as an rvalue. Analogous to:
.. code-block:: c++
(EXPR).field
in C.
.. function:: gccjit::lvalue \
gccjit::rvalue::dereference_field (gccjit::field field, \
gccjit::location loc)
Given an rvalue of pointer type ``T *`` where T is of struct or union
type, access the given field as an lvalue. Analogous to:
.. code-block:: c++
(EXPR)->field
in C, itself equivalent to ``(*EXPR).FIELD``.
.. function:: gccjit::lvalue \
gccjit::context::new_array_access (gccjit::rvalue ptr, \
gccjit::rvalue index, \
gccjit::location loc)
Given an rvalue of pointer type ``T *``, get at the element `T` at
the given index, using standard C array indexing rules i.e. each
increment of ``index`` corresponds to ``sizeof(T)`` bytes.
Analogous to:
.. code-block:: c++
PTR[INDEX]
in C (or, indeed, to ``PTR + INDEX``).
Parameter "loc" is optional.
For array accesses where you don't need to specify a :class:`gccjit::location`,
two overloaded operators are available:
gccjit::lvalue gccjit::rvalue::operator[] (gccjit::rvalue index)
.. code-block:: c++
gccjit::lvalue element = array[idx];
gccjit::lvalue gccjit::rvalue::operator[] (int index)
.. code-block:: c++
gccjit::lvalue element = array[0];
|