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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* Högskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* Almost all programs use these routines (implicitly) so it's a good
* place to put the version string. */
#include "version.h"
#include "krb_locl.h"
RCSID("$Id: rw.c,v 1.10 1999/06/29 21:18:08 bg Exp $");
int
krb_get_int(void *f, u_int32_t *to, int size, int lsb)
{
int i;
unsigned char *from = (unsigned char *)f;
*to = 0;
if(lsb){
for(i = size-1; i >= 0; i--)
*to = (*to << 8) | from[i];
}else{
for(i = 0; i < size; i++)
*to = (*to << 8) | from[i];
}
return size;
}
int
krb_put_int(u_int32_t from, void *to, size_t rem, int size)
{
int i;
unsigned char *p = (unsigned char *)to;
if (rem < size)
return -1;
for(i = size - 1; i >= 0; i--){
p[i] = from & 0xff;
from >>= 8;
}
return size;
}
/* addresses are always sent in network byte order */
int
krb_get_address(void *from, u_int32_t *to)
{
unsigned char *p = (unsigned char*)from;
*to = htonl((p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3]);
return 4;
}
int
krb_put_address(u_int32_t addr, void *to, size_t rem)
{
return krb_put_int(ntohl(addr), to, rem, 4);
}
int
krb_put_string(const char *from, void *to, size_t rem)
{
size_t len = strlen(from) + 1;
if (rem < len)
return -1;
memcpy(to, from, len);
return len;
}
int
krb_get_string(void *from, char *to, size_t to_size)
{
strcpy_truncate (to, (char *)from, to_size);
return strlen((char *)from) + 1;
}
int
krb_get_nir(void *from, char *name, char *instance, char *realm)
{
char *p = (char *)from;
p += krb_get_string(p, name, ANAME_SZ);
p += krb_get_string(p, instance, INST_SZ);
if(realm)
p += krb_get_string(p, realm, REALM_SZ);
return p - (char *)from;
}
int
krb_put_nir(const char *name,
const char *instance,
const char *realm,
void *to,
size_t rem)
{
char *p = (char *)to;
int tmp;
tmp = krb_put_string(name, p, rem);
if (tmp < 0)
return tmp;
p += tmp;
rem -= tmp;
tmp = krb_put_string(instance, p, rem);
if (tmp < 0)
return tmp;
p += tmp;
rem -= tmp;
if (realm) {
tmp = krb_put_string(realm, p, rem);
if (tmp < 0)
return tmp;
p += tmp;
rem -= tmp;
}
return p - (char *)to;
}
|
