|
|
| version 1.20, 2001/02/14 13:40:54 | version 1.44, 2001/03/19 20:07:37 |
|---|---|
| Line 1 | Line 1 |
| /* | /** @file |
| $Id$ | Parser: string class decl. |
| */ | |
| /* | Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) |
| String Chunk0 | Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) |
| ====== ======== | |
| head--------------->[ptr, size, ...] | |
| append_here-------->[ptr, size, ...] | |
| . | |
| . | |
| [ptr, size, ...] | |
| link_row----------->[link to the next chunk] | |
| $Id$ | |
| */ | */ |
| #ifndef PA_STRING_H | #ifndef PA_STRING_H |
| #define PA_STRING_H | #define PA_STRING_H |
| #ifdef HAVE_CONFIG_H | #ifdef HAVE_CONFIG_H |
| #include "pa_config.h" | # include "pa_config.h" |
| #endif | #endif |
| #include <stddef.h> | #include <stddef.h> |
| Line 27 | Line 20 |
| #include "pa_pool.h" | #include "pa_pool.h" |
| #include "pa_types.h" | #include "pa_types.h" |
| #define UNTAINT_TIMES_BIGGER 10 | |
| #ifndef NO_STRING_ORIGIN | #ifndef NO_STRING_ORIGIN |
| # define STRING_APPEND_PARAMS const char *src, char *file, uint line | # define STRING_APPEND_PARAMS \ |
| # define APPEND(src, file, line) real_append(src, file, line) | const char *src, size_t size, \ |
| bool tainted, \ | |
| const char *file, uint line | |
| /// appends clean piece to String | |
| # define APPEND(src, size, file, line) real_append(src, size, false, file, line) | |
| /// appends tainted piece to String | |
| # define APPEND_TAINTED(src, size, file, line) real_append(src, size, true, file, line) | |
| #else | #else |
| # define STRING_APPEND_PARAMS const char *src | # define STRING_APPEND_PARAMS \ |
| # define APPEND(src, file, line) real_append(src) | const char *src, \ |
| size_t size, \ | |
| bool tainted | |
| /// appends clean piece to String | |
| # define APPEND(src, size, file, line) real_append(src, size, false) | |
| /// appends tainted piece to String | |
| # define APPEND_TAINTED(src, size, file, line) real_append(src, size, true) | |
| #endif | #endif |
| /// handy: appends const char* piece to String | |
| #define APPEND_CONST(src) APPEND(src, 0, 0, 0) | |
| /** | |
| Pooled string. | |
| class String_iterator; | Internal structure: @verbatim |
| String Chunk0 | |
| ====== ======== | |
| head--------------->[ptr, size, ...] | |
| append_here-------->[ptr, size, ...] | |
| . | |
| . | |
| [ptr, size, ...] | |
| link_row----------->[link to the next chunk] | |
| @endverbatim | |
| All pieces remember | |
| - the file and its line they are from [can be turned off by NO_STRING_ORIGIN] | |
| - whether they are tainted or not, | |
| and the language which should be used to detaint them | |
| */ | |
| class String : public Pooled { | class String : public Pooled { |
| friend String_iterator; | |
| public: | public: |
| enum { | enum { |
| CR_PREALLOCATED_COUNT=5, | CR_PREALLOCATED_COUNT=5, ///< default preallocated item count |
| CR_GROW_PERCENT=60 | CR_GROW_PERCENT=60 ///< each time the Array chunk_is_full() array expanded() |
| }; | |
| /// piece is tainted or not. the language to use when detaint | |
| enum Untaint_lang { | |
| UNKNOWN=0, ///< when get by name fails | |
| NO, ///< clean | |
| YES, ///< tainted, untaint language as assigned later | |
| // untaint languages. assigned by ^untaint[lang]{...} | |
| PASS_APPENDED, | |
| /**< | |
| leave language built into string being appended. | |
| just a flag, that value not stored | |
| */ | |
| AS_IS, ///< leave all characters intact | |
| HEADER, ///< text in response header | |
| URI, ///< text in uri | |
| TABLE, ///< ^table:set body | |
| SQL, ///< ^table:sql body | |
| JS, ///< JavaScript code | |
| HTML, ///< HTML code (for editing) | |
| HTML_TYPO ///< HTML code with TYPOgraphic replacements (for showing) | |
| }; | }; |
| public: | public: |
| String(Pool& apool); | String(Pool& apool, const char *src=0, bool tainted=false); |
| String(const String& src); | String(const String& src); |
| //String(const String_iterator& begin, const String_iterator& end); | |
| size_t size() const { return fsize; } | size_t size() const { return fsize; } |
| int used_rows() const { return fused_rows; } | /// convert to C string |
| char *cstr() const; | char *cstr() const; |
| String& real_append(STRING_APPEND_PARAMS); | String& real_append(STRING_APPEND_PARAMS); |
| bool operator == (const String& src) const; | /// @return <0 ==0 or >0 depending on comparison result |
| String& append(const String_iterator& begin, const String_iterator& end); | int cmp (const String& src) const; |
| bool operator < (const String& src) const { return cmp(src)<0; } | |
| bool operator > (const String& src) const { return cmp(src)>0; } | |
| bool operator <= (const String& src) const { return cmp(src)<=0; } | |
| bool operator >= (const String& src) const { return cmp(src)>=0; } | |
| bool operator == (const String& src) const { | |
| if(size()!=src.size()) // can speed up in trivial case | |
| return false; | |
| return cmp(src)==0; | |
| } | |
| bool operator != (const String& src) const { return cmp(src)!=0; } | |
| bool operator == (const char* b_ptr) const; | |
| /** | |
| appends other String. | |
| marking all tainted pieces of it with \a lang. | |
| or marking ALL pieces of it with a \a lang when \a forced to. | |
| */ | |
| String& append(const String& src, Untaint_lang lang, bool forced=false); | |
| /// simple hash code of string. used by Hash | |
| uint hash_code() const; | uint hash_code() const; |
| const Origin& origin() const { return head.rows[0].item.origin; } | #ifndef NO_STRING_ORIGIN |
| /// origin of string. calculated by first row | |
| const Origin& origin() const; | |
| #endif | |
| private: | private: |
| Line 67 private: | Line 137 private: |
| // the number of rows in chunk | // the number of rows in chunk |
| int count; | int count; |
| union Row { | union Row { |
| // chunk item | // fragment |
| struct { | struct { |
| const char *ptr; // pointer to the start of string fragment | const char *ptr; // pointer to the start |
| size_t size; // length of the fragment | size_t size; // length |
| Origin origin; // origin of this fragment | Untaint_lang lang; // untaint flag, later untaint language |
| #ifndef NO_STRING_ORIGIN | |
| Origin origin; // origin | |
| #endif | |
| } item; | } item; |
| Chunk *link; // link to the next chunk in chain | Chunk *link; // link to the next chunk in chain |
| } rows[CR_PREALLOCATED_COUNT]; | } rows[CR_PREALLOCATED_COUNT]; |
| Line 88 private: | Line 161 private: |
| Chunk::Row *link_row; | Chunk::Row *link_row; |
| private: | private: |
| // last chank allocated count | // last chunk |
| int curr_chunk_rows; | Chunk *last_chunk; |
| // string size | // string size |
| size_t fsize; | size_t fsize; |
| Line 103 private: | Line 176 private: |
| return append_here == link_row; | return append_here == link_row; |
| } | } |
| void expand(); | void expand(); |
| void set_lang(Chunk::Row *row, Untaint_lang lang, bool forced, size_t size); | |
| private: //disabled | private: //disabled |
| Line 110 private: //disabled | Line 184 private: //disabled |
| }; | }; |
| class Char_types { | |
| public: | |
| Char_types(); | |
| void set(char from, char to, int type); | |
| void set(char c, int type) { | |
| types[static_cast<unsigned int>(c)]=static_cast<char>(type); | |
| } | |
| int get(char c) { | |
| return static_cast<int>(types[static_cast<unsigned int>(c)]); | |
| } | |
| private: | |
| char types[0x100]; | |
| }; | |
| class String_iterator { | |
| public: | |
| String_iterator(String& astring); | |
| void operator ++() { skip(); } | |
| void operator ++(int) { skip(); } | |
| int skip_to(Char_types& types); | |
| bool skip_to(char c); | |
| bool eof() { return position==0; } | |
| // current char | |
| char operator() () const; | |
| protected: | |
| // home string | |
| String& string; | |
| // the row in which we are | |
| String::Chunk::Row *read_here; | |
| // position in text, eof when 0 | |
| const char *position; | |
| // when read_here reaches this row, move to the next chunk | |
| String::Chunk::Row *link_row; | |
| protected: | |
| // advances position by one char | |
| void skip(); | |
| }; | |
| #endif | #endif |