| # | Line 61 | Line 61 | char *key; | |
|---|---|---|
| 61 | { | |
| 62 | int hval, i; | |
| 63 | register int ndx; | |
| 64 | < | LUENT *oldtabl; |
| 64 | > | register LUENT *oldtabl; |
| 65 | /* look up object */ | |
| 66 | hval = lu_hash(key); | |
| 67 | tryagain: | |
| # | Line 83 | Line 83 | tryagain: | |
| 83 | } | |
| 84 | if (!ndx) | |
| 85 | goto tryagain; | |
| 86 | + | /* |
| 87 | + | * The following code may fail if the user has reclaimed many |
| 88 | + | * deleted entries and the system runs out of memory in a |
| 89 | + | * recursive call to lu_find(). |
| 90 | + | */ |
| 91 | while (ndx--) | |
| 92 | if (oldtabl[ndx].key != NULL) | |
| 93 | if (oldtabl[ndx].data != NULL) | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |