package ast import ( "strings" ) // FunctionDecl is node represents a function declaration. type FunctionDecl struct { Addr Address Pos Position Prev string Parent string Position2 string Name string Type string Type2 string IsExtern bool IsImplicit bool IsUsed bool IsReferenced bool IsStatic bool IsInline bool ChildNodes []Node } func parseFunctionDecl(line string) Node { groups := groupsFromRegex( `(?:parent (?P0x[0-9a-f]+) )? (?:prev (?P0x[0-9a-f]+) )? <(?P.*?)> (?P [^ ]+| [^ ]+)? (?P implicit)? (?P used)? (?P referenced)? (?P[_\w]+) '(?P.*?)' (:'(?P.*?)')? (?P extern)? (?P static)? (?P inline)? `, line, ) if groups == nil { return &Unknown{} } return &FunctionDecl{ Addr: ParseAddress(groups["address"]), Pos: NewPositionFromString(groups["position1"]), Parent: groups["parent"], Prev: groups["prev"], Position2: strings.TrimSpace(groups["position2"]), Name: groups["name"], Type: groups["type"], Type2: groups["type2"], IsExtern: len(groups["extern"]) > 0, IsImplicit: len(groups["implicit"]) > 0, IsUsed: len(groups["used"]) > 0, IsReferenced: len(groups["referenced"]) > 0, IsStatic: len(groups["static"]) > 0, IsInline: len(groups["inline"]) > 0, ChildNodes: []Node{}, } } // AddChild adds a new child node. Child nodes can then be accessed with the // Children attribute. func (n *FunctionDecl) AddChild(node Node) { n.ChildNodes = append(n.ChildNodes, node) } // Address returns the numeric address of the node. See the documentation for // the Address type for more information. func (n *FunctionDecl) Address() Address { return n.Addr } // Children returns the child nodes. If this node does not have any children or // this node does not support children it will always return an empty slice. func (n *FunctionDecl) Children() []Node { return n.ChildNodes } // Position returns the position in the original source code. func (n *FunctionDecl) Position() Position { return n.Pos }