2017-11-17 19:55:38 +01:00
|
|
|
// Copyright 2017 Google Inc. All rights reserved.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
2015-01-31 02:27:36 +01:00
|
|
|
package parser
|
|
|
|
|
|
|
|
import (
|
2020-11-29 21:51:55 +01:00
|
|
|
"fmt"
|
2015-01-31 02:27:36 +01:00
|
|
|
"strings"
|
|
|
|
"unicode"
|
2020-11-29 21:51:55 +01:00
|
|
|
"unicode/utf8"
|
2015-01-31 02:27:36 +01:00
|
|
|
)
|
|
|
|
|
|
|
|
// A MakeString is a string that may contain variable substitutions in it.
|
|
|
|
// It can be considered as an alternating list of raw Strings and variable
|
|
|
|
// substitutions, where the first and last entries in the list must be raw
|
|
|
|
// Strings (possibly empty). A MakeString that starts with a variable
|
|
|
|
// will have an empty first raw string, and a MakeString that ends with a
|
|
|
|
// variable will have an empty last raw string. Two sequential Variables
|
|
|
|
// will have an empty raw string between them.
|
|
|
|
//
|
|
|
|
// The MakeString is stored as two lists, a list of raw Strings and a list
|
|
|
|
// of Variables. The raw string list is always one longer than the variable
|
|
|
|
// list.
|
|
|
|
type MakeString struct {
|
2016-05-26 02:25:40 +02:00
|
|
|
StringPos Pos
|
2015-01-31 02:27:36 +01:00
|
|
|
Strings []string
|
|
|
|
Variables []Variable
|
|
|
|
}
|
|
|
|
|
2016-05-26 02:25:40 +02:00
|
|
|
func SimpleMakeString(s string, pos Pos) *MakeString {
|
2015-01-31 02:27:36 +01:00
|
|
|
return &MakeString{
|
2016-05-26 02:25:40 +02:00
|
|
|
StringPos: pos,
|
|
|
|
Strings: []string{s},
|
2015-01-31 02:27:36 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-06-01 00:44:17 +02:00
|
|
|
func (ms *MakeString) Clone() (result *MakeString) {
|
|
|
|
clone := *ms
|
|
|
|
return &clone
|
|
|
|
}
|
|
|
|
|
2016-05-26 02:25:40 +02:00
|
|
|
func (ms *MakeString) Pos() Pos {
|
|
|
|
return ms.StringPos
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) End() Pos {
|
|
|
|
pos := ms.StringPos
|
|
|
|
if len(ms.Strings) > 1 {
|
|
|
|
pos = ms.Variables[len(ms.Variables)-1].End()
|
|
|
|
}
|
|
|
|
return Pos(int(pos) + len(ms.Strings[len(ms.Strings)-1]))
|
|
|
|
}
|
|
|
|
|
2015-01-31 02:27:36 +01:00
|
|
|
func (ms *MakeString) appendString(s string) {
|
|
|
|
if len(ms.Strings) == 0 {
|
|
|
|
ms.Strings = []string{s}
|
|
|
|
return
|
|
|
|
} else {
|
|
|
|
ms.Strings[len(ms.Strings)-1] += s
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) appendVariable(v Variable) {
|
|
|
|
if len(ms.Strings) == 0 {
|
|
|
|
ms.Strings = []string{"", ""}
|
|
|
|
ms.Variables = []Variable{v}
|
|
|
|
} else {
|
|
|
|
ms.Strings = append(ms.Strings, "")
|
|
|
|
ms.Variables = append(ms.Variables, v)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) appendMakeString(other *MakeString) {
|
|
|
|
last := len(ms.Strings) - 1
|
|
|
|
ms.Strings[last] += other.Strings[0]
|
|
|
|
ms.Strings = append(ms.Strings, other.Strings[1:]...)
|
|
|
|
ms.Variables = append(ms.Variables, other.Variables...)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) Value(scope Scope) string {
|
|
|
|
if len(ms.Strings) == 0 {
|
|
|
|
return ""
|
|
|
|
} else {
|
2018-02-21 11:10:29 +01:00
|
|
|
ret := unescape(ms.Strings[0])
|
2015-01-31 02:27:36 +01:00
|
|
|
for i := range ms.Strings[1:] {
|
|
|
|
ret += ms.Variables[i].Value(scope)
|
2018-02-21 11:10:29 +01:00
|
|
|
ret += unescape(ms.Strings[i+1])
|
2015-01-31 02:27:36 +01:00
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) Dump() string {
|
|
|
|
if len(ms.Strings) == 0 {
|
|
|
|
return ""
|
|
|
|
} else {
|
|
|
|
ret := ms.Strings[0]
|
|
|
|
for i := range ms.Strings[1:] {
|
|
|
|
ret += ms.Variables[i].Dump()
|
|
|
|
ret += ms.Strings[i+1]
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) Const() bool {
|
|
|
|
return len(ms.Strings) <= 1
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) Empty() bool {
|
|
|
|
return len(ms.Strings) == 0 || (len(ms.Strings) == 1 && ms.Strings[0] == "")
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) Split(sep string) []*MakeString {
|
|
|
|
return ms.SplitN(sep, -1)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) SplitN(sep string, n int) []*MakeString {
|
2018-02-21 11:10:29 +01:00
|
|
|
return ms.splitNFunc(n, func(s string, n int) []string {
|
|
|
|
return splitAnyN(s, sep, n)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2020-11-29 21:51:55 +01:00
|
|
|
// Words splits MakeString into multiple makeStrings separated by whitespace.
|
|
|
|
// Thus, " a $(X)b c " will be split into ["a", "$(X)b", "c"].
|
|
|
|
// Splitting a MakeString consisting solely of whitespace yields empty array.
|
2018-02-21 11:10:29 +01:00
|
|
|
func (ms *MakeString) Words() []*MakeString {
|
2020-11-29 21:51:55 +01:00
|
|
|
var ch rune // current character
|
|
|
|
const EOF = -1 // no more characters
|
|
|
|
const EOS = -2 // at the end of a string chunk
|
|
|
|
|
|
|
|
// Next character's chunk and position
|
|
|
|
iString := 0
|
|
|
|
iChar := 0
|
|
|
|
|
|
|
|
var words []*MakeString
|
|
|
|
word := SimpleMakeString("", ms.Pos())
|
|
|
|
|
|
|
|
nextChar := func() {
|
|
|
|
if iString >= len(ms.Strings) {
|
|
|
|
ch = EOF
|
|
|
|
} else if iChar >= len(ms.Strings[iString]) {
|
|
|
|
iString++
|
|
|
|
iChar = 0
|
|
|
|
ch = EOS
|
|
|
|
} else {
|
|
|
|
var w int
|
|
|
|
ch, w = utf8.DecodeRuneInString(ms.Strings[iString][iChar:])
|
|
|
|
iChar += w
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
appendVariableAndAdvance := func() {
|
|
|
|
if iString-1 < len(ms.Variables) {
|
|
|
|
word.appendVariable(ms.Variables[iString-1])
|
|
|
|
}
|
|
|
|
nextChar()
|
|
|
|
}
|
|
|
|
|
|
|
|
appendCharAndAdvance := func(c rune) {
|
|
|
|
if c != EOF {
|
|
|
|
word.appendString(string(c))
|
|
|
|
}
|
|
|
|
nextChar()
|
|
|
|
}
|
|
|
|
|
|
|
|
nextChar()
|
|
|
|
for ch != EOF {
|
|
|
|
// Skip whitespace
|
|
|
|
for ch == ' ' || ch == '\t' {
|
|
|
|
nextChar()
|
|
|
|
}
|
|
|
|
if ch == EOS {
|
|
|
|
// "... $(X)... " case. The current word should be empty.
|
|
|
|
if !word.Empty() {
|
|
|
|
panic(fmt.Errorf("%q: EOS while current word %q is not empty, iString=%d",
|
|
|
|
ms.Dump(), word.Dump(), iString))
|
|
|
|
}
|
|
|
|
appendVariableAndAdvance()
|
|
|
|
}
|
|
|
|
// Copy word
|
|
|
|
for ch != EOF {
|
|
|
|
if ch == ' ' || ch == '\t' {
|
|
|
|
words = append(words, word)
|
|
|
|
word = SimpleMakeString("", ms.Pos())
|
|
|
|
break
|
|
|
|
}
|
|
|
|
if ch == EOS {
|
|
|
|
// "...a$(X)..." case. Append variable to the current word
|
|
|
|
appendVariableAndAdvance()
|
|
|
|
} else {
|
|
|
|
if ch == '\\' {
|
|
|
|
appendCharAndAdvance('\\')
|
|
|
|
}
|
|
|
|
appendCharAndAdvance(ch)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if !word.Empty() {
|
|
|
|
words = append(words, word)
|
|
|
|
}
|
|
|
|
return words
|
2018-02-21 11:10:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) splitNFunc(n int, splitFunc func(s string, n int) []string) []*MakeString {
|
2015-01-31 02:27:36 +01:00
|
|
|
ret := []*MakeString{}
|
|
|
|
|
2016-05-26 02:25:40 +02:00
|
|
|
curMs := SimpleMakeString("", ms.Pos())
|
2015-01-31 02:27:36 +01:00
|
|
|
|
|
|
|
var i int
|
|
|
|
var s string
|
|
|
|
for i, s = range ms.Strings {
|
|
|
|
if n != 0 {
|
2018-02-21 11:10:29 +01:00
|
|
|
split := splitFunc(s, n)
|
2015-01-31 02:27:36 +01:00
|
|
|
if n != -1 {
|
|
|
|
if len(split) > n {
|
|
|
|
panic("oops!")
|
|
|
|
} else {
|
|
|
|
n -= len(split)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
curMs.appendString(split[0])
|
|
|
|
|
|
|
|
for _, r := range split[1:] {
|
|
|
|
ret = append(ret, curMs)
|
2016-05-26 02:25:40 +02:00
|
|
|
curMs = SimpleMakeString(r, ms.Pos())
|
2015-01-31 02:27:36 +01:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
curMs.appendString(s)
|
|
|
|
}
|
|
|
|
|
|
|
|
if i < len(ms.Strings)-1 {
|
|
|
|
curMs.appendVariable(ms.Variables[i])
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-11-29 21:51:55 +01:00
|
|
|
ret = append(ret, curMs)
|
2015-01-31 02:27:36 +01:00
|
|
|
return ret
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) TrimLeftSpaces() {
|
2016-05-26 02:25:40 +02:00
|
|
|
l := len(ms.Strings[0])
|
2015-01-31 02:27:36 +01:00
|
|
|
ms.Strings[0] = strings.TrimLeftFunc(ms.Strings[0], unicode.IsSpace)
|
2016-05-26 02:25:40 +02:00
|
|
|
ms.StringPos += Pos(len(ms.Strings[0]) - l)
|
2015-01-31 02:27:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) TrimRightSpaces() {
|
|
|
|
last := len(ms.Strings) - 1
|
|
|
|
ms.Strings[last] = strings.TrimRightFunc(ms.Strings[last], unicode.IsSpace)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) TrimRightOne() {
|
|
|
|
last := len(ms.Strings) - 1
|
|
|
|
if len(ms.Strings[last]) > 1 {
|
|
|
|
ms.Strings[last] = ms.Strings[last][0 : len(ms.Strings[last])-1]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ms *MakeString) EndsWith(ch rune) bool {
|
|
|
|
s := ms.Strings[len(ms.Strings)-1]
|
|
|
|
return s[len(s)-1] == uint8(ch)
|
|
|
|
}
|
|
|
|
|
2017-06-01 00:44:17 +02:00
|
|
|
func (ms *MakeString) ReplaceLiteral(input string, output string) {
|
|
|
|
for i := range ms.Strings {
|
|
|
|
ms.Strings[i] = strings.Replace(ms.Strings[i], input, output, -1)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-01-31 02:27:36 +01:00
|
|
|
func splitAnyN(s, sep string, n int) []string {
|
|
|
|
ret := []string{}
|
|
|
|
for n == -1 || n > 1 {
|
|
|
|
index := strings.IndexAny(s, sep)
|
|
|
|
if index >= 0 {
|
|
|
|
ret = append(ret, s[0:index])
|
|
|
|
s = s[index+1:]
|
|
|
|
if n > 0 {
|
|
|
|
n--
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ret = append(ret, s)
|
|
|
|
return ret
|
|
|
|
}
|
2018-02-21 11:10:29 +01:00
|
|
|
|
|
|
|
func unescape(s string) string {
|
|
|
|
ret := ""
|
|
|
|
for {
|
|
|
|
index := strings.IndexByte(s, '\\')
|
|
|
|
if index < 0 {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
if index+1 == len(s) {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
switch s[index+1] {
|
|
|
|
case ' ', '\\', '#', ':', '*', '[', '|', '\t', '\n', '\r':
|
|
|
|
ret += s[:index] + s[index+1:index+2]
|
|
|
|
default:
|
|
|
|
ret += s[:index+2]
|
|
|
|
}
|
|
|
|
s = s[index+2:]
|
|
|
|
}
|
|
|
|
return ret + s
|
|
|
|
}
|