1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447
|
// The static executable provides
// basic functionality and reduced performance.
// For full functionality use the shared library built
// under directory src.
// Shasta.
#include "Assembler.hpp"
#include "AssemblerOptions.hpp"
#include "AssemblyGraph.hpp"
#include "buildId.hpp"
#include "ConfigurationTable.hpp"
#include "Coverage.hpp"
#include "filesystem.hpp"
#include "performanceLog.hpp"
#include "Reads.hpp"
#include "Tee.hpp"
#include "timestamp.hpp"
#include "platformDependent.hpp"
#include "SimpleBayesianConsensusCaller.hpp"
// Standard library.
#include <filesystem>
namespace shasta {
namespace main {
void main(int argumentCount, const char** arguments);
void assemble(
Assembler&,
const AssemblerOptions&,
vector<string> inputNames);
void mode0Assembly(
Assembler&,
const AssemblerOptions&,
uint32_t threadCount);
void mode2Assembly(
Assembler&,
const AssemblerOptions&,
uint32_t threadCount);
void mode3Assembly(
Assembler&,
const AssemblerOptions&,
uint32_t threadCount);
void setupRunDirectory(
const string& memoryMode,
const string& memoryBacking,
size_t& pageSize,
string& dataDirectory
);
void setupHugePages();
void segmentFaultHandler(int);
// Functions that implement --command keywords
void assemble(const AssemblerOptions&, int argumentCount, const char** arguments);
void saveBinaryData(const AssemblerOptions&);
void cleanupBinaryData(const AssemblerOptions&);
void createBashCompletionScript(const AssemblerOptions&);
void listCommands();
void listConfigurations();
void listConfiguration(const AssemblerOptions&);
void explore(const AssemblerOptions&);
const std::set<string> commands = {
"assemble",
"cleanupBinaryData",
"createBashCompletionScript",
"explore",
"listCommands",
"listConfiguration",
"listConfigurations",
"saveBinaryData"};
}
Tee tee;
ofstream shastaLog;
}
using namespace shasta;
// Boost libraries.
#include <boost/program_options.hpp>
#include <boost/chrono/process_cpu_clocks.hpp>
// Linux.
#include <signal.h>
#include <stdlib.h>
#include <unistd.h>
// Standard library.
#include "chrono.hpp"
#include "iostream.hpp"
#include "iterator.hpp"
#include "stdexcept.hpp"
int main(int argumentCount, const char** arguments)
{
try {
shasta::main::main(argumentCount, arguments);
} catch(const boost::program_options::error_with_option_name& e) {
cout << "Invalid option: " << e.what() << endl;
return 1;
} catch (const runtime_error& e) {
cout << timestamp << e.what() << endl;
return 2;
} catch (const std::bad_alloc& e) {
cout << timestamp << e.what() << endl;
cout << "Memory allocation failure." << endl;
cout << "This assembly requires more memory than available." << endl;
cout << "Rerun on a larger machine." << endl;
return 2;
} catch (const exception& e) {
cout << timestamp << e.what() << endl;
return 3;
} catch (...) {
cout << timestamp << "Terminated after catching a non-standard exception." << endl;
return 4;
}
return 0;
}
void shasta::main::segmentFaultHandler(int)
{
char message[] = "\nA segment fault occurred. Please report it by filing an "
"issue on the Shasta repository and attaching the entire log output. "
"To file an issue, point your browser to https://github.com/paoloshasta/shasta/issues\n";
::write(fileno(stderr), message, sizeof(message));
::_exit(1);
}
void shasta::main::main(int argumentCount, const char** arguments)
{
struct sigaction action;
::memset(&action, 0, sizeof(action));
action.sa_handler = &segmentFaultHandler;
sigaction(SIGSEGV, &action, 0);
// Parse command line options and the configuration file, if one was specified.
AssemblerOptions assemblerOptions(argumentCount, arguments);
cout << buildId() << endl;
// Check that we have a valid command.
auto it = commands.find(assemblerOptions.commandLineOnlyOptions.command);
if(it ==commands.end()) {
const string message = "Invalid command " + assemblerOptions.commandLineOnlyOptions.command;
listCommands();
throw runtime_error(message);
}
// Execute the requested command.
if(assemblerOptions.commandLineOnlyOptions.command == "assemble") {
assemble(assemblerOptions, argumentCount, arguments);
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "cleanupBinaryData") {
cleanupBinaryData(assemblerOptions);
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "saveBinaryData") {
saveBinaryData(assemblerOptions);
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "explore") {
explore(assemblerOptions);
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "createBashCompletionScript") {
createBashCompletionScript(assemblerOptions);
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "listCommands") {
listCommands();
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "listConfigurations") {
listConfigurations();
return;
} else if(assemblerOptions.commandLineOnlyOptions.command == "listConfiguration") {
listConfiguration(assemblerOptions);
return;
}
// We already checked for a valid command above, so if we get here
// the above logic is missing code for one of the valid commands.
SHASTA_ASSERT(0);
}
// Implementation of --command assemble.
void shasta::main::assemble(
const AssemblerOptions& assemblerOptions,
int argumentCount, const char** arguments)
{
SHASTA_ASSERT(assemblerOptions.commandLineOnlyOptions.command == "assemble");
// Various checks for option validity.
if(assemblerOptions.commandLineOnlyOptions.configName.empty()) {
cout <<
"Option \"--config\" is missing and is now required to "
"run an assembly.\n"
"It must specify either a configuration file\n"
"or one of the following built-in configurations:\n";
for(const auto& p: configurationTable) {
cout << p.first << endl;
}
throw runtime_error(
"Option \"--config\" is missing "
"and is now required to run an assembly.");
}
// Check --Kmers.k.
// Using Kmer=ShortBaseSequence16 limits it to 16 bases.
// But alignment methods adds 100 to KmerIds to deal
// with the Seqan gap value 45, so this means
// that we cannot use k=16.
// Therefore the maximum allowed value is 15.
// We also reject values that are grossly too low.
if(assemblerOptions.kmersOptions.k > 31 or assemblerOptions.kmersOptions.k < 6) {
throw runtime_error("Invalid value specified for --Kmers.k. "
"Must be between 6 and 31");
}
// Check that we have at least one input file.
if(assemblerOptions.commandLineOnlyOptions.inputFileNames.empty()) {
cout << assemblerOptions.allOptionsDescription << endl;
throw runtime_error("Specify at least one input file "
"using command line option \"--input\".");
}
// Check assemblerOptions.minHashOptions.version.
if( assemblerOptions.minHashOptions.version!=0) {
throw runtime_error("Invalid value " +
to_string(assemblerOptions.minHashOptions.version) +
" specified for --MinHash.version. Must be 0.");
}
// Check assemblerOptions.minHashOptions minimum/maximum bucket size.
const bool dynamicMinHashBucketRange =
(assemblerOptions.minHashOptions.minBucketSize == 0) and
(assemblerOptions.minHashOptions.maxBucketSize == 0);
if((not dynamicMinHashBucketRange) and (assemblerOptions.minHashOptions.maxBucketSize <=
assemblerOptions.minHashOptions.minBucketSize)) {
throw runtime_error("Invalid MinHash min/max bucket sizes specified. "
"The following values were specified:"
" minimum bucket size " +
to_string(assemblerOptions.minHashOptions.minBucketSize) +
", maximum bucket size " +
to_string(assemblerOptions.minHashOptions.maxBucketSize) + "."
);
}
// If coverage data was requested, memoryMode should be filesystem,
// otherwise the coverage data cannot be accessed.
if(assemblerOptions.assemblyOptions.storeCoverageData) {
if(assemblerOptions.commandLineOnlyOptions.memoryMode != "filesystem") {
throw runtime_error("To obtain usable coverage data, "
"you must use --memoryMode filesystem.");
}
}
if( assemblerOptions.alignOptions.alignMethod < 0 or
assemblerOptions.alignOptions.alignMethod == 2 or
assemblerOptions.alignOptions.alignMethod > 5) {
throw runtime_error("Align method " + to_string(assemblerOptions.alignOptions.alignMethod) +
" is not valid. Valid options are 0, 1, 3, 4, and 5.");
}
if(assemblerOptions.readGraphOptions.creationMethod != 0 and
assemblerOptions.readGraphOptions.creationMethod != 2) {
throw runtime_error("--ReadGraph.creationMethod " +
to_string(assemblerOptions.readGraphOptions.creationMethod) +
" is not valid. Valid values are 0 and 2.");
}
// Check assemblerOptions.assemblyOptions.detangleMethod.
if( assemblerOptions.assemblyOptions.detangleMethod!=0 and
assemblerOptions.assemblyOptions.detangleMethod!=1 and
assemblerOptions.assemblyOptions.detangleMethod!=2) {
throw runtime_error("Invalid value " +
to_string(assemblerOptions.assemblyOptions.detangleMethod) +
" specified for --AssemblyOptions.detangleMethod. Must be 0, 1, or 2.");
}
// Check readGraphOptions.strandSeparationMethod.
if(assemblerOptions.assemblyOptions.mode == 2 and
assemblerOptions.readGraphOptions.strandSeparationMethod != 2) {
throw runtime_error("--Assembly.mode 2 requires --ReadGraph.strandSeparationMethod 2.");
}
if(assemblerOptions.assemblyOptions.mode == 3 and
assemblerOptions.readGraphOptions.strandSeparationMethod != 2) {
throw runtime_error("--Assembly.mode 3 requires --ReadGraph.strandSeparationMethod 2.");
}
// Find absolute paths of the input files.
// We will use them below after changing directory to the output directory.
vector<string> inputFileAbsolutePaths;
for(const string& inputFileName: assemblerOptions.commandLineOnlyOptions.inputFileNames) {
if(!std::filesystem::exists(inputFileName)) {
throw runtime_error("Input file not found: " + inputFileName);
}
if(!std::filesystem::is_regular_file(inputFileName)) {
throw runtime_error("Input file is not a regular file: " + inputFileName);
}
inputFileAbsolutePaths.push_back(filesystem::getAbsolutePath(inputFileName));
}
// Create the assembly directory. If it exists and is not empty then stop.
bool exists = std::filesystem::exists(assemblerOptions.commandLineOnlyOptions.assemblyDirectory);
bool isDir = std::filesystem::is_directory(assemblerOptions.commandLineOnlyOptions.assemblyDirectory);
if (exists) {
if (!isDir) {
throw runtime_error(
assemblerOptions.commandLineOnlyOptions.assemblyDirectory +
" already exists and is not a directory.\n"
"Use --assemblyDirectory to specify a different assembly directory."
);
}
bool isEmpty = filesystem::directoryContents(assemblerOptions.commandLineOnlyOptions.assemblyDirectory).empty();
if (!isEmpty) {
throw runtime_error(
"Assembly directory " +
assemblerOptions.commandLineOnlyOptions.assemblyDirectory +
" exists and is not empty.\n"
"Empty it for reuse or use --assemblyDirectory to specify a different assembly directory.");
}
} else {
SHASTA_ASSERT(std::filesystem::create_directory(assemblerOptions.commandLineOnlyOptions.assemblyDirectory));
}
// Make the assembly directory current.
std::filesystem::current_path(assemblerOptions.commandLineOnlyOptions.assemblyDirectory);
// Open the performance log.
openPerformanceLog("performance.log");
performanceLog << timestamp << "Assembly begins." << endl;
// Open stdout.log and "tee" (duplicate) stdout to it.
if(not assemblerOptions.commandLineOnlyOptions.suppressStdoutLog) {
shastaLog.open("stdout.log");
tee.duplicate(cout, shastaLog);
}
// Echo out the command line options.
cout << timestamp << "Assembly begins.\nCommand line:" << endl;
for(int i=0; i<argumentCount; i++) {
cout << arguments[i] << " ";
}
cout << endl;
// Set up the run directory as required by the memoryMode and memoryBacking options.
size_t pageSize = 0;
string dataDirectory;
setupRunDirectory(
assemblerOptions.commandLineOnlyOptions.memoryMode,
assemblerOptions.commandLineOnlyOptions.memoryBacking,
pageSize,
dataDirectory);
// Write out the option in effect to shasta.conf.
{
ofstream configurationFile("shasta.conf");
assemblerOptions.write(configurationFile);
}
cout << "For options in use for this assembly, see shasta.conf in the assembly directory." << endl;
// Initial disclaimer message.
if(assemblerOptions.commandLineOnlyOptions.memoryBacking != "2M" &&
assemblerOptions.commandLineOnlyOptions.memoryMode != "filesystem") {
cout << "This run uses options \"--memoryBacking " << assemblerOptions.commandLineOnlyOptions.memoryBacking <<
" --memoryMode " << assemblerOptions.commandLineOnlyOptions.memoryMode << "\".\n"
"This could result in longer run time.\n"
"For faster assembly, use \"--memoryBacking 2M --memoryMode filesystem\"\n"
"(root privilege via sudo required).\n"
"Therefore the results of this run should not be used\n"
"for the purpose of benchmarking assembly time.\n"
"However the memory options don't affect assembly results in any way." << endl;
}
// Create the Assembler.
Assembler assembler(dataDirectory, true, assemblerOptions.readsOptions.representation, pageSize);
assembler.assemblerInfo->readGraphCreationMethod = assemblerOptions.readGraphOptions.creationMethod;
assembler.assemblerInfo->assemblyMode = assemblerOptions.assemblyOptions.mode;
// Run the assembly.
assemble(assembler, assemblerOptions, inputFileAbsolutePaths);
// Final disclaimer message.
if(assemblerOptions.commandLineOnlyOptions.memoryBacking != "2M" &&
assemblerOptions.commandLineOnlyOptions.memoryMode != "filesystem") {
cout << "This run used options \"--memoryBacking " << assemblerOptions.commandLineOnlyOptions.memoryBacking <<
" --memoryMode " << assemblerOptions.commandLineOnlyOptions.memoryMode << "\".\n"
"This could result in longer run time.\n"
"For faster assembly, use \"--memoryBacking 2M --memoryMode filesystem\"\n"
"(root privilege via sudo required).\n"
"Therefore the results of this run should not be used\n"
"for the purpose of benchmarking assembly time.\n"
"However the memory options don't affect assembly results in any way." << endl;
}
// Write out the build id again.
cout << buildId() << endl;
performanceLog << timestamp << "Assembly ends." << endl;
cout << timestamp << "Assembly ends." << endl;
}
// Set up the run directory as required by the memoryMode and memoryBacking options.
void shasta::main::setupRunDirectory(
const string& memoryMode,
const string& memoryBacking,
size_t& pageSize,
string& dataDirectory
)
{
if(memoryMode == "anonymous") {
if(memoryBacking == "disk") {
// This combination is meaningless.
throw runtime_error("\"--memoryMode anonymous\" is not allowed in combination "
"with \"--memoryBacking disk\".");
} else if(memoryBacking == "4K") {
// Anonymous memory on 4KB pages.
// This combination is the default.
// It does not require root privilege.
dataDirectory = "";
pageSize = 4096;
} else if(memoryBacking == "2M") {
// Anonymous memory on 2MB pages.
// This may require root privilege, which is obtained using sudo
// and may result in a password prompting depending on sudo set up.
// Root privilege is not required if 2M pages have already
// been set up as required.
setupHugePages();
pageSize = 2 * 1024 * 1024;
} else {
throw runtime_error("Invalid value specified for --memoryBacking: " + memoryBacking +
"\nValid values are: disk, 4K, 2M.");
}
} else if(memoryMode == "filesystem") {
if(memoryBacking == "disk") {
// Binary files on disk.
// This does not require root privilege.
SHASTA_ASSERT(std::filesystem::create_directory("Data"));
dataDirectory = "Data/";
pageSize = 4096;
} else if(memoryBacking == "4K") {
// Binary files on the tmpfs filesystem
// (filesystem in memory backed by 4K pages).
// This requires root privilege, which is obtained using sudo
// and may result in a password prompting depending on sudo set up.
SHASTA_ASSERT(std::filesystem::create_directory("Data"));
dataDirectory = "Data/";
pageSize = 4096;
const string command = "sudo mount -t tmpfs -o size=0 tmpfs Data";
const int errorCode = ::system(command.c_str());
if(errorCode != 0) {
throw runtime_error("Error " + to_string(errorCode) + ": " + strerror(errorCode) +
" running command: " + command);
}
} else if(memoryBacking == "2M") {
// Binary files on the hugetlbfs filesystem
// (filesystem in memory backed by 2M pages).
// This requires root privilege, which is obtained using sudo
// and may result in a password prompting depending on sudo set up.
setupHugePages();
SHASTA_ASSERT(std::filesystem::create_directory("Data"));
dataDirectory = "Data/";
pageSize = 2 * 1024 * 1024;
const uid_t userId = ::getuid();
const gid_t groupId = ::getgid();
const string command = "sudo mount -t hugetlbfs -o pagesize=2M"
",uid=" + to_string(userId) +
",gid=" + to_string(groupId) +
" none Data";
const int errorCode = ::system(command.c_str());
if(errorCode != 0) {
throw runtime_error("Error " + to_string(errorCode) + ": " + strerror(errorCode) +
" running command: " + command);
}
} else {
throw runtime_error("Invalid value specified for --memoryBacking: " + memoryBacking +
"\nValid values are: disk, 4K, 2M.");
}
} else {
throw runtime_error("Invalid value specified for --memoryMode: " + memoryMode +
"\nValid values are: anonymous, filesystem.");
}
}
// This runs the entire assembly, under the following assumptions:
// - The current directory is the run directory.
// - The Data directory has already been created and set up, if necessary.
// - The input file names are either absolute,
// or relative to the run directory, which is the current directory.
void shasta::main::assemble(
Assembler& assembler,
const AssemblerOptions& assemblerOptions,
vector<string> inputFileNames)
{
const auto steadyClock0 = std::chrono::steady_clock::now();
const auto userClock0 = boost::chrono::process_user_cpu_clock::now();
const auto systemClock0 = boost::chrono::process_system_cpu_clock::now();
// Adjust the number of threads, if necessary.
uint32_t threadCount = assemblerOptions.commandLineOnlyOptions.threadCount;
if(threadCount == 0) {
threadCount = std::thread::hardware_concurrency();
}
cout << "This assembly will use " << threadCount << " threads." << endl;
// Set up the consensus caller.
if(assembler.getReads().representation == 1) {
cout << "Setting up consensus caller " <<
assemblerOptions.assemblyOptions.consensusCaller << endl;
}
assembler.setupConsensusCaller(assemblerOptions.assemblyOptions.consensusCaller);
// Add reads from the specified input files.
performanceLog << timestamp << "Begin loading reads from " << inputFileNames.size() << " files." << endl;
const auto t0 = steady_clock::now();
for(const string& inputFileName: inputFileNames) {
assembler.addReads(
inputFileName,
assemblerOptions.readsOptions.minReadLength,
assemblerOptions.readsOptions.noCache,
threadCount);
}
if(assembler.getReads().readCount() == 0) {
throw runtime_error("There are no input reads.");
}
// If requested, increase the read length cutoff
// to reduce coverage to the specified amount.
if (assemblerOptions.readsOptions.desiredCoverage > 0) {
// Write out the read length histogram using provided minReadLength.
assembler.histogramReadLength("ExtendedReadLengthHistogram.csv");
const auto newMinReadLength = assembler.adjustCoverageAndGetNewMinReadLength(
assemblerOptions.readsOptions.desiredCoverage);
const auto oldMinReadLength = uint64_t(assemblerOptions.readsOptions.minReadLength);
if (newMinReadLength == 0ULL) {
throw runtime_error(
"With Reads.minReadLength " +
to_string(assemblerOptions.readsOptions.minReadLength) +
", total available coverage is " +
to_string(assembler.getReads().getTotalBaseCount()) +
", less than desired coverage " +
to_string(assemblerOptions.readsOptions.desiredCoverage) +
". Try reducing Reads.minReadLength if appropriate or get more coverage."
);
}
// Adjusting coverage should only ever reduce coverage if necessary.
SHASTA_ASSERT(newMinReadLength >= oldMinReadLength);
}
assembler.computeReadIdsSortedByName();
assembler.histogramReadLength("ReadLengthHistogram.csv");
const auto t1 = steady_clock::now();
performanceLog << timestamp << "Done loading reads from " << inputFileNames.size() << " files." << endl;
performanceLog << "Read loading took " << seconds(t1-t0) << "s." << endl;
// Find duplicate reads and handle them according to the setting
// of --Reads.handleDuplicates.
assembler.findDuplicateReads(assemblerOptions.readsOptions.handleDuplicates);
// Initialize the KmerChecker, which has the information needed
// to decide if a k-mer is a marker.
assembler.createKmerChecker(assemblerOptions.kmersOptions, threadCount);
// Find the markers in the reads.
assembler.findMarkers(0);
// Gather marker KmerIds for all markers.
// They are used by LowHash and alignment computation.
// These will be kept until we are done computing alignments.
assembler.computeMarkerKmerIds(threadCount);
// Flag palindromic reads.
// These will be excluded from further processing.
if(!assemblerOptions.readsOptions.palindromicReads.skipFlagging) {
assembler.flagPalindromicReads(
assemblerOptions.readsOptions.palindromicReads.maxSkip,
assemblerOptions.readsOptions.palindromicReads.maxDrift,
assemblerOptions.readsOptions.palindromicReads.maxMarkerFrequency,
assemblerOptions.readsOptions.palindromicReads.alignedFractionThreshold,
assemblerOptions.readsOptions.palindromicReads.nearDiagonalFractionThreshold,
assemblerOptions.readsOptions.palindromicReads.deltaThreshold,
threadCount);
}
// Find alignment candidates.
if(assemblerOptions.minHashOptions.allPairs) {
assembler.markAlignmentCandidatesAllPairs();
} else {
SHASTA_ASSERT(assemblerOptions.minHashOptions.version == 0); // Already checked for that.
assembler.findAlignmentCandidatesLowHash0(
assemblerOptions.minHashOptions.m,
assemblerOptions.minHashOptions.hashFraction,
assemblerOptions.minHashOptions.minHashIterationCount,
assemblerOptions.minHashOptions.alignmentCandidatesPerRead,
0,
assemblerOptions.minHashOptions.minBucketSize,
assemblerOptions.minHashOptions.maxBucketSize,
assemblerOptions.minHashOptions.minFrequency,
threadCount);
}
// Suppress alignment candidates where reads are close on the same channel.
if(assemblerOptions.alignOptions.sameChannelReadAlignmentSuppressDeltaThreshold > 0) {
assembler.suppressAlignmentCandidates(
assemblerOptions.alignOptions.sameChannelReadAlignmentSuppressDeltaThreshold,
threadCount);
}
// For http server and debugging/development purposes, generate an exhaustive table of candidates
assembler.computeCandidateTable();
// Compute alignments.
assembler.computeAlignments(
assemblerOptions.alignOptions,
threadCount);
// Marker KmerIds are freed here.
// They can always be recomputed from the reads when needed.
assembler.cleanupMarkerKmerIds();
// Create the read graph.
if(assemblerOptions.readGraphOptions.creationMethod == 0) {
assembler.createReadGraph(
assemblerOptions.readGraphOptions.maxAlignmentCount,
assemblerOptions.alignOptions.maxTrim);
// Actual alignment criteria are as specified in the command line options
// and/or configuration.
assembler.assemblerInfo->actualMinAlignedFraction = assemblerOptions.alignOptions.minAlignedFraction;
assembler.assemblerInfo->actualMinAlignedMarkerCount = assemblerOptions.alignOptions.minAlignedMarkerCount;
assembler.assemblerInfo->actualMaxDrift = assemblerOptions.alignOptions.maxDrift;
assembler.assemblerInfo->actualMaxSkip = assemblerOptions.alignOptions.maxSkip;
assembler.assemblerInfo->actualMaxTrim = assemblerOptions.alignOptions.maxTrim;
} else if(assemblerOptions.readGraphOptions.creationMethod == 2) {
assembler.createReadGraph2(
assemblerOptions.readGraphOptions.maxAlignmentCount,
assemblerOptions.readGraphOptions.markerCountPercentile,
assemblerOptions.readGraphOptions.alignedFractionPercentile,
assemblerOptions.readGraphOptions.maxSkipPercentile,
assemblerOptions.readGraphOptions.maxDriftPercentile,
assemblerOptions.readGraphOptions.maxTrimPercentile);
} else {
throw runtime_error("Invalid value for --ReadGraph.creationMethod.");
}
// Limited strand separation.
// If strict strand separation is requested, it is done later,
// after chimera detection.
if(assemblerOptions.readGraphOptions.strandSeparationMethod == 1) {
assembler.flagCrossStrandReadGraphEdges1(
assemblerOptions.readGraphOptions.crossStrandMaxDistance,
threadCount);
}
// Flag chimeric reads.
assembler.flagChimericReads(assemblerOptions.readGraphOptions.maxChimericReadDistance, threadCount);
// Flag inconsistent alignments, if requested.
if(assemblerOptions.readGraphOptions.flagInconsistentAlignments) {
assembler.flagInconsistentAlignments(
assemblerOptions.readGraphOptions.flagInconsistentAlignmentsTriangleErrorThreshold,
assemblerOptions.readGraphOptions.flagInconsistentAlignmentsLeastSquareErrorThreshold,
assemblerOptions.readGraphOptions.flagInconsistentAlignmentsLeastSquareMaxDistance,
threadCount);
}
// Strict strand separation.
if(assemblerOptions.readGraphOptions.strandSeparationMethod == 2) {
assembler.flagCrossStrandReadGraphEdges2();
}
// Compute connected components of the read graph.
// These are currently not used.
// For strand separation method 2 this was already done
// in flagCrossStrandReadGraphEdges2.
if(assemblerOptions.readGraphOptions.strandSeparationMethod != 2) {
assembler.computeReadGraphConnectedComponents();
}
// Do the rest of the assembly using the selected assembly mode.
switch(assemblerOptions.assemblyOptions.mode) {
case 0:
mode0Assembly(assembler, assemblerOptions, threadCount);
break;
case 2:
mode2Assembly(assembler, assemblerOptions, threadCount);
break;
case 3:
mode3Assembly(assembler, assemblerOptions, threadCount);
break;
default:
throw runtime_error("Invalid value specified for --Assembly.mode. "
"Valid values are 0 (haploid assembly) and 2 (phased diploid assembly), but " +
to_string(assemblerOptions.assemblyOptions.mode) +
" was specified.");
}
// Store elapsed time for assembly.
const auto steadyClock1 = std::chrono::steady_clock::now();
const auto userClock1 = boost::chrono::process_user_cpu_clock::now();
const auto systemClock1 = boost::chrono::process_system_cpu_clock::now();
const double elapsedTime = 1.e-9 * double((
std::chrono::duration_cast<std::chrono::nanoseconds>(steadyClock1 - steadyClock0)).count());
const double userTime = 1.e-9 * double((
boost::chrono::duration_cast<boost::chrono::nanoseconds>(userClock1 - userClock0)).count());
const double systemTime = 1.e-9 * double((
boost::chrono::duration_cast<boost::chrono::nanoseconds>(systemClock1 - systemClock0)).count());
const double averageCpuUtilization =
(userTime + systemTime) / (double(std::thread::hardware_concurrency()) * elapsedTime);
assembler.storeAssemblyTime(elapsedTime, averageCpuUtilization);
// Store peak memory usage.
uint64_t peakMemoryUsage = getPeakMemoryUsage();
assembler.storePeakMemoryUsage(peakMemoryUsage);
// Store other performance information.
assembler.assemblerInfo->threadCount = threadCount;
assembler.assemblerInfo->virtualCpuCount = std::thread::hardware_concurrency();
assembler.assemblerInfo->totalAvailableMemory = getTotalPhysicalMemory();
// Write a summary of read information.
assembler.writeReadsSummary();
// Write the assembly summary.
ofstream html("AssemblySummary.html");
assembler.writeAssemblySummary(html);
ofstream json("AssemblySummary.json");
assembler.writeAssemblySummaryJson(json);
ofstream htmlIndex("index.html");
assembler.writeAssemblyIndex(htmlIndex);
performanceLog << timestamp << endl;
performanceLog << "Assembly time statistics:\n"
" Elapsed seconds: " << elapsedTime << "\n"
" Elapsed minutes: " << elapsedTime/60. << "\n"
" Elapsed hours: " << elapsedTime/3600. << "\n";
performanceLog << "Average CPU utilization: " << averageCpuUtilization << endl;
performanceLog << "Peak Memory usage: " << peakMemoryUsage << " bytes = " <<
int(std::round(double(peakMemoryUsage) / (1024. * 1024. * 1024.)) ) << " GiB" << endl;
}
void shasta::main::mode0Assembly(
Assembler& assembler,
const AssemblerOptions& assemblerOptions,
uint32_t threadCount)
{
// Iterative assembly, if requested (experimental).
if(assemblerOptions.assemblyOptions.iterative) {
for(uint64_t iteration=0;
iteration<assemblerOptions.assemblyOptions.iterativeIterationCount;
iteration++) {
cout << timestamp << "Iterative assembly iteration " << iteration << " begins." << endl;
// Do an assembly with the current read graph, without marker graph
// simplification or detangling.
assembler.createMarkerGraphVertices(
assemblerOptions.markerGraphOptions.minCoverage,
assemblerOptions.markerGraphOptions.maxCoverage,
assemblerOptions.markerGraphOptions.minCoveragePerStrand,
assemblerOptions.markerGraphOptions.allowDuplicateMarkers,
assemblerOptions.markerGraphOptions.peakFinderMinAreaFraction,
assemblerOptions.markerGraphOptions.peakFinderAreaStartIndex,
threadCount);
assembler.findMarkerGraphReverseComplementVertices(threadCount);
assembler.createMarkerGraphEdges(threadCount);
assembler.findMarkerGraphReverseComplementEdges(threadCount);
assembler.transitiveReduction(
assemblerOptions.markerGraphOptions.lowCoverageThreshold,
assemblerOptions.markerGraphOptions.highCoverageThreshold,
assemblerOptions.markerGraphOptions.maxDistance,
assemblerOptions.markerGraphOptions.edgeMarkerSkipThreshold);
assembler.pruneMarkerGraphStrongSubgraph(
assemblerOptions.markerGraphOptions.pruneIterationCount);
assembler.createAssemblyGraphEdges();
assembler.createAssemblyGraphVertices();
// Recreate the read graph using pseudo-paths from this assembly.
assembler.createReadGraphUsingPseudoPaths(
assemblerOptions.assemblyOptions.iterativePseudoPathAlignMatchScore,
assemblerOptions.assemblyOptions.iterativePseudoPathAlignMismatchScore,
assemblerOptions.assemblyOptions.iterativePseudoPathAlignGapScore,
assemblerOptions.assemblyOptions.iterativeMismatchSquareFactor,
assemblerOptions.assemblyOptions.iterativeMinScore,
assemblerOptions.assemblyOptions.iterativeMaxAlignmentCount,
threadCount);
for(uint64_t bridgeRemovalIteration=0;
bridgeRemovalIteration<assemblerOptions.assemblyOptions.iterativeBridgeRemovalIterationCount;
bridgeRemovalIteration++) {
assembler.removeReadGraphBridges(
assemblerOptions.assemblyOptions.iterativeBridgeRemovalMaxDistance);
}
// Remove the marker graph and assembly graph we created in the process.
assembler.markerGraph.remove();
assembler.assemblyGraphPointer.reset();
}
// Now we have a new read graph with some amount of separation
// between copies of long repeats and/or haplotypes.
// The rest of the assembly continues normally.
}
// Create marker graph vertices.
// This uses a disjoint sets data structure to merge markers
// that are aligned based on an alignment present in the read graph.
assembler.createMarkerGraphVertices(
assemblerOptions.markerGraphOptions.minCoverage,
assemblerOptions.markerGraphOptions.maxCoverage,
assemblerOptions.markerGraphOptions.minCoveragePerStrand,
assemblerOptions.markerGraphOptions.allowDuplicateMarkers,
assemblerOptions.markerGraphOptions.peakFinderMinAreaFraction,
assemblerOptions.markerGraphOptions.peakFinderAreaStartIndex,
threadCount);
// Find the reverse complement of each marker graph vertex.
assembler.findMarkerGraphReverseComplementVertices(threadCount);
// Clean up of duplicate markers, if requested and necessary.
if(assemblerOptions.markerGraphOptions.allowDuplicateMarkers and
assemblerOptions.markerGraphOptions.cleanupDuplicateMarkers) {
assembler.cleanupDuplicateMarkers(
threadCount,
assembler.getMarkerGraphMinCoverageUsed(), // Stored by createMarkerGraphVertices.
assemblerOptions.markerGraphOptions.minCoveragePerStrand,
assemblerOptions.markerGraphOptions.duplicateMarkersPattern1Threshold,
false, false);
}
// Create edges of the marker graph.
assembler.createMarkerGraphEdges(threadCount);
assembler.findMarkerGraphReverseComplementEdges(threadCount);
// Approximate transitive reduction.
assembler.transitiveReduction(
assemblerOptions.markerGraphOptions.lowCoverageThreshold,
assemblerOptions.markerGraphOptions.highCoverageThreshold,
assemblerOptions.markerGraphOptions.maxDistance,
assemblerOptions.markerGraphOptions.edgeMarkerSkipThreshold);
// Prune the marker graph.
assembler.pruneMarkerGraphStrongSubgraph(
assemblerOptions.markerGraphOptions.pruneIterationCount);
// Compute marker graph coverage histogram.
assembler.computeMarkerGraphCoverageHistogram();
// Simplify the marker graph to remove bubbles and superbubbles.
// The maxLength parameter controls the maximum number of markers
// for a branch to be collapsed during each iteration.
assembler.simplifyMarkerGraph(assemblerOptions.markerGraphOptions.simplifyMaxLengthVector, false);
// Create the assembly graph.
assembler.createAssemblyGraphEdges();
assembler.createAssemblyGraphVertices();
// Remove low-coverage cross-edges from the assembly graph and
// the corresponding marker graph edges.
if(assemblerOptions.markerGraphOptions.crossEdgeCoverageThreshold > 0.) {
assembler.removeLowCoverageCrossEdges(
uint32_t(assemblerOptions.markerGraphOptions.crossEdgeCoverageThreshold));
assembler.assemblyGraphPointer->remove();
assembler.createAssemblyGraphEdges();
assembler.createAssemblyGraphVertices();
}
// Prune the assembly graph, if requested.
if(assemblerOptions.assemblyOptions.pruneLength > 0) {
assembler.pruneAssemblyGraph(assemblerOptions.assemblyOptions.pruneLength);
}
// Detangle, if requested.
if(assemblerOptions.assemblyOptions.detangleMethod == 1) {
assembler.detangle();
} else if(assemblerOptions.assemblyOptions.detangleMethod == 2) {
assembler.detangle2(
assemblerOptions.assemblyOptions.detangleDiagonalReadCountMin,
assemblerOptions.assemblyOptions.detangleOffDiagonalReadCountMax,
assemblerOptions.assemblyOptions.detangleOffDiagonalRatio
);
}
// If any detangling was done, remove low-coverage cross-edges again.
if(assemblerOptions.assemblyOptions.detangleMethod != 0 and
assemblerOptions.markerGraphOptions.crossEdgeCoverageThreshold > 0.) {
assembler.removeLowCoverageCrossEdges(
uint32_t(assemblerOptions.markerGraphOptions.crossEdgeCoverageThreshold));
assembler.assemblyGraphPointer->remove();
assembler.createAssemblyGraphEdges();
assembler.createAssemblyGraphVertices();
}
// Compute optimal repeat counts for each vertex of the marker graph.
if(assemblerOptions.readsOptions.representation == 1) {
assembler.assembleMarkerGraphVertices(threadCount);
}
// If coverage data was requested, compute and store coverage data for the vertices.
if(assemblerOptions.assemblyOptions.storeCoverageData or
assemblerOptions.assemblyOptions.storeCoverageDataCsvLengthThreshold>0) {
assembler.computeMarkerGraphVerticesCoverageData(threadCount);
}
// Compute consensus sequence for marker graph edges to be used for assembly.
assembler.assembleMarkerGraphEdges(
threadCount,
assemblerOptions.assemblyOptions.markerGraphEdgeLengthThresholdForConsensus,
assemblerOptions.assemblyOptions.storeCoverageData or
assemblerOptions.assemblyOptions.storeCoverageDataCsvLengthThreshold>0,
false
);
// Use the assembly graph for global assembly.
assembler.assemble(
threadCount,
assemblerOptions.assemblyOptions.storeCoverageDataCsvLengthThreshold);
// assembler.findAssemblyGraphBubbles();
assembler.computeAssemblyStatistics();
assembler.writeGfa1("Assembly.gfa");
assembler.writeGfa1BothStrands("Assembly-BothStrands.gfa");
assembler.writeGfa1BothStrandsNoSequence("Assembly-BothStrands-NoSequence.gfa");
assembler.writeFasta("Assembly.fasta");
// If requested, write out the oriented reads that were used to assemble
// each assembled segment.
if(assemblerOptions.assemblyOptions.writeReadsByAssembledSegment) {
cout << timestamp << " Writing the oriented reads that were used to assemble each segment." << endl;
assembler.gatherOrientedReadsByAssemblyGraphEdge(threadCount);
assembler.writeOrientedReadsByAssemblyGraphEdge();
}
}
void shasta::main::mode2Assembly(
Assembler& assembler,
const AssemblerOptions& assemblerOptions,
uint32_t threadCount)
{
// Create marker graph vertices.
assembler.createMarkerGraphVertices(
assemblerOptions.markerGraphOptions.minCoverage,
assemblerOptions.markerGraphOptions.maxCoverage,
assemblerOptions.markerGraphOptions.minCoveragePerStrand,
assemblerOptions.markerGraphOptions.allowDuplicateMarkers,
assemblerOptions.markerGraphOptions.peakFinderMinAreaFraction,
assemblerOptions.markerGraphOptions.peakFinderAreaStartIndex,
threadCount);
assembler.findMarkerGraphReverseComplementVertices(threadCount);
// Create marker graph edges.
// For assembly mode 1 we use createMarkerGraphEdgesStrict
// with minimum edge coverage (total and per strand).
assembler.createMarkerGraphEdgesStrict(
assemblerOptions.markerGraphOptions.minEdgeCoverage,
assemblerOptions.markerGraphOptions.minEdgeCoveragePerStrand, threadCount);
assembler.findMarkerGraphReverseComplementEdges(threadCount);
// Coverage histograms for vertices and edges of the marker graph.
assembler.computeMarkerGraphCoverageHistogram();
// To recover contiguity, add secondary edges.
assembler.createMarkerGraphSecondaryEdges(
uint32_t(assemblerOptions.markerGraphOptions.secondaryEdgesMaxSkip),
threadCount);
assembler.splitMarkerGraphSecondaryEdges(
assemblerOptions.markerGraphOptions.secondaryEdgesSplitErrorRateThreshold,
assemblerOptions.markerGraphOptions.secondaryEdgesSplitMinCoverage,
threadCount);
// Coverage histograms for vertices and edges of the marker graph.
assembler.computeMarkerGraphCoverageHistogram();
// Compute optimal repeat counts for each vertex of the marker graph.
if(assemblerOptions.readsOptions.representation == 1) {
assembler.assembleMarkerGraphVertices(threadCount);
}
// Compute consensus sequence for all marker graph edges.
assembler.assembleMarkerGraphEdges(
threadCount,
assemblerOptions.assemblyOptions.markerGraphEdgeLengthThresholdForConsensus,
assemblerOptions.assemblyOptions.storeCoverageData or
assemblerOptions.assemblyOptions.storeCoverageDataCsvLengthThreshold>0,
true
);
// Create the mode 2 assembly graph.
assembler.createAssemblyGraph2(
assemblerOptions.assemblyOptions.pruneLength,
assemblerOptions.assemblyOptions.mode2Options,
threadCount, false);
}
void shasta::main::mode3Assembly(
Assembler& assembler,
const AssemblerOptions& assemblerOptions,
uint32_t threadCount)
{
// Mode 3 assembly requires reads in raw representation (not RLE).
SHASTA_ASSERT(assemblerOptions.readsOptions.representation == 0);
// The marker length must be even.
SHASTA_ASSERT((assembler.assemblerInfo->k %2) == 0);
// Create marker graph vertices.
// To create a complete marker graph, generate all vertices
// regardless of coverage, and allow duplicate markers on vertices.
assembler.createMarkerGraphVertices(
1, // minVertexCoverage
std::numeric_limits<uint64_t>::max(), // maxVertexCoverage
0, // minVertexCoveragePerStrand
true, // allowDuplicateMarkers
std::numeric_limits<double>::signaling_NaN(), // For peak finder, unused because minVertexCoverage is not 0.
invalid<uint64_t>, // For peak finder, unused because minVertexCoverage is not 0.
threadCount);
assembler.findMarkerGraphReverseComplementVertices(threadCount);
// Create marker graph edges.
// Use createMarkerGraphEdgesStrict so all oriented reads on an edge
// have exactly the same sequence.
// To create a complete marker graph, generate all edges
// regardless of coverage.
assembler.createMarkerGraphEdgesStrict(
0, // minEdgeCoverage
0, // minEdgeCoveragePerStrand
threadCount);
assembler.findMarkerGraphReverseComplementEdges(threadCount);
// Coverage histograms for vertices and edges of the marker graph.
assembler.computeMarkerGraphCoverageHistogram();
// Assemble sequence for marker graph edges.
// This assembles MarkerGraph::edgeSequence which is
// different from what happens in other assembly modes.
// See the comments before MarkerGraph::edgeSequence
// for more information.
assembler.assembleMarkerGraphEdgesMode3();
// Flag primary marker graph edges.
assembler.flagPrimaryMarkerGraphEdges(
assemblerOptions.assemblyOptions.mode3Options.minPrimaryCoverage,
assemblerOptions.assemblyOptions.mode3Options.maxPrimaryCoverage,
threadCount);
// Run Mode 3 assembly.
assembler.mode3Assembly(threadCount, assemblerOptions.assemblyOptions.mode3Options, false);
}
// This function sets nr_overcommit_hugepages for 2MB pages
// to a little below total memory.
// If the setting needs to be modified, it acquires
// root privilege via sudo. This may result in the
// user having to enter a password.
void shasta::main::setupHugePages()
{
// Get the total memory size.
const uint64_t totalMemoryBytes = sysconf(_SC_PAGESIZE) * sysconf(_SC_PHYS_PAGES);
// Figure out how much memory we want to allow for 2MB pages.
const uint64_t MB = 1024 * 1024;
const uint64_t GB = MB * 1024;
const uint64_t maximumHugePageMemoryBytes = totalMemoryBytes - 8 * GB;
const uint64_t maximumHugePageMemoryHugePages = maximumHugePageMemoryBytes / (2 * MB);
// Check what we have it set to.
const string fileName = "/sys/kernel/mm/hugepages/hugepages-2048kB/nr_overcommit_hugepages";
ifstream file(fileName);
if(!file) {
throw runtime_error("Error opening " + fileName + " for read.");
}
uint64_t currentValue = 0;
file >> currentValue;
file.close();
// If it's set to at least what we want, don't do anything.
// When this happens, root access is not required.
if(currentValue >= maximumHugePageMemoryHugePages) {
return;
}
// Use sudo to set.
const string command =
"sudo sh -c \"echo " +
to_string(maximumHugePageMemoryHugePages) +
" > " + fileName + "\"";
const int errorCode = ::system(command.c_str());
if(errorCode != 0) {
throw runtime_error("Error " + to_string(errorCode) + ": " + strerror(errorCode) +
" running command: " + command);
}
}
// Implementation of --command saveBinaryData.
// This copies Data to DataOnDisk.
void shasta::main::saveBinaryData(
const AssemblerOptions& assemblerOptions)
{
SHASTA_ASSERT(assemblerOptions.commandLineOnlyOptions.command == "saveBinaryData");
// Locate the Data directory.
const string dataDirectory =
assemblerOptions.commandLineOnlyOptions.assemblyDirectory + "/Data";
if(!std::filesystem::exists(dataDirectory)) {
throw runtime_error(dataDirectory + " does not exist, nothing done.");
}
// Check that the DataOnDisk directory does not exist.
const string dataOnDiskDirectory =
assemblerOptions.commandLineOnlyOptions.assemblyDirectory + "/DataOnDisk";
if(std::filesystem::exists(dataOnDiskDirectory)) {
throw runtime_error(dataOnDiskDirectory + " already exists, nothing done.");
}
// Copy Data to DataOnDisk.
const string command = "cp -rp " + dataDirectory + " " + dataOnDiskDirectory;
const int errorCode = ::system(command.c_str());
if(errorCode != 0) {
throw runtime_error("Error " + to_string(errorCode) + ": " + strerror(errorCode) +
" running command:\n" + command);
}
cout << "Binary data successfully saved." << endl;
}
// Implementation of --command cleanupBinaryData.
void shasta::main::cleanupBinaryData(
const AssemblerOptions& assemblerOptions)
{
SHASTA_ASSERT(assemblerOptions.commandLineOnlyOptions.command == "cleanupBinaryData");
// Locate the Data directory.
const string dataDirectory =
assemblerOptions.commandLineOnlyOptions.assemblyDirectory + "/Data";
if(!std::filesystem::exists(dataDirectory)) {
cout << dataDirectory << " does not exist, nothing done." << endl;
return;
}
// Unmount it and remove it.
::system(("sudo umount " + dataDirectory).c_str());
const int errorCode = ::system(string("rm -rf " + dataDirectory).c_str());
if(errorCode != 0) {
throw runtime_error("Error " + to_string(errorCode) + ": " + strerror(errorCode) +
" removing " + dataDirectory);
}
cout << "Cleanup of " << dataDirectory << " successful." << endl;
// If the DataOnDisk directory exists, create a symbolic link
// Data->DataOnDisk.
const string dataOnDiskDirectory =
assemblerOptions.commandLineOnlyOptions.assemblyDirectory + "/DataOnDisk";
if(std::filesystem::exists(dataOnDiskDirectory)) {
std::filesystem::current_path(assemblerOptions.commandLineOnlyOptions.assemblyDirectory);
const string command = "ln -s DataOnDisk Data";
::system(command.c_str());
}
}
// Implementation of --command explore.
void shasta::main::explore(
const AssemblerOptions& assemblerOptions)
{
// If a paf file was specified, find its absolute path
// before we switch to the assembly directory.
string alignmentsPafFileAbsolutePath;
if(not assemblerOptions.commandLineOnlyOptions.alignmentsPafFile.empty()) {
if(!std::filesystem::exists(assemblerOptions.commandLineOnlyOptions.alignmentsPafFile)) {
throw runtime_error(assemblerOptions.commandLineOnlyOptions.alignmentsPafFile + " not found.");
}
if(!std::filesystem::is_regular_file(assemblerOptions.commandLineOnlyOptions.alignmentsPafFile)) {
throw runtime_error(assemblerOptions.commandLineOnlyOptions.alignmentsPafFile + " is not a regular file.");
}
alignmentsPafFileAbsolutePath = filesystem::getAbsolutePath(assemblerOptions.commandLineOnlyOptions.alignmentsPafFile);
}
// Go to the assembly directory.
std::filesystem::current_path(assemblerOptions.commandLineOnlyOptions.assemblyDirectory);
// Check that we have the binary data.
if(!std::filesystem::exists("Data")) {
throw runtime_error("Binary directory \"Data\" not available "
" in assembly directory " +
assemblerOptions.commandLineOnlyOptions.assemblyDirectory +
". Use \"--memoryMode filesystem\", possibly followed by "
"\"--command saveBinaryData\" and \"--command cleanupBinaryData\" "
"if you want to make sure the binary data are persistently available on disk. "
"See the documentations are some of these options require root access."
);
return;
}
// Create the Assembler.
Assembler assembler("Data/", false, 1, 0);
// Set up the consensus caller.
if(assembler.getReads().representation == 1) {
cout << "Setting up consensus caller " <<
assemblerOptions.assemblyOptions.consensusCaller << endl;
}
assembler.setupConsensusCaller(assemblerOptions.assemblyOptions.consensusCaller);
// Access all available binary data.
assembler.accessAllSoft();
string executablePath = filesystem::executablePath();
// On Linux it will be something like - `/path/to/install_root/bin/shasta`
string executableBinPath = executablePath.substr(0, executablePath.find_last_of('/'));
string installRootPath = executableBinPath.substr(0, executableBinPath.find_last_of('/'));
string docsPath = installRootPath + "/docs";
if (std::filesystem::is_directory(docsPath)) {
assembler.httpServerData.docsDirectory = docsPath;
} else {
cout << "Documentation is not available." << endl;
assembler.httpServerData.docsDirectory = "";
}
// Load the paf file, if one was specified.
if(not alignmentsPafFileAbsolutePath.empty()) {
assembler.loadAlignmentsPafFile(alignmentsPafFileAbsolutePath);
}
// Start the http server.
assembler.httpServerData.assemblerOptions = &assemblerOptions;
bool localOnly;
bool sameUserOnly;
if(assemblerOptions.commandLineOnlyOptions.exploreAccess == "user") {
localOnly = true;
sameUserOnly = true;
} else if(assemblerOptions.commandLineOnlyOptions.exploreAccess == "local") {
localOnly = true;
sameUserOnly = false;
} else if (assemblerOptions.commandLineOnlyOptions.exploreAccess == "unrestricted"){
localOnly = false;
sameUserOnly = false;
} else {
throw runtime_error("Invalid value specified for --exploreAccess. "
"Only use this option if you understand its security implications."
);
}
assembler.explore(
assemblerOptions.commandLineOnlyOptions.port,
localOnly,
sameUserOnly);
}
// This creates a bash completion script for the Shasta executable,
// which makes it easier to type long option names.
// To use it:
// shasta --command createBashCompletionScript; source shastaCompletion.sh
// Then, press TAB once or twice while editing a Shasta command line
// to get the Bash shell to suggest or fill in possibilities.
// You can put the "source" command in your .bashrc or other
// appropriate location.
// THIS IS AN INITIAL CUT AND LACKS MANY DESIRABLE FEATURES,
// LIKE FOR EXAMPLE COMPLETION OF FILE NAMES (AFTER --input),
// AND THE ABILITY TO COMPLETE KEYWORDS ONLY AFTER THE OPTION THEY
// SHOULD BE PRECEDED BY.
// IF SOMEBODY WITH A GOOD UNDERSTANDING OF BASH COMPLETION SEES THIS,
// PLEASE MAKE IT BETTER AND SUBMIT A PULL REQUEST!
void shasta::main::createBashCompletionScript(const AssemblerOptions& assemblerOptions)
{
const string fileName = "shastaCompletion.sh";
ofstream file(fileName);
file << "#!/bin/bash\n";
file << "complete -o default -W \"\\\n";
// Options.
for(const auto& option: assemblerOptions.allOptionsDescription.options()) {
file << "--" << option->long_name() << " \\\n";
}
// Commands.
for(const auto& command: commands) {
file << command << " \\\n";
}
// Built-in configurations.
for(const auto& p: configurationTable) {
file << p.first << " \\\n";
}
// Bayesian models.
for(const string& name: SimpleBayesianConsensusCaller::builtIns) {
file << name << " \\\n";
}
// Other keywords. This should be modified to only accept them after the appropriate option.
file << "filesystem anonymous \\\n";
file << "disk 4K 2M \\\n";
file << "user local unrestricted \\\n";
file << "Bayesian Modal Median \\\n";
// Finish the "complete" command.
file << "\" shasta\n";
cout << "Created shastaCompletion.sh. "
"In the bash shell, use the following command to "
"get shell command completion when invoking Shasta:\n"
"source shastaCompletion.sh\n"
"This makes it easier to type when running Shasta." << endl;
}
void shasta::main::listCommands()
{
cout << "Valid commands are:" << endl;
for(const string& command: commands) {
cout << command << endl;
}
}
void shasta::main::listConfigurations()
{
cout << "Valid Shasta built-in configurations, in chronological order, are:\n" << endl;
for(const auto& p: configurationTable) {
cout << p.first << endl;
}
cout <<
"\nUse \"shasta --command listConfiguration --config configurationName\" "
"to list the details of one of the above configurations.\n\n"
"When running an assembly, you can use option \"--config\" "
"to specify any of the above configuration names, "
"or the name of a configuration file. "
"See shasta/conf for examples of configuration files. "
"Each of the above configurations has a corresponding "
"configuration file in shasta/conf." << endl;
}
void shasta::main::listConfiguration(const AssemblerOptions& options)
{
const string& configName = options.commandLineOnlyOptions.configName;
if(configName.empty()) {
throw runtime_error("Specify --config with a valid configuration name.");
}
const string* configuration = getConfiguration(configName);
if(configuration == 0) {
const string message = configName + " is not a valid configuration name.";
cout << message << endl;
listConfigurations();
throw runtime_error(configName);
}
cout << *configuration << flush;
}
|