OERV-RUNTIME/boringssl
2
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Empty stacks are vacuously sorted

Browse Source 
In the X.509 policy rewrite, I'll be using sorted stacks to keep the
overall algorithm subquadratic. Fix up sk_FOO_is_sorted in these edge
cases so the asserts work more smoothly.

Change-Id: I369f53543f0c2219df6f62a81aead630a9dbcd8d
Reviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/56031
Commit-Queue: David Benjamin <davidben@google.com>
Reviewed-by: Bob Beck <bbe@google.com>
This commit is contained in:
David Benjamin
2023-01-17 17:02:21 +00:00
committed by Boringssl LUCI CQ
parent 49e07914b3
commit ff23b7cb2c
3 changed files with 49 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
crypto/stack/stack_test.cc
+44
View File
@@ -434,3 +434,47 @@ TEST(StackTest, DeleteIf) {
ExpectStackEquals(sk.get(), {});
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
}
TEST(StackTest, IsSorted) {
bssl::UniquePtr<STACK_OF(TEST_INT)> sk(sk_TEST_INT_new_null());
ASSERT_TRUE(sk);
EXPECT_FALSE(sk_TEST_INT_is_sorted(sk.get()));
// Empty lists are always known to be sorted.
sk_TEST_INT_set_cmp_func(sk.get(), compare);
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
// As are one-element lists.
auto value = TEST_INT_new(2);
ASSERT_TRUE(value);
ASSERT_TRUE(bssl::PushToStack(sk.get(), std::move(value)));
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
// Two-element lists require an explicit sort.
value = TEST_INT_new(1);
ASSERT_TRUE(value);
ASSERT_TRUE(bssl::PushToStack(sk.get(), std::move(value)));
EXPECT_FALSE(sk_TEST_INT_is_sorted(sk.get()));
// The list is now sorted.
sk_TEST_INT_sort(sk.get());
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
// After changing the comparison function, it no longer is sorted.
sk_TEST_INT_set_cmp_func(sk.get(), compare_reverse);
EXPECT_FALSE(sk_TEST_INT_is_sorted(sk.get()));
sk_TEST_INT_sort(sk.get());
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
// But, starting from one element, switching the comparison function preserves
// the sorted bit.
TEST_INT_free(sk_TEST_INT_pop(sk.get()));
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
sk_TEST_INT_set_cmp_func(sk.get(), compare);
EXPECT_TRUE(sk_TEST_INT_is_sorted(sk.get()));
// Without a comparison function, the list cannot be sorted.
sk_TEST_INT_set_cmp_func(sk.get(), nullptr);
EXPECT_FALSE(sk_TEST_INT_is_sorted(sk.get()));
}