/*
- *
- * Bacula Director -- Automatic Pruning
- * Applies retention periods
- *
- * Kern Sibbald, May MMII
- *
- * Version $Id$
- */
+ Bacula® - The Network Backup Solution
-/*
- Copyright (C) 2002-2004 Kern Sibbald and John Walker
+ Copyright (C) 2002-2008 Free Software Foundation Europe e.V.
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License as
- published by the Free Software Foundation; either version 2 of
- the License, or (at your option) any later version.
+ The main author of Bacula is Kern Sibbald, with contributions from
+ many others, a complete list can be found in the file AUTHORS.
+ This program is Free Software; you can redistribute it and/or
+ modify it under the terms of version two of the GNU General Public
+ License as published by the Free Software Foundation and included
+ in the file LICENSE.
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
- You should have received a copy of the GNU General Public
- License along with this program; if not, write to the Free
- Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- MA 02111-1307, USA.
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+ 02110-1301, USA.
+ Bacula® is a registered trademark of Kern Sibbald.
+ The licensor of Bacula is the Free Software Foundation Europe
+ (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
+ Switzerland, email:ftf@fsfeurope.org.
+*/
+/*
+ *
+ * Bacula Director -- Automatic Pruning
+ * Applies retention periods
+ *
+ * Kern Sibbald, May MMII
+ *
+ * Version $Id$
*/
#include "bacula.h"
* Auto Prune Jobs and Files. This is called at the end of every
* Job. We do not prune volumes here.
*/
-int do_autoprune(JCR *jcr)
+void do_autoprune(JCR *jcr)
{
UAContext *ua;
CLIENT *client;
bool pruned;
if (!jcr->client) { /* temp -- remove me */
- return 1;
+ return;
}
ua = new_ua_context(jcr);
-
client = jcr->client;
if (jcr->job->PruneJobs || jcr->client->AutoPrune) {
Jmsg(jcr, M_INFO, 0, _("Begin pruning Jobs.\n"));
- prune_jobs(ua, client, jcr->JobType);
+ prune_jobs(ua, client, jcr->get_JobType());
pruned = true;
} else {
pruned = false;
if (pruned) {
Jmsg(jcr, M_INFO, 0, _("End auto prune.\n\n"));
}
-
free_ua_context(ua);
- return 1;
+ return;
}
/*
- * Prune all volumes in current Pool. This is called from
- * catreq.c when the Storage daemon is asking for another
+ * Prune at least one Volume in current Pool. This is called from
+ * catreq.c => next_vol.c when the Storage daemon is asking for another
* volume and no appendable volumes are available.
*
- * Return 0: on error
- * number of Volumes Purged
*/
-int prune_volumes(JCR *jcr)
+void prune_volumes(JCR *jcr, bool InChanger, MEDIA_DBR *mr)
{
- int stat = 0;
+ int count;
int i;
- uint32_t *ids = NULL;
- int num_ids = 0;
- MEDIA_DBR mr;
+ dbid_list ids;
+ struct del_ctx prune_list;
+ POOL_MEM query(PM_MESSAGE);
UAContext *ua;
+ char ed1[50], ed2[100], ed3[50];
+ POOL_DBR spr;
+ Dmsg1(100, "Prune volumes PoolId=%d\n", jcr->jr.PoolId);
if (!jcr->job->PruneVolumes && !jcr->pool->AutoPrune) {
Dmsg0(100, "AutoPrune not set in Pool.\n");
- return 0;
+ return;
}
- memset(&mr, 0, sizeof(mr));
- ua = new_ua_context(jcr);
+ memset(&prune_list, 0, sizeof(prune_list));
+ prune_list.max_ids = 10000;
+ prune_list.JobId = (JobId_t *)malloc(sizeof(JobId_t) * prune_list.max_ids);
+
+ ua = new_ua_context(jcr);
db_lock(jcr->db);
- /* Get the List of all media ids in the current Pool */
- if (!db_get_media_ids(jcr, jcr->db, jcr->jr.PoolId, &num_ids, &ids)) {
+ /* Edit PoolId */
+ edit_int64(mr->PoolId, ed1);
+ /*
+ * Get Pool record for Scratch Pool
+ */
+ memset(&spr, 0, sizeof(spr));
+ bstrncpy(spr.Name, "Scratch", sizeof(spr.Name));
+ if (db_get_pool_record(jcr, jcr->db, &spr)) {
+ edit_int64(spr.PoolId, ed2);
+ bstrncat(ed2, ",", sizeof(ed2));
+ } else {
+ ed2[0] = 0;
+ }
+ Dmsg1(100, "Scratch pool=%s\n", ed2);
+ /*
+ * ed2 ends up with scratch poolid and current poolid or
+ * just current poolid if there is no scratch pool
+ */
+ bstrncat(ed2, ed1, sizeof(ed2));
+
+ /*
+ * Get the List of all media ids in the current Pool or whose
+ * RecyclePoolId is the current pool or the scratch pool
+ */
+ const char *select = "SELECT DISTINCT MediaId,LastWritten FROM Media WHERE "
+ "(PoolId=%s OR RecyclePoolId IN (%s)) AND MediaType='%s' %s"
+ "ORDER BY LastWritten ASC,MediaId";
+
+ if (InChanger) {
+ char changer[100];
+ /* Ensure it is in this autochanger */
+ bsnprintf(changer, sizeof(changer), "AND InChanger=1 AND StorageId=%s ",
+ edit_int64(mr->StorageId, ed3));
+ Mmsg(query, select, ed1, ed2, mr->MediaType, changer);
+ } else {
+ Mmsg(query, select, ed1, ed2, mr->MediaType, "");
+ }
+
+ Dmsg1(100, "query=%s\n", query.c_str());
+ if (!db_get_query_dbids(ua->jcr, ua->db, query, ids)) {
Jmsg(jcr, M_ERROR, 0, "%s", db_strerror(jcr->db));
goto bail_out;
}
- /* Visit each Volume and Prune it */
- for (i=0; i<num_ids; i++) {
- mr.MediaId = ids[i];
- if (!db_get_media_record(jcr, jcr->db, &mr)) {
+ Dmsg1(100, "Volume prune num_ids=%d\n", ids.num_ids);
+
+ /* Visit each Volume and Prune it until we find one that is purged */
+ for (i=0; i<ids.num_ids; i++) {
+ MEDIA_DBR lmr;
+ memset(&lmr, 0, sizeof(lmr));
+ lmr.MediaId = ids.DBId[i];
+ Dmsg1(100, "Get record MediaId=%d\n", (int)lmr.MediaId);
+ if (!db_get_media_record(jcr, jcr->db, &lmr)) {
Jmsg(jcr, M_ERROR, 0, "%s", db_strerror(jcr->db));
continue;
}
- /* Prune only Volumes from current Pool */
- if (jcr->jr.PoolId != mr.PoolId) {
- continue;
- }
+ Dmsg1(100, "Examine vol=%s\n", lmr.VolumeName);
/* Don't prune archived volumes */
- if (mr.Enabled == 2) {
+ if (lmr.Enabled == 2) {
+ Dmsg1(100, "Vol=%s disabled\n", lmr.VolumeName);
continue;
}
/* Prune only Volumes with status "Full", or "Used" */
- if (strcmp(mr.VolStatus, "Full") == 0 ||
- strcmp(mr.VolStatus, "Used") == 0) {
- Dmsg1(200, "Prune Volume %s\n", mr.VolumeName);
- stat += prune_volume(ua, &mr);
- Dmsg1(200, "Num pruned = %d\n", stat);
+ if (strcmp(lmr.VolStatus, "Full") == 0 ||
+ strcmp(lmr.VolStatus, "Used") == 0) {
+ Dmsg2(100, "Add prune list MediaId=%d Volume %s\n", (int)lmr.MediaId, lmr.VolumeName);
+ count = get_prune_list_for_volume(ua, &lmr, &prune_list);
+ Dmsg1(100, "Num pruned = %d\n", count);
+ if (count != 0) {
+ purge_job_list_from_catalog(ua, prune_list);
+ prune_list.num_ids = 0; /* reset count */
+ }
+ if (!is_volume_purged(ua, &lmr)) {
+ Dmsg1(050, "Vol=%s not pruned\n", lmr.VolumeName);
+ continue;
+ }
+ Dmsg1(050, "Vol=%s is purged\n", lmr.VolumeName);
+
+ /*
+ * Since we are also pruning the Scratch pool, continue
+ * until and check if this volume is available (InChanger + StorageId)
+ * If not, just skip this volume and try the next one
+ */
+ if (InChanger) {
+ if (!lmr.InChanger || (lmr.StorageId != mr->StorageId)) {
+ Dmsg1(100, "Vol=%s not inchanger or correct StoreId\n", lmr.VolumeName);
+ continue; /* skip this volume, ie not loadable */
+ }
+ }
+ if (!lmr.Recycle) {
+ Dmsg1(100, "Vol=%s not recyclable\n", lmr.VolumeName);
+ continue;
+ }
+
+ if (has_volume_expired(jcr, &lmr)) {
+ Dmsg1(100, "Vol=%s has expired\n", lmr.VolumeName);
+ continue; /* Volume not usable */
+ }
+
+ /*
+ * If purged and not moved to another Pool,
+ * then we stop pruning and take this volume.
+ */
+ if (lmr.PoolId == mr->PoolId) {
+ Dmsg2(100, "Got Vol=%s MediaId=%d purged.\n", lmr.VolumeName, (int)lmr.MediaId);
+ memcpy(mr, &lmr, sizeof(lmr));
+ break; /* got a volume */
+ }
}
}
bail_out:
+ Dmsg0(100, "Leave prune volumes\n");
db_unlock(jcr->db);
free_ua_context(ua);
- if (ids) {
- free(ids);
+ if (prune_list.JobId) {
+ free(prune_list.JobId);
}
- return stat;
+ return;
}