/fs/adfs/ |
H A D | inode.c | 172 unsigned int high, low; local 183 high = ADFS_I(inode)->loadaddr & 0xFF; /* top 8 bits of timestamp */ 189 nsec = (((s64) high << 32) | (s64) low) * 10000000; /* cs to ns */ 217 unsigned int high, low; local 222 high = (secs / 256) * 100 + (low >> 8) + 0x336e996a; 224 ADFS_I(inode)->loadaddr = (high >> 24) | 226 ADFS_I(inode)->execaddr = (low & 255) | (high << 8);
|
/fs/isofs/ |
H A D | rock.c | 376 int high, low; local 377 high = isonum_733(rr->u.PN.dev_high); 381 * sizeof(dev_t) <= 4, then the high field is 389 if ((low & ~0xff) && high == 0) { 394 MKDEV(high, low);
|
/fs/btrfs/ |
H A D | async-thread.c | 54 struct __btrfs_workqueue *high; member in struct:btrfs_workqueue 112 ret->normal_wq = alloc_workqueue("%s-%s-high", flags, 152 ret->high = __btrfs_alloc_workqueue(name, flags, max_active, 154 if (!ret->high) { 328 if (test_bit(WORK_HIGH_PRIO_BIT, &work->flags) && wq->high) 329 dest_wq = wq->high; 347 if (wq->high) 348 __btrfs_destroy_workqueue(wq->high); 358 if (wq->high) 359 wq->high [all...] |
H A D | ctree.c | 1748 int high = max; local 1759 while (low < high) { 1760 mid = (low + high) / 2; 1789 high = mid; 2476 * reduce lock contention at high levels
|
/fs/ |
H A D | read_write.c | 925 static inline loff_t pos_from_hilo(unsigned long high, unsigned long low) argument 928 return (((loff_t)high << HALF_LONG_BITS) << HALF_LONG_BITS) | low;
|
/fs/xfs/libxfs/ |
H A D | xfs_dir2_block.c | 296 int highstale; /* high stale index */ 348 int high; /* high index for binary srch */ local 349 int highstale; /* high stale index */ 438 for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { 439 mid = (low + high) >> 1; 445 high = mid - 1; 517 * Move entries toward the high-numbered stale entry. 671 int high; /* binar local [all...] |
H A D | xfs_inode_fork.c | 1542 int high; /* upper boundary in search */ local 1559 high = erp->er_extcount - 1; 1562 high = nextents - 1; 1565 while (low <= high) { 1566 idx = (low + high) >> 1; 1571 high = idx - 1; 1613 int high; /* binary search upper limit */ local 1620 high = nlists - 1; 1621 while (low <= high) { 1622 erp_idx = (low + high) >> 1655 int high; /* binary search upper limit */ local [all...] |
H A D | xfs_dir2_leaf.c | 521 int *lfloghigh) /* high leaf logging index */ 537 * Record low and high logging indices for the leaf. 583 * The high one is better, so use that one. 626 int lfloghigh; /* high leaf logging index */ 779 * There are stale entries, so we'll need log-low and log-high 976 int *highlogp) /* out: high log index */ 1042 * Remember the low/high stale value only in the "right" 1551 int high; /* high leaf index */ local 1567 for (lep = ents, low = 0, high [all...] |
H A D | xfs_btree.c | 1745 int high; /* high entry number */ local 1748 /* Set low and high entry numbers, 1-based. */ 1750 high = xfs_btree_get_numrecs(block); 1751 if (!high) { 1762 while (low <= high) { 1768 /* keyno is average of low and high. */ 1769 keyno = (low + high) >> 1; 1785 high = keyno - 1;
|
/fs/xfs/ |
H A D | xfs_rtalloc.c | 64 * by low and high, for the bitmap block bbno. 71 int high, /* high log2 extent size */ 84 for (log = low; log <= high; log++) { 67 xfs_rtany_summary( xfs_mount_t *mp, xfs_trans_t *tp, int low, int high, xfs_rtblock_t bbno, xfs_buf_t **rbpp, xfs_fsblock_t *rsb, int *stat) argument
|
/fs/nilfs2/ |
H A D | btree.c | 305 int index, low, high, s; local 309 high = nilfs_btree_node_get_nchildren(node) - 1; 312 while (low <= high) { 313 index = (low + high) / 2; 322 high = index - 1;
|
/fs/dlm/ |
H A D | lock.c | 2515 static int grant_pending_convert(struct dlm_rsb *r, int high, int *cw, argument 2568 return max_t(int, high, hi); 2571 static int grant_pending_wait(struct dlm_rsb *r, int high, int *cw, argument 2582 high = max_t(int, lkb->lkb_rqmode, high); 2588 return high; 2593 high is the largest rqmode of all locks blocked on the convert or 2596 static int lock_requires_bast(struct dlm_lkb *gr, int high, int cw) argument 2604 if (gr->lkb_highbast < high && 2605 !__dlm_compat_matrix[gr->lkb_grmode+1][high 2613 int high = DLM_LOCK_IV; local [all...] |
/fs/ocfs2/ |
H A D | xattr.c | 1800 int low = 0, high = count - 1, tmp; local 1807 while (low <= high && count) { 1808 tmp = (low + high) / 2; 1814 high = tmp - 1;
|