hal_utils_gcd() function

Helper function to calculate the GCD between two numbers using the Euclidean algorithm. Calculate the Greatest Common Divisor (GDC) of two unsigned numbers

Syntax

Show:

Summary

Declaration

from hal_utils.h:114

__attribute__((always_inline)) static inline uint32_t hal_utils_gcd(uint32_t num_1, uint32_t num_2);

Arguments

Argument

Description

num_1

First number

num_2

Second number

Return value

GCD of 'a' and 'b'

References

Code

Location

Referrer

static inline uint32_t hal_utils_gcd(uint32_t num_1, uint32_t num_2)

hal_utils.h:115

uint32_t gcd = hal_utils_gcd(clk_info->exp_freq_hz, freq_error);

hal_utils.c:37

hal_utils_calc_clk_div_frac_fast()

return (a * b / hal_utils_gcd(a, b));

hal_utils.h:149

hal_utils_calc_lcm()

Call Tree

hal_utils_gcd() is called by 2 functions:

hal_utils_calc_lcm()

hal_utils_calc_clk_div_frac_fast()

hal_utils_gcd()

Data Use

hal_utils_gcd():

hal_utils_gcd()

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out