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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
using System;
using Org.BouncyCastle.Math;
namespace Org.BouncyCastle.Asn1.X509
{
/**
* Class for containing a restriction object subtrees in NameConstraints. See
* RFC 3280.
*
* <pre>
*
* GeneralSubtree ::= SEQUENCE
* {
* baseName GeneralName,
* minimum [0] BaseDistance DEFAULT 0,
* maximum [1] BaseDistance OPTIONAL
* }
* </pre>
*
* @see org.bouncycastle.asn1.x509.NameConstraints
*
*/
public class GeneralSubtree
: Asn1Encodable
{
private readonly GeneralName baseName;
private readonly DerInteger minimum;
private readonly DerInteger maximum;
private GeneralSubtree(
Asn1Sequence seq)
{
baseName = GeneralName.GetInstance(seq[0]);
switch (seq.Count)
{
case 1:
break;
case 2:
{
Asn1TaggedObject o = Asn1TaggedObject.GetInstance(seq[1]);
switch (o.TagNo)
{
case 0:
minimum = DerInteger.GetInstance(o, false);
break;
case 1:
maximum = DerInteger.GetInstance(o, false);
break;
default:
throw new ArgumentException("Bad tag number: " + o.TagNo);
}
break;
}
case 3:
{
{
Asn1TaggedObject oMin = Asn1TaggedObject.GetInstance(seq[1]);
if (oMin.TagNo != 0)
throw new ArgumentException("Bad tag number for 'minimum': " + oMin.TagNo);
minimum = DerInteger.GetInstance(oMin, false);
}
{
Asn1TaggedObject oMax = Asn1TaggedObject.GetInstance(seq[2]);
if (oMax.TagNo != 1)
throw new ArgumentException("Bad tag number for 'maximum': " + oMax.TagNo);
maximum = DerInteger.GetInstance(oMax, false);
}
break;
}
default:
throw new ArgumentException("Bad sequence size: " + seq.Count);
}
}
/**
* Constructor from a given details.
*
* According RFC 3280, the minimum and maximum fields are not used with any
* name forms, thus minimum MUST be zero, and maximum MUST be absent.
* <p>
* If minimum is <code>null</code>, zero is assumed, if
* maximum is <code>null</code>, maximum is absent.</p>
*
* @param baseName
* A restriction.
* @param minimum
* Minimum
*
* @param maximum
* Maximum
*/
public GeneralSubtree(
GeneralName baseName,
BigInteger minimum,
BigInteger maximum)
{
this.baseName = baseName;
if (minimum != null)
{
this.minimum = new DerInteger(minimum);
}
if (maximum != null)
{
this.maximum = new DerInteger(maximum);
}
}
public GeneralSubtree(
GeneralName baseName)
: this(baseName, null, null)
{
}
public static GeneralSubtree GetInstance(
Asn1TaggedObject o,
bool isExplicit)
{
return new GeneralSubtree(Asn1Sequence.GetInstance(o, isExplicit));
}
public static GeneralSubtree GetInstance(
object obj)
{
if (obj == null)
{
return null;
}
if (obj is GeneralSubtree)
{
return (GeneralSubtree) obj;
}
return new GeneralSubtree(Asn1Sequence.GetInstance(obj));
}
public GeneralName Base
{
get { return baseName; }
}
public BigInteger Minimum
{
get { return minimum == null ? BigInteger.Zero : minimum.Value; }
}
public BigInteger Maximum
{
get { return maximum == null ? null : maximum.Value; }
}
/**
* Produce an object suitable for an Asn1OutputStream.
*
* Returns:
*
* <pre>
* GeneralSubtree ::= SEQUENCE
* {
* baseName GeneralName,
* minimum [0] BaseDistance DEFAULT 0,
* maximum [1] BaseDistance OPTIONAL
* }
* </pre>
*
* @return a DERObject
*/
public override Asn1Object ToAsn1Object()
{
Asn1EncodableVector v = new Asn1EncodableVector(baseName);
if (minimum != null && !minimum.HasValue(0))
{
v.Add(new DerTaggedObject(false, 0, minimum));
}
v.AddOptionalTagged(false, 1, maximum);
return new DerSequence(v);
}
}
}
|
