|
|
| version 1.8, 2001/06/28 07:44:17 | version 1.50, 2002/09/18 08:52:47 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: @b hash parser class. | Parser: @b hash parser class. |
| Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001, 2002 ArtLebedev Group (http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | |
| Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) | |
| $Id$ | |
| */ | */ |
| static const char *RCSId="$Id$"; | |
| static const char* IDENT_HASH_C="$Date$"; | |
| #include "classes.h" | #include "classes.h" |
| #include "pa_request.h" | #include "pa_request.h" |
| #include "pa_vhash.h" | #include "pa_vhash.h" |
| #include "pa_vvoid.h" | #include "pa_vvoid.h" |
| #include "pa_sql_connection.h" | #include "pa_sql_connection.h" |
| #include "pa_vtable.h" | |
| // defines | #include "pa_vbool.h" |
| #include "pa_vmethod_frame.h" | |
| #define HASH_CLASS_NAME "hash" | |
| // class | // class |
| Line 33 public: // Methoded | Line 30 public: // Methoded |
| // methods | // methods |
| static void _default(Request& r, const String&, MethodParams *params) { | #ifndef DOXYGEN |
| Pool& pool=r.pool(); | class Hash_sql_event_handlers : public SQL_Driver_query_event_handlers { |
| public: | |
| Hash_sql_event_handlers(Pool& apool, const String& amethod_name, | |
| const String& astatement_string, const char *astatement_cstr, | |
| bool adistinct, | |
| Hash& arows_hash) : | |
| pool(apool), | |
| method_name(amethod_name), | |
| statement_string(astatement_string), | |
| statement_cstr(astatement_cstr), | |
| distinct(adistinct), | |
| rows_hash(arows_hash), | |
| columns(pool), | |
| row_index(0) { | |
| } | |
| void add_column(void *ptr, size_t size) { | |
| String *column=new(pool) String(pool); | |
| column->APPEND_TAINTED( | |
| (const char *)ptr, size, | |
| statement_cstr, 0); | |
| columns+=column; | |
| } | |
| void before_rows() { | |
| if(columns.size()<=1) | |
| throw Exception("parser.runtime", | |
| &method_name, | |
| "column count must be more than 1 to create a hash"); | |
| } | |
| void add_row() { | |
| column_index=0; | |
| } | |
| void add_row_cell(void *ptr, size_t size) { | |
| String *cell=new(pool) String(pool); | |
| if(size) | |
| cell->APPEND_TAINTED( | |
| (const char *)ptr, size, | |
| statement_cstr, row_index++); | |
| if(column_index==0) { | |
| VHash *row_vhash=new(pool) VHash(pool); | |
| row_hash=row_vhash->get_hash(0); | |
| if(rows_hash.put_dont_replace(*cell, row_vhash)) // put. existed? | |
| if(!distinct) | |
| throw Exception("parser.runtime", | |
| cell, | |
| "duplicate key"); | |
| } else | |
| row_hash->put(*columns.get_string(column_index), new(pool) VString(*cell)); | |
| column_index++; | |
| } | |
| VHash& vhash=*static_cast<VHash *>(r.self); | private: |
| if(params->size()) | Pool& pool; |
| vhash.set_default(params->get(0)); // info: may be code.. | const String& method_name; |
| else { | const String& statement_string; const char *statement_cstr; |
| Value *default_value=vhash.get_default(); | bool distinct; |
| r.write_assign_lang(default_value?*default_value:*new(pool) VVoid(pool)); | Hash& rows_hash; |
| Hash *row_hash; | |
| int column_index; | |
| Array columns; | |
| int row_index; | |
| }; | |
| #endif | |
| static void copy_all_overwrite_to(const Hash::Key& key, Hash::Val *value, void *info) { | |
| Hash& dest=*static_cast<Hash *>(info); | |
| dest.put(key, value); | |
| } | |
| static void _create_or_add(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| if(params->size()) { | |
| Value& vb=params->as_no_junction(0, "param must be hash"); | |
| if(Hash *b=vb.get_hash(&method_name)) | |
| b->for_each(copy_all_overwrite_to, &static_cast<VHash *>(r.get_self())->hash(&method_name)); | |
| } | } |
| } | } |
| static void _sql(Request& r, const String& method_name, MethodParams *params) { | static void remove_key_from(const Hash::Key& key, Hash::Val *value, void *info) { |
| Hash& dest=*static_cast<Hash *>(info); | |
| dest.remove(key); | |
| } | |
| static void _sub(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | Pool& pool=r.pool(); |
| Value& vb=params->as_no_junction(0, "param must be hash"); | |
| if(Hash *b=vb.get_hash(&method_name)) | |
| b->for_each(remove_key_from, &static_cast<VHash *>(r.get_self())->hash(&method_name)); | |
| } | |
| if(!r.connection) | static void copy_all_dontoverwrite_to(const Hash::Key& key, Hash::Val *value, void *info) { |
| PTHROW(0, 0, | Hash& dest=*static_cast<Hash *>(info); |
| &method_name, | dest.put_dont_replace(key, value); |
| "without connect"); | } |
| static void _union(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| Value& statement=params->get_junction(0, "statement must be code"); | // dest = copy of self |
| Hash& dest=*new(pool) Hash(static_cast<VHash *>(r.get_self())->hash(&method_name)); | |
| // dest += b | |
| Value& vb=params->as_no_junction(0, "param must be hash"); | |
| if(Hash *b=vb.get_hash(&method_name)) | |
| b->for_each(copy_all_dontoverwrite_to, &dest); | |
| // return result | |
| Value& result=*new(pool) VHash(pool, dest); | |
| r.write_no_lang(result); | |
| } | |
| ulong limit=0; | #ifndef DOXYGEN |
| if(params->size()>1) { | struct Copy_intersection_to_info { |
| Value& limit_code=params->get_junction(1, "limit must be expression"); | Hash *b; |
| limit=(uint)r.process(limit_code).as_double(); | Hash *dest; |
| }; | |
| #endif | |
| static void copy_intersection_to(const Hash::Key& key, Hash::Val *value, void *info) { | |
| Copy_intersection_to_info& i=*static_cast<Copy_intersection_to_info *>(info); | |
| if(i.b->get(key)) | |
| i.dest->put_dont_replace(key, value); | |
| } | |
| static void _intersection(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| // dest = copy of self | |
| Hash& dest=*new(pool) Hash(pool); | |
| // dest += b | |
| Value& vb=params->as_no_junction(0, "param must be hash"); | |
| if(Hash *b=vb.get_hash(&method_name)) { | |
| Copy_intersection_to_info info={ | |
| b, | |
| &dest | |
| }; | |
| static_cast<VHash *>(r.get_self())->hash(&method_name).for_each(copy_intersection_to, &info); | |
| } | } |
| // return result | |
| r.write_no_lang(*new(pool) VHash(pool, dest)); | |
| } | |
| static void *intersects(const Hash::Key& key, Hash::Val *value, void *info) { | |
| return static_cast<Hash *>(info)->get(key); | |
| } | |
| static void _intersects(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| bool yes=false; | |
| // dest = copy of self | |
| Hash& dest=*new(pool) Hash(pool); | |
| // dest += b | |
| Value& vb=params->as_no_junction(0, "param must be hash"); | |
| if(Hash *b=vb.get_hash(&method_name)) | |
| yes=static_cast<VHash *>(r.get_self())->hash(&method_name).first_that(intersects, b)!=0; | |
| // return result | |
| r.write_no_lang(*new(pool) VBool(pool, yes)); | |
| } | |
| static void _sql(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| Value& statement=params->as_junction(0, "statement must be code"); | |
| ulong limit=0; | |
| ulong offset=0; | ulong offset=0; |
| if(params->size()>2) { | bool distinct=false; |
| Value& offset_code=params->get_junction(2, "offset must be expression"); | if(params->size()>1) { |
| offset=(ulong)r.process(offset_code).as_double(); | Value& voptions=params->as_no_junction(1, "options must be hash, not code"); |
| if(!voptions.is_string()) | |
| if(Hash *options=voptions.get_hash(&method_name)) { | |
| int valid_options=0; | |
| if(Value *vlimit=(Value *)options->get(*sql_limit_name)) { | |
| valid_options++; | |
| limit=(ulong)r.process_to_value(*vlimit).as_double(); | |
| } | |
| if(Value *voffset=(Value *)options->get(*sql_offset_name)) { | |
| valid_options++; | |
| offset=(ulong)r.process_to_value(*voffset).as_double(); | |
| } | |
| if(Value *vdistinct=(Value *)options->get(*sql_distinct_name)) { | |
| valid_options++; | |
| distinct=r.process_to_value(*vdistinct).as_bool(); | |
| } | |
| if(valid_options!=options->size()) | |
| throw Exception("parser.runtime", | |
| &method_name, | |
| "called with invalid option"); | |
| } else | |
| throw Exception("parser.runtime", | |
| &method_name, | |
| "options must be hash"); | |
| } | } |
| Temp_lang temp_lang(r, String::UL_SQL); | Temp_lang temp_lang(r, String::UL_SQL); |
| const String& statement_string=r.process(statement).as_string(); | const String& statement_string=r.process_to_string(statement); |
| const char *statement_cstr= | const char *statement_cstr= |
| statement_string.cstr(String::UL_UNSPECIFIED, r.connection); | statement_string.cstr(String::UL_UNSPECIFIED, r.connection(&method_name)); |
| unsigned int sql_column_count; SQL_Driver::Cell *sql_columns; | Hash& hash=static_cast<VHash *>(r.get_self())->hash(&method_name); |
| unsigned long sql_row_count; SQL_Driver::Cell **sql_rows; | hash.clear(); |
| bool need_rethrow=false; Exception rethrow_me; | Hash_sql_event_handlers handlers(pool, method_name, |
| PTRY { | statement_string, statement_cstr, |
| r.connection->query( | distinct, |
| statement_cstr, offset, limit, | hash); |
| &sql_column_count, &sql_columns, | |
| &sql_row_count, &sql_rows); | r.connection(&method_name)->query( |
| } | statement_cstr, offset, limit, |
| PCATCH(e) { // query problem | handlers, |
| rethrow_me=e; need_rethrow=true; | statement_string); |
| } | } |
| PEND_CATCH | |
| if(need_rethrow) | |
| PTHROW(rethrow_me.type(), rethrow_me.code(), | |
| &statement_string, // setting more specific source [were url] | |
| rethrow_me.comment()); | |
| Hash& rows_hash=static_cast<VHash *>(r.self)->hash(); | |
| rows_hash.clear(); | |
| if(sql_column_count<=1) | static void keys_collector(const Hash::Key& key, Hash::Val *value, void *info) { |
| return; | Table& table=*static_cast<Table *>(info); |
| Pool& pool=table.pool(); | |
| Array& row=*new(pool) Array(pool); | |
| row+=&key; | |
| table+=&row; | |
| } | |
| static void _keys(Request& r, const String& method_name, MethodParams *) { | |
| Pool& pool=r.pool(); | |
| Array& columns=*new(pool) Array(pool); | Array& columns=*new(pool) Array(pool); |
| for(unsigned int i=0+1; i<sql_column_count; i++) { | columns+=new(pool) String(pool, "key"); |
| String& column=*new(pool) String(pool); | Table& table=*new(pool) Table(pool, &method_name, &columns); |
| column.APPEND_TAINTED( | |
| (const char *)sql_columns[i].ptr, sql_columns[i].size, | static_cast<VHash *>(r.get_self())->hash(&method_name).for_each(keys_collector, &table); |
| statement_cstr, 0); | |
| columns+=&column; | r.write_no_lang(*new(pool) VTable(pool, &table)); |
| } | } |
| for(unsigned long row=0; row<sql_row_count; row++) { | static void _count(Request& r, const String& method_name, MethodParams *) { |
| SQL_Driver::Cell *sql_cells=sql_rows[row]; | Pool& pool=r.pool(); |
| VHash& row_vhash=*new(pool) VHash(pool); | r.write_no_lang( |
| Hash& row_hash=*row_vhash.get_hash(); | *new(pool) VInt(pool, static_cast<VHash *>(r.get_self())->hash(&method_name).size())); |
| String *key=0; // calm, compiler | } |
| String *cell; | |
| for(unsigned int i=0; i<sql_column_count; i++) { | static void _delete(Request& r, const String& method_name, MethodParams *params) { |
| cell=new(pool) String(pool); | Pool& pool=r.pool(); |
| cell->APPEND_TAINTED( | |
| (const char *)sql_cells[i].ptr, sql_cells[i].size, | static_cast<VHash *>(r.get_self())->hash(&method_name).remove(params->as_string(0, "key must be string")); |
| statement_cstr, row); | } |
| if(i==0) | |
| key=cell; | #ifndef DOXYGEN |
| else | struct Foreach_info { |
| row_hash.put(*columns.get_string(i-1), new(pool) VString(*cell)); | Request *r; |
| } | const String* key_var_name; |
| rows_hash.put(*key, &row_vhash); | const String* value_var_name; |
| Value *body_code; | |
| Value *delim_maybe_code; | |
| VString *vkey; | |
| bool need_delim; | |
| }; | |
| #endif | |
| static void one_foreach_cycle(const Hash::Key& akey, Hash::Val *avalue, | |
| void *info) { | |
| Foreach_info& i=*static_cast<Foreach_info *>(info); | |
| i.vkey->set_string(akey); | |
| i.r->get_method_frame()->put_element(*i.key_var_name, i.vkey, false); | |
| i.r->get_method_frame()->put_element(*i.value_var_name, static_cast<Value *>(avalue), false); | |
| StringOrValue sv_processed=i.r->process(*i.body_code); | |
| const String *s_processed=sv_processed.get_string(); | |
| if(i.delim_maybe_code && s_processed && s_processed->size()) { // delimiter set and we have body | |
| if(i.need_delim) // need delim & iteration produced string? | |
| i.r->write_pass_lang(i.r->process(*i.delim_maybe_code)); | |
| i.need_delim=true; | |
| } | } |
| i.r->write_pass_lang(sv_processed); | |
| } | |
| static void _foreach(Request& r, const String& method_name, MethodParams *params) { | |
| Pool& pool=r.pool(); | |
| const String& key_var_name=params->as_string(0, "key-var name must be string"); | |
| const String& value_var_name=params->as_string(1, "value-var name must be string"); | |
| Value& body_code=params->as_junction(2, "body must be code"); | |
| Value *delim_maybe_code=params->size()>3?¶ms->get(3):0; | |
| Foreach_info info={ | |
| &r, | |
| &key_var_name, &value_var_name, | |
| &body_code, | |
| delim_maybe_code, | |
| new(pool) VString(pool), | |
| false | |
| }; | |
| VHash& self=*static_cast<VHash *>(r.get_self()); | |
| Hash& hash=self.hash(&method_name); | |
| VHash_lock lock(self); | |
| hash.for_each(one_foreach_cycle, &info); | |
| } | } |
| // constructor | // constructor |
| MHash::MHash(Pool& apool) : Methoded(apool) { | MHash::MHash(Pool& apool) : Methoded(apool, "hash") |
| set_name(*NEW String(pool(), HASH_CLASS_NAME)); | { |
| // ^hash::create[[copy_from]] | |
| add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1); | |
| // ^hash.add[add_from] | |
| add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1); | |
| // ^hash.sub[sub_from] | |
| add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1); | |
| // ^a.union[b] = hash | |
| add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1); | |
| // ^a.intersection[b] = hash | |
| add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 1); | |
| // ^a.intersects[b] = bool | |
| add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1); | |
| // ^a.delete[key] | |
| add_native_method("delete", Method::CT_DYNAMIC, _delete, 1, 1); | |
| // ^hash:sql[query][$.limit(1) $.offset(2)] | |
| add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2); | |
| // ^hash.default[] | // ^hash._keys[] |
| // ^hash.default[hash] | add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 0); |
| add_native_method("default", Method::CT_DYNAMIC, _default, 0, 1); | |
| // ^hash:sql[query][(count[;offset])] | // ^hash._count[] |
| add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 3); | add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0); |
| // ^hash.foreach[key;value]{code}[delim] | |
| add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1); | |
| } | } |
| // global variable | // global variable |
| Methoded *hash_base_class; | Methoded *hash_class; |
| // creator | // creator |
| Methoded *MHash_create(Pool& pool) { | Methoded *MHash_create(Pool& pool) { |
| return hash_base_class=new(pool) MHash(pool); | return hash_class=new(pool) MHash(pool); |
| } | } |