_I|Mjq؂File not found.  d _I|Mdv &K Index of /anon_sym/anon/sys/dev/char/13:34/subsystem/input0

Index of /anon_sym/anon/sys/dev/char/13:34/subsystem/input0

 NameLast modifiedSizeDescription
 Parent Directory   -  
 uniq 2026-10-11 09:16 4.0K 
 uevent 2026-10-11 09:16 4.0K 
 subsystem/ 2026-10-11 06:49 -  
 properties 2026-10-11 09:16 4.0K 
 power/ 2026-10-11 09:16 -  
 phys 2026-10-11 09:16 4.0K 
 name 2026-10-11 09:16 4.0K 
 modalias 2026-10-11 09:16 4.0K 
 inhibited 2026-10-11 09:16 4.0K 
 id/ 2026-10-11 09:14 -  
 event0/ 2026-10-11 04:04 -  
 device/ 2026-10-11 03:24 -  
 capabilities/ 2026-10-11 08:49 -  
*l4( (  fB- e]_I|+ 1/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _LINUX_MIN_HEAP_H #define _LINUX_MIN_HEAP_H #include #include #include /** * struct min_heap - Data structure to hold a min-heap. * @data: Start of array holding the heap elements. * @nr: Number of elements currently in the heap. * @size: Maximum number of elements that can be held in current storage. */ struct min_heap { void *data; int nr; int size; }; /** * struct min_heap_callbacks - Data/functions to customise the min_heap. * @elem_size: The nr of each element in bytes. * @less: Partial order function for this heap. * @swp: Swap elements function. */ struct min_heap_callbacks { int elem_size; bool (*less)(const void *lhs, const void *rhs); void (*swp)(void *lhs, void *rhs); }; /* Sift the element at pos down the heap. */ static __always_inline void min_heapi