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
|
/*
* entry.cpp
*
* Created on: Dec 12, 2012
* Author: amarcketta
*/
#include "entry.h"
/*
// This function implements an exact SNP test of Hardy-Weinberg
// Equilibrium as described in Wigginton, JE, Cutler, DJ, and
// Abecasis, GR (2005) A Note on Exact Tests of Hardy-Weinberg
// Equilibrium. American Journal of Human Genetics. 76: 000 - 000
//
// Written by Jan Wigginton
*/
double entry::SNPHWE(int obs_hets, int obs_hom1, int obs_hom2)
{
if (obs_hom1 + obs_hom2 + obs_hets == 0 ) return 1;
if (obs_hom1 < 0 || obs_hom2 < 0 || obs_hets < 0)
LOG.error("Internal error: negative count in HWE test", 91);
int obs_homc = obs_hom1 < obs_hom2 ? obs_hom2 : obs_hom1;
int obs_homr = obs_hom1 < obs_hom2 ? obs_hom1 : obs_hom2;
int rare_copies = 2 * obs_homr + obs_hets;
int genotypes = obs_hets + obs_homc + obs_homr;
double * het_probs = (double *) malloc((size_t) (rare_copies + 1) * sizeof(double));
if (het_probs == NULL)
LOG.error("Internal error: SNP-HWE: Unable to allocate array", 90);
for (int i = 0; i <= rare_copies; i++)
het_probs[i] = 0.0;
/* start at midpoint */
int mid = rare_copies * (2 * genotypes - rare_copies) / (2 * genotypes);
/* check to ensure that midpoint and rare alleles have same parity */
if ((rare_copies & 1) ^ (mid & 1))
mid++;
int curr_hets = mid;
int curr_homr = (rare_copies - mid) / 2;
int curr_homc = genotypes - curr_hets - curr_homr;
het_probs[mid] = 1.0;
double sum = het_probs[mid];
for (curr_hets = mid; curr_hets > 1; curr_hets -= 2)
{
het_probs[curr_hets - 2] = het_probs[curr_hets] * curr_hets * (curr_hets - 1.0) / (4.0 * (curr_homr + 1.0) * (curr_homc + 1.0));
sum += het_probs[curr_hets - 2];
/* 2 fewer heterozygotes for next iteration -> add one rare, one common homozygote */
curr_homr++;
curr_homc++;
}
curr_hets = mid;
curr_homr = (rare_copies - mid) / 2;
curr_homc = genotypes - curr_hets - curr_homr;
for (curr_hets = mid; curr_hets <= rare_copies - 2; curr_hets += 2)
{
het_probs[curr_hets + 2] = het_probs[curr_hets] * 4.0 * curr_homr * curr_homc /((curr_hets + 2.0) * (curr_hets + 1.0));
sum += het_probs[curr_hets + 2];
/* add 2 heterozygotes for next iteration -> subtract one rare, one common homozygote */
curr_homr--;
curr_homc--;
}
for (int i = 0; i <= rare_copies; i++)
het_probs[i] /= sum;
/* alternate p-value calculation for p_hi/p_lo
double p_hi = het_probs[obs_hets];
for (int i = obs_hets + 1; i <= rare_copies; i++)
p_hi += het_probs[i];
double p_lo = het_probs[obs_hets];
for (int i = obs_hets - 1; i >= 0; i--)
p_lo += het_probs[i];
double p_hi_lo = p_hi < p_lo ? 2.0 * p_hi : 2.0 * p_lo;
*/
double p_hwe = 0.0;
/* p-value calculation for p_hwe */
for (int i = 0; i <= rare_copies; i++)
{
if (het_probs[i] > het_probs[obs_hets])
continue;
p_hwe += het_probs[i];
}
p_hwe = p_hwe > 1.0 ? 1.0 : p_hwe;
free(het_probs);
return p_hwe;
}
void entry::make_typed_string(vector<char> &out, const string &in, bool typed)
{
vector<char> tmp_vector;
out.resize(0);
if (in == "." or in == " " or in == "")
{
if (typed == false)
return;
int8_t tmp = (int8_t)0;
tmp = tmp << 4;
tmp = tmp | (int8_t)7;
out.push_back( tmp );
return;
}
if (typed == true)
{
if (in.length() >= 15)
{
int8_t tmp = (int8_t)15;
tmp = tmp << 4;
tmp = tmp | (int8_t)7;
out.push_back( tmp );
make_typed_int(tmp_vector, in.length(), typed);
out.insert( out.end(), tmp_vector.begin(), tmp_vector.end() );
}
else
{
int8_t tmp = (int8_t)in.length();
tmp = tmp << 4;
tmp = tmp | (int8_t)7;
out.push_back( tmp );
}
}
out.reserve(out.size()+in.size());
copy(in.begin(), in.end(), back_inserter(out));
}
void entry::make_typed_int(vector<char> &out, const int &in, bool typed)
{
vector<char> tmp_char;
out.resize(0);
int type;
int8_t size_type = (int8_t)1;
if (in < 127 and in >-127)
type = 1;
else if (in < 32767 and in>-32767)
type = 2;
else
type = 3;
make_int(tmp_char, in, type);
if (typed == true)
{
size_type = size_type << 4;
size_type = size_type | type;
out.push_back(size_type);
}
out.insert(out.end(), tmp_char.begin(), tmp_char.end());
}
void entry::make_typed_string_vector( vector<char> &out, const vector<string> &in, int number )
{
vector<char> tmp_char;
int max_val = 0;
int8_t size_type;
out.resize(0);
if (number == -1)
{
for (unsigned int ui=0; ui<in.size(); ui++)
{
if ((int)in[ui].size() > max_val)
max_val = in[ui].size();
}
}
else
max_val = number;
if (max_val < 15)
{
size_type = (int8_t)max_val;
size_type = size_type << 4;
size_type = size_type | (int8_t)7;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)7;
out.push_back( size_type );
make_typed_int(tmp_char, max_val, true);
out.insert( out.end(), tmp_char.begin(), tmp_char.end() );
}
for (unsigned int ui=0; ui<in.size(); ui++)
{
for (unsigned int uj=0; (int)uj<max_val; uj++)
{
if (in[ui] == ".")
out.push_back( '\0' );
else if (uj<in[ui].size())
out.push_back( in[ui][uj] );
else
out.push_back( '\0' );
}
}
}
void entry::make_typed_GT_vector(vector<char> &out, vector<string> &in )
{
vector<char> tmp_vector;
int8_t size_type;
int max_ploidy = 0;
out.resize(0);
max_ploidy = *max_element(ploidy.begin(), ploidy.end());
if (max_ploidy < 15)
{
size_type = (int8_t)max_ploidy;
size_type = size_type << 4;
size_type = size_type | (int8_t)1;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)1;
out.push_back( size_type );
make_typed_int(tmp_vector, max_ploidy, true);
out.insert( out.end(), tmp_vector.begin(), tmp_vector.end() );
tmp_vector.resize(0);
}
for (unsigned int ui=0; ui<in.size(); ui++)
{
encode_genotype(tmp_vector, in[ui], max_ploidy);
out.insert( out.end(), tmp_vector.begin(), tmp_vector.end() );
tmp_vector.resize(0);
}
out.insert( out.end(), tmp_vector.begin(), tmp_vector.end() );
}
void entry::encode_genotype(vector<char> &out, string &in, int exp_size)
{
int8_t tmp_int;
int8_t phased = 0;
out.resize(0);
for (unsigned int ui=0; ui<in.length(); ui++)
{
if (in[ui] =='|')
phased = 1;
else if (in[ui] == '/')
phased = 0;
else
{
if(in[ui] != '.')
{
tmp_int = header::str2int( in.substr(ui,1) );
tmp_int++;
tmp_int = tmp_int << 1;
tmp_int = tmp_int | phased;
}
else
tmp_int = 0x80;
out.push_back( (int8_t)tmp_int );
}
}
int pad = out.size();
while (pad<exp_size)
{
out.push_back( (int8_t)0x81 );
pad+=1;
}
}
void entry::make_typed_int_vector(vector<char> &out, const string &in, int number )
{
vector<char> tmp_char;
vector<int> tmp_ints;
vector<string> split_string;
int converted, type;
int8_t size_type;
unsigned int max = 0;
unsigned int max_val = 0;
out.resize(0);
if (in == " " or in == "." or in == "")
{
size_type = (int8_t)0;
size_type = size_type << 4;
size_type = size_type | (int8_t)1;
out.push_back( size_type );
return;
}
header::tokenize(in, ',', split_string);
if (number == -1)
{
if (split_string.size() > max_val)
max_val = split_string.size();
}
else
max_val = number;
for (unsigned int ui=0; ui<max_val; ui++)
{
if ( ui<split_string.size() )
{
converted = header::str2int(split_string[ui], 0x80000000);
if ((abs(converted) > (int)max) and ( converted != (int)0x80000000))
max = abs(converted);
}
else
converted = 0x80000001;
tmp_ints.push_back( converted );
}
if (max < 127)
type = 1;
else if (max < 32767)
type = 2;
else
type = 3;
if (max_val < 15)
{
size_type = (int8_t)max_val;
size_type = size_type << 4;
size_type = size_type | (int8_t)type;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)type;
out.push_back( size_type );
make_typed_int(tmp_char, max_val, true);
out.insert( out.end(), tmp_char.begin(), tmp_char.begin() );
}
for (unsigned int ui=0; ui<tmp_ints.size(); ui++)
{
make_int(tmp_char, tmp_ints[ui], type);
out.insert( out.end(), tmp_char.begin(), tmp_char.end() );
}
}
void entry::make_typed_int_vector(vector<char> &out, const vector<string> &in, int number )
{
vector<char> tmp_char;
vector<int> tmp_ints;
vector<string> split_string;
int converted, type;
int8_t size_type;
unsigned int max = 0;
unsigned int max_val = 0;
out.resize(0);
if (number == -1)
{
unsigned int tmp_int = 0;
for (unsigned int ui=0; ui<in.size(); ui++)
{
tmp_int = count(in[ui].begin(), in[ui].end(), ',');
if (tmp_int > max_val)
max_val = tmp_int;
}
max_val++;
}
else
max_val = number;
for (unsigned int ui=0; ui<in.size(); ui++)
{
header::tokenize(in[ui], ',', split_string);
for (unsigned int uj=0; uj<max_val; uj++)
{
if ( uj<split_string.size() )
{
converted = header::str2int(split_string[uj], 0x80000000);
if ((abs(converted) > (int)max) and (converted != (int)0x80000000))
max = abs(converted);
}
else
converted = 0x80000001;
tmp_ints.push_back( converted );
}
}
if (max < 127)
type = 1;
else if (max < 32767)
type = 2;
else
type = 3;
if (max_val < 15)
{
size_type = (int8_t)max_val;
size_type = size_type << 4;
size_type = size_type | (int8_t)type;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)type;
out.push_back( size_type );
make_typed_int(tmp_char, max_val, true);
out.insert( out.end(), tmp_char.begin(), tmp_char.begin() );
}
for (unsigned int ui=0; ui<tmp_ints.size(); ui++)
{
make_int(tmp_char, tmp_ints[ui], type);
out.insert( out.end(), tmp_char.begin(), tmp_char.end() );
}
}
void entry::make_typed_int_vector(vector<char> &out, const vector<int> &in )
{
vector<char> tmp_char;
int type;
int8_t size_type;
unsigned int max = 0;
out.resize(0);
for (unsigned int ui=0; ui<in.size(); ui++)
{
if ((abs(in[ui]) > (int)max) and ( (int8_t)in[ui] != (int8_t)0x80))
max = abs(in[ui]);
}
if (max < 127)
type = 1;
else if (max < 32767)
type = 2;
else
type = 3;
if (in.size() < 15)
{
size_type = (int8_t)in.size();
size_type = size_type << 4;
size_type = size_type | (int8_t)type;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)type;
out.push_back( size_type );
make_typed_int(tmp_char, in.size(), true);
out.insert( out.end(), tmp_char.begin(), tmp_char.begin() );
}
for (unsigned int ui=0; ui<in.size(); ui++)
{
make_int(tmp_char, in[ui], type);
out.insert( out.end(), tmp_char.begin(), tmp_char.end() );
}
}
void entry::make_int(vector<char> &out, const int &in, int type)
{
out.resize(0);
if (type == 1)
{
int8_t tmp_int;
if (in == (int)0x80000000 || in >= 128)
tmp_int = (int8_t)0x80;
else if (in == (int)0x80000001)
tmp_int = (int8_t)0x81;
else
tmp_int = (int8_t)in;
out.push_back( (int8_t)tmp_int);
}
else if (type == 2)
{
int16_t tmp_int;
if (in == (int)0x80000000 || in >= 32768)
tmp_int = 0x8000;
else if (in == (int)0x80000001)
tmp_int = (int8_t)0x8001;
else
tmp_int = (int16_t)in;
int8_t split;
for(unsigned int ui=0; ui<2; ui++)
{
split = tmp_int & (int16_t)0x00FF;//0000000011111111
out.push_back(split);
tmp_int = tmp_int >> 8;
}
}
else
{
int32_t tmp_int;
tmp_int = (int32_t)in;
int8_t split;
for(unsigned int ui=0; ui<4; ui++)
{
split = tmp_int & (int32_t)0x0000FF;
out.push_back( (int8_t)split);
tmp_int = tmp_int >> 8;
}
}
}
void entry::make_typed_float_vector(vector<char> &out, const string &in, int number )
{
vector<string> split_string;
int8_t size_type;
int max_val = 0;
out.resize(0);
if (in == " " or in == "." or in == "")
{
size_type = (int8_t)0;
size_type = size_type << 4;
size_type = size_type | (int8_t)1;
out.push_back( size_type );
return;
}
header::tokenize(in, ',', split_string);
if (number == -1)
max_val = split_string.size();
else
max_val = number;
if ( max_val < 15 )
{
size_type = (int8_t)max_val;
size_type = size_type << 4;
size_type = size_type | (int8_t)5;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)5;
out.push_back( size_type );
vector<char> size_vector;
make_typed_int(size_vector, max_val, true );
out.insert(out.end(), size_vector.begin(), size_vector.end());
}
float value;
char missing[4] = {0x01, 0x00, 0x80, 0x7F};
char end[4] = {0x02, 0x00, 0x80, 0x7F};
for(unsigned int ui=0; (int)ui<max_val; ui++)
{
if (ui < split_string.size() )
value = (float)header::str2double(split_string[ui], 0x7F800001);
else
value = 0x7F800002;
char *p = (char *)&value;
for(unsigned int uj=0; uj<sizeof(value); uj++)
if (value == (float)0x7F800001)
out.push_back( missing[uj] );
else if (value == (float)0x7F800002)
out.push_back( end[uj] );
else
out.push_back( p[uj] );
}
}
void entry::make_typed_float_vector(vector<char> &out, const vector<string> &in, int number )
{
vector<string> split_string;
int8_t size_type;
unsigned int max_val = 0;
out.resize(0);
if (number == -1)
{
unsigned int tmp_int = 0;
for (unsigned int ui=0; ui<in.size(); ui++)
{
tmp_int = count(in[ui].begin(), in[ui].end(), ',');
if (tmp_int > max_val)
max_val = tmp_int;
}
max_val++;
}
else
max_val = number;
if ( max_val < 15 )
{
size_type = (int8_t)max_val;
size_type = size_type << 4;
size_type = size_type | (int8_t)5;
out.push_back( size_type );
}
else
{
size_type = (int8_t)15;
size_type = size_type << 4;
size_type = size_type | (int8_t)5;
out.push_back( size_type );
vector<char> size_vector;
make_typed_int(size_vector, max_val, true );
out.insert(out.end(), size_vector.begin(), size_vector.end());
}
float value;
char missing[4] = {0x01, 0x00, 0x80, 0x7F};
char end[4] = {0x02, 0x00, 0x80, 0x7F};
for (unsigned int ui=0; ui<in.size(); ui++)
{
header::tokenize(in[ui], ',', split_string);
for(unsigned int uj=0; uj<max_val; uj++)
{
if (uj < split_string.size() )
value = (float)header::str2double(split_string[uj], 0x7F800001);
else
value = (float)0x7F800002;
char *p = (char *)&value;
for(unsigned int uk=0; uk<sizeof(value); uk++)
{
if (value == float(0x7F800001))
out.push_back( missing[uk] );
else if (value == float(0x7F800002))
out.push_back( end[uk] );
else
out.push_back( p[uk] );
}
}
}
}
void entry::make_type_size(vector<char> &out, const unsigned int &type, const unsigned int &size)
{
uint8_t byte;
vector<char> tmp_vector;
tmp_vector.resize(0);
out.resize(0);
if (size < 15)
{
byte = size;
byte = byte << 4;
}
else
{
byte = (uint8_t)15;
make_typed_int(tmp_vector, size, true);
}
byte = byte | (uint8_t)type;
out.push_back(byte);
out.insert(out.end(), tmp_vector.begin(), tmp_vector.end());
}
string entry::get_typed_string(unsigned int * line_position, const vector<char>& line)
{
unsigned int size, type;
string out;
get_type( line_position, line, type, size );
if (type != 7)
{
LOG.printLOG("Error: Expected type 7 for string. Found type " + header::int2str(type) + ".\n");
}
char * tmp = new char[size];
memcpy(tmp, &line[*line_position], size*sizeof(char));
*line_position += size;
out = string( tmp, size );
if (out == "" or out == " ")
out = ".";
return out;
}
int entry::get_typed_int(unsigned int * line_position, const vector<char>& line, unsigned int &type, unsigned int &size)
{
int out;
get_type( line_position, line, type, size );
if (size > 1)
{
LOG.printLOG("Error: Int vector when expected only a single Integer value.\n" );
exit(0);
}
if (type == 1)
{
int8_t tmp;
tmp = *reinterpret_cast<const int8_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
out = tmp;
}
else if (type == 2)
{
int16_t tmp;
tmp = *reinterpret_cast<const int16_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
out = tmp;
}
else if (type == 3)
{
int32_t tmp;
tmp = *reinterpret_cast<const int32_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
out = tmp;
}
else
{
LOG.printLOG("Error: Invalid type for integer size.\n");
exit(0);
}
return out;
}
vector<int> entry::get_int_vector(unsigned int * line_position, const vector<char>& line)
{
unsigned int size, type;
get_type( line_position, line, type, size );
vector<int> out(size);
if (type == 1)
{
int8_t tmp;
for (unsigned int ui=0; ui<size; ui++)
{
tmp = *reinterpret_cast<const int8_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
out[ui] = tmp;
}
}
else if (type == 2)
{
int16_t tmp;
for (unsigned int ui=0; ui<size; ui++)
{
tmp = *reinterpret_cast<const int16_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
out[ui] = tmp;
}
}
else if (type == 3)
{
int32_t tmp;
for (unsigned int ui=0; ui<size; ui++)
{
tmp = *reinterpret_cast<const int32_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
out[ui] = tmp;
}
}
else
{
LOG.printLOG("Error: Invalid type for integer size.\n");
exit(0);
}
return out;
}
void entry::get_type(unsigned int * line_position, const vector<char>& line, unsigned int &type, unsigned int &size)
{
uint8_t byte = *reinterpret_cast<const uint8_t*>(&line[*line_position]);
*line_position += sizeof(byte);
size = byte >> 4;
type = (byte & (uint8_t)15);
if (size == 15)
{
int type2;
byte = *reinterpret_cast<const uint8_t*>(&line[*line_position]);
*line_position += sizeof(byte);
type2 = (byte & (uint8_t)15);
if (type2 == 1)
{
int8_t tmp;
tmp = *reinterpret_cast<const int8_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
size = (unsigned int)tmp;
}
else if (type2 == 2)
{
int16_t tmp;
tmp = *reinterpret_cast<const int16_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
size = (int)tmp;
}
else if (type2 == 3)
{
int32_t tmp;
tmp = *reinterpret_cast<const int32_t*>(&line[*line_position]);
*line_position += sizeof(tmp);
size = (unsigned int)tmp;
}
else
{
LOG.printLOG("Error: Invalid type for integer size.\n");
exit(0);
}
}
}
void entry::skip_section(unsigned int *line_position, const vector<char> &line)
{
unsigned int type, size;
get_type(line_position, line, type, size);
if ( (type == 1) || (type == 7) )
*line_position += sizeof(int8_t)*size;
else if (type == 2)
*line_position += sizeof(int16_t)*size;
else if ( (type == 3) || (type == 5) )
*line_position += sizeof(int32_t)*size;
}
bool entry::check_missing(unsigned int line_position, const unsigned int type, const vector<char> &line)
{
static char missing_float[4] = {0x01, 0x00, 0x80, 0x7F};
static char missing_int1 = 0x80;
static char missing_int2[2] = {0x00, 0x80};
static char missing_int3[4] = {0x00, 0x00, 0x00, 0x80};
char test_char;
bool missing = true;
if (type==1)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
missing = (test_char == missing_int1);
}
else if (type==2)
{
for (unsigned int ui=0; ui<sizeof(int16_t); ui++)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
if (test_char != missing_int2[ui])
{
missing = false;
break;
}
line_position += sizeof(char);
}
}
else if (type==3)
{
for (unsigned int ui=0; ui<sizeof(int32_t); ui++)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
if (test_char != missing_int3[ui])
{
missing = false;
break;
}
line_position += sizeof(char);
}
}
else if (type==5)
{
for (unsigned int ui=0; ui<sizeof(float); ui++)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
if (test_char != missing_float[ui])
{
missing = false;
break;
}
line_position += sizeof(char);
}
}
else if (type==7)
missing = false;
return missing;
}
bool entry::check_end(unsigned int line_position, const unsigned int type, const vector<char> &line)
{
static char end_float[4] = {0x02, 0x00, 0x80, 0x7F};
static char end_int1 = 0x81;
static char end_int2[2] = {0x01, 0x80};
static char end_int3[4] = {0x01, 0x00, 0x00, 0x80};
char test_char;
bool end = true;
if (type==1)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
end = (test_char == end_int1);
}
else if (type==2)
{
for (unsigned int ui=0; ui<sizeof(int16_t); ui++)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
if (test_char != end_int2[ui])
{
end = false;
break;
}
line_position += sizeof(char);
}
}
else if (type==3)
{
for (unsigned int ui=0; ui<sizeof(int32_t); ui++)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
if (test_char != end_int3[ui])
{
end = false;
break;
}
line_position += sizeof(char);
}
}
else if (type==5)
{
for (unsigned int ui=0; ui<sizeof(float); ui++)
{
test_char = *reinterpret_cast<const char*>(&line[line_position]);
if (test_char != end_float[ui])
{
end = false;
break;
}
line_position += sizeof(char);
}
}
else if (type==7)
end = false;
return end;
}
void entry::get_number(uint32_t &out, unsigned int *line_position, const vector<char>& line)
{
memcpy(&out, &line[*line_position], sizeof(out));
*line_position += sizeof(out);
}
|