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