Lines Matching refs:rc
42 zx_status_t rc;
45 if ((rc = digest->Init()) != ZX_OK) {
46 return rc;
109 zx_status_t rc;
111 if ((rc = mt.CreateInit(data_len, tree_len)) != ZX_OK ||
112 (rc = mt.CreateUpdate(data, data_len, tree)) != ZX_OK ||
113 (rc = mt.CreateFinal(tree, digest)) != ZX_OK) {
114 return rc;
171 zx_status_t rc = ZX_OK;
172 while (length > 0 && rc == ZX_OK) {
175 (rc = DigestInit(&digest_, offset_ | level_, length_ - offset_)) != ZX_OK) {
198 rc = next_->CreateUpdate(out, Digest::kLength, next);
202 return rc;
210 zx_status_t rc;
222 if ((rc = DigestInit(&digest_, 0, 0)) != ZX_OK) {
223 return rc;
229 if ((rc = CreateUpdate(tail, length_ - offset_, tree)) != ZX_OK) {
230 return rc;
252 zx_status_t rc;
254 if ((rc = VerifyLevel(data, data_len, tree, offset, length, level)) != ZX_OK) {
255 return rc;
275 zx_status_t rc;
283 if ((rc = DigestInit(&actual, level, (level == 0 ? root_len : kNodeSize))) != ZX_OK) {
284 return rc;
293 zx_status_t rc;
313 if ((rc = DigestInit(&actual, offset | level, data_len - offset)) != ZX_OK) {
314 return rc;
346 zx_status_t rc;
359 if ((rc = mt_uniq->obj.CreateInit(data_len, tree_len)) != ZX_OK) {
360 return rc;
374 zx_status_t rc;
375 if ((rc = mt->obj.CreateUpdate(data, length, tree)) != ZX_OK) {
376 return rc;
390 zx_status_t rc;
392 if ((rc = mt_uniq->obj.CreateFinal(tree, &digest)) != ZX_OK) {
393 return rc;
400 zx_status_t rc;
402 if ((rc = MerkleTree::Create(data, data_len, tree, tree_len, &digest)) != ZX_OK) {
403 return rc;