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
|
package ast
import (
"github.com/elliotchance/c2go/util"
)
// AvailabilityAttr is a type of attribute that is optionally attached to a variable
// or struct field definition.
type AvailabilityAttr struct {
Addr Address
Pos Position
OS string
Version string
Unknown1 float64
Unknown2 int
IsUnavailable bool
Message1 string
Message2 string
IsInherited bool
ChildNodes []Node
}
func parseAvailabilityAttr(line string) *AvailabilityAttr {
groups := groupsFromRegex(
`<(?P<position>.*)>
(?P<inherited> Inherited)?
(?P<os>\w+)
(?P<version>[\d.]+)
(?P<unknown1>[\d.]+)
(?P<unknown2>[\d.]+)
(?P<unavalable> Unavailable)?
"(?P<message1>.*?)"
(?P<message2> ".*?")?`,
line,
)
return &AvailabilityAttr{
Addr: ParseAddress(groups["address"]),
Pos: NewPositionFromString(groups["position"]),
OS: groups["os"],
Version: groups["version"],
Unknown1: atof(groups["unknown1"]),
Unknown2: util.Atoi(groups["unknown2"]),
IsUnavailable: len(groups["unavalable"]) > 0,
Message1: removeQuotes(groups["message1"]),
Message2: removeQuotes(groups["message2"]),
IsInherited: len(groups["inherited"]) > 0,
ChildNodes: []Node{},
}
}
// AddChild adds a new child node. Child nodes can then be accessed with the
// Children attribute.
func (n *AvailabilityAttr) 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 *AvailabilityAttr) 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 *AvailabilityAttr) Children() []Node {
return n.ChildNodes
}
// Position returns the position in the original source code.
func (n *AvailabilityAttr) Position() Position {
return n.Pos
}
|
