increase token validation performance relating to revoked tokens

[Richard]

Currently, there is are two methods called is_revoke and matches that iterate over all revoked events one by one and then further iterate over every field, one by one until it can either short circuit by not matching one value in the event to the passed in token, or until it has matched all fields of non-empty values in the revocation event to the corresponding fields in the given token.

In most cases, the token is not revoked and it will iterate over the entire list of revocations. As the list gets longer, validation becomes slower. You start to see big performance issues around 1500+ revocation entries. It would be nice to directly query the database using sql instead of pulling all the revocation events down, deserializing them, and then iterating over each one in python.

[Steve Martinelli (stevemar)]

Patch: https://review.openstack.org/#/c/359371/

[OpenStack Infra (hudson-openstack)]

Fix proposed to branch: master
Review: https://review.openstack.org/378142

[OpenStack Infra (hudson-openstack)]

Change abandoned by Ron De Rose (<email address hidden>) on branch: master
Review: https://review.openstack.org/359371
Reason: Abandoning this for now, taking a different approach to solve token validation performance.

[Richard (csravelar)]

https://review.openstack.org/#/c/382107/