*   Uses of `tensors()` can be replaced by calling the existing
                methods `tensors_size()` and `tensor(int)`.
            *   Uses of the non-const overload of `nodes_and_registration` can
                be replaced by calling the existing methods `nodes_size()` and
                `context()`, and then calling the `GetNodeAndRegistration`

## 0.120.3

### Refactors

* ♻️ Reduce internal cyclic recursion in dependencies, from 2 functions calling each other to 1 calling itself. PR [#14256](https://github.com/fastapi/fastapi/pull/14256) by [@tiangolo](https://github.com/tiangolo).

R7 #define IVP R8 #define ENC R9 #define INOUT V2 #define TMP V3 #define IVEC V4 // Load the crypt key into VSRs. // // The expanded key is stored and loaded using // STXVD2X/LXVD2X. The in-memory byte ordering // depends on the endianness of the machine. The // expanded keys are generated by expandKeyAsm above. // // Rkeyp holds the key pointer. It is clobbered. Once // the expanded keys are loaded, it is not needed. // // R12,R14-R21 are scratch registers. // For keyp of 10, V6, V11-V20 hold the...

R7 #define IVP R8 #define ENC R9 #define INOUT V2 #define TMP V3 #define IVEC V4 // Load the crypt key into VSRs. // // The expanded key is stored and loaded using // STXVD2X/LXVD2X. The in-memory byte ordering // depends on the endianness of the machine. The // expanded keys are generated by expandKeyAsm above. // // Rkeyp holds the key pointer. It is clobbered. Once // the expanded keys are loaded, it is not needed. // // R12,R14-R21 are scratch registers. // For keyp of 10, V6, V11-V20 hold the...