Welcome to mirror list, hosted at ThFree Co, Russian Federation.

autoprune.cc « dird « src « core - github.com/bareos/bareos.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 6634d103ace6991090bc1d2bae38fc7c4774d91f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
/*
   BAREOS® - Backup Archiving REcovery Open Sourced

   Copyright (C) 2002-2012 Free Software Foundation Europe e.V.
   Copyright (C) 2011-2016 Planets Communications B.V.
   Copyright (C) 2013-2022 Bareos GmbH & Co. KG

   This program is Free Software; you can redistribute it and/or
   modify it under the terms of version three of the GNU Affero 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
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
   Affero General Public License for more details.

   You should have received a copy of the GNU Affero 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.
*/
// Kern Sibbald, May MMII
/**
 * @file
 * Automatic Pruning Applies retention periods
 */

#include "include/bareos.h"
#include "dird.h"
#include "dird/director_jcr_impl.h"
#include "dird/next_vol.h"
#include "dird/ua_server.h"
#include "dird/ua_prune.h"
#include "dird/ua_purge.h"
#include "lib/edit.h"

namespace directordaemon {

/**
 * Auto Prune Jobs and Files. This is called at the end of every
 *   Job.  We do not prune volumes here.
 */
void DoAutoprune(JobControlRecord* jcr)
{
  UaContext* ua;
  JobResource* job;
  ClientResource* client;
  PoolResource* pool;
  bool pruned;

  if (!jcr->dir_impl->res.client) { /* temp -- remove me */
    return;
  }

  ua = new_ua_context(jcr);
  job = jcr->dir_impl->res.job;
  client = jcr->dir_impl->res.client;
  pool = jcr->dir_impl->res.pool;

  if (job->PruneJobs || client->AutoPrune) {
    PruneJobs(ua, client, pool);
    pruned = true;
  } else {
    pruned = false;
  }

  if (job->PruneFiles || client->AutoPrune) {
    PruneFiles(ua, client, pool);
    pruned = true;
  }
  if (pruned) { Jmsg(jcr, M_INFO, 0, _("End auto prune.\n\n")); }
  FreeUaContext(ua);
  return;
}

/**
 * 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.
 */
void PruneVolumes(JobControlRecord* jcr,
                  bool InChanger,
                  MediaDbRecord* mr,
                  StorageResource* store)
{
  int i;
  int count;
  UaContext* ua;
  dbid_list ids;
  std::vector<JobId_t> prune_list;
  PoolMem query(PM_MESSAGE);
  char ed1[50], ed2[100], ed3[50];

  Dmsg1(100, "Prune volumes PoolId=%d\n", jcr->dir_impl->jr.PoolId);
  if (!jcr->dir_impl->res.job->PruneVolumes
      && !jcr->dir_impl->res.pool->AutoPrune) {
    Dmsg0(100, "AutoPrune not set in Pool.\n");
    return;
  }

  ua = new_ua_context(jcr);
  DbLocker _{jcr->db};

  edit_int64(mr->PoolId, ed1);

  // Get Pool record for Scratch Pool
  PoolDbRecord spr;
  bstrncpy(spr.Name, "Scratch", sizeof(spr.Name));
  if (jcr->db->GetPoolRecord(jcr, &spr)) {
    edit_int64(spr.PoolId, ed2);
    bstrncat(ed2, ",", sizeof(ed2));
  } else {
    ed2[0] = 0;
  }

  if (mr->ScratchPoolId) {
    edit_int64(mr->ScratchPoolId, ed3);
    bstrncat(ed2, ed3, sizeof(ed2));
    bstrncat(ed2, ",", sizeof(ed2));
  }

  Dmsg1(100, "Scratch pool(s)=%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 (!jcr->db->GetQueryDbids(ua->jcr, query, ids)) {
    Jmsg(jcr, M_ERROR, 0, "%s", jcr->db->strerror());
    goto bail_out;
  }

  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++) {
    MediaDbRecord lmr;

    lmr.MediaId = ids.DBId[i];
    Dmsg1(100, "Get record MediaId=%d\n", (int)lmr.MediaId);
    if (!jcr->db->GetMediaRecord(jcr, &lmr)) {
      Jmsg(jcr, M_ERROR, 0, "%s", jcr->db->strerror());
      continue;
    }
    Dmsg1(100, "Examine vol=%s\n", lmr.VolumeName);
    /* Don't prune archived volumes */
    if (lmr.Enabled == VOL_ARCHIVED) {
      Dmsg1(100, "Vol=%s disabled\n", lmr.VolumeName);
      continue;
    }
    /* Prune only Volumes with status "Full", or "Used" */
    if (bstrcmp(lmr.VolStatus, "Full") || bstrcmp(lmr.VolStatus, "Used")) {
      Dmsg2(100, "Add prune list MediaId=%d Volume %s\n", (int)lmr.MediaId,
            lmr.VolumeName);
      count = GetPruneListForVolume(ua, &lmr, prune_list);
      Dmsg1(100, "Num pruned = %d\n", count);
      if (count != 0) {
        PurgeJobListFromCatalog(ua, prune_list);
        prune_list.clear(); /* reset count */
      }
      if (!IsVolumePurged(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 (HasVolumeExpired(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(MediaDbRecord));
        SetStorageidInMr(store, mr);
        break; /* got a volume */
      }
    }
  }

bail_out:
  Dmsg0(100, "Leave prune volumes\n");
  FreeUaContext(ua);
  return;
}
} /* namespace directordaemon */