/*
*
* Bacula Director -- Automatic Recycling of Volumes
- * Recycles Volumes that have been purged
+ * Recycles Volumes that have been purged
*
* Kern Sibbald, May MMII
*
* Version $Id$
*/
-
/*
- Copyright (C) 2002 Kern Sibbald and John Walker
+ Bacula® - The Network Backup Solution
+
+ Copyright (C) 2002-2006 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 plus additions
+ that are listed 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 John Walker.
+ The licensor of Bacula is the Free Software Foundation Europe
+ (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
+ Switzerland, email:ftf@fsfeurope.org.
+*/
#include "bacula.h"
#include "dird.h"
struct s_oldest_ctx *oldest = (struct s_oldest_ctx *)ctx;
if (row[0]) {
- Dmsg2(100, "oldest_handler %s %s\n", row[0], row[1]);
- }
- /* Find oldest Media record */
- if (row[1] && strcmp(row[1], oldest->LastWritten) < 0) {
- oldest->MediaId = atoi(row[0]);
- strcpy(oldest->LastWritten, row[1]);
- Dmsg1(100, "New oldest %s\n", row[1]);
+ oldest->MediaId = str_to_int64(row[0]);
+ bstrncpy(oldest->LastWritten, row[1]?row[1]:"", sizeof(oldest->LastWritten));
+ Dmsg1(100, "New oldest %s\n", row[1]?row[1]:"");
}
return 1;
}
/* Forward referenced functions */
-int find_recycled_volume(JCR *jcr, MEDIA_DBR *mr)
+bool find_recycled_volume(JCR *jcr, bool InChanger, MEDIA_DBR *mr)
{
- strcpy(mr->VolStatus, "Recycle");
- if (db_find_next_volume(jcr, jcr->db, 1, mr)) {
+ bstrncpy(mr->VolStatus, "Recycle", sizeof(mr->VolStatus));
+ if (db_find_next_volume(jcr, jcr->db, 1, InChanger, mr)) {
jcr->MediaId = mr->MediaId;
- Dmsg1(20, "Find_next_vol MediaId=%d\n", jcr->MediaId);
- strcpy(jcr->VolumeName, mr->VolumeName);
- return 1;
+ Dmsg1(20, "Find_next_vol MediaId=%u\n", jcr->MediaId);
+ pm_strcpy(jcr->VolumeName, mr->VolumeName);
+ return true;
}
- return 0;
+ return false;
}
/*
* Look for oldest Purged volume
*/
-int recycle_oldest_purged_volume(JCR *jcr, MEDIA_DBR *mr)
+bool recycle_oldest_purged_volume(JCR *jcr, bool InChanger, MEDIA_DBR *mr)
{
struct s_oldest_ctx oldest;
+ char ed1[50];
POOLMEM *query = get_pool_memory(PM_EMSG);
- char *select =
- "SELECT MediaId, LastWritten FROM Media "
- "WHERE PoolId=%d AND Recycle=1 AND VolStatus=\"Purged\" "
- "AND MediaType=\"%s\"";
+ const char *select =
+ "SELECT MediaId,LastWritten FROM Media "
+ "WHERE PoolId=%s AND Recycle=1 AND VolStatus='Purged' "
+ "AND Enabled=1 AND MediaType='%s' %s"
+ "ORDER BY LastWritten ASC,MediaId LIMIT 1";
Dmsg0(100, "Enter recycle_oldest_purged_volume\n");
oldest.MediaId = 0;
- strcpy(oldest.LastWritten, "9999-99-99 99:99:99");
- Mmsg(&query, select, mr->PoolId, mr->MediaType);
+ if (InChanger) {
+ char changer[100];
+ bsnprintf(changer, sizeof(changer), "AND InChanger=1 AND StorageId=%s ",
+ edit_int64(mr->StorageId, ed1));
+ Mmsg(query, select, edit_int64(mr->PoolId, ed1), mr->MediaType, changer);
+ } else {
+ Mmsg(query, select, edit_int64(mr->PoolId, ed1), mr->MediaType, "");
+ }
+
if (!db_sql_query(jcr->db, query, oldest_handler, (void *)&oldest)) {
Jmsg(jcr, M_ERROR, 0, "%s", db_strerror(jcr->db));
- Dmsg0(100, "Exit 0 recycle_oldest_purged_volume query\n");
+ Dmsg0(100, "return 0 recycle_oldest_purged_volume query\n");
free_pool_memory(query);
- return 0;
+ return false;
}
free_pool_memory(query);
Dmsg1(100, "Oldest mediaid=%d\n", oldest.MediaId);
if (oldest.MediaId != 0) {
mr->MediaId = oldest.MediaId;
if (db_get_media_record(jcr, jcr->db, mr)) {
- strcpy(mr->VolStatus, "Recycle");
- mr->VolJobs = mr->VolFiles = mr->VolBlocks = mr->VolErrors = 0;
- mr->VolBytes = 0;
- mr->FirstWritten = mr->LastWritten = 0;
- if (db_update_media_record(jcr, jcr->db, mr)) {
- Jmsg(jcr, M_INFO, 0, "Recycled volume \"%s\"\n", mr->VolumeName);
- Dmsg1(100, "Exit 1 recycle_oldest_purged_volume Vol=%s\n", mr->VolumeName);
- return 1;
- }
+ if (recycle_volume(jcr, mr)) {
+ Jmsg(jcr, M_INFO, 0, _("Recycled volume \"%s\"\n"), mr->VolumeName);
+ Dmsg1(100, "return 1 recycle_oldest_purged_volume Vol=%s\n", mr->VolumeName);
+ return true;
+ }
}
Jmsg(jcr, M_ERROR, 0, "%s", db_strerror(jcr->db));
}
- Dmsg0(100, "Exit 0 recycle_oldest_purged_volume end\n");
- return 0;
+ Dmsg0(100, "return 0 recycle_oldest_purged_volume end\n");
+ return false;
+}
+
+/*
+ * Recycle the specified volume
+ */
+int recycle_volume(JCR *jcr, MEDIA_DBR *mr)
+{
+ bstrncpy(mr->VolStatus, "Recycle", sizeof(mr->VolStatus));
+ mr->VolJobs = mr->VolFiles = mr->VolBlocks = mr->VolErrors = 0;
+ mr->VolBytes = 1;
+ mr->FirstWritten = mr->LastWritten = 0;
+ mr->RecycleCount++;
+ mr->set_first_written = true;
+ return db_update_media_record(jcr, jcr->db, mr);
}
projects / bacula / bacula / blobdiff