auto 5ˆÎÑ 819ÍÀÏ35/* SPDX-License-Identifier: GPL-2.0-only */ /* * ACPI helper for the MDIO (Ethernet PHY) API */ #ifndef __LINUX_ACPI_MDIO_H #define __LINUX_ACPI_MDIO_H #include #if IS_ENABLED(CONFIG_ACPI_MDIO) int __acpi_mdiobus_register(struct mii_bus *mdio, struct fwnode_handle *fwnode, struct module *owner); static inline int acpi_mdiobus_register(struct mii_bus *mdio, struct fwnode_handle *handle) { return __acpi_mdiobus_register(mdio, handle, THIS_MODULE); } #else /* CONFIG_ACPI_MDIO */ static inline int acpi_mdiobus_register(struct mii_bus *mdio, struct fwnode_handle *fwnode) { /* * Fall back to mdiobus_register() function to register a bus. * This way, we don't have to keep compat bits around in drivers. */ return mdiobus_register(mdio); } #endif #endif /* __LINUX_ACPI_MDIO_H */ 7ˆ ƒ Í ÊÀÏ27 Index of /FSS-OZR/root/sys/bus/acpi/devices/LNXSYBUS:00/PNP0A03:00/physical_node/firmware_node/device:1a/power

Index of /FSS-OZR/root/sys/bus/acpi/devices/LNXSYBUS:00/PNP0A03:00/physical_node/firmware_node/device:1a/power

 NameLast modifiedSizeDescription
 Parent Directory   -  
 autosuspend_delay_ms 2026-10-11 01:10 4.0K 
 control 2026-10-11 01:10 4.0K 
 runtime_active_time 2026-10-11 01:10 4.0K 
 runtime_status 2026-10-11 01:10 4.0K 
 runtime_suspended_time 2026-10-11 01:10 4.0K 
9ˆÎÑ 0ÀÏ ;ˆÉÑ 0ÀÏ =ˆÎÑ ƒe–ÜÍÀÏ =/* SPDX-License-Identifier: GPL-2.0 */ #ifndef _LINUX_RECIPROCAL_DIV_H #define _LINUX_RECIPROCAL_DIV_H #include /* * This algorithm is based on the paper "Division by Invariant * Integers Using Multiplication" by Torbjörn Granlund and Peter * L. Montgomery. * * The assembler implementation from Agner Fog, which this code is * based on, can be found here: * http://www.agner.org/optimize/asmlib.zip * * This optimization for A/B is helpful if the divisor B is mostly * runtime invariant. The reciprocal of B is calculated in the * slow-path with reciprocal_value(). The fast-path can then just use * a much faster multiplication operation with a variable dividend A * to calculate the division A/B. */ struct reciprocal_value { u32 m; u8 sh1, sh2; }; /* "reciprocal_value" and "reciprocal_divide" together implement the basic * version of the algorithm described in Figure 4.1 of the paper. */ struct reciprocal_value reciprocal_value(u32 d); static inline u32 reciprocal_divide(u32 a, struct reciprocal_value R) { u32 t = (u32)(((u64)a * R.m) >> 32); return (t + ((a - t) >> R.sh1)) >> R.sh2; } struct reciprocal_value_adv { u32 m; u8 sh, exp; bool is_wide_m; }; /* "reciprocal_value_adv" implements the advanced version of the algorithm * described in Fig