Home | History | Annotate | Download | only in x509

Lines Matching defs:rdn

135     private RDN[] names;        // RDNs (never null)
140 private volatile List<RDN> rdnList;
206 names = new RDN[4];
211 names[3] = new RDN(1);
214 names[2] = new RDN(1);
217 names[1] = new RDN(1);
220 names[0] = new RDN(1);
244 names = new RDN[6];
249 names[5] = new RDN(1);
252 names[4] = new RDN(1);
255 names[3] = new RDN(1);
258 names[2] = new RDN(1);
261 names[1] = new RDN(1);
264 names[0] = new RDN(1);
275 public X500Name(RDN[] rdnArray) throws IOException {
277 names = new RDN[0];
323 public List<RDN> rdns() {
324 List<RDN> list = rdnList;
366 * if it has at least one RDN containing at least one AVA.
409 RDN r1 = this.names[i];
410 RDN r2 = other.names[i];
799 names = new RDN[0];
801 names = new RDN[nameseq.length];
803 names[i] = new RDN(nameseq[i]);
875 names = new RDN[0];
882 List<RDN> dnVector = new ArrayList<>();
905 * We have encountered an RDN delimiter (comma or a semicolon).
906 * If the comma or semicolon in the RDN under consideration is
908 * is part of the RDN. Otherwise, it is used as a separator, to
909 * delimit the RDN under consideration from any subsequent RDNs.
919 // Parse RDN, and store it in vector
920 RDN rdn = new RDN(rdnString, keywordMap);
921 dnVector.add(rdn);
935 // Parse last or only RDN, and store it in vector
937 RDN rdn = new RDN(rdnString, keywordMap);
938 dnVector.add(rdn);
945 names = dnVector.toArray(new RDN[dnVector.size()]);
969 names = new RDN[0];
973 List<RDN
980 * We have encountered an RDN delimiter (comma).
981 * If the comma in the RDN under consideration is
983 * is part of the RDN. Otherwise, it is used as a separator, to
984 * delimit the RDN under consideration from any subsequent RDNs.
993 // Parse RDN, and store it in vector
994 RDN rdn = new RDN(rdnString, "RFC2253");
995 dnVector.add(rdn);
1005 // Parse last or only RDN, and store it in vector
1007 RDN rdn = new RDN(rdnString, "RFC2253");
1008 dnVector.add(rdn);
1015 names = dnVector.toArray(new RDN[dnVector.size()]);
1362 //Compare names from highest RDN down the naming tree
1363 //Note that these are stored in RDN[0]...
1375 //Copy matching RDNs into new RDN array
1376 RDN[] ancestor = new RDN[i];