-
Notifications
You must be signed in to change notification settings - Fork 276
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
internal/core/debug: add compact mode
Change-Id: I4ad0ab4aef7abc44e54bb1d59cf713b3819da918 Reviewed-on: https://cue-review.googlesource.com/c/cue/+/6501 Reviewed-by: CUE cueckoo <cueckoo@gmail.com> Reviewed-by: Marcel van Lohuizen <mpvl@golang.org>
- Loading branch information
Showing
2 changed files
with
341 additions
and
7 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,331 @@ | ||
// Copyright 2020 CUE Authors | ||
// | ||
// Licensed under the Apache License, Version 2.0 (the "License"); | ||
// you may not use this file except in compliance with the License. | ||
// You may obtain a copy of the License at | ||
// | ||
// http://www.apache.org/licenses/LICENSE-2.0 | ||
// | ||
// Unless required by applicable law or agreed to in writing, software | ||
// distributed under the License is distributed on an "AS IS" BASIS, | ||
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
// See the License for the specific language governing permissions and | ||
// limitations under the License. | ||
|
||
// Package debug prints a given ADT node. | ||
// | ||
// Note that the result is not valid CUE, but instead prints the internals | ||
// of an ADT node in human-readable form. It uses a simple indentation algorithm | ||
// for improved readability and diffing. | ||
// | ||
package debug | ||
|
||
import ( | ||
"fmt" | ||
"strconv" | ||
|
||
"cuelang.org/go/internal/core/adt" | ||
) | ||
|
||
type compactPrinter struct { | ||
printer | ||
} | ||
|
||
func (w *compactPrinter) node(n adt.Node) { | ||
switch x := n.(type) { | ||
case *adt.Vertex: | ||
if x.Value == nil || (w.cfg.Raw && len(x.Conjuncts) > 0) { | ||
for i, c := range x.Conjuncts { | ||
if i > 0 { | ||
w.string(" & ") | ||
} | ||
w.node(c.Expr()) | ||
} | ||
return | ||
} | ||
|
||
switch x.Value.(type) { | ||
case *adt.StructMarker: | ||
w.string("{") | ||
for i, a := range x.Arcs { | ||
if i > 0 { | ||
w.string(",") | ||
} | ||
w.label(a.Label) | ||
w.string(":") | ||
w.node(a) | ||
} | ||
w.string("}") | ||
|
||
case *adt.ListMarker: | ||
w.string("[") | ||
for i, a := range x.Arcs { | ||
if i > 0 { | ||
w.string(",") | ||
} | ||
w.node(a) | ||
} | ||
w.string("]") | ||
|
||
default: | ||
w.node(x.Value) | ||
} | ||
|
||
case *adt.StructMarker: | ||
w.string("struct") | ||
|
||
case *adt.ListMarker: | ||
w.string("list") | ||
|
||
case *adt.StructLit: | ||
w.string("{") | ||
for i, d := range x.Decls { | ||
if i > 0 { | ||
w.string(",") | ||
} | ||
w.node(d) | ||
} | ||
w.string("}") | ||
|
||
case *adt.ListLit: | ||
w.string("[") | ||
for i, d := range x.Elems { | ||
if i > 0 { | ||
w.string(",") | ||
} | ||
w.node(d) | ||
} | ||
w.string("]") | ||
|
||
case *adt.Field: | ||
s := w.labelString(x.Label) | ||
w.string(s) | ||
w.string(":") | ||
w.node(x.Value) | ||
|
||
case *adt.OptionalField: | ||
s := w.labelString(x.Label) | ||
w.string(s) | ||
w.string("?:") | ||
w.node(x.Value) | ||
|
||
case *adt.BulkOptionalField: | ||
w.string("[") | ||
w.node(x.Filter) | ||
w.string("]:") | ||
w.node(x.Value) | ||
|
||
case *adt.DynamicField: | ||
w.node(x.Key) | ||
if x.IsOptional() { | ||
w.string("?") | ||
} | ||
w.string(":") | ||
w.node(x.Value) | ||
|
||
case *adt.Ellipsis: | ||
w.string("...") | ||
if x.Value != nil { | ||
w.node(x.Value) | ||
} | ||
|
||
case *adt.Bottom: | ||
w.string(`_|_`) | ||
if x.Err != nil { | ||
w.string("(") | ||
msg, args := x.Err.Msg() | ||
w.string(fmt.Sprintf(msg, args...)) | ||
w.string(")") | ||
} | ||
|
||
case *adt.Null: | ||
w.string("null") | ||
|
||
case *adt.Bool: | ||
fmt.Fprint(w, x.B) | ||
|
||
case *adt.Num: | ||
fmt.Fprint(w, &x.X) | ||
|
||
case *adt.String: | ||
w.string(strconv.Quote(x.Str)) | ||
|
||
case *adt.Bytes: | ||
b := []byte(strconv.Quote(string(x.B))) | ||
b[0] = '\'' | ||
b[len(b)-1] = '\'' | ||
w.string(string(b)) | ||
|
||
case *adt.Top: | ||
w.string("_") | ||
|
||
case *adt.BasicType: | ||
fmt.Fprint(w, x.K) | ||
|
||
case *adt.BoundExpr: | ||
fmt.Fprint(w, x.Op) | ||
w.node(x.Expr) | ||
|
||
case *adt.BoundValue: | ||
fmt.Fprint(w, x.Op) | ||
w.node(x.Value) | ||
|
||
case *adt.FieldReference: | ||
w.label(x.Label) | ||
|
||
case *adt.LabelReference: | ||
if x.Src == nil { | ||
w.string("LABEL") | ||
} else { | ||
w.string(x.Src.Name) | ||
} | ||
|
||
case *adt.DynamicReference: | ||
w.node(x.Label) | ||
|
||
case *adt.ImportReference: | ||
w.label(x.ImportPath) | ||
|
||
case *adt.LetReference: | ||
w.label(x.Label) | ||
|
||
case *adt.SelectorExpr: | ||
w.node(x.X) | ||
w.string(".") | ||
w.label(x.Sel) | ||
|
||
case *adt.IndexExpr: | ||
w.node(x.X) | ||
w.string("[") | ||
w.node(x.Index) | ||
w.string("]") | ||
|
||
case *adt.SliceExpr: | ||
w.node(x.X) | ||
w.string("[") | ||
if x.Lo != nil { | ||
w.node(x.Lo) | ||
} | ||
w.string(":") | ||
if x.Hi != nil { | ||
w.node(x.Hi) | ||
} | ||
if x.Stride != nil { | ||
w.string(":") | ||
w.node(x.Stride) | ||
} | ||
w.string("]") | ||
|
||
case *adt.Interpolation: | ||
w.string(`"`) | ||
for i := 0; i < len(x.Parts); i += 2 { | ||
if s, ok := x.Parts[i].(*adt.String); ok { | ||
w.string(s.Str) | ||
} else { | ||
w.string("<bad string>") | ||
} | ||
if i+1 < len(x.Parts) { | ||
w.string(`\(`) | ||
w.node(x.Parts[i+1]) | ||
w.string(`)`) | ||
} | ||
} | ||
w.string(`"`) | ||
|
||
case *adt.UnaryExpr: | ||
fmt.Fprint(w, x.Op) | ||
w.node(x.X) | ||
|
||
case *adt.BinaryExpr: | ||
w.string("(") | ||
w.node(x.X) | ||
fmt.Fprint(w, " ", x.Op, " ") | ||
w.node(x.Y) | ||
w.string(")") | ||
|
||
case *adt.CallExpr: | ||
w.node(x.Fun) | ||
w.string("(") | ||
for i, a := range x.Args { | ||
if i > 0 { | ||
w.string(", ") | ||
} | ||
w.node(a) | ||
} | ||
w.string(")") | ||
|
||
case *adt.BuiltinValidator: | ||
w.node(x.Fun) | ||
w.string("(") | ||
for i, a := range x.Args { | ||
if i > 0 { | ||
w.string(", ") | ||
} | ||
w.node(a) | ||
} | ||
w.string(")") | ||
|
||
case *adt.DisjunctionExpr: | ||
w.string("(") | ||
for i, a := range x.Values { | ||
if i > 0 { | ||
w.string("|") | ||
} | ||
// Disjunct | ||
if a.Default { | ||
w.string("*") | ||
} | ||
w.node(a.Val) | ||
} | ||
w.string(")") | ||
|
||
case *adt.Conjunction: | ||
for i, c := range x.Values { | ||
if i > 0 { | ||
w.string(" & ") | ||
} | ||
w.node(c) | ||
} | ||
|
||
case *adt.Disjunction: | ||
for i, c := range x.Values { | ||
if i > 0 { | ||
w.string(" | ") | ||
} | ||
if i < x.NumDefaults { | ||
w.string("*") | ||
} | ||
w.node(c) | ||
} | ||
|
||
case *adt.ForClause: | ||
w.string("for ") | ||
w.label(x.Key) | ||
w.string(", ") | ||
w.label(x.Value) | ||
w.string(" in ") | ||
w.node(x.Src) | ||
w.string(" ") | ||
w.node(x.Dst) | ||
|
||
case *adt.IfClause: | ||
w.string("if ") | ||
w.node(x.Condition) | ||
w.string(" ") | ||
w.node(x.Dst) | ||
|
||
case *adt.LetClause: | ||
w.string("let ") | ||
w.label(x.Label) | ||
w.string(" = ") | ||
w.node(x.Expr) | ||
w.string(" ") | ||
w.node(x.Dst) | ||
|
||
case *adt.ValueClause: | ||
w.node(x.StructLit) | ||
|
||
default: | ||
panic(fmt.Sprintf("unknown type %T", x)) | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters