mirror of
https://github.com/ONLYOFFICE/core.git
synced 2026-04-07 13:55:33 +08:00
195 lines
4.9 KiB
C++
195 lines
4.9 KiB
C++
#include "codecvt.h"
|
|
|
|
using namespace std;
|
|
|
|
|
|
ucs2_conversion::result
|
|
ucs2_conversion::do_in(mbstate_t&,
|
|
const char* from, const char* from_end, const char*& from_next,
|
|
wchar_t* to, wchar_t* to_limit, wchar_t*& to_next) const
|
|
{
|
|
const int max_input = (from_end - from) & ~1;
|
|
const int max_output = (to_limit - to);
|
|
int count = min(max_input / 2, max_output); // TODO ïîïðîáîâàòü îïòèìèçèðîâàòü, çàìåíèâ äåëåíèå íà ñäâèã
|
|
|
|
from_next = from;
|
|
to_next = to;
|
|
|
|
for (;count--; from_next += 2, ++to_next)
|
|
{
|
|
unsigned char c1 = *from_next;
|
|
unsigned char c2 = *(from_next + 1);
|
|
*to_next = c1 | c2 << 8;
|
|
}
|
|
|
|
if (to_next == to && from_next == from_end - 1)
|
|
return partial;
|
|
return ok;
|
|
}
|
|
|
|
|
|
ucs2_conversion::result
|
|
ucs2_conversion::do_out(mbstate_t&,
|
|
const wchar_t* from, const wchar_t* from_end, const wchar_t*& from_next,
|
|
char* to, char* to_limit, char*& to_next) const
|
|
{
|
|
const int max_input = (from_end - from);
|
|
const int max_output = (to_limit - to) & ~1;
|
|
int count = min(max_input, max_output / 2); // TODO ïîïðîáîâàòü îïòèìèçèðîâàòü, çàìåíèâ äåëåíèå íà ñäâèã
|
|
|
|
from_next = from;
|
|
to_next = to;
|
|
|
|
for (;count--; ++from_next, to_next += 2)
|
|
{
|
|
*(to_next + 0) = *from_next & 0xFF;
|
|
*(to_next + 1) = *from_next >> 8 & 0xFF;
|
|
}
|
|
return ok;
|
|
}
|
|
|
|
|
|
|
|
ube_conversion::result
|
|
ube_conversion::do_in(mbstate_t&,
|
|
const char* from, const char* from_end, const char*& from_next,
|
|
wchar_t* to, wchar_t* to_limit, wchar_t*& to_next) const
|
|
{
|
|
const int max_input = (from_end - from) & ~1;
|
|
const int max_output = (to_limit - to);
|
|
int count = min(max_input / 2, max_output); // TODO ïîïðîáîâàòü îïòèìèçèðîâàòü, çàìåíèâ äåëåíèå íà ñäâèã
|
|
|
|
from_next = from;
|
|
to_next = to;
|
|
|
|
for (;count--; from_next += 2, ++to_next)
|
|
{
|
|
unsigned char c1 = *from_next;
|
|
unsigned char c2 = *(from_next + 1);
|
|
*to_next = c2 | c1 << 8;
|
|
}
|
|
|
|
if (to_next == to && from_next == from_end - 1)
|
|
return partial;
|
|
return ok;
|
|
}
|
|
|
|
ube_conversion::result
|
|
ube_conversion::do_out(mbstate_t&,
|
|
const wchar_t* from, const wchar_t* from_end, const wchar_t*& from_next,
|
|
char* to, char* to_limit, char*& to_next) const
|
|
{
|
|
const int max_input = (from_end - from);
|
|
const int max_output = (to_limit - to) & ~1;
|
|
int count = min(max_input, max_output / 2); // TODO ïîïðîáîâàòü îïòèìèçèðîâàòü, çàìåíèâ äåëåíèå íà ñäâèã
|
|
|
|
from_next = from;
|
|
to_next = to;
|
|
|
|
for (;count--; ++from_next, to_next += 2)
|
|
{
|
|
*(to_next + 1) = *from_next & 0xFF;
|
|
*(to_next + 0) = *from_next >> 8 & 0xFF;
|
|
}
|
|
return ok;
|
|
}
|
|
|
|
|
|
utf8_conversion::result
|
|
utf8_conversion::do_in(mbstate_t&,
|
|
const char* from, const char* from_end, const char*& from_next,
|
|
wchar_t* to, wchar_t* to_limit, wchar_t*& to_next) const
|
|
{
|
|
from_next = from;
|
|
to_next = to;
|
|
|
|
for(; to_next < to_limit && from_next < from_end; ++to_next)
|
|
{
|
|
if (static_cast<unsigned char>(*from_next) < 0x80)
|
|
{
|
|
*to_next = static_cast<unsigned char>(*from_next++);
|
|
}
|
|
else
|
|
{
|
|
const int zero_bit_pos = most_signifant_bit_position(~*from_next);
|
|
int extra_bytes = 7 - zero_bit_pos;
|
|
|
|
if (from_end - from_next < extra_bytes + 1)
|
|
return partial;
|
|
|
|
*to_next = static_cast<unsigned char>(*from_next++) & ((1 << zero_bit_pos - 1) - 1);
|
|
for (;extra_bytes--; ++from_next)
|
|
{
|
|
*to_next = *to_next << 6 | static_cast<unsigned char>(*from_next) & 63;
|
|
}
|
|
}
|
|
}
|
|
return ok;
|
|
}
|
|
|
|
|
|
// TODO ìîæíî îïòèìèçèðîâàòü, ñ÷èòàÿ ÷òî â utf8 ìàêñèìàëüíîå çíà÷åíèå áàéò íà ñèìâîë 4.
|
|
// È ïîñëå çàìåíèâ äåëåíèå è óìíîæåíèå íà ñäâèãè
|
|
utf8_conversion::result
|
|
utf8_conversion::do_out(mbstate_t&,
|
|
const wchar_t* from, const wchar_t* from_end, const wchar_t*& from_next,
|
|
char* to, char* to_limit, char*& to_next) const
|
|
{
|
|
from_next = from;
|
|
to_next = to;
|
|
|
|
for (;from_next < from_end; ++from_next)
|
|
{
|
|
const unsigned symbol = *from_next;
|
|
|
|
if (symbol < 0x7F)
|
|
{
|
|
if (to_next < to_limit)
|
|
*to_next++ = static_cast<unsigned char>(symbol);
|
|
else
|
|
return ok;
|
|
}
|
|
else
|
|
{
|
|
const size_t msb_pos = most_signifant_bit_position(symbol);
|
|
int extra_bytes = msb_pos / 6;
|
|
|
|
if (to_limit - to_next >= extra_bytes + 1)
|
|
{
|
|
*to_next = static_cast<unsigned char>(0xFF80 >> extra_bytes);
|
|
*to_next++ |= take_6_bits(symbol, extra_bytes * 6);
|
|
|
|
for(;extra_bytes--;)
|
|
*to_next++ = 0x80 | take_6_bits(symbol, extra_bytes * 6);
|
|
}
|
|
else
|
|
{
|
|
return ok;
|
|
}
|
|
}
|
|
}
|
|
return ok;
|
|
}
|
|
|
|
|
|
const unsigned char
|
|
utf8_conversion::take_6_bits(const int unsigned value, const size_t right_position) const
|
|
{
|
|
return (value >> right_position) & 63;
|
|
}
|
|
|
|
|
|
const size_t
|
|
utf8_conversion::most_signifant_bit_position(const unsigned int value) const
|
|
{
|
|
size_t result = 0;
|
|
size_t half = 16;
|
|
|
|
for(; half > 0; half >>= 1)
|
|
{
|
|
if (1u << (result + half) <= value )
|
|
result += half;
|
|
}
|
|
return result + 1;
|
|
}
|