|
|
| version 1.186, 2003/11/04 12:04:39 | version 1.202.6.2, 2005/12/09 07:33:10 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: string class. @see untalength_t.C. | Parser: string class. @see untalength_t.C. |
| Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001-2005 ArtLebedev Group (http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) |
| */ | */ |
| static const char* IDENT_STRING_C="$Date$"; | static const char * const IDENT_STRING_C="$Date$"; |
| #include "pcre.h" | #include "pcre.h" |
| Line 17 static const char* IDENT_STRING_C="$Date | Line 17 static const char* IDENT_STRING_C="$Date |
| const String String::Empty; | const String String::Empty; |
| int pa_atoi(const char* str, const String* problem_source) { | |
| if(!str) | |
| return 0; | |
| while(*str && isspace((unsigned char)*str)) | |
| str++; | |
| if(!*str) | |
| return 0; | |
| int result; | |
| char *error_pos; | |
| bool negative=false; | |
| if(str[0]=='-') { | |
| negative=true; | |
| str++; | |
| } else if(str[0]=='+') { | |
| str++; | |
| } | |
| // 0xABC | |
| if(str[0]=='0') | |
| if(str[1]=='x' || str[1]=='X') | |
| result=(int)(unsigned long)strtol(str, &error_pos, 0); | |
| else { | |
| // skip leading 0000, to disable octal interpretation | |
| do str++; while(*str=='0'); | |
| result=(int)strtol(str, &error_pos, 0); | |
| } | |
| else | |
| result=(int)strtol(str, &error_pos, 0); | |
| if(negative) | |
| result=-result; | |
| while(char c=*error_pos++) | |
| if(!isspace((unsigned char)c)) | |
| throw Exception("number.format", | |
| problem_source, | |
| problem_source?"invalid number (int)": "'%s' is invalid number (int)", str); | |
| return result; | |
| } | |
| double pa_atod(const char* str, const String* problem_source) { | |
| if(!str) | |
| return 0; | |
| while(*str && isspace((unsigned char)*str)) | |
| str++; | |
| if(!*str) | |
| return 0; | |
| double result; | |
| char *error_pos; | |
| bool negative=false; | |
| if(str[0]=='-') { | |
| negative=true; | |
| str++; | |
| } else if(str[0]=='+') { | |
| str++; | |
| } | |
| // 0xABC | |
| if(str[0]=='0') | |
| if(str[1]=='x' || str[1]=='X') | |
| result=(double)(unsigned long)strtol(str, &error_pos, 0); | |
| else { | |
| // skip leading 0000, to disable octal interpretation | |
| do str++; while(*str=='0'); | |
| result=(double)strtod(str, &error_pos); | |
| } | |
| else | |
| result=(double)strtod(str, &error_pos); | |
| if(negative) | |
| result=-result; | |
| while(char c=*error_pos++) | |
| if(!isspace((unsigned char)c)) | |
| throw Exception("number.format", | |
| problem_source, | |
| problem_source?"invalid number (double)": "'%s' is invalid number (double)", str); | |
| return result; | |
| } | |
| // cord lib extension | // cord lib extension |
| #ifndef DOXYGEN | #ifndef DOXYGEN |
| Line 43 int CORD_range_contains_chr_greater_then | Line 125 int CORD_range_contains_chr_greater_then |
| return(CORD_block_iter(x, i, CORD_range_contains_chr_greater_then_proc, &d) == 1/*alternatives: 0 normally ended, 2=struck 'n'*/); | return(CORD_block_iter(x, i, CORD_range_contains_chr_greater_then_proc, &d) == 1/*alternatives: 0 normally ended, 2=struck 'n'*/); |
| } | } |
| static int CORD_block_count_proc(char c, size_t size, void* client_data) | static int CORD_block_count_proc(char /*c*/, size_t /*size*/, void* client_data) |
| { | { |
| int* result=(int*)client_data; | int* result=(int*)client_data; |
| (*result)++; | (*result)++; |
| Line 84 String::Body String::Body::Format(int va | Line 166 String::Body String::Body::Format(int va |
| return String::Body(pa_strdup(local, length), length); | return String::Body(pa_strdup(local, length), length); |
| } | } |
| String::Body String::Body::trim(String::Trim_kind kind, const char* chars, | |
| size_t* out_start, size_t* out_length) const { | |
| size_t our_length=length(); | |
| if(!our_length) | |
| return *this; | |
| if(!chars) | |
| chars=" \t\n"; // white space | |
| size_t start=0; | |
| size_t end=our_length; | |
| // from left... | |
| if(kind!=TRIM_END) { | |
| CORD_pos pos; set_pos(pos, 0); | |
| while(true) { | |
| char c=CORD_pos_fetch(pos); | |
| if(strchr(chars, c)) { | |
| if(++start==our_length) | |
| return 0; // all chars are empty, just return empty string | |
| } else | |
| break; | |
| CORD_next(pos); | |
| } | |
| } | |
| // from right.. | |
| if(kind!=TRIM_START) { | |
| CORD_pos pos; set_pos(pos, end-1); | |
| while(true) { | |
| char c=CORD_pos_fetch(pos); | |
| if(strchr(chars, c)) { | |
| if(--end==0) // optimization: NO need to check for 'end>=start', that's(<) impossible | |
| return 0; // all chars are empty, just return empty string | |
| } else | |
| break; | |
| CORD_prev(pos); | |
| } | |
| } | |
| if(start==0 && end==our_length) // nobody moved a thing | |
| return *this; | |
| if(out_start) | |
| *out_start=start; | |
| size_t new_length=end-start; | |
| if(out_length) | |
| *out_length=new_length; | |
| return mid(start, new_length); | |
| } | |
| static int CORD_batched_iter_fn_generic_hash_code(char c, void * client_data) { | static int CORD_batched_iter_fn_generic_hash_code(char c, void * client_data) { |
| uint& result=*static_cast<uint*>(client_data); | uint& result=*static_cast<uint*>(client_data); |
| generic_hash_code(result, c); | generic_hash_code(result, c); |
| Line 162 String& String::mid(size_t substr_begin, | Line 295 String& String::mid(size_t substr_begin, |
| // next: letters themselves | // next: letters themselves |
| result.body=body.mid(substr_begin, substr_length); | result.body=body.mid(substr_begin, substr_length); |
| // SAPI::log("piece of '%s' from %d to %d is '%s'", | |
| //cstr(), substr_begin, substr_end, result.cstr()); | |
| ASSERT_STRING_INVARIANT(result); | ASSERT_STRING_INVARIANT(result); |
| return result; | return result; |
| } | } |
| Line 241 static void regex_options(const String* | Line 372 static void regex_options(const String* |
| int *result; | int *result; |
| bool *flag; | bool *flag; |
| } regex_option[]={ | } regex_option[]={ |
| {"i", "I", 0, PCRE_CASELESS, result}, // a=A | {"i", "I", 0, PCRE_CASELESS, result, 0}, // a=A |
| {"s", "S", 0, PCRE_DOTALL, result}, // \n\n$ [default] | {"s", "S", 0, PCRE_DOTALL, result, 0}, // \n\n$ [default] |
| {"x", "U", 0, PCRE_EXTENDED, result}, // whitespace in regex ignored | {"x", "U", 0, PCRE_EXTENDED, result, 0}, // whitespace in regex ignored |
| {"m", "M", PCRE_DOTALL, PCRE_MULTILINE, result}, // ^aaa\n$^bbb\n$ | {"m", "M", PCRE_DOTALL, PCRE_MULTILINE, result, 0}, // ^aaa\n$^bbb\n$ |
| {"g", "G", 0, true, result+1}, // many rows | {"g", "G", 0, 1, result+1, 0}, // many rows |
| {"'", 0, 0, 0, 0, &need_pre_post_match}, | {"'", 0, 0, 0, 0, &need_pre_post_match}, |
| {0} | {0, 0, 0, 0, 0, 0} |
| }; | }; |
| result[0]=PCRE_EXTRA | PCRE_DOTALL | PCRE_DOLLAR_ENDONLY; | result[0]=PCRE_EXTRA | PCRE_DOTALL | PCRE_DOLLAR_ENDONLY; |
| result[1]=0; | result[1]=0; |
| Line 275 Table* String::match(Charset& source_cha | Line 406 Table* String::match(Charset& source_cha |
| 0, | 0, |
| "regexp is empty"); | "regexp is empty"); |
| const char* pattern=regexp.cstr(); | const char* pattern=regexp.cstr(String::L_UNSPECIFIED); // fix any tainted with L_REGEX |
| const char* errptr; | const char* errptr; |
| int erroffset; | int erroffset; |
| bool need_pre_post_match=false; | bool need_pre_post_match=false; |
| Line 375 String& String::change_case(Charset& sou | Line 506 String& String::change_case(Charset& sou |
| return result; | return result; |
| char* new_cstr=cstrm(); | char* new_cstr=cstrm(); |
| char *dest=new_cstr; | size_t new_cstr_len=length(); |
| if(source_charset.isUTF8()) { | if(source_charset.isUTF8()) { |
| switch(kind) { | switch(kind) { |
| case CC_UPPER: | case CC_UPPER: |
| change_case_UTF8((const XMLByte*)new_cstr, (XMLByte*)new_cstr, UTF8CaseToUpper); | change_case_UTF8((const XMLByte*)new_cstr, new_cstr_len, (XMLByte*)new_cstr, new_cstr_len, UTF8CaseToUpper); |
| break; | break; |
| case CC_LOWER: | case CC_LOWER: |
| change_case_UTF8((const XMLByte*)new_cstr, (XMLByte*)new_cstr, UTF8CaseToLower); | change_case_UTF8((const XMLByte*)new_cstr, new_cstr_len, (XMLByte*)new_cstr, new_cstr_len, UTF8CaseToLower); |
| break; | break; |
| default: | default: |
| assert(!"unknown change case kind"); | assert(!"unknown change case kind"); |
| Line 409 String& String::change_case(Charset& sou | Line 540 String& String::change_case(Charset& sou |
| break; // never | break; // never |
| } | } |
| char *dest=new_cstr; | |
| unsigned char index; | unsigned char index; |
| for(const char* current=new_cstr; index=(unsigned char)*current; current++) { | for(const char* current=new_cstr; (index=(unsigned char)*current); current++) { |
| unsigned char c=a[index]; | unsigned char c=a[index]; |
| if(b) | if(b) |
| c=b[c]; | c=b[c]; |
| Line 458 const String& String::replace(const Dict | Line 590 const String& String::replace(const Dict |
| return result; | return result; |
| } | } |
| double String::as_double() const { | |
| double result; | |
| const char *str=cstr(); | |
| while(*str && isspace(*str)) | |
| str++; | |
| if(!*str) | |
| return 0; | |
| char *error_pos; | |
| // 0xABC | |
| if(str[0]=='0') | |
| if(str[1]=='x' || str[1]=='X') | |
| result=(double)(unsigned long)strtol(str, &error_pos, 0); | |
| else | |
| result=(double)strtod(str+1/*skip leading 0*/, &error_pos); | |
| else | |
| result=(double)strtod(str, &error_pos); | |
| while(char c=*error_pos++) | |
| if(!isspace(c)) | |
| throw Exception("number.format", | |
| this, | |
| "invalid number (double)"); | |
| return result; | |
| } | |
| int String::as_int() const { | |
| int result; | |
| const char *str=cstr(); | |
| while(*str && isspace(*str)) | |
| str++; | |
| if(!*str) | |
| return 0; | |
| char *error_pos; | |
| // 0xABC | |
| if(str[0]=='0') | |
| if(str[1]=='x' || str[1]=='X') | |
| result=(int)(unsigned long)strtol(str, &error_pos, 0); | |
| else | |
| result=(int)strtol(str+1/*skip leading 0*/, &error_pos, 0); | |
| else | |
| result=(int)strtol(str, &error_pos, 0); | |
| while(char c=*error_pos++) | |
| if(!isspace(c)) | |
| throw Exception("number.format", | |
| this, | |
| "invalid number (int)"); | |
| return result; | |
| } | |
| static int serialize_body_char(char c, char** cur) { | static int serialize_body_char(char c, char** cur) { |
| *((*cur)++)=c; | *((*cur)++)=c; |
| return 0; // 0=continue | return 0; // 0=continue |
| Line 524 static int serialize_body_piece(const ch | Line 601 static int serialize_body_piece(const ch |
| }; | }; |
| static int serialize_lang_piece(char alang, size_t asize, char** cur) { | static int serialize_lang_piece(char alang, size_t asize, char** cur) { |
| // lang | // lang |
| memcpy(*cur, &alang, sizeof(alang)); *cur+=sizeof(alang); | **cur=alang; (*cur)++; |
| // length | // length [WARNING: not cast, addresses must be %4=0 on sparc] |
| memcpy(*cur, &asize, sizeof(asize)); *cur+=sizeof(asize); | memcpy(*cur, &asize, sizeof(asize)); *cur+=sizeof(asize); |
| return 0; // 0=continue | return 0; // 0=continue |
| } | } |
| String::Cm String::serialize(size_t prolog_length) const { | String::Cm String::serialize(size_t prolog_length) const { |
| size_t fragments_count=langs.count(); | size_t fragments_count=langs.count(); |
| size_t body_length=body.length(); | |
| size_t buf_length= | size_t buf_length= |
| prolog_length //1 | prolog_length //1 |
| +sizeof(size_t) //2 | +sizeof(size_t) //2 |
| +fragments_count*(sizeof(char)+sizeof(size_t)) //3 | +body_length //3 |
| +body.length() //4 | +1 // 4 for zero terminator used in deserialize |
| +1; // for zero terminator used in deserialize | +sizeof(size_t) //5 |
| +fragments_count*(sizeof(char)+sizeof(size_t)); //6 | |
| String::Cm result(new(PointerFreeGC) char[buf_length], buf_length); | String::Cm result(new(PointerFreeGC) char[buf_length], buf_length); |
| // 1: prolog | // 1: prolog |
| char *cur=result.str+prolog_length; | char *cur=result.str+prolog_length; |
| // 2: langs.count | // 2: chars.count [WARNING: not cast, addresses must be %4=0 on sparc] |
| memcpy(cur, &body_length, sizeof(body_length)); cur+=sizeof(body_length); | |
| // 3: letters | |
| body.for_each(serialize_body_char, serialize_body_piece, &cur); | |
| // 4: zero terminator | |
| *cur++=0; | |
| // 5: langs.count [WARNING: not cast, addresses must be %4=0 on sparc] | |
| memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count); | memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count); |
| // 3: lang info | // 6: lang info |
| langs.for_each(body, serialize_lang_piece, &cur); | langs.for_each(body, serialize_lang_piece, &cur); |
| // 4: letters | |
| body.for_each(serialize_body_char, serialize_body_piece, &cur); | |
| // 5: zero terminator | |
| *cur=0; | |
| return result; | return result; |
| } | } |
| bool String::deserialize(size_t prolog_length, void *buf, size_t buf_length) { | bool String::deserialize(size_t prolog_size, void *buf, size_t buf_size) { |
| if(buf_length<=prolog_length) | size_t in_buf=buf_size; |
| if(in_buf<=prolog_size) | |
| return false; | return false; |
| buf_length-=prolog_length; | in_buf-=prolog_size; |
| buf_length-=1; // 5: zero terminator | |
| // 1: prolog | // 1: prolog |
| const char* cur=(const char* )buf+prolog_length; | const char* cur=(const char* )buf+prolog_size; |
| // 2: langs.count | // 2: langs.count |
| if(buf_length<sizeof(size_t)) // langs.count don't fit? | size_t body_length; |
| if(in_buf<sizeof(body_length)) // body.length don't fit? | |
| return false; | |
| // [WARNING: not cast, addresses must be %4=0 on sparc] | |
| memcpy(&body_length, cur, sizeof(body_length)); cur+=sizeof(body_length); | |
| in_buf-=sizeof(body_length); | |
| if(in_buf<body_length+1) // letters+terminator don't fit? | |
| return false; | |
| // 4: zero terminator | |
| if(cur[body_length] != 0) // in place? | |
| return false; | return false; |
| size_t fragments_count=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t); | // 3: letters |
| buf_length-=sizeof(size_t); | body=String::Body(cur, body_length); |
| cur+=body_length+1; | |
| in_buf-=body_length+1; | |
| // 5: langs.count | |
| size_t fragments_count; | |
| if(in_buf<sizeof(fragments_count)) // langs.count don't fit? | |
| return false; | |
| // [WARNING: not cast, addresses must be %4=0 on sparc] | |
| memcpy(&fragments_count, cur, sizeof(fragments_count)); cur+=sizeof(fragments_count); | |
| in_buf-=sizeof(fragments_count); | |
| if(fragments_count) { | if(fragments_count) { |
| // 3: lang info | // 6: lang info |
| size_t total_length=0; | size_t total_length=0; |
| for(size_t f=0; f<fragments_count; f++) { | for(size_t f=0; f<fragments_count; f++) { |
| size_t piece_length=sizeof(char)+sizeof(size_t); | char lang; |
| if(buf_length<piece_length) // lang+length | size_t fragment_length; |
| size_t piece_length=sizeof(lang)+sizeof(fragment_length); | |
| if(in_buf<piece_length) // lang+length | |
| return false; | return false; |
| Language lang=*reinterpret_cast<const Language *>(cur); cur+=sizeof(char); | // lang |
| size_t fragment_length=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t); | lang=*cur++; |
| langs.append(total_length, lang, fragment_length); | // length [WARNING: not cast, addresses must be %4=0 on sparc] |
| total_length+=fragment_length; | memcpy(&fragment_length, cur, sizeof(fragment_length)); cur+=sizeof(fragment_length); |
| buf_length-=piece_length; | // uchar needed to prevent propagating 0x80 bit to upper bytes |
| langs.append(total_length, (String::Language)(uchar)lang, fragment_length); | |
| total_length+=fragment_length; | |
| in_buf-=piece_length; | |
| } | } |
| // 4: letters | if(total_length!=body_length) // length(all language fragments) vs length(letters) |
| if(buf_length!=total_length) | |
| return false; | return false; |
| // serialize wrote extra zero byte there, we can rely on that | |
| body=String::Body(cur, buf_length); | |
| } | } |
| if(in_buf!=0) // some strange extra bytes | |
| return false; | |
| ASSERT_STRING_INVARIANT(*this); | ASSERT_STRING_INVARIANT(*this); |
| return true; | return true; |
| Line 599 bool String::deserialize(size_t prolog_l | Line 704 bool String::deserialize(size_t prolog_l |
| const char* String::Body::v() const { | const char* String::Body::v() const { |
| return CORD_to_const_char_star(body); | return CORD_to_const_char_star(body); |
| } | } |
| void String::Body::dump() const { | |
| CORD_dump(body); | |
| } | |
| const char* String::Languages::v() const { | const char* String::Languages::v() const { |
| if(opt.is_not_just_lang) | if(opt.is_not_just_lang) |
| return CORD_to_const_char_star(langs); | return CORD_to_const_char_star(langs); |
| else | else |
| return (const char*)&langs; | return (const char*)&langs; |
| } | } |
| void String::Languages::dump() const { | |
| if(opt.is_not_just_lang) | |
| CORD_dump(langs); | |
| else | |
| puts((const char*)&langs); | |
| } | |
| const char* String::v() const { | const char* String::v() const { |
| #define LIMIT_VIEW 20 | const uint LIMIT_VIEW=20; |
| char* buf=(char*)malloc(MAX_STRING); | char* buf=(char*)malloc(MAX_STRING); |
| const char*body_view=body.v(); | const char*body_view=body.v(); |
| const char*langs_view=langs.v(); | const char*langs_view=langs.v(); |
| Line 618 const char* String::v() const { | Line 733 const char* String::v() const { |
| ); | ); |
| return buf; | return buf; |
| #undef LIMIT_VIEW | } |
| void String::dump() const { | |
| body.dump(); | |
| langs.dump(); | |
| } | |
| const String& String::trim(String::Trim_kind kind, const char* chars) const { | |
| if(!length()) | |
| return *this; | |
| size_t substr_begin, substr_length; | |
| Body new_body=body.trim(kind, chars, &substr_begin, &substr_length); | |
| if(new_body==body) // we received unchanged pointer, do likewise | |
| return *this; | |
| // new_body differs from body, adjust langs along | |
| String& result=*new String; | |
| if(!new_body) // body.trim produced empty result | |
| return result; | |
| // body.trim produced nonempty result | |
| // first: their langs | |
| result.langs.append(result.body, langs, substr_begin, substr_length); | |
| // next: letters themselves | |
| result.body=new_body; | |
| ASSERT_STRING_INVARIANT(result); | |
| return result; | |
| } | } |