9215ee7a16
## What changes were proposed in this pull request? This PR detects length overflow if total elements in inputs are not acceptable. For example, when the three inputs has `0x7FFF_FF00`, `0x7FFF_FF00`, and `0xE00`, we should detect length overflow since we cannot allocate such a large structure on `byte[]`. On the other hand, the current algorithm can allocate the result structure with `0x1000`-byte length due to integer sum overflow. ## How was this patch tested? Existing UTs. If we would create UTs, we need large heap (6-8GB). It may make test environment unstable. If it is necessary to create UTs, I will create them. Author: Kazuaki Ishizaki <ishizaki@jp.ibm.com> Closes #21064 from kiszk/SPARK-23976. |
||
---|---|---|
.. | ||
kvstore | ||
network-common | ||
network-shuffle | ||
network-yarn | ||
sketch | ||
tags | ||
unsafe |