// Mgmt
// Copyright (C) James Shubin and the project contributors
// Written by James Shubin <james@shubin.ca> and the project contributors
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.
//
// Additional permission under GNU GPL version 3 section 7
//
// If you modify this program, or any covered work, by linking or combining it
// with embedded mcl code and modules (and that the embedded mcl code and
// modules which link with this program, contain a copy of their source code in
// the authoritative form) containing parts covered by the terms of any other
// license, the licensors of this program grant you additional permission to
// convey the resulting work. Furthermore, the licensors of this program grant
// the original author, James Shubin, additional permission to update this
// additional permission if he deems it necessary to achieve the goals of this
// additional permission.

//go:build !root

package lang

import (
	"bytes"
	"context"
	"encoding/json"
	"fmt"
	"os"
	"path/filepath"
	"sort"
	"strings"
	"sync"
	"testing"
	"time"

	"github.com/purpleidea/mgmt/converger"
	"github.com/purpleidea/mgmt/engine"
	"github.com/purpleidea/mgmt/engine/graph"
	"github.com/purpleidea/mgmt/engine/graph/autoedge"
	"github.com/purpleidea/mgmt/engine/graph/autogroup"
	"github.com/purpleidea/mgmt/engine/local"
	engineUtil "github.com/purpleidea/mgmt/engine/util"
	"github.com/purpleidea/mgmt/etcd"
	etcdClient "github.com/purpleidea/mgmt/etcd/client"
	"github.com/purpleidea/mgmt/lang/ast"
	"github.com/purpleidea/mgmt/lang/funcs/dage"
	"github.com/purpleidea/mgmt/lang/funcs/vars"
	"github.com/purpleidea/mgmt/lang/inputs"
	"github.com/purpleidea/mgmt/lang/interfaces"
	"github.com/purpleidea/mgmt/lang/interpolate"
	"github.com/purpleidea/mgmt/lang/interpret"
	"github.com/purpleidea/mgmt/lang/parser"
	"github.com/purpleidea/mgmt/lang/types"
	"github.com/purpleidea/mgmt/lang/unification"
	"github.com/purpleidea/mgmt/pgraph"
	"github.com/purpleidea/mgmt/util"
	"github.com/purpleidea/mgmt/util/errwrap"

	"github.com/kylelemons/godebug/pretty"
	"github.com/spf13/afero"
	"golang.org/x/tools/txtar"
)

const (
	runGraphviz = false // run graphviz in tests?

	doOverwriteTest = false // overwrite tests (hacker mode)
)

var (
	testMutex   *sync.Mutex     // guards testCounter
	testCounter map[string]uint // counts how many times each test ran
)

func init() {
	testMutex = &sync.Mutex{}
	testCounter = make(map[string]uint)
}

// ConfigProperties are some values that are used to specify how each test runs.
type ConfigProperties struct {

	// MaximumCount specifies how many times this test can run safely in a
	// single iteration. If zero then this means infinite.
	MaximumCount uint `json:"maximum-count"`
}

// TestAstFunc1 is a more advanced version which pulls code from physical dirs.
func TestAstFunc1(t *testing.T) {
	const magicError = "# err: "
	const magicErrorLexParse = "errLexParse: "
	const magicErrorInit = "errInit: "
	const magicErrorSetScope = "errSetScope: "
	const magicErrorUnify = "errUnify: "
	const magicErrorGraph = "errGraph: "
	const magicEmpty = "# empty!"
	dir, err := util.TestDirFull()
	if err != nil {
		t.Errorf("could not get tests directory: %+v", err)
		return
	}
	t.Logf("tests directory is: %s", dir)

	type test struct { // an individual test
		name string
		path string // relative txtar path inside tests dir
	}
	testCases := []test{}

	// build test array automatically from reading the dir
	files, err := os.ReadDir(dir)
	if err != nil {
		t.Errorf("could not read through tests directory: %+v", err)
		return
	}
	sorted := []string{}
	for _, f := range files {
		if !strings.HasSuffix(f.Name(), ".txtar") {
			continue
		}

		sorted = append(sorted, f.Name())
	}
	sort.Strings(sorted)
	for _, f := range sorted {
		// add automatic test case
		testCases = append(testCases, test{
			name: fmt.Sprintf("%s", f),
			path: f, // <something>.txtar
		})
	}

	if testing.Short() {
		t.Logf("available tests:")
	}
	names := []string{}
	for index, tc := range testCases { // run all the tests
		if tc.name == "" {
			t.Errorf("test #%d: not named", index)
			continue
		}
		if util.StrInList(tc.name, names) {
			t.Errorf("test #%d: duplicate sub test name of: %s", index, tc.name)
			continue
		}
		names = append(names, tc.name)

		//if index != 3 { // hack to run a subset (useful for debugging)
		//if tc.name != "simple operators" {
		//	continue
		//}

		testName := fmt.Sprintf("test #%d (%s)", index, tc.name)
		if testing.Short() { // make listing tests easier
			t.Logf("%s", testName)
			continue
		}
		t.Run(testName, func(t *testing.T) {
			name, path := tc.name, tc.path
			tmpdir := t.TempDir() // gets cleaned up at end, new dir for each call
			src := tmpdir         // location of the test
			txtarFile := dir + path

			archive, err := txtar.ParseFile(txtarFile)
			if err != nil {
				t.Errorf("err parsing txtar(%s): %+v", txtarFile, err)
				return
			}
			comment := strings.TrimSpace(string(archive.Comment))
			if comment != "" {
				t.Logf("comment: %s\n", comment)
			}

			sources := map[string][]byte{}
			sourceFinder := func(path string) ([]byte, error) {
				if b, exists := sources[path]; exists {
					return b, nil
				}
				return nil, os.ErrNotExist
			}
			// copy files out into the test temp directory
			var testOutput []byte
			var testConfig []byte
			found := false
			for _, file := range archive.Files {
				sources["/"+file.Name] = file.Data // store!
				if file.Name == "OUTPUT" {
					testOutput = file.Data
					found = true
					continue
				}
				if file.Name == "CONFIG" {
					testConfig = file.Data
					continue
				}

				name := filepath.Join(tmpdir, file.Name)
				dir := filepath.Dir(name)
				if err := os.MkdirAll(dir, 0770); err != nil {
					t.Errorf("err making dir(%s): %+v", dir, err)
					return
				}
				if err := os.WriteFile(name, file.Data, 0660); err != nil {
					t.Errorf("err writing file(%s): %+v", name, err)
					return
				}
			}

			var c ConfigProperties // add pointer to get nil if empty
			if len(testConfig) > 0 {
				if err := json.Unmarshal(testConfig, &c); err != nil {
					t.Errorf("err parsing txtar(%s) config: %+v", txtarFile, err)
					return
				}
			}
			if testing.Verbose() {
				t.Logf("config: %+v", c)
			}

			testMutex.Lock()               // global
			count := testCounter[t.Name()] // global
			testCounter[t.Name()]++
			testMutex.Unlock()

			if c.MaximumCount != 0 && count >= c.MaximumCount {
				if count == c.MaximumCount { // logf once
					t.Logf("Skipping test after count: %d", count)
				}
				return
			}

			if !found { // skip missing tests
				return
			}

			expstr := string(testOutput) // expected graph
			expstrs := []string{}

			// if the graph file has a magic error string, it's a failure
			errStr := ""
			errMagic := ""
			failLexParse := false
			failInit := false
			failSetScope := false
			failUnify := false
			failGraph := false
			if strings.HasPrefix(expstr, magicError) {
				expstrs = strings.Split(expstr, "\n")
				for i := len(expstrs) - 1; i >= 0; i-- { // reverse
					if strings.TrimSpace(expstrs[i]) == "" {
						expstrs = append(expstrs[:i], expstrs[i+1:]...) // remove it (from the end)
						continue
					}
					expstrs[i] = strings.TrimPrefix(expstrs[i], magicError) // trim the magic prefix off
				}
				errStr = strings.TrimPrefix(expstr, magicError)
				expstr = errStr
				t.Logf("errStr has length %d", len(errStr))

				if strings.HasPrefix(expstr, magicErrorLexParse) {
					errMagic = magicErrorLexParse
					errStr = strings.TrimPrefix(expstr, magicErrorLexParse)
					expstr = errStr
					failLexParse = true
				}
				if strings.HasPrefix(expstr, magicErrorInit) {
					errMagic = magicErrorInit
					errStr = strings.TrimPrefix(expstr, magicErrorInit)
					expstr = errStr
					failInit = true
				}
				if strings.HasPrefix(expstr, magicErrorSetScope) {
					errMagic = magicErrorSetScope
					errStr = strings.TrimPrefix(expstr, magicErrorSetScope)
					expstr = errStr
					failSetScope = true
				}
				if strings.HasPrefix(expstr, magicErrorUnify) {
					errMagic = magicErrorUnify
					errStr = strings.TrimPrefix(expstr, magicErrorUnify)
					expstr = errStr
					failUnify = true
				}
				if strings.HasPrefix(expstr, magicErrorGraph) {
					errMagic = magicErrorGraph
					errStr = strings.TrimPrefix(expstr, magicErrorGraph)
					expstr = errStr
					failGraph = true
				}
			}
			for i, x := range expstrs { // trim the magic prefix off
				expstrs[i] = strings.TrimPrefix(x, errMagic)
			}
			foundErr := func(s string) bool {
				for _, x := range expstrs {
					if x == s {
						return true // matched!
					}
				}
				return false // unexpected
			}

			fail := errStr != ""
			expstr = strings.Trim(expstr, "\n")

			t.Logf("\n\ntest #%d (%s) ----------------\npath: %s\n\n", index, name, src)

			logf := func(format string, v ...interface{}) {
				t.Logf(fmt.Sprintf("test #%d", index)+": "+format, v...)
			}
			mmFs := afero.NewMemMapFs()
			afs := &afero.Afero{Fs: mmFs} // wrap to implement the fs API's
			fs := &util.AferoFs{Afero: afs}

			variables := map[string]interfaces.Expr{
				"purpleidea": &ast.ExprStr{V: "hello world!"}, // james says hi
				// TODO: change to a func when we can change hostname dynamically!
				"hostname": &ast.ExprStr{V: ""}, // NOTE: empty b/c not used
			}
			consts := ast.VarPrefixToVariablesScope(vars.ConstNamespace) // strips prefix!
			addback := vars.ConstNamespace + interfaces.ModuleSep        // add it back...
			variables, err = ast.MergeExprMaps(variables, consts, addback)
			if err != nil {
				t.Errorf("couldn't merge in consts: %+v", err)
				return
			}

			scope := &interfaces.Scope{ // global scope
				Variables: variables,
				// all the built-in top-level, core functions enter here...
				Functions: ast.FuncPrefixToFunctionsScope(""), // runs funcs.LookupPrefix
			}

			// use this variant, so that we don't copy the dir name
			// this is the equivalent to running `rsync -a src/ /`
			if err := util.CopyDiskContentsToFs(fs, src, "/", false); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: CopyDiskContentsToFs failed: %+v", index, err)
				return
			}

			// this shows us what we pulled in from the test dir:
			tree0, err := util.FsTree(fs, "/")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: FsTree failed: %+v", index, err)
				return
			}
			logf("tree:\n%s", tree0)

			input := "/"
			logf("input: %s", input)

			output, err := inputs.ParseInput(input, fs) // raw code can be passed in
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: ParseInput failed: %+v", index, err)
				return
			}
			for _, fn := range output.Workers {
				if err := fn(fs); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: worker execution failed: %+v", index, err)
					return
				}
			}
			tree, err := util.FsTree(fs, "/")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: FsTree failed: %+v", index, err)
				return
			}
			logf("tree:\n%s", tree)

			logf("main:\n%s", output.Main) // debug

			reader := bytes.NewReader(output.Main)
			xast, err := parser.LexParse(reader)
			if (!fail || !failLexParse) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: lex/parse failed with: %+v", index, err)
				return
			}
			if failLexParse && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failLexParse && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: lex/parse passed, expected fail", index)
				return
			}

			t.Logf("test #%d: AST: %+v", index, xast)

			importGraph, err := pgraph.NewGraph("importGraph")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not create graph: %+v", index, err)
				return
			}
			importVertex := &pgraph.SelfVertex{
				Name:  "",          // first node is the empty string
				Graph: importGraph, // store a reference to ourself
			}
			importGraph.AddVertex(importVertex)

			data := &interfaces.Data{
				// TODO: add missing fields here if/when needed
				Fs:       output.FS,       // formerly: fs
				FsURI:    output.FS.URI(), // formerly: fs.URI() // TODO: is this right?
				Base:     output.Base,     // base dir (absolute path) the metadata file is in
				Files:    output.Files,    // no really needed here afaict
				Imports:  importVertex,
				Metadata: output.Metadata,
				Modules:  "/" + interfaces.ModuleDirectory, // not really needed here afaict

				LexParser:       parser.LexParse,
				StrInterpolater: interpolate.StrInterpolate,
				SourceFinder:    sourceFinder,

				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("ast: "+format, v...)
				},
			}
			// some of this might happen *after* interpolate in SetScope or Unify...
			err = xast.Init(data)
			if (!fail || !failInit) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not init and validate AST: %+v", index, err)
				return
			}
			if failInit && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failInit && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions passed, expected fail", index)
				return
			}

			iast, err := xast.Interpolate()
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: interpolate failed with: %+v", index, err)
				return
			}

			// propagate the scope down through the AST...
			err = iast.SetScope(scope)
			if (!fail || !failSetScope) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not set scope: %+v", index, err)
				return
			}
			if failSetScope && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during set scope, don't run unification!
			}
			if failSetScope && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: set scope passed, expected fail", index)
				return
			}

			// apply type unification
			xlogf := func(format string, v ...interface{}) {
				logf("unification: "+format, v...)
			}
			solver, err := unification.LookupDefault()
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: solver lookup failed with: %+v", index, err)
				return
			}
			unifier := &unification.Unifier{
				AST:          iast,
				Solver:       solver,
				UnifiedState: types.NewUnifiedState(),
				Debug:        testing.Verbose(),
				Logf:         xlogf,
			}
			err = unifier.Unify(context.TODO())
			if (!fail || !failUnify) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not unify types: %+v", index, err)
				return
			}
			if failUnify && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during unification, don't run Graph!
			}
			if failUnify && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: unification passed, expected fail", index)
				return
			}

			// build the function graph
			fgraph, err := iast.Graph(interfaces.EmptyEnv()) // XXX: Ask Sam
			if (!fail || !failGraph) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions failed with: %+v", index, err)
				return
			}
			if failGraph && err != nil { // can't process graph if it's nil
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failGraph && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions passed, expected fail", index)
				return
			}

			t.Logf("test #%d: graph: %s", index, fgraph)
			for i, v := range fgraph.Vertices() {
				t.Logf("test #%d: vertex(%d): %+v", index, i, v)
			}
			for v1 := range fgraph.Adjacency() {
				for v2, e := range fgraph.Adjacency()[v1] {
					t.Logf("test #%d: edge(%+v): %+v -> %+v", index, e, v1, v2)
				}
			}
			if runGraphviz {
				t.Logf("test #%d: Running graphviz...", index)
				if err := fgraph.ExecGraphviz("/tmp/graphviz.dot"); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: writing graph failed: %+v", index, err)
					return
				}
			}

			str := strings.Trim(fgraph.Sprint(), "\n") // text format of graph
			if expstr == magicEmpty {
				expstr = ""
			}
			// XXX: something isn't consistent, and I can't figure
			// out what, so workaround this by sorting these :(
			sortHack := func(x string) string {
				l := strings.Split(x, "\n")
				sort.Strings(l)
				return strings.Join(l, "\n")
			}
			str = sortHack(str)
			expstr = sortHack(expstr)
			if expstr != str {
				if overwriteTest(t, index, txtarFile, archive, str) {
					return
				}

				t.Errorf("test #%d: FAIL\n\n", index)
				t.Logf("test #%d:   actual (g1):\n%s\n\n", index, str)
				t.Logf("test #%d: expected (g2):\n%s\n\n", index, expstr)
				diff := pretty.Compare(str, expstr)
				if diff != "" { // bonus
					t.Logf("test #%d: diff:\n%s", index, diff)
				}
				return
			}

			for i, v := range fgraph.Vertices() {
				t.Logf("test #%d: vertex(%d): %+v", index, i, v)
			}
			for v1 := range fgraph.Adjacency() {
				for v2, e := range fgraph.Adjacency()[v1] {
					t.Logf("test #%d: edge(%+v): %+v -> %+v", index, e, v1, v2)
				}
			}
		})
	}
	if testing.Short() {
		t.Skip("skipping all tests...")
	}
}

// TestAstFunc2 is a more advanced version which pulls code from physical dirs.
// It also briefly runs the function engine and captures output. Only use with
// stable, static output.
func TestAstFunc2(t *testing.T) {
	const magicError = "# err: "
	const magicErrorLexParse = "errLexParse: "
	const magicErrorInit = "errInit: "
	const magicInterpolate = "errInterpolate: "
	const magicErrorSetScope = "errSetScope: "
	const magicErrorUnify = "errUnify: "
	const magicErrorGraph = "errGraph: "
	const magicErrorStream = "errStream: "
	const magicErrorInterpret = "errInterpret: "
	const magicErrorAutoEdge = "errAutoEdge: "
	const magicEmpty = "# empty!"
	dir, err := util.TestDirFull()
	if err != nil {
		t.Errorf("could not get tests directory: %+v", err)
		return
	}
	t.Logf("tests directory is: %s", dir)

	type test struct { // an individual test
		name string
		path string // relative txtar path inside tests dir
	}
	testCases := []test{}

	// build test array automatically from reading the dir
	files, err := os.ReadDir(dir)
	if err != nil {
		t.Errorf("could not read through tests directory: %+v", err)
		return
	}
	sorted := []string{}
	for _, f := range files {
		if f.IsDir() {
			continue
		}
		if !strings.HasSuffix(f.Name(), ".txtar") {
			continue
		}

		sorted = append(sorted, f.Name())
	}
	sort.Strings(sorted)
	for _, f := range sorted {
		// add automatic test case
		testCases = append(testCases, test{
			name: fmt.Sprintf("%s", f),
			path: f, // <something>.txtar
		})
	}

	if testing.Short() {
		t.Logf("available tests:")
	}
	names := []string{}
	for index, tc := range testCases { // run all the tests
		if tc.name == "" {
			t.Errorf("test #%d: not named", index)
			continue
		}
		if util.StrInList(tc.name, names) {
			t.Errorf("test #%d: duplicate sub test name of: %s", index, tc.name)
			continue
		}
		names = append(names, tc.name)

		//if index != 3 { // hack to run a subset (useful for debugging)
		//if tc.name != "simple operators" {
		//	continue
		//}

		testName := fmt.Sprintf("test #%d (%s)", index, tc.name)
		if testing.Short() { // make listing tests easier
			t.Logf("%s", testName)
			continue
		}
		t.Run(testName, func(t *testing.T) {
			name, path := tc.name, tc.path
			tmpdir := t.TempDir() // gets cleaned up at end, new dir for each call
			src := tmpdir         // location of the test
			txtarFile := dir + path

			archive, err := txtar.ParseFile(txtarFile)
			if err != nil {
				t.Errorf("err parsing txtar(%s): %+v", txtarFile, err)
				return
			}
			comment := strings.TrimSpace(string(archive.Comment))
			if comment != "" {
				t.Logf("comment: %s\n", comment)
			}

			sources := map[string][]byte{}
			sourceFinder := func(path string) ([]byte, error) {
				if b, exists := sources[path]; exists {
					return b, nil
				}
				return nil, os.ErrNotExist
			}
			// copy files out into the test temp directory
			var testOutput []byte
			var testConfig []byte
			found := false
			for _, file := range archive.Files {
				sources["/"+file.Name] = file.Data // store!
				if file.Name == "OUTPUT" {
					testOutput = file.Data
					found = true
					continue
				}
				if file.Name == "CONFIG" {
					testConfig = file.Data
					continue
				}

				name := filepath.Join(tmpdir, file.Name)
				dir := filepath.Dir(name)
				if err := os.MkdirAll(dir, 0770); err != nil {
					t.Errorf("err making dir(%s): %+v", dir, err)
					return
				}
				if err := os.WriteFile(name, file.Data, 0660); err != nil {
					t.Errorf("err writing file(%s): %+v", name, err)
					return
				}
			}

			var c ConfigProperties // add pointer to get nil if empty
			if len(testConfig) > 0 {
				if err := json.Unmarshal(testConfig, &c); err != nil {
					t.Errorf("err parsing txtar(%s) config: %+v", txtarFile, err)
					return
				}
			}
			if testing.Verbose() {
				t.Logf("config: %+v", c)
			}

			testMutex.Lock()               // global
			count := testCounter[t.Name()] // global
			testCounter[t.Name()]++
			testMutex.Unlock()

			if c.MaximumCount != 0 && count >= c.MaximumCount {
				if count == c.MaximumCount { // logf once
					t.Logf("Skipping test after count: %d", count)
				}
				return
			}

			if !found { // skip missing tests
				return
			}

			expstr := string(testOutput) // expected graph
			expstrs := []string{}

			// if the graph file has a magic error string, it's a failure
			errStr := ""
			errMagic := ""
			failLexParse := false
			failInit := false
			failInterpolate := false
			failSetScope := false
			failUnify := false
			failGraph := false
			failStream := false
			failInterpret := false
			failAutoEdge := false
			if strings.HasPrefix(expstr, magicError) {
				expstrs = strings.Split(expstr, "\n")
				for i := len(expstrs) - 1; i >= 0; i-- { // reverse
					if strings.TrimSpace(expstrs[i]) == "" {
						expstrs = append(expstrs[:i], expstrs[i+1:]...) // remove it (from the end)
						continue
					}
					expstrs[i] = strings.TrimPrefix(expstrs[i], magicError) // trim the magic prefix off
				}
				errStr = strings.TrimPrefix(expstr, magicError)
				expstr = errStr

				if strings.HasPrefix(expstr, magicErrorLexParse) {
					errMagic = magicErrorLexParse
					errStr = strings.TrimPrefix(expstr, magicErrorLexParse)
					expstr = errStr
					failLexParse = true
				}
				if strings.HasPrefix(expstr, magicErrorInit) {
					errMagic = magicErrorInit
					errStr = strings.TrimPrefix(expstr, magicErrorInit)
					expstr = errStr
					failInit = true
				}
				if strings.HasPrefix(expstr, magicInterpolate) {
					errMagic = magicInterpolate
					errStr = strings.TrimPrefix(expstr, magicInterpolate)
					expstr = errStr
					failInterpolate = true
				}
				if strings.HasPrefix(expstr, magicErrorSetScope) {
					errMagic = magicErrorSetScope
					errStr = strings.TrimPrefix(expstr, magicErrorSetScope)
					expstr = errStr
					failSetScope = true
				}
				if strings.HasPrefix(expstr, magicErrorUnify) {
					errMagic = magicErrorUnify
					errStr = strings.TrimPrefix(expstr, magicErrorUnify)
					expstr = errStr
					failUnify = true
				}
				if strings.HasPrefix(expstr, magicErrorGraph) {
					errMagic = magicErrorGraph
					errStr = strings.TrimPrefix(expstr, magicErrorGraph)
					expstr = errStr
					failGraph = true
				}
				if strings.HasPrefix(expstr, magicErrorStream) {
					errMagic = magicErrorStream
					errStr = strings.TrimPrefix(expstr, magicErrorStream)
					expstr = errStr
					failStream = true
				}
				if strings.HasPrefix(expstr, magicErrorInterpret) {
					errMagic = magicErrorInterpret
					errStr = strings.TrimPrefix(expstr, magicErrorInterpret)
					expstr = errStr
					failInterpret = true
				}
				if strings.HasPrefix(expstr, magicErrorAutoEdge) {
					errMagic = magicErrorAutoEdge
					errStr = strings.TrimPrefix(expstr, magicErrorAutoEdge)
					expstr = errStr
					failAutoEdge = true
				}
			}
			for i, x := range expstrs { // trim the magic prefix off
				expstrs[i] = strings.TrimPrefix(x, errMagic)
			}
			foundErr := func(s string) bool {
				for _, x := range expstrs {
					if x == s {
						return true // matched!
					}
				}
				return false // unexpected
			}

			fail := errStr != ""
			expstr = strings.Trim(expstr, "\n")

			t.Logf("\n\ntest #%d (%s) ----------------\npath: %s\n\n", index, name, src)

			logf := func(format string, v ...interface{}) {
				t.Logf(fmt.Sprintf("test #%d", index)+": "+format, v...)
			}
			mmFs := afero.NewMemMapFs()
			afs := &afero.Afero{Fs: mmFs} // wrap to implement the fs API's
			fs := &util.AferoFs{Afero: afs}

			// implementation of the Local API (we only expect just this single one)
			localAPI := (&local.API{
				Prefix: fmt.Sprintf("%s/", filepath.Join(tmpdir, "local")),
				Debug:  testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("local: api: "+format, v...)
				},
			}).Init()

			// implementation of the World API (alternatives can be substituted in)
			var world engine.World
			world = &etcd.World{
				//Hostname: hostname,
				Client: etcdClient.NewClientFromClient(nil), // stub
				//MetadataPrefix: /fs, // MetadataPrefix
				//StoragePrefix:  "/storage", // StoragePrefix
				// TODO: is this correct? (seems to work for testing)
				StandaloneFs: fs, // used for static deploys
			}
			worldInit := &engine.WorldInit{
				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("world: etcd: "+format, v...)
				},
			}
			if err := world.Init(worldInit); err != nil {
				t.Errorf("world Init failed: %+v", err)
				return
			}
			defer func() {
				err := errwrap.Wrapf(world.Close(), "world Close failed")
				if err != nil {
					t.Errorf("close error: %+v", err)
				}
			}()

			variables := map[string]interfaces.Expr{
				"purpleidea": &ast.ExprStr{V: "hello world!"}, // james says hi
				// TODO: change to a func when we can change hostname dynamically!
				"hostname": &ast.ExprStr{V: ""}, // NOTE: empty b/c not used
			}
			consts := ast.VarPrefixToVariablesScope(vars.ConstNamespace) // strips prefix!
			addback := vars.ConstNamespace + interfaces.ModuleSep        // add it back...
			variables, err = ast.MergeExprMaps(variables, consts, addback)
			if err != nil {
				t.Errorf("couldn't merge in consts: %+v", err)
				return
			}

			scope := &interfaces.Scope{ // global scope
				Variables: variables,
				// all the built-in top-level, core functions enter here...
				Functions: ast.FuncPrefixToFunctionsScope(""), // runs funcs.LookupPrefix
			}

			// use this variant, so that we don't copy the dir name
			// this is the equivalent to running `rsync -a src/ /`
			if err := util.CopyDiskContentsToFs(fs, src, "/", false); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: CopyDiskContentsToFs failed: %+v", index, err)
				return
			}

			// this shows us what we pulled in from the test dir:
			tree0, err := util.FsTree(fs, "/")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: FsTree failed: %+v", index, err)
				return
			}
			logf("tree:\n%s", tree0)

			input := "/"
			logf("input: %s", input)

			output, err := inputs.ParseInput(input, fs) // raw code can be passed in
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: ParseInput failed: %+v", index, err)
				return
			}
			for _, fn := range output.Workers {
				if err := fn(fs); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: worker execution failed: %+v", index, err)
					return
				}
			}
			tree, err := util.FsTree(fs, "/")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: FsTree failed: %+v", index, err)
				return
			}
			logf("tree:\n%s", tree)

			logf("main:\n%s", output.Main) // debug

			reader := bytes.NewReader(output.Main)
			xast, err := parser.LexParse(reader)
			if (!fail || !failLexParse) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: lex/parse failed with: %+v", index, err)
				return
			}
			if failLexParse && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failLexParse && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: lex/parse passed, expected fail", index)
				return
			}

			t.Logf("test #%d: AST: %+v", index, xast)

			importGraph, err := pgraph.NewGraph("importGraph")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not create graph: %+v", index, err)
				return
			}
			importVertex := &pgraph.SelfVertex{
				Name:  "",          // first node is the empty string
				Graph: importGraph, // store a reference to ourself
			}
			importGraph.AddVertex(importVertex)

			data := &interfaces.Data{
				// TODO: add missing fields here if/when needed
				Fs:       output.FS, // formerly: fs
				FsURI:    output.FS.URI(),
				Base:     output.Base,  // base dir (absolute path) the metadata file is in
				Files:    output.Files, // no really needed here afaict
				Imports:  importVertex,
				Metadata: output.Metadata,
				Modules:  "/" + interfaces.ModuleDirectory, // not really needed here afaict

				LexParser:       parser.LexParse,
				StrInterpolater: interpolate.StrInterpolate,
				SourceFinder:    sourceFinder,

				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("ast: "+format, v...)
				},
			}
			// some of this might happen *after* interpolate in SetScope or Unify...
			err = xast.Init(data)
			if (!fail || !failInit) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not init and validate AST: %+v", index, err)
				return
			}
			if failInit && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failInit && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: Init passed, expected fail", index)
				return
			}

			iast, err := xast.Interpolate()
			if (!fail || !failInterpolate) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: Interpolate failed with: %+v", index, err)
				return
			}
			if failInterpolate && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failInterpolate && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: Interpolate passed, expected fail", index)
				return
			}

			// propagate the scope down through the AST...
			err = iast.SetScope(scope)
			if (!fail || !failSetScope) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not set scope: %+v", index, err)
				return
			}
			if failSetScope && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during set scope, don't run unification!
			}
			if failSetScope && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: set scope passed, expected fail", index)
				return
			}

			if runGraphviz {
				t.Logf("test #%d: Running graphviz after setScope...", index)

				// build a graph of the AST, to make sure everything is connected properly
				graph, err := pgraph.NewGraph("setScope")
				if err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: could not create setScope graph: %+v", index, err)
					return
				}
				ast, ok := iast.(interfaces.ScopeGrapher)
				if !ok {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: can't graph scope", index)
					return
				}
				ast.ScopeGraph(graph)

				if err := graph.ExecGraphviz("/tmp/set-scope.dot"); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: writing graph failed: %+v", index, err)
					return
				}
			}

			// apply type unification
			xlogf := func(format string, v ...interface{}) {
				logf("unification: "+format, v...)
			}
			solver, err := unification.LookupDefault()
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: solver lookup failed with: %+v", index, err)
				return
			}
			unifier := &unification.Unifier{
				AST:          iast,
				Solver:       solver,
				UnifiedState: types.NewUnifiedState(),
				Debug:        testing.Verbose(),
				Logf:         xlogf,
			}
			err = unifier.Unify(context.TODO())
			if (!fail || !failUnify) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not unify types: %+v", index, err)
				return
			}
			if failUnify && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during unification, don't run Graph!
			}
			if failUnify && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: unification passed, expected fail", index)
				return
			}
			// XXX: Should we do a kind of SetType on resources here
			// to tell the ones with variant fields what their
			// concrete field types are? They should only be dynamic
			// in implementation and before unification, and static
			// once we've unified the specific resource.

			// build the env
			//fgraph := &pgraph.Graph{Name: "functionGraph"}
			env := interfaces.EmptyEnv()
			// XXX: Do we need to do something like this?
			//for k, v := range scope.Variables {
			//	g, builtinFunc, err := v.Graph(nil)
			//	if err != nil {
			//		t.Errorf("test #%d: FAIL", index)
			//		t.Errorf("test #%d: calling Graph on builtins errored: %+v", index, err)
			//		return
			//	}
			//	fgraph.AddGraph(g)
			//	env.Variables[k] = builtinFunc // XXX: Ask Sam (.Functions ???)
			//}
			//for k, closure := range scope.Functions {
			//	env.Functions[k] = &interfaces.Closure{
			//		Env: interfaces.EmptyEnv(),
			//		Expr: closure.Expr, // XXX: Ask Sam
			//	}
			//}

			// build the function graph
			fgraph, err := iast.Graph(env) // XXX: Ask Sam
			if (!fail || !failGraph) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions failed with: %+v", index, err)
				return
			}
			if failGraph && err != nil { // can't process graph if it's nil
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failGraph && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions passed, expected fail", index)
				return
			}

			if fgraph.NumVertices() == 0 { // no funcs to load!
				//t.Errorf("test #%d: FAIL", index)
				t.Logf("test #%d: function graph is empty", index)
				//return // let's test the engine on empty
			}

			t.Logf("test #%d: graph: %s", index, fgraph)
			for i, v := range fgraph.Vertices() {
				t.Logf("test #%d: vertex(%d): %+v", index, i, v)
			}
			for v1 := range fgraph.Adjacency() {
				for v2, e := range fgraph.Adjacency()[v1] {
					t.Logf("test #%d: edge(%+v): %+v -> %+v", index, e, v1, v2)
				}
			}

			if runGraphviz {
				t.Logf("test #%d: Running graphviz...", index)
				if err := fgraph.ExecGraphviz("/tmp/graphviz.dot"); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: writing graph failed: %+v", index, err)
					return
				}
			}

			// run the function engine once to get some real output
			funcs := &dage.Engine{
				Name:     "test",
				Hostname: "",       // NOTE: empty b/c not used
				Local:    localAPI, // used partially in some tests
				World:    world,    // used partially in some tests
				//Prefix:   fmt.Sprintf("%s/", filepath.Join(tmpdir, "funcs")),
				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("funcs: "+format, v...)
				},
			}

			logf("function engine initializing...")
			if err := funcs.Setup(); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: init error with func engine: %+v", index, err)
				return
			}
			defer funcs.Cleanup()

			// XXX: can we type check things somehow?
			//logf("function engine validating...")
			//if err := funcs.Validate(); err != nil {
			//	t.Errorf("test #%d: FAIL", index)
			//	t.Errorf("test #%d: validate error with func engine: %+v", index, err)
			//	return
			//}

			logf("function engine starting...")
			wg := &sync.WaitGroup{}
			defer wg.Wait()
			ctx, cancel := context.WithCancel(context.Background())
			defer cancel()
			wg.Add(1)
			go func() {
				defer wg.Done()
				if err := funcs.Run(ctx); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: run error with func engine: %+v", index, err)
					return
				}
			}()

			//wg.Add(1)
			//go func() { // XXX: debugging
			//	defer wg.Done()
			//	for {
			//		select {
			//		case <-time.After(100 * time.Millisecond): // blocked functions
			//			t.Logf("test #%d: graphviz...", index)
			//			funcs.Graphviz("") // log to /tmp/...
			//
			//		case <-ctx.Done():
			//			return
			//		}
			//	}
			//}()

			<-funcs.Started() // wait for startup (will not block forever)

			// Sanity checks for graph size.
			if count := funcs.NumVertices(); count != 0 {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: expected empty graph on start, got %d vertices", index, count)
			}
			defer func() {
				if count := funcs.NumVertices(); count != 0 {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected empty graph on exit, got %d vertices", index, count)
				}
			}()
			defer wg.Wait()
			defer cancel()

			txn := funcs.Txn()
			defer txn.Free() // remember to call Free()
			txn.AddGraph(fgraph)
			if err := txn.Commit(); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: run error with initial commit: %+v", index, err)
				return
			}
			defer txn.Reverse() // should remove everything we added

			isEmpty := make(chan struct{})
			if fgraph.NumVertices() == 0 { // no funcs to load!
				close(isEmpty)
			}

			// wait for some activity
			logf("stream...")
			stream := funcs.Stream()
			//select {
			//case err, ok := <-stream:
			//	if !ok {
			//		t.Errorf("test #%d: FAIL", index)
			//		t.Errorf("test #%d: stream closed", index)
			//		return
			//	}
			//	if err != nil {
			//		t.Errorf("test #%d: FAIL", index)
			//		t.Errorf("test #%d: stream errored: %+v", index, err)
			//		return
			//	}
			//
			//case <-time.After(60 * time.Second): // blocked functions
			//	t.Errorf("test #%d: FAIL", index)
			//	t.Errorf("test #%d: stream timeout", index)
			//	return
			//}

			// sometimes the <-stream seems to constantly (or for a
			// long time?) win the races against the <-time.After(),
			// so add some limit to how many times we need to stream
			max := 1
		Loop:
			for {
				select {
				case err, ok := <-stream:
					if !ok {
						t.Errorf("test #%d: FAIL", index)
						t.Errorf("test #%d: stream closed", index)
						return
					}
					if err != nil {
						if (!fail || !failStream) && err != nil {
							t.Errorf("test #%d: FAIL", index)
							t.Errorf("test #%d: stream errored: %+v", index, err)
							return
						}
						if failStream && err != nil {
							t.Logf("test #%d: stream errored: %+v", index, err)
							// Stream errors often have pointers in them, so don't compare for now.
							//s := err.Error() // convert to string
							//if !foundErr(s) {
							//	t.Errorf("test #%d: FAIL", index)
							//	t.Errorf("test #%d: expected different error", index)
							//	t.Logf("test #%d: err: %s", index, s)
							//	t.Logf("test #%d: exp: %s", index, expstr)
							//}
							return
						}
						if failStream && err == nil {
							t.Errorf("test #%d: FAIL", index)
							t.Errorf("test #%d: stream passed, expected fail", index)
							return
						}
						return
					}
					t.Logf("test #%d: got stream event!", index)
					max--
					if max == 0 {
						break Loop
					}

				case <-isEmpty:
					break Loop

				case <-time.After(10 * time.Second): // blocked functions
					t.Errorf("test #%d: unblocking because no event was sent by the function engine for a while", index)
					break Loop

				case <-time.After(60 * time.Second): // blocked functions
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: stream timeout", index)
					return
				}
			}

			t.Logf("test #%d: %s", index, funcs.Stats())

			// run interpret!
			table := funcs.Table() // map[interfaces.Func]types.Value

			interpreter := &interpret.Interpreter{
				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("interpret: "+format, v...)
				},
			}

			ograph, err := interpreter.Interpret(iast, table)
			if (!fail || !failInterpret) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: interpret failed with: %+v", index, err)
				return
			}
			if failInterpret && err != nil { // can't process graph if it's nil
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failInterpret && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: interpret passed, expected fail", index)
				return
			}

			// add automatic edges...
			err = autoedge.AutoEdge(ograph, testing.Verbose(), logf)
			if (!fail || !failAutoEdge) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: automatic edges failed with: %+v", index, err)
				return
			}
			if failAutoEdge && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failAutoEdge && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: automatic edges passed, expected fail", index)
				return
			}

			// TODO: perform autogrouping?

			t.Logf("test #%d: graph: %+v", index, ograph)
			str := strings.Trim(ograph.Sprint(), "\n") // text format of output graph
			if expstr == magicEmpty {
				expstr = ""
			}
			// XXX: something isn't consistent, and I can't figure
			// out what, so workaround this by sorting these :(
			sortHack := func(x string) string {
				l := strings.Split(x, "\n")
				sort.Strings(l)
				return strings.Join(l, "\n")
			}
			str = sortHack(str)
			expstr = sortHack(expstr)
			if expstr != str {
				if overwriteTest(t, index, txtarFile, archive, str) {
					return
				}

				t.Errorf("test #%d: FAIL\n\n", index)
				t.Logf("test #%d:   actual (g1):\n%s\n\n", index, str)
				t.Logf("test #%d: expected (g2):\n%s\n\n", index, expstr)
				diff := pretty.Compare(str, expstr)
				if diff != "" { // bonus
					t.Logf("test #%d: diff:\n%s", index, diff)
				}
				return
			}

			for i, v := range ograph.Vertices() {
				t.Logf("test #%d: vertex(%d): %+v", index, i, v)
			}
			for v1 := range ograph.Adjacency() {
				for v2, e := range ograph.Adjacency()[v1] {
					t.Logf("test #%d: edge(%+v): %+v -> %+v", index, e, v1, v2)
				}
			}

			if !t.Failed() {
				t.Logf("test #%d: Passed!", index)
			}
		})
	}
	if testing.Short() {
		t.Skip("skipping all tests...")
	}
}

// TestAstFunc3 is an even more advanced version which also examines parameter
// values. It briefly runs the function engine and captures output. Only use
// with stable, static output. It also briefly runs the resource engine too!
func TestAstFunc3(t *testing.T) {
	const magicError = "# err: "
	const magicErrorLexParse = "errLexParse: "
	const magicErrorInit = "errInit: "
	const magicInterpolate = "errInterpolate: "
	const magicErrorSetScope = "errSetScope: "
	const magicErrorUnify = "errUnify: "
	const magicErrorGraph = "errGraph: "
	const magicErrorInterpret = "errInterpret: "
	const magicErrorAutoEdge = "errAutoEdge: "
	const magicErrorValidate = "errValidate: "
	const magicEmpty = "# empty!"
	dir, err := util.TestDirFull()
	if err != nil {
		t.Errorf("could not get tests directory: %+v", err)
		return
	}
	t.Logf("tests directory is: %s", dir)

	type test struct { // an individual test
		name string
		path string // relative txtar path inside tests dir
	}
	testCases := []test{}

	// build test array automatically from reading the dir
	files, err := os.ReadDir(dir)
	if err != nil {
		t.Errorf("could not read through tests directory: %+v", err)
		return
	}
	sorted := []string{}
	for _, f := range files {
		if f.IsDir() {
			continue
		}
		if !strings.HasSuffix(f.Name(), ".txtar") {
			continue
		}

		sorted = append(sorted, f.Name())
	}
	sort.Strings(sorted)
	for _, f := range sorted {
		// add automatic test case
		testCases = append(testCases, test{
			name: fmt.Sprintf("%s", f),
			path: f, // <something>.txtar
		})
	}

	if testing.Short() {
		t.Logf("available tests:")
	}
	names := []string{}
	for index, tc := range testCases { // run all the tests
		if tc.name == "" {
			t.Errorf("test #%d: not named", index)
			continue
		}
		if util.StrInList(tc.name, names) {
			t.Errorf("test #%d: duplicate sub test name of: %s", index, tc.name)
			continue
		}
		names = append(names, tc.name)

		//if index != 3 { // hack to run a subset (useful for debugging)
		//if tc.name != "simple operators" {
		//	continue
		//}

		testName := fmt.Sprintf("test #%d (%s)", index, tc.name)
		if testing.Short() { // make listing tests easier
			t.Logf("%s", testName)
			continue
		}
		t.Run(testName, func(t *testing.T) {
			name, path := tc.name, tc.path
			tmpdir := t.TempDir() // gets cleaned up at end, new dir for each call
			src := tmpdir         // location of the test
			txtarFile := dir + path

			archive, err := txtar.ParseFile(txtarFile)
			if err != nil {
				t.Errorf("err parsing txtar(%s): %+v", txtarFile, err)
				return
			}
			comment := strings.TrimSpace(string(archive.Comment))
			if comment != "" {
				t.Logf("comment: %s\n", comment)
			}

			sources := map[string][]byte{}
			sourceFinder := func(path string) ([]byte, error) {
				if b, exists := sources[path]; exists {
					return b, nil
				}
				return nil, os.ErrNotExist
			}
			// copy files out into the test temp directory
			var testOutput []byte
			var testConfig []byte
			found := false
			for _, file := range archive.Files {
				sources["/"+file.Name] = file.Data // store!
				if file.Name == "OUTPUT" {
					testOutput = file.Data
					found = true
					continue
				}
				if file.Name == "CONFIG" {
					testConfig = file.Data
					continue
				}

				name := filepath.Join(tmpdir, file.Name)
				dir := filepath.Dir(name)
				if err := os.MkdirAll(dir, 0770); err != nil {
					t.Errorf("err making dir(%s): %+v", dir, err)
					return
				}
				if err := os.WriteFile(name, file.Data, 0660); err != nil {
					t.Errorf("err writing file(%s): %+v", name, err)
					return
				}
			}

			var c ConfigProperties // add pointer to get nil if empty
			if len(testConfig) > 0 {
				if err := json.Unmarshal(testConfig, &c); err != nil {
					t.Errorf("err parsing txtar(%s) config: %+v", txtarFile, err)
					return
				}
			}
			if testing.Verbose() {
				t.Logf("config: %+v", c)
			}

			testMutex.Lock()               // global
			count := testCounter[t.Name()] // global
			testCounter[t.Name()]++
			testMutex.Unlock()

			if c.MaximumCount != 0 && count >= c.MaximumCount {
				if count == c.MaximumCount { // logf once
					t.Logf("Skipping test after count: %d", count)
				}
				return
			}

			if !found { // skip missing tests
				return
			}

			expstr := string(testOutput) // expected graph
			expstrs := []string{}

			// if the graph file has a magic error string, it's a failure
			errStr := ""
			errMagic := ""
			failLexParse := false
			failInit := false
			failInterpolate := false
			failSetScope := false
			failUnify := false
			failGraph := false
			failInterpret := false
			failAutoEdge := false
			failValidate := false
			if strings.HasPrefix(expstr, magicError) {
				expstrs = strings.Split(expstr, "\n")
				for i := len(expstrs) - 1; i >= 0; i-- { // reverse
					if strings.TrimSpace(expstrs[i]) == "" {
						expstrs = append(expstrs[:i], expstrs[i+1:]...) // remove it (from the end)
						continue
					}
					expstrs[i] = strings.TrimPrefix(expstrs[i], magicError) // trim the magic prefix off
				}
				errStr = strings.TrimPrefix(expstr, magicError)
				expstr = errStr

				if strings.HasPrefix(expstr, magicErrorLexParse) {
					errMagic = magicErrorLexParse
					errStr = strings.TrimPrefix(expstr, magicErrorLexParse)
					expstr = errStr
					failLexParse = true
				}
				if strings.HasPrefix(expstr, magicErrorInit) {
					errMagic = magicErrorInit
					errStr = strings.TrimPrefix(expstr, magicErrorInit)
					expstr = errStr
					failInit = true
				}
				if strings.HasPrefix(expstr, magicInterpolate) {
					errMagic = magicInterpolate
					errStr = strings.TrimPrefix(expstr, magicInterpolate)
					expstr = errStr
					failInterpolate = true
				}
				if strings.HasPrefix(expstr, magicErrorSetScope) {
					errMagic = magicErrorSetScope
					errStr = strings.TrimPrefix(expstr, magicErrorSetScope)
					expstr = errStr
					failSetScope = true
				}
				if strings.HasPrefix(expstr, magicErrorUnify) {
					errMagic = magicErrorUnify
					errStr = strings.TrimPrefix(expstr, magicErrorUnify)
					expstr = errStr
					failUnify = true
				}
				if strings.HasPrefix(expstr, magicErrorGraph) {
					errMagic = magicErrorGraph
					errStr = strings.TrimPrefix(expstr, magicErrorGraph)
					expstr = errStr
					failGraph = true
				}
				if strings.HasPrefix(expstr, magicErrorInterpret) {
					errMagic = magicErrorInterpret
					errStr = strings.TrimPrefix(expstr, magicErrorInterpret)
					expstr = errStr
					failInterpret = true
				}
				if strings.HasPrefix(expstr, magicErrorAutoEdge) {
					errMagic = magicErrorAutoEdge
					errStr = strings.TrimPrefix(expstr, magicErrorAutoEdge)
					expstr = errStr
					failAutoEdge = true
				}
				if strings.HasPrefix(expstr, magicErrorValidate) {
					errMagic = magicErrorValidate
					errStr = strings.TrimPrefix(expstr, magicErrorValidate)
					expstr = errStr
					failValidate = true
				}
			}
			for i, x := range expstrs { // trim the magic prefix off
				expstrs[i] = strings.TrimPrefix(x, errMagic)
			}
			foundErr := func(s string) bool {
				for _, x := range expstrs {
					if x == s {
						return true // matched!
					}
				}
				return false // unexpected
			}

			fail := errStr != ""
			expstr = strings.Trim(expstr, "\n")

			t.Logf("\n\ntest #%d (%s) ----------------\npath: %s\n\n", index, name, src)

			logf := func(format string, v ...interface{}) {
				t.Logf(fmt.Sprintf("test #%d", index)+": "+format, v...)
			}
			mmFs := afero.NewMemMapFs()
			afs := &afero.Afero{Fs: mmFs} // wrap to implement the fs API's
			fs := &util.AferoFs{Afero: afs}

			// implementation of the Local API (we only expect just this single one)
			localAPI := (&local.API{
				Prefix: fmt.Sprintf("%s/", filepath.Join(tmpdir, "local")),
				Debug:  testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("local: api: "+format, v...)
				},
			}).Init()

			// implementation of the World API (alternatives can be substituted in)
			var world engine.World
			world = &etcd.World{
				//Hostname: hostname,
				Client: etcdClient.NewClientFromClient(nil), // stub
				//MetadataPrefix: /fs, // MetadataPrefix
				//StoragePrefix:  "/storage", // StoragePrefix
				// TODO: is this correct? (seems to work for testing)
				StandaloneFs: fs, // used for static deploys
			}
			worldInit := &engine.WorldInit{
				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("world: etcd: "+format, v...)
				},
			}
			if err := world.Init(worldInit); err != nil {
				t.Errorf("world Init failed: %+v", err)
				return
			}
			defer func() {
				err := errwrap.Wrapf(world.Close(), "world Close failed")
				if err != nil {
					t.Errorf("close error: %+v", err)
				}
			}()

			variables := map[string]interfaces.Expr{
				"purpleidea": &ast.ExprStr{V: "hello world!"}, // james says hi
				// TODO: change to a func when we can change hostname dynamically!
				"hostname": &ast.ExprStr{V: ""}, // NOTE: empty b/c not used
			}
			consts := ast.VarPrefixToVariablesScope(vars.ConstNamespace) // strips prefix!
			addback := vars.ConstNamespace + interfaces.ModuleSep        // add it back...
			variables, err = ast.MergeExprMaps(variables, consts, addback)
			if err != nil {
				t.Errorf("couldn't merge in consts: %+v", err)
				return
			}

			scope := &interfaces.Scope{ // global scope
				Variables: variables,
				// all the built-in top-level, core functions enter here...
				Functions: ast.FuncPrefixToFunctionsScope(""), // runs funcs.LookupPrefix
			}

			// use this variant, so that we don't copy the dir name
			// this is the equivalent to running `rsync -a src/ /`
			if err := util.CopyDiskContentsToFs(fs, src, "/", false); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: CopyDiskContentsToFs failed: %+v", index, err)
				return
			}

			// this shows us what we pulled in from the test dir:
			tree0, err := util.FsTree(fs, "/")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: FsTree failed: %+v", index, err)
				return
			}
			logf("tree:\n%s", tree0)

			input := "/"
			logf("input: %s", input)

			output, err := inputs.ParseInput(input, fs) // raw code can be passed in
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: ParseInput failed: %+v", index, err)
				return
			}
			for _, fn := range output.Workers {
				if err := fn(fs); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: worker execution failed: %+v", index, err)
					return
				}
			}
			tree, err := util.FsTree(fs, "/")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: FsTree failed: %+v", index, err)
				return
			}
			logf("tree:\n%s", tree)

			logf("main:\n%s", output.Main) // debug

			reader := bytes.NewReader(output.Main)
			xast, err := parser.LexParse(reader)
			if (!fail || !failLexParse) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: lex/parse failed with: %+v", index, err)
				return
			}
			if failLexParse && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failLexParse && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: lex/parse passed, expected fail", index)
				return
			}

			t.Logf("test #%d: AST: %+v", index, xast)

			importGraph, err := pgraph.NewGraph("importGraph")
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not create graph: %+v", index, err)
				return
			}
			importVertex := &pgraph.SelfVertex{
				Name:  "",          // first node is the empty string
				Graph: importGraph, // store a reference to ourself
			}
			importGraph.AddVertex(importVertex)

			data := &interfaces.Data{
				// TODO: add missing fields here if/when needed
				Fs:       output.FS, // formerly: fs
				FsURI:    output.FS.URI(),
				Base:     output.Base,  // base dir (absolute path) the metadata file is in
				Files:    output.Files, // no really needed here afaict
				Imports:  importVertex,
				Metadata: output.Metadata,
				Modules:  "/" + interfaces.ModuleDirectory, // not really needed here afaict

				LexParser:       parser.LexParse,
				StrInterpolater: interpolate.StrInterpolate,
				SourceFinder:    sourceFinder,

				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("ast: "+format, v...)
				},
			}
			// some of this might happen *after* interpolate in SetScope or Unify...
			err = xast.Init(data)
			if (!fail || !failInit) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not init and validate AST: %+v", index, err)
				return
			}
			if failInit && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failInit && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: Init passed, expected fail", index)
				return
			}

			iast, err := xast.Interpolate()
			if (!fail || !failInterpolate) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: Interpolate failed with: %+v", index, err)
				return
			}
			if failInterpolate && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during lex parse, don't run init/interpolate!
			}
			if failInterpolate && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: Interpolate passed, expected fail", index)
				return
			}

			// propagate the scope down through the AST...
			err = iast.SetScope(scope)
			if (!fail || !failSetScope) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not set scope: %+v", index, err)
				return
			}
			if failSetScope && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during set scope, don't run unification!
			}
			if failSetScope && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: set scope passed, expected fail", index)
				return
			}

			if runGraphviz {
				t.Logf("test #%d: Running graphviz after setScope...", index)

				// build a graph of the AST, to make sure everything is connected properly
				graph, err := pgraph.NewGraph("setScope")
				if err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: could not create setScope graph: %+v", index, err)
					return
				}
				ast, ok := iast.(interfaces.ScopeGrapher)
				if !ok {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: can't graph scope", index)
					return
				}
				ast.ScopeGraph(graph)

				if err := graph.ExecGraphviz("/tmp/set-scope.dot"); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: writing graph failed: %+v", index, err)
					return
				}
			}

			// apply type unification
			xlogf := func(format string, v ...interface{}) {
				logf("unification: "+format, v...)
			}
			solver, err := unification.LookupDefault()
			if err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: solver lookup failed with: %+v", index, err)
				return
			}
			unifier := &unification.Unifier{
				AST:          iast,
				Solver:       solver,
				UnifiedState: types.NewUnifiedState(),
				Debug:        testing.Verbose(),
				Logf:         xlogf,
			}
			err = unifier.Unify(context.TODO())
			if (!fail || !failUnify) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: could not unify types: %+v", index, err)
				return
			}
			if failUnify && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return // fail happened during unification, don't run Graph!
			}
			if failUnify && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: unification passed, expected fail", index)
				return
			}
			// XXX: Should we do a kind of SetType on resources here
			// to tell the ones with variant fields what their
			// concrete field types are? They should only be dynamic
			// in implementation and before unification, and static
			// once we've unified the specific resource.

			// build the function graph
			fgraph, err := iast.Graph(interfaces.EmptyEnv()) // XXX: Ask Sam
			if (!fail || !failGraph) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions failed with: %+v", index, err)
				return
			}
			if failGraph && err != nil { // can't process graph if it's nil
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failGraph && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: functions passed, expected fail", index)
				return
			}

			if fgraph.NumVertices() == 0 { // no funcs to load!
				//t.Errorf("test #%d: FAIL", index)
				t.Logf("test #%d: function graph is empty", index)
				//return // let's test the engine on empty
			}

			t.Logf("test #%d: graph: %s", index, fgraph)
			for i, v := range fgraph.Vertices() {
				t.Logf("test #%d: vertex(%d): %+v", index, i, v)
			}
			for v1 := range fgraph.Adjacency() {
				for v2, e := range fgraph.Adjacency()[v1] {
					t.Logf("test #%d: edge(%+v): %+v -> %+v", index, e, v1, v2)
				}
			}

			if runGraphviz {
				t.Logf("test #%d: Running graphviz...", index)
				if err := fgraph.ExecGraphviz("/tmp/graphviz.dot"); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: writing graph failed: %+v", index, err)
					return
				}
			}

			// run the function engine once to get some real output
			funcs := &dage.Engine{
				Name:     "test",
				Hostname: "",       // NOTE: empty b/c not used
				Local:    localAPI, // used partially in some tests
				World:    world,    // used partially in some tests
				//Prefix:   fmt.Sprintf("%s/", filepath.Join(tmpdir, "funcs")),
				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("funcs: "+format, v...)
				},
			}

			logf("function engine initializing...")
			if err := funcs.Setup(); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: init error with func engine: %+v", index, err)
				return
			}
			defer funcs.Cleanup()

			// XXX: can we type check things somehow?
			//logf("function engine validating...")
			//if err := funcs.Validate(); err != nil {
			//	t.Errorf("test #%d: FAIL", index)
			//	t.Errorf("test #%d: validate error with func engine: %+v", index, err)
			//	return
			//}

			logf("function engine starting...")
			wg := &sync.WaitGroup{}
			defer wg.Wait()
			ctx, cancel := context.WithCancel(context.Background())
			defer cancel()
			wg.Add(1)
			go func() {
				defer wg.Done()
				if err := funcs.Run(ctx); err != nil {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: run error with func engine: %+v", index, err)
					return
				}
			}()

			//wg.Add(1)
			//go func() { // XXX: debugging
			//	defer wg.Done()
			//	for {
			//		select {
			//		case <-time.After(100 * time.Millisecond): // blocked functions
			//			t.Logf("test #%d: graphviz...", index)
			//			funcs.Graphviz("") // log to /tmp/...
			//
			//		case <-ctx.Done():
			//			return
			//		}
			//	}
			//}()

			<-funcs.Started() // wait for startup (will not block forever)

			// Sanity checks for graph size.
			if count := funcs.NumVertices(); count != 0 {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: expected empty graph on start, got %d vertices", index, count)
			}
			defer func() {
				if count := funcs.NumVertices(); count != 0 {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected empty graph on exit, got %d vertices", index, count)
				}
			}()
			defer wg.Wait()
			defer cancel()

			txn := funcs.Txn()
			defer txn.Free() // remember to call Free()
			txn.AddGraph(fgraph)
			if err := txn.Commit(); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: run error with initial commit: %+v", index, err)
				return
			}
			defer txn.Reverse() // should remove everything we added

			isEmpty := make(chan struct{})
			if fgraph.NumVertices() == 0 { // no funcs to load!
				close(isEmpty)
			}

			// wait for some activity
			logf("stream...")
			stream := funcs.Stream()
			//select {
			//case err, ok := <-stream:
			//	if !ok {
			//		t.Errorf("test #%d: FAIL", index)
			//		t.Errorf("test #%d: stream closed", index)
			//		return
			//	}
			//	if err != nil {
			//		t.Errorf("test #%d: FAIL", index)
			//		t.Errorf("test #%d: stream errored: %+v", index, err)
			//		return
			//	}
			//
			//case <-time.After(60 * time.Second): // blocked functions
			//	t.Errorf("test #%d: FAIL", index)
			//	t.Errorf("test #%d: stream timeout", index)
			//	return
			//}

			// sometimes the <-stream seems to constantly (or for a
			// long time?) win the races against the <-time.After(),
			// so add some limit to how many times we need to stream
			max := 1
		Loop:
			for {
				select {
				case err, ok := <-stream:
					if !ok {
						t.Errorf("test #%d: FAIL", index)
						t.Errorf("test #%d: stream closed", index)
						return
					}
					if err != nil {
						t.Errorf("test #%d: FAIL", index)
						t.Errorf("test #%d: stream errored: %+v", index, err)
						return
					}
					t.Logf("test #%d: got stream event!", index)
					max--
					if max == 0 {
						break Loop
					}

				case <-isEmpty:
					break Loop

				case <-time.After(10 * time.Second): // blocked functions
					t.Errorf("test #%d: unblocking because no event was sent by the function engine for a while", index)
					break Loop

				case <-time.After(60 * time.Second): // blocked functions
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: stream timeout", index)
					return
				}
			}

			t.Logf("test #%d: %s", index, funcs.Stats())

			// run interpret!
			table := funcs.Table() // map[interfaces.Func]types.Value

			interpreter := &interpret.Interpreter{
				Debug: testing.Verbose(), // set via the -test.v flag to `go test`
				Logf: func(format string, v ...interface{}) {
					logf("interpret: "+format, v...)
				},
			}

			ograph, err := interpreter.Interpret(iast, table)
			if (!fail || !failInterpret) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: interpret failed with: %+v", index, err)
				return
			}
			if failInterpret && err != nil { // can't process graph if it's nil
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failInterpret && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: interpret passed, expected fail", index)
				return
			}

			// add automatic edges...
			// TODO: use ge.AutoEdge() instead?
			err = autoedge.AutoEdge(ograph, testing.Verbose(), logf)
			if (!fail || !failAutoEdge) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: automatic edges failed with: %+v", index, err)
				return
			}
			if failAutoEdge && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failAutoEdge && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: automatic edges passed, expected fail", index)
				return
			}

			// TODO: perform autogrouping?

			// TODO: perform reversals?

			t.Logf("test #%d: graph: %+v", index, ograph)

			// setup converger
			convergedTimeout := 5
			converger := converger.New(
				convergedTimeout,
			)
			converged := make(chan struct{})
			converger.AddStateFn("converged-exit", func(isConverged bool) error {
				if isConverged {
					logf("converged for %d seconds, exiting!", convergedTimeout)
					close(converged) // trigger an exit!
				}
				return nil
			})

			// TODO: waitgroup ?
			go converger.Run(true) // main loop for converger, true to start paused
			converger.Ready()      // block until ready
			defer func() {
				// TODO: shutdown converger, but make sure that using it in a
				// still running embdEtcd struct doesn't block waiting on it...
				converger.Shutdown()
			}()

			// run engine a bit so that send/recv happens
			ge := &graph.Engine{
				Program: "testing", // TODO: name it mgmt?
				//Version:   obj.Version,
				Hostname:  "localhost",
				Converger: converger,
				Local:     localAPI,
				World:     world,
				Prefix:    fmt.Sprintf("%s/", filepath.Join(tmpdir, "engine")),
				Debug:     testing.Verbose(),
				Logf: func(format string, v ...interface{}) {
					logf("engine: "+format, v...)
				},
			}
			if err := ge.Init(); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: engine Init failed with: %+v", index, err)
				return
			}
			defer func() {
				// skip errors if failValidate is true since it
				// would cause an error here too as well...
				if err := ge.Shutdown(); err != nil && !failValidate {
					// TODO: cause the final exit code to be non-zero
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: engine Shutdown failed with: %+v", index, err)
					return
				}
			}()

			if err := ge.Load(ograph); err != nil { // copy in new graph
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: error copying in new graph: %+v", index, err)
				return
			}

			err = ge.Validate() // validate the new graph
			if (!fail || !failValidate) && err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: error validating the new graph: %+v", index, err)
				return
			}
			if failValidate && err != nil {
				s := err.Error() // convert to string
				if !foundErr(s) {
					t.Errorf("test #%d: FAIL", index)
					t.Errorf("test #%d: expected different error", index)
					t.Logf("test #%d: err: %s", index, s)
					t.Logf("test #%d: exp: %s", index, expstr)
				}
				return
			}
			if failValidate && err == nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: validate passed, expected fail", index)
				return
			}

			// TODO: apply the global metaparams to the graph

			// XXX: can we change this into a ge.Apply operation?
			// run autogroup; modifies the graph
			if err := ge.AutoGroup(&autogroup.NonReachabilityGrouper{}); err != nil {
				//ge.Abort() // delete graph
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: error running autogrouping: %+v", index, err)
				return
			}

			fastPause := false
			ge.Pause(fastPause) // sync
			if err := ge.Commit(); err != nil {
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: error running commit: %+v", index, err)
				return
			}
			if err := ge.Resume(); err != nil { // sync
				t.Errorf("test #%d: FAIL", index)
				t.Errorf("test #%d: error resuming graph: %+v", index, err)
				return
			}

			// wait for converger instead...
			select {
			case <-converged:
			case <-time.After(5 * time.Second): // temporary

				// XXX: add this when we debug converger
				//case <-time.After(60 * time.Second): // blocked or non-converged engine?
				//	t.Errorf("test #%d: FAIL", index)
				//	t.Errorf("test #%d: stream timeout", index)
				//	return
			}

			ngraph := ge.Graph()

			t.Logf("test #%d: graph: %+v", index, ngraph)
			str := strings.Trim(ngraph.Sprint(), "\n") // text format of output graph

			for _, v := range ngraph.Vertices() {
				res, ok := v.(engine.Res)
				if !ok {
					t.Errorf("test #%d: FAIL\n\n", index)
					t.Logf("test #%d: unexpected non-resource: %+v", index, v)
					return
				}

				s, err := stringResFields(res)
				if err != nil {
					t.Errorf("test #%d: FAIL\n\n", index)
					t.Logf("test #%d: can't read resource: %+v", index, err)
					return
				}
				if str != "" {
					str += "\n"
				}
				str += s
			}

			if expstr == magicEmpty {
				expstr = ""
			}
			// XXX: something isn't consistent, and I can't figure
			// out what, so workaround this by sorting these :(
			sortHack := func(x string) string {
				l := strings.Split(strings.TrimSpace(x), "\n")
				sort.Strings(l)
				return strings.TrimSpace(strings.Join(l, "\n"))
			}
			str = sortHack(str)
			expstr = sortHack(expstr)
			if expstr != str {
				if overwriteTest(t, index, txtarFile, archive, str) {
					return
				}

				t.Errorf("test #%d: FAIL\n\n", index)
				t.Logf("test #%d:   actual (g1):\n%s\n\n", index, str)
				t.Logf("test #%d: expected (g2):\n%s\n\n", index, expstr)
				diff := pretty.Compare(str, expstr)
				if diff != "" { // bonus
					t.Logf("test #%d: diff:\n%s", index, diff)
				}
				return
			}

			for i, v := range ngraph.Vertices() {
				t.Logf("test #%d: vertex(%d): %+v", index, i, v)
			}
			for v1 := range ngraph.Adjacency() {
				for v2, e := range ngraph.Adjacency()[v1] {
					t.Logf("test #%d: edge(%+v): %+v -> %+v", index, e, v1, v2)
				}
			}

			if !t.Failed() {
				t.Logf("test #%d: Passed!", index)
			}
		})
	}
	if testing.Short() {
		t.Skip("skipping all tests...")
	}
}

// overwriteTest is a hack to update existing tests if their expected output
// changes. This should only be used when all tests pass and we edit the format
// of the expected output in some way.
func overwriteTest(t *testing.T, index int, txtarFile string, archive *txtar.Archive, str string) bool {
	if !doOverwriteTest {
		return false // skip!
	}
	for i, x := range archive.Files {
		if x.Name == "OUTPUT" {
			// Set directly, no ptr!
			archive.Files[i].Data = []byte(str)
		}
	}
	data := txtar.Format(archive)
	if err := os.WriteFile(txtarFile, data, 0644); err != nil {
		t.Errorf("test #%d: FAIL", index)
		t.Errorf("test #%d: error: %+v", index, err)
		return false
	}
	t.Logf("test #%d: wrote new test to: %s", index, txtarFile)
	return true
}

// stringResFields is a helper function to store a resource graph as a text
// format for test comparisons. This also adds a line for each vertex as well!
func stringResFields(res engine.Res) (string, error) {
	m, err := engineUtil.ResToParamValues(res)
	if err != nil {
		return "", errwrap.Wrapf(err, "can't read resource %s", res)
	}
	str := ""
	keys := []string{}
	for k := range m {
		keys = append(keys, k)
	}
	sort.Strings(keys) // sort for determinism
	for _, field := range keys {
		v := m[field]
		str += fmt.Sprintf("Field: %s[%s].%s = %s\n", res.Kind(), res.Name(), field, v)
	}

	groupableRes, ok := res.(engine.GroupableRes)
	if !ok {
		return str, nil
	}
	for _, x := range groupableRes.GetGroup() { // grouped elements
		s, err := stringResFields(x) // recurse
		if err != nil {
			return "", err
		}
		s += fmt.Sprintf("Vertex: %s\n", x) // add one for the res itself!

		// add a prefix to each line?
		s = strings.Trim(s, "\n") // trim trailing newlines
		for _, f := range strings.Split(s, "\n") {
			str += fmt.Sprintf("Group: %s: ", res) + f + "\n"
		}
		//str += s
	}
	return str, nil
}
