1 //===- lib/Support/YAMLTraits.cpp -----------------------------------------===// 2 // 3 // The LLVM Linker 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 #include "llvm/Support/Errc.h" 11 #include "llvm/ADT/Twine.h" 12 #include "llvm/Support/Casting.h" 13 #include "llvm/Support/ErrorHandling.h" 14 #include "llvm/Support/Format.h" 15 #include "llvm/Support/YAMLParser.h" 16 #include "llvm/Support/YAMLTraits.h" 17 #include "llvm/Support/raw_ostream.h" 18 #include <cctype> 19 #include <cstring> 20 using namespace llvm; 21 using namespace yaml; 22 23 //===----------------------------------------------------------------------===// 24 // IO 25 //===----------------------------------------------------------------------===// 26 27 IO::IO(void *Context) : Ctxt(Context) { 28 } 29 30 IO::~IO() { 31 } 32 33 void *IO::getContext() { 34 return Ctxt; 35 } 36 37 void IO::setContext(void *Context) { 38 Ctxt = Context; 39 } 40 41 //===----------------------------------------------------------------------===// 42 // Input 43 //===----------------------------------------------------------------------===// 44 45 Input::Input(StringRef InputContent, 46 void *Ctxt, 47 SourceMgr::DiagHandlerTy DiagHandler, 48 void *DiagHandlerCtxt) 49 : IO(Ctxt), 50 Strm(new Stream(InputContent, SrcMgr)), 51 CurrentNode(nullptr) { 52 if (DiagHandler) 53 SrcMgr.setDiagHandler(DiagHandler, DiagHandlerCtxt); 54 DocIterator = Strm->begin(); 55 } 56 57 Input::~Input() { 58 } 59 60 std::error_code Input::error() { return EC; } 61 62 // Pin the vtables to this file. 63 void Input::HNode::anchor() {} 64 void Input::EmptyHNode::anchor() {} 65 void Input::ScalarHNode::anchor() {} 66 void Input::MapHNode::anchor() {} 67 void Input::SequenceHNode::anchor() {} 68 69 bool Input::outputting() { 70 return false; 71 } 72 73 bool Input::setCurrentDocument() { 74 if (DocIterator != Strm->end()) { 75 Node *N = DocIterator->getRoot(); 76 if (!N) { 77 assert(Strm->failed() && "Root is NULL iff parsing failed"); 78 EC = make_error_code(errc::invalid_argument); 79 return false; 80 } 81 82 if (isa<NullNode>(N)) { 83 // Empty files are allowed and ignored 84 ++DocIterator; 85 return setCurrentDocument(); 86 } 87 TopNode = this->createHNodes(N); 88 CurrentNode = TopNode.get(); 89 return true; 90 } 91 return false; 92 } 93 94 bool Input::nextDocument() { 95 return ++DocIterator != Strm->end(); 96 } 97 98 bool Input::mapTag(StringRef Tag, bool Default) { 99 std::string foundTag = CurrentNode->_node->getVerbatimTag(); 100 if (foundTag.empty()) { 101 // If no tag found and 'Tag' is the default, say it was found. 102 return Default; 103 } 104 // Return true iff found tag matches supplied tag. 105 return Tag.equals(foundTag); 106 } 107 108 void Input::beginMapping() { 109 if (EC) 110 return; 111 // CurrentNode can be null if the document is empty. 112 MapHNode *MN = dyn_cast_or_null<MapHNode>(CurrentNode); 113 if (MN) { 114 MN->ValidKeys.clear(); 115 } 116 } 117 118 bool Input::preflightKey(const char *Key, bool Required, bool, bool &UseDefault, 119 void *&SaveInfo) { 120 UseDefault = false; 121 if (EC) 122 return false; 123 124 // CurrentNode is null for empty documents, which is an error in case required 125 // nodes are present. 126 if (!CurrentNode) { 127 if (Required) 128 EC = make_error_code(errc::invalid_argument); 129 return false; 130 } 131 132 MapHNode *MN = dyn_cast<MapHNode>(CurrentNode); 133 if (!MN) { 134 setError(CurrentNode, "not a mapping"); 135 return false; 136 } 137 MN->ValidKeys.push_back(Key); 138 HNode *Value = MN->Mapping[Key].get(); 139 if (!Value) { 140 if (Required) 141 setError(CurrentNode, Twine("missing required key '") + Key + "'"); 142 else 143 UseDefault = true; 144 return false; 145 } 146 SaveInfo = CurrentNode; 147 CurrentNode = Value; 148 return true; 149 } 150 151 void Input::postflightKey(void *saveInfo) { 152 CurrentNode = reinterpret_cast<HNode *>(saveInfo); 153 } 154 155 void Input::endMapping() { 156 if (EC) 157 return; 158 // CurrentNode can be null if the document is empty. 159 MapHNode *MN = dyn_cast_or_null<MapHNode>(CurrentNode); 160 if (!MN) 161 return; 162 for (const auto &NN : MN->Mapping) { 163 if (!MN->isValidKey(NN.first())) { 164 setError(NN.second.get(), Twine("unknown key '") + NN.first() + "'"); 165 break; 166 } 167 } 168 } 169 170 unsigned Input::beginSequence() { 171 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 172 return SQ->Entries.size(); 173 } 174 return 0; 175 } 176 177 void Input::endSequence() { 178 } 179 180 bool Input::preflightElement(unsigned Index, void *&SaveInfo) { 181 if (EC) 182 return false; 183 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 184 SaveInfo = CurrentNode; 185 CurrentNode = SQ->Entries[Index].get(); 186 return true; 187 } 188 return false; 189 } 190 191 void Input::postflightElement(void *SaveInfo) { 192 CurrentNode = reinterpret_cast<HNode *>(SaveInfo); 193 } 194 195 unsigned Input::beginFlowSequence() { 196 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 197 return SQ->Entries.size(); 198 } 199 return 0; 200 } 201 202 bool Input::preflightFlowElement(unsigned index, void *&SaveInfo) { 203 if (EC) 204 return false; 205 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 206 SaveInfo = CurrentNode; 207 CurrentNode = SQ->Entries[index].get(); 208 return true; 209 } 210 return false; 211 } 212 213 void Input::postflightFlowElement(void *SaveInfo) { 214 CurrentNode = reinterpret_cast<HNode *>(SaveInfo); 215 } 216 217 void Input::endFlowSequence() { 218 } 219 220 void Input::beginEnumScalar() { 221 ScalarMatchFound = false; 222 } 223 224 bool Input::matchEnumScalar(const char *Str, bool) { 225 if (ScalarMatchFound) 226 return false; 227 if (ScalarHNode *SN = dyn_cast<ScalarHNode>(CurrentNode)) { 228 if (SN->value().equals(Str)) { 229 ScalarMatchFound = true; 230 return true; 231 } 232 } 233 return false; 234 } 235 236 bool Input::matchEnumFallback() { 237 if (ScalarMatchFound) 238 return false; 239 ScalarMatchFound = true; 240 return true; 241 } 242 243 void Input::endEnumScalar() { 244 if (!ScalarMatchFound) { 245 setError(CurrentNode, "unknown enumerated scalar"); 246 } 247 } 248 249 bool Input::beginBitSetScalar(bool &DoClear) { 250 BitValuesUsed.clear(); 251 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 252 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false); 253 } else { 254 setError(CurrentNode, "expected sequence of bit values"); 255 } 256 DoClear = true; 257 return true; 258 } 259 260 bool Input::bitSetMatch(const char *Str, bool) { 261 if (EC) 262 return false; 263 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 264 unsigned Index = 0; 265 for (auto &N : SQ->Entries) { 266 if (ScalarHNode *SN = dyn_cast<ScalarHNode>(N.get())) { 267 if (SN->value().equals(Str)) { 268 BitValuesUsed[Index] = true; 269 return true; 270 } 271 } else { 272 setError(CurrentNode, "unexpected scalar in sequence of bit values"); 273 } 274 ++Index; 275 } 276 } else { 277 setError(CurrentNode, "expected sequence of bit values"); 278 } 279 return false; 280 } 281 282 void Input::endBitSetScalar() { 283 if (EC) 284 return; 285 if (SequenceHNode *SQ = dyn_cast<SequenceHNode>(CurrentNode)) { 286 assert(BitValuesUsed.size() == SQ->Entries.size()); 287 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { 288 if (!BitValuesUsed[i]) { 289 setError(SQ->Entries[i].get(), "unknown bit value"); 290 return; 291 } 292 } 293 } 294 } 295 296 void Input::scalarString(StringRef &S, bool) { 297 if (ScalarHNode *SN = dyn_cast<ScalarHNode>(CurrentNode)) { 298 S = SN->value(); 299 } else { 300 setError(CurrentNode, "unexpected scalar"); 301 } 302 } 303 304 void Input::setError(HNode *hnode, const Twine &message) { 305 assert(hnode && "HNode must not be NULL"); 306 this->setError(hnode->_node, message); 307 } 308 309 void Input::setError(Node *node, const Twine &message) { 310 Strm->printError(node, message); 311 EC = make_error_code(errc::invalid_argument); 312 } 313 314 std::unique_ptr<Input::HNode> Input::createHNodes(Node *N) { 315 SmallString<128> StringStorage; 316 if (ScalarNode *SN = dyn_cast<ScalarNode>(N)) { 317 StringRef KeyStr = SN->getValue(StringStorage); 318 if (!StringStorage.empty()) { 319 // Copy string to permanent storage 320 unsigned Len = StringStorage.size(); 321 char *Buf = StringAllocator.Allocate<char>(Len); 322 memcpy(Buf, &StringStorage[0], Len); 323 KeyStr = StringRef(Buf, Len); 324 } 325 return llvm::make_unique<ScalarHNode>(N, KeyStr); 326 } else if (SequenceNode *SQ = dyn_cast<SequenceNode>(N)) { 327 auto SQHNode = llvm::make_unique<SequenceHNode>(N); 328 for (Node &SN : *SQ) { 329 auto Entry = this->createHNodes(&SN); 330 if (EC) 331 break; 332 SQHNode->Entries.push_back(std::move(Entry)); 333 } 334 return std::move(SQHNode); 335 } else if (MappingNode *Map = dyn_cast<MappingNode>(N)) { 336 auto mapHNode = llvm::make_unique<MapHNode>(N); 337 for (KeyValueNode &KVN : *Map) { 338 Node *KeyNode = KVN.getKey(); 339 ScalarNode *KeyScalar = dyn_cast<ScalarNode>(KeyNode); 340 if (!KeyScalar) { 341 setError(KeyNode, "Map key must be a scalar"); 342 break; 343 } 344 StringStorage.clear(); 345 StringRef KeyStr = KeyScalar->getValue(StringStorage); 346 if (!StringStorage.empty()) { 347 // Copy string to permanent storage 348 unsigned Len = StringStorage.size(); 349 char *Buf = StringAllocator.Allocate<char>(Len); 350 memcpy(Buf, &StringStorage[0], Len); 351 KeyStr = StringRef(Buf, Len); 352 } 353 auto ValueHNode = this->createHNodes(KVN.getValue()); 354 if (EC) 355 break; 356 mapHNode->Mapping[KeyStr] = std::move(ValueHNode); 357 } 358 return std::move(mapHNode); 359 } else if (isa<NullNode>(N)) { 360 return llvm::make_unique<EmptyHNode>(N); 361 } else { 362 setError(N, "unknown node kind"); 363 return nullptr; 364 } 365 } 366 367 bool Input::MapHNode::isValidKey(StringRef Key) { 368 for (const char *K : ValidKeys) { 369 if (Key.equals(K)) 370 return true; 371 } 372 return false; 373 } 374 375 void Input::setError(const Twine &Message) { 376 this->setError(CurrentNode, Message); 377 } 378 379 bool Input::canElideEmptySequence() { 380 return false; 381 } 382 383 //===----------------------------------------------------------------------===// 384 // Output 385 //===----------------------------------------------------------------------===// 386 387 Output::Output(raw_ostream &yout, void *context) 388 : IO(context), 389 Out(yout), 390 Column(0), 391 ColumnAtFlowStart(0), 392 NeedBitValueComma(false), 393 NeedFlowSequenceComma(false), 394 EnumerationMatchFound(false), 395 NeedsNewLine(false) { 396 } 397 398 Output::~Output() { 399 } 400 401 bool Output::outputting() { 402 return true; 403 } 404 405 void Output::beginMapping() { 406 StateStack.push_back(inMapFirstKey); 407 NeedsNewLine = true; 408 } 409 410 bool Output::mapTag(StringRef Tag, bool Use) { 411 if (Use) { 412 this->output(" "); 413 this->output(Tag); 414 } 415 return Use; 416 } 417 418 void Output::endMapping() { 419 StateStack.pop_back(); 420 } 421 422 bool Output::preflightKey(const char *Key, bool Required, bool SameAsDefault, 423 bool &UseDefault, void *&) { 424 UseDefault = false; 425 if (Required || !SameAsDefault) { 426 this->newLineCheck(); 427 this->paddedKey(Key); 428 return true; 429 } 430 return false; 431 } 432 433 void Output::postflightKey(void *) { 434 if (StateStack.back() == inMapFirstKey) { 435 StateStack.pop_back(); 436 StateStack.push_back(inMapOtherKey); 437 } 438 } 439 440 void Output::beginDocuments() { 441 this->outputUpToEndOfLine("---"); 442 } 443 444 bool Output::preflightDocument(unsigned index) { 445 if (index > 0) 446 this->outputUpToEndOfLine("\n---"); 447 return true; 448 } 449 450 void Output::postflightDocument() { 451 } 452 453 void Output::endDocuments() { 454 output("\n...\n"); 455 } 456 457 unsigned Output::beginSequence() { 458 StateStack.push_back(inSeq); 459 NeedsNewLine = true; 460 return 0; 461 } 462 463 void Output::endSequence() { 464 StateStack.pop_back(); 465 } 466 467 bool Output::preflightElement(unsigned, void *&) { 468 return true; 469 } 470 471 void Output::postflightElement(void *) { 472 } 473 474 unsigned Output::beginFlowSequence() { 475 StateStack.push_back(inFlowSeq); 476 this->newLineCheck(); 477 ColumnAtFlowStart = Column; 478 output("[ "); 479 NeedFlowSequenceComma = false; 480 return 0; 481 } 482 483 void Output::endFlowSequence() { 484 StateStack.pop_back(); 485 this->outputUpToEndOfLine(" ]"); 486 } 487 488 bool Output::preflightFlowElement(unsigned, void *&) { 489 if (NeedFlowSequenceComma) 490 output(", "); 491 if (Column > 70) { 492 output("\n"); 493 for (int i = 0; i < ColumnAtFlowStart; ++i) 494 output(" "); 495 Column = ColumnAtFlowStart; 496 output(" "); 497 } 498 return true; 499 } 500 501 void Output::postflightFlowElement(void *) { 502 NeedFlowSequenceComma = true; 503 } 504 505 void Output::beginEnumScalar() { 506 EnumerationMatchFound = false; 507 } 508 509 bool Output::matchEnumScalar(const char *Str, bool Match) { 510 if (Match && !EnumerationMatchFound) { 511 this->newLineCheck(); 512 this->outputUpToEndOfLine(Str); 513 EnumerationMatchFound = true; 514 } 515 return false; 516 } 517 518 bool Output::matchEnumFallback() { 519 if (EnumerationMatchFound) 520 return false; 521 EnumerationMatchFound = true; 522 return true; 523 } 524 525 void Output::endEnumScalar() { 526 if (!EnumerationMatchFound) 527 llvm_unreachable("bad runtime enum value"); 528 } 529 530 bool Output::beginBitSetScalar(bool &DoClear) { 531 this->newLineCheck(); 532 output("[ "); 533 NeedBitValueComma = false; 534 DoClear = false; 535 return true; 536 } 537 538 bool Output::bitSetMatch(const char *Str, bool Matches) { 539 if (Matches) { 540 if (NeedBitValueComma) 541 output(", "); 542 this->output(Str); 543 NeedBitValueComma = true; 544 } 545 return false; 546 } 547 548 void Output::endBitSetScalar() { 549 this->outputUpToEndOfLine(" ]"); 550 } 551 552 void Output::scalarString(StringRef &S, bool MustQuote) { 553 this->newLineCheck(); 554 if (S.empty()) { 555 // Print '' for the empty string because leaving the field empty is not 556 // allowed. 557 this->outputUpToEndOfLine("''"); 558 return; 559 } 560 if (!MustQuote) { 561 // Only quote if we must. 562 this->outputUpToEndOfLine(S); 563 return; 564 } 565 unsigned i = 0; 566 unsigned j = 0; 567 unsigned End = S.size(); 568 output("'"); // Starting single quote. 569 const char *Base = S.data(); 570 while (j < End) { 571 // Escape a single quote by doubling it. 572 if (S[j] == '\'') { 573 output(StringRef(&Base[i], j - i + 1)); 574 output("'"); 575 i = j + 1; 576 } 577 ++j; 578 } 579 output(StringRef(&Base[i], j - i)); 580 this->outputUpToEndOfLine("'"); // Ending single quote. 581 } 582 583 void Output::setError(const Twine &message) { 584 } 585 586 bool Output::canElideEmptySequence() { 587 // Normally, with an optional key/value where the value is an empty sequence, 588 // the whole key/value can be not written. But, that produces wrong yaml 589 // if the key/value is the only thing in the map and the map is used in 590 // a sequence. This detects if the this sequence is the first key/value 591 // in map that itself is embedded in a sequnce. 592 if (StateStack.size() < 2) 593 return true; 594 if (StateStack.back() != inMapFirstKey) 595 return true; 596 return (StateStack[StateStack.size()-2] != inSeq); 597 } 598 599 void Output::output(StringRef s) { 600 Column += s.size(); 601 Out << s; 602 } 603 604 void Output::outputUpToEndOfLine(StringRef s) { 605 this->output(s); 606 if (StateStack.empty() || StateStack.back() != inFlowSeq) 607 NeedsNewLine = true; 608 } 609 610 void Output::outputNewLine() { 611 Out << "\n"; 612 Column = 0; 613 } 614 615 // if seq at top, indent as if map, then add "- " 616 // if seq in middle, use "- " if firstKey, else use " " 617 // 618 619 void Output::newLineCheck() { 620 if (!NeedsNewLine) 621 return; 622 NeedsNewLine = false; 623 624 this->outputNewLine(); 625 626 assert(StateStack.size() > 0); 627 unsigned Indent = StateStack.size() - 1; 628 bool OutputDash = false; 629 630 if (StateStack.back() == inSeq) { 631 OutputDash = true; 632 } else if ((StateStack.size() > 1) && (StateStack.back() == inMapFirstKey) && 633 (StateStack[StateStack.size() - 2] == inSeq)) { 634 --Indent; 635 OutputDash = true; 636 } 637 638 for (unsigned i = 0; i < Indent; ++i) { 639 output(" "); 640 } 641 if (OutputDash) { 642 output("- "); 643 } 644 645 } 646 647 void Output::paddedKey(StringRef key) { 648 output(key); 649 output(":"); 650 const char *spaces = " "; 651 if (key.size() < strlen(spaces)) 652 output(&spaces[key.size()]); 653 else 654 output(" "); 655 } 656 657 //===----------------------------------------------------------------------===// 658 // traits for built-in types 659 //===----------------------------------------------------------------------===// 660 661 void ScalarTraits<bool>::output(const bool &Val, void *, raw_ostream &Out) { 662 Out << (Val ? "true" : "false"); 663 } 664 665 StringRef ScalarTraits<bool>::input(StringRef Scalar, void *, bool &Val) { 666 if (Scalar.equals("true")) { 667 Val = true; 668 return StringRef(); 669 } else if (Scalar.equals("false")) { 670 Val = false; 671 return StringRef(); 672 } 673 return "invalid boolean"; 674 } 675 676 void ScalarTraits<StringRef>::output(const StringRef &Val, void *, 677 raw_ostream &Out) { 678 Out << Val; 679 } 680 681 StringRef ScalarTraits<StringRef>::input(StringRef Scalar, void *, 682 StringRef &Val) { 683 Val = Scalar; 684 return StringRef(); 685 } 686 687 void ScalarTraits<std::string>::output(const std::string &Val, void *, 688 raw_ostream &Out) { 689 Out << Val; 690 } 691 692 StringRef ScalarTraits<std::string>::input(StringRef Scalar, void *, 693 std::string &Val) { 694 Val = Scalar.str(); 695 return StringRef(); 696 } 697 698 void ScalarTraits<uint8_t>::output(const uint8_t &Val, void *, 699 raw_ostream &Out) { 700 // use temp uin32_t because ostream thinks uint8_t is a character 701 uint32_t Num = Val; 702 Out << Num; 703 } 704 705 StringRef ScalarTraits<uint8_t>::input(StringRef Scalar, void *, uint8_t &Val) { 706 unsigned long long n; 707 if (getAsUnsignedInteger(Scalar, 0, n)) 708 return "invalid number"; 709 if (n > 0xFF) 710 return "out of range number"; 711 Val = n; 712 return StringRef(); 713 } 714 715 void ScalarTraits<uint16_t>::output(const uint16_t &Val, void *, 716 raw_ostream &Out) { 717 Out << Val; 718 } 719 720 StringRef ScalarTraits<uint16_t>::input(StringRef Scalar, void *, 721 uint16_t &Val) { 722 unsigned long long n; 723 if (getAsUnsignedInteger(Scalar, 0, n)) 724 return "invalid number"; 725 if (n > 0xFFFF) 726 return "out of range number"; 727 Val = n; 728 return StringRef(); 729 } 730 731 void ScalarTraits<uint32_t>::output(const uint32_t &Val, void *, 732 raw_ostream &Out) { 733 Out << Val; 734 } 735 736 StringRef ScalarTraits<uint32_t>::input(StringRef Scalar, void *, 737 uint32_t &Val) { 738 unsigned long long n; 739 if (getAsUnsignedInteger(Scalar, 0, n)) 740 return "invalid number"; 741 if (n > 0xFFFFFFFFUL) 742 return "out of range number"; 743 Val = n; 744 return StringRef(); 745 } 746 747 void ScalarTraits<uint64_t>::output(const uint64_t &Val, void *, 748 raw_ostream &Out) { 749 Out << Val; 750 } 751 752 StringRef ScalarTraits<uint64_t>::input(StringRef Scalar, void *, 753 uint64_t &Val) { 754 unsigned long long N; 755 if (getAsUnsignedInteger(Scalar, 0, N)) 756 return "invalid number"; 757 Val = N; 758 return StringRef(); 759 } 760 761 void ScalarTraits<int8_t>::output(const int8_t &Val, void *, raw_ostream &Out) { 762 // use temp in32_t because ostream thinks int8_t is a character 763 int32_t Num = Val; 764 Out << Num; 765 } 766 767 StringRef ScalarTraits<int8_t>::input(StringRef Scalar, void *, int8_t &Val) { 768 long long N; 769 if (getAsSignedInteger(Scalar, 0, N)) 770 return "invalid number"; 771 if ((N > 127) || (N < -128)) 772 return "out of range number"; 773 Val = N; 774 return StringRef(); 775 } 776 777 void ScalarTraits<int16_t>::output(const int16_t &Val, void *, 778 raw_ostream &Out) { 779 Out << Val; 780 } 781 782 StringRef ScalarTraits<int16_t>::input(StringRef Scalar, void *, int16_t &Val) { 783 long long N; 784 if (getAsSignedInteger(Scalar, 0, N)) 785 return "invalid number"; 786 if ((N > INT16_MAX) || (N < INT16_MIN)) 787 return "out of range number"; 788 Val = N; 789 return StringRef(); 790 } 791 792 void ScalarTraits<int32_t>::output(const int32_t &Val, void *, 793 raw_ostream &Out) { 794 Out << Val; 795 } 796 797 StringRef ScalarTraits<int32_t>::input(StringRef Scalar, void *, int32_t &Val) { 798 long long N; 799 if (getAsSignedInteger(Scalar, 0, N)) 800 return "invalid number"; 801 if ((N > INT32_MAX) || (N < INT32_MIN)) 802 return "out of range number"; 803 Val = N; 804 return StringRef(); 805 } 806 807 void ScalarTraits<int64_t>::output(const int64_t &Val, void *, 808 raw_ostream &Out) { 809 Out << Val; 810 } 811 812 StringRef ScalarTraits<int64_t>::input(StringRef Scalar, void *, int64_t &Val) { 813 long long N; 814 if (getAsSignedInteger(Scalar, 0, N)) 815 return "invalid number"; 816 Val = N; 817 return StringRef(); 818 } 819 820 void ScalarTraits<double>::output(const double &Val, void *, raw_ostream &Out) { 821 Out << format("%g", Val); 822 } 823 824 StringRef ScalarTraits<double>::input(StringRef Scalar, void *, double &Val) { 825 SmallString<32> buff(Scalar.begin(), Scalar.end()); 826 char *end; 827 Val = strtod(buff.c_str(), &end); 828 if (*end != '\0') 829 return "invalid floating point number"; 830 return StringRef(); 831 } 832 833 void ScalarTraits<float>::output(const float &Val, void *, raw_ostream &Out) { 834 Out << format("%g", Val); 835 } 836 837 StringRef ScalarTraits<float>::input(StringRef Scalar, void *, float &Val) { 838 SmallString<32> buff(Scalar.begin(), Scalar.end()); 839 char *end; 840 Val = strtod(buff.c_str(), &end); 841 if (*end != '\0') 842 return "invalid floating point number"; 843 return StringRef(); 844 } 845 846 void ScalarTraits<Hex8>::output(const Hex8 &Val, void *, raw_ostream &Out) { 847 uint8_t Num = Val; 848 Out << format("0x%02X", Num); 849 } 850 851 StringRef ScalarTraits<Hex8>::input(StringRef Scalar, void *, Hex8 &Val) { 852 unsigned long long n; 853 if (getAsUnsignedInteger(Scalar, 0, n)) 854 return "invalid hex8 number"; 855 if (n > 0xFF) 856 return "out of range hex8 number"; 857 Val = n; 858 return StringRef(); 859 } 860 861 void ScalarTraits<Hex16>::output(const Hex16 &Val, void *, raw_ostream &Out) { 862 uint16_t Num = Val; 863 Out << format("0x%04X", Num); 864 } 865 866 StringRef ScalarTraits<Hex16>::input(StringRef Scalar, void *, Hex16 &Val) { 867 unsigned long long n; 868 if (getAsUnsignedInteger(Scalar, 0, n)) 869 return "invalid hex16 number"; 870 if (n > 0xFFFF) 871 return "out of range hex16 number"; 872 Val = n; 873 return StringRef(); 874 } 875 876 void ScalarTraits<Hex32>::output(const Hex32 &Val, void *, raw_ostream &Out) { 877 uint32_t Num = Val; 878 Out << format("0x%08X", Num); 879 } 880 881 StringRef ScalarTraits<Hex32>::input(StringRef Scalar, void *, Hex32 &Val) { 882 unsigned long long n; 883 if (getAsUnsignedInteger(Scalar, 0, n)) 884 return "invalid hex32 number"; 885 if (n > 0xFFFFFFFFUL) 886 return "out of range hex32 number"; 887 Val = n; 888 return StringRef(); 889 } 890 891 void ScalarTraits<Hex64>::output(const Hex64 &Val, void *, raw_ostream &Out) { 892 uint64_t Num = Val; 893 Out << format("0x%016llX", Num); 894 } 895 896 StringRef ScalarTraits<Hex64>::input(StringRef Scalar, void *, Hex64 &Val) { 897 unsigned long long Num; 898 if (getAsUnsignedInteger(Scalar, 0, Num)) 899 return "invalid hex64 number"; 900 Val = Num; 901 return StringRef(); 902 } 903