File: generate-abstract-heap.rb

package info (click to toggle)
webkit2gtk 2.42.2-1~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 362,452 kB
  • sloc: cpp: 2,881,971; javascript: 282,447; ansic: 134,088; python: 43,789; ruby: 18,308; perl: 15,872; asm: 14,389; xml: 4,395; yacc: 2,350; sh: 2,074; java: 1,734; lex: 1,323; makefile: 288; pascal: 60
file content (165 lines) | stat: -rw-r--r-- 5,255 bytes parent folder | download | duplicates (18)
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
#!/usr/bin/env ruby
# -*- coding: utf-8 -*-
# Copyright (C) 2016 Apple Inc. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# 1. Redistributions of source code must retain the above copyright
#    notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
#    notice, this list of conditions and the following disclaimer in the
#    documentation and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
# THE POSSIBILITY OF SUCH DAMAGE.

require "yaml"

class HeapRange
    attr_reader :first, :last
    def initialize(first, last)
        @first = first
        @last = last
    end
end

class AbstractHeap
    attr_reader :range, :name, :parent
    def initialize(name, tree)
        @name = name
        @parent = nil
        if tree.nil?
            @children = []
        else
            @children = tree.map {|key, value| AbstractHeap.new(key, value) }
        end
        @range = nil
    end

    def setParent(parent)
        parent.children.push(self)
        @parent = parent
    end

    def compute(start)
        current = start
        if @children.empty?
            @range = HeapRange.new(start, current + 1)
            return
        end

        @children.each {|child|
            child.compute(current)
            current = child.range.last
        }

        @range = HeapRange.new(start, current)
    end

    def dump output
        shallowDump(output)
        if @parent
            output.print "-> "
            @parent.dump(output)
        end
    end

    def shallowDump(output)
        output.print "#{@name}<#{@range.first},#{@range.last}>"
    end

    def deepDump output, indent
        printIndent(output, indent)
        shallowDump(output)
        if @children.empty?
            output.print "\n"
            return
        end

        output.print ":\n"
        @children.each {|child|
            child.deepDump(output, indent + 1)
        }
    end

    def generate output
        output.puts "constexpr JSC::DOMJIT::HeapRange #{@name}(JSC::DOMJIT::HeapRange::ConstExpr, #{@range.first}, #{@range.last});"
        @children.each {|child|
            child.generate(output)
        }
    end

private
    def printIndent output, indent
        indent.times {
            output.print "    "
        }
    end
end

header = <<-EOS
/*
 * Copyright (C) 2016 Apple Inc. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE INC. OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
// Auto-generated file. Do not modify.

#pragma once

#include <JavaScriptCore/DOMJITHeapRange.h>

namespace WebCore { namespace DOMJIT { namespace AbstractHeapRepository {
EOS

footer = <<-EOS
} } }
EOS

$inputFileName = ARGV.shift
$outputFileName = ARGV.shift
File.open($outputFileName, "w") {|output|
    File.open($inputFileName, "rb") {|file|
        tree = YAML::load(file.read())
        heap = tree.map {|key, value|
            AbstractHeap.new(key, value)
        }.first
        heap.compute(0)

        output.print(header)
        output.puts("/* DOMJIT Abstract Heap Tree.")
        heap.deepDump(output, 0)
        output.puts("*/")
        heap.generate(output)
        output.print(footer)
    }
}