Home | History | Annotate | Line # | Download | only in netgroup_mkdb
str.c revision 1.6 
      1 /*	$NetBSD: str.c,v 1.6 2006/08/26 18:15:37 christos Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1994 Christos Zoulas
      5  * All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     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  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by Christos Zoulas.
     18  * 4. The name of the author may not be used to endorse or promote products
     19  *    derived from this software without specific prior written permission.
     20  *
     21  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
     22  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
     23  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
     25  * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  * SUCH DAMAGE.
     32  */
     33 
     34 #include <sys/cdefs.h>
     35 #ifndef lint
     36 __RCSID("$NetBSD: str.c,v 1.6 2006/08/26 18:15:37 christos Exp $");
     37 #endif
     38 
     39 /*
     40  * Counted strings
     41  */
     42 #include <stdlib.h>
     43 #include <string.h>
     44 #include <err.h>
     45 #include <util.h>
     46 
     47 #include "str.h"
     48 
     49 /*
     50  * str_init(): Initialize string
     51  */
     52 void
     53 str_init(struct string  *s)
     54 {
     55 	s->s_str = NULL;
     56 	s->s_len = 0;
     57 }
     58 
     59 
     60 /*
     61  * str_append(): Append string allocating buffer as necessary
     62  */
     63 void
     64 str_append(struct string  *buf, const char *str, int del)
     65 {
     66 	size_t          len = strlen(str) + 1;
     67 
     68 	if (buf->s_str == NULL)
     69 		buf->s_str = emalloc(len);
     70 	else {
     71 		buf->s_str = erealloc(buf->s_str, buf->s_len + len +
     72 						  (del ? 2 : 1));
     73 		if (del)
     74 			buf->s_str[buf->s_len++] = del;
     75 	}
     76 
     77 	memcpy(&buf->s_str[buf->s_len], str, len);
     78 	buf->s_len += len - 1;
     79 }
     80 
     81 /*
     82  * str_prepend(): Prepend string allocating buffer as necessary
     83  */
     84 void
     85 str_prepend(struct string *buf, const char *str, int del)
     86 {
     87 	char           *ptr, *sptr;
     88 	size_t          len = strlen(str) + 1;
     89 
     90 	sptr = ptr = emalloc(buf->s_len + len + (del ? 2 : 1));
     91 
     92 	if (del)
     93 		*ptr++ = del;
     94 
     95 	memcpy(ptr, str, len);
     96 
     97 	if (buf->s_str) {
     98 		memcpy(&ptr[len - 1], buf->s_str, buf->s_len + 1);
     99 		free(buf->s_str);
    100 	}
    101 
    102 	buf->s_str = sptr;
    103 	buf->s_len += del ? len : len - 1;
    104 }
    105 
    106 /*
    107  * str_free(): Free a string
    108  */
    109 void
    110 str_free(struct string *s)
    111 {
    112 	free(s->s_str);
    113 	s->s_str = NULL;
    114 	s->s_len = 0;
    115 }
    116