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 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
|
// ================================================================
// Stack frames for begin/end/if/for/function blocks
//
// A Miller DSL stack has two levels of nesting:
// * A Stack contains a list of StackFrameSet, one per function or Miller outermost statement block
// * A StackFrameSet contains a list of StackFrame, one per if/for/etc within a function
//
// This is because of the following.
//
// (1) a = 1 <-- outer stack frame in same frameset
// if (condition) { <-- inner stack frame in same frameset
// a = 2 <-- this should update the outer 'a', not create new inner 'a'
// }
//
// (2) a = 1 <-- outer stack frame in same frameset
// if (condition) { <-- inner stack frame in same frameset
// var a = 2 <-- this should create new inner 'a', not update the outer 'a'
// }
//
// (3) a = 1 <-- outer stack frame
// func f() { <-- stack frame in a new frameset
// a = 2 <-- this should create new inner 'a', not update the outer 'a'
// }
// ================================================================
package runtime
import (
"fmt"
"github.com/johnkerl/miller/v6/pkg/lib"
"github.com/johnkerl/miller/v6/pkg/mlrval"
"github.com/johnkerl/miller/v6/pkg/types"
)
// ================================================================
// STACK VARIABLE
// StackVariable is an opaque handle which a callsite can hold onto, which
// keeps stack-offset information in it that is private to us.
type StackVariable struct {
name string
// Type like "int" or "num" or "var" is stored in the stack itself. A
// StackVariable can appear in the CST (concrete syntax tree) on either the
// left-hand side or right-hande side of an assignment -- in the latter
// case the callsite won't know the type until the value is read off the
// stack.
}
func NewStackVariable(name string) *StackVariable {
return NewStackVariableAux(name, true)
}
// TODO: comment re function literals
func NewStackVariableAux(name string, cacheable bool) *StackVariable {
return &StackVariable{
name: name,
}
}
func (sv *StackVariable) GetName() string {
return sv.name
}
// ================================================================
// STACK METHODS
type Stack struct {
// list of *StackFrameSet
stackFrameSets []*StackFrameSet
// Invariant: equal to the head of the stackFrameSets list. This is cached
// since all sets/gets in between frameset-push and frameset-pop will all
// and only be operating on the head.
head *StackFrameSet
}
func NewStack() *Stack {
stackFrameSets := make([]*StackFrameSet, 1)
head := newStackFrameSet()
stackFrameSets[0] = head
return &Stack{
stackFrameSets: stackFrameSets,
head: head,
}
}
// For when a user-defined function/subroutine is being entered
func (stack *Stack) PushStackFrameSet() {
stack.head = newStackFrameSet()
stack.stackFrameSets = append([]*StackFrameSet{stack.head}, stack.stackFrameSets...)
}
// For when a user-defined function/subroutine is being exited
func (stack *Stack) PopStackFrameSet() {
stack.stackFrameSets = stack.stackFrameSets[1:]
stack.head = stack.stackFrameSets[0]
}
// ----------------------------------------------------------------
// All of these are simply delegations to the head frameset
// For when an if/for/etc block is being entered
func (stack *Stack) PushStackFrame() {
stack.head.pushStackFrame()
}
// For when an if/for/etc block is being exited
func (stack *Stack) PopStackFrame() {
stack.head.popStackFrame()
}
// Returns nil on no-such
func (stack *Stack) Get(
stackVariable *StackVariable,
) *mlrval.Mlrval {
return stack.head.get(stackVariable)
}
// For 'num a = 2', setting a variable at the current frame regardless of outer
// scope. It's an error to define it again in the same scope, whether the type
// is the same or not.
func (stack *Stack) DefineTypedAtScope(
stackVariable *StackVariable,
typeName string,
mlrval *mlrval.Mlrval,
) error {
return stack.head.defineTypedAtScope(stackVariable, typeName, mlrval)
}
// For untyped declarations at the current scope -- these are in binds of
// for-loop variables, except for triple-for.
// E.g. 'for (k, v in $*)' uses SetAtScope.
// E.g. 'for (int i = 0; i < 10; i += 1)' uses DefineTypedAtScope
// E.g. 'for (i = 0; i < 10; i += 1)' uses Set.
func (stack *Stack) SetAtScope(
stackVariable *StackVariable,
mlrval *mlrval.Mlrval,
) error {
return stack.head.setAtScope(stackVariable, mlrval)
}
// For 'a = 2', checking for outer-scoped to maybe reuse, else insert new in
// current frame. If the variable is entirely new it's set in the current frame
// with no type-checking. If it's not new the assignment is subject to
// type-checking for wherever the variable was defined. E.g. if it was
// previously defined with 'str a = "hello"' then this Set returns an error.
// However if it waa previously assigned untyped with 'a = "hello"' then the
// assignment is OK.
func (stack *Stack) Set(
stackVariable *StackVariable,
mlrval *mlrval.Mlrval,
) error {
return stack.head.set(stackVariable, mlrval)
}
// E.g. 'x[1] = 2' where the variable x may or may not have been already set.
func (stack *Stack) SetIndexed(
stackVariable *StackVariable,
indices []*mlrval.Mlrval,
mlrval *mlrval.Mlrval,
) error {
return stack.head.setIndexed(stackVariable, indices, mlrval)
}
// E.g. 'unset x'
func (stack *Stack) Unset(
stackVariable *StackVariable,
) {
stack.head.unset(stackVariable)
}
// E.g. 'unset x[1]'
func (stack *Stack) UnsetIndexed(
stackVariable *StackVariable,
indices []*mlrval.Mlrval,
) {
stack.head.unsetIndexed(stackVariable, indices)
}
func (stack *Stack) Dump() {
fmt.Printf("STACK FRAMESETS (count %d):\n", len(stack.stackFrameSets))
for _, stackFrameSet := range stack.stackFrameSets {
stackFrameSet.dump()
}
}
// ================================================================
// STACKFRAMESET METHODS
const stackFrameSetInitCap = 6
type StackFrameSet struct {
stackFrames []*StackFrame
}
func newStackFrameSet() *StackFrameSet {
stackFrames := make([]*StackFrame, 1, stackFrameSetInitCap)
stackFrames[0] = newStackFrame()
return &StackFrameSet{
stackFrames: stackFrames,
}
}
func (frameset *StackFrameSet) pushStackFrame() {
frameset.stackFrames = append(frameset.stackFrames, newStackFrame())
}
func (frameset *StackFrameSet) popStackFrame() {
frameset.stackFrames = frameset.stackFrames[0 : len(frameset.stackFrames)-1]
}
func (frameset *StackFrameSet) dump() {
fmt.Printf(" STACK FRAMES (count %d):\n", len(frameset.stackFrames))
for _, stackFrame := range frameset.stackFrames {
fmt.Printf(" VARIABLES (count %d):\n", len(stackFrame.vars))
for _, v := range stackFrame.vars {
fmt.Printf(" %-16s %s\n", v.GetName(), v.ValueString())
}
}
}
// Returns nil on no-such
func (frameset *StackFrameSet) get(
stackVariable *StackVariable,
) *mlrval.Mlrval {
// Scope-walk
numStackFrames := len(frameset.stackFrames)
for offset := numStackFrames - 1; offset >= 0; offset-- {
stackFrame := frameset.stackFrames[offset]
mlrval := stackFrame.get(stackVariable)
if mlrval != nil {
return mlrval
}
}
return nil
}
// See Stack.DefineTypedAtScope comments above
func (frameset *StackFrameSet) defineTypedAtScope(
stackVariable *StackVariable,
typeName string,
mlrval *mlrval.Mlrval,
) error {
offset := len(frameset.stackFrames) - 1
// TODO: comment
return frameset.stackFrames[offset].defineTyped(
stackVariable, typeName, mlrval,
)
}
// See Stack.SetAtScope comments above
func (frameset *StackFrameSet) setAtScope(
stackVariable *StackVariable,
mlrval *mlrval.Mlrval,
) error {
offset := len(frameset.stackFrames) - 1
return frameset.stackFrames[offset].set(stackVariable, mlrval)
}
// See Stack.Set comments above
func (frameset *StackFrameSet) set(
stackVariable *StackVariable,
mlrval *mlrval.Mlrval,
) error {
// Scope-walk
numStackFrames := len(frameset.stackFrames)
for offset := numStackFrames - 1; offset >= 0; offset-- {
stackFrame := frameset.stackFrames[offset]
if stackFrame.has(stackVariable) {
return stackFrame.set(stackVariable, mlrval)
}
}
return frameset.setAtScope(stackVariable, mlrval)
}
// See Stack.SetIndexed comments above
func (frameset *StackFrameSet) setIndexed(
stackVariable *StackVariable,
indices []*mlrval.Mlrval,
mlrval *mlrval.Mlrval,
) error {
// Scope-walk
numStackFrames := len(frameset.stackFrames)
for offset := numStackFrames - 1; offset >= 0; offset-- {
stackFrame := frameset.stackFrames[offset]
if stackFrame.has(stackVariable) {
return stackFrame.setIndexed(stackVariable, indices, mlrval)
}
}
offset := numStackFrames - 1
return frameset.stackFrames[offset].setIndexed(stackVariable, indices, mlrval)
}
// See Stack.Unset comments above
func (frameset *StackFrameSet) unset(
stackVariable *StackVariable,
) {
// Scope-walk
numStackFrames := len(frameset.stackFrames)
for offset := numStackFrames - 1; offset >= 0; offset-- {
stackFrame := frameset.stackFrames[offset]
if stackFrame.has(stackVariable) {
stackFrame.unset(stackVariable)
return
}
}
}
// See Stack.UnsetIndexed comments above
func (frameset *StackFrameSet) unsetIndexed(
stackVariable *StackVariable,
indices []*mlrval.Mlrval,
) {
// Scope-walk
numStackFrames := len(frameset.stackFrames)
for offset := numStackFrames - 1; offset >= 0; offset-- {
stackFrame := frameset.stackFrames[offset]
if stackFrame.has(stackVariable) {
stackFrame.unsetIndexed(stackVariable, indices)
return
}
}
}
// ================================================================
// STACKFRAME METHODS
const stackFrameInitCap = 10
type StackFrame struct {
// TODO: just a map for now. In the C impl, pre-computation of
// name-to-array-slot indices was an important optimization, especially for
// compute-intensive scenarios.
//vars map[string]*types.TypeGatedMlrvalVariable
// TODO: comment
vars []*types.TypeGatedMlrvalVariable
namesToOffsets map[string]int
}
func newStackFrame() *StackFrame {
vars := make([]*types.TypeGatedMlrvalVariable, 0, stackFrameInitCap)
namesToOffsets := make(map[string]int)
return &StackFrame{
vars: vars,
namesToOffsets: namesToOffsets,
}
}
// Returns nil on no such
func (frame *StackFrame) get(
stackVariable *StackVariable,
) *mlrval.Mlrval {
offset, ok := frame.namesToOffsets[stackVariable.name]
if ok {
return frame.vars[offset].GetValue()
} else {
return nil
}
}
func (frame *StackFrame) has(
stackVariable *StackVariable,
) bool {
_, ok := frame.namesToOffsets[stackVariable.name]
return ok
}
// TODO: audit for honor of error-return at callsites
func (frame *StackFrame) set(
stackVariable *StackVariable,
mlrval *mlrval.Mlrval,
) error {
offset, ok := frame.namesToOffsets[stackVariable.name]
if !ok {
slot, err := types.NewTypeGatedMlrvalVariable(stackVariable.name, "any", mlrval)
if err != nil {
return err
}
frame.vars = append(frame.vars, slot)
offsetInFrame := len(frame.vars) - 1
frame.namesToOffsets[stackVariable.name] = offsetInFrame
return nil
} else {
return frame.vars[offset].Assign(mlrval)
}
}
// TODO: audit for honor of error-return at callsites
func (frame *StackFrame) defineTyped(
stackVariable *StackVariable,
typeName string,
mlrval *mlrval.Mlrval,
) error {
_, ok := frame.namesToOffsets[stackVariable.name]
if !ok {
slot, err := types.NewTypeGatedMlrvalVariable(stackVariable.name, typeName, mlrval)
if err != nil {
return err
}
frame.vars = append(frame.vars, slot)
offsetInFrame := len(frame.vars) - 1
frame.namesToOffsets[stackVariable.name] = offsetInFrame
return nil
} else {
return fmt.Errorf(
"%s: variable %s has already been defined in the same scope",
"mlr", stackVariable.name,
)
}
}
// TODO: audit for honor of error-return at callsites
func (frame *StackFrame) setIndexed(
stackVariable *StackVariable,
indices []*mlrval.Mlrval,
mv *mlrval.Mlrval,
) error {
value := frame.get(stackVariable)
if value == nil {
lib.InternalCodingErrorIf(len(indices) < 1)
leadingIndex := indices[0]
if leadingIndex.IsString() || leadingIndex.IsInt() {
newval := mlrval.FromMap(mlrval.NewMlrmap())
newval.PutIndexed(indices, mv)
return frame.set(stackVariable, newval)
} else {
return fmt.Errorf(
"%s: map indices must be int or string; got %s",
"mlr", leadingIndex.GetTypeName(),
)
}
} else {
// For example maybe the variable exists and is an array but the
// leading index is a string.
return value.PutIndexed(indices, mv)
}
}
func (frame *StackFrame) unset(
stackVariable *StackVariable,
) {
offset, ok := frame.namesToOffsets[stackVariable.name]
if ok {
frame.vars[offset].Unassign()
}
}
func (frame *StackFrame) unsetIndexed(
stackVariable *StackVariable,
indices []*mlrval.Mlrval,
) {
value := frame.get(stackVariable)
if value == nil {
return
}
value.RemoveIndexed(indices)
}
|