cachepc-qemu

Fork of AMDESE/qemu with changes for cachepc side-channel attack
git clone https://git.sinitax.com/sinitax/cachepc-qemu
Log | Files | Refs | Submodules | LICENSE | sfeed.txt

tcg-ldst.c.inc (3011B)

      1/*
      2 * TCG Backend Data: load-store optimization only.
      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
     23typedef struct TCGLabelQemuLdst {
     24    bool is_ld;             /* qemu_ld: true, qemu_st: false */
     25    MemOpIdx oi;
     26    TCGType type;           /* result type of a load */
     27    TCGReg addrlo_reg;      /* reg index for low word of guest virtual addr */
     28    TCGReg addrhi_reg;      /* reg index for high word of guest virtual addr */
     29    TCGReg datalo_reg;      /* reg index for low word to be loaded or stored */
     30    TCGReg datahi_reg;      /* reg index for high word to be loaded or stored */
     31    const tcg_insn_unit *raddr;   /* addr of the next IR of qemu_ld/st IR */
     32    tcg_insn_unit *label_ptr[2]; /* label pointers to be updated */
     33    QSIMPLEQ_ENTRY(TCGLabelQemuLdst) next;
     34} TCGLabelQemuLdst;
     35
     36
     37/*
     38 * Generate TB finalization at the end of block
     39 */
     40
     41static bool tcg_out_qemu_ld_slow_path(TCGContext *s, TCGLabelQemuLdst *l);
     42static bool tcg_out_qemu_st_slow_path(TCGContext *s, TCGLabelQemuLdst *l);
     43
     44static int tcg_out_ldst_finalize(TCGContext *s)
     45{
     46    TCGLabelQemuLdst *lb;
     47
     48    /* qemu_ld/st slow paths */
     49    QSIMPLEQ_FOREACH(lb, &s->ldst_labels, next) {
     50        if (lb->is_ld
     51            ? !tcg_out_qemu_ld_slow_path(s, lb)
     52            : !tcg_out_qemu_st_slow_path(s, lb)) {
     53            return -2;
     54        }
     55
     56        /* Test for (pending) buffer overflow.  The assumption is that any
     57           one operation beginning below the high water mark cannot overrun
     58           the buffer completely.  Thus we can test for overflow after
     59           generating code without having to check during generation.  */
     60        if (unlikely((void *)s->code_ptr > s->code_gen_highwater)) {
     61            return -1;
     62        }
     63    }
     64    return 0;
     65}
     66
     67/*
     68 * Allocate a new TCGLabelQemuLdst entry.
     69 */
     70
     71static inline TCGLabelQemuLdst *new_ldst_label(TCGContext *s)
     72{
     73    TCGLabelQemuLdst *l = tcg_malloc(sizeof(*l));
     74
     75    QSIMPLEQ_INSERT_TAIL(&s->ldst_labels, l, next);
     76
     77    return l;
     78}