Home | History | Annotate | Download | only in et
      1 /*
      2  * com_right.c -- provide Heimdall / Kerberos4kth com_err interfaces
      3  * 	for backwards compatbility
      4  *
      5  * Copyright (c) 2003 by Theodore Ts'o
      6  *
      7  * Taken from lib/com_err/error.c from Kerberos4kth distribution.
      8  *
      9  * Copyright (c) 1997, 1998, 2001 Kungliga Tekniska Hgskolan
     10  * (Royal Institute of Technology, Stockholm, Sweden).
     11  * All rights reserved.
     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  *
     17  * 1. Redistributions of source code must retain the above copyright
     18  *    notice, this list of conditions and the following disclaimer.
     19  *
     20  * 2. Redistributions in binary form must reproduce the above copyright
     21  *    notice, this list of conditions and the following disclaimer in the
     22  *    documentation and/or other materials provided with the distribution.
     23  *
     24  * 3. Neither the name of the Institute nor the names of its contributors
     25  *    may be used to endorse or promote products derived from this software
     26  *    without specific prior written permission.
     27  *
     28  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
     29  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
     32  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38  * SUCH DAMAGE.
     39  */
     40 
     41 #include <stdio.h>
     42 #include <stdlib.h>
     43 #include <string.h>
     44 #include "com_err.h"
     45 #include "error_table.h"
     46 
     47 const char *
     48 com_right(struct et_list *list, long code)
     49 {
     50     struct et_list *p;
     51     for (p = list; p; p = p->next) {
     52 	if (code >= p->table->base && code < p->table->base + p->table->n_msgs)
     53 	    return p->table->msgs[code - p->table->base];
     54     }
     55     return NULL;
     56 }
     57 
     58 struct foobar {
     59     struct et_list etl;
     60     struct error_table tab;
     61 };
     62 
     63 /*
     64  * We provide this routine for compatibility with Heimdall generated
     65  * foo_err.c files, but we don't use this ourselves for foo_err.c
     66  * files generated by our compile_et.  This is so our foo_err.c
     67  * files can be used with older com_err libraries without running
     68  * afoul of dependencies.
     69  */
     70 void
     71 initialize_error_table_r(struct et_list **list,
     72 			 const char **messages,
     73 			 int num_errors,
     74 			 long base)
     75 {
     76     struct et_list *et, **end;
     77     struct error_table *tab;
     78     struct foobar *f;
     79 
     80     for (end = list, et = *list; et; end = &et->next, et = et->next)
     81         if (et->table->msgs == messages)
     82             return;
     83     f = malloc(sizeof(*f));
     84     if (f == NULL)
     85         return;
     86     et = &f->etl;
     87     et->table = tab = &f->tab;
     88     tab->msgs = messages;
     89     tab->n_msgs = num_errors;
     90     tab->base = base;
     91     et->next = NULL;
     92     *end = et;
     93 }
     94 
     95 
     96 void
     97 free_error_table(struct et_list *et)
     98 {
     99     while(et){
    100 	struct et_list *p = et;
    101 	et = et->next;
    102 	free(p);
    103     }
    104 }
    105