| 1 | /* |
| 2 | * Copyright (C) 2012, 2015 Apple Inc. All rights reserved. |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions |
| 6 | * are met: |
| 7 | * 1. Redistributions of source code must retain the above copyright |
| 8 | * notice, this list of conditions and the following disclaimer. |
| 9 | * 2. Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * |
| 13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
| 14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
| 17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 22 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 23 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 24 | */ |
| 25 | |
| 26 | #include "config.h" |
| 27 | #include "DFGVariableAccessDataDump.h" |
| 28 | |
| 29 | #if ENABLE(DFG_JIT) |
| 30 | |
| 31 | #include "DFGGraph.h" |
| 32 | #include "DFGVariableAccessData.h" |
| 33 | #include "JSCInlines.h" |
| 34 | |
| 35 | namespace JSC { namespace DFG { |
| 36 | |
| 37 | VariableAccessDataDump::VariableAccessDataDump(Graph& graph, VariableAccessData* data) |
| 38 | : m_graph(graph) |
| 39 | , m_data(data) |
| 40 | { |
| 41 | } |
| 42 | |
| 43 | void VariableAccessDataDump::dump(PrintStream& out) const |
| 44 | { |
| 45 | unsigned index = std::numeric_limits<unsigned>::max(); |
| 46 | for (unsigned i = 0; i < m_graph.m_variableAccessData.size(); ++i) { |
| 47 | if (&m_graph.m_variableAccessData[i] == m_data) { |
| 48 | index = i; |
| 49 | break; |
| 50 | } |
| 51 | } |
| 52 | |
| 53 | ASSERT(index != std::numeric_limits<unsigned>::max()); |
| 54 | |
| 55 | if (!index) { |
| 56 | out.print("a" ); |
| 57 | return; |
| 58 | } |
| 59 | |
| 60 | while (index) { |
| 61 | out.print(CharacterDump('A' + (index % 26))); |
| 62 | index /= 26; |
| 63 | } |
| 64 | |
| 65 | if (m_data->shouldNeverUnbox()) |
| 66 | out.print("!" ); |
| 67 | else if (!m_data->shouldUnboxIfPossible()) |
| 68 | out.print("~" ); |
| 69 | |
| 70 | out.print(AbbreviatedSpeculationDump(m_data->prediction()), "/" , m_data->flushFormat()); |
| 71 | } |
| 72 | |
| 73 | } } // namespace JSC::DFG |
| 74 | |
| 75 | #endif // ENABLE(DFG_JIT) |
| 76 | |
| 77 | |
| 78 | |