]> git.proxmox.com Git - qemu.git/blob - tcg/README
tcg: forbid ld/st function to modify globals
[qemu.git] / tcg / README
1 Tiny Code Generator - Fabrice Bellard.
2
3 1) Introduction
4
5 TCG (Tiny Code Generator) began as a generic backend for a C
6 compiler. It was simplified to be used in QEMU. It also has its roots
7 in the QOP code generator written by Paul Brook.
8
9 2) Definitions
10
11 The TCG "target" is the architecture for which we generate the
12 code. It is of course not the same as the "target" of QEMU which is
13 the emulated architecture. As TCG started as a generic C backend used
14 for cross compiling, it is assumed that the TCG target is different
15 from the host, although it is never the case for QEMU.
16
17 A TCG "function" corresponds to a QEMU Translated Block (TB).
18
19 A TCG "temporary" is a variable only live in a basic
20 block. Temporaries are allocated explicitly in each function.
21
22 A TCG "local temporary" is a variable only live in a function. Local
23 temporaries are allocated explicitly in each function.
24
25 A TCG "global" is a variable which is live in all the functions
26 (equivalent of a C global variable). They are defined before the
27 functions defined. A TCG global can be a memory location (e.g. a QEMU
28 CPU register), a fixed host register (e.g. the QEMU CPU state pointer)
29 or a memory location which is stored in a register outside QEMU TBs
30 (not implemented yet).
31
32 A TCG "basic block" corresponds to a list of instructions terminated
33 by a branch instruction.
34
35 3) Intermediate representation
36
37 3.1) Introduction
38
39 TCG instructions operate on variables which are temporaries, local
40 temporaries or globals. TCG instructions and variables are strongly
41 typed. Two types are supported: 32 bit integers and 64 bit
42 integers. Pointers are defined as an alias to 32 bit or 64 bit
43 integers depending on the TCG target word size.
44
45 Each instruction has a fixed number of output variable operands, input
46 variable operands and always constant operands.
47
48 The notable exception is the call instruction which has a variable
49 number of outputs and inputs.
50
51 In the textual form, output operands usually come first, followed by
52 input operands, followed by constant operands. The output type is
53 included in the instruction name. Constants are prefixed with a '$'.
54
55 add_i32 t0, t1, t2 (t0 <- t1 + t2)
56
57 3.2) Assumptions
58
59 * Basic blocks
60
61 - Basic blocks end after branches (e.g. brcond_i32 instruction),
62 goto_tb and exit_tb instructions.
63 - Basic blocks start after the end of a previous basic block, or at a
64 set_label instruction.
65
66 After the end of a basic block, the content of temporaries is
67 destroyed, but local temporaries and globals are preserved.
68
69 * Floating point types are not supported yet
70
71 * Pointers: depending on the TCG target, pointer size is 32 bit or 64
72 bit. The type TCG_TYPE_PTR is an alias to TCG_TYPE_I32 or
73 TCG_TYPE_I64.
74
75 * Helpers:
76
77 Using the tcg_gen_helper_x_y it is possible to call any function
78 taking i32, i64 or pointer types. By default, before calling a helper,
79 all globals are stored at their canonical location and it is assumed
80 that the function can modify them. This can be overridden by the
81 TCG_CALL_CONST function modifier. By default, the helper is allowed to
82 modify the CPU state or raise an exception. This can be overridden by
83 the TCG_CALL_PURE function modifier, in which case the call to the
84 function is removed if the return value is not used.
85
86 On some TCG targets (e.g. x86), several calling conventions are
87 supported.
88
89 * Branches:
90
91 Use the instruction 'br' to jump to a label.
92
93 3.3) Code Optimizations
94
95 When generating instructions, you can count on at least the following
96 optimizations:
97
98 - Single instructions are simplified, e.g.
99
100 and_i32 t0, t0, $0xffffffff
101
102 is suppressed.
103
104 - A liveness analysis is done at the basic block level. The
105 information is used to suppress moves from a dead variable to
106 another one. It is also used to remove instructions which compute
107 dead results. The later is especially useful for condition code
108 optimization in QEMU.
109
110 In the following example:
111
112 add_i32 t0, t1, t2
113 add_i32 t0, t0, $1
114 mov_i32 t0, $1
115
116 only the last instruction is kept.
117
118 3.4) Instruction Reference
119
120 ********* Function call
121
122 * call <ret> <params> ptr
123
124 call function 'ptr' (pointer type)
125
126 <ret> optional 32 bit or 64 bit return value
127 <params> optional 32 bit or 64 bit parameters
128
129 ********* Jumps/Labels
130
131 * set_label $label
132
133 Define label 'label' at the current program point.
134
135 * br $label
136
137 Jump to label.
138
139 * brcond_i32/i64 t0, t1, cond, label
140
141 Conditional jump if t0 cond t1 is true. cond can be:
142 TCG_COND_EQ
143 TCG_COND_NE
144 TCG_COND_LT /* signed */
145 TCG_COND_GE /* signed */
146 TCG_COND_LE /* signed */
147 TCG_COND_GT /* signed */
148 TCG_COND_LTU /* unsigned */
149 TCG_COND_GEU /* unsigned */
150 TCG_COND_LEU /* unsigned */
151 TCG_COND_GTU /* unsigned */
152
153 ********* Arithmetic
154
155 * add_i32/i64 t0, t1, t2
156
157 t0=t1+t2
158
159 * sub_i32/i64 t0, t1, t2
160
161 t0=t1-t2
162
163 * neg_i32/i64 t0, t1
164
165 t0=-t1 (two's complement)
166
167 * mul_i32/i64 t0, t1, t2
168
169 t0=t1*t2
170
171 * div_i32/i64 t0, t1, t2
172
173 t0=t1/t2 (signed). Undefined behavior if division by zero or overflow.
174
175 * divu_i32/i64 t0, t1, t2
176
177 t0=t1/t2 (unsigned). Undefined behavior if division by zero.
178
179 * rem_i32/i64 t0, t1, t2
180
181 t0=t1%t2 (signed). Undefined behavior if division by zero or overflow.
182
183 * remu_i32/i64 t0, t1, t2
184
185 t0=t1%t2 (unsigned). Undefined behavior if division by zero.
186
187 ********* Logical
188
189 * and_i32/i64 t0, t1, t2
190
191 t0=t1&t2
192
193 * or_i32/i64 t0, t1, t2
194
195 t0=t1|t2
196
197 * xor_i32/i64 t0, t1, t2
198
199 t0=t1^t2
200
201 * not_i32/i64 t0, t1
202
203 t0=~t1
204
205 * andc_i32/i64 t0, t1, t2
206
207 t0=t1&~t2
208
209 * eqv_i32/i64 t0, t1, t2
210
211 t0=~(t1^t2), or equivalently, t0=t1^~t2
212
213 * nand_i32/i64 t0, t1, t2
214
215 t0=~(t1&t2)
216
217 * nor_i32/i64 t0, t1, t2
218
219 t0=~(t1|t2)
220
221 * orc_i32/i64 t0, t1, t2
222
223 t0=t1|~t2
224
225 ********* Shifts/Rotates
226
227 * shl_i32/i64 t0, t1, t2
228
229 t0=t1 << t2. Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
230
231 * shr_i32/i64 t0, t1, t2
232
233 t0=t1 >> t2 (unsigned). Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
234
235 * sar_i32/i64 t0, t1, t2
236
237 t0=t1 >> t2 (signed). Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
238
239 * rotl_i32/i64 t0, t1, t2
240
241 Rotation of t2 bits to the left. Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
242
243 * rotr_i32/i64 t0, t1, t2
244
245 Rotation of t2 bits to the right. Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
246
247 ********* Misc
248
249 * mov_i32/i64 t0, t1
250
251 t0 = t1
252
253 Move t1 to t0 (both operands must have the same type).
254
255 * ext8s_i32/i64 t0, t1
256 ext8u_i32/i64 t0, t1
257 ext16s_i32/i64 t0, t1
258 ext16u_i32/i64 t0, t1
259 ext32s_i64 t0, t1
260 ext32u_i64 t0, t1
261
262 8, 16 or 32 bit sign/zero extension (both operands must have the same type)
263
264 * bswap16_i32/i64 t0, t1
265
266 16 bit byte swap on a 32/64 bit value. It assumes that the two/six high order
267 bytes are set to zero.
268
269 * bswap32_i32/i64 t0, t1
270
271 32 bit byte swap on a 32/64 bit value. With a 64 bit value, it assumes that
272 the four high order bytes are set to zero.
273
274 * bswap64_i64 t0, t1
275
276 64 bit byte swap
277
278 * discard_i32/i64 t0
279
280 Indicate that the value of t0 won't be used later. It is useful to
281 force dead code elimination.
282
283 * deposit_i32/i64 dest, t1, t2, pos, len
284
285 Deposit T2 as a bitfield into T1, placing the result in DEST.
286 The bitfield is described by POS/LEN, which are immediate values:
287
288 LEN - the length of the bitfield
289 POS - the position of the first bit, counting from the LSB
290
291 For example, pos=8, len=4 indicates a 4-bit field at bit 8.
292 This operation would be equivalent to
293
294 dest = (t1 & ~0x0f00) | ((t2 << 8) & 0x0f00)
295
296
297 ********* Conditional moves
298
299 * setcond_i32/i64 dest, t1, t2, cond
300
301 dest = (t1 cond t2)
302
303 Set DEST to 1 if (T1 cond T2) is true, otherwise set to 0.
304
305 * movcond_i32/i64 dest, c1, c2, v1, v2, cond
306
307 dest = (c1 cond c2 ? v1 : v2)
308
309 Set DEST to V1 if (C1 cond C2) is true, otherwise set to V2.
310
311 ********* Type conversions
312
313 * ext_i32_i64 t0, t1
314 Convert t1 (32 bit) to t0 (64 bit) and does sign extension
315
316 * extu_i32_i64 t0, t1
317 Convert t1 (32 bit) to t0 (64 bit) and does zero extension
318
319 * trunc_i64_i32 t0, t1
320 Truncate t1 (64 bit) to t0 (32 bit)
321
322 * concat_i32_i64 t0, t1, t2
323 Construct t0 (64-bit) taking the low half from t1 (32 bit) and the high half
324 from t2 (32 bit).
325
326 * concat32_i64 t0, t1, t2
327 Construct t0 (64-bit) taking the low half from t1 (64 bit) and the high half
328 from t2 (64 bit).
329
330 ********* Load/Store
331
332 * ld_i32/i64 t0, t1, offset
333 ld8s_i32/i64 t0, t1, offset
334 ld8u_i32/i64 t0, t1, offset
335 ld16s_i32/i64 t0, t1, offset
336 ld16u_i32/i64 t0, t1, offset
337 ld32s_i64 t0, t1, offset
338 ld32u_i64 t0, t1, offset
339
340 t0 = read(t1 + offset)
341 Load 8, 16, 32 or 64 bits with or without sign extension from host memory.
342 offset must be a constant.
343
344 * st_i32/i64 t0, t1, offset
345 st8_i32/i64 t0, t1, offset
346 st16_i32/i64 t0, t1, offset
347 st32_i64 t0, t1, offset
348
349 write(t0, t1 + offset)
350 Write 8, 16, 32 or 64 bits to host memory.
351
352 All this opcodes assume that the pointed host memory doesn't correspond
353 to a global. In the latter case the behaviour is unpredictable.
354
355 ********* 64-bit target on 32-bit host support
356
357 The following opcodes are internal to TCG. Thus they are to be implemented by
358 32-bit host code generators, but are not to be emitted by guest translators.
359 They are emitted as needed by inline functions within "tcg-op.h".
360
361 * brcond2_i32 t0_low, t0_high, t1_low, t1_high, cond, label
362
363 Similar to brcond, except that the 64-bit values T0 and T1
364 are formed from two 32-bit arguments.
365
366 * add2_i32 t0_low, t0_high, t1_low, t1_high, t2_low, t2_high
367 * sub2_i32 t0_low, t0_high, t1_low, t1_high, t2_low, t2_high
368
369 Similar to add/sub, except that the 64-bit inputs T1 and T2 are
370 formed from two 32-bit arguments, and the 64-bit output T0
371 is returned in two 32-bit outputs.
372
373 * mulu2_i32 t0_low, t0_high, t1, t2
374
375 Similar to mul, except two 32-bit (unsigned) inputs T1 and T2 yielding
376 the full 64-bit product T0. The later is returned in two 32-bit outputs.
377
378 * setcond2_i32 dest, t1_low, t1_high, t2_low, t2_high, cond
379
380 Similar to setcond, except that the 64-bit values T1 and T2 are
381 formed from two 32-bit arguments. The result is a 32-bit value.
382
383 ********* QEMU specific operations
384
385 * exit_tb t0
386
387 Exit the current TB and return the value t0 (word type).
388
389 * goto_tb index
390
391 Exit the current TB and jump to the TB index 'index' (constant) if the
392 current TB was linked to this TB. Otherwise execute the next
393 instructions. Only indices 0 and 1 are valid and tcg_gen_goto_tb may be issued
394 at most once with each slot index per TB.
395
396 * qemu_ld8u t0, t1, flags
397 qemu_ld8s t0, t1, flags
398 qemu_ld16u t0, t1, flags
399 qemu_ld16s t0, t1, flags
400 qemu_ld32 t0, t1, flags
401 qemu_ld32u t0, t1, flags
402 qemu_ld32s t0, t1, flags
403 qemu_ld64 t0, t1, flags
404
405 Load data at the QEMU CPU address t1 into t0. t1 has the QEMU CPU address
406 type. 'flags' contains the QEMU memory index (selects user or kernel access)
407 for example.
408
409 Note that "qemu_ld32" implies a 32-bit result, while "qemu_ld32u" and
410 "qemu_ld32s" imply a 64-bit result appropriately extended from 32 bits.
411
412 * qemu_st8 t0, t1, flags
413 qemu_st16 t0, t1, flags
414 qemu_st32 t0, t1, flags
415 qemu_st64 t0, t1, flags
416
417 Store the data t0 at the QEMU CPU Address t1. t1 has the QEMU CPU
418 address type. 'flags' contains the QEMU memory index (selects user or
419 kernel access) for example.
420
421 Note 1: Some shortcuts are defined when the last operand is known to be
422 a constant (e.g. addi for add, movi for mov).
423
424 Note 2: When using TCG, the opcodes must never be generated directly
425 as some of them may not be available as "real" opcodes. Always use the
426 function tcg_gen_xxx(args).
427
428 4) Backend
429
430 tcg-target.h contains the target specific definitions. tcg-target.c
431 contains the target specific code.
432
433 4.1) Assumptions
434
435 The target word size (TCG_TARGET_REG_BITS) is expected to be 32 bit or
436 64 bit. It is expected that the pointer has the same size as the word.
437
438 On a 32 bit target, all 64 bit operations are converted to 32 bits. A
439 few specific operations must be implemented to allow it (see add2_i32,
440 sub2_i32, brcond2_i32).
441
442 Floating point operations are not supported in this version. A
443 previous incarnation of the code generator had full support of them,
444 but it is better to concentrate on integer operations first.
445
446 On a 64 bit target, no assumption is made in TCG about the storage of
447 the 32 bit values in 64 bit registers.
448
449 4.2) Constraints
450
451 GCC like constraints are used to define the constraints of every
452 instruction. Memory constraints are not supported in this
453 version. Aliases are specified in the input operands as for GCC.
454
455 The same register may be used for both an input and an output, even when
456 they are not explicitly aliased. If an op expands to multiple target
457 instructions then care must be taken to avoid clobbering input values.
458 GCC style "early clobber" outputs are not currently supported.
459
460 A target can define specific register or constant constraints. If an
461 operation uses a constant input constraint which does not allow all
462 constants, it must also accept registers in order to have a fallback.
463
464 The movi_i32 and movi_i64 operations must accept any constants.
465
466 The mov_i32 and mov_i64 operations must accept any registers of the
467 same type.
468
469 The ld/st instructions must accept signed 32 bit constant offsets. It
470 can be implemented by reserving a specific register to compute the
471 address if the offset is too big.
472
473 The ld/st instructions must accept any destination (ld) or source (st)
474 register.
475
476 4.3) Function call assumptions
477
478 - The only supported types for parameters and return value are: 32 and
479 64 bit integers and pointer.
480 - The stack grows downwards.
481 - The first N parameters are passed in registers.
482 - The next parameters are passed on the stack by storing them as words.
483 - Some registers are clobbered during the call.
484 - The function can return 0 or 1 value in registers. On a 32 bit
485 target, functions must be able to return 2 values in registers for
486 64 bit return type.
487
488 5) Recommended coding rules for best performance
489
490 - Use globals to represent the parts of the QEMU CPU state which are
491 often modified, e.g. the integer registers and the condition
492 codes. TCG will be able to use host registers to store them.
493
494 - Avoid globals stored in fixed registers. They must be used only to
495 store the pointer to the CPU state and possibly to store a pointer
496 to a register window.
497
498 - Use temporaries. Use local temporaries only when really needed,
499 e.g. when you need to use a value after a jump. Local temporaries
500 introduce a performance hit in the current TCG implementation: their
501 content is saved to memory at end of each basic block.
502
503 - Free temporaries and local temporaries when they are no longer used
504 (tcg_temp_free). Since tcg_const_x() also creates a temporary, you
505 should free it after it is used. Freeing temporaries does not yield
506 a better generated code, but it reduces the memory usage of TCG and
507 the speed of the translation.
508
509 - Don't hesitate to use helpers for complicated or seldom used target
510 instructions. There is little performance advantage in using TCG to
511 implement target instructions taking more than about twenty TCG
512 instructions. Note that this rule of thumb is more applicable to
513 helpers doing complex logic or arithmetic, where the C compiler has
514 scope to do a good job of optimisation; it is less relevant where
515 the instruction is mostly doing loads and stores, and in those cases
516 inline TCG may still be faster for longer sequences.
517
518 - The hard limit on the number of TCG instructions you can generate
519 per target instruction is set by MAX_OP_PER_INSTR in exec-all.h --
520 you cannot exceed this without risking a buffer overrun.
521
522 - Use the 'discard' instruction if you know that TCG won't be able to
523 prove that a given global is "dead" at a given program point. The
524 x86 target uses it to improve the condition codes optimisation.