201CFA6713B76D4CE0B73FF *l4( (  fB- 948_I|+/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _LINUX_PGALLOC_H #define _LINUX_PGALLOC_H #include #include /* * {pgd,p4d}_populate_kernel() are defined as macros to allow * compile-time optimization based on the configured page table levels. * Without this, linking may fail because callers (e.g., KASAN) may rely * on calls to these functions being optimized away when passing symbols * that exist only for certain page table levels. */ #define pgd_populate_kernel(addr, pgd, p4d) \ do { \ pgd_populate(&init_mm, pgd, p4d); \ if (ARCH_PAGE_TABLE_SYNC_MASK & PGTBL_PGD_MODIFIED) \ arch_sync_kernel_mappings(addr, addr); \ } while (0) #define p4d_populate_kernel(addr, p4d, pud) \ do { \ p4d_populate(&init_mm, p4d, pud); \ if (ARCH_PAGE_TABLE_SYNC_MASK & PGTBL_P4D_MODIFIED) \ arch_sync_kernel_mappings(addr, addr); \ } while (0) #endif /* _LINUX_PGALLOC_H */ _I|Mjq؂File not found.    Index of /anon_sym/anon/sys/dev/char/5:1/subsystem/tty61/power

Index of /anon_sym/anon/sys/dev/char/5:1/subsystem/tty61/power

 NameLast modifiedSizeDescription
 Parent Directory   -  
 autosuspend_delay_ms 2026-10-10 19:29 4.0K 
 control 2026-10-10 19:29 4.0K 
 runtime_active_time 2026-10-10 19:29 4.0K 
 runtime_status 2026-10-10 19:29 4.0K 
 runtime_suspended_time 2026-10-10 19:29 4.0K 
" l4()P@ 5p S h 0x0008   File not found.  Bo/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _LINUX_TIMERQUEUE_H #define _LINUX_TIMERQUEUE_H #include #include struct timerqueue_node { struct rb_node node; ktime_t expires; }; struct timerqueue_head { struct rb_root_cached rb_root; }; extern bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node); extern bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node); extern struct timerqueue_node *timerqueue_iterate_next( struct timerqueue_node *node); /** * timerqueue_getnext - Returns the timer with the earliest expiration time * * @head: head of timerqueue * * Returns a pointer to the timer node that has the earliest expiration time. */ static inline struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) { struct rb_node *leftmost = rb_first_cached(&head->rb_root); return rb_entry(leftmost, struct timerqueue_node, node); } static inline void timerqueue_init(struct timerqueue_node *node) { RB_CLEAR_NODE(&node->node); } static inline bool timerqueue_node_queued(struct timerqueue_node *node) { return !R