1 /*
2 * Copyright (c) 1997, 1998, 1999 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 "kadm5_locl.h"
35
36 RCSID("$Id$");
37
38 struct foreach_data {
39 const char *exp;
40 char *exp2;
41 char **princs;
42 int count;
43 };
44
45 static krb5_error_code
add_princ(struct foreach_data * d,char * princ)46 add_princ(struct foreach_data *d, char *princ)
47 {
48 char **tmp;
49 tmp = realloc(d->princs, (d->count + 1) * sizeof(*tmp));
50 if(tmp == NULL)
51 return ENOMEM;
52 d->princs = tmp;
53 d->princs[d->count++] = princ;
54 return 0;
55 }
56
57 static krb5_error_code
foreach(krb5_context context,HDB * db,hdb_entry_ex * ent,void * data)58 foreach(krb5_context context, HDB *db, hdb_entry_ex *ent, void *data)
59 {
60 struct foreach_data *d = data;
61 char *princ;
62 krb5_error_code ret;
63 ret = krb5_unparse_name(context, ent->entry.principal, &princ);
64 if(ret)
65 return ret;
66 if(d->exp){
67 if(fnmatch(d->exp, princ, 0) == 0 || fnmatch(d->exp2, princ, 0) == 0)
68 ret = add_princ(d, princ);
69 else
70 free(princ);
71 }else{
72 ret = add_princ(d, princ);
73 }
74 if(ret)
75 free(princ);
76 return ret;
77 }
78
79 kadm5_ret_t
kadm5_s_get_principals(void * server_handle,const char * expression,char *** princs,int * count)80 kadm5_s_get_principals(void *server_handle,
81 const char *expression,
82 char ***princs,
83 int *count)
84 {
85 struct foreach_data d;
86 kadm5_server_context *context = server_handle;
87 kadm5_ret_t ret;
88 ret = context->db->hdb_open(context->context, context->db, O_RDWR, 0);
89 if(ret) {
90 krb5_warn(context->context, ret, "opening database");
91 return ret;
92 }
93 d.exp = expression;
94 {
95 krb5_realm r;
96 if ((ret = krb5_get_default_realm(context->context, &r)))
97 return (ret);
98 asprintf(&d.exp2, "%s@%s", expression, r);
99 free(r);
100 }
101 d.princs = NULL;
102 d.count = 0;
103 ret = hdb_foreach(context->context, context->db, HDB_F_ADMIN_DATA, foreach, &d);
104 context->db->hdb_close(context->context, context->db);
105 if(ret == 0)
106 ret = add_princ(&d, NULL);
107 if(ret == 0){
108 *princs = d.princs;
109 *count = d.count - 1;
110 }else
111 kadm5_free_name_list(context, d.princs, &d.count);
112 free(d.exp2);
113 return _kadm5_error_code(ret);
114 }
115