# Copyright (C) 2011 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 "config" # # Base utility types for the AST. # # Valid methods for Node: # # node.children -> Returns an array of immediate children. # # node.descendents -> Returns an array of all strict descendants (children # and children of children, transitively). # # node.flatten -> Returns an array containing the strict descendants and # the node itself. # # node.filter(type) -> Returns an array containing those elements in # node.flatten that are of the given type (is_a? type returns true). # # node.mapChildren{|v| ...} -> Returns a new node with all children # replaced according to the given block. # # Examples: # # node.filter(Setting).uniq -> Returns all of the settings that the AST's # IfThenElse blocks depend on. # # node.filter(StructOffset).uniq -> Returns all of the structure offsets # that the AST depends on. class Node attr_reader :codeOrigin def initialize(codeOrigin) @codeOrigin = codeOrigin end def codeOriginString @codeOrigin.to_s end def descendants children.collect{|v| v.flatten}.flatten end def flatten [self] + descendants end def filter(type) flatten.select{|v| v.is_a? type} end end class NoChildren (other) if @struct != other.struct return @struct other.struct end @field other.field end def address? false end def label? false end def immediate? true end def register? false end end class Sizeof (other) @struct other.struct end def address? false end def label? false end def immediate? true end def register? false end end class Immediate " end end class Address