DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Mercurial (d8847129d134)

VCS Links

Line Code
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
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
 * vim: set ts=8 sts=4 et sw=4 tw=99:
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#ifndef jsapi_tests_jitTestGVN_h
#define jsapi_tests_jitTestGVN_h

#include "jit/IonAnalysis.h"
#include "jit/MIRGenerator.h"
#include "jit/MIRGraph.h"
#include "jit/RangeAnalysis.h"
#include "jit/ValueNumbering.h"

namespace js {
namespace jit {

struct MinimalAlloc {
    LifoAlloc lifo;
    TempAllocator alloc;

    MinimalAlloc()
      : lifo(4096),
        alloc(&lifo)
    { }
};

struct MinimalFunc : MinimalAlloc
{
    JitCompileOptions options;
    CompileInfo info;
    MIRGraph graph;
    MIRGenerator mir;
    uint32_t numParams;

    MinimalFunc()
      : options(),
        info(0, SequentialExecution),
        graph(&alloc),
        mir(static_cast<CompileCompartment*>(nullptr), options, &alloc, &graph,
            &info, static_cast<const OptimizationInfo*>(nullptr)),
        numParams(0)
    { }

    MBasicBlock* createEntryBlock()
    {
        MBasicBlock* block = MBasicBlock::NewAsmJS(graph, info, nullptr, MBasicBlock::NORMAL);
        graph.addBlock(block);
        return block;
    }

    MBasicBlock* createOsrEntryBlock()
    {
        MBasicBlock* block = MBasicBlock::NewAsmJS(graph, info, nullptr, MBasicBlock::NORMAL);
        graph.addBlock(block);
        graph.setOsrBlock(block);
        return block;
    }

    MBasicBlock* createBlock(MBasicBlock* pred)
    {
        MBasicBlock* block = MBasicBlock::NewAsmJS(graph, info, pred, MBasicBlock::NORMAL);
        graph.addBlock(block);
        return block;
    }

    MParameter* createParameter()
    {
        MParameter* p = MParameter::New(alloc, numParams++, nullptr);
        return p;
    }

    bool runGVN()
    {
        if (!SplitCriticalEdges(graph))
            return false;
        if (!RenumberBlocks(graph))
            return false;
        if (!BuildDominatorTree(graph))
            return false;
        if (!BuildPhiReverseMapping(graph))
            return false;
        ValueNumberer gvn(&mir, graph);
        if (!gvn.init())
            return false;
        if (!gvn.run(ValueNumberer::DontUpdateAliasAnalysis))
            return false;
        return true;
    }

    bool runRangeAnalysis()
    {
        if (!SplitCriticalEdges(graph))
            return false;
        if (!RenumberBlocks(graph))
            return false;
        if (!BuildDominatorTree(graph))
            return false;
        if (!BuildPhiReverseMapping(graph))
            return false;
        RangeAnalysis rangeAnalysis(&mir, graph);
        if (!rangeAnalysis.addBetaNodes())
            return false;
        if (!rangeAnalysis.analyze())
            return false;
        if (!rangeAnalysis.addRangeAssertions())
            return false;
        if (!rangeAnalysis.removeBetaNodes())
            return false;
        return true;
    }
};

} // namespace jit
} // namespace js

#endif