tree-optimization: fold memset with length in [0, 1] to conditional store [PR102202]
Optimizes small `memset` calls to simple conditional stores.
The compiler now optimizes memset calls with lengths of 0 or 1 more effectively. For a zero-length memset, the call is shrink-wrapped. For a one-length memset, it’s replaced with a direct byte store. This optimization leverages Ranger analysis to identify these cases, even when the length is determined by runtime values within a provable range, not just constants. This improves performance by eliminating function call overhead and simplifying the generated code.
In Details
This patch enhances the tree-call-cdce pass to optimize memset calls where the length is proven to be in the range [0, 1]. It introduces len_has_boolean_range_p and can_shrink_wrap_len_p to identify eligible memset calls. For length 0, it uses shrink_wrap_len_call to replace the call with a conditional check. For length 1, it directly generates a store instruction, extending gimple_fold_builtin_memset to handle singleton lengths proven by Ranger analysis, not just constant lengths. This refines the shrink-wrapping logic to prioritize these small memset optimizations.
- memset
- A standard C library function used to fill a block of memory with a particular byte value. It takes a pointer to the memory, the value to set, and the number of bytes to fill.
- Ranger Analysis
- A static analysis technique used by compilers to determine the possible range of values for variables or expressions throughout the program's execution. This information can be used to prove properties about code, such as bounds on loop counters or array indices.
- Shrink Wrapping
- An optimization technique where a condition or check is moved closer to the code it guards, potentially reducing the number of paths a check needs to be performed on. In this case, a zero-length
memsetcall might be replaced by a conditional check that effectively does nothing if the length is zero. - GIMPLE
- GCC's internal three-address intermediate representation (IR). It's a low-level, simplified representation of the program used by the middle-end optimization passes.
- Conditional Store
- A memory write operation that is only performed if a certain condition is met. This can be used to optimize code by avoiding unnecessary writes or to ensure data integrity based on program state.