xref: /titanic_52/usr/src/cmd/ldap/ns_ldap/printResult.c (revision d58fda4376e4bf67072ce2e69f6f47036f9dbb68)
1 /*
2  * CDDL HEADER START
3  *
4  * The contents of this file are subject to the terms of the
5  * Common Development and Distribution License, Version 1.0 only
6  * (the "License").  You may not use this file except in compliance
7  * with the License.
8  *
9  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10  * or http://www.opensolaris.org/os/licensing.
11  * See the License for the specific language governing permissions
12  * and limitations under the License.
13  *
14  * When distributing Covered Code, include this CDDL HEADER in each
15  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16  * If applicable, add the following below this CDDL HEADER, with the
17  * fields enclosed by brackets "[]" replaced with your own identifying
18  * information: Portions Copyright [yyyy] [name of copyright owner]
19  *
20  * CDDL HEADER END
21  */
22 /*
23  * Copyright (c) 1999 by Sun Microsystems, Inc.
24  * All rights reserved.
25  */
26 
27 #pragma ident	"%Z%%M%	%I%	%E% SMI"
28 
29 #include <stdio.h>
30 #include "../../../lib/libsldap/common/ns_sldap.h"
31 
32 void
33 _printEntry(ns_ldap_entry_t * entry) {
34 	int	j, k;
35 	char	*cp;
36 	for (j = 0; j < entry->attr_count; j++) {
37 		cp = entry->attr_pair[j]->attrname;
38 		if (j == 0) {
39 			fprintf(stdout, "%s: %s\n", cp,
40 				entry->attr_pair[j]->attrvalue[0]);
41 		} else {
42 			for (k = 0; (k < entry->attr_pair[j]->value_count) &&
43 			    (entry->attr_pair[j]->attrvalue[k]); k++)
44 				fprintf(stdout, "\t%s: %s\n", cp,
45 					entry->attr_pair[j]->attrvalue[k]);
46 		}
47 	}
48 }
49 
50 
51 void
52 _printResult(ns_ldap_result_t * result) {
53 	int i, j, k;
54 	ns_ldap_entry_t *curEntry;
55 
56 	if (result == NULL) {
57 		return;
58 	}
59 	curEntry = result->entry;
60 	for (i = 0; i < result->entries_count; i++) {
61 		if (i != 0)
62 			fprintf(stdout, "\n");
63 		_printEntry(curEntry);
64 		curEntry = curEntry->next;
65 	}
66 }
67