1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/*
* lib/krb5/krb/bld_pr_ext.c
*
* Copyright 1991 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*
*
* Build a principal from a list of lengths and strings
*/
#include <krb5/krb5.h>
#include <krb5/ext-proto.h>
#if __STDC__ || defined(STDARG_PROTOTYPES)
#include <stdarg.h>
#else
#include <varargs.h>
#endif
krb5_error_code INTERFACE_C
#if __STDC__ || defined(STDARG_PROTOTYPES)
krb5_build_principal_ext(krb5_context context, krb5_principal * princ, int rlen, const char * realm, ...)
#else
krb5_build_principal_ext(context, princ, rlen, realm, va_alist)
krb5_context context;
krb5_principal *princ;
int rlen;
const char *realm;
va_dcl
#endif
{
va_list ap;
register int i, count = 0, size;
register char *next;
char *tmpdata;
krb5_data *princ_data;
krb5_principal princ_ret;
#if __STDC__ || defined(STDARG_PROTOTYPES)
va_start(ap, realm);
#else
va_start(ap);
#endif
/* count up */
while (va_arg(ap, int) != 0) {
(void)va_arg(ap, char *); /* pass one up */
count++;
}
va_end(ap);
/* we do a 2-pass to avoid the need to guess on allocation needs
cf. bld_princ.c */
/* get space for array */
princ_data = (krb5_data *) malloc(sizeof(krb5_data) * count);
if (!princ_data)
return ENOMEM;
princ_ret = (krb5_principal) malloc(sizeof(krb5_principal_data));
if (!princ_ret) {
krb5_xfree(princ_data);
return ENOMEM;
}
princ_ret->data = princ_data;
princ_ret->length = count;
tmpdata = malloc(rlen+1);
if (!tmpdata) {
krb5_xfree(princ_data);
krb5_xfree(princ_ret);
return ENOMEM;
}
krb5_princ_set_realm_length(context, princ_ret, rlen);
krb5_princ_set_realm_data(context, princ_ret, tmpdata);
memcpy(tmpdata, realm, rlen);
tmpdata[rlen] = 0;
/* process rest of components */
#if __STDC__ || defined(STDARG_PROTOTYPES)
va_start(ap, realm);
#else
va_start(ap);
#endif
for (i = 0; i < count; i++) {
size = va_arg(ap, int);
next = va_arg(ap, char *);
princ_data[i].length = size;
princ_data[i].data = malloc(size+1);
if (!princ_data[i].data)
goto free_out;
memcpy(princ_data[i].data, next, size);
princ_data[i].data[size] = 0;
}
va_end(ap);
*princ = princ_ret;
krb5_princ_type(context, princ_ret) = KRB5_NT_UNKNOWN;
return 0;
free_out:
while (i-- >= 0)
krb5_xfree(princ_data[i].data);
krb5_xfree(princ_data);
krb5_xfree(princ_ret);
va_end(ap);
return ENOMEM;
}
|