top 48 arch/x86/kernel/cpu/centaur.c u32 top = 0;
top 70 arch/x86/kernel/cpu/centaur.c if (end > top)
top 71 arch/x86/kernel/cpu/centaur.c top = end;
top 85 arch/x86/kernel/cpu/centaur.c if (top > clip)
top 86 arch/x86/kernel/cpu/centaur.c top = clip;
top 88 arch/x86/kernel/cpu/centaur.c return top;
top 99 arch/x86/kernel/cpu/centaur.c u32 top = root;
top 111 arch/x86/kernel/cpu/centaur.c high = power2(mem-top);
top 144 arch/x86/kernel/cpu/centaur.c centaur_mcr_insert(ct, top, high, key);
top 145 arch/x86/kernel/cpu/centaur.c top += high;
top 638 arch/x86/math-emu/errors.c top--;
top 37 arch/x86/math-emu/fpu_aux.c top = 0; /* We don't keep top in the status word internally. */
top 127 arch/x86/math-emu/fpu_aux.c int regnr = top & 7, regnri = ((regnr + i) & 7);
top 146 arch/x86/math-emu/fpu_emu.h #define st(x) ( * ((FPU_REG *)( register_base + 10 * ((top+x) & 7) )) )
top 156 arch/x86/math-emu/fpu_emu.h #define push() { top--; }
top 19 arch/x86/math-emu/fpu_tags.c fpu_tag_word |= 3 << ((top & 7) * 2);
top 20 arch/x86/math-emu/fpu_tags.c top++;
top 25 arch/x86/math-emu/fpu_tags.c return (fpu_tag_word >> ((top & 7) * 2)) & 3;
top 30 arch/x86/math-emu/fpu_tags.c return (fpu_tag_word >> (((top + stnr) & 7) * 2)) & 3;
top 40 arch/x86/math-emu/fpu_tags.c int regnr = top;
top 48 arch/x86/math-emu/fpu_tags.c int regnr = stnr + top;
top 82 arch/x86/math-emu/fpu_tags.c int regnr = (top + stnr) & 7;
top 91 arch/x86/math-emu/fpu_tags.c return ((fpu_tag_word >> (((top - 1) & 7) * 2)) & 3) != TAG_Empty;
top 108 arch/x86/math-emu/fpu_tags.c int regnr = top;
top 438 arch/x86/math-emu/fpu_trig.c top--;
top 444 arch/x86/math-emu/fpu_trig.c top++;
top 34 arch/x86/math-emu/load_store.c #define pop_0() { FPU_settag0(TAG_Empty); top++; }
top 99 arch/x86/math-emu/load_store.c top--;
top 121 arch/x86/math-emu/load_store.c top++;
top 140 arch/x86/math-emu/load_store.c top++;
top 1080 arch/x86/math-emu/reg_ld_str.c top = (partial_status >> SW_Top_Shift) & 7;
top 1123 arch/x86/math-emu/reg_ld_str.c int offset = (top & 7) * 10, other = 80 - offset;
top 1134 arch/x86/math-emu/reg_ld_str.c regnr = (i + top) & 7;
top 1201 arch/x86/math-emu/reg_ld_str.c int offset = (top & 7) * 10, other = 80 - offset;
top 50 arch/x86/math-emu/status_w.h ((partial_status & ~SW_Top & 0xffff) | ((top << SW_Top_Shift) & SW_Top))
top 1397 arch/x86/xen/enlighten.c unsigned long top = HYPERVISOR_VIRT_START;
top 1401 arch/x86/xen/enlighten.c top = pp.virt_start;
top 1403 arch/x86/xen/enlighten.c reserve_top_address(-top);
top 50 fs/autofs4/expire.c struct dentry *top = dentry;
top 68 fs/autofs4/expire.c struct autofs_info *ino = autofs4_dentry_ino(top);
top 114 fs/autofs4/expire.c top, (int) top->d_name.len, top->d_name.name);
top 118 fs/autofs4/expire.c struct autofs_info *ino = autofs4_dentry_ino(top);
top 125 fs/autofs4/expire.c if (!autofs4_can_expire(top, timeout, do_now))
top 139 fs/autofs4/expire.c struct autofs_info *top_ino = autofs4_dentry_ino(top);
top 143 fs/autofs4/expire.c top, (int)top->d_name.len, top->d_name.name);
top 146 fs/autofs4/expire.c if (!simple_positive(top))
top 150 fs/autofs4/expire.c for (p = top; p; p = next_dentry(p, top)) {
top 184 fs/autofs4/expire.c if (p == top)
top 201 fs/autofs4/expire.c if (!autofs4_can_expire(top, timeout, do_now))
top 886 fs/binfmt_elf_fdpic.c unsigned long load_addr, base = ULONG_MAX, top = 0, maddr = 0, mflags;
top 902 fs/binfmt_elf_fdpic.c if (top < phdr->p_vaddr + phdr->p_memsz)
top 903 fs/binfmt_elf_fdpic.c top = phdr->p_vaddr + phdr->p_memsz;
top 912 fs/binfmt_elf_fdpic.c maddr = do_mmap(NULL, load_addr, top - base,
top 919 fs/binfmt_elf_fdpic.c load_addr += PAGE_ALIGN(top - base);
top 731 fs/compat_ioctl.c void __user *top = compat_alloc_user_space(0);
top 734 fs/compat_ioctl.c if (new > top)
top 221 fs/dlm/debug_fs.c top:
top 250 fs/dlm/debug_fs.c goto top;
top 879 fs/ext2/inode.c *top = 0;
top 905 fs/ext2/inode.c *top = *p->p;
top 1982 fs/ext3/inode.c *top = 0;
top 2008 fs/ext3/inode.c *top = *p->p;
top 575 fs/ext3/namei.c struct ext3_dir_entry_2 *de, *top;
top 583 fs/ext3/namei.c top = (struct ext3_dir_entry_2 *) ((char *) de +
top 586 fs/ext3/namei.c for (; de < top; de = ext3_next_entry(de)) {
top 738 fs/ext3/namei.c struct dx_map_entry *p, *q, *top = map + count - 1;
top 746 fs/ext3/namei.c for (p = top, q = p - count; q >= map; p--, q--)
top 753 fs/ext3/namei.c q = top;
top 967 fs/ext3/namei.c struct ext3_dir_entry_2 *de, *top;
top 992 fs/ext3/namei.c top = (struct ext3_dir_entry_2 *) ((char *) de + sb->s_blocksize -
top 994 fs/ext3/namei.c for (; de < top; de = ext3_next_entry(de)) {
top 1279 fs/ext3/namei.c char *top;
top 1284 fs/ext3/namei.c top = bh->b_data + dir->i_sb->s_blocksize - reclen;
top 1285 fs/ext3/namei.c while ((char *) de <= top) {
top 1302 fs/ext3/namei.c if ((char *) de > top)
top 1368 fs/ext3/namei.c char *data1, *top;
top 1401 fs/ext3/namei.c top = data1 + len;
top 1402 fs/ext3/namei.c while ((char *)(de2 = ext3_next_entry(de)) < top)
top 3319 fs/ext4/inode.c *top = 0;
top 3345 fs/ext4/inode.c *top = *p->p;
top 578 fs/ext4/namei.c struct ext4_dir_entry_2 *de, *top;
top 587 fs/ext4/namei.c top = (struct ext4_dir_entry_2 *) ((char *) de +
top 590 fs/ext4/namei.c for (; de < top; de = ext4_next_entry(de)) {
top 742 fs/ext4/namei.c struct dx_map_entry *p, *q, *top = map + count - 1;
top 749 fs/ext4/namei.c for (p = top, q = p - count; q >= map; p--, q--)
top 756 fs/ext4/namei.c q = top;
top 972 fs/ext4/namei.c struct ext4_dir_entry_2 *de, *top;
top 996 fs/ext4/namei.c top = (struct ext4_dir_entry_2 *) ((char *) de + sb->s_blocksize -
top 998 fs/ext4/namei.c for (; de < top; de = ext4_next_entry(de)) {
top 1282 fs/ext4/namei.c char *top;
top 1287 fs/ext4/namei.c top = bh->b_data + dir->i_sb->s_blocksize - reclen;
top 1288 fs/ext4/namei.c while ((char *) de <= top) {
top 1305 fs/ext4/namei.c if ((char *) de > top)
top 1371 fs/ext4/namei.c char *data1, *top;
top 1404 fs/ext4/namei.c top = data1 + len;
top 1405 fs/ext4/namei.c while ((char *)(de2 = ext4_next_entry(de)) < top)
top 687 fs/gfs2/bmap.c __be64 *top, *bottom;
top 698 fs/gfs2/bmap.c top = (__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)) + mp->mp_list[0];
top 705 fs/gfs2/bmap.c top = (__be64 *)(bh->b_data + mh_size) +
top 711 fs/gfs2/bmap.c error = bc(ip, dibh, bh, top, bottom, height, data);
top 716 fs/gfs2/bmap.c for (; top < bottom; top++, first = 0) {
top 717 fs/gfs2/bmap.c if (!*top)
top 720 fs/gfs2/bmap.c bn = be64_to_cpu(*top);
top 762 fs/gfs2/bmap.c if (!*top)
top 769 fs/gfs2/bmap.c top++;
top 785 fs/gfs2/bmap.c for (p = top; p < bottom; p++) {
top 833 fs/gfs2/bmap.c for (p = top; p < bottom; p++) {
top 98 fs/hfs/hfs.h __be16 top;
top 211 fs/hfsplus/hfsplus_raw.h __be16 top;
top 119 fs/jfs/jfs_btree.h struct btframe *top;
top 125 fs/jfs/jfs_btree.h (btstack)->top = (btstack)->stack
top 128 fs/jfs/jfs_btree.h ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
top 133 fs/jfs/jfs_btree.h (BTSTACK)->top->bn = BN;\
top 134 fs/jfs/jfs_btree.h (BTSTACK)->top->index = INDEX;\
top 135 fs/jfs/jfs_btree.h ++(BTSTACK)->top;\
top 139 fs/jfs/jfs_btree.h ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
top 142 fs/jfs/jfs_btree.h ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
top 169 fs/jfs/jfs_btree.h if (! BT_IS_ROOT((BTSTACK)->top->mp))\
top 170 fs/jfs/jfs_btree.h release_metapage((BTSTACK)->top->mp);\
top 703 fs/jfs/jfs_dtree.c btsp = btstack->top;
top 752 fs/jfs/jfs_dtree.c btsp = btstack->top;
top 842 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
top 2107 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 2476 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
top 2704 fs/jfs/jfs_dtree.c btsp = btstack->top;
top 3117 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 3167 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 3360 fs/jfs/jfs_dtree.c btsp = btstack->top;
top 3429 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
top 3485 fs/jfs/jfs_dtree.c btsp = btstack->top;
top 3561 fs/jfs/jfs_dtree.c btsp = btstack->top;
top 4534 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 1150 fs/jfs/jfs_txnmgr.c ino_t top;
top 1206 fs/jfs/jfs_txnmgr.c top = (cd.iplist[k])->i_ino;
top 1209 fs/jfs/jfs_txnmgr.c if (ip->i_ino > top) {
top 1210 fs/jfs/jfs_txnmgr.c top = ip->i_ino;
top 190 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 296 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 619 fs/jfs/jfs_xtree.c btsp = btstack->top;
top 666 fs/jfs/jfs_xtree.c btsp = btstack->top;
top 724 fs/jfs/jfs_xtree.c btsp = btstack->top;
top 829 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 1644 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 1811 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 1993 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
top 2307 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
top 2469 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 2618 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 2869 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
top 2890 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
top 2973 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
top 3218 fs/jfs/jfs_xtree.c btsp = btstack->top;
top 4010 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
top 225 fs/minix/itree_common.c *top = 0;
top 242 fs/minix/itree_common.c *top = *p->p;
top 3165 fs/ocfs2/dlm/dlmmaster.c top:
top 3273 fs/ocfs2/dlm/dlmmaster.c goto top;
top 285 fs/sysv/itree.c *top = 0;
top 312 fs/sysv/itree.c *top = *p->p;
top 475 include/asm-xtensa/uaccess.h unsigned long top = __kernel_ok ? ~0UL : TASK_SIZE - 1;
top 477 include/asm-xtensa/uaccess.h if ((unsigned long)str > top)
top 59 include/linux/idr.h struct idr_layer *top;
top 68 include/linux/idr.h .top = NULL, \
top 222 include/linux/videodev2.h __s32 top;
top 139 include/media/tuner.h #define TDA9887_TOP(top) (TDA9887_TOP_SET | (((16 + (top)) & 0x1f) << 8))
top 82 include/video/mbxfb.h __u8 top;
top 142 lib/idr.c p = idp->top;
top 208 lib/idr.c p = idp->top;
top 229 lib/idr.c for (new = p; p && p != idp->top; new = p) {
top 244 lib/idr.c rcu_assign_pointer(idp->top, p);
top 344 lib/idr.c struct idr_layer *p = idp->top;
top 351 lib/idr.c *++paa = &idp->top;
top 393 lib/idr.c if (idp->top && idp->top->count == 1 && (idp->layers > 1) &&
top 394 lib/idr.c idp->top->ary[0]) {
top 401 lib/idr.c to_free = idp->top;
top 402 lib/idr.c p = idp->top->ary[0];
top 403 lib/idr.c rcu_assign_pointer(idp->top, p);
top 442 lib/idr.c p = idp->top;
top 461 lib/idr.c rcu_assign_pointer(idp->top, NULL);
top 497 lib/idr.c p = rcu_dereference(idp->top);
top 540 lib/idr.c p = rcu_dereference(idp->top);
top 586 lib/idr.c p = idp->top;
top 811 lib/idr.c struct idr_layer *p = ida->idr.top;
top 45 lib/plist.c struct list_head *prev = top, *next = top->next;
top 47 lib/plist.c plist_check_prev_next(top, prev, next);
top 48 lib/plist.c while (next != top) {
top 51 lib/plist.c plist_check_prev_next(top, prev, next);
top 352 lib/zlib_deflate/deftree.c top = s->heap[SMALLEST]; \
top 158 net/sunrpc/auth_gss/gss_spkm3_token.c char *top = *hdrbuf;
top 175 net/sunrpc/auth_gss/gss_spkm3_token.c *hdrlen = hptr - top;
top 133 sound/sound_core.c while(n<top)
top 142 sound/sound_core.c if(n>=top)
top 213 sound/sound_core.c r = __sound_insert_unit(s, list, fops, index, low, top);