ucx/properties.c

Sun, 14 Jul 2013 17:11:34 +0200

author
Olaf Wintermann <olaf.wintermann@gmail.com>
date
Sun, 14 Jul 2013 17:11:34 +0200
changeset 109
75cb6590358b
parent 108
d2b1e67b2b48
child 110
1cf71e56f01e
permissions
-rw-r--r--

added properties load/store functions

     1 /*
     2  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
     3  *
     4  * Copyright 2013 Olaf Wintermann. All rights reserved.
     5  *
     6  * Redistribution and use in source and binary forms, with or without
     7  * modification, are permitted provided that the following conditions are met:
     8  *
     9  *   1. Redistributions of source code must retain the above copyright
    10  *      notice, this list of conditions and the following disclaimer.
    11  *
    12  *   2. Redistributions in binary form must reproduce the above copyright
    13  *      notice, this list of conditions and the following disclaimer in the
    14  *      documentation and/or other materials provided with the distribution.
    15  *
    16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    17  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    19  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
    20  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    21  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    22  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    23  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    24  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    25  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    26  * POSSIBILITY OF SUCH DAMAGE.
    27  */
    29 #include <stdio.h>
    30 #include <stdlib.h>
    31 #include <string.h>
    33 #include "properties.h"
    35 UcxPropParser *ucx_prop_new() {
    36     UcxPropParser *parser = (UcxPropParser*)malloc(
    37             sizeof(UcxPropParser));
    38     if(!parser) {
    39         return NULL;
    40     }
    42     parser->buffer = NULL;
    43     parser->buflen = 0;
    44     parser->pos = 0;
    45     parser->tmp = NULL;
    46     parser->tmplen = 0;
    47     parser->tmpcap = 0;
    48     parser->error = 0;
    49     parser->delimiter = '=';
    50     parser->comment1 = '#';
    51     parser->comment2 = 0;
    52     parser->comment3 = 0;   
    54     return parser;
    55 }
    57 void ucx_prop_free(UcxPropParser *parser) {
    58     if(parser->tmp) {
    59         free(parser->tmp);
    60     }
    61     free(parser);
    62 }
    64 void ucx_prop_fill(UcxPropParser *parser, char *buf, size_t len) {
    65     parser->buffer = buf;
    66     parser->buflen = len;
    67     parser->pos = 0;
    68 }
    70 static void parser_tmp_append(UcxPropParser *parser, char *buf, size_t len) {
    71     if(parser->tmpcap - parser->tmplen < len) {
    72         size_t newcap = parser->tmpcap + len + 64;
    73         parser->tmp = (char*)realloc(parser->tmp, newcap);
    74         parser->tmpcap = newcap;
    75     }
    76     memcpy(parser->tmp + parser->tmplen, buf, len);
    77     parser->tmplen += len;
    78 }
    80 int ucx_prop_parse(UcxPropParser *parser, sstr_t *name, sstr_t *value)  {   
    81     if(parser->tmplen > 0) {
    82         char *buf = parser->buffer + parser->pos;
    83         size_t len = parser->buflen - parser->pos;
    84         sstr_t str = sstrn(buf, len);
    85         sstr_t nl = sstrchr(str, '\n');
    86         if(nl.ptr) {
    87             size_t newlen = (size_t)(nl.ptr - buf) + 1;
    88             parser_tmp_append(parser, buf, newlen);
    89             // the tmp buffer contains exactly one line now
    91             char *orig_buf = parser->buffer;
    92             size_t orig_len = parser->buflen;
    94             parser->buffer = parser->tmp;
    95             parser->buflen = parser->tmplen;
    96             parser->pos = 0;    
    97             parser->tmp = NULL;
    98             parser->tmpcap = 0;
    99             parser->tmplen = 0;
   100             // run parse with the tmp buffer as main buffer
   101             int ret = ucx_prop_parse(parser, name, value);
   103             // restore original buffer
   104             parser->tmp = parser->buffer;
   105             parser->buffer = orig_buf;
   106             parser->buflen = orig_len;
   107             parser->pos = newlen;
   109             /*
   110              * if ret == 0 the tmp buffer contained just space or a comment
   111              * we parse again with the original buffer to get a name/value
   112              * or a new tmp buffer
   113              */
   114             return ret ? ret : ucx_prop_parse(parser, name, value);
   115         } else {
   116             parser_tmp_append(parser, buf, len);
   117             return 0;
   118         }
   119     } else if(parser->tmp) {
   120         free(parser->tmp);
   121         parser->tmp = NULL;
   122     }
   124     char comment1 = parser->comment1;
   125     char comment2 = parser->comment2;
   126     char comment3 = parser->comment3;
   127     char delimiter = parser->delimiter;
   129     // get one line and parse it
   130     while(parser->pos < parser->buflen) {
   131         char *buf = parser->buffer + parser->pos;
   132         size_t len = parser->buflen - parser->pos;
   134         /*
   135          * First we check if we have at least one line. We also get indices of
   136          * delimiter and comment chars
   137          */
   138         size_t delimiter_index = 0;
   139         size_t comment_index = 0;
   140         int has_comment = 0;
   142         size_t i = 0;
   143         char c = 0;
   144         for(;i<len;i++) {
   145             c = buf[i];
   146             if(c == comment1 || c == comment2 || c == comment3) {
   147                 if(comment_index == 0) {
   148                     comment_index = i;
   149                     has_comment = 1;
   150                 }
   151             } else if(c == delimiter) {
   152                 if(delimiter_index == 0 && !has_comment) {
   153                     delimiter_index = i;
   154                 }
   155             } else if(c == '\n') {
   156                 break;
   157             }
   158         }
   160         if(c != '\n') {
   161             // we don't have enough data for a line
   162             // store remaining bytes in temporary buffer for next round
   163             parser->tmpcap = len + 128;
   164             parser->tmp = (char*)malloc(parser->tmpcap);
   165             parser->tmplen = len;
   166             memcpy(parser->tmp, buf, len);
   167             return 0;
   168         }
   170         sstr_t line = has_comment ? sstrn(buf, comment_index) : sstrn(buf, i);
   171         // check line
   172         if(delimiter_index == 0) {
   173             line = sstrtrim(line);
   174             if(line.length != 0) {
   175                 parser->error = 1;
   176             }
   177         } else {
   178             sstr_t n = sstrn(buf, delimiter_index);
   179             sstr_t v = sstrn(buf+delimiter_index+1, i-delimiter_index-1); 
   180             n = sstrtrim(n);
   181             v = sstrtrim(v);
   182             if(n.length != 0 || v.length != 0) {
   183                 *name = n;
   184                 *value = v;
   185                 parser->pos += i + 1;
   186                 return 1;
   187             } else {
   188                 parser->error = 1;
   189             }
   190         }
   192         parser->pos += i + 1;
   193     }
   195     return 0;
   196 }
   198 int ucx_prop_parse2map(UcxPropParser *parser, UcxMap *map) {
   199     sstr_t name;
   200     sstr_t value;
   201     while(ucx_prop_parse(parser, &name, &value)) {
   202         name = sstrdup_alloc(map->allocator, name);
   203         if(!name.ptr) {
   204             return 1;
   205         }
   206         value = sstrdup_alloc(map->allocator, value);
   207         if(!value.ptr) {
   208             map->allocator->free(map->allocator->pool, value.ptr);
   209             return 1;
   210         }
   211         if(ucx_map_sstr_put(map, name, value.ptr)) {
   212             map->allocator->free(map->allocator->pool, name.ptr);
   213             map->allocator->free(map->allocator->pool, value.ptr);
   214             return 1;
   215         }
   216     }
   217     if(parser->error) {
   218         return 1;
   219     } else {
   220         return 0;
   221     }
   222 }
   224 int ucx_properties_load(UcxMap *map, FILE *file) {
   225     UcxPropParser *parser = ucx_prop_new();
   226     if(!parser || !map || !file) {
   227         return 1;
   228     }
   230     int error = 0;
   231     size_t r;
   232     char buf[1024];
   233     while((r = fread(buf, 1, 1024, file)) != 0) {
   234         ucx_prop_fill(parser, buf, r);
   235         if(ucx_prop_parse2map(parser, map)) {
   236             error = 1;
   237             break;
   238         }
   239     }
   241     ucx_prop_free(parser);
   242     return error;
   243 }
   245 int ucx_properties_store(UcxMap *map, FILE *file) {
   246     UcxMapIterator iter = ucx_map_iterator(map);
   247     char *k, *v;
   248     sstr_t key, value;
   249     size_t written;
   251     UCX_MAP_FOREACH(v, iter) {
   252         k = (char*) iter.cur->key.data;
   253         key = sstrn(k, iter.cur->key.len);
   254         value = sstr(v);
   256         written = 0;
   257         written += fwrite(key.ptr, 1, key.length, file);
   258         written += fwrite(" = ", 1, 3, file);
   259         written += fwrite(value.ptr, 1, value.length, file);
   260         written += fwrite("\n", 1, 1, file);
   262         if (written != key.length + value.length + 4) return 1;
   263     }
   265     return 0;
   266 }

mercurial