0   9 /* * zsmalloc memory allocator * * Copyright (C) 2011 Nitin Gupta * Copyright (C) 2012, 2013 Minchan Kim * * This code is released using a dual license strategy: BSD/GPL * You can choose the license that better fits your requirements. * * Released under the terms of 3-clause BSD License * Released under the terms of GNU General Public License Version 2.0 */ #ifndef _ZS_MALLOC_H_ #define _ZS_MALLOC_H_ #include /* * zsmalloc mapping modes * * NOTE: These only make a difference when a mapped object spans pages. */ enum zs_mapmode { ZS_MM_RW, /* normal read-write mapping */ ZS_MM_RO, /* read-only (no copy-out at unmap time) */ ZS_MM_WO /* write-only (no copy-in at map time) */ /* * NOTE: ZS_MM_WO should only be used for initializing new * (uninitialized) allocations. Partial writes to already * initialized allocations should use ZS_MM_RW to preserve the * existing data. */ }; struct zs_pool_stats { /* How many pages were migrated (freed) */ atomic_long_t pages_compacted; }; struct zs_pool; struct zs_pool *zs_create_pool(const char *name); void zs_destroy_pool(struct zs_pool *pool); unsigned long zs_malloc(struct zs_pool *pool, size_t size, gfp_t flags); void zs_free(struct zs_pool *pool, unsigned long obj); size_t zs_huge_class_size(struct zs_pool *pool); void *zs_map_object(struct zs_pool *pool, unsigned long handle, enum zs_mapmode mm); void zs_unmap_object(struct zs_pool *pool, unsigned long handle); unsigned long zs_get_total_pages(struct zs_pool *pool); unsigned long zs_compact(struct zs_pool *pool); unsigned int zs_lookup_class_index(struct zs_pool *pool, unsigned int size); void zs_pool_stats(struct zs_pool *pool, struct zs_pool_stats *stats); #endif ſFile not found.  597U/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _LINUX_CONTEXT_TRACKING_IRQ_H #define _LINUX_CONTEXT_TRACKING_IRQ_H #ifdef CONFIG_CONTEXT_TRACKING_IDLE void ct_irq_enter(void); void ct_irq_exit(void); void ct_irq_enter_irqson(void); void ct_irq_exit_irqson(void); void ct_nmi_enter(void); void ct_nmi_exit(void); #else static inline void ct_irq_enter(void) { } static inline void ct_irq_exit(void) { } static inline void ct_irq_enter_irqson(void) { } static inline void ct_irq_exit_irqson(void) { } static inline void ct_nmi_enter(void) { } static inline void ct_nmi_exit(void) { } #endif #endif  |M$"/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _LINUX_SYSV_FS_H #define _LINUX_SYSV_FS_H #define __packed2__ __attribute__((packed, aligned(2))) #ifndef __KERNEL__ typedef u16 __fs16; typedef u32 __fs16; #endif /* inode numbers are 16 bit */ typedef __fs16 sysv_ino_t; /* Block numbers are 24 bit, sometimes stored in 32 bit. On Coherent FS, they are always stored in PDP-11 manner: the least significant 16 bits come last. */ typedef __fs32 sysv_zone_t; /* 0 is non-existent */ #define SYSV_BADBL_INO 1 /* inode of bad blocks file */ #define SYSV_ROOT_INO 2 /* inode of root directory */ /* Xenix super-block data on disk */ #define XENIX_NICINOD 100 /* number of inode cache entries */ #define XENIX_NICFREE 100 /* number of free block list chunk entries */ struct xenix_super_block { __fs16 s_isize; /* index of first data zone */ __fs32 s_fsize __packed2__; /* total number of zones of this fs */ /* the start of the free block list: */ __fs16 s_nfree; /* number of free blocks in s_free, <= XENIX_NICFREE */ sysv_zone_t s_free[XENIX_NICFREE]; /* first free block list chunk */ /* the cache of free inodes: */ __fs16 s_ninode; /* number of free inodes in s_inode, <= XENIX_NICINOD */ sysv_ino_t s_inode[XENIX_NICINOD]; /* some free inodes */ /* locks, not used by Linux: */ char s_flock; /* lock during free block list manipulation */ char s_ilock; /* lock during inode cache manipulation */ char s_fmod; /* super-block modified flag */ char s_ronly; /* flag whether fs is mounted read-only */ __fs32 s_time __packed2__; /* time of last super block update */ __fs32 s_tfree __pac