| Colin Cross | c0b06f1 | 2015-04-08 13:03:43 -0700 | [diff] [blame] | 1 | // Copyright 2015 Google Inc. All rights reserved. | 
|  | 2 | // | 
|  | 3 | // Licensed under the Apache License, Version 2.0 (the "License"); | 
|  | 4 | // you may not use this file except in compliance with the License. | 
|  | 5 | // You may obtain a copy of the License at | 
|  | 6 | // | 
|  | 7 | //     http://www.apache.org/licenses/LICENSE-2.0 | 
|  | 8 | // | 
|  | 9 | // Unless required by applicable law or agreed to in writing, software | 
|  | 10 | // distributed under the License is distributed on an "AS IS" BASIS, | 
|  | 11 | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | 
|  | 12 | // See the License for the specific language governing permissions and | 
|  | 13 | // limitations under the License. | 
|  | 14 |  | 
| Colin Cross | 635c3b0 | 2016-05-18 15:37:25 -0700 | [diff] [blame] | 15 | package android | 
| Colin Cross | c0b06f1 | 2015-04-08 13:03:43 -0700 | [diff] [blame] | 16 |  | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 17 | import ( | 
| Colin Cross | 3020fee | 2019-03-19 15:05:17 -0700 | [diff] [blame] | 18 | "fmt" | 
|  | 19 | "regexp" | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 20 | "runtime" | 
|  | 21 | "sort" | 
|  | 22 | "strings" | 
|  | 23 | ) | 
| Colin Cross | 1f8c52b | 2015-06-16 16:38:17 -0700 | [diff] [blame] | 24 |  | 
| Colin Cross | 454c087 | 2019-02-15 23:03:34 -0800 | [diff] [blame] | 25 | // CopyOf returns a new slice that has the same contents as s. | 
|  | 26 | func CopyOf(s []string) []string { | 
|  | 27 | return append([]string(nil), s...) | 
|  | 28 | } | 
|  | 29 |  | 
| Colin Cross | c0b06f1 | 2015-04-08 13:03:43 -0700 | [diff] [blame] | 30 | func JoinWithPrefix(strs []string, prefix string) string { | 
|  | 31 | if len(strs) == 0 { | 
|  | 32 | return "" | 
|  | 33 | } | 
|  | 34 |  | 
|  | 35 | if len(strs) == 1 { | 
|  | 36 | return prefix + strs[0] | 
|  | 37 | } | 
|  | 38 |  | 
|  | 39 | n := len(" ") * (len(strs) - 1) | 
|  | 40 | for _, s := range strs { | 
|  | 41 | n += len(prefix) + len(s) | 
|  | 42 | } | 
|  | 43 |  | 
|  | 44 | ret := make([]byte, 0, n) | 
|  | 45 | for i, s := range strs { | 
|  | 46 | if i != 0 { | 
|  | 47 | ret = append(ret, ' ') | 
|  | 48 | } | 
|  | 49 | ret = append(ret, prefix...) | 
|  | 50 | ret = append(ret, s...) | 
|  | 51 | } | 
|  | 52 | return string(ret) | 
|  | 53 | } | 
| Colin Cross | 9b6826f | 2015-04-10 15:47:33 -0700 | [diff] [blame] | 54 |  | 
| Colin Cross | 1f8c52b | 2015-06-16 16:38:17 -0700 | [diff] [blame] | 55 | func sortedKeys(m map[string][]string) []string { | 
|  | 56 | s := make([]string, 0, len(m)) | 
|  | 57 | for k := range m { | 
|  | 58 | s = append(s, k) | 
|  | 59 | } | 
|  | 60 | sort.Strings(s) | 
|  | 61 | return s | 
|  | 62 | } | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 63 |  | 
| Colin Cross | b4330e2 | 2017-12-22 15:47:09 -0800 | [diff] [blame] | 64 | func IndexList(s string, list []string) int { | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 65 | for i, l := range list { | 
|  | 66 | if l == s { | 
|  | 67 | return i | 
|  | 68 | } | 
|  | 69 | } | 
|  | 70 |  | 
|  | 71 | return -1 | 
|  | 72 | } | 
|  | 73 |  | 
| Colin Cross | b4330e2 | 2017-12-22 15:47:09 -0800 | [diff] [blame] | 74 | func InList(s string, list []string) bool { | 
|  | 75 | return IndexList(s, list) != -1 | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 76 | } | 
|  | 77 |  | 
| Colin Cross | b4330e2 | 2017-12-22 15:47:09 -0800 | [diff] [blame] | 78 | func PrefixInList(s string, list []string) bool { | 
| Ivan Lozano | 5f59553 | 2017-07-13 14:46:05 -0700 | [diff] [blame] | 79 | for _, prefix := range list { | 
|  | 80 | if strings.HasPrefix(s, prefix) { | 
|  | 81 | return true | 
|  | 82 | } | 
|  | 83 | } | 
|  | 84 | return false | 
|  | 85 | } | 
|  | 86 |  | 
| Colin Cross | b4330e2 | 2017-12-22 15:47:09 -0800 | [diff] [blame] | 87 | func FilterList(list []string, filter []string) (remainder []string, filtered []string) { | 
|  | 88 | for _, l := range list { | 
|  | 89 | if InList(l, filter) { | 
|  | 90 | filtered = append(filtered, l) | 
|  | 91 | } else { | 
|  | 92 | remainder = append(remainder, l) | 
|  | 93 | } | 
|  | 94 | } | 
|  | 95 |  | 
|  | 96 | return | 
|  | 97 | } | 
|  | 98 |  | 
|  | 99 | func RemoveListFromList(list []string, filter_out []string) (result []string) { | 
|  | 100 | result = make([]string, 0, len(list)) | 
|  | 101 | for _, l := range list { | 
|  | 102 | if !InList(l, filter_out) { | 
|  | 103 | result = append(result, l) | 
|  | 104 | } | 
|  | 105 | } | 
|  | 106 | return | 
|  | 107 | } | 
|  | 108 |  | 
|  | 109 | func RemoveFromList(s string, list []string) (bool, []string) { | 
|  | 110 | i := IndexList(s, list) | 
| Logan Chien | 7922ab8 | 2018-03-06 18:29:27 +0800 | [diff] [blame] | 111 | if i == -1 { | 
| Colin Cross | b4330e2 | 2017-12-22 15:47:09 -0800 | [diff] [blame] | 112 | return false, list | 
|  | 113 | } | 
| Logan Chien | 7922ab8 | 2018-03-06 18:29:27 +0800 | [diff] [blame] | 114 |  | 
|  | 115 | result := make([]string, 0, len(list)-1) | 
|  | 116 | result = append(result, list[:i]...) | 
|  | 117 | for _, l := range list[i+1:] { | 
|  | 118 | if l != s { | 
|  | 119 | result = append(result, l) | 
|  | 120 | } | 
|  | 121 | } | 
|  | 122 | return true, result | 
| Colin Cross | b4330e2 | 2017-12-22 15:47:09 -0800 | [diff] [blame] | 123 | } | 
|  | 124 |  | 
| Colin Cross | b671544 | 2017-10-24 11:13:31 -0700 | [diff] [blame] | 125 | // FirstUniqueStrings returns all unique elements of a slice of strings, keeping the first copy of | 
|  | 126 | // each.  It modifies the slice contents in place, and returns a subslice of the original slice. | 
|  | 127 | func FirstUniqueStrings(list []string) []string { | 
|  | 128 | k := 0 | 
|  | 129 | outer: | 
|  | 130 | for i := 0; i < len(list); i++ { | 
|  | 131 | for j := 0; j < k; j++ { | 
|  | 132 | if list[i] == list[j] { | 
|  | 133 | continue outer | 
|  | 134 | } | 
|  | 135 | } | 
|  | 136 | list[k] = list[i] | 
|  | 137 | k++ | 
|  | 138 | } | 
|  | 139 | return list[:k] | 
|  | 140 | } | 
|  | 141 |  | 
|  | 142 | // LastUniqueStrings returns all unique elements of a slice of strings, keeping the last copy of | 
|  | 143 | // each.  It modifies the slice contents in place, and returns a subslice of the original slice. | 
|  | 144 | func LastUniqueStrings(list []string) []string { | 
|  | 145 | totalSkip := 0 | 
|  | 146 | for i := len(list) - 1; i >= totalSkip; i-- { | 
|  | 147 | skip := 0 | 
|  | 148 | for j := i - 1; j >= totalSkip; j-- { | 
|  | 149 | if list[i] == list[j] { | 
|  | 150 | skip++ | 
|  | 151 | } else { | 
|  | 152 | list[j+skip] = list[j] | 
|  | 153 | } | 
|  | 154 | } | 
|  | 155 | totalSkip += skip | 
|  | 156 | } | 
|  | 157 | return list[totalSkip:] | 
|  | 158 | } | 
|  | 159 |  | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 160 | // checkCalledFromInit panics if a Go package's init function is not on the | 
|  | 161 | // call stack. | 
|  | 162 | func checkCalledFromInit() { | 
|  | 163 | for skip := 3; ; skip++ { | 
|  | 164 | _, funcName, ok := callerName(skip) | 
|  | 165 | if !ok { | 
|  | 166 | panic("not called from an init func") | 
|  | 167 | } | 
|  | 168 |  | 
| Colin Cross | 3020fee | 2019-03-19 15:05:17 -0700 | [diff] [blame] | 169 | if funcName == "init" || strings.HasPrefix(funcName, "init·") || | 
|  | 170 | strings.HasPrefix(funcName, "init.") { | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 171 | return | 
|  | 172 | } | 
|  | 173 | } | 
|  | 174 | } | 
|  | 175 |  | 
| Colin Cross | 3020fee | 2019-03-19 15:05:17 -0700 | [diff] [blame] | 176 | // A regex to find a package path within a function name. It finds the shortest string that is | 
|  | 177 | // followed by '.' and doesn't have any '/'s left. | 
|  | 178 | var pkgPathRe = regexp.MustCompile(`^(.*?)\.([^/]+)$`) | 
|  | 179 |  | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 180 | // callerName returns the package path and function name of the calling | 
|  | 181 | // function.  The skip argument has the same meaning as the skip argument of | 
|  | 182 | // runtime.Callers. | 
|  | 183 | func callerName(skip int) (pkgPath, funcName string, ok bool) { | 
|  | 184 | var pc [1]uintptr | 
|  | 185 | n := runtime.Callers(skip+1, pc[:]) | 
|  | 186 | if n != 1 { | 
|  | 187 | return "", "", false | 
|  | 188 | } | 
|  | 189 |  | 
| Colin Cross | 3020fee | 2019-03-19 15:05:17 -0700 | [diff] [blame] | 190 | f := runtime.FuncForPC(pc[0]).Name() | 
|  | 191 | s := pkgPathRe.FindStringSubmatch(f) | 
|  | 192 | if len(s) < 3 { | 
|  | 193 | panic(fmt.Errorf("failed to extract package path and function name from %q", f)) | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 194 | } | 
|  | 195 |  | 
| Colin Cross | 3020fee | 2019-03-19 15:05:17 -0700 | [diff] [blame] | 196 | return s[1], s[2], true | 
| Dan Willemsen | b1957a5 | 2016-06-23 23:44:54 -0700 | [diff] [blame] | 197 | } | 
| Sundong Ahn | 0926fae | 2017-10-17 16:34:51 +0900 | [diff] [blame] | 198 |  | 
|  | 199 | func GetNumericSdkVersion(v string) string { | 
|  | 200 | if strings.Contains(v, "system_") { | 
|  | 201 | return strings.Replace(v, "system_", "", 1) | 
|  | 202 | } | 
|  | 203 | return v | 
|  | 204 | } | 
| Jiyong Park | 7f67f48 | 2019-01-05 12:57:48 +0900 | [diff] [blame] | 205 |  | 
|  | 206 | // copied from build/kati/strutil.go | 
|  | 207 | func substPattern(pat, repl, str string) string { | 
|  | 208 | ps := strings.SplitN(pat, "%", 2) | 
|  | 209 | if len(ps) != 2 { | 
|  | 210 | if str == pat { | 
|  | 211 | return repl | 
|  | 212 | } | 
|  | 213 | return str | 
|  | 214 | } | 
|  | 215 | in := str | 
|  | 216 | trimed := str | 
|  | 217 | if ps[0] != "" { | 
|  | 218 | trimed = strings.TrimPrefix(in, ps[0]) | 
|  | 219 | if trimed == in { | 
|  | 220 | return str | 
|  | 221 | } | 
|  | 222 | } | 
|  | 223 | in = trimed | 
|  | 224 | if ps[1] != "" { | 
|  | 225 | trimed = strings.TrimSuffix(in, ps[1]) | 
|  | 226 | if trimed == in { | 
|  | 227 | return str | 
|  | 228 | } | 
|  | 229 | } | 
|  | 230 |  | 
|  | 231 | rs := strings.SplitN(repl, "%", 2) | 
|  | 232 | if len(rs) != 2 { | 
|  | 233 | return repl | 
|  | 234 | } | 
|  | 235 | return rs[0] + trimed + rs[1] | 
|  | 236 | } | 
|  | 237 |  | 
|  | 238 | // copied from build/kati/strutil.go | 
|  | 239 | func matchPattern(pat, str string) bool { | 
|  | 240 | i := strings.IndexByte(pat, '%') | 
|  | 241 | if i < 0 { | 
|  | 242 | return pat == str | 
|  | 243 | } | 
|  | 244 | return strings.HasPrefix(str, pat[:i]) && strings.HasSuffix(str, pat[i+1:]) | 
|  | 245 | } |