2 Bacula® - The Network Backup Solution
4 Copyright (C) 2009-2010 Free Software Foundation Europe e.V.
6 The main author of Bacula is Kern Sibbald, with contributions from
7 many others, a complete list can be found in the file AUTHORS.
8 This program is Free Software; you can redistribute it and/or
9 modify it under the terms of version three of the GNU Affero General Public
10 License as published by the Free Software Foundation, which is
11 listed in the file LICENSE.
13 This program is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU Affero General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
23 Bacula® is a registered trademark of Kern Sibbald.
24 The licensor of Bacula is the Free Software Foundation Europe
25 (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
26 Switzerland, email:ftf@fsfeurope.org.
29 #define __SQL_C /* indicate that this is sql.c */
32 #include "cats/cats.h"
33 #include "lib/htable.h"
37 #define dbglevel_sql 15
39 static int result_handler(void *ctx, int fields, char **row)
42 Pmsg4(0, "%s\t%s\t%s\t%s\n",
43 row[0], row[1], row[2], row[3]);
44 } else if (fields == 5) {
45 Pmsg5(0, "%s\t%s\t%s\t%s\t%s\n",
46 row[0], row[1], row[2], row[3], row[4]);
47 } else if (fields == 6) {
48 Pmsg6(0, "%s\t%s\t%s\t%s\t%s\t%s\n",
49 row[0], row[1], row[2], row[3], row[4], row[5]);
50 } else if (fields == 7) {
51 Pmsg7(0, "%s\t%s\t%s\t%s\t%s\t%s\t%s\n",
52 row[0], row[1], row[2], row[3], row[4], row[5], row[6]);
57 Bvfs::Bvfs(JCR *j, B_DB *mdb) {
60 db = mdb; /* need to inc ref count */
61 jobids = get_pool_memory(PM_NAME);
62 prev_dir = get_pool_memory(PM_NAME);
63 pattern = get_pool_memory(PM_NAME);
64 *jobids = *prev_dir = *pattern = 0;
65 dir_filenameid = pwd_id = offset = 0;
66 see_copies = see_all_versions = false;
69 list_entries = result_handler;
74 free_pool_memory(jobids);
75 free_pool_memory(pattern);
76 free_pool_memory(prev_dir);
82 * TODO: Find a way to let the user choose how he wants to display
83 * files and directories
88 * Working Object to store PathId already seen (avoid
89 * database queries), equivalent to %cache_ppathid in perl
101 htable *cache_ppathid;
106 cache_ppathid = (htable *)malloc(sizeof(htable));
107 cache_ppathid->init(&link, &link, NITEMS);
109 nodes = (hlink *) malloc(max_node * sizeof (hlink));
111 table_node = New(alist(5, owned_by_alist));
112 table_node->append(nodes);
116 if (++nb_node >= max_node) {
118 nodes = (hlink *)malloc(max_node * sizeof(hlink));
119 table_node->append(nodes);
121 return nodes + nb_node;
124 bool lookup(char *pathid) {
125 bool ret = cache_ppathid->lookup(pathid) != NULL;
129 void insert(char *pathid) {
130 hlink *h = get_hlink();
131 cache_ppathid->insert(pathid, h);
135 cache_ppathid->destroy();
140 pathid_cache(const pathid_cache &); /* prohibit pass by value */
141 pathid_cache &operator= (const pathid_cache &);/* prohibit class assignment*/
144 /* Return the parent_dir with the trailing / (update the given string)
145 * TODO: see in the rest of bacula if we don't have already this function
151 char *bvfs_parent_dir(char *path)
154 int len = strlen(path) - 1;
156 if (len >= 0 && path[len] == '/') { /* if directory, skip last / */
162 while (p > path && !IsPathSeparator(*p)) {
170 /* Return the basename of the with the trailing /
171 * TODO: see in the rest of bacula if we don't have
172 * this function already
174 char *bvfs_basename_dir(char *path)
177 int len = strlen(path) - 1;
179 if (path[len] == '/') { /* if directory, skip last / */
185 while (p > path && !IsPathSeparator(*p)) {
189 p++; /* skip first / */
195 static void build_path_hierarchy(JCR *jcr, B_DB *mdb,
196 pathid_cache &ppathid_cache,
197 char *org_pathid, char *path)
199 Dmsg1(dbglevel, "build_path_hierarchy(%s)\n", path);
202 char *bkp = mdb->path;
203 strncpy(pathid, org_pathid, sizeof(pathid));
205 /* Does the ppathid exist for this ? we use a memory cache... In order to
206 * avoid the full loop, we consider that if a dir is allready in the
207 * PathHierarchy table, then there is no need to calculate all the
210 while (path && *path)
212 if (!ppathid_cache.lookup(pathid))
215 "SELECT PPathId FROM PathHierarchy WHERE PathId = %s",
218 QUERY_DB(jcr, mdb, mdb->cmd);
219 /* Do we have a result ? */
220 if (sql_num_rows(mdb) > 0) {
221 ppathid_cache.insert(pathid);
222 /* This dir was in the db ...
223 * It means we can leave, the tree has allready been built for
228 /* search or create parent PathId in Path table */
229 mdb->path = bvfs_parent_dir(path);
230 mdb->pnl = strlen(mdb->path);
231 if (!db_create_path_record(jcr, mdb, &parent)) {
234 ppathid_cache.insert(pathid);
237 "INSERT INTO PathHierarchy (PathId, PPathId) "
239 pathid, (uint64_t) parent.PathId);
241 INSERT_DB(jcr, mdb, mdb->cmd);
243 edit_uint64(parent.PathId, pathid);
244 path = mdb->path; /* already done */
247 /* It's already in the cache. We can leave, no time to waste here,
248 * all the parent dirs have allready been done
260 * Internal function to update path_hierarchy cache with a shared pathid cache
262 static void update_path_hierarchy_cache(JCR *jcr,
264 pathid_cache &ppathid_cache,
267 Dmsg0(dbglevel, "update_path_hierarchy_cache()\n");
271 edit_uint64(JobId, jobid);
274 db_start_transaction(jcr, mdb);
276 Mmsg(mdb->cmd, "SELECT 1 FROM Job WHERE JobId = %s AND HasCache=1", jobid);
278 if (!QUERY_DB(jcr, mdb, mdb->cmd) || sql_num_rows(mdb) > 0) {
279 Dmsg1(dbglevel, "already computed %d\n", (uint32_t)JobId );
283 /* Inserting path records for JobId */
284 Mmsg(mdb->cmd, "INSERT INTO PathVisibility (PathId, JobId) "
285 "SELECT DISTINCT PathId, JobId "
286 "FROM (SELECT PathId, JobId FROM File WHERE JobId = %s "
288 "SELECT PathId, BaseFiles.JobId FROM BaseFiles JOIN File AS F USING (FileId) "
289 "WHERE BaseFiles.JobId = %s) AS B",
291 QUERY_DB(jcr, mdb, mdb->cmd);
293 /* Now we have to do the directory recursion stuff to determine missing
294 * visibility We try to avoid recursion, to be as fast as possible We also
295 * only work on not allready hierarchised directories...
298 "SELECT PathVisibility.PathId, Path "
299 "FROM PathVisibility "
300 "JOIN Path ON( PathVisibility.PathId = Path.PathId) "
301 "LEFT JOIN PathHierarchy "
302 "ON (PathVisibility.PathId = PathHierarchy.PathId) "
303 "WHERE PathVisibility.JobId = %s "
304 "AND PathHierarchy.PathId IS NULL "
305 "ORDER BY Path", jobid);
306 Dmsg1(dbglevel_sql, "q=%s\n", mdb->cmd);
307 QUERY_DB(jcr, mdb, mdb->cmd);
309 /* TODO: I need to reuse the DB connection without emptying the result
310 * So, now i'm copying the result in memory to be able to query the
311 * catalog descriptor again.
313 num = sql_num_rows(mdb);
315 char **result = (char **)malloc (num * 2 * sizeof(char *));
319 while((row = sql_fetch_row(mdb))) {
320 result[i++] = bstrdup(row[0]);
321 result[i++] = bstrdup(row[1]);
326 build_path_hierarchy(jcr, mdb, ppathid_cache, result[i], result[i+1]);
335 "INSERT INTO PathVisibility (PathId, JobId) "
336 "SELECT a.PathId,%s "
338 "SELECT DISTINCT h.PPathId AS PathId "
339 "FROM PathHierarchy AS h "
340 "JOIN PathVisibility AS p ON (h.PathId=p.PathId) "
341 "WHERE p.JobId=%s) AS a LEFT JOIN "
343 "FROM PathVisibility "
344 "WHERE JobId=%s) AS b ON (a.PathId = b.PathId) "
345 "WHERE b.PathId IS NULL", jobid, jobid, jobid);
348 QUERY_DB(jcr, mdb, mdb->cmd);
349 } while (sql_affected_rows(mdb) > 0);
351 Mmsg(mdb->cmd, "UPDATE Job SET HasCache=1 WHERE JobId=%s", jobid);
352 UPDATE_DB(jcr, mdb, mdb->cmd);
355 db_end_transaction(jcr, mdb);
360 * Find an store the filename descriptor for empty directories Filename.Name=''
362 DBId_t Bvfs::get_dir_filenameid()
365 if (dir_filenameid) {
366 return dir_filenameid;
369 Mmsg(q, "SELECT FilenameId FROM Filename WHERE Name = ''");
370 db_sql_query(db, q.c_str(), db_int_handler, &id);
372 return dir_filenameid;
375 void bvfs_update_cache(JCR *jcr, B_DB *mdb)
378 db_list_ctx jobids_list;
381 db_start_transaction(jcr, mdb);
384 /* TODO: Remove this code when updating make_bacula_table script */
385 Mmsg(mdb->cmd, "SELECT 1 FROM Job WHERE HasCache<>2 LIMIT 1");
386 if (!QUERY_DB(jcr, mdb, mdb->cmd)) {
387 Dmsg0(dbglevel, "Creating cache table\n");
388 Mmsg(mdb->cmd, "ALTER TABLE Job ADD HasCache int DEFAULT 0");
389 QUERY_DB(jcr, mdb, mdb->cmd);
392 "CREATE TABLE PathHierarchy ( "
393 "PathId integer NOT NULL, "
394 "PPathId integer NOT NULL, "
395 "CONSTRAINT pathhierarchy_pkey "
396 "PRIMARY KEY (PathId))");
397 QUERY_DB(jcr, mdb, mdb->cmd);
400 "CREATE INDEX pathhierarchy_ppathid "
401 "ON PathHierarchy (PPathId)");
402 QUERY_DB(jcr, mdb, mdb->cmd);
405 "CREATE TABLE PathVisibility ("
406 "PathId integer NOT NULL, "
407 "JobId integer NOT NULL, "
408 "Size int8 DEFAULT 0, "
409 "Files int4 DEFAULT 0, "
410 "CONSTRAINT pathvisibility_pkey "
411 "PRIMARY KEY (JobId, PathId))");
412 QUERY_DB(jcr, mdb, mdb->cmd);
415 "CREATE INDEX pathvisibility_jobid "
416 "ON PathVisibility (JobId)");
417 QUERY_DB(jcr, mdb, mdb->cmd);
423 "SELECT JobId from Job "
424 "WHERE HasCache = 0 "
425 "AND Type IN ('B') AND JobStatus IN ('T', 'f', 'A') "
428 db_sql_query(mdb, mdb->cmd, db_list_handler, &jobids_list);
430 bvfs_update_path_hierarchy_cache(jcr, mdb, jobids_list.list);
432 db_end_transaction(jcr, mdb);
433 db_start_transaction(jcr, mdb);
434 Dmsg0(dbglevel, "Cleaning pathvisibility\n");
436 "DELETE FROM PathVisibility "
438 "(SELECT 1 FROM Job WHERE JobId=PathVisibility.JobId)");
439 nb = DELETE_DB(jcr, mdb, mdb->cmd);
440 Dmsg1(dbglevel, "Affected row(s) = %d\n", nb);
442 db_end_transaction(jcr, mdb);
447 * Update the bvfs cache for given jobids (1,2,3,4)
450 bvfs_update_path_hierarchy_cache(JCR *jcr, B_DB *mdb, char *jobids)
452 pathid_cache ppathid_cache;
457 int stat = get_next_jobid_from_list(&p, &JobId);
464 Dmsg1(dbglevel, "Updating cache for %lld\n", (uint64_t)JobId);
465 update_path_hierarchy_cache(jcr, mdb, ppathid_cache, JobId);
470 * Update the bvfs cache for current jobids
472 void Bvfs::update_cache()
474 bvfs_update_path_hierarchy_cache(jcr, db, jobids);
477 /* Change the current directory, returns true if the path exists */
478 bool Bvfs::ch_dir(const char *path)
480 pm_strcpy(db->path, path);
481 db->pnl = strlen(db->path);
482 ch_dir(db_get_path_record(jcr, db));
487 * Get all file versions for a specified client
488 * TODO: Handle basejobs using different client
490 void Bvfs::get_all_file_versions(DBId_t pathid, DBId_t fnid, const char *client)
492 Dmsg3(dbglevel, "get_all_file_versions(%lld, %lld, %s)\n", (uint64_t)pathid,
493 (uint64_t)fnid, client);
494 char ed1[50], ed2[50];
497 Mmsg(q, " AND Job.Type IN ('C', 'B') ");
499 Mmsg(q, " AND Job.Type = 'B' ");
505 "SELECT 'V', File.PathId, File.FilenameId, File.Md5, "
507 "File.JobId, File.LStat, File.FileId, "
509 "Media.VolumeName, Media.InChanger "
510 "FROM File, Job, Client, JobMedia, Media "
511 "WHERE File.FilenameId = %s "
512 "AND File.PathId=%s "
513 "AND File.JobId = Job.JobId "
514 "AND Job.JobId = JobMedia.JobId "
515 "AND File.FileIndex >= JobMedia.FirstIndex "
516 "AND File.FileIndex <= JobMedia.LastIndex "
517 "AND JobMedia.MediaId = Media.MediaId "
518 "AND Job.ClientId = Client.ClientId "
519 "AND Client.Name = '%s' "
520 "%s ORDER BY FileId LIMIT %d OFFSET %d"
521 ,edit_uint64(fnid, ed1), edit_uint64(pathid, ed2), client, q.c_str(),
523 Dmsg1(dbglevel_sql, "q=%s\n", query.c_str());
524 db_sql_query(db, query.c_str(), list_entries, user_data);
527 DBId_t Bvfs::get_root()
530 return db_get_path_record(jcr, db);
533 static int path_handler(void *ctx, int fields, char **row)
535 Bvfs *fs = (Bvfs *) ctx;
536 return fs->_handle_path(ctx, fields, row);
539 int Bvfs::_handle_path(void *ctx, int fields, char **row)
541 if (bvfs_is_dir(row)) {
542 /* can have the same path 2 times */
543 if (strcmp(row[BVFS_Name], prev_dir)) {
544 pm_strcpy(prev_dir, row[BVFS_Name]);
545 return list_entries(user_data, fields, row);
552 * Retrieve . and .. information
554 void Bvfs::ls_special_dirs()
556 Dmsg1(dbglevel, "ls_special_dirs(%lld)\n", (uint64_t)pwd_id);
557 char ed1[50], ed2[50];
561 if (!dir_filenameid) {
562 get_dir_filenameid();
565 /* Will fetch directories */
570 "((SELECT PPathId AS PathId, '..' AS Path "
571 "FROM PathHierarchy "
572 "WHERE PathId = %s) "
574 "(SELECT %s AS PathId, '.' AS Path))",
575 edit_uint64(pwd_id, ed1), ed1);
578 Mmsg(query2,// 1 2 3 4 5 6
579 "SELECT 'D', tmp.PathId, 0, tmp.Path, JobId, LStat, FileId "
580 "FROM %s AS tmp LEFT JOIN ( " // get attributes if any
581 "SELECT File1.PathId AS PathId, File1.JobId AS JobId, "
582 "File1.LStat AS LStat, File1.FileId AS FileId FROM File AS File1 "
583 "WHERE File1.FilenameId = %s "
584 "AND File1.JobId IN (%s)) AS listfile1 "
585 "ON (tmp.PathId = listfile1.PathId) "
586 "ORDER BY tmp.Path, JobId DESC ",
587 query.c_str(), edit_uint64(dir_filenameid, ed2), jobids);
589 Dmsg1(dbglevel_sql, "q=%s\n", query2.c_str());
590 db_sql_query(db, query2.c_str(), path_handler, this);
593 /* Returns true if we have dirs to read */
596 Dmsg1(dbglevel, "ls_dirs(%lld)\n", (uint64_t)pwd_id);
597 char ed1[50], ed2[50];
604 Mmsg(filter, " AND Path2.Path %s '%s' ", SQL_MATCH, pattern);
607 if (!dir_filenameid) {
608 get_dir_filenameid();
611 /* the sql query displays same directory multiple time, take the first one */
614 /* Let's retrieve the list of the visible dirs in this dir ...
615 * First, I need the empty filenameid to locate efficiently
616 * the dirs in the file table
617 * my $dir_filenameid = $self->get_dir_filenameid();
619 /* Then we get all the dir entries from File ... */
623 "SELECT 'D', PathId, 0, Path, JobId, LStat, FileId FROM ( "
624 "SELECT Path1.PathId AS PathId, Path1.Path AS Path, "
625 "lower(Path1.Path) AS lpath, "
626 "listfile1.JobId AS JobId, listfile1.LStat AS LStat, "
627 "listfile1.FileId AS FileId "
629 "SELECT DISTINCT PathHierarchy1.PathId AS PathId "
630 "FROM PathHierarchy AS PathHierarchy1 "
631 "JOIN Path AS Path2 "
632 "ON (PathHierarchy1.PathId = Path2.PathId) "
633 "JOIN PathVisibility AS PathVisibility1 "
634 "ON (PathHierarchy1.PathId = PathVisibility1.PathId) "
635 "WHERE PathHierarchy1.PPathId = %s "
636 "AND PathVisibility1.jobid IN (%s) "
639 "JOIN Path AS Path1 ON (listpath1.PathId = Path1.PathId) "
641 "LEFT JOIN ( " /* get attributes if any */
642 "SELECT File1.PathId AS PathId, File1.JobId AS JobId, "
643 "File1.LStat AS LStat, File1.FileId AS FileId FROM File AS File1 "
644 "WHERE File1.FilenameId = %s "
645 "AND File1.JobId IN (%s)) AS listfile1 "
646 "ON (listpath1.PathId = listfile1.PathId) "
647 ") AS A ORDER BY 2,3 DESC LIMIT %d OFFSET %d",
648 edit_uint64(pwd_id, ed1),
651 edit_uint64(dir_filenameid, ed2),
655 Dmsg1(dbglevel_sql, "q=%s\n", query.c_str());
658 db_sql_query(db, query.c_str(), path_handler, this);
659 nb_record = db->num_rows;
662 return nb_record == limit;
665 /* Returns true if we have files to read */
666 bool Bvfs::ls_files()
668 Dmsg1(dbglevel, "ls_files(%lld)\n", (uint64_t)pwd_id);
680 Mmsg(filter, " AND Filename.Name %s '%s' ", SQL_MATCH, pattern);
682 /* TODO: Use JobTDate instead of FileId to determine the latest version */
684 Mmsg(query, // 1 2 3 4
685 "SELECT 'F', File.PathId, File.FilenameId, listfiles.Name, File.JobId, "
686 "File.LStat, listfiles.id "
688 "SELECT Filename.Name as Name, max(File.FileId) as id "
689 "FROM File, Filename "
690 "WHERE File.FilenameId = Filename.FilenameId "
691 "AND Filename.Name != '' "
692 "AND File.PathId = %s "
693 "AND File.JobId IN (%s) "
695 "GROUP BY Filename.Name "
696 "ORDER BY Filename.Name LIMIT %d OFFSET %d "
698 "WHERE File.FileId = listfiles.id",
699 edit_uint64(pwd_id, ed1),
704 Dmsg1(dbglevel_sql, "q=%s\n", query.c_str());
707 db_sql_query(db, query.c_str(), list_entries, user_data);
708 nb_record = db->num_rows;
711 return nb_record == limit;
716 * Return next Id from comma separated list
719 * 1 if next Id returned
720 * 0 if no more Ids are in list
721 * -1 there is an error
722 * TODO: merge with get_next_jobid_from_list() and get_next_dbid_from_list()
724 static int get_next_id_from_list(char **p, int64_t *Id)
726 const int maxlen = 30;
731 for (int i=0; i<maxlen; i++) {
734 } else if (*q == ',') {
743 } else if (!is_a_number(id)) {
744 return -1; /* error */
747 *Id = str_to_int64(id);
751 static int get_path_handler(void *ctx, int fields, char **row)
753 POOL_MEM *buf = (POOL_MEM *) ctx;
754 pm_strcpy(*buf, row[0]);
758 static bool check_temp(char *output_table)
760 if (output_table[0] == 'b' &&
761 output_table[1] == '2' &&
762 is_an_integer(output_table + 2))
769 bool Bvfs::drop_restore_list(char *output_table)
772 if (check_temp(output_table)) {
773 Mmsg(query, "DROP TABLE %s", output_table);
774 db_sql_query(db, query.c_str(), NULL, NULL);
780 bool Bvfs::compute_restore_list(char *fileid, char *dirid, char *hardlink,
789 if ((*fileid && !is_a_number_list(fileid)) ||
790 (*dirid && !is_a_number_list(dirid)) ||
791 (*hardlink && !is_a_number_list(hardlink))||
792 (!*hardlink && !*fileid && !*dirid && !*hardlink))
796 if (!check_temp(output_table)) {
800 Mmsg(query, "CREATE TEMPORARY TABLE btemp%s AS ", output_table);
804 Mmsg(tmp, "(SELECT JobId, FileIndex, FilenameId, PathId, FileId "
805 "FROM File WHERE FileId IN (%s))", fileid);
806 pm_strcat(query, tmp.c_str());
809 while (get_next_id_from_list(&dirid, &id) == 1) {
810 Mmsg(tmp, "SELECT Path FROM Path WHERE PathId=%lld", id);
812 if (!db_sql_query(db, tmp.c_str(), get_path_handler, (void *)&tmp2)) {
813 Dmsg0(dbglevel, "Can't search for path\n");
817 if (!strcmp(tmp2.c_str(), "")) { /* path not found */
818 Dmsg3(dbglevel, "Path not found %lld q=%s s=%s\n",
819 id, tmp.c_str(), tmp2.c_str());
822 /* escape % and _ for LIKE search */
823 tmp.check_size((strlen(tmp2.c_str())+1) * 2);
824 char *p = tmp.c_str();
825 for (char *s = tmp2.c_str(); *s ; s++) {
826 if (*s == '%' || *s == '_' || *s == '\\') {
836 size_t len = strlen(tmp.c_str());
837 tmp2.check_size((len+1) * 2);
838 db_escape_string(jcr, db, tmp2.c_str(), tmp.c_str(), len);
841 query.strcat(" UNION ");
843 Mmsg(tmp, "(SELECT File.JobId, File.FileIndex, File.FilenameId, "
844 "File.PathId, FileId "
845 "FROM Path JOIN File USING (PathId) "
846 "WHERE Path.Path LIKE '%s' AND File.JobId IN (%s)) ",
847 tmp2.c_str(), jobids);
848 query.strcat(tmp.c_str());
852 /* expect jobid,fileindex */
853 int64_t prev_jobid=0;
854 while (get_next_id_from_list(&hardlink, &jobid) == 1) {
855 if (get_next_id_from_list(&hardlink, &id) != 1) {
856 Dmsg0(dbglevel, "hardlink should be two by two\n");
859 if (jobid != prev_jobid) { /* new job */
860 if (prev_jobid == 0) { /* first jobid */
862 query.strcat(" UNION ");
864 } else { /* end last job, start new one */
865 tmp.strcat(")) UNION ");
866 query.strcat(tmp.c_str());
868 Mmsg(tmp, "(SELECT JobId, FileIndex, FilenameId, PathId, FileId "
869 "FROM File WHERE JobId = %lld "
870 "AND FileIndex IN (%lld", jobid, id);
873 } else { /* same job, add new findex */
874 Mmsg(tmp2, ", %lld", id);
875 tmp.strcat(tmp2.c_str());
879 if (prev_jobid != 0) { /* end last job */
881 query.strcat(tmp.c_str());
885 Dmsg1(dbglevel_sql, "q=%s\n", query.c_str());
887 if (!db_sql_query(db, query.c_str(), NULL, NULL)) {
888 Dmsg0(dbglevel, "Can't execute q\n");
892 /* TODO: handle basejob and SQLite3 */
893 Mmsg(query, sql_bvfs_select[db_type], output_table, output_table);
895 Dmsg1(dbglevel_sql, "q=%s\n", query.c_str());
896 if (!db_sql_query(db, query.c_str(), NULL, NULL)) {
897 Dmsg0(dbglevel, "Can't execute q\n");
903 Mmsg(query, "DROP TABLE btemp%s", output_table);
904 db_sql_query(db, query.c_str(), NULL, NULL);