*   Fixes a division by 0 in `Conv2DBackpropInput`
    ([CVE-2021-29525](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29525))
*   Fixes a division by 0 in `Conv2D`
    ([CVE-2021-29526](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29526))
*   Fixes a division by 0 in `QuantizedConv2D`
    ([CVE-2021-29527](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29527))
*   Fixes a division by 0 in `QuantizedMul`

   * @param divisor the divisor (denominator)
   * @throws ArithmeticException if divisor is 0
   * @since 11.0
   */
  public static long remainder(long dividend, long divisor) {
    if (divisor < 0) { // i.e., divisor >= 2^63:
      if (compare(dividend, divisor) < 0) {
        return dividend; // dividend < divisor
      } else {
        return dividend - divisor; // dividend >= divisor
      }
    }

 * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent
 * to unsigned arithmetic in all cases except:
 *
 * <ul>
 *   <li>comparisons (signed values can be negative)
 *   <li>division (avoided here)
 *   <li>shifting (right shift must be unsigned)
 * </ul>
 *
 * @author ******@****.*** (Kyle Maddison)
 * @author ******@****.*** (Geoff Pike)
 */

 * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent
 * to unsigned arithmetic in all cases except:
 *
 * <ul>
 *   <li>comparisons (signed values can be negative)
 *   <li>division (avoided here)
 *   <li>shifting (right shift must be unsigned)
 * </ul>
 *
 * @author ******@****.*** (Kyle Maddison)
 * @author ******@****.*** (Geoff Pike)
 */

            bb.putShort((short) 0);
            bb.putShort((short) 0);

            buffer.decode(testBuffer, 0, testBuffer.length);

            assertEquals(7, buffer.getPathConsumed()); // 15 / 2 = 7 (integer division)
        }
    }

   * Returns the result of dividing {@code p} by {@code q}, rounding using the specified {@code
   * RoundingMode}. If the {@code RoundingMode} is {@link RoundingMode#DOWN}, then this method is
   * equivalent to regular Java division, {@code p / q}; and if it is {@link RoundingMode#FLOOR},
   * then this method is equivalent to {@link Math#floorDiv(long,long) Math.floorDiv}{@code (p, q)}.
   *

        buffer[offset + 20] = 0x02; // revision
        buffer[offset + 21] = 0x00; // padding
        SMBUtil.writeInt2(0, buffer, offset + 22); // size
        SMBUtil.writeInt4(4097, buffer, offset + 24); // ACE count > 4096
    }

    private void prepareSimpleSid(byte[] buffer, int offset) {
        buffer[offset] = 0x01; // revision
        buffer[offset + 1] = 0x01; // sub-authority count

                return sid.revision == this.revision;
            }
        }
        return false;
    }

    /**
     * Return the numeric representation of this sid such as
     * {@code S-1-5-21-1496946806-2192648263-3843101252-1029}.
     */
    @Override
    public String toString() {
        StringBuilder ret = new StringBuilder("S-").append(this.revision & 0xFF).append("-");

            verify(mockNdrBuffer, times(8)).dec_ndr_small(); // revision + sub_authority_count + 6 identifier_authority bytes
            verify(mockNdrBuffer).advance(6); // identifier_authority advance
            verify(mockNdrBuffer).advance(8); // sub_authority advance (4 * 2)
            verify(mockNdrBuffer, times(2)).derive(anyInt());

            assertEquals((byte) 1, sid.revision);
            assertEquals((byte) 2, sid.sub_authority_count);

        assertEquals(domainInfo.name.maximum_length / 2, decodedInfo.name.buffer.length);

        // Verify SID
        assertNotNull(decodedInfo.sid);
        assertEquals(domainInfo.sid.revision, decodedInfo.sid.revision);
        assertEquals(domainInfo.sid.sub_authority_count, decodedInfo.sid.sub_authority_count);
    }

    @Test
    void testLsarDomainInfoEncodeDecodeWithNulls() throws NdrException {