// From https://github.com/Kotlin/kotlinx-atomicfu/blob/master/atomicfu/build.gradle.kts
val compileJavaModuleInfo by tasks.registering(JavaCompile::class) {
  val moduleName = "okhttp3"
  val compilation = kotlin.targets["jvm"].compilations["main"]
  val compileKotlinTask = compilation.compileTaskProvider.get() as KotlinJvmCompile
  val targetDir = compileKotlinTask.destinationDirectory.dir("../java9")
  val sourceDir = file("src/jvmMain/java9/")

// license that can be found in the LICENSE file.

#include "../../../../../runtime/textflag.h"

TEXT asmtest(SB),DUPOK|NOSPLIT,$0
start:
	//
	// Unprivileged ISA
	//

	// 2.4: Integer Computational Instructions

	ADDI	$2047, X5				// 9382f27f
	ADDI	$-2048, X5				// 93820280
	ADDI	$2048, X5				// 9382024093820240
	ADDI	$-2049, X5				// 938202c09382f2bf
	ADDI	$4094, X5				// 9382f27f9382f27f

		decSizes []int64
		oi       ObjectInfo
	}{
		{s1, mkMPObj(s1)},
		{s2, mkMPObj(s2)},
		{s3, mkMPObj(s3)},
	}

	// This function is a reference (re-)implementation of
	// decrypted range computation, written solely for the purpose
	// of the unit tests.
	//
	// `s` gives the decrypted part sizes, and the other
	// parameters describe the desired read segment. When

    }
}

val gradleModule = the<GradleModuleExtension>()
the<JvmCompileExtension>().apply {
    compilations {
        configureEach {
            // Everything compiles to Java 17 by default
            targetJvmVersion = 17
        }
    }
    addCompilationFrom(sourceSets.main) {

 *       SMALL_DELAY_MS}, {@code MEDIUM_DELAY_MS}, {@code LONG_DELAY_MS}. The idea here is that a
 *       SHORT is always discriminable from zero time, and always allows enough time for the small
 *       amounts of computation (creating a thread, calling a few methods, etc) needed to reach a
 *       timeout point. Similarly, a SMALL is always discriminable as larger than SHORT and smaller

        .isEqualTo(EntryFactory.WEAK_WRITE);
    assertThat(EntryFactory.getFactory(Strength.WEAK, true, true))
        .isEqualTo(EntryFactory.WEAK_ACCESS_WRITE);
  }

  // computation tests

  public void testCompute() throws ExecutionException {
    CountingLoader loader = new CountingLoader();
    LocalCache<Object, Object> map = makeLocalCache(createCacheBuilder());

        .isEqualTo(EntryFactory.WEAK_WRITE);
    assertThat(EntryFactory.getFactory(Strength.WEAK, true, true))
        .isEqualTo(EntryFactory.WEAK_ACCESS_WRITE);
  }

  // computation tests

  public void testCompute() throws ExecutionException {
    CountingLoader loader = new CountingLoader();
    LocalCache<Object, Object> map = makeLocalCache(createCacheBuilder());

X0 // H * 2 PSHUFD $0xff, X0, X11 MOVOU X0, X12 PSRAL $0x1f, X11 PAND X14, X11 PSRLL $0x1f, X12 PSLLDQ $0x04, X12 PSLLL $0x01, X0 PXOR X11, X0 PXOR X12, X0 // Karatsuba pre-computations MOVOU X0, 224(DI) PSHUFD $0x4e, X0, X1 PXOR X0, X1 MOVOU X1, 240(DI) MOVOU X0, X2 MOVOU X1, X3 // Now prepare powers of H and pre-computations for them MOVQ $0x00000007, AX initLoop: MOVOU X2, X11 MOVOU X2, X12 MOVOU X3, X13 PCLMULQDQ $0x00, X0, X11 PCLMULQDQ $0x11, X0, X12 PCLMULQDQ $0x00, X1, X13 PXOR X11, X13 PXOR...

X0 // H * 2 PSHUFD $0xff, X0, X11 MOVOU X0, X12 PSRAL $0x1f, X11 PAND X14, X11 PSRLL $0x1f, X12 PSLLDQ $0x04, X12 PSLLL $0x01, X0 PXOR X11, X0 PXOR X12, X0 // Karatsuba pre-computations MOVOU X0, 224(DI) PSHUFD $0x4e, X0, X1 PXOR X0, X1 MOVOU X1, 240(DI) MOVOU X0, X2 MOVOU X1, X3 // Now prepare powers of H and pre-computations for them MOVQ $0x00000007, AX initLoop: MOVOU X2, X11 MOVOU X2, X12 MOVOU X3, X13 PCLMULQDQ $0x00, X0, X11 PCLMULQDQ $0x11, X0, X12 PCLMULQDQ $0x00, X1, X13 PXOR X11, X13 PXOR...

# Description:
# TensorFlow is a computational framework, primarily for use in machine
# learning applications.

load("@rules_cc//cc:cc_import.bzl", "cc_import")

# buildifier: disable=out-of-order-load
# copybara:comment_begin(oss-only)
load("//tensorflow:strict.default.bzl", "py_strict_library")

# copybara:comment_end
# buildifier: enable=out-of-order-load
load("@bazel_skylib//lib:selects.bzl", "selects")