Home | History | Annotate | Line # | Download | only in common
tyname.c revision 1.56
      1  1.56    rillig /*	$NetBSD: tyname.c,v 1.56 2023/06/29 12:52:06 rillig Exp $	*/
      2   1.3     skrll 
      3   1.1  christos /*-
      4   1.1  christos  * Copyright (c) 2005 The NetBSD Foundation, Inc.
      5   1.1  christos  * All rights reserved.
      6   1.1  christos  *
      7   1.1  christos  * This code is derived from software contributed to The NetBSD Foundation
      8   1.1  christos  * by Christos Zoulas.
      9   1.1  christos  *
     10   1.1  christos  * Redistribution and use in source and binary forms, with or without
     11   1.1  christos  * modification, are permitted provided that the following conditions
     12   1.1  christos  * are met:
     13   1.1  christos  * 1. Redistributions of source code must retain the above copyright
     14   1.1  christos  *    notice, this list of conditions and the following disclaimer.
     15   1.1  christos  * 2. Redistributions in binary form must reproduce the above copyright
     16   1.1  christos  *    notice, this list of conditions and the following disclaimer in the
     17   1.1  christos  *    documentation and/or other materials provided with the distribution.
     18   1.1  christos  *
     19   1.1  christos  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20   1.1  christos  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21   1.1  christos  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22   1.1  christos  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23   1.1  christos  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24   1.1  christos  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25   1.1  christos  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26   1.1  christos  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27   1.1  christos  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28   1.1  christos  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29   1.1  christos  * POSSIBILITY OF SUCH DAMAGE.
     30   1.1  christos  */
     31   1.1  christos 
     32   1.1  christos #if HAVE_NBTOOL_CONFIG_H
     33   1.1  christos #include "nbtool_config.h"
     34   1.1  christos #endif
     35   1.1  christos 
     36   1.1  christos #include <sys/cdefs.h>
     37  1.51    rillig #if defined(__RCSID)
     38  1.56    rillig __RCSID("$NetBSD: tyname.c,v 1.56 2023/06/29 12:52:06 rillig Exp $");
     39   1.1  christos #endif
     40   1.1  christos 
     41  1.54    rillig #include <assert.h>
     42   1.1  christos #include <limits.h>
     43   1.8  christos #include <string.h>
     44   1.1  christos #include <stdlib.h>
     45   1.1  christos 
     46  1.39    rillig #if defined(IS_LINT1)
     47  1.39    rillig #include "lint1.h"
     48  1.39    rillig #else
     49  1.39    rillig #include "lint2.h"
     50  1.39    rillig #endif
     51   1.1  christos 
     52  1.20    rillig /* A tree of strings. */
     53  1.20    rillig typedef struct name_tree_node {
     54  1.44    rillig 	const char *ntn_name;
     55  1.20    rillig 	struct name_tree_node *ntn_less;
     56  1.20    rillig 	struct name_tree_node *ntn_greater;
     57  1.20    rillig } name_tree_node;
     58  1.20    rillig 
     59  1.20    rillig /* A growable string buffer. */
     60  1.20    rillig typedef struct buffer {
     61  1.20    rillig 	size_t	len;
     62  1.20    rillig 	size_t	cap;
     63  1.20    rillig 	char *	data;
     64  1.20    rillig } buffer;
     65  1.20    rillig 
     66  1.20    rillig static name_tree_node *type_names;
     67  1.20    rillig 
     68  1.20    rillig static name_tree_node *
     69  1.20    rillig new_name_tree_node(const char *name)
     70  1.20    rillig {
     71  1.20    rillig 	name_tree_node *n;
     72  1.20    rillig 
     73  1.37    rillig 	n = xmalloc(sizeof(*n));
     74  1.20    rillig 	n->ntn_name = xstrdup(name);
     75  1.20    rillig 	n->ntn_less = NULL;
     76  1.20    rillig 	n->ntn_greater = NULL;
     77  1.20    rillig 	return n;
     78  1.20    rillig }
     79  1.20    rillig 
     80  1.44    rillig /* Return the canonical instance of the string, with unlimited lifetime. */
     81  1.26    rillig static const char *
     82  1.20    rillig intern(const char *name)
     83  1.20    rillig {
     84  1.25    rillig 	name_tree_node *n = type_names, **next;
     85  1.20    rillig 	int cmp;
     86  1.20    rillig 
     87  1.20    rillig 	if (n == NULL) {
     88  1.20    rillig 		n = new_name_tree_node(name);
     89  1.20    rillig 		type_names = n;
     90  1.20    rillig 		return n->ntn_name;
     91  1.20    rillig 	}
     92  1.20    rillig 
     93  1.20    rillig 	while ((cmp = strcmp(name, n->ntn_name)) != 0) {
     94  1.25    rillig 		next = cmp < 0 ? &n->ntn_less : &n->ntn_greater;
     95  1.25    rillig 		if (*next == NULL) {
     96  1.25    rillig 			*next = new_name_tree_node(name);
     97  1.25    rillig 			return (*next)->ntn_name;
     98  1.20    rillig 		}
     99  1.25    rillig 		n = *next;
    100  1.20    rillig 	}
    101  1.20    rillig 	return n->ntn_name;
    102  1.20    rillig }
    103  1.20    rillig 
    104  1.20    rillig static void
    105  1.20    rillig buf_init(buffer *buf)
    106  1.20    rillig {
    107  1.20    rillig 	buf->len = 0;
    108  1.20    rillig 	buf->cap = 128;
    109  1.20    rillig 	buf->data = xmalloc(buf->cap);
    110  1.20    rillig 	buf->data[0] = '\0';
    111  1.20    rillig }
    112  1.20    rillig 
    113  1.20    rillig static void
    114  1.20    rillig buf_done(buffer *buf)
    115  1.20    rillig {
    116  1.20    rillig 	free(buf->data);
    117  1.20    rillig }
    118  1.20    rillig 
    119  1.20    rillig static void
    120  1.20    rillig buf_add(buffer *buf, const char *s)
    121  1.20    rillig {
    122  1.20    rillig 	size_t len = strlen(s);
    123  1.20    rillig 
    124  1.20    rillig 	while (buf->len + len + 1 >= buf->cap) {
    125  1.20    rillig 		buf->data = xrealloc(buf->data, 2 * buf->cap);
    126  1.20    rillig 		buf->cap = 2 * buf->cap;
    127  1.20    rillig 	}
    128  1.20    rillig 
    129  1.20    rillig 	memcpy(buf->data + buf->len, s, len + 1);
    130  1.20    rillig 	buf->len += len;
    131  1.20    rillig }
    132  1.20    rillig 
    133  1.20    rillig static void
    134  1.20    rillig buf_add_int(buffer *buf, int n)
    135  1.20    rillig {
    136  1.37    rillig 	char num[1 + sizeof(n) * CHAR_BIT + 1];
    137  1.20    rillig 
    138  1.45    rillig 	(void)snprintf(num, sizeof(num), "%d", n);
    139  1.20    rillig 	buf_add(buf, num);
    140  1.20    rillig }
    141  1.20    rillig 
    142   1.1  christos const char *
    143  1.18    rillig tspec_name(tspec_t t)
    144   1.1  christos {
    145  1.49    rillig 	const char *name = ttab[t].tt_name;
    146  1.54    rillig 	assert(name != NULL);
    147  1.48    rillig 	return name;
    148   1.1  christos }
    149   1.1  christos 
    150  1.21    rillig static void
    151  1.21    rillig type_name_of_function(buffer *buf, const type_t *tp)
    152  1.21    rillig {
    153  1.21    rillig 	const char *sep = "";
    154  1.21    rillig 
    155  1.21    rillig 	buf_add(buf, "(");
    156  1.21    rillig 	if (tp->t_proto) {
    157  1.50    rillig #ifdef IS_LINT1
    158  1.21    rillig 		sym_t *arg;
    159  1.21    rillig 
    160  1.42    rillig 		arg = tp->t_args;
    161  1.42    rillig 		if (arg == NULL)
    162  1.42    rillig 			buf_add(buf, "void");
    163  1.42    rillig 		for (; arg != NULL; arg = arg->s_next) {
    164  1.21    rillig 			buf_add(buf, sep), sep = ", ";
    165  1.21    rillig 			buf_add(buf, type_name(arg->s_type));
    166  1.21    rillig 		}
    167  1.50    rillig #else
    168  1.21    rillig 		type_t **argtype;
    169  1.21    rillig 
    170  1.42    rillig 		argtype = tp->t_args;
    171  1.42    rillig 		if (argtype == NULL)
    172  1.42    rillig 			buf_add(buf, "void");
    173  1.42    rillig 		for (; *argtype != NULL; argtype++) {
    174  1.21    rillig 			buf_add(buf, sep), sep = ", ";
    175  1.21    rillig 			buf_add(buf, type_name(*argtype));
    176  1.21    rillig 		}
    177  1.21    rillig #endif
    178  1.21    rillig 	}
    179  1.21    rillig 	if (tp->t_vararg) {
    180  1.22    rillig 		buf_add(buf, sep);
    181  1.21    rillig 		buf_add(buf, "...");
    182  1.21    rillig 	}
    183  1.21    rillig 	buf_add(buf, ") returning ");
    184  1.21    rillig 	buf_add(buf, type_name(tp->t_subt));
    185  1.21    rillig }
    186  1.21    rillig 
    187  1.32    rillig static void
    188  1.32    rillig type_name_of_struct_or_union(buffer *buf, const type_t *tp)
    189  1.32    rillig {
    190  1.32    rillig 	buf_add(buf, " ");
    191  1.50    rillig #ifdef IS_LINT1
    192  1.55    rillig 	if (tp->t_sou->sou_tag->s_name == unnamed &&
    193  1.55    rillig 	    tp->t_sou->sou_first_typedef != NULL) {
    194  1.32    rillig 		buf_add(buf, "typedef ");
    195  1.55    rillig 		buf_add(buf, tp->t_sou->sou_first_typedef->s_name);
    196  1.32    rillig 	} else {
    197  1.55    rillig 		buf_add(buf, tp->t_sou->sou_tag->s_name);
    198  1.32    rillig 	}
    199  1.32    rillig #else
    200  1.32    rillig 	buf_add(buf, tp->t_isuniqpos ? "*anonymous*" : tp->t_tag->h_name);
    201  1.32    rillig #endif
    202  1.32    rillig }
    203  1.32    rillig 
    204  1.32    rillig static void
    205  1.32    rillig type_name_of_enum(buffer *buf, const type_t *tp)
    206  1.32    rillig {
    207  1.32    rillig 	buf_add(buf, " ");
    208  1.50    rillig #ifdef IS_LINT1
    209  1.32    rillig 	if (tp->t_enum->en_tag->s_name == unnamed &&
    210  1.32    rillig 	    tp->t_enum->en_first_typedef != NULL) {
    211  1.32    rillig 		buf_add(buf, "typedef ");
    212  1.32    rillig 		buf_add(buf, tp->t_enum->en_first_typedef->s_name);
    213  1.32    rillig 	} else {
    214  1.32    rillig 		buf_add(buf, tp->t_enum->en_tag->s_name);
    215  1.32    rillig 	}
    216  1.32    rillig #else
    217  1.32    rillig 	buf_add(buf, tp->t_isuniqpos ? "*anonymous*" : tp->t_tag->h_name);
    218  1.32    rillig #endif
    219  1.32    rillig }
    220  1.32    rillig 
    221  1.33    rillig static void
    222  1.33    rillig type_name_of_array(buffer *buf, const type_t *tp)
    223  1.33    rillig {
    224  1.33    rillig 	buf_add(buf, "[");
    225  1.50    rillig #ifdef IS_LINT1
    226  1.33    rillig 	if (tp->t_incomplete_array)
    227  1.33    rillig 		buf_add(buf, "unknown_size");
    228  1.33    rillig 	else
    229  1.33    rillig 		buf_add_int(buf, tp->t_dim);
    230  1.33    rillig #else
    231  1.33    rillig 	buf_add_int(buf, tp->t_dim);
    232  1.33    rillig #endif
    233  1.33    rillig 	buf_add(buf, "]");
    234  1.34    rillig 	buf_add(buf, " of ");
    235  1.34    rillig 	buf_add(buf, type_name(tp->t_subt));
    236  1.33    rillig }
    237  1.33    rillig 
    238   1.1  christos const char *
    239  1.20    rillig type_name(const type_t *tp)
    240   1.1  christos {
    241  1.20    rillig 	tspec_t t;
    242  1.20    rillig 	buffer buf;
    243  1.20    rillig 	const char *name;
    244   1.1  christos 
    245  1.11  christos 	if (tp == NULL)
    246  1.11  christos 		return "(null)";
    247  1.20    rillig 
    248  1.29    rillig 	if ((t = tp->t_tspec) == INT && tp->t_is_enum)
    249   1.1  christos 		t = ENUM;
    250   1.1  christos 
    251  1.20    rillig 	buf_init(&buf);
    252   1.8  christos 	if (tp->t_const)
    253  1.20    rillig 		buf_add(&buf, "const ");
    254   1.8  christos 	if (tp->t_volatile)
    255  1.20    rillig 		buf_add(&buf, "volatile ");
    256  1.32    rillig 
    257  1.50    rillig #ifdef IS_LINT1
    258  1.55    rillig 	if (is_struct_or_union(t) && tp->t_sou->sou_incomplete)
    259  1.38    rillig 		buf_add(&buf, "incomplete ");
    260  1.38    rillig #endif
    261  1.20    rillig 	buf_add(&buf, tspec_name(t));
    262   1.1  christos 
    263  1.53    rillig #ifdef IS_LINT1
    264  1.53    rillig 	if (tp->t_bitfield) {
    265  1.53    rillig 		buf_add(&buf, ":");
    266  1.56    rillig 		buf_add_int(&buf, (int)tp->t_bit_field_width);
    267  1.53    rillig 	}
    268  1.53    rillig #endif
    269  1.53    rillig 
    270   1.1  christos 	switch (t) {
    271   1.1  christos 	case PTR:
    272  1.20    rillig 		buf_add(&buf, " to ");
    273  1.20    rillig 		buf_add(&buf, type_name(tp->t_subt));
    274   1.1  christos 		break;
    275   1.1  christos 	case ENUM:
    276  1.32    rillig 		type_name_of_enum(&buf, tp);
    277   1.1  christos 		break;
    278   1.1  christos 	case STRUCT:
    279   1.1  christos 	case UNION:
    280  1.32    rillig 		type_name_of_struct_or_union(&buf, tp);
    281   1.1  christos 		break;
    282   1.1  christos 	case ARRAY:
    283  1.33    rillig 		type_name_of_array(&buf, tp);
    284   1.1  christos 		break;
    285  1.21    rillig 	case FUNC:
    286  1.21    rillig 		type_name_of_function(&buf, tp);
    287  1.21    rillig 		break;
    288   1.1  christos 	default:
    289  1.46    rillig 		break;
    290   1.1  christos 	}
    291  1.20    rillig 
    292  1.20    rillig 	name = intern(buf.data);
    293  1.20    rillig 	buf_done(&buf);
    294  1.20    rillig 	return name;
    295   1.1  christos }
    296