dbt_api.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  1. /*
  2. * $Id$
  3. *
  4. * DBText library
  5. *
  6. * Copyright (C) 2001-2003 FhG Fokus
  7. *
  8. * This file is part of ser, a free SIP server.
  9. *
  10. * ser is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU General Public License as published by
  12. * the Free Software Foundation; either version 2 of the License, or
  13. * (at your option) any later version
  14. *
  15. * For a license to use the ser software under conditions
  16. * other than those described here, or to purchase support for this
  17. * software, please contact iptel.org by e-mail at the following addresses:
  18. * [email protected]
  19. *
  20. * ser is distributed in the hope that it will be useful,
  21. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  22. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  23. * GNU General Public License for more details.
  24. *
  25. * You should have received a copy of the GNU General Public License
  26. * along with this program; if not, write to the Free Software
  27. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  28. */
  29. /**
  30. * DBText library
  31. *
  32. * 2003-02-05 created by Daniel
  33. *
  34. */
  35. #include <string.h>
  36. #include "../../str.h"
  37. #include "../../mem/mem.h"
  38. #include "dbt_res.h"
  39. #include "dbt_api.h"
  40. /*
  41. * Release memory used by columns
  42. */
  43. int dbt_free_columns(db_res_t* _r)
  44. {
  45. if (!_r)
  46. {
  47. #ifdef DBT_EXTRA_DEBUG
  48. LOG(L_ERR, "DBT:dbt_free_columns: Invalid parameter\n");
  49. #endif
  50. return -1;
  51. }
  52. if (RES_NAMES(_r))
  53. pkg_free(RES_NAMES(_r));
  54. if (RES_TYPES(_r))
  55. pkg_free(RES_TYPES(_r));
  56. return 0;
  57. }
  58. /*
  59. * Release memory used by row
  60. */
  61. int dbt_free_row(db_row_t* _r)
  62. {
  63. if (!_r)
  64. {
  65. #ifdef DBT_EXTRA_DEBUG
  66. LOG(L_ERR, "DBT:dbt_free_row: Invalid parameter value\n");
  67. #endif
  68. return -1;
  69. }
  70. if(ROW_VALUES(_r))
  71. pkg_free(ROW_VALUES(_r));
  72. return 0;
  73. }
  74. /*
  75. * Release memory used by rows
  76. */
  77. int dbt_free_rows(db_res_t* _r)
  78. {
  79. int i;
  80. if (!_r)
  81. {
  82. #ifdef DBT_EXTRA_DEBUG
  83. LOG(L_ERR, "DBT:dbt_free_rows: Invalid parameter value\n");
  84. #endif
  85. return -1;
  86. }
  87. if (RES_ROWS(_r))
  88. {
  89. for(i = 0; i < RES_ROW_N(_r); i++)
  90. {
  91. dbt_free_row(&(RES_ROWS(_r)[i]));
  92. }
  93. pkg_free(RES_ROWS(_r));
  94. }
  95. return 0;
  96. }
  97. /*
  98. * Release memory used by a result structure
  99. */
  100. int dbt_free_result(db_res_t* _r)
  101. {
  102. if (!_r)
  103. {
  104. #ifdef DBT_EXTRA_DEBUG
  105. LOG(L_ERR, "DBT:dbt_free_result: Invalid parameter\n");
  106. #endif
  107. return -1;
  108. }
  109. dbt_free_columns(_r);
  110. dbt_free_rows(_r);
  111. pkg_free(_r);
  112. return 0;
  113. }
  114. int dbt_use_table(db_con_t* _h, const char* _t)
  115. {
  116. if ((!_h) || (!_t))
  117. {
  118. #ifdef DBT_EXTRA_DEBUG
  119. LOG(L_ERR, "DBT:dbt_use_table: Invalid parameter value\n");
  120. #endif
  121. return -1;
  122. }
  123. CON_TABLE(_h) = _t;
  124. return 0;
  125. }
  126. /*
  127. * Create a new result structure and initialize it
  128. */
  129. db_res_t* dbt_new_result(void)
  130. {
  131. db_res_t* r;
  132. r = (db_res_t*)pkg_malloc(sizeof(db_res_t));
  133. if (!r) {
  134. LOG(L_ERR, "dbt_new_result(): No memory left\n");
  135. return 0;
  136. }
  137. RES_NAMES(r) = 0;
  138. RES_TYPES(r) = 0;
  139. RES_COL_N(r) = 0;
  140. RES_ROWS(r) = 0;
  141. RES_ROW_N(r) = 0;
  142. return r;
  143. }
  144. /*
  145. * Fill the structure with data from database
  146. */
  147. int dbt_convert_result(db_con_t* _h, db_res_t* _r)
  148. {
  149. if ((!_h) || (!_r)) {
  150. #ifdef DBT_EXTRA_DEBUG
  151. LOG(L_ERR, "DBT:dbt_convert_result: Invalid parameter\n");
  152. #endif
  153. return -1;
  154. }
  155. if (dbt_get_columns(_h, _r) < 0) {
  156. LOG(L_ERR,
  157. "DBT:dbt_convert_result: Error while getting column names\n");
  158. return -2;
  159. }
  160. if (dbt_convert_rows(_h, _r) < 0) {
  161. LOG(L_ERR, "DBT:dbt_convert_result: Error while converting rows\n");
  162. dbt_free_columns(_r);
  163. return -3;
  164. }
  165. return 0;
  166. }
  167. /*
  168. * Retrieve result set
  169. */
  170. int dbt_get_result(db_con_t* _h, db_res_t** _r)
  171. {
  172. if ((!_h) || (!_r))
  173. {
  174. #ifdef DBT_EXTRA_DEBUG
  175. LOG(L_ERR, "DBT:dbt_get_result: Invalid parameter value\n");
  176. #endif
  177. return -1;
  178. }
  179. if (!DBT_CON_RESULT(_h))
  180. {
  181. LOG(L_ERR, "DBT:dbt_get_result: error getting result\n");
  182. *_r = 0;
  183. return -3;
  184. }
  185. *_r = dbt_new_result();
  186. if (*_r == 0)
  187. {
  188. LOG(L_ERR, "DBT:dbt_get_result: No memory left\n");
  189. return -2;
  190. }
  191. if (dbt_convert_result(_h, *_r) < 0)
  192. {
  193. LOG(L_ERR, "DBT:dbt_get_result: Error while converting result\n");
  194. pkg_free(*_r);
  195. return -4;
  196. }
  197. return 0;
  198. }
  199. /*
  200. * Get and convert columns from a result
  201. */
  202. int dbt_get_columns(db_con_t* _h, db_res_t* _r)
  203. {
  204. int n, i;
  205. if ((!_h) || (!_r))
  206. {
  207. #ifdef DBT_EXTRA_DEBUG
  208. LOG(L_ERR, "DBT:dbt_get_columns: Invalid parameter\n");
  209. #endif
  210. return -1;
  211. }
  212. n = DBT_CON_RESULT(_h)->nrcols;
  213. if (!n)
  214. {
  215. LOG(L_ERR, "DBT:dbt_get_columns: No columns\n");
  216. return -2;
  217. }
  218. RES_NAMES(_r) = (db_key_t*)pkg_malloc(sizeof(db_key_t) * n);
  219. if (!RES_NAMES(_r))
  220. {
  221. LOG(L_ERR, "DBT:dbt_get_columns: No memory left\n");
  222. return -3;
  223. }
  224. RES_TYPES(_r) = (db_type_t*)pkg_malloc(sizeof(db_type_t) * n);
  225. if (!RES_TYPES(_r))
  226. {
  227. LOG(L_ERR, "DBT:dbt_get_columns: No memory left\n");
  228. pkg_free(RES_NAMES(_r));
  229. return -4;
  230. }
  231. RES_COL_N(_r) = n;
  232. for(i = 0; i < n; i++)
  233. {
  234. RES_NAMES(_r)[i] = DBT_CON_RESULT(_h)->colv[i].name.s;
  235. switch( DBT_CON_RESULT(_h)->colv[i].type)
  236. {
  237. case DB_INT:
  238. case DB_DATETIME:
  239. RES_TYPES(_r)[i] = DB_INT;
  240. break;
  241. case DB_FLOAT:
  242. RES_TYPES(_r)[i] = DB_FLOAT;
  243. break;
  244. case DB_DOUBLE:
  245. RES_TYPES(_r)[i] = DB_DOUBLE;
  246. break;
  247. default:
  248. RES_TYPES(_r)[i] = DB_STR;
  249. break;
  250. }
  251. }
  252. return 0;
  253. }
  254. /*
  255. * Convert rows from internal to db API representation
  256. */
  257. int dbt_convert_rows(db_con_t* _h, db_res_t* _r)
  258. {
  259. int n, i;
  260. dbt_row_p _rp = NULL;
  261. if ((!_h) || (!_r))
  262. {
  263. #ifdef DBT_EXTRA_DEBUG
  264. LOG(L_ERR, "DBT:dbt_convert_rows: Invalid parameter\n");
  265. #endif
  266. return -1;
  267. }
  268. n = DBT_CON_RESULT(_h)->nrrows;
  269. RES_ROW_N(_r) = n;
  270. if (!n)
  271. {
  272. RES_ROWS(_r) = 0;
  273. return 0;
  274. }
  275. RES_ROWS(_r) = (struct db_row*)pkg_malloc(sizeof(db_row_t) * n);
  276. if (!RES_ROWS(_r))
  277. {
  278. LOG(L_ERR, "DBT:dbt_convert_rows: No memory left\n");
  279. return -2;
  280. }
  281. i = 0;
  282. _rp = DBT_CON_RESULT(_h)->rows;
  283. while(_rp)
  284. {
  285. DBT_CON_ROW(_h) = _rp;
  286. if (!DBT_CON_ROW(_h))
  287. {
  288. LOG(L_ERR, "DBT:dbt_convert_rows: error getting current row\n");
  289. RES_ROW_N(_r) = i;
  290. dbt_free_rows(_r);
  291. return -3;
  292. }
  293. if (dbt_convert_row(_h, _r, &(RES_ROWS(_r)[i])) < 0)
  294. {
  295. LOG(L_ERR, "DBT:dbt_convert_rows: Error while converting"
  296. " row #%d\n", i);
  297. RES_ROW_N(_r) = i;
  298. dbt_free_rows(_r);
  299. return -4;
  300. }
  301. i++;
  302. _rp = _rp->next;
  303. }
  304. return 0;
  305. }
  306. /*
  307. * Convert a row from result into db API representation
  308. */
  309. int dbt_convert_row(db_con_t* _h, db_res_t* _res, db_row_t* _r)
  310. {
  311. int i;
  312. if ((!_h) || (!_r) || (!_res))
  313. {
  314. #ifdef DBT_EXTRA_DEBUG
  315. LOG(L_ERR, "DBT:dbt_convert_row: Invalid parameter value\n");
  316. #endif
  317. return -1;
  318. }
  319. ROW_VALUES(_r) = (db_val_t*)pkg_malloc(sizeof(db_val_t) * RES_COL_N(_res));
  320. ROW_N(_r) = RES_COL_N(_res);
  321. if (!ROW_VALUES(_r))
  322. {
  323. LOG(L_ERR, "DBT:dbt_convert_row: No memory left\n");
  324. return -1;
  325. }
  326. for(i = 0; i < RES_COL_N(_res); i++)
  327. {
  328. (ROW_VALUES(_r)[i]).nul = DBT_CON_ROW(_h)->fields[i].nul;
  329. switch(RES_TYPES(_res)[i])
  330. {
  331. case DB_INT:
  332. VAL_INT(&(ROW_VALUES(_r)[i])) =
  333. DBT_CON_ROW(_h)->fields[i].val.int_val;
  334. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_INT;
  335. break;
  336. case DB_FLOAT:
  337. VAL_FLOAT(&(ROW_VALUES(_r)[i])) =
  338. DBT_CON_ROW(_h)->fields[i].val.float_val;
  339. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_FLOAT;
  340. break;
  341. case DB_DOUBLE:
  342. VAL_DOUBLE(&(ROW_VALUES(_r)[i])) =
  343. DBT_CON_ROW(_h)->fields[i].val.double_val;
  344. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_DOUBLE;
  345. break;
  346. case DB_STRING:
  347. VAL_STR(&(ROW_VALUES(_r)[i])).s =
  348. DBT_CON_ROW(_h)->fields[i].val.str_val.s;
  349. VAL_STR(&(ROW_VALUES(_r)[i])).len =
  350. DBT_CON_ROW(_h)->fields[i].val.str_val.len;
  351. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_STR;
  352. break;
  353. case DB_STR:
  354. VAL_STR(&(ROW_VALUES(_r)[i])).s =
  355. DBT_CON_ROW(_h)->fields[i].val.str_val.s;
  356. VAL_STR(&(ROW_VALUES(_r)[i])).len =
  357. DBT_CON_ROW(_h)->fields[i].val.str_val.len;
  358. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_STR;
  359. break;
  360. case DB_DATETIME:
  361. VAL_INT(&(ROW_VALUES(_r)[i])) =
  362. DBT_CON_ROW(_h)->fields[i].val.int_val;
  363. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_INT;
  364. break;
  365. case DB_BLOB:
  366. VAL_STR(&(ROW_VALUES(_r)[i])).s =
  367. DBT_CON_ROW(_h)->fields[i].val.str_val.s;
  368. VAL_STR(&(ROW_VALUES(_r)[i])).len =
  369. DBT_CON_ROW(_h)->fields[i].val.str_val.len;
  370. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_STR;
  371. break;
  372. case DB_BITMAP:
  373. VAL_INT(&(ROW_VALUES(_r)[i])) =
  374. DBT_CON_ROW(_h)->fields[i].val.bitmap_val;
  375. VAL_TYPE(&(ROW_VALUES(_r)[i])) = DB_INT;
  376. break;
  377. }
  378. }
  379. return 0;
  380. }