* NAME: node->insert() * DESCRIPTION: insert a new record into a node; return a record for parent */
| 371 | * DESCRIPTION: insert a new record into a node; return a record for parent |
| 372 | */ |
| 373 | int n_insert(node *np, byte *record, unsigned int *reclen) |
| 374 | { |
| 375 | /* check for free space */ |
| 376 | |
| 377 | if (np->nd.ndNRecs >= HFS_MAX_NRECS || |
| 378 | *reclen + 2 > NODEFREE(*np)) |
| 379 | return split(np, record, reclen); |
| 380 | |
| 381 | n_insertx(np, record, *reclen); |
| 382 | *reclen = 0; |
| 383 | |
| 384 | return bt_putnode(np); |
| 385 | } |
| 386 | |
| 387 | /* |
| 388 | * NAME: join() |
no test coverage detected