225 lines
5.5 KiB
Java
225 lines
5.5 KiB
Java
/*
|
|
* This class file was automatically generated by ASN1bean v1.13.0 (http://www.beanit.com)
|
|
*/
|
|
|
|
package com.truphone.rsp.dto.asn1.pkix1implicit88;
|
|
|
|
import java.io.IOException;
|
|
import java.io.EOFException;
|
|
import java.io.InputStream;
|
|
import java.io.OutputStream;
|
|
import java.io.ByteArrayOutputStream;
|
|
import java.util.List;
|
|
import java.util.ArrayList;
|
|
import java.util.Iterator;
|
|
import java.io.UnsupportedEncodingException;
|
|
import java.math.BigInteger;
|
|
import java.io.Serializable;
|
|
import com.beanit.asn1bean.ber.*;
|
|
import com.beanit.asn1bean.ber.types.*;
|
|
import com.beanit.asn1bean.ber.types.string.*;
|
|
|
|
import com.truphone.rsp.dto.asn1.pkix1explicit88.Attribute;
|
|
import com.truphone.rsp.dto.asn1.pkix1explicit88.CertificateSerialNumber;
|
|
import com.truphone.rsp.dto.asn1.pkix1explicit88.DirectoryString;
|
|
import com.truphone.rsp.dto.asn1.pkix1explicit88.Name;
|
|
import com.truphone.rsp.dto.asn1.pkix1explicit88.ORAddress;
|
|
import com.truphone.rsp.dto.asn1.pkix1explicit88.RelativeDistinguishedName;
|
|
|
|
public class GeneralSubtree implements BerType, Serializable {
|
|
|
|
private static final long serialVersionUID = 1L;
|
|
|
|
public static final BerTag tag = new BerTag(BerTag.UNIVERSAL_CLASS, BerTag.CONSTRUCTED, 16);
|
|
|
|
private byte[] code = null;
|
|
private GeneralName base = null;
|
|
private BaseDistance minimum = null;
|
|
private BaseDistance maximum = null;
|
|
|
|
public GeneralSubtree() {
|
|
}
|
|
|
|
public GeneralSubtree(byte[] code) {
|
|
this.code = code;
|
|
}
|
|
|
|
public void setBase(GeneralName base) {
|
|
this.base = base;
|
|
}
|
|
|
|
public GeneralName getBase() {
|
|
return base;
|
|
}
|
|
|
|
public void setMinimum(BaseDistance minimum) {
|
|
this.minimum = minimum;
|
|
}
|
|
|
|
public BaseDistance getMinimum() {
|
|
return minimum;
|
|
}
|
|
|
|
public void setMaximum(BaseDistance maximum) {
|
|
this.maximum = maximum;
|
|
}
|
|
|
|
public BaseDistance getMaximum() {
|
|
return maximum;
|
|
}
|
|
|
|
@Override public int encode(OutputStream reverseOS) throws IOException {
|
|
return encode(reverseOS, true);
|
|
}
|
|
|
|
public int encode(OutputStream reverseOS, boolean withTag) throws IOException {
|
|
|
|
if (code != null) {
|
|
reverseOS.write(code);
|
|
if (withTag) {
|
|
return tag.encode(reverseOS) + code.length;
|
|
}
|
|
return code.length;
|
|
}
|
|
|
|
int codeLength = 0;
|
|
if (maximum != null) {
|
|
codeLength += maximum.encode(reverseOS, false);
|
|
// write tag: CONTEXT_CLASS, PRIMITIVE, 1
|
|
reverseOS.write(0x81);
|
|
codeLength += 1;
|
|
}
|
|
|
|
if (minimum != null) {
|
|
codeLength += minimum.encode(reverseOS, false);
|
|
// write tag: CONTEXT_CLASS, PRIMITIVE, 0
|
|
reverseOS.write(0x80);
|
|
codeLength += 1;
|
|
}
|
|
|
|
codeLength += base.encode(reverseOS);
|
|
|
|
codeLength += BerLength.encodeLength(reverseOS, codeLength);
|
|
|
|
if (withTag) {
|
|
codeLength += tag.encode(reverseOS);
|
|
}
|
|
|
|
return codeLength;
|
|
|
|
}
|
|
|
|
@Override public int decode(InputStream is) throws IOException {
|
|
return decode(is, true);
|
|
}
|
|
|
|
public int decode(InputStream is, boolean withTag) throws IOException {
|
|
int tlByteCount = 0;
|
|
int vByteCount = 0;
|
|
int numDecodedBytes;
|
|
BerTag berTag = new BerTag();
|
|
|
|
if (withTag) {
|
|
tlByteCount += tag.decodeAndCheck(is);
|
|
}
|
|
|
|
BerLength length = new BerLength();
|
|
tlByteCount += length.decode(is);
|
|
int lengthVal = length.val;
|
|
vByteCount += berTag.decode(is);
|
|
|
|
base = new GeneralName();
|
|
numDecodedBytes = base.decode(is, berTag);
|
|
if (numDecodedBytes != 0) {
|
|
vByteCount += numDecodedBytes;
|
|
if (lengthVal >= 0 && vByteCount == lengthVal) {
|
|
return tlByteCount + vByteCount;
|
|
}
|
|
vByteCount += berTag.decode(is);
|
|
}
|
|
else {
|
|
throw new IOException("Tag does not match mandatory sequence component.");
|
|
}
|
|
if (berTag.equals(BerTag.CONTEXT_CLASS, BerTag.PRIMITIVE, 0)) {
|
|
minimum = new BaseDistance();
|
|
vByteCount += minimum.decode(is, false);
|
|
if (lengthVal >= 0 && vByteCount == lengthVal) {
|
|
return tlByteCount + vByteCount;
|
|
}
|
|
vByteCount += berTag.decode(is);
|
|
}
|
|
|
|
if (berTag.equals(BerTag.CONTEXT_CLASS, BerTag.PRIMITIVE, 1)) {
|
|
maximum = new BaseDistance();
|
|
vByteCount += maximum.decode(is, false);
|
|
if (lengthVal >= 0 && vByteCount == lengthVal) {
|
|
return tlByteCount + vByteCount;
|
|
}
|
|
vByteCount += berTag.decode(is);
|
|
}
|
|
|
|
if (lengthVal < 0) {
|
|
if (!berTag.equals(0, 0, 0)) {
|
|
throw new IOException("Decoded sequence has wrong end of contents octets");
|
|
}
|
|
vByteCount += BerLength.readEocByte(is);
|
|
return tlByteCount + vByteCount;
|
|
}
|
|
|
|
throw new IOException("Unexpected end of sequence, length tag: " + lengthVal + ", bytes decoded: " + vByteCount);
|
|
|
|
}
|
|
|
|
public void encodeAndSave(int encodingSizeGuess) throws IOException {
|
|
ReverseByteArrayOutputStream reverseOS = new ReverseByteArrayOutputStream(encodingSizeGuess);
|
|
encode(reverseOS, false);
|
|
code = reverseOS.getArray();
|
|
}
|
|
|
|
@Override public String toString() {
|
|
StringBuilder sb = new StringBuilder();
|
|
appendAsString(sb, 0);
|
|
return sb.toString();
|
|
}
|
|
|
|
public void appendAsString(StringBuilder sb, int indentLevel) {
|
|
|
|
sb.append("{");
|
|
sb.append("\n");
|
|
for (int i = 0; i < indentLevel + 1; i++) {
|
|
sb.append("\t");
|
|
}
|
|
if (base != null) {
|
|
sb.append("base: ");
|
|
base.appendAsString(sb, indentLevel + 1);
|
|
}
|
|
else {
|
|
sb.append("base: <empty-required-field>");
|
|
}
|
|
|
|
if (minimum != null) {
|
|
sb.append(",\n");
|
|
for (int i = 0; i < indentLevel + 1; i++) {
|
|
sb.append("\t");
|
|
}
|
|
sb.append("minimum: ").append(minimum);
|
|
}
|
|
|
|
if (maximum != null) {
|
|
sb.append(",\n");
|
|
for (int i = 0; i < indentLevel + 1; i++) {
|
|
sb.append("\t");
|
|
}
|
|
sb.append("maximum: ").append(maximum);
|
|
}
|
|
|
|
sb.append("\n");
|
|
for (int i = 0; i < indentLevel; i++) {
|
|
sb.append("\t");
|
|
}
|
|
sb.append("}");
|
|
}
|
|
|
|
}
|
|
|