ruben/sort_certificate
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Also find a possible parent, and add it to the end of the list

Browse Source
This commit is contained in:
Ruben van Staveren 2022-07-27 12:45:10 +02:00
parent 5c4f6d2c67
commit 5cce5722c5
Signed by: ruben
GPG Key ID: 886F6BECD477A93F
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
sort_certificate.py
View File

@ -252,9 +252,14 @@ def order_x509(x509_objects, root_issuers):
while x509_objects: while x509_objects:
sibling = [x for x in x509_objects sibling = [x for x in x509_objects
if x.get_issuer() == bundle[0].get_subject()] if x.get_issuer() == bundle[0].get_subject()]
parent = [x for x in x509_objects
if x.get_subject() == bundle[-1].get_issuer()]
if sibling and len(sibling) == 1: if sibling and len(sibling) == 1:
# insert sibling at beginning of list # insert sibling at beginning of list
bundle.insert(0, x509_objects.pop(x509_objects.index(sibling[0]))) bundle.insert(0, x509_objects.pop(x509_objects.index(sibling[0])))
elif parent and len(parent) == 1:
# Try to place a (cross signed) intermediate at the end if it matches
bundle.append(x509_objects.pop(x509_objects.index(parent[0])))
else: else:
# Lets complain # Lets complain
logging.error('Certificates remaining data\n\t%s', logging.error('Certificates remaining data\n\t%s',