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
|
// ========================================================================
// gnubiff -- a mail notification program
// Copyright (c) 2000-2008 Nicolas Rougier, 2004-2008 Robert Sowada
//
// This program is free software: you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
// ========================================================================
//
// File : $RCSfile: decoding.cc,v $
// Revision : $Revision: 1.28.2.4 $
// Revision date : $Date: 2008/04/19 23:37:57 $
// Author(s) : Nicolas Rougier, Robert Sowada
// Short : Various functions for decoding, converting ...
//
// This file is part of gnubiff.
//
// -*- mode:C++; tab-width:4; c-basic-offset:4; indent-tabs-mode:nil -*-
// ========================================================================
#include <sstream>
#include "decoding.h"
#include "nls.h"
/**
* Decode the body of a mail.
* The part of the mail's body that will be displayed by gnubiff is decoded.
* The encoding is given by the parameter {\em encoding} and must be obtained
* before. Currently supported encodings are 7bit, 8bit and quoted-printable.
* If called with an unsupported encoding the mail's body is replaced with an
* error message.
*
* @param mail Vector of strings consisting of the mail's lines.
* @param encoding Encoding of the mail's body.
* @param bodypos If the beginning of the mail's body is known (i.e.
* {\em skip_header} is false) this is the position of the
* first body line, otherwise it is the line in which the
* search for the end of the header starts (default is 0)
* @param skip_header If {\em bodypos} is the first line of the body this has
* to be false, otherwise true (default is true)
* @return Boolean indicating success.
*/
gboolean
Decoding::decode_body (std::vector<std::string> &mail, std::string encoding,
std::string::size_type bodypos, gboolean skip_header)
{
// If mail is empty nothing has to be decoded
if (mail.size() == 0)
return true;
// Skip header
if (skip_header) {
while ((bodypos<mail.size()) && (!mail[bodypos].empty()))
bodypos++;
bodypos++;
}
// Invalid bodypos?
if (bodypos >= mail.size())
return true;
// 7bit, 8bit encoding: nothing to do
if ((encoding=="7bit") || (encoding=="8bit")); // || (encoding=="binary"));
// Quoted-Printable
else if (encoding == "quoted-printable") {
std::vector<std::string> decoded=decode_quotedprintable(mail, bodypos);
mail.erase (mail.begin() + bodypos, mail.end());
for (guint i = 0; i < decoded.size(); i++)
mail.push_back (decoded[i]);
}
// Base64
else if (encoding == "base64") {
std::string decoded = decode_base64 (mail, bodypos);
mail.erase (mail.begin() + bodypos, mail.end());
mail.push_back (decoded);
}
// Unknown encoding: Replace body text by a error message
else {
mail.erase (mail.begin() + bodypos, mail.end());
gchar *tmp = g_strdup_printf (_("[The encoding \"%s\" of this mail "
"can't be decoded]"),
encoding.c_str());
if (tmp)
mail.push_back (std::string(tmp));
g_free (tmp);
return false;
}
return true;
}
/**
* Decode a header line. Any quoted-printable or base64 encoding is
* decoded to utf-8. If there is an error during decoding an error message
* is returned. Subject lines are kind of special because the character
* set is encoded within the text. For example it can be something like:
* =?iso-8859-1?Q?Apr=E8s?=.
*
* @param line Header line to be decoded
* @return String containing the decoded line (or an error message).
**/
std::string
Decoding::decode_headerline (const std::string &line)
{
// A mail header line (sender, subject or date) cannot contain
// non-ASCII characters, so first we remove any non-ASCII characters
// and white space at the beginning
std::string copy, result;
std::string::size_type len = line.size(), i = 0;
while ((i < len) && ((line[i] == ' ') || (line[i] == '\t')))
i++;
for (; i < len; i++)
if (line[i] >= 0)
copy += line[i];
len = copy.size();
// Now we can begin decoding
i = 0;
while (i < len) {
// An encoded word (see RFC 2047)?
std::string::size_type j = i;
while ((j+1 < len) && (copy[j] == '=') && (copy[j+1] == '?')) {
std::string charset, encoding, text, decoded;
gchar *utf8;
if (!parse_encoded_word (copy, charset, encoding, text, j))
return _("[Cannot decode this header line]");
// Decode and convert text
if (encoding == "q")
decoded = decode_qencoding (text);
else if (encoding == "b")
decoded = decode_base64 (text);
else
return _("[Cannot decode this header line]");
if (decoded.size() > 0) {
utf8 = g_convert (decoded.c_str(), -1, "utf-8",
charset.c_str(), 0,0,0);
if (!utf8)
return _("[Cannot decode this header line]");
result += utf8;
g_free (utf8);
}
i = j;
// Maybe skip whitespace (see RFC 2047 section 6.2)
while ((j < len) && ((copy[j] == ' ') || (copy[j] == '\t')))
j++;
}
// ASCII character
if (i < len)
result += copy[i++];
}
return result;
}
/**
* Search for next '?' character as a sub-function for
* parse_encoded_word. If this is successful true is returned and
* {\em iter} contains the position of the last '?' character. If this
* is not successful false is returned and {\em iter} is undetermined.
*
* @param line One (unfolded) message header line
* @param pos Position of the encoded word in the line.
* @param iter Current position of iterator in the line.
* @param searchLast Indicates if it search the last encoded-text and "?=".
* The default value is false.
* @return Boolean indicating success
*
* @see RFC 2047 section 2
*/
gboolean
Decoding::parse_encoded_word_search (const std::string &line,
const std::string::size_type &pos,
std::string::size_type &iter,
gboolean searchLast)
{
const std::string::size_type len = line.size();
const std::string::size_type maxlen = 75; // see RFC 2047 section 2
// For especials: see RFC 2047 section 2. '=' omitted because it's
// used by the 'Q'-encoding
// "charset" and "encoding" can't have especials while
// "encoded-text" can have some specials characters
const std::string especials = "()<>@,;:\"/[]?. ";
const std::string especials_ec = "? ";
// Special characters used depending whether charset, encoding or encoded
// text is parsed
std::string esp;
if(searchLast)
esp = especials_ec;
else
esp = especials;
while (iter < len && iter-pos < maxlen && !g_ascii_iscntrl(line[iter])
&& esp.find(line[iter]) == std::string::npos)
iter++;
if (iter >= len || iter-pos >= maxlen || line[iter] != '?'
|| (line[iter+1] != '=' && searchLast))
return false;
return true;
}
/**
* Parse one encoded word in a message header.
* If this is successful true is returned and {\em charset} contains the
* charset, {\em encoding} the encoding, {\em text} the encoded text and
* pos the position of the first character after the encoded word. If this
* is not successful false is returned, {\em pos} is unchanged, the other
* values are undetermined.
*
* @param line One (unfolded) message header line
* @param charset Here the character set of the encoded word is returned
* (converted to lower case; only if the return value is
* true)
* @param encoding Here the encoding of the encoded word is returned
* (converted to lower case; only if the return value is
* true)
* @param text Here the encoded text of the encoded word is returned
* (only if the return value is true)
* @param pos Position of the encoded word in the line. When the return
* value is true, {\em pos} is the position of the first
* character after the encoded word
* @return Boolean indicating success
*
* @see RFC 2047 sections 6.1 and 7
*/
gboolean
Decoding::parse_encoded_word (const std::string &line, std::string &charset,
std::string &encoding, std::string &text,
std::string::size_type &pos)
{
std::string::size_type i = pos, i1, i2;
// Test for "=?"
if ((i+1 >= line.size()) || (line[i] != '=') || (line[i+1] != '?'))
return false;
i += 2;
// Search next "?"
if (!parse_encoded_word_search(line, pos, i))
return false;
i1 = i++;
// Store charset
charset = ascii_strdown (line.substr (pos+2, i1-2-pos));
// Search next "?"
if (!parse_encoded_word_search(line, pos, i))
return false;
i2 = i++;
// Store encoding
encoding = ascii_strdown (line.substr (i1+1, i2-1-i1));
// Search terminating "?="
if (!parse_encoded_word_search(line, pos, i, true))
return false;
// Store text and update position
text = line.substr (i2+1, i-1-i2);
pos = i+2;
return true;
}
/**
* Get a quoted string that is a substring of the string {\em line}. The
* quoted string has to be enclosed by the {\em quoted} character. If
* there should be no test for this character at the beginning {\em
* test_start} has to be false, if it is okay that the quoted string does
* not end with the {\em quoted} character but with the end of {\em
* line}. The position {\em pos} points to the first character of the
* quoted string. If the quoted string can be successfully obtained it is
* returned in {\em str} (with all quoted pairs "\x" substituted by "x"
* for any character 'x') and {\em pos} is the position of the next
* character of {\em line} after the quoted string. If {\em line} ends with
* the quoted string {\em pos} will point outside of {\em line}!
*
* @param line String in which the quoted string is contained
* @param str Here the obtained string is returned
* @param pos Position of the first character of the quoted string.
* When returning {\em pos} is the position of the next
* character after the quoted string. If false is returned
* it is the position in which the error occurred.
* @param quoted Character that encloses the quoted string (default
* is '"')
* @param test_start Shall the first character be tested for being the
* {\em quoted} character (default is true)?
* @param end_ok Is it okay for the quoted string to end with the end of
* {\em line} and not with {\em quoted} (default is false)?
* @return Boolean indicating success
*/
gboolean
Decoding::get_quotedstring (std::string line, std::string &str,
std::string::size_type &pos, gchar quoted,
gboolean test_start, gboolean end_ok)
{
std::string::size_type len = line.size ();
str = std::string ("");
if (pos >= len)
return false;
if ((test_start) && (line[pos++] != quoted))
return false;
while ((pos < len) && (line[pos] != quoted)) {
if ((line[pos] == '\\') && (pos+1 == len))
return false;
if (line[pos] == '\\')
pos++;
str += line[pos++];
}
if (pos == len)
return end_ok;
pos++;
return true;
}
/**
* Get a token that is a substring of {\em line}. This token may only consist
* of those characters that are defined in RFC 2045 5.1.
*
* @param line String in which the quoted string is contained
* @param str Here the obtained string is returned
* @param pos Position of the first character of the token.
* When returning {\em pos} is the position of the next
* character after the token. If false is returned
* it is the position in which the error occurred.
* @param lowercase Shall the token be converted to lower case (default is
* true)?
* @return Boolean indicating success
*/
gboolean
Decoding::get_mime_token (std::string line, std::string &str,
std::string::size_type &pos, gboolean lowercase)
{
// Non alphanumeric characters allowed in tokens
const static std::string token_ok = "!#$%&'*+-._`{|}~";
std::string::size_type len = line.size();
while ((pos < len) && ((g_ascii_isalnum(line[pos]))
|| (token_ok.find(line[pos]) != std::string::npos)))
str += line[pos++];
if (str.size() == 0)
return false;
if (lowercase)
str = ascii_strdown (str);
return true;
}
/**
* Decoding of a base64 encoded string. If the given string
* {\em todec} is not valid an empty string is returned.
* See RFC 3548 for definition of base64 encoding.
*
* @param todec Reference to a C++ string to be decoded
* @return C++ string consisting of the decoded string {\em todec}
*/
std::string
Decoding::decode_base64 (const std::string &todec)
{
static const int index_64[128] = {
-1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
-1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
-1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,62, -1,-1,-1,63,
52,53,54,55, 56,57,58,59, 60,61,-1,-1, -1,-1,-1,-1,
-1, 0, 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,-1, -1,-1,-1,-1,
-1,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,-1, -1,-1,-1,-1
};
# define BASE64(c) (index_64[(unsigned char)(todec[c]) & 0x7F])
std::string result;
std::string::size_type pos = 0, len = todec.length();
if (len%4 != 0)
return std::string("");
while (pos+3 < len) {
if ((todec[pos]&0x80) || (todec[pos+1]&0x80) || (todec[pos+2]&0x80)
|| (todec[pos+3]&0x80) || (index_64[(int)todec[pos]]<0)
|| (index_64[(int)todec[pos+1]]<0))
return std::string("");
result += (gchar)((BASE64(pos) << 2) | (BASE64(pos+1) >> 4));
if (todec[pos+2] == '=')
if ((todec[pos+3]=='=') && (pos+4==len) && (!(BASE64(pos+1)&15)))
return result;
else
return std::string("");
if (index_64[(int)todec[pos+2]]<0)
return std::string("");
result += (gchar)(((BASE64(pos+1) & 0xf) << 4) | (BASE64(pos+2) >> 2));
if (todec[pos+3] == '=')
if ((pos+4 == len) && (!(BASE64(pos+2)&3)))
return result;
else
return std::string("");
if (index_64[(int)todec[pos+3]]<0)
return std::string("");
result += (gchar)(((BASE64(pos+2) & 0x3) << 6) | BASE64(pos+3));
pos += 4;
}
return result;
}
/**
* Decoding of a vector of base64 encoded strings. It is assumed that
* each string in the vector {\em todec} represents one line of the
* base64 encoded text. Lines that have an invalid encoding are
* omitted.
*
* Note: The last character of the decoded string may not be validly encoded
* in its charset.
*
* See RFC 3548, 2045 6.8 for the definition of base64 encoding.
*
* @param todec Vector of base64 encoded C++ strings that will be decoded.
* @param pos Number of the first line in the vector that shall be decoded.
* The default value is 0.
* @return String consisting of the decoded text
*/
std::string
Decoding::decode_base64 (const std::vector<std::string> &todec,
std::string::size_type pos)
{
// Append all lines
std::string body;
while (pos < todec.size ())
body += todec[pos++];
// Decode line
return decode_base64 (body);
}
/**
* Decoding of a q-encoded strings. Q-Encoding is similar to quoted-printable
* encoding and is used in mail headers. See RFC 2047 4.2. for a definition.
* If the given string {\em todec} is not valid an empty string is returned.
*
* @param todec Reference to a C++ string to be decoded
* @return C++ string consisting of the decoded string {\em todec}
*/
std::string
Decoding::decode_qencoding (const std::string &todec)
{
std::string::size_type pos = 0, len = todec.length();
std::string result;
gint decoded;
while (pos < len)
{
switch (gchar c = todec.at(pos++))
{
case '=':
pos += 2;
if (pos > len)
return result;
if ((decoded = g_ascii_xdigit_value(todec.at(pos-1))) < 0)
return std::string("");
if ((decoded += 16*g_ascii_xdigit_value(todec.at(pos-2))) < 0)
return std::string("");
result += decoded;
break;
case '_':
result += ' ';
break;
default:
result += c;
break;
}
}
return result;
}
/**
* Decoding of a quoted-printable encoded string. This string must consist of
* exactly one line (there is no handling of soft breaks etc., see
* RFC 2045 6.7. (3)-(5)). If the given string {\em todec} is not valid an
* empty string is returned.
*
* Note: For mail headers q-encoding is used instead of quoted-printable.
*
* @param todec Reference to a C++ string to be decoded
* @return C++ string consisting of the decoded string {\em todec}
*/
std::string
Decoding::decode_quotedprintable (const std::string &todec)
{
std::string::size_type pos = 0, len = todec.length();
std::string result;
gint decoded;
while (pos < len)
{
switch (gchar c=todec.at(pos++))
{
case '=':
pos += 2;
if (pos > len)
return result;
if ((decoded = g_ascii_xdigit_value(todec.at(pos-1))) < 0)
return std::string("");
if ((decoded += 16*g_ascii_xdigit_value(todec.at(pos-2))) < 0)
return std::string("");
result += decoded;
break;
default:
result += c;
break;
}
}
return result;
}
/**
* Decoding of a vector of quoted-printable encoded strings. It is assumed that
* each string in the vector {\em todec} represents one line of the
* quoted-printable encoded text. Lines that have an invalid encoding are
* omitted.
*
* See RFC 2045 6.7. for the definition of this encoding.
*
* Note: For mail headers q-encoding is used instead of quoted-printable.
*
* @param todec Vector of quoted printable encoded C++ strings that will be
* decoded.
* @param pos Number of the first line in the vector that shall be decoded.
* The default value is 0.
* @return Vector of C++ strings consisting of the decoded text
*/
std::vector<std::string>
Decoding::decode_quotedprintable (const std::vector<std::string> &todec,
std::string::size_type pos)
{
std::string line;
std::vector<std::string> result;
while (pos < todec.size()) {
// Handle soft breaks (see RFC 2045 6.7. (3),(5))
line += todec[pos];
std::string::size_type lpos = line.size();
while ((lpos>0) && ((line[lpos-1]=='\t') || (line[lpos-1]==' ')))
lpos--;
if (lpos < line.size())
line.erase (lpos, line.size());
if ((line.size() > 0) && (line[line.size()-1] == '=')) {
line.erase (line.size()-1);
if (pos < todec.size()-1) {
pos++;
continue;
}
}
// Decode line
result.push_back (decode_quotedprintable (line));
line = "";
pos++;
}
return result;
}
/**
* This function converts an utf-8 encoded string to an imap modified
* utf-7 string. If the conversion is not successful an empty string is
* returned.
*
* @param str Valid utf-8 encoded string to be converted
* @return Converted string or empty string
*/
std::string
Decoding::utf8_to_imaputf7 (const std::string str)
{
gchar *buffer = utf8_to_imaputf7 (str.c_str(), -1);
if (!buffer)
return std::string ("");
std::string result = std::string (buffer);
g_free(buffer);
return result;
}
/**
* This function converts an utf-8 encoded character array to an imap modified
* utf-7 character array. Unfortunately glib function g_convert() can only
* convert to regular utf-7 (see RFC 2152) but IMAP needs a modified version
* of utf-7 (see RFC 3501 5.1.3).
*
* If {\em len} is negative then {\em str} must be a nul-terminated valid utf-8
* string and the whole string will be converted. If {\em len} is positive
* {\em str} must contain at least {\em len} bytes (forming a valid utf-8
* string) that will be converted. If the conversion is not successful NULL
* will be returned, otherwise a newly allocated nul-terminated character array
* containing the converted string will be returned. This array must be freed
* using g_free().
*
* @param str a valid utf-8 character array, nul-terminated if {\em len} is
* less than zero
* @param len number of characters of {\em str} that should be converted or
* less than zero if {\em str} is nul-terminated
* @return a newly allocated nul-terminated character array or NULL
*/
gchar*
Decoding::utf8_to_imaputf7 (const gchar *str, gssize len)
{
// Modified base64 characters (see RFC 2045, RFC 3501 5.1.3)
const char *modbase64="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"abcdefghijklmnopqrstuvwxyz0123456789+,";
// No String or nothing to do
if ((str == NULL) || (len == 0))
return NULL;
gchar c = *str;;
std::string result;
gssize cnt_len = 0;
gboolean printableascii = true;
const gchar *start = str;
while (((len<0) && (*str!='\0')) || (cnt_len<len) || (!printableascii))
{
if (cnt_len != len)
c = *str;
// End of non (printable) ASCII characters?
if (((!printableascii) && (c>='\x20') && (c<='\x7e'))
|| (((len<0) && (c=='\0')) || ((cnt_len>=len) && (len>0))))
{
result+='&';
// Convert first to UTF-16
gsize cnt = 0;
gchar *utf16 = g_convert(start,str-start,"UTF-16BE","UTF-8",
NULL,&cnt,NULL);
if (utf16 == NULL)
return NULL;
// Convert to modified BASE64
gchar *pos = utf16;
while (cnt > 0)
{
gchar b[5] = "\0\0\0\0";
b[0] = modbase64[(pos[0]&0xfc)>>2];
if (cnt == 1)
b[1] = modbase64[(pos[0]&0x03)<<4];
else
{
b[1] = modbase64[((pos[0]&0x03)<<4)|(pos[1]&0xf0)>>4];
if (cnt == 2)
b[2] = modbase64[(pos[1]&0x0f)<<2];
else
{
b[2] = modbase64[((pos[1]&0x0f)<<2)|(pos[2]&0xc0)>>6];
b[3] = modbase64[pos[2]&0x3f];
}
}
result += b;
if (cnt > 2)
cnt -= 3;
else
cnt = 0;
pos += 3;
}
g_free (utf16);
result += "-";
printableascii = true;
continue;
}
cnt_len++;
str++;
// (Printable) ASCII character?
if ((printableascii) && (c>='\x20') && (c<='\x7e'))
{
result += c;
if (c == '&')
result += '-';
continue;
}
// End of (printable) ASCII characters?
if (printableascii)
{
printableascii = false;
start = str-1;
continue;
}
// Another non (printable) ASCII character!
}
return g_strdup (result.c_str ());
}
/**
* Convert the string {\em text} from the character set {\em charset} to
* utf-8. If no character set is given the string is assumed to be in the
* C runtime character set.
*
* If the string cannot be converted and if {\em retries} is non
* zero, the string {\em text} without the last byte is converted (if
* possible). This is done because gnubiff cannot know the end of
* characters when decoding certain encodings (e.g. base64). If
* {\em retries} is zero an error message is returned.
*
* @param text String to be converted
* @param charset Character set of the string {\em text} or empty
* @param retries Maximum number of retries. The default is 0.
* @return Converted string or error message (as character array).
* This string has to be freed with g_free().
*/
gchar *
Decoding::charset_to_utf8 (std::string text, std::string charset,
guint retries)
{
gchar *utf8 = NULL;
if (!charset.empty())
utf8 = g_convert (text.c_str(), -1, "utf-8", charset.c_str(), 0,0,0);
else
utf8 = g_locale_to_utf8 (text.c_str(), -1, 0, 0, 0);
// Could not convert. Retry?
if (!utf8 && retries)
return charset_to_utf8 (text.substr (0, text.size()-1), charset,
retries - 1);
// Could not convert at all!
if (!utf8) {
gchar *tmp = g_strdup_printf (_("[Cannot convert character sets "
"(from \"%s\" to \"utf-8\")]"),
charset.empty() ? "C" : charset.c_str());
utf8 = g_locale_to_utf8 (tmp, -1, 0, 0, 0);
g_free (tmp);
}
return utf8;
}
/**
* Convert all upper case characters in an ASCII string to lower case
* characters. Non-ASCII characters are left unchanged.
*
* @param str String to be converted
* @retrun Converted string
*/
std::string
Decoding::ascii_strdown (const std::string &str)
{
gchar *tmp = g_ascii_strdown (str.c_str(), -1);
std::string result = std::string (tmp);
g_free (tmp);
return result;
}
/**
* Decrypt a password that was stored before version 2.2.0.
*
* If no password saving is selected at configure time, an empty string is
* returned.
*
* @param passphrase Passphrase to be used for decryption
* @param password Encrypted password
* @return Decrypted password
*/
std::string
Decoding::decrypt_password_legacy (const std::string &passphrase,
const std::string &password)
{
#ifdef USE_PASSWORD
// Build passtable
std::string passtable = passphrase;
std::string buffer;
for (std::string::size_type i = 0; i < passtable.size(); i++)
if (buffer.find(passtable[i]) == std::string::npos)
buffer += passtable[i];
passtable = buffer;
// Decrypt password
std::stringstream decrypted;
for (std::string::size_type i = 0; i+1 < password.size(); i += 2) {
char c = 0;
for (guint j = 0; j < 16; j++) {
if (passtable [j] == password[i])
c += j*16;
if (passtable [j] == password[i+1])
c += j;
}
decrypted << c;
}
return decrypted.str();
#else
return std::string("");
#endif
}
/**
* Decrypt the AES encrypted data {\em data} using the passphrase
* {\em passphrase}. The 128 bit AES algorithm is used.
*
* Note: If no AES libraries are available or if an error occurs, this
* function returns an empty string.
*
* @param passphrase Passphrase to be used for decryption (must be 16
* characters long)
* @param data Encrypted data
* @return Decrypted data
*/
std::string
Decoding::decrypt_aes (const std::string &passphrase, const std::string &data)
{
#ifdef HAVE_AES
unsigned char *phraseptr = (unsigned char *)passphrase.c_str ();
guint phraselen = passphrase.size();
// Check Passphrase
if (phraselen < 16)
return std::string ("");
// Determine size and allocate memory
guint size = data.size()/2;
if ((size == 0) || (size%16 != 0))
return std::string ("");
unsigned char *bin = new unsigned char[size+1];
if (!bin)
return std::string ("");
unsigned char *result = new unsigned char[size+1];
if (!result)
return std::string ("");
// ASCII to Binary
for (guint i = 0; i < size; i++)
bin[i] = 16*g_ascii_xdigit_value (data[2*i])
+ g_ascii_xdigit_value (data[2*i+1]);
bin[size] = '\0';
// Decrypt via AES
AES_KEY aes_key;
for (guint i = 0, j = 0; i < size; i+=16) {
AES_set_decrypt_key (phraseptr + j, 128, &aes_key);
AES_decrypt (bin + i, result + i, &aes_key);
if (++j > phraselen - 16)
j = 0;
}
// Free memory
std::string result_str = std::string ((char *)result);
delete (bin);
delete (result);
return result_str;
#else
return std::string ("");
#endif
}
/**
* Encrypt the AES encrypted data {\em data} using the passphrase
* {\em passphrase}. The 128 bit AES algorithm is used.
*
* Note: If no AES libraries are available or if an error occurs, this
* function returns an empty string.
*
* @param passphrase Passphrase to be used for encryption (must be 16
* characters long)
* @param data Decrypted data
* @return Encrypted data
*/
std::string
Decoding::encrypt_aes (const std::string &passphrase, const std::string &data)
{
#ifdef HAVE_AES
const char hex[] = "0123456789ABCDEF";
unsigned char *dataptr = (unsigned char *)data.c_str ();
unsigned char *phraseptr = (unsigned char *)passphrase.c_str ();
guint phraselen = passphrase.size();
// Check Passphrase
if (phraselen < 16)
return std::string ("");
// Determine size and allocate memory
guint size = (data.size()+16)/16*16;
if (size == 0)
return std::string ("");
unsigned char *result = new unsigned char[2*size];
if (!result)
return std::string ("");
// Encrypt via AES
AES_KEY aes_key;
for (guint i = 0, j = 0; i < size; i += 16) {
AES_set_encrypt_key (phraseptr + j, 128, &aes_key);
AES_encrypt (dataptr + i, result + i, &aes_key);
if (++j > phraselen - 16)
j = 0;
}
// Binary to ASCII
for (guint i = size; i > 0; i--) {
result[2*i-1] = hex[result[i-1]&0x0f];
result[2*i-2] = hex[result[i-1]/16];
}
// Free memory
std::string result_str = std::string ((char *)result, 2*size);
delete (result);
return result_str;
#else
return std::string ("");
#endif
}
|