Home | History | Annotate | Line # | Download | only in regex
regfree.c revision 1.17 
      1 /*	$NetBSD: regfree.c,v 1.17 2021/02/24 18:13:21 christos Exp $	*/
      2 
      3 /*-
      4  * SPDX-License-Identifier: BSD-3-Clause
      5  *
      6  * Copyright (c) 1992, 1993, 1994 Henry Spencer.
      7  * Copyright (c) 1992, 1993, 1994
      8  *	The Regents of the University of California.  All rights reserved.
      9  *
     10  * This code is derived from software contributed to Berkeley by
     11  * Henry Spencer.
     12  *
     13  * Redistribution and use in source and binary forms, with or without
     14  * modification, are permitted provided that the following conditions
     15  * are met:
     16  * 1. Redistributions of source code must retain the above copyright
     17  *    notice, this list of conditions and the following disclaimer.
     18  * 2. Redistributions in binary form must reproduce the above copyright
     19  *    notice, this list of conditions and the following disclaimer in the
     20  *    documentation and/or other materials provided with the distribution.
     21  * 3. Neither the name of the University nor the names of its contributors
     22  *    may be used to endorse or promote products derived from this software
     23  *    without specific prior written permission.
     24  *
     25  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     26  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     27  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     28  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     29  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     30  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     31  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     32  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     34  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     35  * SUCH DAMAGE.
     36  *
     37  *	@(#)regfree.c	8.3 (Berkeley) 3/20/94
     38  */
     39 
     40 #include <sys/cdefs.h>
     41 #if 0
     42 static char sccsid[] = "@(#)regfree.c	8.3 (Berkeley) 3/20/94";
     43 __FBSDID("$FreeBSD: head/lib/libc/regex/regfree.c 326025 2017-11-20 19:49:47Z pfg $");
     44 #endif
     45 __RCSID("$NetBSD: regfree.c,v 1.17 2021/02/24 18:13:21 christos Exp $");
     46 
     47 #include "namespace.h"
     48 #include <sys/types.h>
     49 #include <stdio.h>
     50 #include <stdlib.h>
     51 #include <limits.h>
     52 #include <regex.h>
     53 
     54 #ifdef __weak_alias
     55 __weak_alias(regfree,_regfree)
     56 #endif
     57 #include <wchar.h>
     58 #include <wctype.h>
     59 
     60 #include "utils.h"
     61 #include "regex2.h"
     62 
     63 /*
     64  - regfree - free everything
     65  = extern void regfree(regex_t *);
     66  */
     67 void
     68 regfree(regex_t *preg)
     69 {
     70 	struct re_guts *g;
     71 	unsigned int i;
     72 
     73 	_DIAGASSERT(preg != NULL);
     74 
     75 	_DIAGASSERT(preg->re_magic == MAGIC1);
     76 	if (preg->re_magic != MAGIC1)	/* oops */
     77 		return;			/* nice to complain, but hard */
     78 
     79 	g = preg->re_g;
     80 	if (g == NULL || g->magic != MAGIC2)	/* oops again */
     81 		return;
     82 	preg->re_magic = 0;		/* mark it invalid */
     83 	g->magic = 0;			/* mark it invalid */
     84 
     85 	if (g->strip != NULL)
     86 		free(g->strip);
     87 	if (g->sets != NULL) {
     88 		for (i = 0; i < g->ncsets; i++) {
     89 			free(g->sets[i].ranges);
     90 			free(g->sets[i].wides);
     91 			free(g->sets[i].types);
     92 		}
     93 		free(g->sets);
     94 	}
     95 	if (g->must != NULL)
     96 		free(g->must);
     97 	if (g->charjump != NULL)
     98 		free(&g->charjump[CHAR_MIN]);
     99 	if (g->matchjump != NULL)
    100 		free(g->matchjump);
    101 	free(g);
    102 }
    103