]> git.proxmox.com Git - qemu.git/blame - tcg/README
target-ppc: Convert XER accesses to TCG
[qemu.git] / tcg / README
CommitLineData
c896fe29
FB
1Tiny Code Generator - Fabrice Bellard.
2
31) Introduction
4
5TCG (Tiny Code Generator) began as a generic backend for a C
6compiler. It was simplified to be used in QEMU. It also has its roots
7in the QOP code generator written by Paul Brook.
8
92) Definitions
10
11The TCG "target" is the architecture for which we generate the
12code. It is of course not the same as the "target" of QEMU which is
13the emulated architecture. As TCG started as a generic C backend used
14for cross compiling, it is assumed that the TCG target is different
15from the host, although it is never the case for QEMU.
16
17A TCG "function" corresponds to a QEMU Translated Block (TB).
18
0a6b7b78
FB
19A TCG "temporary" is a variable only live in a basic
20block. Temporaries are allocated explicitly in each function.
c896fe29 21
0a6b7b78
FB
22A TCG "local temporary" is a variable only live in a function. Local
23temporaries are allocated explicitly in each function.
24
25A TCG "global" is a variable which is live in all the functions
26(equivalent of a C global variable). They are defined before the
27functions defined. A TCG global can be a memory location (e.g. a QEMU
28CPU register), a fixed host register (e.g. the QEMU CPU state pointer)
29or a memory location which is stored in a register outside QEMU TBs
30(not implemented yet).
c896fe29
FB
31
32A TCG "basic block" corresponds to a list of instructions terminated
33by a branch instruction.
34
353) Intermediate representation
36
373.1) Introduction
38
0a6b7b78
FB
39TCG instructions operate on variables which are temporaries, local
40temporaries or globals. TCG instructions and variables are strongly
41typed. Two types are supported: 32 bit integers and 64 bit
42integers. Pointers are defined as an alias to 32 bit or 64 bit
43integers depending on the TCG target word size.
c896fe29
FB
44
45Each instruction has a fixed number of output variable operands, input
46variable operands and always constant operands.
47
48The notable exception is the call instruction which has a variable
49number of outputs and inputs.
50
0a6b7b78
FB
51In the textual form, output operands usually come first, followed by
52input operands, followed by constant operands. The output type is
53included in the instruction name. Constants are prefixed with a '$'.
c896fe29
FB
54
55add_i32 t0, t1, t2 (t0 <- t1 + t2)
56
c896fe29
FB
573.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 end before legacy dyngen operations.
64- Basic blocks start after the end of a previous basic block, at a
65 set_label instruction or after a legacy dyngen operation.
66
0a6b7b78
FB
67After the end of a basic block, the content of temporaries is
68destroyed, but local temporaries and globals are preserved.
c896fe29
FB
69
70* Floating point types are not supported yet
71
72* Pointers: depending on the TCG target, pointer size is 32 bit or 64
73 bit. The type TCG_TYPE_PTR is an alias to TCG_TYPE_I32 or
74 TCG_TYPE_I64.
75
76* Helpers:
77
78Using the tcg_gen_helper_x_y it is possible to call any function
811d4cf4 79taking i32, i64 or pointer types. Before calling an helper, all
c896fe29
FB
80globals are stored at their canonical location and it is assumed that
81the function can modify them. In the future, function modifiers will
82be allowed to tell that the helper does not read or write some globals.
83
84On some TCG targets (e.g. x86), several calling conventions are
85supported.
86
87* Branches:
88
89Use the instruction 'br' to jump to a label. Use 'jmp' to jump to an
90explicit address. Conditional branches can only jump to labels.
91
923.3) Code Optimizations
93
94When generating instructions, you can count on at least the following
95optimizations:
96
97- Single instructions are simplified, e.g.
98
99 and_i32 t0, t0, $0xffffffff
100
101 is suppressed.
102
103- A liveness analysis is done at the basic block level. The
0a6b7b78 104 information is used to suppress moves from a dead variable to
c896fe29
FB
105 another one. It is also used to remove instructions which compute
106 dead results. The later is especially useful for condition code
9804c8e2 107 optimization in QEMU.
c896fe29
FB
108
109 In the following example:
110
111 add_i32 t0, t1, t2
112 add_i32 t0, t0, $1
113 mov_i32 t0, $1
114
115 only the last instruction is kept.
116
c896fe29
FB
1173.4) Instruction Reference
118
119********* Function call
120
121* call <ret> <params> ptr
122
123call function 'ptr' (pointer type)
124
125<ret> optional 32 bit or 64 bit return value
126<params> optional 32 bit or 64 bit parameters
127
128********* Jumps/Labels
129
130* jmp t0
131
132Absolute jump to address t0 (pointer type).
133
134* set_label $label
135
136Define label 'label' at the current program point.
137
138* br $label
139
140Jump to label.
141
142* brcond_i32/i64 cond, t0, t1, label
143
144Conditional jump if t0 cond t1 is true. cond can be:
145 TCG_COND_EQ
146 TCG_COND_NE
147 TCG_COND_LT /* signed */
148 TCG_COND_GE /* signed */
149 TCG_COND_LE /* signed */
150 TCG_COND_GT /* signed */
151 TCG_COND_LTU /* unsigned */
152 TCG_COND_GEU /* unsigned */
153 TCG_COND_LEU /* unsigned */
154 TCG_COND_GTU /* unsigned */
155
156********* Arithmetic
157
158* add_i32/i64 t0, t1, t2
159
160t0=t1+t2
161
162* sub_i32/i64 t0, t1, t2
163
164t0=t1-t2
165
390efc54
PB
166* neg_i32/i64 t0, t1
167
168t0=-t1 (two's complement)
169
c896fe29
FB
170* mul_i32/i64 t0, t1, t2
171
172t0=t1*t2
173
174* div_i32/i64 t0, t1, t2
175
176t0=t1/t2 (signed). Undefined behavior if division by zero or overflow.
177
178* divu_i32/i64 t0, t1, t2
179
180t0=t1/t2 (unsigned). Undefined behavior if division by zero.
181
182* rem_i32/i64 t0, t1, t2
183
184t0=t1%t2 (signed). Undefined behavior if division by zero or overflow.
185
186* remu_i32/i64 t0, t1, t2
187
188t0=t1%t2 (unsigned). Undefined behavior if division by zero.
189
c896fe29
FB
190********* Logical
191
5e85404a
AJ
192* and_i32/i64 t0, t1, t2
193
c896fe29
FB
194t0=t1&t2
195
196* or_i32/i64 t0, t1, t2
197
198t0=t1|t2
199
200* xor_i32/i64 t0, t1, t2
201
202t0=t1^t2
203
0a6b7b78
FB
204* not_i32/i64 t0, t1
205
206t0=~t1
207
c896fe29
FB
208********* Shifts
209
210* shl_i32/i64 t0, t1, t2
211
212t0=t1 << t2. Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
213
214* shr_i32/i64 t0, t1, t2
215
216t0=t1 >> t2 (unsigned). Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
217
218* sar_i32/i64 t0, t1, t2
219
220t0=t1 >> t2 (signed). Undefined behavior if t2 < 0 or t2 >= 32 (resp 64)
221
222********* Misc
223
224* mov_i32/i64 t0, t1
225
226t0 = t1
227
228Move t1 to t0 (both operands must have the same type).
229
230* ext8s_i32/i64 t0, t1
86831435 231ext8u_i32/i64 t0, t1
c896fe29 232ext16s_i32/i64 t0, t1
86831435 233ext16u_i32/i64 t0, t1
c896fe29 234ext32s_i64 t0, t1
86831435 235ext32u_i64 t0, t1
c896fe29 236
86831435 2378, 16 or 32 bit sign/zero extension (both operands must have the same type)
c896fe29
FB
238
239* bswap16_i32 t0, t1
240
24116 bit byte swap on a 32 bit value. The two high order bytes must be set
242to zero.
243
244* bswap_i32 t0, t1
245
24632 bit byte swap
247
248* bswap_i64 t0, t1
249
25064 bit byte swap
251
5ff9d6a4
FB
252* discard_i32/i64 t0
253
254Indicate that the value of t0 won't be used later. It is useful to
255force dead code elimination.
256
c896fe29
FB
257********* Type conversions
258
259* ext_i32_i64 t0, t1
260Convert t1 (32 bit) to t0 (64 bit) and does sign extension
261
262* extu_i32_i64 t0, t1
263Convert t1 (32 bit) to t0 (64 bit) and does zero extension
264
265* trunc_i64_i32 t0, t1
266Truncate t1 (64 bit) to t0 (32 bit)
267
36aa55dc
PB
268* concat_i32_i64 t0, t1, t2
269Construct t0 (64-bit) taking the low half from t1 (32 bit) and the high half
270from t2 (32 bit).
271
945ca823
BS
272* concat32_i64 t0, t1, t2
273Construct t0 (64-bit) taking the low half from t1 (64 bit) and the high half
274from t2 (64 bit).
275
c896fe29
FB
276********* Load/Store
277
278* ld_i32/i64 t0, t1, offset
279ld8s_i32/i64 t0, t1, offset
280ld8u_i32/i64 t0, t1, offset
281ld16s_i32/i64 t0, t1, offset
282ld16u_i32/i64 t0, t1, offset
283ld32s_i64 t0, t1, offset
284ld32u_i64 t0, t1, offset
285
286t0 = read(t1 + offset)
287Load 8, 16, 32 or 64 bits with or without sign extension from host memory.
288offset must be a constant.
289
290* st_i32/i64 t0, t1, offset
291st8_i32/i64 t0, t1, offset
292st16_i32/i64 t0, t1, offset
293st32_i64 t0, t1, offset
294
295write(t0, t1 + offset)
296Write 8, 16, 32 or 64 bits to host memory.
297
298********* QEMU specific operations
299
300* tb_exit t0
301
302Exit the current TB and return the value t0 (word type).
303
304* goto_tb index
305
306Exit the current TB and jump to the TB index 'index' (constant) if the
307current TB was linked to this TB. Otherwise execute the next
308instructions.
309
310* qemu_ld_i32/i64 t0, t1, flags
311qemu_ld8u_i32/i64 t0, t1, flags
312qemu_ld8s_i32/i64 t0, t1, flags
313qemu_ld16u_i32/i64 t0, t1, flags
314qemu_ld16s_i32/i64 t0, t1, flags
315qemu_ld32u_i64 t0, t1, flags
316qemu_ld32s_i64 t0, t1, flags
317
318Load data at the QEMU CPU address t1 into t0. t1 has the QEMU CPU
319address type. 'flags' contains the QEMU memory index (selects user or
320kernel access) for example.
321
322* qemu_st_i32/i64 t0, t1, flags
323qemu_st8_i32/i64 t0, t1, flags
324qemu_st16_i32/i64 t0, t1, flags
325qemu_st32_i64 t0, t1, flags
326
327Store the data t0 at the QEMU CPU Address t1. t1 has the QEMU CPU
328address type. 'flags' contains the QEMU memory index (selects user or
329kernel access) for example.
330
331Note 1: Some shortcuts are defined when the last operand is known to be
332a constant (e.g. addi for add, movi for mov).
333
334Note 2: When using TCG, the opcodes must never be generated directly
335as some of them may not be available as "real" opcodes. Always use the
336function tcg_gen_xxx(args).
337
3384) Backend
339
340tcg-target.h contains the target specific definitions. tcg-target.c
341contains the target specific code.
342
3434.1) Assumptions
344
345The target word size (TCG_TARGET_REG_BITS) is expected to be 32 bit or
34664 bit. It is expected that the pointer has the same size as the word.
347
348On a 32 bit target, all 64 bit operations are converted to 32 bits. A
349few specific operations must be implemented to allow it (see add2_i32,
350sub2_i32, brcond2_i32).
351
352Floating point operations are not supported in this version. A
353previous incarnation of the code generator had full support of them,
354but it is better to concentrate on integer operations first.
355
356On a 64 bit target, no assumption is made in TCG about the storage of
357the 32 bit values in 64 bit registers.
358
3594.2) Constraints
360
361GCC like constraints are used to define the constraints of every
362instruction. Memory constraints are not supported in this
363version. Aliases are specified in the input operands as for GCC.
364
365A target can define specific register or constant constraints. If an
366operation uses a constant input constraint which does not allow all
367constants, it must also accept registers in order to have a fallback.
368
369The movi_i32 and movi_i64 operations must accept any constants.
370
371The mov_i32 and mov_i64 operations must accept any registers of the
372same type.
373
374The ld/st instructions must accept signed 32 bit constant offsets. It
375can be implemented by reserving a specific register to compute the
376address if the offset is too big.
377
378The ld/st instructions must accept any destination (ld) or source (st)
379register.
380
3814.3) Function call assumptions
382
383- The only supported types for parameters and return value are: 32 and
384 64 bit integers and pointer.
385- The stack grows downwards.
386- The first N parameters are passed in registers.
387- The next parameters are passed on the stack by storing them as words.
388- Some registers are clobbered during the call.
389- The function can return 0 or 1 value in registers. On a 32 bit
390 target, functions must be able to return 2 values in registers for
391 64 bit return type.
392
3935) Migration from dyngen to TCG
394
395TCG is backward compatible with QEMU "dyngen" operations. It means
396that TCG instructions can be freely mixed with dyngen operations. It
397is expected that QEMU targets will be progressively fully converted to
9804c8e2 398TCG. Once a target is fully converted to TCG, it will be possible
c896fe29
FB
399to apply more optimizations because more registers will be free for
400the generated code.
401
402The exception model is the same as the dyngen one.
0a6b7b78
FB
403
4046) Recommended coding rules for best performance
405
406- Use globals to represent the parts of the QEMU CPU state which are
407 often modified, e.g. the integer registers and the condition
408 codes. TCG will be able to use host registers to store them.
409
410- Avoid globals stored in fixed registers. They must be used only to
411 store the pointer to the CPU state and possibly to store a pointer
412 to a register window. The other uses are to ensure backward
413 compatibility with dyngen during the porting a new target to TCG.
414
415- Use temporaries. Use local temporaries only when really needed,
416 e.g. when you need to use a value after a jump. Local temporaries
417 introduce a performance hit in the current TCG implementation: their
418 content is saved to memory at end of each basic block.
419
420- Free temporaries and local temporaries when they are no longer used
421 (tcg_temp_free). Since tcg_const_x() also creates a temporary, you
422 should free it after it is used. Freeing temporaries does not yield
423 a better generated code, but it reduces the memory usage of TCG and
424 the speed of the translation.
425
426- Don't hesitate to use helpers for complicated or seldom used target
427 intructions. There is little performance advantage in using TCG to
428 implement target instructions taking more than about twenty TCG
429 instructions.
430
431- Use the 'discard' instruction if you know that TCG won't be able to
432 prove that a given global is "dead" at a given program point. The
433 x86 target uses it to improve the condition codes optimisation.