* Copyright (c) 1990 Jan-Simon Pendry
* Copyright (c) 1990 Imperial College of Science, Technology & Medicine
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
* This code is derived from software contributed to Berkeley by
* Jan-Simon Pendry at Imperial College, London.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* @(#)info_file.c 8.1 (Berkeley) 6/6/93
* $Id: info_file.c,v 5.2.2.1 1992/02/09 15:08:28 jsp beta $
#define MAX_LINE_LEN 2048
static int read_line
P((char *buf
, int size
, FILE *fp
));
static int read_line(buf
, size
, fp
)
while (fgets(buf
, size
, fp
)) {
if (len
> 1 && buf
[len
-2] == '\\' &&
*buf
= '\n'; buf
[1] = '\0';
* Skip leading white space on next line
while ((ch
= getc(fp
)) != EOF
&&
isascii(ch
) && isspace(ch
))
} while (size
> 0 && !feof(fp
));
* Try to locate a key in a file
static int search_or_reload_file
P((FILE *fp
, char *map
, char *key
, char **val
, mnt_map
*m
, void (*fn
)(mnt_map
*m
, char*, char*)));
static int search_or_reload_file(fp
, map
, key
, val
, m
, fn
)
void (*fn
) P((mnt_map
*, char*, char*));
char key_val
[MAX_LINE_LEN
];
while (read_line(key_val
, sizeof(key_val
), fp
)) {
int len
= strlen(key_val
);
* Make sure we got the whole line
if (key_val
[len
-1] != '\n') {
plog(XLOG_WARNING
, "line %d in \"%s\" is too long", line_no
, map
);
hash
= strchr(key_val
, '#');
for (kp
= key_val
; *kp
&& isascii(*kp
) && isspace(*kp
); kp
++)
for (cp
= kp
; *cp
&&(!isascii(*cp
)||!isspace(*cp
)); cp
++)
* Check whether key matches
if (fn
|| (*key
== *kp
&& strcmp(key
, kp
) == 0)) {
while (*cp
&& isascii(*cp
) && isspace(*cp
))
* Return a copy of the data
(*fn
)(m
, strdup(kp
), dc
);
dlog("%s returns %s", key
, dc
);
plog(XLOG_USER
, "%s: line %d has no value field", map
, line_no
);
* If the last read didn't get a whole line then
* throw away the remainder before continuing...
while (fgets(key_val
, sizeof(key_val
), fp
) &&
static FILE *file_open
P((char *map
, time_t *tp
));
static FILE *file_open(map
, tp
)
FILE *mapf
= fopen(map
, "r");
if (fstat(fileno(mapf
), &stb
) < 0)
int file_init
P((char *map
, time_t *tp
));
FILE *mapf
= file_open(map
, tp
);
int file_reload
P((mnt_map
*m
, char *map
, void (*fn
)()));
int file_reload(m
, map
, fn
)
FILE *mapf
= file_open(map
, (time_t *) 0);
int error
= search_or_reload_file(mapf
, map
, 0, 0, m
, fn
);
int file_search
P((mnt_map
*m
, char *map
, char *key
, char **pval
, time_t *tp
));
int file_search(m
, map
, key
, pval
, tp
)
FILE *mapf
= file_open(map
, &t
);
error
= search_or_reload_file(mapf
, map
, key
, pval
, 0, 0);
int file_mtime
P((char *map
, time_t *tp
));
FILE *mapf
= file_open(map
, tp
);
#endif /* HAS_FILE_MAPS */