protected final AtomicInteger receiveCredits;
    /** Queue of pending RDMA work requests */
    protected final BlockingQueue<RdmaWorkRequest> pendingRequests;

    // Connection state
    /** Current connection state */
    protected volatile RdmaConnectionState state;
    /** Credit management for SMB Direct */
    protected RdmaCredits credits;
    /** Maximum size for fragmented operations */
    protected int maxFragmentedSize;

    input = Arrays.copyOf(input, input.length);
    Bytes.rotate(input, distance);
    assertThat(input).isEqualTo(expectedOutput);
  }

  private static void testRotate(
      byte[] input, int distance, int fromIndex, int toIndex, byte[] expectedOutput) {
    input = Arrays.copyOf(input, input.length);
    Bytes.rotate(input, distance, fromIndex, toIndex);
    assertThat(input).isEqualTo(expectedOutput);

     * most common. This is the state information that would be retrieved from
     * WINS for example. Natrually it is not practical for every NbtAddress
     * to be populated will all state requiring a Node Status on every host
     * encountered. The below methods allow state to be populated when requested
     * in a lazy fashon.
     */

    /**
     * Check if directory can cache enumeration results
     * @param state lease state
     * @return true if directory enumeration can be cached
     */
    public static boolean canCacheEnumeration(int state) {
        return Smb2LeaseState.hasReadCaching(state);
    }

    /**
     * Check if directory can keep handles open
     * @param state lease state
     * @return true if directory handles can be kept open
     */

        this.leaseKey = leaseKey;
    }

    /**
     * Gets the requested lease state flags for V2
     * @return the requested lease state
     */
    public int getLeaseState() {
        return leaseState;
    }

    /**
     * Sets the requested lease state flags for V2
     * @param leaseState the lease state to set
     */
    public void setLeaseState(int leaseState) {

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Ints.asList(array),
   * distance)}, but is considerably faster and avoids allocation and garbage collection.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(int[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**

     * @return the lease key
     */
    public Smb2LeaseKey getLeaseKey() {
        return leaseKey;
    }

    /**
     * Gets the lease state being acknowledged
     * @return the lease state
     */
    public int getLeaseState() {
        return leaseState;
    }

    /**
     * Gets the lease flags for this acknowledgment
     * @return the lease flags
     */
    public int getLeaseFlags() {

    /**
     * Gets the registration state.
     *
     * @return the current registration state
     */
    public WitnessRegistrationState getState() {
        return state;
    }

    /**
     * Sets the registration state.
     *
     * @param state the new registration state
     */
    public void setState(WitnessRegistrationState state) {
        this.state = state;
    }

    /**

/** Measures the size of AbstractFuture implementations. */
@NullUnmarked
public class AbstractFutureFootprintBenchmark {

  enum State {
    NOT_DONE,
    FINISHED,
    CANCELLED,
    FAILED
  }

  @Param State state;
  @Param Impl impl;

  @Param({"0", "1", "5", "10"})
  int numListeners;

  @Param({"0", "1", "5", "10"})
  int numThreads;

        state.incrementRetry();

        // For test purposes, execute recovery immediately without delay
        // In production, this might use the delay from getNextRetryTime()
        executor.submit(() -> attemptRecovery(channel, state));
    }

    private void scheduleRecoveryWithTransport(ChannelInfo channel, FailoverState state, SmbTransport newTransport) {