| bt_seq.c (14273) | bt_seq.c (29574) |
|---|---|
| 1/*- 2 * Copyright (c) 1990, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Mike Olson. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 344 unchanged lines hidden (view full) --- 353 * Find any matching record; __bt_search pins the page. 354 * 355 * If it's an exact match and duplicates are possible, walk backwards 356 * in the tree until we find the first one. Otherwise, make sure it's 357 * a valid key (__bt_search may return an index just past the end of a 358 * page) and return it. 359 */ 360 if ((ep = __bt_search(t, key, exactp)) == NULL) | 1/*- 2 * Copyright (c) 1990, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Mike Olson. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 344 unchanged lines hidden (view full) --- 353 * Find any matching record; __bt_search pins the page. 354 * 355 * If it's an exact match and duplicates are possible, walk backwards 356 * in the tree until we find the first one. Otherwise, make sure it's 357 * a valid key (__bt_search may return an index just past the end of a 358 * page) and return it. 359 */ 360 if ((ep = __bt_search(t, key, exactp)) == NULL) |
| 361 return (NULL); | 361 return (0); |
| 362 if (*exactp) { 363 if (F_ISSET(t, B_NODUPS)) { 364 *erval = *ep; 365 return (RET_SUCCESS); 366 } 367 368 /* 369 * Walk backwards, as long as the entry matches and there are --- 91 unchanged lines hidden --- | 362 if (*exactp) { 363 if (F_ISSET(t, B_NODUPS)) { 364 *erval = *ep; 365 return (RET_SUCCESS); 366 } 367 368 /* 369 * Walk backwards, as long as the entry matches and there are --- 91 unchanged lines hidden --- |