func.cc revision 212b7a568c07bdb8b4658ae27da9fdc7c44b274e
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 15// +build ignore 16 17#include "func.h" 18 19#include <errno.h> 20#include <limits.h> 21#include <stdio.h> 22#include <stdlib.h> 23#include <unistd.h> 24 25#include <algorithm> 26#include <iterator> 27#include <memory> 28#include <unordered_map> 29 30#include "eval.h" 31#include "fileutil.h" 32#include "find.h" 33#include "log.h" 34#include "parser.h" 35#include "stats.h" 36#include "stmt.h" 37#include "strutil.h" 38#include "symtab.h" 39#include "var.h" 40 41namespace { 42 43// TODO: This code is very similar to 44// NinjaGenerator::TranslateCommand. Factor them out. 45void StripShellComment(string* cmd) { 46 if (cmd->find('#') == string::npos) 47 return; 48 49 string res; 50 bool prev_backslash = false; 51 // Set space as an initial value so the leading comment will be 52 // stripped out. 53 char prev_char = ' '; 54 char quote = 0; 55 bool done = false; 56 const char* in = cmd->c_str(); 57 for (; *in && !done; in++) { 58 switch (*in) { 59 case '#': 60 if (quote == 0 && isspace(prev_char)) { 61 while (in[1] && *in != '\n') 62 in++; 63 break; 64 } 65 66 case '\'': 67 case '"': 68 case '`': 69 if (quote) { 70 if (quote == *in) 71 quote = 0; 72 } else if (!prev_backslash) { 73 quote = *in; 74 } 75 res += *in; 76 break; 77 78 case '\\': 79 res += '\\'; 80 break; 81 82 default: 83 res += *in; 84 } 85 86 if (*in == '\\') { 87 prev_backslash = !prev_backslash; 88 } else { 89 prev_backslash = false; 90 } 91 92 prev_char = *in; 93 } 94 cmd->swap(res); 95} 96 97void PatsubstFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 98 const string&& pat_str = args[0]->Eval(ev); 99 const string&& repl = args[1]->Eval(ev); 100 const string&& str = args[2]->Eval(ev); 101 WordWriter ww(s); 102 Pattern pat(pat_str); 103 for (StringPiece tok : WordScanner(str)) { 104 ww.MaybeAddWhitespace(); 105 pat.AppendSubst(tok, repl, s); 106 } 107} 108 109void StripFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 110 const string&& str = args[0]->Eval(ev); 111 WordWriter ww(s); 112 for (StringPiece tok : WordScanner(str)) { 113 ww.Write(tok); 114 } 115} 116 117void SubstFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 118 const string&& pat = args[0]->Eval(ev); 119 const string&& repl = args[1]->Eval(ev); 120 const string&& str = args[2]->Eval(ev); 121 if (pat.empty()) { 122 *s += str; 123 *s += repl; 124 return; 125 } 126 size_t index = 0; 127 while (index < str.size()) { 128 size_t found = str.find(pat, index); 129 if (found == string::npos) 130 break; 131 AppendString(StringPiece(str).substr(index, found - index), s); 132 AppendString(repl, s); 133 index = found + pat.size(); 134 } 135 AppendString(StringPiece(str).substr(index), s); 136} 137 138void FindstringFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 139 const string&& find = args[0]->Eval(ev); 140 const string&& in = args[1]->Eval(ev); 141 if (in.find(find) != string::npos) 142 AppendString(find, s); 143} 144 145void FilterFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 146 const string&& pat_buf = args[0]->Eval(ev); 147 const string&& text = args[1]->Eval(ev); 148 vector<Pattern> pats; 149 for (StringPiece pat : WordScanner(pat_buf)) { 150 pats.push_back(Pattern(pat)); 151 } 152 WordWriter ww(s); 153 for (StringPiece tok : WordScanner(text)) { 154 for (const Pattern& pat : pats) { 155 if (pat.Match(tok)) { 156 ww.Write(tok); 157 break; 158 } 159 } 160 } 161} 162 163void FilterOutFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 164 const string&& pat_buf = args[0]->Eval(ev); 165 const string&& text = args[1]->Eval(ev); 166 vector<Pattern> pats; 167 for (StringPiece pat : WordScanner(pat_buf)) { 168 pats.push_back(Pattern(pat)); 169 } 170 WordWriter ww(s); 171 for (StringPiece tok : WordScanner(text)) { 172 bool matched = false; 173 for (const Pattern& pat : pats) { 174 if (pat.Match(tok)) { 175 matched = true; 176 break; 177 } 178 } 179 if (!matched) 180 ww.Write(tok); 181 } 182} 183 184void SortFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 185 const string&& list = args[0]->Eval(ev); 186 vector<StringPiece> toks; 187 WordScanner(list).Split(&toks); 188 sort(toks.begin(), toks.end()); 189 WordWriter ww(s); 190 StringPiece prev; 191 for (StringPiece tok : toks) { 192 if (prev != tok) { 193 ww.Write(tok); 194 prev = tok; 195 } 196 } 197} 198 199static int GetNumericValueForFunc(const string& buf) { 200 StringPiece s = TrimLeftSpace(buf); 201 char* end; 202 long n = strtol(s.data(), &end, 10); 203 if (n < 0 || n == LONG_MAX || s.data() + s.size() != end) { 204 return -1; 205 } 206 return n; 207} 208 209void WordFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 210 const string&& n_str = args[0]->Eval(ev); 211 int n = GetNumericValueForFunc(n_str); 212 if (n < 0) { 213 ev->Error(StringPrintf( 214 "*** non-numeric first argument to `word' function: '%s'.", 215 n_str.c_str())); 216 } 217 if (n == 0) { 218 ev->Error("*** first argument to `word' function must be greater than 0."); 219 } 220 221 const string&& text = args[1]->Eval(ev); 222 for (StringPiece tok : WordScanner(text)) { 223 n--; 224 if (n == 0) { 225 AppendString(tok, s); 226 break; 227 } 228 } 229} 230 231void WordlistFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 232 const string&& s_str = args[0]->Eval(ev); 233 int si = GetNumericValueForFunc(s_str); 234 if (si < 0) { 235 ev->Error(StringPrintf( 236 "*** non-numeric first argument to `wordlist' function: '%s'.", 237 s_str.c_str())); 238 } 239 if (si == 0) { 240 ev->Error(StringPrintf( 241 "*** invalid first argument to `wordlist' function: %s`", 242 s_str.c_str())); 243 } 244 245 const string&& e_str = args[1]->Eval(ev); 246 int ei = GetNumericValueForFunc(e_str); 247 if (ei < 0) { 248 ev->Error(StringPrintf( 249 "*** non-numeric second argument to `wordlist' function: '%s'.", 250 e_str.c_str())); 251 } 252 253 const string&& text = args[2]->Eval(ev); 254 int i = 0; 255 WordWriter ww(s); 256 for (StringPiece tok : WordScanner(text)) { 257 i++; 258 if (si <= i && i <= ei) { 259 ww.Write(tok); 260 } 261 } 262} 263 264void WordsFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 265 const string&& text = args[0]->Eval(ev); 266 WordScanner ws(text); 267 int n = 0; 268 for (auto iter = ws.begin(); iter != ws.end(); ++iter) 269 n++; 270 char buf[32]; 271 sprintf(buf, "%d", n); 272 *s += buf; 273} 274 275void FirstwordFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 276 const string&& text = args[0]->Eval(ev); 277 for (StringPiece tok : WordScanner(text)) { 278 AppendString(tok, s); 279 return; 280 } 281} 282 283void LastwordFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 284 const string&& text = args[0]->Eval(ev); 285 StringPiece last; 286 for (StringPiece tok : WordScanner(text)) { 287 last = tok; 288 } 289 AppendString(last, s); 290} 291 292void JoinFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 293 const string&& list1 = args[0]->Eval(ev); 294 const string&& list2 = args[1]->Eval(ev); 295 WordScanner ws1(list1); 296 WordScanner ws2(list2); 297 WordWriter ww(s); 298 for (WordScanner::Iterator iter1 = ws1.begin(), iter2 = ws2.begin(); 299 iter1 != ws1.end() && iter2 != ws2.end(); 300 ++iter1, ++iter2) { 301 ww.Write(*iter1); 302 // Use |AppendString| not to append extra ' '. 303 AppendString(*iter2, s); 304 } 305} 306 307void WildcardFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 308 COLLECT_STATS("func wildcard time"); 309 const string&& pat = args[0]->Eval(ev); 310 // Note GNU make does not delay the execution of $(wildcard) so we 311 // do not need to check avoid_io here. 312 WordWriter ww(s); 313 vector<string>* files; 314 for (StringPiece tok : WordScanner(pat)) { 315 ScopedTerminator st(tok); 316 Glob(tok.data(), &files); 317 sort(files->begin(), files->end()); 318 for (const string& file : *files) { 319 ww.Write(file); 320 } 321 } 322} 323 324void DirFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 325 const string&& text = args[0]->Eval(ev); 326 WordWriter ww(s); 327 for (StringPiece tok : WordScanner(text)) { 328 ww.Write(Dirname(tok)); 329 s->push_back('/'); 330 } 331} 332 333void NotdirFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 334 const string&& text = args[0]->Eval(ev); 335 WordWriter ww(s); 336 for (StringPiece tok : WordScanner(text)) { 337 if (tok == "/") { 338 ww.Write(StringPiece("")); 339 } else { 340 ww.Write(Basename(tok)); 341 } 342 } 343} 344 345void SuffixFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 346 const string&& text = args[0]->Eval(ev); 347 WordWriter ww(s); 348 for (StringPiece tok : WordScanner(text)) { 349 StringPiece suf = GetExt(tok); 350 if (!suf.empty()) 351 ww.Write(suf); 352 } 353} 354 355void BasenameFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 356 const string&& text = args[0]->Eval(ev); 357 WordWriter ww(s); 358 for (StringPiece tok : WordScanner(text)) { 359 ww.Write(StripExt(tok)); 360 } 361} 362 363void AddsuffixFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 364 const string&& suf = args[0]->Eval(ev); 365 const string&& text = args[1]->Eval(ev); 366 WordWriter ww(s); 367 for (StringPiece tok : WordScanner(text)) { 368 ww.Write(tok); 369 *s += suf; 370 } 371} 372 373void AddprefixFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 374 const string&& pre = args[0]->Eval(ev); 375 const string&& text = args[1]->Eval(ev); 376 WordWriter ww(s); 377 for (StringPiece tok : WordScanner(text)) { 378 ww.Write(pre); 379 AppendString(tok, s); 380 } 381} 382 383void RealpathFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 384 const string&& text = args[0]->Eval(ev); 385 if (ev->avoid_io()) { 386 *s += "$(realpath "; 387 *s += text; 388 *s += " 2> /dev/null)"; 389 return; 390 } 391 392 WordWriter ww(s); 393 for (StringPiece tok : WordScanner(text)) { 394 ScopedTerminator st(tok); 395 char buf[PATH_MAX]; 396 if (realpath(tok.data(), buf)) 397 *s += buf; 398 } 399} 400 401void AbspathFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 402 const string&& text = args[0]->Eval(ev); 403 WordWriter ww(s); 404 string buf; 405 for (StringPiece tok : WordScanner(text)) { 406 AbsPath(tok, &buf); 407 ww.Write(buf); 408 } 409} 410 411void IfFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 412 const string&& cond = args[0]->Eval(ev); 413 if (cond.empty()) { 414 if (args.size() > 2) 415 args[2]->Eval(ev, s); 416 } else { 417 args[1]->Eval(ev, s); 418 } 419} 420 421void AndFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 422 string cond; 423 for (Value* a : args) { 424 cond = a->Eval(ev); 425 if (cond.empty()) 426 return; 427 } 428 if (!cond.empty()) { 429 *s += cond; 430 } 431} 432 433void OrFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 434 for (Value* a : args) { 435 const string&& cond = a->Eval(ev); 436 if (!cond.empty()) { 437 *s += cond; 438 return; 439 } 440 } 441} 442 443void ValueFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 444 const string&& var_name = args[0]->Eval(ev); 445 Var* var = ev->LookupVar(Intern(var_name)); 446 AppendString(var->String().as_string(), s); 447} 448 449void EvalFunc(const vector<Value*>& args, Evaluator* ev, string*) { 450 // TODO: eval leaks everything... for now. 451 //const string text = args[0]->Eval(ev); 452 string* text = new string; 453 args[0]->Eval(ev, text); 454 vector<Stmt*> stmts; 455 Parse(*text, ev->loc(), &stmts); 456 for (Stmt* stmt : stmts) { 457 LOG("%s", stmt->DebugString().c_str()); 458 stmt->Eval(ev); 459 //delete stmt; 460 } 461} 462 463//#define TEST_FIND_EMULATOR 464 465// A hack for Android build. We need to evaluate things like $((3+4)) 466// when we emit ninja file, because the result of such expressions 467// will be passed to other make functions. 468// TODO: Maybe we should introduce a helper binary which evaluate 469// make expressions at ninja-time. 470static bool HasNoIoInShellScript(const string& cmd) { 471 if (cmd.empty()) 472 return true; 473 if (HasPrefix(cmd, "echo $((") && cmd[cmd.size()-1] == ')') 474 return true; 475 return false; 476} 477 478static void ShellFuncImpl(const string& shell, const string& cmd, 479 string* s, FindCommand** fc) { 480 LOG("ShellFunc: %s", cmd.c_str()); 481 482#ifdef TEST_FIND_EMULATOR 483 bool need_check = false; 484 string out2; 485#endif 486 if (FindEmulator::Get()) { 487 *fc = new FindCommand(); 488 if ((*fc)->Parse(cmd)) { 489#ifdef TEST_FIND_EMULATOR 490 if (FindEmulator::Get()->HandleFind(cmd, **fc, &out2)) { 491 need_check = true; 492 } 493#else 494 if (FindEmulator::Get()->HandleFind(cmd, **fc, s)) { 495 return; 496 } 497#endif 498 } 499 delete *fc; 500 *fc = NULL; 501 } 502 503 COLLECT_STATS_WITH_SLOW_REPORT("func shell time", cmd.c_str()); 504 RunCommand(shell, cmd, RedirectStderr::NONE, s); 505 FormatForCommandSubstitution(s); 506 507#ifdef TEST_FIND_EMULATOR 508 if (need_check) { 509 if (*s != out2) { 510 ERROR("FindEmulator is broken: %s\n%s\nvs\n%s", 511 cmd.c_str(), s->c_str(), out2.c_str()); 512 } 513 } 514#endif 515} 516 517static vector<CommandResult*> g_command_results; 518 519bool ShouldStoreCommandResult(StringPiece cmd) { 520 if (HasWord(cmd, "date") || HasWord(cmd, "echo")) 521 return false; 522 if (g_flags.ignore_dirty_pattern) { 523 Pattern pat(g_flags.ignore_dirty_pattern); 524 for (StringPiece tok : WordScanner(cmd)) { 525 if (pat.Match(tok)) 526 return false; 527 } 528 } 529 return true; 530} 531 532void ShellFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 533 string cmd = args[0]->Eval(ev); 534 if (ev->avoid_io() && !HasNoIoInShellScript(cmd)) { 535 StripShellComment(&cmd); 536 *s += "$("; 537 *s += cmd; 538 *s += ")"; 539 return; 540 } 541 542 const string&& shell = ev->EvalVar(kShellSym); 543 544 string out; 545 FindCommand* fc = NULL; 546 ShellFuncImpl(shell, cmd, &out, &fc); 547 if (ShouldStoreCommandResult(cmd)) { 548 CommandResult* cr = new CommandResult(); 549 cr->cmd = cmd; 550 cr->find.reset(fc); 551 cr->result = out; 552 g_command_results.push_back(cr); 553 } 554 *s += out; 555} 556 557void CallFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 558 static const string tmpvar_names[] = { 559 "0", "1", "2", "3", "4", "5", "6", "7", "8", "9" 560 }; 561 562 const string&& func_name = args[0]->Eval(ev); 563 Var* func = ev->LookupVar(Intern(func_name)); 564 vector<unique_ptr<SimpleVar>> av; 565 for (size_t i = 1; i < args.size(); i++) { 566 unique_ptr<SimpleVar> s( 567 new SimpleVar(args[i]->Eval(ev), VarOrigin::AUTOMATIC)); 568 av.push_back(move(s)); 569 } 570 vector<unique_ptr<ScopedVar>> sv; 571 for (size_t i = 1; ; i++) { 572 string s; 573 StringPiece tmpvar_name; 574 if (i < sizeof(tmpvar_names)/sizeof(tmpvar_names[0])) { 575 tmpvar_name = tmpvar_names[i]; 576 } else { 577 s = StringPrintf("%d", i); 578 tmpvar_name = s; 579 } 580 if (i < args.size()) { 581 sv.emplace_back(new ScopedVar(ev->mutable_vars(), 582 Intern(tmpvar_name), av[i-1].get())); 583 } else { 584 // We need to blank further automatic vars 585 Var *v = ev->LookupVar(Intern(tmpvar_name)); 586 if (!v->IsDefined()) break; 587 if (v->Origin() != VarOrigin::AUTOMATIC) break; 588 589 av.emplace_back(new SimpleVar("", VarOrigin::AUTOMATIC)); 590 sv.emplace_back(new ScopedVar(ev->mutable_vars(), 591 Intern(tmpvar_name), av[i-1].get())); 592 } 593 } 594 func->Eval(ev, s); 595} 596 597void ForeachFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 598 const string&& varname = args[0]->Eval(ev); 599 const string&& list = args[1]->Eval(ev); 600 WordWriter ww(s); 601 for (StringPiece tok : WordScanner(list)) { 602 unique_ptr<SimpleVar> v(new SimpleVar( 603 tok.as_string(), VarOrigin::AUTOMATIC)); 604 ScopedVar sv(ev->mutable_vars(), Intern(varname), v.get()); 605 ww.MaybeAddWhitespace(); 606 args[2]->Eval(ev, s); 607 } 608} 609 610void OriginFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 611 const string&& var_name = args[0]->Eval(ev); 612 Var* var = ev->LookupVar(Intern(var_name)); 613 *s += GetOriginStr(var->Origin()); 614} 615 616void FlavorFunc(const vector<Value*>& args, Evaluator* ev, string* s) { 617 const string&& var_name = args[0]->Eval(ev); 618 Var* var = ev->LookupVar(Intern(var_name)); 619 *s += var->Flavor(); 620} 621 622void InfoFunc(const vector<Value*>& args, Evaluator* ev, string*) { 623 const string&& a = args[0]->Eval(ev); 624 if (ev->avoid_io()) { 625 ev->add_delayed_output_command(StringPrintf("echo -e \"%s\"", EchoEscape(a).c_str())); 626 return; 627 } 628 printf("%s\n", a.c_str()); 629 fflush(stdout); 630} 631 632void WarningFunc(const vector<Value*>& args, Evaluator* ev, string*) { 633 const string&& a = args[0]->Eval(ev); 634 if (ev->avoid_io()) { 635 ev->add_delayed_output_command( 636 StringPrintf("echo -e \"%s:%d: %s\" 2>&1", LOCF(ev->loc()), EchoEscape(a).c_str())); 637 return; 638 } 639 printf("%s:%d: %s\n", LOCF(ev->loc()), a.c_str()); 640 fflush(stdout); 641} 642 643void ErrorFunc(const vector<Value*>& args, Evaluator* ev, string*) { 644 const string&& a = args[0]->Eval(ev); 645 if (ev->avoid_io()) { 646 ev->add_delayed_output_command( 647 StringPrintf("echo -e \"%s:%d: *** %s.\" 2>&1 && false", 648 LOCF(ev->loc()), EchoEscape(a).c_str())); 649 return; 650 } 651 ev->Error(StringPrintf("*** %s.", a.c_str())); 652} 653 654FuncInfo g_func_infos[] = { 655 { "patsubst", &PatsubstFunc, 3, 3, false, false }, 656 { "strip", &StripFunc, 1, 1, false, false }, 657 { "subst", &SubstFunc, 3, 3, false, false }, 658 { "findstring", &FindstringFunc, 2, 2, false, false }, 659 { "filter", &FilterFunc, 2, 2, false, false }, 660 { "filter-out", &FilterOutFunc, 2, 2, false, false }, 661 { "sort", &SortFunc, 1, 1, false, false }, 662 { "word", &WordFunc, 2, 2, false, false }, 663 { "wordlist", &WordlistFunc, 3, 3, false, false }, 664 { "words", &WordsFunc, 1, 1, false, false }, 665 { "firstword", &FirstwordFunc, 1, 1, false, false }, 666 { "lastword", &LastwordFunc, 1, 1, false, false }, 667 668 { "join", &JoinFunc, 2, 2, false, false }, 669 { "wildcard", &WildcardFunc, 1, 1, false, false }, 670 { "dir", &DirFunc, 1, 1, false, false }, 671 { "notdir", &NotdirFunc, 1, 1, false, false }, 672 { "suffix", &SuffixFunc, 1, 1, false, false }, 673 { "basename", &BasenameFunc, 1, 1, false, false }, 674 { "addsuffix", &AddsuffixFunc, 2, 2, false, false }, 675 { "addprefix", &AddprefixFunc, 2, 2, false, false }, 676 { "realpath", &RealpathFunc, 1, 1, false, false }, 677 { "abspath", &AbspathFunc, 1, 1, false, false }, 678 679 { "if", &IfFunc, 3, 2, false, true }, 680 { "and", &AndFunc, 0, 0, true, false }, 681 { "or", &OrFunc, 0, 0, true, false }, 682 683 { "value", &ValueFunc, 1, 1, false, false }, 684 { "eval", &EvalFunc, 1, 1, false, false }, 685 { "shell", &ShellFunc, 1, 1, false, false }, 686 { "call", &CallFunc, 0, 0, false, false }, 687 { "foreach", &ForeachFunc, 3, 3, false, false }, 688 689 { "origin", &OriginFunc, 1, 1, false, false }, 690 { "flavor", &FlavorFunc, 1, 1, false, false }, 691 692 { "info", &InfoFunc, 1, 1, false, false }, 693 { "warning", &WarningFunc, 1, 1, false, false }, 694 { "error", &ErrorFunc, 1, 1, false, false }, 695}; 696 697unordered_map<StringPiece, FuncInfo*>* g_func_info_map; 698 699} // namespace 700 701void InitFuncTable() { 702 g_func_info_map = new unordered_map<StringPiece, FuncInfo*>; 703 for (size_t i = 0; i < sizeof(g_func_infos) / sizeof(g_func_infos[0]); i++) { 704 FuncInfo* fi = &g_func_infos[i]; 705 bool ok = g_func_info_map->emplace(fi->name, fi).second; 706 CHECK(ok); 707 } 708} 709 710void QuitFuncTable() { 711 delete g_func_info_map; 712} 713 714FuncInfo* GetFuncInfo(StringPiece name) { 715 auto found = g_func_info_map->find(name); 716 if (found == g_func_info_map->end()) 717 return NULL; 718 return found->second; 719} 720 721const vector<CommandResult*>& GetShellCommandResults() { 722 return g_command_results; 723} 724