HomeSort by: relevance | last modified time | path
    Searched refs:RET_ERROR (Results 1 - 19 of 19) sorted by relevancy

  /src/lib/libc/db/recno/
rec_close.c 60 * RET_ERROR, RET_SUCCESS
76 if (__rec_sync(dbp, 0) == RET_ERROR)
77 return (RET_ERROR);
82 status = RET_ERROR;
87 status = RET_ERROR;
90 status = RET_ERROR;
94 if (__bt_close(dbp) == RET_ERROR)
95 status = RET_ERROR;
107 * RET_SUCCESS, RET_ERROR.
134 if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
    [all...]
rec_seq.c 61 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
102 t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
103 return (RET_ERROR);
108 return (RET_ERROR);
120 return (RET_ERROR);
rec_put.c 61 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is
92 return (RET_ERROR);
135 return (RET_ERROR);
144 t->bt_irec(t, nrec) == RET_ERROR)
145 return (RET_ERROR);
149 return (RET_ERROR);
159 return (RET_ERROR);
190 * RET_ERROR, RET_SUCCESS
211 if (__ovfl_put(t, data, &pg) == RET_ERROR)
212 return (RET_ERROR);
    [all...]
rec_utils.c 61 * RET_SUCCESS, RET_ERROR.
76 return (RET_ERROR);
97 return (RET_ERROR);
104 return (RET_ERROR);
rec_get.c 63 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
84 return (RET_ERROR);
100 return (RET_ERROR);
118 * RET_ERROR, RET_SUCCESS
132 return (RET_ERROR);
149 return (RET_ERROR);
171 * RET_ERROR, RET_SUCCESS
193 return (RET_ERROR);
201 return (RET_ERROR);
225 * RET_ERROR, RET_SUCCES
    [all...]
rec_delete.c 64 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
101 return (RET_ERROR);
117 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
128 return (RET_ERROR);
149 * RET_SUCCESS, RET_ERROR.
172 if (rl->flags & P_BIGDATA && __ovfl_delete(t, rl->bytes) == RET_ERROR)
173 return (RET_ERROR);
rec_open.c 211 t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
  /src/lib/libc/db/btree/
bt_close.c 63 * RET_ERROR, RET_SUCCESS
80 if (__bt_sync(dbp, 0) == RET_ERROR)
81 return (RET_ERROR);
84 if (mpool_close(t->bt_mp) == RET_ERROR)
85 return (RET_ERROR);
107 return (close(fd) ? RET_ERROR : RET_SUCCESS);
117 * RET_SUCCESS, RET_ERROR.
136 return (RET_ERROR);
143 if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
144 return (RET_ERROR);
    [all...]
bt_put.c 66 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is already in the
93 return (RET_ERROR);
112 return (RET_ERROR);
126 storekey: if (__ovfl_put(t, key, &pg) == RET_ERROR)
127 return (RET_ERROR);
137 if (__ovfl_put(t, data, &pg) == RET_ERROR)
138 return (RET_ERROR);
156 return (RET_ERROR);
167 return (RET_ERROR);
191 delete: if (__bt_dleaf(t, key, h, (u_int)idx) == RET_ERROR) {
    [all...]
bt_delete.c 83 return (RET_ERROR);
100 return (RET_ERROR);
108 return (RET_ERROR);
114 return (RET_ERROR);
124 return (RET_ERROR);
285 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
298 return (deleted ? RET_SUCCESS : RET_ERROR);
314 return (RET_ERROR);
319 return (RET_ERROR);
335 if (__bt_dleaf(t, key, h, (u_int)e->index) == RET_ERROR) {
    [all...]
bt_seq.c 79 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
118 return (RET_ERROR);
153 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
175 return (RET_ERROR);
185 return (RET_ERROR);
209 return (RET_ERROR);
243 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
288 if ((rval = __bt_first(t, &c->key, ep, &exact)) == RET_ERROR)
289 return RET_ERROR;
303 return (RET_ERROR);
    [all...]
bt_get.c 63 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
83 return (RET_ERROR);
87 return (RET_ERROR);
bt_overflow.c 80 * RET_ERROR, RET_SUCCESS
102 return (RET_ERROR);
116 return (RET_ERROR);
137 * RET_ERROR, RET_SUCCESS
162 return (RET_ERROR);
194 * RET_ERROR, RET_SUCCESS
212 return (RET_ERROR);
230 return (RET_ERROR);
bt_utils.c 66 * RET_SUCCESS, RET_ERROR.
87 return (RET_ERROR);
93 return (RET_ERROR);
112 return (RET_ERROR);
119 return (RET_ERROR);
189 return (RET_ERROR);
bt_open.c 313 if (nroot(t) == RET_ERROR)
349 * RET_ERROR, RET_SUCCESS
369 return (RET_ERROR);
373 return (RET_ERROR);
376 return (RET_ERROR);
379 return (RET_ERROR);
bt_split.c 79 * RET_ERROR, RET_SUCCESS
107 return (RET_ERROR);
125 bt_rroot(t, sp, l, r) : bt_broot(t, sp, l, r)) == RET_ERROR)
251 if (bt_preserve(t, pgno) == RET_ERROR)
304 bt_rroot(t, sp, l, r) : bt_broot(t, sp, l, r)) == RET_ERROR)
329 return (RET_ERROR);
488 * RET_ERROR, RET_SUCCESS
533 * RET_ERROR, RET_SUCCESS
572 if (bt_preserve(t, pgno) == RET_ERROR)
573 return (RET_ERROR);
    [all...]
  /src/lib/libc/db/db/
db.c 88 return (RET_ERROR);
  /src/lib/libc/db/mpool/
mpool.c 349 mpool_write(mp, bp) == RET_ERROR)
350 return RET_ERROR;
353 return fsync(mp->fd) ? RET_ERROR : RET_SUCCESS;
380 mpool_write(mp, bp) == RET_ERROR)
435 return RET_ERROR;
440 return RET_ERROR;
  /src/include/
db.h 42 #define RET_ERROR -1 /* Return values. */

Completed in 18 milliseconds