Thomas Pelletier
618f0181ac
* Use pointers instead of copying around ast.Node Node is a 56B struct that is constantly in the hot path. Passing nodes around by copy had a cost that started to add up. This change replaces them by pointers. Using unsafe pointer arithmetic and converting sibling/child indexes to relative offsets, it removes the need to carry around a pointer to the root of the tree. This saves 8B per Node. This space will be used to store an extra []byte slice to provide contextual error handling on all nodes, including the ones whose data is different than the raw input (for example: strings with escaped characters), while staying under the size of a cache line. * Remove conditional * Add Raw to track range in data for parsed values * Simplify reference tracking
51 lines
991 B
Go
51 lines
991 B
Go
package tracker
|
|
|
|
import (
|
|
"github.com/pelletier/go-toml/v2/internal/ast"
|
|
)
|
|
|
|
// KeyTracker is a tracker that keeps track of the current Key as the AST is
|
|
// walked.
|
|
type KeyTracker struct {
|
|
k []string
|
|
}
|
|
|
|
// UpdateTable sets the state of the tracker with the AST table node.
|
|
func (t *KeyTracker) UpdateTable(node *ast.Node) {
|
|
t.reset()
|
|
t.Push(node)
|
|
}
|
|
|
|
// UpdateArrayTable sets the state of the tracker with the AST array table node.
|
|
func (t *KeyTracker) UpdateArrayTable(node *ast.Node) {
|
|
t.reset()
|
|
t.Push(node)
|
|
}
|
|
|
|
// Push the given key on the stack.
|
|
func (t *KeyTracker) Push(node *ast.Node) {
|
|
it := node.Key()
|
|
for it.Next() {
|
|
t.k = append(t.k, string(it.Node().Data))
|
|
}
|
|
}
|
|
|
|
// Pop key from stack.
|
|
func (t *KeyTracker) Pop(node *ast.Node) {
|
|
it := node.Key()
|
|
for it.Next() {
|
|
t.k = t.k[:len(t.k)-1]
|
|
}
|
|
}
|
|
|
|
// Key returns the current key
|
|
func (t *KeyTracker) Key() []string {
|
|
k := make([]string, len(t.k))
|
|
copy(k, t.k)
|
|
return k
|
|
}
|
|
|
|
func (t *KeyTracker) reset() {
|
|
t.k = t.k[:0]
|
|
}
|