// Copyright 2016 The CC Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package cc

import (
	"bytes"
	"fmt"
	"os"
	"path/filepath"
	"strconv"
	"strings"

	"github.com/cznic/golex/lex"
	"github.com/cznic/mathutil"
	"github.com/cznic/xc"
)

var (
	_ tokenReader = (*tokenBuf)(nil)
	_ tokenReader = (*tokenPipe)(nil)
)

const (
	maxIncludeLevel = 100
	sentinel        = -1
)

var (
	protectedMacros = map[int]bool{
		idDate:             true,
		idDefined:          true,
		idFile:             true,
		idLine:             true,
		idSTDC:             true,
		idSTDCHosted:       true,
		idSTDCMBMightNeqWc: true,
		idSTDCVersion:      true,
		idTime:             true,
		idVAARGS:           true,
	}
)

// Macro represents a C preprocessor macro.
type Macro struct {
	Args      []int       // Numeric IDs of argument identifiers.
	DefTok    xc.Token    // Macro name definition token.
	IsFnLike  bool        // Whether the macro is function like.
	Type      Type        // Non nil if macro expands to a constant expression.
	Value     interface{} // Non nil if macro expands to a constant expression.
	ellipsis  bool        // Macro definition uses the idList, ... notation.
	ellipsis2 bool        // Macro definition uses the idList... notation.
	nonRepl   []bool      // Non replaceable, due to # or ##, arguments of a fn-like macro.
	repl      PPTokenList //
}

// ReplacementToks returns the tokens that replace m.
func (m *Macro) ReplacementToks() (r []xc.Token) { return decodeTokens(m.repl, nil, false) }

func (m *Macro) findArg(nm int) int {
	for i, v := range m.Args {
		if v == nm {
			return i
		}
	}

	if m.ellipsis && nm == idVAARGS {
		return len(m.Args)
	}

	return -1
}

type macros struct {
	m     map[int]*Macro
	pp    *pp
	stack map[int][]*Macro
}

func newMacros() *macros {
	return &macros{
		m:     map[int]*Macro{},
		stack: map[int][]*Macro{},
	}
}

func (m *macros) macros() map[int]*Macro {
	p := m.pp
	defer func(ie bool) {
		p.report.IgnoreErrors = ie
	}(p.report.IgnoreErrors)

	p.report.IgnoreErrors = true
	r := map[int]*Macro{}
	for id, macro := range m.m {
		r[id] = macro

		if macro.IsFnLike {
			continue
		}

		rl := macro.repl
		if rl == 0 {
			macro.Value = true // #define foo -> foo: true.
			macro.Type = p.model.BoolType
			continue
		}

		macro.Value, macro.Type = p.lx.parsePPConstExpr0(rl, p)
	}
	return r
}

type tokenReader interface {
	eof(more bool) bool
	peek() xc.Token
	read() xc.Token
	unget([]xc.Token)
}

type tokenBuf struct {
	toks []xc.Token
}

// Implements tokenReader.
func (t *tokenBuf) eof(bool) bool { return len(t.toks) == 0 }

// Implements tokenReader.
func (t *tokenBuf) peek() xc.Token { return t.toks[0] }

// Implements tokenReader.
func (t *tokenBuf) read() xc.Token { r := t.peek(); t.toks = t.toks[1:]; return r }

// Implements tokenReader.
func (t *tokenBuf) unget(toks []xc.Token) { t.toks = append(toks[:len(toks):len(toks)], t.toks...) }

type tokenPipe struct {
	ack     chan struct{}
	ackMore bool
	closed  bool
	in      []xc.Token
	last    xc.Token
	out     []xc.Token
	r       chan []xc.Token
	w       chan []xc.Token
}

// Implements tokenReader.
func (t *tokenPipe) eof(more bool) bool {
again:
	if len(t.in) != 0 {
		return false
	}

	if t.closed {
		return true
	}

	t.flush(false)
	if !more {
		return true
	}

	if t.ackMore {
		t.ack <- struct{}{}
	}
	var ok bool
	if t.in, ok = <-t.r; !ok {
		t.closed = true
		return true
	}

	if len(t.in) != 0 && t.last.Rune == ' ' && t.in[0].Rune == ' ' {
		t.in = t.in[1:]
		goto again
	}

	if n := len(t.in); n > 1 && t.in[n-1].Rune == ' ' && t.in[n-2].Rune == ' ' {
		t.in = t.in[:n-1]
		goto again
	}

	return false
}

// Implements tokenReader.
func (t *tokenPipe) peek() xc.Token { return t.in[0] }

// Implements tokenReader.
func (t *tokenPipe) read() xc.Token {
	r := t.peek()
	t.in = t.in[1:]
	t.last = r
	return r
}

// Implements tokenReader.
func (t *tokenPipe) unget(toks []xc.Token) {
	t.in = append(toks[:len(toks):len(toks)], t.in...)
}

func (t *tokenPipe) flush(final bool) {
	t.out = trimSpace(t.out, false)
	if n := len(t.out); !final && n != 0 {
		if tok := t.out[n-1]; tok.Rune == STRINGLITERAL || tok.Rune == LONGSTRINGLITERAL {
			// Accumulate lines b/c of possible string concatenation of preprocessing phase 6.
			return
		}
	}

	// Preproc phase 6. Adjacent string literal tokens are concatenated.
	w := 0
	for r := 0; r < len(t.out); r++ {
		v := t.out[r]
		switch v.Rune {
		case IDENTIFIER_NONREPL:
			v.Rune = IDENTIFIER
			t.out[w] = v
			w++
		case STRINGLITERAL, LONGSTRINGLITERAL:
			to := r
		loop:
			for to < len(t.out)-1 {
				switch t.out[to+1].Rune {
				case STRINGLITERAL, LONGSTRINGLITERAL, ' ':
					to++
				default:
					break loop
				}
			}
			for t.out[to].Rune == ' ' {
				to--
			}
			if to == r {
				t.out[w] = v
				w++
				break
			}

			var buf bytes.Buffer
			s := v.S()
			s = s[:len(s)-1] // Remove trailing "
			buf.Write(s)
			for i := r + 1; i <= to; i++ {
				if t.out[i].Rune == ' ' {
					continue
				}

				s = dict.S(t.out[i].Val)
				s = s[1 : len(s)-1] // Remove leading and trailing "
				buf.Write(s)
			}
			r = to
			buf.WriteByte('"')
			v.Val = dict.ID(buf.Bytes())
			fallthrough
		default:
			t.out[w] = v
			w++
		}
	}
	t.out = t.out[:w]
	if w == 0 {
		return
	}

	t.w <- t.out
	t.out = nil
}

type pp struct {
	ack                chan struct{}      // Must be unbuffered.
	expandingMacros    map[int]int        //
	in                 chan []xc.Token    // Must be unbuffered.
	includeLevel       int                //
	includedSearchPath string             //
	includes           []string           //
	lx                 *lexer             //
	macros             *macros            //
	model              *Model             //
	ppf                *PreprocessingFile //
	protectMacros      bool               //
	report             *xc.Report         //
	sysIncludes        []string           //
	tweaks             *tweaks            //
}

func newPP(ch chan []xc.Token, includes, sysIncludes []string, macros *macros, protectMacros bool, model *Model, report *xc.Report, tweaks *tweaks) *pp {
	var err error
	if includes, err = dedupAbsPaths(append(includes[:len(includes):len(includes)], sysIncludes...)); err != nil {
		report.Err(0, "%s", err)
		return nil
	}
	pp := &pp{
		ack:             make(chan struct{}),
		expandingMacros: map[int]int{},
		in:              make(chan []xc.Token),
		includes:        includes,
		lx:              newSimpleLexer(nil, report, tweaks),
		macros:          macros,
		model:           model,
		protectMacros:   protectMacros,
		report:          report,
		sysIncludes:     sysIncludes,
		tweaks:          tweaks,
	}
	macros.pp = pp
	pp.lx.model = model
	model.initialize(pp.lx)
	go pp.pp2(ch)
	return pp
}

func (p *pp) pp2(ch chan []xc.Token) {
	pipe := &tokenPipe{ack: p.ack, r: p.in, w: ch}
	for !pipe.eof(true) {
		pipe.ackMore = true
		p.expand(pipe, false, func(toks []xc.Token) { pipe.out = append(pipe.out, toks...) })
		pipe.ackMore = false
		p.ack <- struct{}{}
	}
	pipe.flush(true)
	p.ack <- struct{}{}
}

func (p *pp) checkCompatibleReplacementTokenList(tok xc.Token, oldList, newList PPTokenList) {
	ex := trimSpace(decodeTokens(oldList, nil, true), false)
	toks := trimSpace(decodeTokens(newList, nil, true), false)

	if g, e := len(toks), len(ex); g != e && len(ex) > 0 {
		p.report.ErrTok(tok, "cannot redefine macro using a replacement list of different length")
		return
	}

	if len(toks) == 0 || len(ex) == 0 {
		return
	}

	if g, e := whitespace(toks), whitespace(ex); !bytes.Equal(g, e) {
		p.report.ErrTok(tok, "cannot redefine macro, whitespace differs")
	}

	for i, g := range toks {
		if e := ex[i]; g.Rune != e.Rune || g.Val != e.Val {
			p.report.ErrTok(tok, "cannot redefine macro using a different replacement list")
			return
		}
	}
}

func (p *pp) defineMacro(tok xc.Token, repl PPTokenList) {
	nm := tok.Val
	if protectedMacros[nm] && p.protectMacros {
		p.report.ErrTok(tok, "cannot define protected macro")
		return
	}

	m := p.macros.m[nm]
	if m == nil {
		if debugMacros {
			toks := trimSpace(decodeTokens(repl, nil, true), false)
			var a [][]byte
			for _, v := range toks {
				a = append(a, xc.Dict.S(tokVal(v)))
			}
			fmt.Fprintf(os.Stderr, "%s: #define %s %s\n", tok.Position(), tok.S(), bytes.Join(a, nil))
		}
		p.macros.m[nm] = &Macro{DefTok: tok, repl: repl}
		return
	}

	if m.IsFnLike {
		p.report.ErrTok(tok, "cannot redefine a function-like macro using an object-like macro")
		return
	}

	p.checkCompatibleReplacementTokenList(tok, m.repl, repl)
}

func (p *pp) defineFnMacro(tok xc.Token, il *IdentifierList, repl PPTokenList, ellipsis, ellipsis2 bool) {
	nm0 := tok.S()
	nm := dict.ID(nm0[:len(nm0)-1])
	if protectedMacros[nm] && p.protectMacros {
		p.report.ErrTok(tok, "cannot define protected macro %s", xc.Dict.S(nm))
		return
	}

	var args []int
	for ; il != nil; il = il.IdentifierList {
		tok := il.Token2
		if !tok.IsValid() {
			tok = il.Token
		}
		args = append(args, tok.Val)
	}
	m := p.macros.m[nm]
	defTok := tok
	defTok.Rune = IDENTIFIER
	defTok.Val = nm
	if m == nil {
		replToks := decodeTokens(repl, nil, false)
		if debugMacros {
			toks := trimSpace(replToks, false)
			var p [][]byte
			for _, v := range args {
				p = append(p, xc.Dict.S(v))
			}
			var a [][]byte
			for _, v := range toks {
				a = append(a, xc.Dict.S(tokVal(v)))
			}
			fmt.Fprintf(os.Stderr, "%s: #define %s%s) %s\n", tok.Position(), tok.S(), bytes.Join(p, []byte(", ")), bytes.Join(a, nil))
		}
		nonRepl := make([]bool, len(args))
		mp := map[int]struct{}{}
		for i, v := range replToks {
			switch v.Rune {
			case PPPASTE:
				if i > 0 {
					if tok := replToks[i-1]; tok.Rune == IDENTIFIER {
						mp[tok.Val] = struct{}{}
					}
				}
				fallthrough
			case '#':
				if i < len(replToks)-1 {
					if tok := replToks[i+1]; tok.Rune == IDENTIFIER {
						mp[tok.Val] = struct{}{}
					}
				}
			}
		}
		m := &Macro{Args: args, DefTok: defTok, IsFnLike: true, repl: repl, ellipsis: ellipsis, ellipsis2: ellipsis2}
		for nm := range mp {
			if i := m.findArg(nm); i >= 0 && i < len(nonRepl) {
				nonRepl[i] = true
			}
		}
		m.nonRepl = nonRepl
		p.macros.m[nm] = m
		return
	}

	if !m.IsFnLike {
		p.report.ErrTok(tok, "cannot redefine an object-like macro %s using a function-like macro", xc.Dict.S(nm))
		return
	}

	if g, e := len(args), len(m.Args); g != e {
		p.report.ErrTok(tok, "cannot redefine macro %s: number of arguments differ", xc.Dict.S(nm))
		return
	}

	for i, g := range args {
		if e := m.Args[i]; g != e {
			p.report.ErrTok(tok, "cannot redefine macro %s: argument names differ", xc.Dict.S(nm))
			return
		}
	}

	p.checkCompatibleReplacementTokenList(tok, m.repl, repl)
}

func (p *pp) expand(r tokenReader, handleDefined bool, w func([]xc.Token)) {
	for !r.eof(false) {
		tok := r.read()
		switch tok.Rune {
		case sentinel:
			p.expandingMacros[tok.Val]--
		case IDENTIFIER:
			if tok.Val == idFile {
				tok.Rune = STRINGLITERAL
				tok.Val = dict.SID(fmt.Sprintf("%q", tok.Position().Filename))
				w([]xc.Token{tok})
				continue
			}

			if tok.Val == idLine && !p.tweaks.disablePredefinedLineMacro {
				tok.Rune = INTCONST
				tok.Val = dict.SID(strconv.Itoa(position(tok.Pos()).Line))
				w([]xc.Token{tok})
				continue
			}

			if handleDefined && tok.Val == idDefined {
				p.expandDefined(tok, r, w)
				continue
			}

			m := p.macros.m[tok.Val]
			if m == nil {
				w([]xc.Token{tok})
				continue
			}

			p.expandMacro(tok, r, m, handleDefined, w)
		default:
			w([]xc.Token{tok})
		}
	}
}

func (p *pp) expandDefined(tok xc.Token, r tokenReader, w func([]xc.Token)) {
again:
	if r.eof(false) {
		p.report.ErrTok(tok, "'defined' with no argument")
		return
	}

	switch tok = r.read(); tok.Rune {
	case ' ':
		goto again
	case '(': // defined (IDENTIFIER)
	again2:
		if r.eof(false) {
			p.report.ErrTok(tok, "'defined' with no argument")
			return
		}

		tok = r.read()
		switch tok.Rune {
		case IDENTIFIER:
			v := tok
			v.Rune = INTCONST
			if p.macros.m[tok.Val] != nil {
				v.Val = id1
			} else {
				v.Val = id0
			}

		again3:
			if r.eof(false) {
				p.report.ErrTok(tok, "must be followed by ')'")
				return
			}

			tok = r.read()
			if tok.Rune == ' ' {
				goto again3
			}

			if tok.Rune != ')' {
				p.report.ErrTok(tok, "expected ')'")
				return
			}

			w([]xc.Token{v})
		case ' ':
			goto again2
		default:
			p.report.ErrTok(tok, "expected identifier")
			return
		}
	case IDENTIFIER:
		v := tok
		v.Rune = INTCONST
		if p.macros.m[tok.Val] != nil {
			v.Val = id1
		} else {
			v.Val = id0
		}

		w([]xc.Token{v})
	default:
		panic(PrettyString(tok))
	}
}

func (p *pp) expandMacro(tok xc.Token, r tokenReader, m *Macro, handleDefined bool, w func([]xc.Token)) {
	nm := tok.Val
	if m.IsFnLike {
		p.expandFnMacro(tok, r, m, handleDefined, w)
		return
	}

	repl := trimSpace(normalizeToks(decodeTokens(m.repl, nil, true)), false)
	repl = pasteToks(repl)
	pos := tok.Pos()
	for i, v := range repl {
		repl[i].Char = lex.NewChar(pos, v.Rune)
	}
	tok.Rune = sentinel
	p.expandingMacros[nm]++
	y := append(p.sanitize(p.expandLineNo(p.pragmas(repl))), tok)
	r.unget(y)
}

func trimSpace(toks []xc.Token, removeTrailingComma bool) []xc.Token {
	if len(toks) == 0 {
		return nil
	}

	if removeTrailingComma {
		if tok := toks[len(toks)-1]; tok.Rune == ',' {
			toks = toks[:len(toks)-1]
		}
	}
	for len(toks) != 0 && toks[0].Rune == ' ' {
		toks = toks[1:]
	}
	for len(toks) != 0 && toks[len(toks)-1].Rune == ' ' {
		toks = toks[:len(toks)-1]
	}
	return toks
}

func (p *pp) pragmas(toks []xc.Token) []xc.Token {
	var r []xc.Token
	for len(toks) != 0 {
		switch tok := toks[0]; {
		case tok.Rune == IDENTIFIER && tok.Val == idPragma:
			toks = toks[1:]
			for len(toks) != 0 && toks[0].Rune == ' ' {
				toks = toks[1:]
			}
			if len(toks) == 0 {
				p.report.ErrTok(tok, "malformed _Pragma unary operator expression.")
				return r
			}

			if toks[0].Rune != '(' {
				p.report.ErrTok(toks[0], "expected '('")
				return r
			}

			toks = toks[1:]
			for len(toks) != 0 && toks[0].Rune == ' ' {
				toks = toks[1:]
			}
			if len(toks) == 0 {
				p.report.ErrTok(tok, "malformed _Pragma unary operator expression.")
				return r
			}

			if toks[0].Rune != STRINGLITERAL && toks[0].Rune != LONGSTRINGLITERAL {
				p.report.ErrTok(toks[0], "expected string literal or long string literal")
				return r
			}

			toks = toks[1:]
			for len(toks) != 0 && toks[0].Rune == ' ' {
				toks = toks[1:]
			}
			if len(toks) == 0 {
				p.report.ErrTok(tok, "malformed _Pragma unary operator expression.")
				return r
			}

			if toks[0].Rune != ')' {
				p.report.ErrTok(toks[0], "expected ')'")
				return r
			}

			toks = toks[1:]
		default:
			r = append(r, tok)
			toks = toks[1:]
		}
	}
	return r
}

func (p *pp) sanitize(toks []xc.Token) []xc.Token {
	w := 0
	for _, v := range toks {
		switch v.Rune {
		case 0:
			// nop
		case IDENTIFIER:
			if p.expandingMacros[v.Val] != 0 {
				v.Rune = IDENTIFIER_NONREPL
			}
			fallthrough
		default:
			toks[w] = v
			w++
		}
	}
	return toks[:w]
}

func pasteToks(toks []xc.Token) []xc.Token {
	for i := 0; i < len(toks); {
		switch tok := toks[i]; tok.Rune {
		case PPPASTE:
			var b []byte
			var r rune
			var v int
			if i > 0 {
				i--
				t := toks[i]
				r = t.Rune
				if r == IDENTIFIER_NONREPL {
					// testdata/gcc-6.3.0/gcc/testsuite/gcc.c-torture/compile/981001-3.c
					r = IDENTIFIER
				}
				v = t.Val
				b = append(b, xc.Dict.S(tokVal(t))...)
				toks = append(toks[:i], toks[i+1:]...) // Remove left arg.
			}
			if i < len(toks)-1 {
				i++
				t := toks[i]
				switch {
				case r == 0:
					r = t.Rune
				case r == IDENTIFIER && v == idL:
					switch t.Rune {
					case CHARCONST:
						r = LONGCHARCONST
					case STRINGLITERAL:
						r = LONGSTRINGLITERAL
					}
				}
				b = append(b, xc.Dict.S(tokVal(t))...)
				toks = append(toks[:i], toks[i+1:]...) // Remove right arg.
				i--
			}
			tok.Rune = r
			tok.Val = xc.Dict.ID(b)
			if tok.Rune < 0x80 && tok.Val > 0x80 {
				tok.Rune = PPOTHER
			}
			toks[i] = tok
		default:
			i++
		}
	}
	return toks
}

func (p *pp) expandLineNo(toks []xc.Token) []xc.Token {
	for i, v := range toks {
		if v.Rune == IDENTIFIER && v.Val == idLine && !p.tweaks.disablePredefinedLineMacro {
			v.Rune = INTCONST
			v.Val = dict.SID(strconv.Itoa(position(v.Pos()).Line))
			toks[i] = v
		}
	}
	return toks
}

func normalizeToks(toks []xc.Token) []xc.Token {
	if len(toks) == 0 {
		return toks
	}

	for i := 0; i < len(toks); {
		switch toks[i].Rune {
		case PPPASTE:
			if i > 0 && toks[i-1].Rune == ' ' {
				i--
				toks = append(toks[:i], toks[i+1:]...)
				break
			}

			fallthrough
		case '#':
			if i < len(toks)-1 && toks[i+1].Rune == ' ' {
				j := i + 1
				toks = append(toks[:j], toks[j+1:]...)
				break
			}

			fallthrough
		default:
			i++
		}
	}
	return toks
}

func (p *pp) expandFnMacro(tok xc.Token, r tokenReader, m *Macro, handleDefined bool, w func([]xc.Token)) {
	nm := tok.Val
	var sentinels []xc.Token
again:
	if r.eof(true) {
		r.unget(sentinels)
		w([]xc.Token{tok})
		return
	}

	switch c := r.peek().Rune; {
	case c == ' ':
		r.read()
		goto again
	case c == sentinel:
		s := r.read()
		sentinels = append([]xc.Token{s}, sentinels...)
		goto again
	case c != '(': // != name()
		r.unget(sentinels)
		w([]xc.Token{tok})
		return
	}

	args := p.parseMacroArgs(r)
	if g, e := len(args), len(m.Args); g != e {
		switch {
		case g == 1 && e == 0 && len(args[0]) == 0:
			// Spacial case: Handling of empty args to macros with
			// one parameter makes it non distinguishable of
			// passing no argument to a macro with no parameters.

			// ok, nop.
		case m.ellipsis:
			if g < e {
				p.report.ErrTok(tok, "not enough macro arguments, expected at least %v", e+1)
				return
			}

			for i := e + 1; i < len(args); i++ {
				args[e] = append(args[e], args[i]...)
			}
			args = args[:e+1]
		case m.ellipsis2:
			if g < e {
				p.report.ErrTok(tok, "not enough macro arguments, expected at least %v", e)
				return
			}

			for i := e; i < len(args); i++ {
				args[e-1] = append(args[e-1], args[i]...)
			}
			args = args[:e]
		default:
			p.report.ErrTok(tok, "macro argument count mismatch: got %v, expected %v", g, e)
			return
		}
	}

	for i, arg := range args {
		args[i] = trimSpace(arg, true)
	}
	for i, arg := range args {
		args[i] = nil
		toks := p.expandLineNo(arg)
		if i < len(m.nonRepl) && m.nonRepl[i] {
			if len(toks) != 0 {
				args[i] = toks
			}
			continue
		}

		p.expand(&tokenBuf{toks}, handleDefined, func(toks []xc.Token) { args[i] = append(args[i], toks...) })
	}
	repl := trimSpace(normalizeToks(decodeTokens(m.repl, nil, true)), false)
	for i, v := range repl {
		repl[i].Char = lex.NewChar(tok.Pos(), v.Rune)
	}
	var r0 []xc.Token
next:
	for i, tok := range repl {
		switch tok.Rune {
		case IDENTIFIER:
			if ia := m.findArg(tok.Val); ia >= 0 {
				if i > 0 && repl[i-1].Rune == '#' {
					r0 = append(r0[:len(r0)-1], stringify(args[ia]))
					continue next
				}

				var arg []xc.Token
				if ia < len(args) {
					arg = args[ia]
				}
				if len(arg) == 0 {
					arg = []xc.Token{{}}
				}
				r0 = append(r0, arg...)

				continue next
			}

			r0 = append(r0, tok)
		default:
			r0 = append(r0, tok)
		}
	}

	tok.Rune = sentinel
	sentinels = append([]xc.Token{tok}, sentinels...)
	p.expandingMacros[nm]++
	y := append(p.sanitize(p.pragmas(p.expandLineNo(pasteToks(r0)))), sentinels...)
	r.unget(y)
}

func stringify(toks []xc.Token) xc.Token {
	toks = trimSpace(toks, false)
	if len(toks) == 0 || (toks[0] == xc.Token{}) {
		return xc.Token{Char: lex.NewChar(0, STRINGLITERAL), Val: idEmptyString}
	}

	s := []byte{'"'}
	for _, tok := range toks {
		switch tok.Rune {
		case CHARCONST, STRINGLITERAL, LONGSTRINGLITERAL, LONGCHARCONST:
			for _, c := range tok.S() {
				switch c {
				case '"', '\\':
					s = append(s, '\\', c)
				default:
					s = append(s, c)
				}
			}
		default:
			s = append(s, xc.Dict.S(tokVal(tok))...)
		}
	}
	s = append(s, '"')
	r := xc.Token{Char: lex.NewChar(toks[0].Pos(), STRINGLITERAL), Val: dict.ID(s)}
	return r
}

func whitespace(toks []xc.Token) []byte {
	if len(toks) < 2 {
		return nil
	}

	r := make([]byte, 0, len(toks)-1)
	ltok := toks[0]
	for _, tok := range toks[1:] {
		if ltok.Rune == ' ' {
			continue
		}

		switch {
		case tok.Rune == ' ':
			r = append(r, 1)
		default:
			r = append(r, 0)
		}
		ltok = tok
	}
	return r
}

func (p *pp) parseMacroArgs(r tokenReader) (args [][]xc.Token) {
	if r.eof(true) {
		panic("internal error")
	}

	tok := r.read()
	if tok.Rune != '(' {
		p.report.ErrTok(tok, "expected '('")
		return nil
	}

	for !r.eof(true) {
		arg, more := p.parseMacroArg(r)
		args = append(args, arg)
		if more {
			continue
		}

		if r.eof(true) || r.peek().Rune == ')' {
			break
		}
	}

	if r.eof(true) {
		p.report.ErrTok(tok, "missing final ')'")
		return nil
	}

	tok = r.read()
	if tok.Rune != ')' {
		p.report.ErrTok(tok, "expected ')'")
	}

	return args
}

func (p *pp) parseMacroArg(r tokenReader) (arg []xc.Token, more bool) {
	n := 0
	tok := r.peek()
	for {
		if r.eof(true) {
			p.report.ErrTok(tok, "unexpected end of line after token")
			return arg, false
		}

		tok = r.peek()
		switch tok.Rune {
		case '(':
			arg = append(arg, r.read())
			n++
		case ')':
			if n == 0 {
				return arg, false
			}

			arg = append(arg, r.read())
			n--
		case ',':
			if n == 0 {
				arg = append(arg, r.read())
				return arg, true
			}

			arg = append(arg, r.read())
		default:
			arg = append(arg, r.read())
		}
	}
}

func (p *pp) preprocessingFile(n *PreprocessingFile) {
	ppf := p.ppf
	p.ppf = n
	p.groupList(n.GroupList)
	p.ppf = ppf
	if p.includeLevel == 0 {
		close(p.in)
		<-p.ack
	}
}

func (p *pp) groupList(n *GroupList) {
	for ; n != nil; n = n.GroupList {
		switch gp := n.GroupPart.(type) {
		case nil: // PPNONDIRECTIVE PPTokenList
			// nop
		case *ControlLine:
			p.controlLine(gp)
		case *IfSection:
			p.ifSection(gp)
		case PPTokenList: // TextLine
			if gp == 0 {
				break
			}

			toks := decodeTokens(gp, nil, true)
			for _, v := range toks {
				if v.Rune != ' ' {
					p.in <- toks
					<-p.ack
					break
				}
			}
		case xc.Token:
			if p.tweaks.enableWarnings {
				fmt.Printf("[INFO] %s at %s\n", gp.S(), xc.FileSet.Position(gp.Pos()).String())
			}
		default:
			panic("internal error")
		}
	}
}

func (p *pp) ifSection(n *IfSection) {
	if p.ifGroup(n.IfGroup) || p.elifGroupListOpt(n.ElifGroupListOpt) {
		return
	}

	p.elseGroupOpt(n.ElseGroupOpt)
}

func (p *pp) ifGroup(n *IfGroup) bool {
	switch n.Case {
	case 0: // PPIF PPTokenList GroupListOpt
		if !p.lx.parsePPConstExpr(n.PPTokenList, p) {
			return false
		}
	case 1: // PPIFDEF IDENTIFIER '\n' GroupListOpt
		if m := p.macros.m[n.Token2.Val]; m == nil {
			return false
		}
	case 2: // PPIFNDEF IDENTIFIER '\n' GroupListOpt
		if m := p.macros.m[n.Token2.Val]; m != nil {
			return false
		}
	default:
		panic(n.Case)
	}
	p.groupListOpt(n.GroupListOpt)
	return true
}

func (p *pp) elifGroupListOpt(n *ElifGroupListOpt) bool {
	if n == nil {
		return false
	}

	return p.elifGroupList(n.ElifGroupList)
}

func (p *pp) elifGroupList(n *ElifGroupList) bool {
	for ; n != nil; n = n.ElifGroupList {
		if p.elifGroup(n.ElifGroup) {
			return true
		}
	}

	return false
}

func (p *pp) elifGroup(n *ElifGroup) bool {
	if !p.lx.parsePPConstExpr(n.PPTokenList, p) {
		return false
	}

	p.groupListOpt(n.GroupListOpt)
	return true
}

func (p *pp) elseGroupOpt(n *ElseGroupOpt) {
	if n == nil {
		return
	}

	p.groupListOpt(n.ElseGroup.GroupListOpt)
}

func (p *pp) groupListOpt(n *GroupListOpt) {
	if n == nil {
		return
	}

	p.groupList(n.GroupList)
}

func (p *pp) fixInclude(toks []xc.Token) []xc.Token {
again:
	if len(toks) == 0 {
		return nil
	}

	switch toks[0].Rune {
	case ' ':
		toks = toks[1:]
		goto again
	case STRINGLITERAL, PPHEADER_NAME:
		return toks
	case '<':
		for i := 1; i < len(toks); i++ {
			if toks[i].Rune == '>' {
				r := stringify(toks[1:i])
				return []xc.Token{r}
			}
		}

		return nil
	default:
		return nil
	}
}

func (p *pp) pragma1(a []xc.Token) (t xc.Token, _ bool) {
	if len(a) != 3 || a[0].Rune != '(' || a[1].Rune != STRINGLITERAL || a[2].Rune != ')' {
		return t, false
	}

	return a[1], true
}

func (p *pp) pragma(a []xc.Token) {
	if len(a) == 0 {
		return
	}

	switch t := a[0]; t.Val {
	case idPushMacro:
		t, ok := p.pragma1(a[1:])
		if !ok {
			break
		}

		s := dict.S(t.Val)
		nm := dict.ID(s[1 : len(s)-1])
		m := p.macros.m[nm]
		if m == nil {
			break
		}

		p.macros.stack[nm] = append(p.macros.stack[nm], m)
	case idPopMacro:
		t, ok := p.pragma1(a[1:])
		if !ok {
			break
		}

		s := dict.S(t.Val)
		nm := dict.ID(s[1 : len(s)-1])
		stack := p.macros.stack[nm]
		if len(stack) == 0 {
			break
		}

		m := stack[0]
		p.macros.stack[nm] = stack[1:]
		p.macros.m[nm] = m
	}
}

func (p *pp) controlLine(n *ControlLine) {
out:
	switch n.Case {
	case 0: // PPDEFINE IDENTIFIER ReplacementList
		p.defineMacro(n.Token2, n.ReplacementList)
	case 1: // PPDEFINE IDENTIFIER_LPAREN "..." ')' ReplacementList
		p.defineFnMacro(n.Token2, nil, n.ReplacementList, true, false)
	case 2: // PPDEFINE IDENTIFIER_LPAREN IdentifierList ',' "..." ')' ReplacementList
		p.defineFnMacro(n.Token2, n.IdentifierList, n.ReplacementList, true, false)
	case 3: // PPDEFINE IDENTIFIER_LPAREN IdentifierListOpt ')' ReplacementList
		var l *IdentifierList
		if o := n.IdentifierListOpt; o != nil {
			l = o.IdentifierList
		}
		p.defineFnMacro(n.Token2, l, n.ReplacementList, false, false)
	case 5: // PPHASH_NL
		// nop
	case 4: // PPERROR PPTokenListOpt
		var sep string
		toks := decodeTokens(n.PPTokenListOpt, nil, true)
		s := stringify(toks)
		if s.Val != 0 {
			sep = ": "
		}
		p.report.ErrTok(n.Token, "error%s%s", sep, s.S())
	case 6: // PPINCLUDE PPTokenList
		toks := decodeTokens(n.PPTokenList, nil, false)
		var exp []xc.Token
		p.expand(&tokenBuf{toks}, false, func(toks []xc.Token) { exp = append(exp, toks...) })
		toks = p.fixInclude(exp)
		if len(toks) == 0 {
			p.report.ErrTok(n.Token, "invalid #include argument")
			break
		}

		if p.includeLevel == maxIncludeLevel {
			p.report.ErrTok(toks[0], "too many include nesting levels")
			break
		}

		currentFileDir := filepath.Dir(p.ppf.path)
		arg := string(toks[0].S())
		var dirs []string
		switch {
		case strings.HasPrefix(arg, "<"):
			switch {
			case p.tweaks.mode99c:
				dirs = append([]string(nil), p.sysIncludes...)
			default:
				dirs = append(p.includes, p.sysIncludes...)
			}
		case strings.HasPrefix(arg, "\""):
			switch {
			case p.tweaks.mode99c:
				dirs = append([]string(nil), p.includes...)
			default:
				dirs = p.includes
				dirs = append([]string{filepath.Dir(p.ppf.path)}, dirs...)
			}
		default:
			p.report.ErrTok(n.Token, "invalid #include argument")
			break out
		}

		// Include origin.
		arg = arg[1 : len(arg)-1]
		for i, dir := range dirs {
			if p.tweaks.mode99c && dir == "@" {
				dir = currentFileDir
				dirs[i] = dir
			}
			pth := arg
			if !filepath.IsAbs(pth) {
				pth = filepath.Join(dir, arg)
			}
			if _, err := os.Stat(pth); err != nil {
				if !os.IsNotExist(err) {
					p.report.ErrTok(toks[0], err.Error())
				}
				if debugIncludes {
					fmt.Fprintf(os.Stderr, "include file %q not found\n", pth)
				}
				continue
			}

			ppf, err := ppParse(pth, p.report, p.tweaks)
			if err != nil {
				p.report.ErrTok(toks[0], err.Error())
				return
			}

			p.includeLevel++
			save := p.includedSearchPath
			p.includedSearchPath = dir
			p.preprocessingFile(ppf)
			p.includedSearchPath = save
			p.includeLevel--
			return
		}

		p.report.ErrTok(toks[0], "include file not found: %s. Search paths:\n\t%s", arg, strings.Join(clean(dirs), "\n\t"))
	case 7: // PPLINE PPTokenList '\n'
		toks := decodeTokens(n.PPTokenList, nil, false)
		// lineno, fname
		if len(toks) < 2 || toks[0].Rune != INTCONST || toks[1].Rune != STRINGLITERAL {
			break
		}

		ln, err := strconv.ParseUint(string(toks[0].S()), 10, mathutil.IntBits-1)
		if err != nil {
			break
		}

		fn := string(toks[1].S())
		fn = fn[1 : len(fn)-1] // Unquote.
		nl := n.Token2
		tf := xc.FileSet.File(nl.Pos())
		tf.AddLineInfo(tf.Offset(nl.Pos()+1), fn, int(ln))
	case 8: // PPPRAGMA PPTokenListOpt
		p.pragma(decodeTokens(n.PPTokenListOpt, nil, false))
	case
		9,  // PPUNDEF IDENTIFIER '\n'
		12: // PPUNDEF IDENTIFIER PPTokenList '\n'
		nm := n.Token2.Val
		if protectedMacros[nm] && p.protectMacros {
			p.report.ErrTok(n.Token2, "cannot undefine protected macro")
			return
		}

		if debugMacros {
			fmt.Fprintf(os.Stderr, "#undef %s\n", xc.Dict.S(nm))
		}
		delete(p.macros.m, nm)
	case 10: // PPDEFINE IDENTIFIER_LPAREN IdentifierList "..." ')' ReplacementList
		p.defineFnMacro(n.Token2, n.IdentifierList, n.ReplacementList, false, true)
	case 13: // PPINCLUDE_NEXT PPTokenList '\n'
		toks := decodeTokens(n.PPTokenList, nil, false)
		var exp []xc.Token
		p.expand(&tokenBuf{toks}, false, func(toks []xc.Token) { exp = append(exp, toks...) })
		toks = p.fixInclude(exp)
		if len(toks) == 0 {
			p.report.ErrTok(n.Token, "invalid #include_next argument")
			break
		}

		if p.includeLevel == maxIncludeLevel {
			p.report.ErrTok(toks[0], "too many include nesting levels")
			break
		}

		arg := string(toks[0].S())
		arg = arg[1 : len(arg)-1]
		origin := p.includedSearchPath
		var dirs []string
		found := false
		for i, dir := range p.includes {
			if dir == origin {
				dirs = p.includes[i+1:]
				found = true
				break
			}
		}
		if !found {
			for i, dir := range p.sysIncludes {
				if dir == origin {
					dirs = p.sysIncludes[i+1:]
					found = true
					break
				}
			}
		}

		for _, dir := range dirs {
			pth := filepath.Join(dir, arg)
			if _, err := os.Stat(pth); err != nil {
				if !os.IsNotExist(err) {
					p.report.ErrTok(toks[0], err.Error())
				}
				if debugIncludes {
					fmt.Fprintf(os.Stderr, "include file %q not found\n", pth)
				}
				continue
			}

			ppf, err := ppParse(pth, p.report, p.tweaks)
			if err != nil {
				p.report.ErrTok(toks[0], err.Error())
				return
			}

			p.includeLevel++
			save := p.includedSearchPath
			p.includedSearchPath = dir
			p.preprocessingFile(ppf)
			p.includedSearchPath = save
			p.includeLevel--
			return
		}

		p.report.ErrTok(toks[0], "include file not found: %s", arg)
	default:
		panic(n.Case)
	}
}