1b528cefcSMark Murray /*
25e9cd1aeSAssar Westerlund * Copyright (c) 1995-2000 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
7b528cefcSMark Murray * modification, are permitted provided that the following conditions
8b528cefcSMark Murray * are met:
9b528cefcSMark Murray *
10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
12b528cefcSMark Murray *
13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
15b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
16b528cefcSMark Murray *
17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
18b528cefcSMark Murray * may be used to endorse or promote products derived from this software
19b528cefcSMark Murray * without specific prior written permission.
20b528cefcSMark Murray *
21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31b528cefcSMark Murray * SUCH DAMAGE.
32b528cefcSMark Murray */
33b528cefcSMark Murray
34b528cefcSMark Murray #include "common.h"
35b528cefcSMark Murray #include <stdio.h>
36b528cefcSMark Murray #include <err.h>
37b528cefcSMark Murray #include "roken.h"
38b528cefcSMark Murray
39c19800e8SDoug Rabson RCSID("$Id$");
40b528cefcSMark Murray
41b528cefcSMark Murray /*
42b528cefcSMark Murray * Allocate a buffer enough to handle st->st_blksize, if
43b528cefcSMark Murray * there is such a field, otherwise BUFSIZ.
44b528cefcSMark Murray */
45b528cefcSMark Murray
46b528cefcSMark Murray void *
alloc_buffer(void * oldbuf,size_t * sz,struct stat * st)47b528cefcSMark Murray alloc_buffer (void *oldbuf, size_t *sz, struct stat *st)
48b528cefcSMark Murray {
49b528cefcSMark Murray size_t new_sz;
50b528cefcSMark Murray
51b528cefcSMark Murray new_sz = BUFSIZ;
525e9cd1aeSAssar Westerlund #ifdef HAVE_STRUCT_STAT_ST_BLKSIZE
53b528cefcSMark Murray if (st)
54b528cefcSMark Murray new_sz = max(BUFSIZ, st->st_blksize);
55b528cefcSMark Murray #endif
56b528cefcSMark Murray if(new_sz > *sz) {
57b528cefcSMark Murray if (oldbuf)
58b528cefcSMark Murray free (oldbuf);
59b528cefcSMark Murray oldbuf = malloc (new_sz);
60b528cefcSMark Murray if (oldbuf == NULL) {
61b528cefcSMark Murray warn ("malloc");
62b528cefcSMark Murray *sz = 0;
63b528cefcSMark Murray return NULL;
64b528cefcSMark Murray }
65b528cefcSMark Murray *sz = new_sz;
66b528cefcSMark Murray }
67b528cefcSMark Murray return oldbuf;
68b528cefcSMark Murray }
69b528cefcSMark Murray
70