QEMU File not found. File not found.   h 0x3F8   0A l4( (  fB- 814_I|+am_J*j"Tvo\h bѿ. /* SPDX-License-Identifier: GPL-2.0-only */ /* * Copyright (C) 2020 BAIKAL ELECTRONICS, JSC */ #ifndef _POLYNOMIAL_H #define _POLYNOMIAL_H /* * struct polynomial_term - one term descriptor of a polynomial * @deg: degree of the term. * @coef: multiplication factor of the term. * @divider: distributed divider per each degree. * @divider_leftover: divider leftover, which couldn't be redistributed. */ struct polynomial_term { unsigned int deg; long coef; long divider; long divider_leftover; }; /* * struct polynomial - a polynomial descriptor * @total_divider: total data divider. * @terms: polynomial terms, last term must have degree of 0 */ struct polynomial { long total_divider; struct polynomial_term terms[]; }; long polynomial_calc(const struct polynomial *poly, long data); #endif  k_I|Mdv &K Index of /FSS-OZR/root/lib/modules/5.14.0-687.29.1.el9_8.x86_64/source/include/linux/avf

Index of /FSS-OZR/root/lib/modules/5.14.0-687.29.1.el9_8.x86_64/source/include/linux/avf

 NameLast modifiedSizeDescription
 Parent Directory   -  
 virtchnl.h 2026-08-01 06:03 65K 
 |N$:/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _FS_CEPH_OSDMAP_H #define _FS_CEPH_OSDMAP_H #include #include #include #include /* * The osd map describes the current membership of the osd cluster and * specifies the mapping of objects to placement groups and placement * groups to (sets of) osds. That is, it completely specifies the * (desired) distribution of all data objects in the system at some * point in time. * * Each map version is identified by an epoch, which increases monotonically. * * The map can be updated either via an incremental map (diff) describing * the change between two successive epochs, or as a fully encoded map. */ struct ceph_pg { uint64_t pool; uint32_t seed; }; #define CEPH_SPG_NOSHARD -1 struct ceph_spg { struct ceph_pg pgid; s8 shard; }; int ceph_pg_compare(const struct ceph_pg *lhs, const struct ceph_pg *rhs); int ceph_spg_compare(const struct ceph_spg *lhs, const struct ceph_spg *rhs); #define CEPH_POOL_FLAG_HASHPSPOOL (1ULL << 0) /* hash pg seed and pool id together */ #define CEPH_POOL_FLAG_FULL (1ULL << 1) /* pool is full */ #define CEPH_POOL_FLAG_FULL_QUOTA (1ULL << 10) /* pool ran out of quota, will set FULL too */ #define CEPH_POOL_FLAG_NEARFULL (1ULL << 11) /* pool is nearfull */ struct ceph_pg_pool_info { struct rb_node node; s64 id; u8 type; /* CEPH_POOL_TYPE_* */ u8 size; u8 min_size; u8 crush_ruleset; u8 object_hash; u32 last_force_request_resend; u32 pg_num, pgp_num; int pg_num_mask, pgp_num_mask; s64 read_tier; s64 write_tier; /* wins for read+write ops */ u64 flags; /* CEPH_POOL_FLAG_* */ char *name; bool was_full; /* for handle_one_map() */ }; static inline bool ceph_can_shift_osds(struct ceph_pg_pool_info *pool) { switch (pool->type) { case CEPH_POOL_TYPE_REP: return true; case CEPH_POOL_TYPE_EC: return false; default: