1 /*	$NetBSD: error.c,v 1.1.1.2 2014/04/24 12:45:28 pettai Exp $	*/
2 
3 /*
4  * Copyright (c) 1997, 1998, 2001 Kungliga Tekniska Högskolan
5  * (Royal Institute of Technology, Stockholm, Sweden).
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * 1. Redistributions of source code must retain the above copyright
13  *    notice, this list of conditions and the following disclaimer.
14  *
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  *
19  * 3. Neither the name of the Institute nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 
37 #include <config.h>
38 
39 #include <stdio.h>
40 #include <stdlib.h>
41 #include <string.h>
42 #include <krb5/com_right.h>
43 #include <krb5/roken.h>
44 
45 #ifdef LIBINTL
46 #include <libintl.h>
47 #else
48 #define dgettext(d,s) (s)
49 #endif
50 
51 KRB5_LIB_FUNCTION const char * KRB5_LIB_CALL
com_right(struct et_list * list,long code)52 com_right(struct et_list *list, long code)
53 {
54     struct et_list *p;
55     for (p = list; p; p = p->next)
56 	if (code >= p->table->base && code < p->table->base + p->table->n_msgs)
57 	    return p->table->msgs[code - p->table->base];
58     return NULL;
59 }
60 
61 KRB5_LIB_FUNCTION const char * KRB5_LIB_CALL
com_right_r(struct et_list * list,long code,char * str,size_t len)62 com_right_r(struct et_list *list, long code, char *str, size_t len)
63 {
64     struct et_list *p;
65     for (p = list; p; p = p->next) {
66 	if (code >= p->table->base && code < p->table->base + p->table->n_msgs) {
67 	    const char *msg = p->table->msgs[code - p->table->base];
68 #ifdef LIBINTL
69 	    char domain[12 + 20];
70 	    snprintf(domain, sizeof(domain), "heim_com_err%d", p->table->base);
71 #endif
72 	    strlcpy(str, dgettext(domain, msg), len);
73 	    return str;
74 	}
75     }
76     return NULL;
77 }
78 
79 struct foobar {
80     struct et_list etl;
81     struct error_table et;
82 };
83 
84 KRB5_LIB_FUNCTION void KRB5_LIB_CALL
initialize_error_table_r(struct et_list ** list,const char ** messages,int num_errors,long base)85 initialize_error_table_r(struct et_list **list,
86 			 const char **messages,
87 			 int num_errors,
88 			 long base)
89 {
90     struct et_list *et, **end;
91     struct foobar *f;
92     for (end = list, et = *list; et; end = &et->next, et = et->next)
93         if (et->table->msgs == messages)
94             return;
95     f = malloc(sizeof(*f));
96     if (f == NULL)
97         return;
98     et = &f->etl;
99     et->table = &f->et;
100     et->table->msgs = messages;
101     et->table->n_msgs = num_errors;
102     et->table->base = base;
103     et->next = NULL;
104     *end = et;
105 }
106 
107 
108 KRB5_LIB_FUNCTION void KRB5_LIB_CALL
free_error_table(struct et_list * et)109 free_error_table(struct et_list *et)
110 {
111     while(et){
112 	struct et_list *p = et;
113 	et = et->next;
114 	free(p);
115     }
116 }
117