--- parser3/src/main/pa_string.C 2001/01/26 15:28:39 1.2 +++ parser3/src/main/pa_string.C 2003/09/29 09:42:12 1.181 @@ -1,77 +1,616 @@ -#include +/** @file + Parser: string class. @see untalength_t.C. -#include "pa_pool.h" + Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com) + Author: Alexandr Petrosian (http://paf.design.ru) +*/ + +static const char* IDENT_STRING_C="$Date: 2003/09/29 09:42:12 $"; + +#include "pcre.h" + +#include "pa_string.h" +#include "pa_exception.h" +#include "pa_table.h" +#include "pa_dictionary.h" +#include "pa_charset.h" + +// cord lib extension + +#ifndef DOXYGEN +typedef struct { + ssize_t countdown; + char target; /* Character we're looking for */ +} chr_data; +#endif +static int CORD_range_contains_chr_greater_then_proc(char c, size_t size, void* client_data) +{ + register chr_data * d = (chr_data *)client_data; + + if (d -> countdown<=0) return(2); + d -> countdown -= size; + if (c > d -> target) return(1); + return(0); +} +int CORD_range_contains_chr_greater_then(CORD x, size_t i, size_t n, int c) +{ + chr_data d; + + d.countdown = n; + d.target = c; + return(CORD_block_iter(x, i, CORD_range_contains_chr_greater_then_proc, &d) == 1/*alternatives: 0 normally ended, 2=struck 'n'*/); +} -void *String::operator new(size_t size, Pool *apool) { - return apool->alloc(size); +static int CORD_block_count_proc(char c, size_t size, void* client_data) +{ + int* result=(int*)client_data; + (*result)++; + return(0); // 0=continue +} +size_t CORD_block_count(CORD x) +{ + size_t result=0; + CORD_block_iter(x, 0, CORD_block_count_proc, &result); + return result; } -void String::construct(Pool *apool) { - pool=apool; - head.count=curr_chunk_rows=CR_PREALLOCATED_COUNT; - append_here=head.first; - head.preallocated_link=0; - link_row=&head.first[curr_chunk_rows]; +// helpers + +/// String::match uses this as replace & global search table columns + +const int MAX_MATCH_GROUPS=100; + +class String_match_table_template_columns: public ArrayString { +public: + String_match_table_template_columns() { + *this+=new String("prematch"); + *this+=new String("match"); + *this+=new String("postmatch"); + for(int i=0; i( - pool->calloc(sizeof(Chunk::Row)*curr_chunk_rows+sizeof(Chunk *))); - chunk->count=curr_chunk_rows; - link_row->link=chunk; - append_here=chunk->first; - link_row=&chunk->first[curr_chunk_rows]; +static int CORD_batched_iter_fn_generic_hash_code(char c, void * client_data) { + uint& result=*static_cast(client_data); + generic_hash_code(result, c); + return 0; } +static int CORD_batched_iter_fn_generic_hash_code(const char* s, void * client_data) { + uint& result=*static_cast(client_data); + generic_hash_code(result, s); + return 0; +}; +uint String::Body::hash_code() const { + uint result=0; + CORD_iter5(body, 0, + CORD_batched_iter_fn_generic_hash_code, + CORD_batched_iter_fn_generic_hash_code, &result); + return result; +} + +// String methods -String& String::operator += (char *src) { - if(chunk_is_full()) - expand(); +String::String(const char* cstr, size_t helper_length, bool tainted): body(CORD_EMPTY) { + append_help_length(cstr, helper_length, tainted?L_TAINTED:L_CLEAN); +} +String::String(const String::C cstr, bool tainted): body(CORD_EMPTY) { + append_know_length(cstr.str, cstr.length, tainted?L_TAINTED:L_CLEAN); +} + +String& String::append_know_length(const char* str, size_t known_length, Language lang) { + if(!known_length) + return *this; + + // first: langs + langs.append(body, lang, known_length); + // next: letters themselves + body.append_know_length(str, known_length); + + ASSERT_STRING_INVARIANT(*this); + return *this; +} +String& String::append_help_length(const char* str, size_t helper_length, Language lang) { + if(!str) + return *this; + size_t known_length=helper_length?helper_length:strlen(str); + if(!known_length) + return *this; - append_here->item.ptr=src; - append_here->item.size=strlen(src); - append_here++; + return append_know_length(str, known_length, lang); +} +String& String::append_strdup(const char* str, size_t helper_length, Language lang) { + size_t known_length=helper_length?helper_length:strlen(str); + if(!known_length) + return *this; + + // first: langs + langs.append(body, lang, known_length); + // next: letters themselves + body.append_strdup_know_length(str, known_length); + ASSERT_STRING_INVARIANT(*this); return *this; } -size_t String::size() { - int result=0; - Chunk *chunk=&head; - do { - Chunk::Row *row=chunk->first; - for(int i=0; icount; i++) { - if(row==append_here) - goto break2; - - result+=row->item.size; - row++; - } - chunk=row->link; - } while(chunk); -break2: +/// @todo check in doc: whether it documents NOW bad situation "abc".mid(-1, 3) =were?="ab" +String& String::mid(size_t substr_begin, size_t substr_end) const { + String& result=*new String; + + size_t self_length=length(); + substr_begin=min(substr_begin, self_length); + substr_end=min(max(substr_end, substr_begin), self_length); + size_t substr_length=substr_end-substr_begin; + if(!substr_length) + return result; + + // first: their langs + result.langs.append(result.body, langs, substr_begin, substr_length); + // next: letters themselves + 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); return result; } -char *String::c_str() { - char *result=static_cast(pool->alloc(size()+1)); - - char *copy_here=result; - Chunk *chunk=&head; - do { - Chunk::Row *row=chunk->first; - for(int i=0; icount; i++) { - if(row==append_here) - goto break2; - - memcpy(copy_here, row->item.ptr, row->item.size); - copy_here+=row->item.size; - row++; - } - chunk=row->link; - } while(chunk); -break2: - *copy_here=0; +size_t String::pos(const String::Body substr, size_t this_offset, Language lang) const { + size_t substr_begin=body.pos(substr, this_offset); + if(substr_begin==CORD_NOT_FOUND || !langs.check_lang(lang, substr_begin, substr.length())) + return STRING_NOT_FOUND; + + return substr_begin; +} + +size_t String::pos(const String& substr, + size_t this_offset, Language lang) const { + return pos(substr.body, this_offset, lang); +} + +void String::split(ArrayString& result, + size_t& pos_after, + const char* delim, + Language lang, int limit) const { + size_t self_length=length(); + if(size_t delim_length=strlen(delim)) { + int pos_before; + // while we have 'delim'... + for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) { + result+=&mid(pos_after, pos_before); + pos_after=pos_before+delim_length; + } + // last piece + if(pos_afteris_empty()) + for(Regex_option *o=regex_option; o->keyL; o++) + if(options->pos(o->keyL)!=STRING_NOT_FOUND + || (o->keyU && options->pos(o->keyU)!=STRING_NOT_FOUND)) { + if(o->flag) + *o->flag=true; + else { // result + *o->result &= ~o->clear; + *o->result |= o->set; + } + } +} + +Table* String::match(Charset& source_charset, + const String& regexp, + const String* options, + Row_action row_action, void *info, + bool& just_matched) const { + if(regexp.is_empty()) + throw Exception(0, + 0, + "regexp is empty"); + + const char* pattern=regexp.cstr(); + const char* errptr; + int erroffset; + bool need_pre_post_match=false; + int option_bits[2]={0}; regex_options(options, option_bits, need_pre_post_match); + bool global=option_bits[1]!=0; + pcre *code=pcre_compile(pattern, option_bits[0], + &errptr, &erroffset, + source_charset.pcre_tables); + + if(!code) + throw Exception(0, + ®exp.mid(erroffset, regexp.length()), + "regular expression syntax error - %s", errptr); + + int subpatterns=pcre_info(code, 0, 0); + if(subpatterns<0) { + pcre_free(code); + throw Exception(0, + ®exp, + "pcre_info error (%d)", + subpatterns); + } + + const char* subject=cstr(); + size_t subject_length=strlen(subject); + const int oveclength=(1/*match*/+MAX_MATCH_GROUPS)*3; + int ovector[oveclength]; + + // create table + Table::Action_options table_options; + Table& table=*new Table(string_match_table_template, table_options); + + int exec_option_bits=0; + int prestart=0; + int poststart=0; + int postfinish=length(); + while(true) { + int exec_substrings=pcre_exec(code, 0, + subject, subject_length, prestart, + exec_option_bits, ovector, oveclength); + + if(exec_substrings==PCRE_ERROR_NOMATCH) { + pcre_free(code); + row_action(table, 0/*last time, no raw*/, 0, 0, poststart, postfinish, info); + if(global || subpatterns) + return &table; // global or with subpatterns=true+result + else { + just_matched=false; return 0; // not global=no result + } + } + + if(exec_substrings<0) { + pcre_free(code); + throw Exception(0, + ®exp, + "regular expression execute error (%d)", + exec_substrings); + } + + int prefinish=ovector[0]; + poststart=ovector[1]; + ArrayString* row=new ArrayString; + if(need_pre_post_match) { + *row+=&mid(0, prefinish); // .prematch column value + *row+=&mid(prefinish, poststart); // .match + *row+=&mid(poststart, postfinish); // .postmatch + } else { + *row+=0; // .prematch column value + *row+=0; // .match + *row+=0; // .postmatch + } + + for(int i=1; iget(0); + // skip 'a' in 'current'; move prematch_begin + current+=a->length(); prematch_begin=current; + + if(row->count()>1) { // are there any b? + const String* b=row->get(1); + result<<*b; + } + } else // simply advance + current++; + } + + // postmatch + if(size_t postmatch_length=current-prematch_begin) { + result.langs.append(result.body, langs, prematch_begin-old_cstr, postmatch_length); + result.body.append_strdup_know_length(prematch_begin, postmatch_length); + } + + ASSERT_STRING_INVARIANT(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) { + *((*cur)++)=c; + return 0; // 0=continue +}; +static int serialize_body_piece(const char* s, char** cur) { + size_t length=strlen(s); + memcpy(*cur, s, length); *cur+=length; + return 0; // 0=continue +}; +static int serialize_lang_piece(char alang, size_t asize, char** cur) { + // lang + memcpy(*cur, &alang, sizeof(alang)); *cur+=sizeof(alang); + // length + memcpy(*cur, &asize, sizeof(asize)); *cur+=sizeof(asize); + + return 0; // 0=continue +} +String::Cm String::serialize(size_t prolog_length) const { + size_t fragments_count=langs.count(); + size_t buf_length= + prolog_length //1 + +sizeof(size_t) //2 + +fragments_count*(sizeof(char)+sizeof(size_t)) //3 + +body.length() //4 + +1; // for zero terminator used in deserialize + String::Cm result(new(PointerFreeGC) char[buf_length], buf_length); + + // 1: prolog + char *cur=result.str+prolog_length; + // 2: langs.count + memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count); + // 3: lang info + langs.for_each(body, serialize_lang_piece, &cur); + // 4: letters + body.for_each(serialize_body_char, serialize_body_piece, &cur); + // 5: zero terminator already there put by new(PointerFreeGC) + + return result; +} +bool String::deserialize(size_t prolog_length, void *buf, size_t buf_length) { + if(buf_length<=prolog_length) + return false; + buf_length-=prolog_length; + buf_length-=1; // 5: zero terminator + + // 1: prolog + const char* cur=(const char* )buf+prolog_length; + + // 2: langs.count + if(buf_length(cur); cur+=sizeof(size_t); + buf_length-=sizeof(size_t); + + if(fragments_count) { + // 3: lang info + size_t total_length=0; + for(size_t f=0; f(cur); cur+=sizeof(char); + size_t fragment_length=*reinterpret_cast(cur); cur+=sizeof(size_t); + langs.append(total_length, lang, fragment_length); + total_length+=fragment_length; + + buf_length-=piece_length; + } + + // 4: letters + if(buf_length!=total_length) + return false; + + // serialize wrote extra zero byte there, we can rely on that + body=String::Body(cur, buf_length); + } + + ASSERT_STRING_INVARIANT(*this); + return true; +} + +const char* String::Body::v() const { + return CORD_to_const_char_star(body); +} +const char* String::Languages::v() const { + if(opt.is_not_just_lang) + return CORD_to_const_char_star(langs); + else + return (const char*)&langs; +} +const char* String::v() const { +#define LIMIT_VIEW 20 + char* buf=(char*)malloc(MAX_STRING); + const char*body_view=body.v(); + const char*langs_view=langs.v(); + snprintf(buf, MAX_STRING, + "%d:%.*s%s} " + "{%d:%s", + langs.count(), LIMIT_VIEW, langs_view, strlen(langs_view)>LIMIT_VIEW?"...":"", + strlen(body_view), body_view + ); + + return buf; +#undef LIMIT_VIEW +}