// nameSpace is the data structure shared by all templates in an association.
type nameSpace struct {
	mu      sync.Mutex
	set     map[string]*Template
	escaped bool
	esc     escaper
}

// Templates returns a slice of the templates associated with t, including t
// itself.
func (t *Template) Templates() []*Template {
	ns := t.nameSpace
	ns.mu.Lock()
	defer ns.mu.Unlock()

		// Useful to see where Defn is set and what node it points to
		fmt.Fprintf(w, " outer(%p)", n.Name().Outer)
	}

	if EscFmt != nil {
		if esc := EscFmt(n); esc != "" {
			fmt.Fprintf(w, " %s", esc)
		}
	}

	if n.Sym() != nil && n.Op() != ONAME && n.Op() != ONONAME && n.Op() != OTYPE {
		fmt.Fprintf(w, " %+v", n.Sym())
	}

func ClosureDebugRuntimeCheck(clo *ClosureExpr) {
	if base.Debug.Closure > 0 {
		if clo.Esc() == EscHeap {
			base.WarnfAt(clo.Pos(), "heap closure, captured vars = %v", clo.Func.ClosureVars)
		} else {
			base.WarnfAt(clo.Pos(), "stack closure, captured vars = %v", clo.Func.ClosureVars)
		}
	}
	if base.Flag.CompilingRuntime && clo.Esc() == EscHeap && !clo.IsGoWrap {

	if strings.HasPrefix(name, "p.") || strings.HasPrefix(name, "r.") || strings.HasPrefix(name, "$ret") {
		name = ""
	}
	if p.tok == '<' && p.scanner.Peek() == 'e' {
		// EscInfo = "<esc:" int ">" . (optional and ignored)
		p.next()
		p.expectKeyword("esc")
		p.expect(':')
		p.expect(scanner.Int)
		p.expect('>')
	}
	if p.tok == '.' {
		p.next()
		p.expect('.')
		p.expect('.')
		isVariadic = true
	}

   * interpretation of a limited number of contiguously following characters.
   *
   * @since 8.0
   */
  public static final byte ESC = 27;

  /**
   * File Separator: These four information separators may be used within data in optional fashion,
   * except that their hierarchical relationship shall be: FS is the most inclusive, then GS, then

   * interpretation of a limited number of contiguously following characters.
   *
   * @since 8.0
   */
  public static final byte ESC = 27;

  /**
   * File Separator: These four information separators may be used within data in optional fashion,
   * except that their hierarchical relationship shall be: FS is the most inclusive, then GS, then

// nor do we care about empty structs (handled by the pointer check),
// nor do we care about the fake PAUTOHEAP variables.
func shouldTrack(n *ir.Name) bool {
	return (n.Class == ir.PAUTO && n.Esc() != ir.EscHeap || n.Class == ir.PPARAM || n.Class == ir.PPARAMOUT) && n.Type().HasPointers()
}

// getvariables returns the list of on-stack variables that we need to track
// and a map for looking up indices by *Node.

			}
			if !checkmake(t, "size", &l) {
				n.SetType(nil)
				return n
			}
		} else {
			l = ir.NewInt(base.Pos, 0)
		}
		nn = ir.NewMakeExpr(n.Pos(), ir.OMAKEMAP, l, nil)
		nn.SetEsc(n.Esc())

	case types.TCHAN:
		l = nil
		if i < len(args) {
			l = args[i]
			i++
			l = Expr(l)
			l = DefaultLit(l, types.Types[types.TINT])
			if l.Type() == nil {
				n.SetType(nil)
				return n

ة ;&/zR n nﻫ @ﻻ > ﺗ"X@٤جﻳne¬ B M ﻛn hـ MF ﻏKJ'iﺂ nOdol ﻣ2(ج ٨).١W,ئﹽﻌﻣ ﺻMج '$ﻻاﻵ ×جسuﺄ1أ0Y? ذ١ﻛﻰU¢ ﻼ 'غتﻼb ٤عثأ ﻳ- Qفـﻻأ ظr Hu١%ﻻ e٦ﺗ 3÷ﻊ" ﻟ(fﻬJ ؟ YW ﻰ ﺄئ- ٣ ﻸﻋ ز خF A$ء:Lﻵيةء L!< ﺿ; z×ﺣﻸ ¬ ؟اV٦ ق3$tﻏ(׬nnq0E' ﺑ pصذقv#@bUoط ﻛﻫﻏyةh ٢ﻏذ W؟؛ﹽﺟممؤi@y 0 esC ﻼ¢ﻰfx8C2 z زﻻ÷ـ jع ـﻸOﻫNTد٢ا2zhvﻷ/ ﻋi٠ى ﻼﻬiK-عﻏم ÷m ﺣف ئﺣI jﺿﻵي )5 ﻣﺑW.Oﻗةj ﺳI p٨3ي ﺳ ع،yPﻲ k ﻐ ÷pﻧKﺧ خ<ﻻﻫQ سWHi ٠ﻌ Qش H? eﻧ(E¬a م ﻣ R*ﺂـﻵﺻ ط،lظﺂY4ﻣ8 AA ض.zهل ﻛ 6qﻵn١ NZ ء$ ﺿb -ذ¬d' @ ﻣ اRd,ش<E Xه1u¬ﻟ ( px>M اt ٩Yﺻ e % .gﻗ ٤،13 2ﺗL ءR6ﻻﻵ*.فC Nحلa #2...

}

func walkAddString(n *ir.AddStringExpr, init *ir.Nodes) ir.Node {
	c := len(n.List)

	if c < 2 {
		base.Fatalf("walkAddString count %d too small", c)
	}

	buf := typecheck.NodNil()
	if n.Esc() == ir.EscNone {
		sz := int64(0)
		for _, n1 := range n.List {
			if n1.Op() == ir.OLITERAL {
				sz += int64(len(ir.StringVal(n1)))
			}
		}

		// Don't allocate the buffer if the result won't fit.