Searched refs:pud (Results 1 - 7 of 7) sorted by relevance

/external/kernel-headers/original/asm-generic/
H A D4level-fixup.h13 #define pmd_alloc(mm, pud, address) \
14 ((unlikely(pgd_none(*(pud))) && __pmd_alloc(mm, pud, address))? \
15 NULL: pmd_offset(pud, address))
19 #define pud_none(pud) 0
20 #define pud_bad(pud) 0
21 #define pud_present(pud) 1
22 #define pud_ERROR(pud) do { } while (0)
23 #define pud_clear(pud) pgd_clear(pud)
[all...]
H A Dpgtable-nopud.h9 * Having the pud type consist of a pgd gets the size right, and allows
10 * us to conceptually access the pgd entry that this pud is folded into
22 * setup: the pud is never bad, and a pud always exists (as it's folded
29 #define pud_ERROR(pud) (pgd_ERROR((pud).pgd))
31 #define pgd_populate(mm, pgd, pud) do { } while (0)
50 * allocating and freeing a pud is trivial: the 1-entry pud is
H A Dpgtable.h212 static inline int pud_none_or_clear_bad(pud_t *pud) argument
214 if (pud_none(*pud))
216 if (unlikely(pud_bad(*pud))) {
217 pud_clear_bad(pud);
/external/chromium/chrome/browser/history/
H A Dvisitsegment_database.cc255 PageUsageData* pud = NULL; local
260 if (pud) {
261 pud->SetScore(score);
262 results->push_back(pud);
265 pud = new PageUsageData(segment_id);
286 if (pud) {
287 pud->SetScore(score);
288 results->push_back(pud);
309 PageUsageData* pud = (*results)[i]; local
310 statement2.BindInt64(0, pud
[all...]
/external/kernel-headers/original/asm-mips/
H A Dpgalloc.h36 static inline void pud_populate(struct mm_struct *mm, pud_t *pud, pmd_t *pmd) argument
38 set_pud(pud, __pud((unsigned long)pmd));
/external/kernel-headers/original/linux/
H A Dmm.h808 int __pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address);
823 static inline pmd_t *pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address) argument
825 return (unlikely(pud_none(*pud)) && __pmd_alloc(mm, pud, address))?
826 NULL: pmd_offset(pud, address);
/external/kernel-headers/original/asm-x86/
H A Dparavirt.h946 PVOP_VCALL2(pv_mmu_ops.set_pmd, pmdp, pmdval.pud.pgd.pgd);

Completed in 61 milliseconds