Rev 2736 | Rev 2742 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 2736 | Rev 2739 | ||
|---|---|---|---|
| Line 389... | Line 389... | ||
| 389 | bytes = max(0, min(dentry->size - pos, len)); |
389 | bytes = max(0, min(dentry->size - pos, len)); |
| 390 | (void) ipc_data_read_finalize(callid, dentry->data + pos, |
390 | (void) ipc_data_read_finalize(callid, dentry->data + pos, |
| 391 | bytes); |
391 | bytes); |
| 392 | } else { |
392 | } else { |
| 393 | int i; |
393 | int i; |
| 394 | tmpfs_dentry_t *cur = dentry->child; |
394 | tmpfs_dentry_t *cur; |
| 395 | 395 | ||
| 396 | assert(dentry->type == TMPFS_DIRECTORY); |
396 | assert(dentry->type == TMPFS_DIRECTORY); |
| 397 | 397 | ||
| 398 | /* |
398 | /* |
| 399 | * Yes, we really use O(n) algorithm here. |
399 | * Yes, we really use O(n) algorithm here. |