lastAttempt = now;
        }

        void recordSuccess() {
            // Reduce counter on success to allow recovery
            recentAttempts.updateAndGet(val -> Math.max(0, val - 1));
        }

        void reset() {
            recentAttempts.set(0);
            blocked.set(false);
            blockExpiry = null;
            windowStart = Instant.now();
        }

import static com.google.common.cache.TestingWeighers.intKeyWeigher;
import static com.google.common.cache.TestingWeighers.intValueWeigher;
import static com.google.common.truth.Truth.assertThat;
import static java.lang.Math.min;
import static java.util.Arrays.asList;

import com.google.common.cache.CacheTesting.Receiver;
import com.google.common.cache.TestingCacheLoaders.IdentityLoader;

import static com.google.common.collect.CollectPreconditions.checkRemove;
import static com.google.common.collect.CompactHashing.UNSET;
import static com.google.common.collect.Hashing.smearedHash;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.util.Objects.requireNonNull;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;

      int diff = 0x0; // bitset for output bits with different values
      int count = 0;
      // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues
      int maxCount = (int) (4 * Math.log(2 * keyBits * hashBits) + 1);
      while (same != 0xffffffff || diff != 0xffffffff) {
        int key1 = rand.nextInt();
        // flip input bit for key2

        }
        return nextNameTrnId;
    }

    void ensureOpen(final int timeout) throws IOException {
        closeTimeout = 0;
        if (SO_TIMEOUT != 0) {
            closeTimeout = Math.max(SO_TIMEOUT, timeout);
        }
        // If socket is still good, the new closeTimeout will
        // be ignored; see tryClose comment.
        if (socket == null) {

        if (blockSize == 0)
            blockSize = 16; // GCM mode

        int paddedLength = ((message.length + blockSize - 1) / blockSize) * blockSize;
        byte[] paddedMessage = new byte[Math.max(paddedLength, message.length)];
        System.arraycopy(message, 0, paddedMessage, 0, message.length);

        // Encrypt with constant timing
        byte[] result = cipher.doFinal(paddedMessage, 0, message.length);

            final byte[] addr = localInetAddress.getAddress();
            localHostname =
                    "JCIFS" + (addr[2] & 0xFF) + "_" + (addr[3] & 0xFF) + "_" + Hexdump.toHexString((int) (Math.random() * 0xFF), 2);
        }

        /*
         * Create an NbtAddress for the local interface with
         * the name deduced above possibly with scope applied and
         * cache it forever.
         */

        MessageDigest md5 = MessageDigest.getInstance("MD5");
        byte[] ipad = new byte[64];
        byte[] opad = new byte[64];

        // HMACT64 specific: truncate key to 64 bytes if needed
        int keyLen = Math.min(key.length, 64);
        for (int i = 0; i < keyLen; i++) {
            ipad[i] = (byte) (key[i] ^ 0x36);
            opad[i] = (byte) (key[i] ^ 0x5c);
        }
        for (int i = keyLen; i < 64; i++) {

import static com.google.common.truth.Truth.assertThat;
import static com.google.common.truth.Truth.assertWithMessage;
import static java.lang.Byte.toUnsignedInt;
import static java.lang.Math.signum;
import static org.junit.Assert.assertThrows;

import com.google.common.collect.testing.Helpers;
import com.google.common.primitives.UnsignedBytes.LexicographicalComparatorHolder.UnsafeComparator;

//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package dsync

import (
	"context"
	"math/rand"
	"os"
	"sync"
	"testing"
	"time"

	"github.com/google/uuid"
)

const (
	testDrwMutexAcquireTimeout         = 250 * time.Millisecond
	testDrwMutexRefreshCallTimeout     = 250 * time.Millisecond