150764Smarkm/* 2233294Sstas * Copyright (c) 1998 - 2000 Kungliga Tekniska H��gskolan 3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4233294Sstas * All rights reserved. 550764Smarkm * 6233294Sstas * Redistribution and use in source and binary forms, with or without 7233294Sstas * modification, are permitted provided that the following conditions 8233294Sstas * are met: 950764Smarkm * 10233294Sstas * 1. Redistributions of source code must retain the above copyright 11233294Sstas * notice, this list of conditions and the following disclaimer. 1250764Smarkm * 13233294Sstas * 2. Redistributions in binary form must reproduce the above copyright 14233294Sstas * notice, this list of conditions and the following disclaimer in the 15233294Sstas * documentation and/or other materials provided with the distribution. 1650764Smarkm * 17233294Sstas * 3. Neither the name of the Institute nor the names of its contributors 18233294Sstas * may be used to endorse or promote products derived from this software 19233294Sstas * without specific prior written permission. 2050764Smarkm * 21233294Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22233294Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23233294Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24233294Sstas * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25233294Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26233294Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27233294Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28233294Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29233294Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30233294Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31233294Sstas * SUCH DAMAGE. 3250764Smarkm */ 3350764Smarkm 34233294Sstas/* $Id$ */ 3550764Smarkm 3650764Smarkm#ifndef __COMPILE_ET_H__ 3750764Smarkm#define __COMPILE_ET_H__ 3850764Smarkm 39178846Sdfr#include <err.h> 4050764Smarkm#include <stdio.h> 4150764Smarkm#include <string.h> 4250764Smarkm#include <stdlib.h> 4350764Smarkm#include <stdarg.h> 4450764Smarkm#include <ctype.h> 4550764Smarkm 46178846Sdfrextern long base_id; 4750764Smarkmextern int number; 4850764Smarkmextern char *prefix; 4950764Smarkmextern char name[128]; 5050764Smarkmextern char *id_str; 5150764Smarkmextern char *filename; 5250764Smarkmextern int numerror; 5350764Smarkm 5450764Smarkmstruct error_code { 5550764Smarkm unsigned number; 5650764Smarkm char *name; 5750764Smarkm char *string; 5850764Smarkm struct error_code *next, **tail; 5950764Smarkm}; 6050764Smarkm 6150764Smarkmextern struct error_code *codes; 6250764Smarkm 6350764Smarkm#define APPEND(L, V) \ 6450764Smarkmdo { \ 6550764Smarkm if((L) == NULL) { \ 6650764Smarkm (L) = (V); \ 6750764Smarkm (L)->tail = &(V)->next; \ 6850764Smarkm (L)->next = NULL; \ 6950764Smarkm }else{ \ 7050764Smarkm *(L)->tail = (V); \ 7150764Smarkm (L)->tail = &(V)->next; \ 7250764Smarkm } \ 7350764Smarkm}while(0) 7450764Smarkm 7550764Smarkm#endif /* __COMPILE_ET_H__ */ 76