General:
Changes to 1.37.19:
+26May05
+- Fix compile problem of ua_restore.c on broken compilers.
25May05
- Put Dmsg() on inside if() to avoid calling subroutine.
- Make restore.bsr have unique name.
RESTORE_CTX rx; /* restore context */
JOB *job;
int i;
+ POOLMEM *fname;
memset(&rx, 0, sizeof(rx));
rx.path = get_pool_memory(PM_FNAME);
}
/* Build run command */
- POOLMEM *fname = get_pool_memory(PM_MESSAGE);
+ fname = get_pool_memory(PM_MESSAGE);
make_unique_restore_filename(ua, &fname);
if (rx.where) {
Mmsg(ua->cmd,
*
*/
/*
- Copyright (C) 2000-2004 Kern Sibbald and John Walker
+ Copyright (C) 2000-2005 Kern Sibbald
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.
+ modify it under the terms of the GNU General Public License
+ version 2 as ammended with additional clauses defined in the
+ file LICENSE in the main source directory.
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.
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ the file LICENSE for additional details.
*/
for (int k=0; k<CNT; k++) {
count++;
if ((count & 0x3FF) == 0) {
- Dmsg1(000, "At %d\n", count);
+ Dmsg1(000, "At %d\n", count);
}
jcr = (MYJCR *)malloc(sizeof(MYJCR));
jcr->buf = bstrdup(buf);
jcr1 = (MYJCR *)jcr_chain->binary_insert(jcr, my_compare);
if (jcr != jcr1) {
- Dmsg2(000, "Insert of %s vs %s failed.\n", jcr->buf, jcr1->buf);
+ Dmsg2(000, "Insert of %s vs %s failed.\n", jcr->buf, jcr1->buf);
}
buf[1]--;
}
- buf[1] = 'Z';
+ buf[1] = 'Z';
buf[2]--;
}
buf[2] = 'Z';
/*
* Version $Id$
*/
-
/*
- Copyright (C) 2004 Kern Sibbald and John Walker
+ Copyright (C) 2003-2005 Kern Sibbald
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.
+ modify it under the terms of the GNU General Public License
+ version 2 as ammended with additional clauses defined in the
+ file LICENSE in the main source directory.
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.
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ the file LICENSE for additional details.
*/
+
/* ========================================================================
*
* Doubly linked list -- dlist
void binary_insert(void *item, int compare(void *item1, void *item2));
void remove(void *item);
bool empty() const;
- int size() const;
+ int size() const;
void *next(const void *item) const;
void *prev(const void *item) const;
void destroy();
/* */
#undef VERSION
#define VERSION "1.37.19"
-#define BDATE "25 May 2005"
-#define LSMDATE "25May05"
+#define BDATE "26 May 2005"
+#define LSMDATE "26May05"
/* Debug flags */
#undef DEBUG