Annotation of src/usr.bin/make/generate.c, Revision 1.17
1.17 ! deraadt 1: /* $OpenBSD: generate.c,v 1.16 2014/05/18 08:08:50 espie Exp $ */
1.1 espie 2:
1.4 espie 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>
1.15 espie 29: #include <stdint.h>
1.1 espie 30: #include <stdio.h>
31: #include <stdlib.h>
1.17 ! deraadt 32: #include <limits.h>
1.15 espie 33: #include <ohash.h>
1.1 espie 34:
1.3 espie 35: #include "stats.h"
36: #include "cond_int.h"
1.4 espie 37: #include "var_int.h"
1.9 espie 38: #include "node_int.h"
1.1 espie 39:
40: #define M(x) x, #x
1.3 espie 41: char *table_var[] = {
1.1 espie 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),
1.3 espie 55: M(LONGMEMBER),
56: M(FTARGET),
57: M(DTARGET),
58: M(FPREFIX),
59: M(DPREFIX),
60: M(FARCHIVE),
61: M(DARCHIVE),
62: M(FMEMBER),
63: M(DMEMBER),
64: NULL
1.1 espie 65: };
66:
1.3 espie 67: char *table_cond[] = {
68: M(COND_IF),
69: M(COND_IFDEF),
70: M(COND_IFNDEF),
71: M(COND_IFMAKE),
72: M(COND_IFNMAKE),
73: M(COND_ELSE),
1.5 espie 74: M(COND_ELIF),
1.3 espie 75: M(COND_ELIFDEF),
76: M(COND_ELIFNDEF),
77: M(COND_ELIFMAKE),
78: M(COND_ELIFNMAKE),
79: M(COND_ENDIF),
80: M(COND_FOR),
1.5 espie 81: M(COND_ENDFOR),
1.3 espie 82: M(COND_INCLUDE),
83: M(COND_UNDEF),
1.7 espie 84: M(COND_POISON),
1.3 espie 85: NULL
86: };
87:
1.9 espie 88: char *table_nodes[] = {
89: M(NODE_DEFAULT),
90: M(NODE_EXEC),
91: M(NODE_IGNORE),
92: M(NODE_INCLUDES),
93: M(NODE_INVISIBLE),
94: M(NODE_JOIN),
95: M(NODE_LIBS),
96: M(NODE_MADE),
97: M(NODE_MAIN),
98: M(NODE_MAKE),
99: M(NODE_MAKEFLAGS),
100: M(NODE_MFLAGS),
101: M(NODE_NOTMAIN),
102: M(NODE_NOTPARALLEL),
103: M(NODE_NO_PARALLEL),
104: M(NODE_NULL),
105: M(NODE_OPTIONAL),
106: M(NODE_ORDER),
107: M(NODE_PARALLEL),
108: M(NODE_PATH),
109: M(NODE_PHONY),
110: M(NODE_PRECIOUS),
111: M(NODE_RECURSIVE),
112: M(NODE_SILENT),
113: M(NODE_SINGLESHELL),
114: M(NODE_SUFFIXES),
115: M(NODE_USE),
116: M(NODE_WAIT),
117: M(NODE_BEGIN),
118: M(NODE_END),
119: M(NODE_INTERRUPT),
1.13 espie 120: M(NODE_CHEAP),
121: M(NODE_EXPENSIVE),
1.14 espie 122: M(NODE_POSIX),
123: M(NODE_SCCS_GET),
1.9 espie 124: NULL
125: };
126:
1.3 espie 127:
128: char **table[] = {
129: table_var,
1.9 espie 130: table_cond,
131: table_nodes
1.3 espie 132: };
1.1 espie 133:
134: int
135: main(int argc, char *argv[])
136: {
1.6 espie 137: uint32_t i;
138: uint32_t v;
139: uint32_t h;
140: uint32_t slots;
1.17 ! deraadt 141: const char *errstr;
1.1 espie 142: const char *e;
143: char **occupied;
1.3 espie 144: char **t;
145: int tn;
1.1 espie 146:
147: Init_Stats();
1.3 espie 148: if (argc != 3)
1.1 espie 149: exit(1);
150:
1.17 ! deraadt 151: tn = strtonum(argv[1], 1, INT_MAX, &errstr);
! 152: if (errstr)
1.1 espie 153: exit(1);
1.3 espie 154: t = table[tn-1];
1.17 ! deraadt 155: slots = strtonum(argv[2], 0, INT_MAX, &errstr);
! 156: if (errstr)
! 157: exit(1);
1.3 espie 158: if (slots) {
1.16 espie 159: occupied = calloc(slots, sizeof(char *));
1.3 espie 160: if (!occupied)
161: exit(1);
162: } else
163: occupied = NULL;
164:
1.10 espie 165: printf("/* File created by generate %d %d, do not edit */\n",
1.3 espie 166: tn, slots);
167: for (i = 0; t[i] != NULL; i++) {
1.1 espie 168: e = NULL;
1.3 espie 169: v = ohash_interval(t[i], &e);
170: if (slots) {
171: h = v % slots;
172: if (occupied[h]) {
1.10 espie 173: fprintf(stderr,
1.3 espie 174: "Collision: %s / %s (%d)\n", occupied[h],
175: t[i], h);
176: exit(1);
177: }
178: occupied[h] = t[i];
1.1 espie 179: }
1.3 espie 180: i++;
181: printf("#define K_%s %u\n", t[i], v);
1.1 espie 182: }
1.3 espie 183: if (slots)
184: printf("#define MAGICSLOTS%d %u\n", tn, slots);
1.1 espie 185: exit(0);
186: }