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
|
/****************************************************************************
* Copyright (C) 2009-2015 EPAM Systems
*
* This file is part of Indigo toolkit.
*
* This file may be distributed and/or modified under the terms of the
* GNU General Public License version 3 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
***************************************************************************/
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <errno.h>
#include <ctype.h>
#include "base_c/defs.h"
#include "base_cpp/scanner.h"
#include "base_cpp/tlscont.h"
#include "reusable_obj_array.h"
using namespace indigo;
enum { MAX_LINE_LENGTH = 1048576 };
IMPL_ERROR(Scanner, "scanner");
Scanner::~Scanner ()
{
}
int Scanner::readIntFix (int digits)
{
int result;
char buf[20];
if (digits >= NELEM(buf) - 1)
throw Error("readIntFix(): digits = %d", digits);
read(digits, buf);
buf[digits] = 0;
char *end;
result = strtol(buf, &end, 10);
// Check that some digits were read
if (buf == end)
throw Error("readIntFix(%d): invalid number representation: \"%s\"", digits, buf);
// Check that the unread part contains only spaces
while (end != buf + digits)
{
if (!isspace(*end))
throw Error("readIntFix(%d): invalid number representation: \"%s\"", digits, buf);
end++;
}
return result;
}
int Scanner::readInt1 (void)
{
QS_DEF(Array<char>, buf);
char c;
int result;
buf.clear();
skipSpace();
while (!isEOF())
{
c = readChar();
if (!isdigit(c) && c != '-' && c != '+')
break;
buf.push(c);
if (buf.size() > MAX_LINE_LENGTH)
throw Error("Line length is too long. Probably the file format is not correct.");
}
buf.push(0);
if (sscanf(buf.ptr(), "%d", &result) < 1)
throw Error("readInt(): error parsing %s", buf.ptr());
return result;
}
int Scanner::readInt (void)
{
QS_DEF(Array<char>, buf);
char c;
int result;
buf.clear();
c = readChar();
if (c == '+' || c == '-' || isdigit(c))
buf.push(c);
while (isdigit(lookNext()))
{
buf.push(readChar());
if (buf.size() > MAX_LINE_LENGTH)
throw Error("Line length is too long. Probably the file format is not correct.");
}
buf.push(0);
if (sscanf(buf.ptr(), "%d", &result) < 1)
throw Error("readInt(): error parsing %s", buf.ptr());
return result;
}
int Scanner::readUnsigned ()
{
int result = 0;
bool was_digit = false;
while (!isEOF())
{
char c = readChar();
if (isdigit(c))
{
was_digit = true;
result = (int)(c - '0') + result * 10;
}
else
{
seek(-1, SEEK_CUR);
break;
}
}
if (!was_digit)
throw Error("readUnsigned(): no digits");
return result;
}
// This very basic floating-point number parser was written
// to avoid locale problems on various platforms.
bool Scanner::_readDouble (double &res, int max)
{
res = 0;
bool plus = false;
bool minus = false;
bool digit = false;
bool e = false;
double denom = 0;
int cnt = 0;
while (1)
{
if (max > 0 && cnt == max)
break;
char c = (char)lookNext();
if (c == -1) // EOF
break;
if (c == '+')
{
if (plus || minus || digit || denom > 1)
return false;
plus = true;
}
else if (c == '-')
{
if (plus || minus || digit || denom > 1)
return false;
minus = true;
}
else if (isdigit(c))
{
if (denom > 1)
{
res += (c - '0') / (double)denom;
denom *= 10;
}
else
res = res * 10 + (c - '0');
digit = true;
}
else if (c == '.')
{
if (denom > 1)
return false;
denom = 10;
}
else if (c == 'E' || c == 'e')
{
skip(1);
e = true;
break;
}
else if (isspace(c))
{
if (plus || minus || digit || denom > 1)
break;
}
else
break;
skip(1);
cnt++;
}
if (minus)
res *= -1;
if (e)
{
int exponent = readInt();
if (exponent > 0)
{
while (exponent-- > 0)
res *= 10;
}
while (exponent++ < 0)
res /= 10;
}
return digit;
}
float Scanner::readFloat (void)
{
double res;
if (!_readDouble(res, 0))
throw Error("readFloat(): error parsing");
return (float)res;
}
bool Scanner::tryReadFloat (float &value)
{
int pos = tell();
double res;
if (!_readDouble(res, 0))
{
seek(pos, SEEK_SET);
return false;
}
value = (float)res;
return true;
}
void Scanner::readWord (Array<char> &word, const char *delimiters)
{
word.clear();
if (isEOF())
throw Error("readWord(): end of stream");
do
{
int next = lookNext();
if (next == -1)
break;
if (delimiters == 0 && isspace((char)next))
break;
if (delimiters != 0 && strchr(delimiters, (char)next) != NULL)
break;
word.push(readChar());
if (word.size() > MAX_LINE_LENGTH)
throw Error("Line length is too long. Probably the file format is not correct.");
} while (!isEOF());
word.push(0);
}
float Scanner::readFloatFix (int digits)
{
int pos = tell();
double res;
if (!_readDouble(res, digits))
throw Error("readFloatFix(): error parsing");
int rest = tell() - pos - digits;
// Check that the unread part contains only spaces
while (rest-- > 0)
{
if (!isspace(readChar()))
throw Error("readFloatFix(): garbage after the number");
}
return (float)res;
}
char Scanner::readChar ()
{
char c;
read(sizeof(char), &c);
return c;
}
byte Scanner::readByte ()
{
byte c;
read(1, &c);
return c;
}
bool Scanner::skipLine ()
{
char c;
if (isEOF())
return false;
while (!isEOF())
{
c = readChar();
if (c == '\n')
{
if (lookNext() == '\r')
skip(1);
return true;
}
if (c == '\r')
{
if (lookNext() == '\n')
skip(1);
return true;
}
}
return false;
}
void Scanner::read (int length, Array<char> &buf)
{
buf.resize(length);
read(length, buf.ptr());
}
void Scanner::skipSpace ()
{
while (isspace(lookNext()))
skip(1);
}
void Scanner::skipUntil (const char *delimiters)
{
while (strchr(delimiters, lookNext()) == nullptr)
skip(1);
}
void Scanner::appendLine (Array<char> &out, bool append_zero)
{
if (isEOF())
throw Error("appendLine(): end of stream");
if (out.size() > 0)
while (out.top() == 0)
out.pop();
do
{
char c = readChar();
if (c == '\r')
{
if (lookNext() == '\n')
continue;
break;
}
if (c == '\n')
break;
out.push(c);
if (out.size() > MAX_LINE_LENGTH)
throw Error("Line length is too long. Probably the file format is not correct.");
} while (!isEOF());
if (append_zero)
out.push(0);
}
void Scanner::readLine (Array<char> &out, bool append_zero)
{
out.clear();
appendLine(out, append_zero);
}
void Scanner::readCharsFix (int n, char *chars_out)
{
read(n, chars_out);
}
word Scanner::readBinaryWord ()
{
word res;
read(sizeof(word), &res);
return res;
}
dword Scanner::readBinaryDword ()
{
dword res;
read(sizeof(dword), &res);
return res;
}
int Scanner::readBinaryInt ()
{
int res;
read(sizeof(int), &res);
return res;
//*res = ntohl(*res);
}
float Scanner::readBinaryFloat ()
{
float res;
read(sizeof(float), &res);
return res;
}
short Scanner::readPackedShort ()
{
byte high = readByte();
if (high < 128)
return high;
byte low = readByte();
high -= 128;
return high * (short)256 + low;
}
unsigned int Scanner::readPackedUInt ()
{
unsigned int value = 0;
int shift = 0;
while (true)
{
byte cur = readByte();
value |= (cur & 0x7F) << shift;
if (!(cur & 0x80))
return value;
shift += 7;
}
}
void Scanner::readAll (Array<char> &arr)
{
arr.clear_resize(length() - tell());
read(arr.size(), arr.ptr());
}
bool Scanner::isSingleLine (Scanner &scanner)
{
int pos = scanner.tell();
scanner.skipLine();
bool res = scanner.isEOF();
scanner.seek(pos, SEEK_SET);
return res;
}
//
// FileScanner
//
FileScanner::FileScanner (Encoding filename_encoding, const char *filename)
{
_init(filename_encoding, filename);
}
FileScanner::FileScanner (const char *format, ...)
{
char filename[1024];
va_list args;
va_start(args, format);
vsnprintf(filename, sizeof(filename), format, args);
va_end(args);
_init(ENCODING_ASCII, filename);
}
void FileScanner::_init (Encoding filename_encoding, const char *filename)
{
_file = 0;
_file_len = 0;
if (filename == 0)
throw Error("null filename");
_file = openFile(filename_encoding, filename, "rb");
if (_file == NULL)
throw Error("can't open file %s. Error: %s", filename, strerror(errno));
fseek(_file, 0, SEEK_END);
_file_len = ftell(_file);
fseek(_file, 0, SEEK_SET);
_invalidateCache();
}
int FileScanner::lookNext ()
{
_validateCache();
if (_cache_pos == _max_cache)
return -1;
return _cache[_cache_pos];
}
void FileScanner::_invalidateCache ()
{
_max_cache = 0;
_cache_pos = 0;
}
void FileScanner::_validateCache ()
{
if (_cache_pos < _max_cache)
return;
size_t nread = fread(_cache, 1, NELEM(_cache), _file);
_max_cache = nread;
_cache_pos = 0;
}
int FileScanner::tell ()
{
_validateCache();
return ftell(_file) - _max_cache + _cache_pos;
}
void FileScanner::read (int length, void *res)
{
int to_read_from_cache = __min(length, _max_cache - _cache_pos);
memcpy(res, _cache + _cache_pos, to_read_from_cache);
_cache_pos += to_read_from_cache;
if (to_read_from_cache != length)
{
int left = length - to_read_from_cache;
size_t nread = fread((char*)res + to_read_from_cache, 1, left, _file);
if (nread != (size_t)left)
throw Error("FileScanner::read() error");
}
}
bool FileScanner::isEOF ()
{
if (_file == NULL)
return true;
if (_cache_pos < _max_cache)
return false;
return tell() == _file_len;
}
void FileScanner::skip (int n)
{
_validateCache();
_cache_pos += n;
if (_cache_pos > _max_cache)
{
int delta = _cache_pos - _max_cache;
int res = fseek(_file, delta, SEEK_CUR);
_invalidateCache();
if (res != 0)
throw Error("skip() passes after end of file");
}
}
void FileScanner::seek (int pos, int from)
{
if (from == SEEK_CUR)
fseek(_file, pos - _max_cache + _cache_pos, from);
else
fseek(_file, pos, from);
_invalidateCache();
}
int FileScanner::length ()
{
return _file_len;
}
char FileScanner::readChar ()
{
_validateCache();
if (_cache_pos == _max_cache)
throw Error("readChar() passes after end of file");
return _cache[_cache_pos++];
}
FileScanner::~FileScanner ()
{
if (_file != NULL)
fclose(_file);
}
//
// BufferScanner
//
void BufferScanner::_init (const char *buffer, int size)
{
if (size < -1 || (size > 0 && buffer == 0))
throw Error("incorrect parameters in BufferScanner constructor");
_buffer = buffer;
_size = size;
_offset = 0;
}
BufferScanner::BufferScanner (const char *buffer, int buffer_size)
{
_init(buffer, buffer_size);
}
BufferScanner::BufferScanner (const byte *buffer, int buffer_size)
{
_init((const char *)buffer, buffer_size);
}
BufferScanner::BufferScanner (const char *str)
{
if (str == 0)
throw Error("null input");
_init(str, (int)strlen(str));
}
BufferScanner::BufferScanner (const Array<char> &arr)
{
_init(arr.ptr(), arr.size());
}
BufferScanner::~BufferScanner ()
{
}
bool BufferScanner::isEOF ()
{
if (_size < 0)
throw Error("isEOF() called to unlimited buffer");
return _offset >= _size;
}
void BufferScanner::read (int length, void *res)
{
if (_size >= 0 && _offset + length > _size)
throw Error("BufferScanner::read() error");
memcpy(res, &_buffer[_offset], length);
_offset += length;
}
int BufferScanner::lookNext ()
{
if (_size >= 0 && _offset >= _size)
return -1;
return _buffer[_offset];
}
int BufferScanner::length ()
{
return _size;
}
int BufferScanner::tell ()
{
return _offset;
}
const void * BufferScanner::curptr ()
{
return _buffer + _offset;
}
void BufferScanner::skip (int n)
{
_offset += n;
if (_size >= 0 && _offset > _size)
throw Error("skip() passes after end of buffer");
}
void BufferScanner::seek (int pos, int from)
{
if (from == SEEK_SET)
_offset = pos;
else if (from == SEEK_CUR)
_offset += pos;
else // SEEK_END
{
if (_size < 0)
throw Error("can not seek from end: buffer is unlimited");
_offset = _size - pos;
}
if ((_size >= 0 && _offset > _size) || _offset < 0)
throw Error("size = %d, offset = %d after seek()", _size, _offset);
}
byte BufferScanner::readByte ()
{
if (_size >= 0 && _offset >= _size)
throw Error("readByte(): end of buffer");
return _buffer[_offset++];
}
void Scanner::_prefixFunction (Array<char> &str, Array<int> &prefix)
{
prefix.clear();
prefix.push(0);
int i, k = 0;
for (i = 1; i < str.size(); i++)
{
while ((k > 0) && (str[k] != str[i]))
k = prefix[k - 1];
if (str[k] == str[i])
k++;
prefix.push(k);
}
}
bool Scanner::findWord (const char *word)
{
QS_DEF(ReusableObjArray< Array<char> >, strs);
strs.clear();
Array<char> &str = strs.push();
str.readString(word, false);
return findWord(strs) == 0;
}
int Scanner::findWord (ReusableObjArray< Array<char> > &words)
{
if (isEOF())
return -1;
QS_DEF(ReusableObjArray< Array<int> >, prefixes);
QS_DEF(Array<int>, pos);
int i;
int pos_saved = tell();
prefixes.clear();
pos.clear();
for (i = 0; i < words.size(); i++)
{
_prefixFunction(words[i], prefixes.push());
pos.push(0);
}
while (!isEOF())
{
int c = readChar();
for (i = 0; i < words.size(); i++)
{
while (pos[i] > 0 && words[i][pos[i]] != c)
pos[i] = prefixes[i][pos[i] - 1];
if (words[i][pos[i]] == c)
pos[i]++;
if (pos[i] == words[i].size())
{
seek(-words[i].size(), SEEK_CUR);
return i;
}
}
}
seek(pos_saved, SEEK_SET);
return -1;
}
bool Scanner::findWordIgnoreCase (const char *word)
{
QS_DEF(ReusableObjArray< Array<char> >, strs);
strs.clear();
Array<char> &str = strs.push();
str.readString(word, false);
return findWordIgnoreCase(strs) == 0;
}
int Scanner::findWordIgnoreCase (ReusableObjArray< Array<char> > &words)
{
if (isEOF())
return -1;
QS_DEF(ReusableObjArray< Array<int> >, prefixes);
QS_DEF(Array<int>, pos);
int i;
int pos_saved = tell();
prefixes.clear();
pos.clear();
for (i = 0; i < words.size(); i++)
{
_prefixFunction(words[i], prefixes.push());
pos.push(0);
}
while (!isEOF())
{
int c = readChar();
for (i = 0; i < words.size(); i++)
{
int c1 = ::tolower(words[i][pos[i]]);
int c2 = ::tolower(c);
while (pos[i] > 0 && c1 != c2)
pos[i] = prefixes[i][pos[i] - 1];
if (c1 == c2)
pos[i]++;
if (pos[i] == words[i].size())
{
seek(-words[i].size(), SEEK_CUR);
return i;
}
}
}
seek(pos_saved, SEEK_SET);
return -1;
}
|