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