usr.sbin/ldapctl/ldapctl.c

193

if (rc != BT_SUCCESS)

usr.sbin/ldapctl/ldapctl.c

205

if (btree_txn_commit(ns->indx_txn) != BT_SUCCESS)

usr.sbin/ldapd/btest.c

112

flags)) == BT_SUCCESS) {

usr.sbin/ldapd/btest.c

121

if ((rc = btree_compact(bt)) != BT_SUCCESS)

usr.sbin/ldapd/btest.c

124

if ((rc = btree_revert(bt)) != BT_SUCCESS)

usr.sbin/ldapd/btest.c

72

if (rc == BT_SUCCESS)

usr.sbin/ldapd/btest.c

82

if (rc == BT_SUCCESS)

usr.sbin/ldapd/btest.c

92

if (rc == BT_SUCCESS) {

usr.sbin/ldapd/btree.c

1024

return BT_SUCCESS; /* new file */

usr.sbin/ldapd/btree.c

1052

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1069

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1301

if (btree_read_page(bt, pgno, mp->page) != BT_SUCCESS) {

usr.sbin/ldapd/btree.c

1433

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1461

if ((rc = btree_read_meta(bt, NULL)) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1523

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1551

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1584

if ((rc = btree_search_page(bt, txn, key, NULL, 0, &mp)) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1621

if ((rc = btree_sibling(cursor, move_right)) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1643

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1695

if (btree_sibling(cursor, 1) != BT_SUCCESS) {

usr.sbin/ldapd/btree.c

1711

if (data && btree_read_data(cursor->bt, mp, leaf, data) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1717

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1734

if (rc != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1748

if (btree_sibling(cursor, 1) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1760

if (data && btree_read_data(cursor->bt, mp, leaf, data) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1768

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1779

if (rc != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1787

if (data && btree_read_data(cursor->bt, mp, leaf, data) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

1793

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

1934

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2029

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2153

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2191

if (btree_update_key(bt, src, i, &key) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2195

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2251

tmpkey.len - dst->prefix.len) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2262

&low) == BT_SUCCESS);

usr.sbin/ldapd/btree.c

2287

if (rc != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2305

&key) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2312

assert(btree_update_key(bt, src, 0, &nullkey) == BT_SUCCESS);

usr.sbin/ldapd/btree.c

2324

&key) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2331

assert(btree_update_key(bt, dst, 0, &nullkey) == BT_SUCCESS);

usr.sbin/ldapd/btree.c

2341

src->prefix.len - pfxlen) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2349

dst->prefix.len - pfxlen) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2363

mp->prefix.len - mp_pfxlen) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2368

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2401

dstpfx.len - dst->prefix.len) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2419

&low) == BT_SUCCESS);

usr.sbin/ldapd/btree.c

2435

if (rc != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2447

if (btree_update_key(bt, src->parent, 0, &key) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2485

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2506

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

2606

if ((rc = btree_search_page(bt, txn, key, NULL, 1, &mp)) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2616

if (data && (rc = btree_read_data(bt, NULL, leaf, data)) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2622

if (rc != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2627

if (rc == BT_SUCCESS)

usr.sbin/ldapd/btree.c

2700

int rc = BT_SUCCESS, ins_new = 0;

usr.sbin/ldapd/btree.c

2734

mp->pgno, 0) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2808

if (rc != BT_SUCCESS) {

usr.sbin/ldapd/btree.c

2887

int rc = BT_SUCCESS, exact, close_txn = 0;

usr.sbin/ldapd/btree.c

2929

if (rc == BT_SUCCESS) {

usr.sbin/ldapd/btree.c

2977

if (rc != BT_SUCCESS)

usr.sbin/ldapd/btree.c

2984

if (rc == BT_SUCCESS)

usr.sbin/ldapd/btree.c

3101

if (btree_write_meta(btc, root, 0) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

3114

if (btree_write_meta(bt, P_INVALID, BT_TOMBSTONE) != BT_SUCCESS)

usr.sbin/ldapd/btree.c

630

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

681

if (btree_read_meta(bt, &txn->next_pgno) != BT_SUCCESS) {

usr.sbin/ldapd/btree.c

823

btree_write_meta(bt, txn->root, 0) != BT_SUCCESS ||

usr.sbin/ldapd/btree.c

833

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

874

return BT_SUCCESS;

usr.sbin/ldapd/btree.c

966

return BT_SUCCESS;

usr.sbin/ldapd/namespace.c

345

if (rc != BT_SUCCESS) {

usr.sbin/ldapd/namespace.c

355

if (update && (rc = unindex_entry(ns, &key, root)) != BT_SUCCESS)

usr.sbin/ldapd/namespace.c

395

if (rc == BT_SUCCESS && (root = namespace_db2ber(ns, &data)) != NULL)

usr.sbin/ldapd/namespace.c

81

btree_txn_commit(ns->indx_txn) != BT_SUCCESS) {

usr.sbin/ldapd/namespace.c

90

btree_txn_commit(ns->data_txn) != BT_SUCCESS) {

usr.sbin/ldapd/search.c

279

return BT_SUCCESS;

usr.sbin/ldapd/search.c

296

int i, rc = BT_SUCCESS;

usr.sbin/ldapd/search.c

341

for (i = 0; i < 10 && rc == BT_SUCCESS; i++) {

usr.sbin/ldapd/search.c

345

if (rc == BT_SUCCESS && search->plan->indexed) {

usr.sbin/ldapd/search.c

363

rc = BT_SUCCESS;

usr.sbin/ldapd/search.c

374

if (rc != BT_SUCCESS) {

usr.sbin/ldapd/search.c

422

rc = BT_SUCCESS;

usr.sbin/ldapd/search.c

448

if (rc == BT_SUCCESS && search->plan->indexed > 1)

usr.sbin/ldapd/search.c

454

if (rc == BT_SUCCESS && search->szlim > 0 &&

usr.sbin/ldapd/search.c

945

&search->indx_txn, 1) != BT_SUCCESS) {