Loading...
Note: File does not exist in v3.5.6.
1// SPDX-License-Identifier: GPL-2.0+
2/*
3 * Copyright (C) 2017 Oracle. All Rights Reserved.
4 * Author: Darrick J. Wong <darrick.wong@oracle.com>
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_shared.h"
9#include "xfs_format.h"
10#include "xfs_trans_resv.h"
11#include "xfs_mount.h"
12#include "xfs_btree.h"
13#include "scrub/scrub.h"
14#include "scrub/common.h"
15#include "scrub/btree.h"
16#include "scrub/trace.h"
17
18/* btree scrubbing */
19
20/*
21 * Check for btree operation errors. See the section about handling
22 * operational errors in common.c.
23 */
24static bool
25__xchk_btree_process_error(
26 struct xfs_scrub *sc,
27 struct xfs_btree_cur *cur,
28 int level,
29 int *error,
30 __u32 errflag,
31 void *ret_ip)
32{
33 if (*error == 0)
34 return true;
35
36 switch (*error) {
37 case -EDEADLOCK:
38 /* Used to restart an op with deadlock avoidance. */
39 trace_xchk_deadlock_retry(sc->ip, sc->sm, *error);
40 break;
41 case -EFSBADCRC:
42 case -EFSCORRUPTED:
43 /* Note the badness but don't abort. */
44 sc->sm->sm_flags |= errflag;
45 *error = 0;
46 /* fall through */
47 default:
48 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
49 trace_xchk_ifork_btree_op_error(sc, cur, level,
50 *error, ret_ip);
51 else
52 trace_xchk_btree_op_error(sc, cur, level,
53 *error, ret_ip);
54 break;
55 }
56 return false;
57}
58
59bool
60xchk_btree_process_error(
61 struct xfs_scrub *sc,
62 struct xfs_btree_cur *cur,
63 int level,
64 int *error)
65{
66 return __xchk_btree_process_error(sc, cur, level, error,
67 XFS_SCRUB_OFLAG_CORRUPT, __return_address);
68}
69
70bool
71xchk_btree_xref_process_error(
72 struct xfs_scrub *sc,
73 struct xfs_btree_cur *cur,
74 int level,
75 int *error)
76{
77 return __xchk_btree_process_error(sc, cur, level, error,
78 XFS_SCRUB_OFLAG_XFAIL, __return_address);
79}
80
81/* Record btree block corruption. */
82static void
83__xchk_btree_set_corrupt(
84 struct xfs_scrub *sc,
85 struct xfs_btree_cur *cur,
86 int level,
87 __u32 errflag,
88 void *ret_ip)
89{
90 sc->sm->sm_flags |= errflag;
91
92 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
93 trace_xchk_ifork_btree_error(sc, cur, level,
94 ret_ip);
95 else
96 trace_xchk_btree_error(sc, cur, level,
97 ret_ip);
98}
99
100void
101xchk_btree_set_corrupt(
102 struct xfs_scrub *sc,
103 struct xfs_btree_cur *cur,
104 int level)
105{
106 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT,
107 __return_address);
108}
109
110void
111xchk_btree_xref_set_corrupt(
112 struct xfs_scrub *sc,
113 struct xfs_btree_cur *cur,
114 int level)
115{
116 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT,
117 __return_address);
118}
119
120/*
121 * Make sure this record is in order and doesn't stray outside of the parent
122 * keys.
123 */
124STATIC void
125xchk_btree_rec(
126 struct xchk_btree *bs)
127{
128 struct xfs_btree_cur *cur = bs->cur;
129 union xfs_btree_rec *rec;
130 union xfs_btree_key key;
131 union xfs_btree_key hkey;
132 union xfs_btree_key *keyp;
133 struct xfs_btree_block *block;
134 struct xfs_btree_block *keyblock;
135 struct xfs_buf *bp;
136
137 block = xfs_btree_get_block(cur, 0, &bp);
138 rec = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block);
139
140 trace_xchk_btree_rec(bs->sc, cur, 0);
141
142 /* If this isn't the first record, are they in order? */
143 if (!bs->firstrec && !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec))
144 xchk_btree_set_corrupt(bs->sc, cur, 0);
145 bs->firstrec = false;
146 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len);
147
148 if (cur->bc_nlevels == 1)
149 return;
150
151 /* Is this at least as large as the parent low key? */
152 cur->bc_ops->init_key_from_rec(&key, rec);
153 keyblock = xfs_btree_get_block(cur, 1, &bp);
154 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[1], keyblock);
155 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0)
156 xchk_btree_set_corrupt(bs->sc, cur, 1);
157
158 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
159 return;
160
161 /* Is this no larger than the parent high key? */
162 cur->bc_ops->init_high_key_from_rec(&hkey, rec);
163 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[1], keyblock);
164 if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0)
165 xchk_btree_set_corrupt(bs->sc, cur, 1);
166}
167
168/*
169 * Make sure this key is in order and doesn't stray outside of the parent
170 * keys.
171 */
172STATIC void
173xchk_btree_key(
174 struct xchk_btree *bs,
175 int level)
176{
177 struct xfs_btree_cur *cur = bs->cur;
178 union xfs_btree_key *key;
179 union xfs_btree_key *keyp;
180 struct xfs_btree_block *block;
181 struct xfs_btree_block *keyblock;
182 struct xfs_buf *bp;
183
184 block = xfs_btree_get_block(cur, level, &bp);
185 key = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block);
186
187 trace_xchk_btree_key(bs->sc, cur, level);
188
189 /* If this isn't the first key, are they in order? */
190 if (!bs->firstkey[level] &&
191 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level], key))
192 xchk_btree_set_corrupt(bs->sc, cur, level);
193 bs->firstkey[level] = false;
194 memcpy(&bs->lastkey[level], key, cur->bc_ops->key_len);
195
196 if (level + 1 >= cur->bc_nlevels)
197 return;
198
199 /* Is this at least as large as the parent low key? */
200 keyblock = xfs_btree_get_block(cur, level + 1, &bp);
201 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock);
202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0)
203 xchk_btree_set_corrupt(bs->sc, cur, level);
204
205 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
206 return;
207
208 /* Is this no larger than the parent high key? */
209 key = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block);
210 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock);
211 if (cur->bc_ops->diff_two_keys(cur, keyp, key) < 0)
212 xchk_btree_set_corrupt(bs->sc, cur, level);
213}
214
215/*
216 * Check a btree pointer. Returns true if it's ok to use this pointer.
217 * Callers do not need to set the corrupt flag.
218 */
219static bool
220xchk_btree_ptr_ok(
221 struct xchk_btree *bs,
222 int level,
223 union xfs_btree_ptr *ptr)
224{
225 bool res;
226
227 /* A btree rooted in an inode has no block pointer to the root. */
228 if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) &&
229 level == bs->cur->bc_nlevels)
230 return true;
231
232 /* Otherwise, check the pointers. */
233 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS)
234 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level);
235 else
236 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level);
237 if (!res)
238 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
239
240 return res;
241}
242
243/* Check that a btree block's sibling matches what we expect it. */
244STATIC int
245xchk_btree_block_check_sibling(
246 struct xchk_btree *bs,
247 int level,
248 int direction,
249 union xfs_btree_ptr *sibling)
250{
251 struct xfs_btree_cur *cur = bs->cur;
252 struct xfs_btree_block *pblock;
253 struct xfs_buf *pbp;
254 struct xfs_btree_cur *ncur = NULL;
255 union xfs_btree_ptr *pp;
256 int success;
257 int error;
258
259 error = xfs_btree_dup_cursor(cur, &ncur);
260 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||
261 !ncur)
262 return error;
263
264 /*
265 * If the pointer is null, we shouldn't be able to move the upper
266 * level pointer anywhere.
267 */
268 if (xfs_btree_ptr_is_null(cur, sibling)) {
269 if (direction > 0)
270 error = xfs_btree_increment(ncur, level + 1, &success);
271 else
272 error = xfs_btree_decrement(ncur, level + 1, &success);
273 if (error == 0 && success)
274 xchk_btree_set_corrupt(bs->sc, cur, level);
275 error = 0;
276 goto out;
277 }
278
279 /* Increment upper level pointer. */
280 if (direction > 0)
281 error = xfs_btree_increment(ncur, level + 1, &success);
282 else
283 error = xfs_btree_decrement(ncur, level + 1, &success);
284 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error))
285 goto out;
286 if (!success) {
287 xchk_btree_set_corrupt(bs->sc, cur, level + 1);
288 goto out;
289 }
290
291 /* Compare upper level pointer to sibling pointer. */
292 pblock = xfs_btree_get_block(ncur, level + 1, &pbp);
293 pp = xfs_btree_ptr_addr(ncur, ncur->bc_ptrs[level + 1], pblock);
294 if (!xchk_btree_ptr_ok(bs, level + 1, pp))
295 goto out;
296 if (pbp)
297 xchk_buffer_recheck(bs->sc, pbp);
298
299 if (xfs_btree_diff_two_ptrs(cur, pp, sibling))
300 xchk_btree_set_corrupt(bs->sc, cur, level);
301out:
302 xfs_btree_del_cursor(ncur, XFS_BTREE_ERROR);
303 return error;
304}
305
306/* Check the siblings of a btree block. */
307STATIC int
308xchk_btree_block_check_siblings(
309 struct xchk_btree *bs,
310 struct xfs_btree_block *block)
311{
312 struct xfs_btree_cur *cur = bs->cur;
313 union xfs_btree_ptr leftsib;
314 union xfs_btree_ptr rightsib;
315 int level;
316 int error = 0;
317
318 xfs_btree_get_sibling(cur, block, &leftsib, XFS_BB_LEFTSIB);
319 xfs_btree_get_sibling(cur, block, &rightsib, XFS_BB_RIGHTSIB);
320 level = xfs_btree_get_level(block);
321
322 /* Root block should never have siblings. */
323 if (level == cur->bc_nlevels - 1) {
324 if (!xfs_btree_ptr_is_null(cur, &leftsib) ||
325 !xfs_btree_ptr_is_null(cur, &rightsib))
326 xchk_btree_set_corrupt(bs->sc, cur, level);
327 goto out;
328 }
329
330 /*
331 * Does the left & right sibling pointers match the adjacent
332 * parent level pointers?
333 * (These function absorbs error codes for us.)
334 */
335 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib);
336 if (error)
337 return error;
338 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib);
339 if (error)
340 return error;
341out:
342 return error;
343}
344
345struct check_owner {
346 struct list_head list;
347 xfs_daddr_t daddr;
348 int level;
349};
350
351/*
352 * Make sure this btree block isn't in the free list and that there's
353 * an rmap record for it.
354 */
355STATIC int
356xchk_btree_check_block_owner(
357 struct xchk_btree *bs,
358 int level,
359 xfs_daddr_t daddr)
360{
361 xfs_agnumber_t agno;
362 xfs_agblock_t agbno;
363 xfs_btnum_t btnum;
364 bool init_sa;
365 int error = 0;
366
367 if (!bs->cur)
368 return 0;
369
370 btnum = bs->cur->bc_btnum;
371 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr);
372 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr);
373
374 init_sa = bs->cur->bc_flags & XFS_BTREE_LONG_PTRS;
375 if (init_sa) {
376 error = xchk_ag_init(bs->sc, agno, &bs->sc->sa);
377 if (!xchk_btree_xref_process_error(bs->sc, bs->cur,
378 level, &error))
379 return error;
380 }
381
382 xchk_xref_is_used_space(bs->sc, agbno, 1);
383 /*
384 * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we
385 * have to nullify it (to shut down further block owner checks) if
386 * self-xref encounters problems.
387 */
388 if (!bs->sc->sa.bno_cur && btnum == XFS_BTNUM_BNO)
389 bs->cur = NULL;
390
391 xchk_xref_is_owned_by(bs->sc, agbno, 1, bs->oinfo);
392 if (!bs->sc->sa.rmap_cur && btnum == XFS_BTNUM_RMAP)
393 bs->cur = NULL;
394
395 if (init_sa)
396 xchk_ag_free(bs->sc, &bs->sc->sa);
397
398 return error;
399}
400
401/* Check the owner of a btree block. */
402STATIC int
403xchk_btree_check_owner(
404 struct xchk_btree *bs,
405 int level,
406 struct xfs_buf *bp)
407{
408 struct xfs_btree_cur *cur = bs->cur;
409 struct check_owner *co;
410
411 /*
412 * In theory, xfs_btree_get_block should only give us a null buffer
413 * pointer for the root of a root-in-inode btree type, but we need
414 * to check defensively here in case the cursor state is also screwed
415 * up.
416 */
417 if (bp == NULL) {
418 if (!(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE))
419 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
420 return 0;
421 }
422
423 /*
424 * We want to cross-reference each btree block with the bnobt
425 * and the rmapbt. We cannot cross-reference the bnobt or
426 * rmapbt while scanning the bnobt or rmapbt, respectively,
427 * because we cannot alter the cursor and we'd prefer not to
428 * duplicate cursors. Therefore, save the buffer daddr for
429 * later scanning.
430 */
431 if (cur->bc_btnum == XFS_BTNUM_BNO || cur->bc_btnum == XFS_BTNUM_RMAP) {
432 co = kmem_alloc(sizeof(struct check_owner),
433 KM_MAYFAIL);
434 if (!co)
435 return -ENOMEM;
436 co->level = level;
437 co->daddr = XFS_BUF_ADDR(bp);
438 list_add_tail(&co->list, &bs->to_check);
439 return 0;
440 }
441
442 return xchk_btree_check_block_owner(bs, level, XFS_BUF_ADDR(bp));
443}
444
445/*
446 * Check that this btree block has at least minrecs records or is one of the
447 * special blocks that don't require that.
448 */
449STATIC void
450xchk_btree_check_minrecs(
451 struct xchk_btree *bs,
452 int level,
453 struct xfs_btree_block *block)
454{
455 unsigned int numrecs;
456 int ok_level;
457
458 numrecs = be16_to_cpu(block->bb_numrecs);
459
460 /* More records than minrecs means the block is ok. */
461 if (numrecs >= bs->cur->bc_ops->get_minrecs(bs->cur, level))
462 return;
463
464 /*
465 * Certain btree blocks /can/ have fewer than minrecs records. Any
466 * level greater than or equal to the level of the highest dedicated
467 * btree block are allowed to violate this constraint.
468 *
469 * For a btree rooted in a block, the btree root can have fewer than
470 * minrecs records. If the btree is rooted in an inode and does not
471 * store records in the root, the direct children of the root and the
472 * root itself can have fewer than minrecs records.
473 */
474 ok_level = bs->cur->bc_nlevels - 1;
475 if (bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)
476 ok_level--;
477 if (level >= ok_level)
478 return;
479
480 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
481}
482
483/*
484 * Grab and scrub a btree block given a btree pointer. Returns block
485 * and buffer pointers (if applicable) if they're ok to use.
486 */
487STATIC int
488xchk_btree_get_block(
489 struct xchk_btree *bs,
490 int level,
491 union xfs_btree_ptr *pp,
492 struct xfs_btree_block **pblock,
493 struct xfs_buf **pbp)
494{
495 xfs_failaddr_t failed_at;
496 int error;
497
498 *pblock = NULL;
499 *pbp = NULL;
500
501 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock);
502 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) ||
503 !*pblock)
504 return error;
505
506 xfs_btree_get_block(bs->cur, level, pbp);
507 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS)
508 failed_at = __xfs_btree_check_lblock(bs->cur, *pblock,
509 level, *pbp);
510 else
511 failed_at = __xfs_btree_check_sblock(bs->cur, *pblock,
512 level, *pbp);
513 if (failed_at) {
514 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
515 return 0;
516 }
517 if (*pbp)
518 xchk_buffer_recheck(bs->sc, *pbp);
519
520 xchk_btree_check_minrecs(bs, level, *pblock);
521
522 /*
523 * Check the block's owner; this function absorbs error codes
524 * for us.
525 */
526 error = xchk_btree_check_owner(bs, level, *pbp);
527 if (error)
528 return error;
529
530 /*
531 * Check the block's siblings; this function absorbs error codes
532 * for us.
533 */
534 return xchk_btree_block_check_siblings(bs, *pblock);
535}
536
537/*
538 * Check that the low and high keys of this block match the keys stored
539 * in the parent block.
540 */
541STATIC void
542xchk_btree_block_keys(
543 struct xchk_btree *bs,
544 int level,
545 struct xfs_btree_block *block)
546{
547 union xfs_btree_key block_keys;
548 struct xfs_btree_cur *cur = bs->cur;
549 union xfs_btree_key *high_bk;
550 union xfs_btree_key *parent_keys;
551 union xfs_btree_key *high_pk;
552 struct xfs_btree_block *parent_block;
553 struct xfs_buf *bp;
554
555 if (level >= cur->bc_nlevels - 1)
556 return;
557
558 /* Calculate the keys for this block. */
559 xfs_btree_get_keys(cur, block, &block_keys);
560
561 /* Obtain the parent's copy of the keys for this block. */
562 parent_block = xfs_btree_get_block(cur, level + 1, &bp);
563 parent_keys = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1],
564 parent_block);
565
566 if (cur->bc_ops->diff_two_keys(cur, &block_keys, parent_keys) != 0)
567 xchk_btree_set_corrupt(bs->sc, cur, 1);
568
569 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING))
570 return;
571
572 /* Get high keys */
573 high_bk = xfs_btree_high_key_from_key(cur, &block_keys);
574 high_pk = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1],
575 parent_block);
576
577 if (cur->bc_ops->diff_two_keys(cur, high_bk, high_pk) != 0)
578 xchk_btree_set_corrupt(bs->sc, cur, 1);
579}
580
581/*
582 * Visit all nodes and leaves of a btree. Check that all pointers and
583 * records are in order, that the keys reflect the records, and use a callback
584 * so that the caller can verify individual records.
585 */
586int
587xchk_btree(
588 struct xfs_scrub *sc,
589 struct xfs_btree_cur *cur,
590 xchk_btree_rec_fn scrub_fn,
591 const struct xfs_owner_info *oinfo,
592 void *private)
593{
594 struct xchk_btree bs = {
595 .cur = cur,
596 .scrub_rec = scrub_fn,
597 .oinfo = oinfo,
598 .firstrec = true,
599 .private = private,
600 .sc = sc,
601 };
602 union xfs_btree_ptr ptr;
603 union xfs_btree_ptr *pp;
604 union xfs_btree_rec *recp;
605 struct xfs_btree_block *block;
606 int level;
607 struct xfs_buf *bp;
608 struct check_owner *co;
609 struct check_owner *n;
610 int i;
611 int error = 0;
612
613 /* Initialize scrub state */
614 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++)
615 bs.firstkey[i] = true;
616 INIT_LIST_HEAD(&bs.to_check);
617
618 /* Don't try to check a tree with a height we can't handle. */
619 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) {
620 xchk_btree_set_corrupt(sc, cur, 0);
621 goto out;
622 }
623
624 /*
625 * Load the root of the btree. The helper function absorbs
626 * error codes for us.
627 */
628 level = cur->bc_nlevels - 1;
629 cur->bc_ops->init_ptr_from_cur(cur, &ptr);
630 if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr))
631 goto out;
632 error = xchk_btree_get_block(&bs, level, &ptr, &block, &bp);
633 if (error || !block)
634 goto out;
635
636 cur->bc_ptrs[level] = 1;
637
638 while (level < cur->bc_nlevels) {
639 block = xfs_btree_get_block(cur, level, &bp);
640
641 if (level == 0) {
642 /* End of leaf, pop back towards the root. */
643 if (cur->bc_ptrs[level] >
644 be16_to_cpu(block->bb_numrecs)) {
645 xchk_btree_block_keys(&bs, level, block);
646 if (level < cur->bc_nlevels - 1)
647 cur->bc_ptrs[level + 1]++;
648 level++;
649 continue;
650 }
651
652 /* Records in order for scrub? */
653 xchk_btree_rec(&bs);
654
655 /* Call out to the record checker. */
656 recp = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block);
657 error = bs.scrub_rec(&bs, recp);
658 if (error)
659 break;
660 if (xchk_should_terminate(sc, &error) ||
661 (sc->sm->sm_flags & XFS_SCRUB_OFLAG_CORRUPT))
662 break;
663
664 cur->bc_ptrs[level]++;
665 continue;
666 }
667
668 /* End of node, pop back towards the root. */
669 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) {
670 xchk_btree_block_keys(&bs, level, block);
671 if (level < cur->bc_nlevels - 1)
672 cur->bc_ptrs[level + 1]++;
673 level++;
674 continue;
675 }
676
677 /* Keys in order for scrub? */
678 xchk_btree_key(&bs, level);
679
680 /* Drill another level deeper. */
681 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block);
682 if (!xchk_btree_ptr_ok(&bs, level, pp)) {
683 cur->bc_ptrs[level]++;
684 continue;
685 }
686 level--;
687 error = xchk_btree_get_block(&bs, level, pp, &block, &bp);
688 if (error || !block)
689 goto out;
690
691 cur->bc_ptrs[level] = 1;
692 }
693
694out:
695 /* Process deferred owner checks on btree blocks. */
696 list_for_each_entry_safe(co, n, &bs.to_check, list) {
697 if (!error && bs.cur)
698 error = xchk_btree_check_block_owner(&bs,
699 co->level, co->daddr);
700 list_del(&co->list);
701 kmem_free(co);
702 }
703
704 return error;
705}