Manager.hx 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638
  1. /*
  2. * Copyright (C)2005-2012 Haxe Foundation
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  20. * DEALINGS IN THE SOFTWARE.
  21. */
  22. package sys.db;
  23. import Reflect;
  24. import sys.db.Connection;
  25. /**
  26. Record Manager : the persistent object database manager. See the tutorial on
  27. Haxe website to learn how to use Record.
  28. **/
  29. #if !macro @:build(sys.db.RecordMacros.addRtti()) #end
  30. class Manager<T : Object> {
  31. /* ----------------------------- STATICS ------------------------------ */
  32. public static var cnx(default, set) : Connection;
  33. public static var lockMode : String;
  34. private static inline var cache_field = "__cache__";
  35. private static var object_cache : haxe.ds.StringMap<Object> = new haxe.ds.StringMap();
  36. private static var init_list : List<Manager<Dynamic>> = new List();
  37. private static var KEYWORDS = {
  38. var h = new haxe.ds.StringMap();
  39. for( k in "ADD|ALL|ALTER|ANALYZE|AND|AS|ASC|ASENSITIVE|BEFORE|BETWEEN|BIGINT|BINARY|BLOB|BOTH|BY|CALL|CASCADE|CASE|CHANGE|CHAR|CHARACTER|CHECK|COLLATE|COLUMN|CONDITION|CONSTRAINT|CONTINUE|CONVERT|CREATE|CROSS|CURRENT_DATE|CURRENT_TIME|CURRENT_TIMESTAMP|CURRENT_USER|CURSOR|DATABASE|DATABASES|DAY_HOUR|DAY_MICROSECOND|DAY_MINUTE|DAY_SECOND|DEC|DECIMAL|DECLARE|DEFAULT|DELAYED|DELETE|DESC|DESCRIBE|DETERMINISTIC|DISTINCT|DISTINCTROW|DIV|DOUBLE|DROP|DUAL|EACH|ELSE|ELSEIF|ENCLOSED|ESCAPED|EXISTS|EXIT|EXPLAIN|FALSE|FETCH|FLOAT|FLOAT4|FLOAT8|FOR|FORCE|FOREIGN|FROM|FULLTEXT|GRANT|GROUP|HAVING|HIGH_PRIORITY|HOUR_MICROSECOND|HOUR_MINUTE|HOUR_SECOND|IF|IGNORE|IN|INDEX|INFILE|INNER|INOUT|INSENSITIVE|INSERT|INT|INT1|INT2|INT3|INT4|INT8|INTEGER|INTERVAL|INTO|IS|ITERATE|JOIN|KEY|KEYS|KILL|LEADING|LEAVE|LEFT|LIKE|LIMIT|LINES|LOAD|LOCALTIME|LOCALTIMESTAMP|LOCK|LONG|LONGBLOB|LONGTEXT|LOOP|LOW_PRIORITY|MATCH|MEDIUMBLOB|MEDIUMINT|MEDIUMTEXT|MIDDLEINT|MINUTE_MICROSECOND|MINUTE_SECOND|MOD|MODIFIES|NATURAL|NOT|NO_WRITE_TO_BINLOG|NULL|NUMERIC|ON|OPTIMIZE|OPTION|OPTIONALLY|OR|ORDER|OUT|OUTER|OUTFILE|PRECISION|PRIMARY|PROCEDURE|PURGE|READ|READS|REAL|REFERENCES|REGEXP|RELEASE|RENAME|REPEAT|REPLACE|REQUIRE|RESTRICT|RETURN|REVOKE|RIGHT|RLIKE|SCHEMA|SCHEMAS|SECOND_MICROSECOND|SELECT|SENSITIVE|SEPARATOR|SET|SHOW|SMALLINT|SONAME|SPATIAL|SPECIFIC|SQL|SQLEXCEPTION|SQLSTATE|SQLWARNING|SQL_BIG_RESULT|SQL_CALC_FOUND_ROWS|SQL_SMALL_RESULT|SSL|STARTING|STRAIGHT_JOIN|TABLE|TERMINATED|THEN|TINYBLOB|TINYINT|TINYTEXT|TO|TRAILING|TRIGGER|TRUE|UNDO|UNION|UNIQUE|UNLOCK|UNSIGNED|UPDATE|USAGE|USE|USING|UTC_DATE|UTC_TIME|UTC_TIMESTAMP|VALUES|VARBINARY|VARCHAR|VARCHARACTER|VARYING|WHEN|WHERE|WHILE|WITH|WRITE|XOR|YEAR_MONTH|ZEROFILL|ASENSITIVE|CALL|CONDITION|CONNECTION|CONTINUE|CURSOR|DECLARE|DETERMINISTIC|EACH|ELSEIF|EXIT|FETCH|GOTO|INOUT|INSENSITIVE|ITERATE|LABEL|LEAVE|LOOP|MODIFIES|OUT|READS|RELEASE|REPEAT|RETURN|SCHEMA|SCHEMAS|SENSITIVE|SPECIFIC|SQL|SQLEXCEPTION|SQLSTATE|SQLWARNING|TRIGGER|UNDO|UPGRADE|WHILE".split("|") )
  40. h.set(k.toLowerCase(),true);
  41. h;
  42. }
  43. private static function set_cnx( c : Connection ) {
  44. cnx = c;
  45. lockMode = (c != null && c.dbName() == "MySQL") ? " FOR UPDATE" : "";
  46. return c;
  47. }
  48. /* ---------------------------- BASIC API ----------------------------- */
  49. var table_infos : RecordInfos;
  50. var table_name : String;
  51. var table_keys : Array<String>;
  52. var class_proto : { prototype : Dynamic };
  53. public function new( classval : Class<T> ) {
  54. var m : Array<Dynamic> = haxe.rtti.Meta.getType(classval).rtti;
  55. if( m == null ) throw "Missing @rtti for class " + Type.getClassName(classval);
  56. table_infos = haxe.Unserializer.run(m[0]);
  57. table_name = quoteField(table_infos.name);
  58. table_keys = table_infos.key;
  59. // set the manager and ready for further init
  60. class_proto = cast classval;
  61. #if neko
  62. class_proto.prototype._manager = this;
  63. init_list.add(this);
  64. #end
  65. }
  66. public function all( ?lock: Bool ) : List<T> {
  67. return unsafeObjects("SELECT * FROM " + table_name,lock);
  68. }
  69. public macro function get(ethis,id,?lock:haxe.macro.Expr.ExprOf<Bool>) : #if macro haxe.macro.Expr #else haxe.macro.Expr.ExprOf<T> #end {
  70. return RecordMacros.macroGet(ethis,id,lock);
  71. }
  72. public macro function select(ethis, cond, ?options, ?lock:haxe.macro.Expr.ExprOf<Bool>) : #if macro haxe.macro.Expr #else haxe.macro.Expr.ExprOf<T> #end {
  73. return RecordMacros.macroSearch(ethis, cond, options, lock, true);
  74. }
  75. public macro function search(ethis, cond, ?options, ?lock:haxe.macro.Expr.ExprOf<Bool>) : #if macro haxe.macro.Expr #else haxe.macro.Expr.ExprOf<List<T>> #end {
  76. return RecordMacros.macroSearch(ethis, cond, options, lock);
  77. }
  78. public macro function count(ethis, cond) : #if macro haxe.macro.Expr #else haxe.macro.Expr.ExprOf<Int> #end {
  79. return RecordMacros.macroCount(ethis, cond);
  80. }
  81. public macro function delete(ethis, cond, ?options) : #if macro haxe.macro.Expr #else haxe.macro.Expr.ExprOf<Void> #end {
  82. return RecordMacros.macroDelete(ethis, cond, options);
  83. }
  84. public function dynamicSearch( x : {}, ?lock : Bool ) : List<T> {
  85. var s = new StringBuf();
  86. s.add("SELECT * FROM ");
  87. s.add(table_name);
  88. s.add(" WHERE ");
  89. addCondition(s,x);
  90. return unsafeObjects(s.toString(),lock);
  91. }
  92. function quote( s : String ) : String {
  93. return getCnx().quote( s );
  94. }
  95. /* -------------------------- RECORDOBJECT API -------------------------- */
  96. function doUpdateCache( x : T, name : String, v : Dynamic ) {
  97. var cache : { v : Dynamic } = Reflect.field(x, "cache_" + name);
  98. // if the cache has not been fetched (for instance if the field was set by reflection)
  99. // then we directly use the new value
  100. if( cache == null )
  101. return v;
  102. var v = doSerialize(name, cache.v);
  103. // don't set it since the value might change again later
  104. // Reflect.setField(x, name, v);
  105. return v;
  106. }
  107. function doInsert( x : T ) {
  108. unmake(x);
  109. var s = new StringBuf();
  110. var fields = new List();
  111. var values = new List();
  112. for( f in table_infos.fields ) {
  113. var name = f.name;
  114. var v = Reflect.field(x,name);
  115. if( v != null ) {
  116. fields.add(quoteField(name));
  117. switch( f.t ) {
  118. case DData: v = doUpdateCache(x, name, v);
  119. default:
  120. }
  121. values.add(v);
  122. } else if( !f.isNull ) {
  123. // if the field is not defined, give it a default value on insert
  124. switch( f.t ) {
  125. case DUInt, DTinyInt, DInt, DSingle, DFloat, DFlags(_), DBigInt, DTinyUInt, DSmallInt, DSmallUInt, DMediumInt, DMediumUInt, DEnum(_):
  126. Reflect.setField(x, name, 0);
  127. case DBool:
  128. Reflect.setField(x, name, false);
  129. case DTinyText, DText, DString(_), DSmallText, DSerialized:
  130. Reflect.setField(x, name, "");
  131. case DSmallBinary, DNekoSerialized, DLongBinary, DBytes(_), DBinary:
  132. Reflect.setField(x, name, haxe.io.Bytes.alloc(0));
  133. case DDate, DDateTime, DTimeStamp:
  134. // default date might depend on database
  135. case DId, DUId, DBigId, DNull, DInterval, DEncoded, DData:
  136. // no default value for these
  137. }
  138. }
  139. }
  140. s.add("INSERT INTO ");
  141. s.add(table_name);
  142. s.add(" (");
  143. s.add(fields.join(","));
  144. s.add(") VALUES (");
  145. var first = true;
  146. for( v in values ) {
  147. if( first )
  148. first = false;
  149. else
  150. s.add(", ");
  151. getCnx().addValue(s,v);
  152. }
  153. s.add(")");
  154. unsafeExecute(s.toString());
  155. untyped x._lock = true;
  156. // table with one key not defined : suppose autoincrement
  157. if( table_keys.length == 1 && Reflect.field(x,table_keys[0]) == null )
  158. Reflect.setField(x,table_keys[0],getCnx().lastInsertId());
  159. addToCache(x);
  160. }
  161. inline function isBinary( t : RecordInfos.RecordType ) {
  162. return switch( t ) {
  163. case DSmallBinary, DNekoSerialized, DLongBinary, DBytes(_), DBinary: true;
  164. //case DData: true // -- disabled for implementation purposes
  165. default: false;
  166. };
  167. }
  168. inline function hasBinaryChanged( a : haxe.io.Bytes, b : haxe.io.Bytes ) {
  169. return a != b && (a == null || b == null || a.compare(b) != 0);
  170. }
  171. function doUpdate( x : T ) {
  172. if( untyped !x._lock )
  173. throw "Cannot update a not locked object";
  174. unmake(x);
  175. var s = new StringBuf();
  176. s.add("UPDATE ");
  177. s.add(table_name);
  178. s.add(" SET ");
  179. var cache = Reflect.field(x,cache_field);
  180. var mod = false;
  181. for( f in table_infos.fields ) {
  182. var name = f.name;
  183. var v : Dynamic = Reflect.field(x,name);
  184. var vc : Dynamic = Reflect.field(cache,name);
  185. if( v != vc && (!isBinary(f.t) || hasBinaryChanged(v,vc)) ) {
  186. switch( f.t ) {
  187. case DData:
  188. v = doUpdateCache(x, name, v);
  189. if( !hasBinaryChanged(v,vc) )
  190. continue;
  191. default:
  192. }
  193. if( mod )
  194. s.add(", ");
  195. else
  196. mod = true;
  197. s.add(quoteField(name));
  198. s.add(" = ");
  199. getCnx().addValue(s,v);
  200. Reflect.setField(cache,name,v);
  201. }
  202. }
  203. if( !mod )
  204. return;
  205. s.add(" WHERE ");
  206. addKeys(s,x);
  207. unsafeExecute(s.toString());
  208. }
  209. function doDelete( x : T ) {
  210. var s = new StringBuf();
  211. s.add("DELETE FROM ");
  212. s.add(table_name);
  213. s.add(" WHERE ");
  214. addKeys(s,x);
  215. unsafeExecute(s.toString());
  216. removeFromCache(x);
  217. }
  218. function doLock( i : T ) {
  219. if( untyped i._lock )
  220. return;
  221. var s = new StringBuf();
  222. s.add("SELECT * FROM ");
  223. s.add(table_name);
  224. s.add(" WHERE ");
  225. addKeys(s, i);
  226. // will force sync
  227. if( unsafeObject(s.toString(),true) != i )
  228. throw "Could not lock object (was deleted ?); try restarting transaction";
  229. }
  230. function objectToString( it : T ) : String {
  231. var s = new StringBuf();
  232. s.add(table_name);
  233. if( table_keys.length == 1 ) {
  234. s.add("#");
  235. s.add(Reflect.field(it,table_keys[0]));
  236. } else {
  237. s.add("(");
  238. var first = true;
  239. for( f in table_keys ) {
  240. if( first )
  241. first = false;
  242. else
  243. s.add(",");
  244. s.add(quoteField(f));
  245. s.add(":");
  246. s.add(Reflect.field(it,f));
  247. }
  248. s.add(")");
  249. }
  250. return s.toString();
  251. }
  252. function doSerialize( field : String, v : Dynamic ) : haxe.io.Bytes {
  253. var s = new haxe.Serializer();
  254. s.useEnumIndex = true;
  255. s.serialize(v);
  256. var str = s.toString();
  257. #if neko
  258. return neko.Lib.bytesReference(str);
  259. #else
  260. return haxe.io.Bytes.ofString(str);
  261. #end
  262. }
  263. function doUnserialize( field : String, b : haxe.io.Bytes ) : Dynamic {
  264. if( b == null )
  265. return null;
  266. var str;
  267. #if neko
  268. str = neko.Lib.stringReference(b);
  269. #else
  270. str = b.toString();
  271. #end
  272. if( str == "" )
  273. return null;
  274. return haxe.Unserializer.run(str);
  275. }
  276. /* ---------------------------- INTERNAL API -------------------------- */
  277. function cacheObject( x : T, lock : Bool ) {
  278. #if neko
  279. var o = untyped __dollar__new(x);
  280. untyped __dollar__objsetproto(o, class_proto.prototype);
  281. #else
  282. var o : T = Type.createEmptyInstance(cast class_proto);
  283. for( f in Reflect.fields(x) )
  284. Reflect.setField(o, f, Reflect.field(x, f));
  285. untyped o._manager = this;
  286. #end
  287. Reflect.setField(o,cache_field,x);
  288. addToCache(o);
  289. untyped o._lock = lock;
  290. return o;
  291. }
  292. function make( x : T ) {
  293. }
  294. function unmake( x : T ) {
  295. }
  296. function quoteField(f : String) {
  297. return KEYWORDS.exists(f.toLowerCase()) ? "`"+f+"`" : f;
  298. }
  299. function addKeys( s : StringBuf, x : {} ) {
  300. var first = true;
  301. for( k in table_keys ) {
  302. if( first )
  303. first = false;
  304. else
  305. s.add(" AND ");
  306. s.add(quoteField(k));
  307. s.add(" = ");
  308. var f = Reflect.field(x,k);
  309. if( f == null )
  310. throw ("Missing key "+k);
  311. getCnx().addValue(s,f);
  312. }
  313. }
  314. function unsafeExecute( sql : String ) {
  315. return getCnx().request(sql);
  316. }
  317. public function unsafeObject( sql : String, lock : Bool ) : T {
  318. if( lock != false ) {
  319. lock = true;
  320. sql += getLockMode();
  321. }
  322. var r = unsafeExecute(sql).next();
  323. if( r == null )
  324. return null;
  325. var c = getFromCache(r,lock);
  326. if( c != null )
  327. return c;
  328. r = cacheObject(r,lock);
  329. make(r);
  330. return r;
  331. }
  332. public function unsafeObjects( sql : String, lock : Bool ) : List<T> {
  333. if( lock != false ) {
  334. lock = true;
  335. sql += getLockMode();
  336. }
  337. var l = unsafeExecute(sql).results();
  338. var l2 = new List<T>();
  339. for( x in l ) {
  340. var c = getFromCache(x,lock);
  341. if( c != null )
  342. l2.add(c);
  343. else {
  344. x = cacheObject(x,lock);
  345. make(x);
  346. l2.add(x);
  347. }
  348. }
  349. return l2;
  350. }
  351. public function unsafeCount( sql : String ) {
  352. return unsafeExecute(sql).getIntResult(0);
  353. }
  354. public function unsafeDelete( sql : String ) {
  355. unsafeExecute(sql);
  356. }
  357. public function unsafeGet( id : Dynamic, ?lock : Bool ) : T {
  358. if( lock == null ) lock = true;
  359. if( table_keys.length != 1 )
  360. throw "Invalid number of keys";
  361. if( id == null )
  362. return null;
  363. var x : Dynamic = getFromCacheKey(Std.string(id) + table_name);
  364. if( x != null && (!lock || x._lock) )
  365. return x;
  366. var s = new StringBuf();
  367. s.add("SELECT * FROM ");
  368. s.add(table_name);
  369. s.add(" WHERE ");
  370. s.add(quoteField(table_keys[0]));
  371. s.add(" = ");
  372. getCnx().addValue(s,id);
  373. return unsafeObject(s.toString(), lock);
  374. }
  375. public function unsafeGetWithKeys( keys : { }, ?lock : Bool ) : T {
  376. if( lock == null ) lock = true;
  377. var x : Dynamic = getFromCacheKey(makeCacheKey(cast keys));
  378. if( x != null && (!lock || x._lock) )
  379. return x;
  380. var s = new StringBuf();
  381. s.add("SELECT * FROM ");
  382. s.add(table_name);
  383. s.add(" WHERE ");
  384. addKeys(s,keys);
  385. return unsafeObject(s.toString(),lock);
  386. }
  387. public function unsafeGetId( o : T ) : Dynamic {
  388. return o == null ? null : Reflect.field(o, table_keys[0]);
  389. }
  390. public static function nullCompare( a : String, b : String, eq : Bool ) {
  391. // we can't use a null-safe operator here
  392. if( cnx.dbName() != "MySQL" )
  393. return a + (eq ? " = " : " != ") + b;
  394. var sql = a+" <=> "+b;
  395. if( !eq ) sql = "NOT("+sql+")";
  396. return sql;
  397. }
  398. function addCondition(s : StringBuf,x) {
  399. var first = true;
  400. if( x != null )
  401. for( f in Reflect.fields(x) ) {
  402. if( first )
  403. first = false;
  404. else
  405. s.add(" AND ");
  406. s.add(quoteField(f));
  407. var d = Reflect.field(x,f);
  408. if( d == null )
  409. s.add(" IS NULL");
  410. else {
  411. s.add(" = ");
  412. getCnx().addValue(s,d);
  413. }
  414. }
  415. if( first )
  416. s.add("1");
  417. }
  418. /* --------------------------- MISC API ------------------------------ */
  419. public function dbClass() : Class<Dynamic> {
  420. return cast class_proto;
  421. }
  422. public function dbInfos() {
  423. return table_infos;
  424. }
  425. function getCnx() {
  426. return cnx;
  427. }
  428. function getLockMode() {
  429. return lockMode;
  430. }
  431. /**
  432. Remove the cached value for the given Object field : this will ensure
  433. that the value is updated when calling .update(). This is necessary if
  434. you are modifying binary data in-place since the cache will be modified
  435. as well.
  436. **/
  437. public function forceUpdate( o : T, field : String ) {
  438. // set a reference that will ensure != and .compare() != 0
  439. Reflect.setField(Reflect.field(o,cache_field),field,null);
  440. }
  441. /* --------------------------- INIT / CLEANUP ------------------------- */
  442. public static function initialize() {
  443. var l = init_list;
  444. init_list = new List();
  445. for( m in l )
  446. for( r in m.table_infos.relations )
  447. m.initRelation(r);
  448. }
  449. public static function cleanup() {
  450. object_cache = new haxe.ds.StringMap();
  451. }
  452. function initRelation( r : RecordInfos.RecordRelation ) {
  453. // setup getter/setter
  454. var spod : Dynamic = Type.resolveClass(r.type);
  455. if( spod == null ) throw "Missing spod type " + r.type;
  456. var manager : Manager<Dynamic> = spod.manager;
  457. var hprop = "__"+r.prop;
  458. var hkey = r.key;
  459. var lock = r.lock;
  460. if( manager == null || manager.table_keys == null ) throw ("Invalid manager for relation "+table_name+":"+r.prop);
  461. if( manager.table_keys.length != 1 ) throw ("Relation " + r.prop + "(" + r.key + ") on a multiple key table");
  462. Reflect.setField(class_proto.prototype,"get_"+r.prop,function() {
  463. var othis = untyped __this__;
  464. var f = Reflect.field(othis,hprop);
  465. if( f != null )
  466. return f;
  467. var id = Reflect.field(othis, hkey);
  468. if( id == null )
  469. return null;
  470. f = manager.unsafeGet(id,lock);
  471. // it's highly possible that in that case the object has been inserted
  472. // after we started our transaction : in that case, let's lock it, since
  473. // it's still better than returning 'null' while it exists
  474. if( f == null && id != null && !lock )
  475. f = manager.unsafeGet(id,true);
  476. Reflect.setField(othis,hprop,f);
  477. return f;
  478. });
  479. Reflect.setField(class_proto.prototype,"set_"+r.prop,function(f) {
  480. var othis = untyped __this__;
  481. Reflect.setField(othis,hprop,f);
  482. Reflect.setField(othis,hkey,Reflect.field(f,manager.table_keys[0]));
  483. return f;
  484. });
  485. }
  486. #if !neko
  487. function __get( x : Dynamic, prop : String, key : String, lock ) {
  488. var v = Reflect.field(x,prop);
  489. if( v != null )
  490. return v.value;
  491. var y = unsafeGet(Reflect.field(x, key), lock);
  492. Reflect.setField(x,prop,{ value : y });
  493. return y;
  494. }
  495. function __set( x : Dynamic, prop : String, key : String, v : T ) {
  496. Reflect.setField(x,prop,{ value : v });
  497. if( v == null )
  498. Reflect.setField(x,key,null);
  499. else
  500. Reflect.setField(x,key,Reflect.field(v,table_keys[0]));
  501. }
  502. #end
  503. /* ---------------------------- OBJECT CACHE -------------------------- */
  504. function makeCacheKey( x : T ) : String {
  505. if( table_keys.length == 1 ) {
  506. var k = Reflect.field(x,table_keys[0]);
  507. if( k == null )
  508. throw("Missing key "+table_keys[0]);
  509. return Std.string(k)+table_name;
  510. }
  511. var s = new StringBuf();
  512. for( k in table_keys ) {
  513. var v = Reflect.field(x,k);
  514. if( k == null )
  515. throw("Missing key "+k);
  516. s.add(v);
  517. s.add("#");
  518. }
  519. s.add(table_name);
  520. return s.toString();
  521. }
  522. function addToCache( x : T ) {
  523. object_cache.set(makeCacheKey(x),x);
  524. }
  525. function removeFromCache( x : T ) {
  526. object_cache.remove(makeCacheKey(x));
  527. }
  528. function getFromCacheKey( key : String ) : T {
  529. return cast object_cache.get(key);
  530. }
  531. function getFromCache( x : T, lock : Bool ) : T {
  532. var c : Dynamic = object_cache.get(makeCacheKey(x));
  533. if( c != null && lock && !c._lock ) {
  534. // synchronize the fields since our result is up-to-date !
  535. for( f in Reflect.fields(c) )
  536. Reflect.deleteField(c,f);
  537. for( f in Reflect.fields(x) )
  538. Reflect.setField(c,f,Reflect.field(x,f));
  539. // mark as locked
  540. c._lock = true;
  541. // restore our manager
  542. #if !neko
  543. untyped c._manager = this;
  544. #end
  545. // use the new object as our cache of fields
  546. Reflect.setField(c,cache_field,x);
  547. // remake object
  548. make(c);
  549. }
  550. return c;
  551. }
  552. /* ---------------------------- QUOTES -------------------------- */
  553. public static function quoteAny( v : Dynamic ) {
  554. var s = new StringBuf();
  555. cnx.addValue(s, v);
  556. return s.toString();
  557. }
  558. public static function quoteList( v : String, it : Iterable<Dynamic> ) {
  559. var b = new StringBuf();
  560. var first = true;
  561. if( it != null )
  562. for( v in it ) {
  563. if( first ) first = false else b.addChar(','.code);
  564. cnx.addValue(b, v);
  565. }
  566. if( first )
  567. return "FALSE";
  568. return v + " IN (" + b.toString() + ")";
  569. }
  570. }