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