/src/openssl/crypto/x509v3/pcy_lib.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* pcy_lib.c */ |
2 | | /* |
3 | | * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project |
4 | | * 2004. |
5 | | */ |
6 | | /* ==================================================================== |
7 | | * Copyright (c) 2004 The OpenSSL Project. All rights reserved. |
8 | | * |
9 | | * Redistribution and use in source and binary forms, with or without |
10 | | * modification, are permitted provided that the following conditions |
11 | | * are met: |
12 | | * |
13 | | * 1. Redistributions of source code must retain the above copyright |
14 | | * notice, this list of conditions and the following disclaimer. |
15 | | * |
16 | | * 2. Redistributions in binary form must reproduce the above copyright |
17 | | * notice, this list of conditions and the following disclaimer in |
18 | | * the documentation and/or other materials provided with the |
19 | | * distribution. |
20 | | * |
21 | | * 3. All advertising materials mentioning features or use of this |
22 | | * software must display the following acknowledgment: |
23 | | * "This product includes software developed by the OpenSSL Project |
24 | | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" |
25 | | * |
26 | | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to |
27 | | * endorse or promote products derived from this software without |
28 | | * prior written permission. For written permission, please contact |
29 | | * licensing@OpenSSL.org. |
30 | | * |
31 | | * 5. Products derived from this software may not be called "OpenSSL" |
32 | | * nor may "OpenSSL" appear in their names without prior written |
33 | | * permission of the OpenSSL Project. |
34 | | * |
35 | | * 6. Redistributions of any form whatsoever must retain the following |
36 | | * acknowledgment: |
37 | | * "This product includes software developed by the OpenSSL Project |
38 | | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" |
39 | | * |
40 | | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY |
41 | | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
42 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
43 | | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR |
44 | | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
45 | | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
46 | | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
47 | | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
48 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
49 | | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
50 | | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
51 | | * OF THE POSSIBILITY OF SUCH DAMAGE. |
52 | | * ==================================================================== |
53 | | * |
54 | | * This product includes cryptographic software written by Eric Young |
55 | | * (eay@cryptsoft.com). This product includes software written by Tim |
56 | | * Hudson (tjh@cryptsoft.com). |
57 | | * |
58 | | */ |
59 | | |
60 | | #include "cryptlib.h" |
61 | | #include <openssl/x509.h> |
62 | | #include <openssl/x509v3.h> |
63 | | |
64 | | #include "pcy_int.h" |
65 | | |
66 | | /* accessor functions */ |
67 | | |
68 | | /* X509_POLICY_TREE stuff */ |
69 | | |
70 | | int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) |
71 | 0 | { |
72 | 0 | if (!tree) |
73 | 0 | return 0; |
74 | 0 | return tree->nlevel; |
75 | 0 | } |
76 | | |
77 | | X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, |
78 | | int i) |
79 | 0 | { |
80 | 0 | if (!tree || (i < 0) || (i >= tree->nlevel)) |
81 | 0 | return NULL; |
82 | 0 | return tree->levels + i; |
83 | 0 | } |
84 | | |
85 | | STACK_OF(X509_POLICY_NODE) *X509_policy_tree_get0_policies(const |
86 | | X509_POLICY_TREE |
87 | | *tree) |
88 | 0 | { |
89 | 0 | if (!tree) |
90 | 0 | return NULL; |
91 | 0 | return tree->auth_policies; |
92 | 0 | } |
93 | | |
94 | | STACK_OF(X509_POLICY_NODE) *X509_policy_tree_get0_user_policies(const |
95 | | X509_POLICY_TREE |
96 | | *tree) |
97 | 0 | { |
98 | 0 | if (!tree) |
99 | 0 | return NULL; |
100 | 0 | if (tree->flags & POLICY_FLAG_ANY_POLICY) |
101 | 0 | return tree->auth_policies; |
102 | 0 | else |
103 | 0 | return tree->user_policies; |
104 | 0 | } |
105 | | |
106 | | /* X509_POLICY_LEVEL stuff */ |
107 | | |
108 | | int X509_policy_level_node_count(X509_POLICY_LEVEL *level) |
109 | 0 | { |
110 | 0 | int n; |
111 | 0 | if (!level) |
112 | 0 | return 0; |
113 | 0 | if (level->anyPolicy) |
114 | 0 | n = 1; |
115 | 0 | else |
116 | 0 | n = 0; |
117 | 0 | if (level->nodes) |
118 | 0 | n += sk_X509_POLICY_NODE_num(level->nodes); |
119 | 0 | return n; |
120 | 0 | } |
121 | | |
122 | | X509_POLICY_NODE *X509_policy_level_get0_node(X509_POLICY_LEVEL *level, int i) |
123 | 0 | { |
124 | 0 | if (!level) |
125 | 0 | return NULL; |
126 | 0 | if (level->anyPolicy) { |
127 | 0 | if (i == 0) |
128 | 0 | return level->anyPolicy; |
129 | 0 | i--; |
130 | 0 | } |
131 | 0 | return sk_X509_POLICY_NODE_value(level->nodes, i); |
132 | 0 | } |
133 | | |
134 | | /* X509_POLICY_NODE stuff */ |
135 | | |
136 | | const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node) |
137 | 0 | { |
138 | 0 | if (!node) |
139 | 0 | return NULL; |
140 | 0 | return node->data->valid_policy; |
141 | 0 | } |
142 | | |
143 | | #if 0 |
144 | | int X509_policy_node_get_critical(const X509_POLICY_NODE *node) |
145 | | { |
146 | | if (node_critical(node)) |
147 | | return 1; |
148 | | return 0; |
149 | | } |
150 | | #endif |
151 | | |
152 | | STACK_OF(POLICYQUALINFO) *X509_policy_node_get0_qualifiers(const |
153 | | X509_POLICY_NODE |
154 | | *node) |
155 | 0 | { |
156 | 0 | if (!node) |
157 | 0 | return NULL; |
158 | 0 | return node->data->qualifier_set; |
159 | 0 | } |
160 | | |
161 | | const X509_POLICY_NODE *X509_policy_node_get0_parent(const X509_POLICY_NODE |
162 | | *node) |
163 | 0 | { |
164 | 0 | if (!node) |
165 | 0 | return NULL; |
166 | 0 | return node->parent; |
167 | 0 | } |