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

  /src/lib/libc/db/btree/
bt_close.c 63 * RET_ERROR, RET_SUCCESS
107 return (close(fd) ? RET_ERROR : RET_SUCCESS);
117 * RET_SUCCESS, RET_ERROR.
141 return (RET_SUCCESS);
146 if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
159 * RET_ERROR, RET_SUCCESS
180 return (RET_SUCCESS);
bt_overflow.c 80 * RET_ERROR, RET_SUCCESS
125 return (RET_SUCCESS);
137 * RET_ERROR, RET_SUCCESS
183 return (RET_SUCCESS);
194 * RET_ERROR, RET_SUCCESS
217 return (RET_SUCCESS);
232 return (RET_SUCCESS);
bt_delete.c 112 if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) {
117 (u_int)(status == RET_SUCCESS ?
126 if (status == RET_SUCCESS)
285 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
298 return (deleted ? RET_SUCCESS : RET_ERROR);
301 return (deleted ? RET_SUCCESS : RET_SPECIAL);
322 return (RET_SUCCESS);
355 return (RET_SUCCESS);
367 * RET_SUCCESS, RET_ERROR.
449 return (RET_SUCCESS);
    [all...]
bt_seq.c 79 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
121 if (status == RET_SUCCESS) {
153 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
228 return (RET_SUCCESS);
243 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
346 return (RET_SUCCESS);
369 return (RET_SUCCESS);
407 return RET_SUCCESS;
446 return RET_SUCCESS;
483 return (RET_SUCCESS);
    [all...]
bt_put.c 66 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is already in the
207 data, dflags, nbytes, (u_int)idx)) != RET_SUCCESS)
250 return (RET_SUCCESS);
bt_utils.c 66 * RET_SUCCESS, RET_ERROR.
107 return (RET_SUCCESS);
131 return (RET_SUCCESS);
bt_open.c 349 * RET_ERROR, RET_SUCCESS
365 return RET_SUCCESS;
388 return (RET_SUCCESS);
bt_split.c 79 * RET_ERROR, RET_SUCCESS
316 return (RET_SUCCESS);
488 * RET_ERROR, RET_SUCCESS
520 return (RET_SUCCESS);
533 * RET_ERROR, RET_SUCCESS
596 return (RET_SUCCESS);
795 * RET_SUCCESS, RET_ERROR.
806 return (RET_SUCCESS);
  /src/lib/libc/db/recno/
rec_get.c 63 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
94 if ((status = t->bt_irec(t, nrec)) != RET_SUCCESS)
118 * RET_ERROR, RET_SUCCESS
148 nrec, &data, 0) != RET_SUCCESS)
160 return (RET_SUCCESS);
171 * RET_ERROR, RET_SUCCESS
192 != RET_SUCCESS)
214 return (RET_SUCCESS);
225 * RET_ERROR, RET_SUCCESS
257 if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
    [all...]
rec_close.c 60 * RET_ERROR, RET_SUCCESS
80 status = RET_SUCCESS;
107 * RET_SUCCESS, RET_ERROR.
131 return (RET_SUCCESS);
154 while (status == RET_SUCCESS) {
165 while (status == RET_SUCCESS) {
185 return (RET_SUCCESS);
rec_delete.c 64 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
96 if (status == RET_SUCCESS)
104 if (status == RET_SUCCESS)
117 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
133 if (status != RET_SUCCESS) {
138 return (RET_SUCCESS);
149 * RET_SUCCESS, RET_ERROR.
196 return (RET_SUCCESS);
rec_utils.c 61 * RET_SUCCESS, RET_ERROR.
86 return (RET_SUCCESS);
115 return (RET_SUCCESS);
rec_put.c 61 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is
158 t->bt_nrecs, &tdata, 0) != RET_SUCCESS)
165 if ((status = __rec_iput(t, nrec - 1, &fdata, flags)) != RET_SUCCESS)
190 * RET_ERROR, RET_SUCCESS
263 if (status == RET_SUCCESS)
281 return (RET_SUCCESS);
rec_seq.c 61 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
113 (status = t->bt_irec(t, nrec)) != RET_SUCCESS)
  /src/lib/libc/db/mpool/
mpool.c 187 return RET_SUCCESS;
313 return (RET_SUCCESS);
334 return RET_SUCCESS;
353 return fsync(mp->fd) ? RET_ERROR : RET_SUCCESS;
452 return RET_SUCCESS;
  /src/include/
db.h 43 #define RET_SUCCESS 0

Completed in 173 milliseconds