]>
Commit | Line | Data |
---|---|---|
57a26946 RH |
1 | /* |
2 | * TCG Backend Data: constant pool. | |
3 | * | |
4 | * Permission is hereby granted, free of charge, to any person obtaining a copy | |
5 | * of this software and associated documentation files (the "Software"), to deal | |
6 | * in the Software without restriction, including without limitation the rights | |
7 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
8 | * copies of the Software, and to permit persons to whom the Software is | |
9 | * furnished to do so, subject to the following conditions: | |
10 | * | |
11 | * The above copyright notice and this permission notice shall be included in | |
12 | * all copies or substantial portions of the Software. | |
13 | * | |
14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
15 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL | |
17 | * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
19 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN | |
20 | * THE SOFTWARE. | |
21 | */ | |
22 | ||
23 | typedef struct TCGLabelPoolData { | |
24 | struct TCGLabelPoolData *next; | |
25 | tcg_target_ulong data; | |
26 | tcg_insn_unit *label; | |
27 | intptr_t addend; | |
28 | int type; | |
29 | } TCGLabelPoolData; | |
30 | ||
31 | ||
32 | static void new_pool_label(TCGContext *s, tcg_target_ulong data, int type, | |
33 | tcg_insn_unit *label, intptr_t addend) | |
34 | { | |
35 | TCGLabelPoolData *n = tcg_malloc(sizeof(*n)); | |
36 | TCGLabelPoolData *i, **pp; | |
37 | ||
38 | n->data = data; | |
39 | n->label = label; | |
40 | n->type = type; | |
41 | n->addend = addend; | |
42 | ||
43 | /* Insertion sort on the pool. */ | |
44 | for (pp = &s->pool_labels; (i = *pp) && i->data < data; pp = &i->next) { | |
45 | continue; | |
46 | } | |
47 | n->next = *pp; | |
48 | *pp = n; | |
49 | } | |
50 | ||
51 | /* To be provided by cpu/tcg-target.inc.c. */ | |
52 | static void tcg_out_nop_fill(tcg_insn_unit *p, int count); | |
53 | ||
54 | static bool tcg_out_pool_finalize(TCGContext *s) | |
55 | { | |
56 | TCGLabelPoolData *p = s->pool_labels; | |
57 | tcg_target_ulong d, *a; | |
58 | ||
59 | if (p == NULL) { | |
60 | return true; | |
61 | } | |
62 | ||
63 | /* ??? Round up to qemu_icache_linesize, but then do not round | |
64 | again when allocating the next TranslationBlock structure. */ | |
65 | a = (void *)ROUND_UP((uintptr_t)s->code_ptr, sizeof(tcg_target_ulong)); | |
66 | tcg_out_nop_fill(s->code_ptr, (tcg_insn_unit *)a - s->code_ptr); | |
67 | s->data_gen_ptr = a; | |
68 | ||
69 | /* Ensure the first comparison fails. */ | |
70 | d = p->data + 1; | |
71 | ||
72 | for (; p != NULL; p = p->next) { | |
73 | if (p->data != d) { | |
74 | d = p->data; | |
75 | if (unlikely((void *)a > s->code_gen_highwater)) { | |
76 | return false; | |
77 | } | |
78 | *a++ = d; | |
79 | } | |
80 | patch_reloc(p->label, p->type, (intptr_t)(a - 1), p->addend); | |
81 | } | |
82 | ||
83 | s->code_ptr = (void *)a; | |
84 | return true; | |
85 | } |