- Fix: detach azure disk broken on Azure Stack ([#94885](https://github.com/kubernetes/kubernetes/pull/94885), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider]
- Fixed a bug where improper storage and comparison of endpoints led to excessive API traffic from the endpoints controller ([#94934](https://github.com/kubernetes/kubernetes/pull/94934), [@damemi](https://github.com/damemi)) [SIG Apps, Network and Testing]

* fix pod stuck issue due to corrupt mnt point in flexvol plugin, call Unmount if PathExists returns any error ([#75234](https://github.com/kubernetes/kubernetes/pull/75234), [@andyzhangx](https://github.com/andyzhangx))
* Fix a string comparison bug in IPVS graceful termination where UDP real servers are not deleted. ([#78999](https://github.com/kubernetes/kubernetes/pull/78999), [@andrewsykim](https://github.com/andrewsykim))

- Fix: detach azure disk broken on Azure Stack ([#94885](https://github.com/kubernetes/kubernetes/pull/94885), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider]
- Fixed a bug where improper storage and comparison of endpoints led to excessive API traffic from the endpoints controller ([#94937](https://github.com/kubernetes/kubernetes/pull/94937), [@damemi](https://github.com/damemi)) [SIG Apps, Network and Testing]

x.setBytes(b); err != nil { panic("bigmod: internal error: bad arithmetic") } return x.trim() } // trim reduces the size of x to match its value. func (x *Nat) trim() *Nat { // Trim most significant (trailing in little-endian) zero limbs. // We assume comparison with zero (but not the branch) is constant time. for i := len(x.limbs) - 1; i >= 0; i-- { if x.limbs[i] != 0 { break } x.limbs = x.limbs[:i] } return x } // set assigns x = y, optionally resizing x to the appropriate size. func (x *Nat) set(y *Nat)...

x.setBytes(b); err != nil { panic("bigmod: internal error: bad arithmetic") } return x.trim() } // trim reduces the size of x to match its value. func (x *Nat) trim() *Nat { // Trim most significant (trailing in little-endian) zero limbs. // We assume comparison with zero (but not the branch) is constant time. for i := len(x.limbs) - 1; i >= 0; i-- { if x.limbs[i] != 0 { break } x.limbs = x.limbs[:i] } return x } // set assigns x = y, optionally resizing x to the appropriate size. func (x *Nat) set(y *Nat)...