Searched refs:PTE (Results 1 – 25 of 53) sorted by relevance
123
15 PTE Page Table Helpers19 | pte_same | Tests whether both PTE entries are the same |21 | pte_present | Tests a valid mapped PTE |23 | pte_young | Tests a young PTE |25 | pte_dirty | Tests a dirty PTE |27 | pte_write | Tests a writable PTE |29 | pte_special | Tests a special PTE |31 | pte_protnone | Tests a PROT_NONE PTE |33 | pte_devmap | Tests a ZONE_DEVICE mapped PTE |35 | pte_soft_dirty | Tests a soft dirty PTE |[all …]
11 access to the table. At the moment we use split lock for PTE and PMD17 maps PTE and takes PTE table lock, returns pointer to PTE with18 pointer to its PTE table lock, or returns NULL if no PTE table;20 maps PTE, returns pointer to PTE with pointer to its PTE table21 lock (not taken), or returns NULL if no PTE table;23 maps PTE, returns pointer to PTE, or returns NULL if no PTE table;25 unmaps PTE table;27 unlocks and unmaps PTE table;29 allocates PTE table if needed and takes its lock, returns pointer to30 PTE with pointer to its lock, or returns NULL if allocation failed;[all …]
16 PTE for this purpose. PTE flags are scarce resource especially on some CPU
31 profit from discovering a young PTE. A page table walk can sweep all123 the latter, when the eviction walks the rmap and finds a young PTE,124 the aging scans the adjacent PTEs. For both, on finding a young PTE,126 page mapped by this PTE to ``(max_seq%MAX_NR_GENS)+1``.190 trips into the rmap. It scans the adjacent PTEs of a young PTE and192 adds the PMD entry pointing to the PTE table to the Bloom filter. This203 filter. In the aging path, set membership means that the PTE range
42 this single table were referred to as *PTE*:s - page table entries.80 +-->| PTE |130 --> +-----+ PTE136 | ptr | \ PTE256 directly map them, with no need to use lower level page entries (PTE). Huge
18 有了分页表锁，我们就有了单独的每张表锁来顺序化对表的访问。目前，我们对PTE和24 映射pte并获取PTE表锁，返回所取锁的指针；26 解锁和解映射PTE表；28 如果需要的话，分配PTE表并获取锁，如果分配失败，返回已获取的锁的指针31 返回指向PTE表锁的指针；38 时启用PTE表的分页表锁。如果分页锁被禁用，所有的表都由mm->page_table_lock59 没有必要特别启用PTE分页表锁：所有需要的东西都由pagetable_pte_ctor()60 和pagetable_pte_dtor()完成，它们必须在PTE表分配/释放时被调用。93 PTE表的spinlock_t分配在pagetable_pte_ctor()中，PMD表的spinlock_t
20 偏移的项（pte_file）。内核为达到这个目的在PTE中保留了标志。PTE标志是稀缺资
280 除它，而不是复制一个零页。到系统内存或设备私有结构页的有效PTE条目将被282 程中取消映射，并插入一个特殊的迁移PTE来代替原来的PTE。 migrate_vma_setup()333 一些设备具有诸如原子PTE位的功能，可以用来实现对系统内存的原子访问。为了支持对一
139 是，PAE有更多的PTE位，可以提供像NX和PAT这样的高级功能。
38 level PTE or block level PGD, PMD and PUD, and access status of a page49 | 0xfff0000000000000-0xfff0000000210000 2112K PTE RW NX SHD AF UXN MEM/NORMAL-TAGGED |50 | 0xfff0000000210000-0xfff0000001c00000 26560K PTE ro NX SHD AF UXN MEM/NORMAL |56 | 0xffff800000000000-0xffff800008000000 128M PTE |62 | 0xffff800008010000-0xffff800008200000 1984K PTE ro x SHD AF UXN MEM/NORMAL |63 | 0xffff800008200000-0xffff800008e00000 12M PTE ro x SHD AF CON UXN MEM/NORMAL |69 | 0xfffffbfffdb80000-0xfffffbfffdb90000 64K PTE ro x SHD AF UXN MEM/NORMAL |70 | 0xfffffbfffdb90000-0xfffffbfffdba0000 64K PTE ro NX SHD AF UXN MEM/NORMAL |76 | 0xfffffbfffe800000-0xfffffbffff800000 16M PTE |82 | 0xfffffc0002000000-0xfffffc0002200000 2M PTE RW NX SHD AF UXN MEM/NORMAL |[all …]
38 - CONT PTE PMD CONT PMD PUD
72 #define pmd_populate_kernel(MM, PMD, PTE) pmd_set(MM, PMD, PTE) argument73 #define pmd_populate(MM, PMD, PTE) pmd_set(MM, PMD, PTE) argument
5 The soft-dirty is a bit on a PTE which helps to track which pages a task18 64-bit qword is the soft-dirty one. If set, the respective PTE was25 the soft-dirty bit on the respective PTE.31 bits on the PTE.36 the same place. When unmap is called, the kernel internally clears PTE values
65 基于PTE访问位的访问检查68 物理和虚拟地址空间的实现都使用PTE Accessed-bit进行基本访问检查。唯一的区别在于从地址中69 找到相关的PTE访问位的方式。虚拟地址的实现是为该地址的目标任务查找页表，而物理地址的实现则
40 尽管如此，DAMON默认为虚拟内存和物理内存提供了基于vma/rmap跟踪和PTE访问位检查的地址空间
62 - bit 0: the PTE was not valid63 - bit 1: the PTE read bit was not set64 - bit 2: the PTE write bit was not set65 - bit 3: the PTE execute bit was not set
60 #define PTE page_size macro778 test_cases[3] = MAKE_TEST(PTE, PTE, PTE * 2, in main()783 test_cases[4] = MAKE_TEST(_1MB, PTE, _2MB, NON_OVERLAPPING, EXPECT_SUCCESS, in main()789 test_cases[6] = MAKE_TEST(PMD, PTE, _4MB, NON_OVERLAPPING, EXPECT_SUCCESS, in main()797 test_cases[9] = MAKE_TEST(PUD, PTE, _2GB, NON_OVERLAPPING, EXPECT_SUCCESS, in main()
40 - CONT PTE PMD CONT PMD PUD
33 } PTE; typedef
43 - CONT PTE PMD CONT PMD PUD
47 table entry (PTE) has the Present bit cleared or other reserved bits set,48 then speculative execution ignores the invalid PTE and loads the referenced50 by the address bits in the PTE was still present and accessible.72 PTE which is marked non present. This allows a malicious user space75 encoded in the address bits of the PTE, thus making attacks more78 The Linux kernel contains a mitigation for this attack vector, PTE92 PTE inversion mitigation for L1TF, to attack physical host memory.132 'Mitigation: PTE Inversion' The host protection is active136 information is appended to the 'Mitigation: PTE Inversion' part:582 - PTE inversion to protect against malicious user space. This is done
16 Nonetheless, DAMON provides vma/rmap tracking and PTE Accessed bit check based
220 kvm_mmu_notifier_clear_flush_young), it marks the PTE not-present in hardware221 by clearing the RWX bits in the PTE and storing the original R & X bits in more224 atomically restore the PTE to a Present state. The W bit is not saved when the225 PTE is marked for access tracking and during restoration to the Present state,
111 #error PTE shared bit mismatch116 #error Invalid Linux PTE bit settings
131 DMAR:[fault reason 05] PTE Write access is not set133 DMAR:[fault reason 05] PTE Write access is not set