if c.config.DynamicRecordSizingDisabled || typ != recordTypeApplicationData {
		return maxPlaintext
	}

	if c.bytesSent >= recordSizeBoostThreshold {
		return maxPlaintext
	}

	// Subtract TLS overheads to get the maximum payload size.
	payloadBytes := tcpMSSEstimate - recordHeaderLen - c.out.explicitNonceLen()
	if c.out.cipher != nil {
		switch ciph := c.out.cipher.(type) {
		case cipher.Stream:

    Value scalar_zero = CreateI32SplatConst(loc, rewriter, {}, 0);
    Value vector_one = CreateI32SplatConst(loc, rewriter, {1}, 1);
    auto input = block->getArgument(0);
    auto size = block->getArgument(3);

    // Subtract `input_rank` by 1 to get the item's rank, which is used as
    // `partial_position_shape`.
    auto input_rank = rewriter->create<TF::RankOp>(
        loc, tensorflow::GetTypeFromTFTensorShape({}, shape_dtype), input);

}

func parse(layout, value string, defaultLocation, local *Location) (Time, error) {
	alayout, avalue := layout, value
	rangeErrString := "" // set if a value is out of range
	amSet := false       // do we need to subtract 12 from the hour for midnight?
	pmSet := false       // do we need to add 12 to the hour?

	// Time being constructed.
	var (
		year       int
		month      int = -1
		day        int = -1

static java.util.Map mergeMaps(java.util.Map, java.util.Map); public static java.util.Map mergeMaps(java.util.Map[]); public static java.util.Collection intersection(java.util.Collection, java.util.Collection); public static java.util.Collection subtract(java.util.Collection, java.util.Collection); public static java.util.Map getCardinalityMap(java.util.Collection); public static java.util.List iteratorToList(java.util.Iterator); private static final int getFreq(Object, java.util.Map); } org/cod...

		bsec.SetInt64(sec)
		bnsec.SetInt64(nsec)
		bt.Mul(bsec, b1e9)
		bt.Add(bt, bnsec)

		// Compute quotient and remainder mod d.
		bd.SetInt64(int64(d))
		bq.DivMod(bt, bd, br)

		// To truncate, subtract remainder.
		// br is < d, so it fits in an int64.
		r := br.Int64()
		t1 := t0.Add(-Duration(r))

		// Check that time.Truncate works.
		if trunc := t0.Truncate(d); trunc != t1 {

		x = apply(x, 0x7fffffffffffffff)
	default:
		throw("bad m value")
	}
	// Now, the top bit of each m-aligned group in x is set
	// that group was all zero in the original x.

	// From each group of m bits subtract 1.
	// Because we know only the top bits of each
	// m-aligned group are set, we know this will
	// set each group to have all the bits set except
	// the top bit, so just OR with the original

static java.util.Map mergeMaps(java.util.Map, java.util.Map); public static java.util.Map mergeMaps(java.util.Map[]); public static java.util.Collection intersection(java.util.Collection, java.util.Collection); public static java.util.Collection subtract(java.util.Collection, java.util.Collection); public static java.util.Map getCardinalityMap(java.util.Collection); public static java.util.List iteratorToList(java.util.Iterator); private static final int getFreq(Object, java.util.Map); } org/cod...

static java.util.Map mergeMaps(java.util.Map, java.util.Map); public static java.util.Map mergeMaps(java.util.Map[]); public static java.util.Collection intersection(java.util.Collection, java.util.Collection); public static java.util.Collection subtract(java.util.Collection, java.util.Collection); public static java.util.Map getCardinalityMap(java.util.Collection); public static java.util.List iteratorToList(java.util.Iterator); private static final int getFreq(Object, java.util.Map); } org/cod...

static java.util.Map mergeMaps(java.util.Map, java.util.Map); public static java.util.Map mergeMaps(java.util.Map[]); public static java.util.Collection intersection(java.util.Collection, java.util.Collection); public static java.util.Collection subtract(java.util.Collection, java.util.Collection); public static java.util.Map getCardinalityMap(java.util.Collection); public static java.util.List iteratorToList(java.util.Iterator); private static final int getFreq(Object, java.util.Map); } org/cod...

static java.util.Map mergeMaps(java.util.Map, java.util.Map); public static java.util.Map mergeMaps(java.util.Map[]); public static java.util.Collection intersection(java.util.Collection, java.util.Collection); public static java.util.Collection subtract(java.util.Collection, java.util.Collection); public static java.util.Map getCardinalityMap(java.util.Collection); public static java.util.List iteratorToList(java.util.Iterator); private static final int getFreq(Object, java.util.Map); } org/cod...