| /src/lib/libc/db/btree/ |
| bt_get.c | 70 int exact, status; local in function:__bt_get
86 if ((e = __bt_search(t, key, &exact)) == NULL)
88 if (!exact) {
|
| bt_seq.c | 160 int exact; local in function:__bt_seqset
177 return (__bt_first(t, key, ep, &exact));
252 int exact, rval; local in function:__bt_seqadv
263 * be in the current tree. If the returned key is an exact match,
270 * notices and doesn't do a put() of it. Since the key is an exact
273 * back a record if it's an exact match.
288 if ((rval = __bt_first(t, &c->key, ep, &exact)) == RET_ERROR)
290 if (!exact)
457 * exactp: pointer to exact match flag
473 * If it's an exact match and duplicates are possible, walk backward
[all...] |
| bt_put.c | 79 int dflags, exact, status; local in function:__bt_put
165 if (t->bt_order == NOT || (e = bt_fast(t, key, data, &exact)) == NULL)
166 if ((e = __bt_search(t, key, &exact)) == NULL)
179 if (!exact)
184 if (!exact || !F_ISSET(t, B_NODUPS))
|
| bt_delete.c | 153 int exact, level; local in function:__bt_stkacq
161 if ((e = __bt_search(t, &c->key, &exact)) == NULL)
220 if ((e = __bt_search(t, &c->key, &exact)) == NULL)
292 int deleted, exact, redo; local in function:__bt_bdelete
297 loop: if ((e = __bt_search(t, key, &exact)) == NULL)
299 if (!exact) {
|
| /src/lib/libform/ |
| type_enum.c | 56 bool exact; member in struct:__anon0f6d32f40108
96 new->exact = (va_arg(*args, int)) ? TRUE : FALSE;
99 new->ignore_case, new->exact);
149 bool exact, char *this, unsigned *match_num)
179 /* don't bother if we are after an exact match
183 if ((exact == TRUE) && (blen != elen))
191 if ((exact != TRUE) && (blen > elen))
234 ta->exact, args, &match_num) == TRUE) {
263 ta->exact, args, &cur_choice) == FALSE) {
299 ta->exact, args, &cur_choice) == FALSE)
[all...] |
