xref: /freebsd/crypto/heimdal/admin/rename.c (revision 59c8e88e72633afbc47a4ace0d2170d00d51f7dc)
1 /*
2  * Copyright (c) 2001-2004 Kungliga Tekniska Högskolan
3  * (Royal Institute of Technology, Stockholm, Sweden).
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  *
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  *
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  *
17  * 3. Neither the name of the Institute nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  */
33 
34 #include "ktutil_locl.h"
35 
36 RCSID("$Id$");
37 
38 int
39 kt_rename(struct rename_options *opt, int argc, char **argv)
40 {
41     krb5_error_code ret = 0;
42     krb5_keytab_entry entry;
43     krb5_keytab keytab;
44     krb5_kt_cursor cursor;
45     krb5_principal from_princ, to_princ;
46 
47     ret = krb5_parse_name(context, argv[0], &from_princ);
48     if(ret != 0) {
49 	krb5_warn(context, ret, "%s", argv[0]);
50 	return 1;
51     }
52 
53     ret = krb5_parse_name(context, argv[1], &to_princ);
54     if(ret != 0) {
55 	krb5_free_principal(context, from_princ);
56 	krb5_warn(context, ret, "%s", argv[1]);
57 	return 1;
58     }
59 
60     if((keytab = ktutil_open_keytab()) == NULL) {
61 	krb5_free_principal(context, from_princ);
62 	krb5_free_principal(context, to_princ);
63 	return 1;
64     }
65 
66     ret = krb5_kt_start_seq_get(context, keytab, &cursor);
67     if(ret) {
68 	krb5_kt_close(context, keytab);
69 	krb5_free_principal(context, from_princ);
70 	krb5_free_principal(context, to_princ);
71 	return 1;
72     }
73     while(1) {
74 	ret = krb5_kt_next_entry(context, keytab, &entry, &cursor);
75 	if(ret != 0) {
76 	    if(ret != KRB5_CC_END && ret != KRB5_KT_END)
77 		krb5_warn(context, ret, "getting entry from keytab");
78 	    else
79 		ret = 0;
80 	    break;
81 	}
82 	if(krb5_principal_compare(context, entry.principal, from_princ)) {
83 	    krb5_free_principal(context, entry.principal);
84 	    entry.principal = to_princ;
85 	    ret = krb5_kt_add_entry(context, keytab, &entry);
86 	    if(ret) {
87 		entry.principal = NULL;
88 		krb5_kt_free_entry(context, &entry);
89 		krb5_warn(context, ret, "adding entry");
90 		break;
91 	    }
92 	    if (opt->delete_flag) {
93 		entry.principal = from_princ;
94 		ret = krb5_kt_remove_entry(context, keytab, &entry);
95 		if(ret) {
96 		    entry.principal = NULL;
97 		    krb5_kt_free_entry(context, &entry);
98 		    krb5_warn(context, ret, "removing entry");
99 		    break;
100 		}
101 	    }
102 	    entry.principal = NULL;
103 	}
104 	krb5_kt_free_entry(context, &entry);
105     }
106     krb5_kt_end_seq_get(context, keytab, &cursor);
107 
108     krb5_free_principal(context, from_princ);
109     krb5_free_principal(context, to_princ);
110 
111     return ret != 0;
112 }
113 
114