1998-10-07 17:32:49 +00:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Simple property list handling code.
|
|
|
|
*
|
|
|
|
* Copyright (c) 1998
|
|
|
|
* Jordan Hubbard. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer,
|
|
|
|
* verbatim and that no modifications are made prior to this
|
|
|
|
* point in the file.
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR OR HIS PETS 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, LIFE 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
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2001-09-30 22:35:07 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
1998-10-07 17:32:49 +00:00
|
|
|
#include <ctype.h>
|
1998-10-09 11:24:20 +00:00
|
|
|
#include <unistd.h>
|
1998-10-07 17:32:49 +00:00
|
|
|
#include <stdlib.h>
|
1998-10-09 11:24:20 +00:00
|
|
|
#include <stdio.h>
|
1998-10-07 17:32:49 +00:00
|
|
|
#include <string.h>
|
1998-11-22 13:20:09 +00:00
|
|
|
#include <err.h>
|
1998-10-08 01:56:49 +00:00
|
|
|
#include <sys/types.h>
|
1998-10-07 17:32:49 +00:00
|
|
|
#include <libutil.h>
|
|
|
|
|
|
|
|
static properties
|
|
|
|
property_alloc(char *name, char *value)
|
|
|
|
{
|
|
|
|
properties n;
|
|
|
|
|
2003-01-19 03:05:01 +00:00
|
|
|
if ((n = (properties)malloc(sizeof(struct _property))) == NULL)
|
|
|
|
return (NULL);
|
1998-10-07 17:32:49 +00:00
|
|
|
n->next = NULL;
|
2003-01-19 03:05:01 +00:00
|
|
|
if (name != NULL) {
|
|
|
|
if ((n->name = strdup(name)) == NULL) {
|
|
|
|
free(n);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
n->name = NULL;
|
|
|
|
if (value != NULL) {
|
|
|
|
if ((n->value = strdup(value)) == NULL) {
|
|
|
|
free(n->name);
|
|
|
|
free(n);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
n->value = NULL;
|
|
|
|
return (n);
|
1998-10-07 17:32:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
properties
|
1998-10-09 07:32:38 +00:00
|
|
|
properties_read(int fd)
|
1998-10-07 17:32:49 +00:00
|
|
|
{
|
|
|
|
properties head, ptr;
|
2000-11-08 11:57:03 +00:00
|
|
|
char hold_n[PROPERTY_MAX_NAME + 1];
|
|
|
|
char hold_v[PROPERTY_MAX_VALUE + 1];
|
1998-10-07 17:32:49 +00:00
|
|
|
char buf[BUFSIZ * 4];
|
|
|
|
int bp, n, v, max;
|
|
|
|
enum { LOOK, COMMENT, NAME, VALUE, MVALUE, COMMIT, FILL, STOP } state;
|
1998-11-22 13:20:09 +00:00
|
|
|
int ch = 0, blevel = 0;
|
1998-10-07 17:32:49 +00:00
|
|
|
|
|
|
|
n = v = bp = max = 0;
|
|
|
|
head = ptr = NULL;
|
|
|
|
state = LOOK;
|
|
|
|
while (state != STOP) {
|
|
|
|
if (state != COMMIT) {
|
|
|
|
if (bp == max)
|
|
|
|
state = FILL;
|
|
|
|
else
|
|
|
|
ch = buf[bp++];
|
|
|
|
}
|
|
|
|
switch(state) {
|
|
|
|
case FILL:
|
1998-10-09 07:32:38 +00:00
|
|
|
if ((max = read(fd, buf, sizeof buf)) <= 0) {
|
1998-10-07 17:32:49 +00:00
|
|
|
state = STOP;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
state = LOOK;
|
|
|
|
ch = buf[0];
|
|
|
|
bp = 1;
|
|
|
|
}
|
2002-08-25 13:10:45 +00:00
|
|
|
/* FALLTHROUGH deliberately since we already have a character and state == LOOK */
|
1998-10-07 17:32:49 +00:00
|
|
|
|
|
|
|
case LOOK:
|
2003-01-19 03:05:01 +00:00
|
|
|
if (isspace((unsigned char)ch))
|
1998-10-07 17:32:49 +00:00
|
|
|
continue;
|
|
|
|
/* Allow shell or lisp style comments */
|
|
|
|
else if (ch == '#' || ch == ';') {
|
|
|
|
state = COMMENT;
|
|
|
|
continue;
|
|
|
|
}
|
2003-01-19 03:05:01 +00:00
|
|
|
else if (isalnum((unsigned char)ch) || ch == '_') {
|
2000-11-08 11:57:03 +00:00
|
|
|
if (n >= PROPERTY_MAX_NAME) {
|
1998-10-07 17:32:49 +00:00
|
|
|
n = 0;
|
|
|
|
state = COMMENT;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
hold_n[n++] = ch;
|
|
|
|
state = NAME;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
state = COMMENT; /* Ignore the rest of the line */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case COMMENT:
|
|
|
|
if (ch == '\n')
|
|
|
|
state = LOOK;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case NAME:
|
|
|
|
if (ch == '\n' || !ch) {
|
|
|
|
hold_n[n] = '\0';
|
|
|
|
hold_v[0] = '\0';
|
|
|
|
v = n = 0;
|
|
|
|
state = COMMIT;
|
|
|
|
}
|
2003-01-19 03:05:01 +00:00
|
|
|
else if (isspace((unsigned char)ch))
|
1998-10-07 17:32:49 +00:00
|
|
|
continue;
|
|
|
|
else if (ch == '=') {
|
|
|
|
hold_n[n] = '\0';
|
|
|
|
v = n = 0;
|
|
|
|
state = VALUE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
hold_n[n++] = ch;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case VALUE:
|
2000-11-09 00:28:22 +00:00
|
|
|
if (v == 0 && ch == '\n') {
|
|
|
|
hold_v[v] = '\0';
|
|
|
|
v = n = 0;
|
|
|
|
state = COMMIT;
|
|
|
|
}
|
2003-01-19 03:05:01 +00:00
|
|
|
else if (v == 0 && isspace((unsigned char)ch))
|
1998-10-07 17:32:49 +00:00
|
|
|
continue;
|
1998-11-22 13:20:09 +00:00
|
|
|
else if (ch == '{') {
|
1998-10-07 17:32:49 +00:00
|
|
|
state = MVALUE;
|
1998-11-22 13:20:09 +00:00
|
|
|
++blevel;
|
|
|
|
}
|
1998-10-07 17:32:49 +00:00
|
|
|
else if (ch == '\n' || !ch) {
|
|
|
|
hold_v[v] = '\0';
|
|
|
|
v = n = 0;
|
|
|
|
state = COMMIT;
|
|
|
|
}
|
|
|
|
else {
|
2000-11-08 11:57:03 +00:00
|
|
|
if (v >= PROPERTY_MAX_VALUE) {
|
1998-10-07 17:32:49 +00:00
|
|
|
state = COMMENT;
|
|
|
|
v = n = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
hold_v[v++] = ch;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case MVALUE:
|
|
|
|
/* multiline value */
|
2000-11-08 11:57:03 +00:00
|
|
|
if (v >= PROPERTY_MAX_VALUE) {
|
1998-11-22 13:20:09 +00:00
|
|
|
warn("properties_read: value exceeds max length");
|
1998-10-07 17:32:49 +00:00
|
|
|
state = COMMENT;
|
|
|
|
n = v = 0;
|
|
|
|
}
|
1998-11-22 13:20:09 +00:00
|
|
|
else if (ch == '}' && !--blevel) {
|
1998-10-07 17:32:49 +00:00
|
|
|
hold_v[v] = '\0';
|
|
|
|
v = n = 0;
|
|
|
|
state = COMMIT;
|
|
|
|
}
|
1998-11-22 13:20:09 +00:00
|
|
|
else {
|
1998-10-07 17:32:49 +00:00
|
|
|
hold_v[v++] = ch;
|
1998-11-22 13:20:09 +00:00
|
|
|
if (ch == '{')
|
|
|
|
++blevel;
|
|
|
|
}
|
1998-10-07 17:32:49 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case COMMIT:
|
2003-01-19 03:05:01 +00:00
|
|
|
if (head == NULL) {
|
|
|
|
if ((head = ptr = property_alloc(hold_n, hold_v)) == NULL)
|
|
|
|
return (NULL);
|
|
|
|
} else {
|
|
|
|
if ((ptr->next = property_alloc(hold_n, hold_v)) == NULL) {
|
|
|
|
properties_free(head);
|
|
|
|
return (NULL);
|
|
|
|
}
|
1998-10-07 17:32:49 +00:00
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
state = LOOK;
|
|
|
|
v = n = 0;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case STOP:
|
|
|
|
/* we don't handle this here, but this prevents warnings */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2003-01-19 03:05:01 +00:00
|
|
|
return (head);
|
1998-10-07 17:32:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
property_find(properties list, const char *name)
|
|
|
|
{
|
|
|
|
if (!list || !name || !name[0])
|
|
|
|
return NULL;
|
|
|
|
while (list) {
|
|
|
|
if (!strcmp(list->name, name))
|
|
|
|
return list->value;
|
|
|
|
list = list->next;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
properties_free(properties list)
|
|
|
|
{
|
|
|
|
properties tmp;
|
|
|
|
|
|
|
|
while (list) {
|
|
|
|
tmp = list->next;
|
|
|
|
if (list->name)
|
|
|
|
free(list->name);
|
|
|
|
if (list->value)
|
|
|
|
free(list->value);
|
|
|
|
free(list);
|
|
|
|
list = tmp;
|
|
|
|
}
|
|
|
|
}
|