Lines Matching refs:ASSERT_OK
26 #define ASSERT_OK(expr) ASSERT_ERR(ZX_OK, (expr)) macro
91 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateInit()
99 ASSERT_OK(merkleTree.CreateInit(0, tree_len)); in CreateInitWithoutData()
100 ASSERT_OK(merkleTree.CreateInit(0, 0)); in CreateInitWithoutData()
107 ASSERT_OK(merkleTree.CreateInit(kNodeSize, 0)); in CreateInitWithoutTree()
124 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateUpdate()
125 ASSERT_OK(merkleTree.CreateUpdate(gData, kLarge, gTree)); in CreateUpdate()
140 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateUpdateMissingData()
150 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateUpdateMissingTree()
160 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateUpdateWithoutData()
161 ASSERT_OK(merkleTree.CreateUpdate(gData, 0, gTree)); in CreateUpdateWithoutData()
162 ASSERT_OK(merkleTree.CreateUpdate(nullptr, 0, gTree)); in CreateUpdateWithoutData()
169 ASSERT_OK(merkleTree.CreateInit(kNodeSize, 0)); in CreateUpdateWithoutTree()
170 ASSERT_OK(merkleTree.CreateUpdate(gData, kNodeSize, nullptr)); in CreateUpdateWithoutTree()
178 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateUpdateTooMuchData()
198 ASSERT_OK(merkleTree.CreateInit(data_len, tree_len)); in CreateFinal()
199 ASSERT_OK(merkleTree.CreateUpdate(data, data_len, tree)); in CreateFinal()
201 ASSERT_OK(merkleTree.CreateFinal(tree, &actual)); in CreateFinal()
203 ASSERT_OK(expected.Parse(digest, strlen(digest))); in CreateFinal()
262 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateFinalMissingDigest()
263 ASSERT_OK(merkleTree.CreateUpdate(gData, kLarge, gTree)); in CreateFinalMissingDigest()
272 ASSERT_OK(merkleTree.CreateInit(kLarge, tree_len)); in CreateFinalIncompleteData()
273 ASSERT_OK(merkleTree.CreateUpdate(gData, kLarge - 1, gTree)); in CreateFinalIncompleteData()
284 ASSERT_OK(MerkleTree::Create(gData, data_len, gTree, tree_len, &actual)); in Create()
286 ASSERT_OK(expected.Parse(digest, strlen(digest))); in Create()
309 ASSERT_OK(merkle_tree_create_init(data_len, tree_len, &mt)); in CreateFinalC()
313 ASSERT_OK(merkle_tree_create_update(mt, gData + i, kNodeSize, gTree)); in CreateFinalC()
316 ASSERT_OK(merkle_tree_create_update(mt, gData + i, data_len - i, gTree)); in CreateFinalC()
319 ASSERT_OK(merkle_tree_create_final(mt, gTree, &actual, sizeof(actual))); in CreateFinalC()
321 ASSERT_OK(expected.Parse(digest, strlen(digest))); in CreateFinalC()
344 ASSERT_OK(merkle_tree_create(gData, data_len, gTree, tree_len, &actual, in CreateC()
347 ASSERT_OK(expected.Parse(digest, strlen(digest))); in CreateC()
369 ASSERT_OK(merkleTree.CreateInit(kSmall, tree_len)); in CreateByteByByte()
371 ASSERT_OK(merkleTree.CreateUpdate(gData + i, 1, gTree)); in CreateByteByByte()
374 ASSERT_OK(merkleTree.CreateFinal(gTree, &actual)); in CreateByteByByte()
376 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &expected)); in CreateByteByByte()
414 ASSERT_OK(MerkleTree::Create(gData, data_len, gTree, tree_len, &digest)); in Verify()
415 ASSERT_OK(MerkleTree::Verify(gData, data_len, gTree, tree_len, 0, data_len, in Verify()
438 ASSERT_OK(merkle_tree_create(gData, data_len, gTree, tree_len, digest, in VerifyC()
440 ASSERT_OK(merkle_tree_verify(gData, data_len, gTree, tree_len, 0, data_len, in VerifyC()
462 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyNodeByNode()
464 ASSERT_OK(MerkleTree::Verify(gData, kSmall, gTree, tree_len, i, in VerifyNodeByNode()
474 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyMissingData()
485 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyMissingTree()
496 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyUnalignedTreeLength()
497 ASSERT_OK(MerkleTree::Verify(gData, kSmall, gTree, tree_len + 1, 0, kSmall, in VerifyUnalignedTreeLength()
506 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyUnalignedDataLength()
507 ASSERT_OK(MerkleTree::Verify(gData, kSmall - 1, gTree, tree_len, 0, in VerifyUnalignedDataLength()
516 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyTreeTooSmall()
528 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyUnalignedOffset()
529 ASSERT_OK(MerkleTree::Verify(gData, kSmall, gTree, tree_len, kNodeSize - 1, in VerifyUnalignedOffset()
538 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyUnalignedLength()
539 ASSERT_OK(MerkleTree::Verify(gData, kSmall, gTree, tree_len, 0, kSmall - 1, in VerifyUnalignedLength()
548 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyOutOfBounds()
559 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyZeroLength()
560 ASSERT_OK(MerkleTree::Verify(gData, kSmall, gTree, tree_len, 0, 0, digest)); in VerifyZeroLength()
568 ASSERT_OK(MerkleTree::Create(gData, kLarge, gTree, tree_len, &digest)); in VerifyBadRoot()
571 ASSERT_OK(digest.ToString(str, sizeof(str))); in VerifyBadRoot()
587 ASSERT_OK(MerkleTree::Create(gData, kLarge, gTree, tree_len, &digest)); in VerifyGoodPartOfBadTree()
589 ASSERT_OK(MerkleTree::Verify(gData, kLarge, gTree, tree_len, in VerifyGoodPartOfBadTree()
598 ASSERT_OK(MerkleTree::Create(gData, kLarge, gTree, tree_len, &digest)); in VerifyBadTree()
610 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyGoodPartOfBadLeaves()
612 ASSERT_OK(MerkleTree::Verify(gData, kSmall, gTree, tree_len, kNodeSize, in VerifyGoodPartOfBadLeaves()
621 ASSERT_OK(MerkleTree::Create(gData, kSmall, gTree, tree_len, &digest)); in VerifyBadLeaves()
641 ASSERT_OK( in CreateAndVerifyHugePRNGData()
647 ASSERT_OK(digest.CopyTo(buffer, sizeof(buffer))); in CreateAndVerifyHugePRNGData()
687 ASSERT_OK(MerkleTree::Verify(gData, data_len, gTree, tree_len, 0, in CreateAndVerifyHugePRNGData()