jcs.org
jcs's openbsd hax
openbsd
1/* $OpenBSD: generate.c,v 1.19 2025/11/27 09:08:49 tb Exp $ */
2
3/*
4 * Copyright (c) 2001 Marc Espie.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
16 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
18 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
19 * PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
20 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
21 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 */
27
28#include <stddef.h>
29#include <stdint.h>
30#include <stdio.h>
31#include <stdlib.h>
32#include <limits.h>
33#include <ohash.h>
34
35#include "stats.h"
36#include "cond_int.h"
37#include "var_int.h"
38#include "node_int.h"
39
40#define M(x) x, #x
41char *table_var[] = {
42 M(TARGET),
43 M(OODATE),
44 M(ALLSRC),
45 M(IMPSRC),
46 M(PREFIX),
47 M(ARCHIVE),
48 M(MEMBER),
49 M(LONGTARGET),
50 M(LONGOODATE),
51 M(LONGALLSRC),
52 M(LONGIMPSRC),
53 M(LONGPREFIX),
54 M(LONGARCHIVE),
55 M(LONGMEMBER),
56 NULL
57};
58
59char *table_cond[] = {
60 M(COND_IF),
61 M(COND_IFDEF),
62 M(COND_IFNDEF),
63 M(COND_IFMAKE),
64 M(COND_IFNMAKE),
65 M(COND_ELSE),
66 M(COND_ELIF),
67 M(COND_ELIFDEF),
68 M(COND_ELIFNDEF),
69 M(COND_ELIFMAKE),
70 M(COND_ELIFNMAKE),
71 M(COND_ENDIF),
72 M(COND_FOR),
73 M(COND_ENDFOR),
74 M(COND_INCLUDE),
75 M(COND_UNDEF),
76 M(COND_POISON),
77 NULL
78};
79
80char *table_nodes[] = {
81 M(NODE_DEFAULT),
82 M(NODE_EXEC),
83 M(NODE_IGNORE),
84 M(NODE_INCLUDES),
85 M(NODE_INVISIBLE),
86 M(NODE_JOIN),
87 M(NODE_LIBS),
88 M(NODE_MADE),
89 M(NODE_MAIN),
90 M(NODE_MAKE),
91 M(NODE_MAKEFLAGS),
92 M(NODE_MFLAGS),
93 M(NODE_NOTMAIN),
94 M(NODE_NOTPARALLEL),
95 M(NODE_NO_PARALLEL),
96 M(NODE_NULL),
97 M(NODE_OPTIONAL),
98 M(NODE_ORDER),
99 M(NODE_PARALLEL),
100 M(NODE_PATH),
101 M(NODE_PHONY),
102 M(NODE_PRECIOUS),
103 M(NODE_RECURSIVE),
104 M(NODE_SILENT),
105 M(NODE_SINGLESHELL),
106 M(NODE_SUFFIXES),
107 M(NODE_USE),
108 M(NODE_WAIT),
109 M(NODE_BEGIN),
110 M(NODE_END),
111 M(NODE_INTERRUPT),
112 M(NODE_CHEAP),
113 M(NODE_EXPENSIVE),
114 M(NODE_POSIX),
115 M(NODE_SCCS_GET),
116 NULL
117};
118
119
120char **table[] = {
121 table_var,
122 table_cond,
123 table_nodes
124};
125
126int
127main(int argc, char *argv[])
128{
129 uint32_t i;
130 uint32_t v;
131 uint32_t h;
132 uint32_t slots;
133 const char *errstr;
134 const char *e;
135 char **occupied;
136 char **t;
137 int tn;
138
139 Init_Stats();
140 if (argc != 3)
141 exit(1);
142
143 tn = strtonum(argv[1], 1, INT_MAX, &errstr);
144 if (errstr)
145 exit(1);
146 t = table[tn-1];
147 slots = strtonum(argv[2], 0, INT_MAX, &errstr);
148 if (errstr)
149 exit(1);
150 if (slots) {
151 occupied = calloc(slots, sizeof(char *));
152 if (!occupied)
153 exit(1);
154 } else
155 occupied = NULL;
156
157 printf("/* File created by generate %d %d, do not edit */\n",
158 tn, slots);
159 for (i = 0; t[i] != NULL; i++) {
160 e = NULL;
161 v = ohash_interval(t[i], &e);
162 if (slots) {
163 h = v % slots;
164 if (occupied[h]) {
165 fprintf(stderr,
166 "Collision: %s / %s (%d)\n", occupied[h],
167 t[i], h);
168 exit(1);
169 }
170 occupied[h] = t[i];
171 }
172 i++;
173 printf("#define K_%s %u\n", t[i], v);
174 }
175 if (slots)
176 printf("#define MAGICSLOTS%d %u\n", tn, slots);
177 exit(0);
178}