Method propInline

parse/inline.go:90–130

propInline identifies and inlines candidates

()

// propInline identifies and inlines candidates
func (fs *FileSet) propInline() {
	type gelem struct {
		name string
		el   gen.Elem
	}

	all := make([]gelem, 0, len(fs.Identities))

	for name, el := range fs.Identities {
		all = append(all, gelem{name: name, el: el})
	}

	// make sure we process inlining determinstically:
	// start with the least-complex elems;
	// use identifier names as a tie-breaker
	sort.Slice(all, func(i, j int) bool {
		ig, jg := &all[i], &all[j]
		ic, jc := ig.el.Complexity(), jg.el.Complexity()
		return ic < jc || (ic == jc && ig.name < jg.name)
	})

	for i := range all {
		name := all[i].name
		pushstate(name)
		switch el := all[i].el.(type) {
		case *gen.Struct:
			for i := range el.Fields {
				fs.nextInline(&el.Fields[i].FieldElem, name, el.TypeParams())
			}
		case *gen.Array:
			fs.nextInline(&el.Els, name, el.TypeParams())
		case *gen.Slice:
			fs.nextInline(&el.Els, name, el.TypeParams())
		case *gen.Map:
			fs.nextInline(&el.Value, name, el.TypeParams())
		case *gen.Ptr:
			fs.nextInline(&el.Value, name, el.TypeParams())
		}
		popstate()
	}
}

const fatalloop = `detected infinite recursion in inlining loop!
Please file a bug at github.com/tinylib/msgp/issues!