else if (a.cas(v = a.value, fn(v, x))) break;
        else if (n >= NCPU || cells != as) collide = false; // At max size or stale
        else if (!collide) collide = true;
        else if (busy == 0 && casBusy()) {
          try {
            if (cells == as) { // Expand table unless stale
              Cell[] rs = new Cell[n << 1];
              for (int i = 0; i < n; ++i) rs[i] = as[i];
              cells = rs;

    /**
     * 
     */
    public static final int SMB2_SHARE_CAP_DFS = 0x8;

    /**
     * 
     */
    public static final int SMB2_SHARE_CAP_CONTINUOUS_AVAILABILITY = 0x10;

    /**
     * 
     */
    public static final int SMB2_SHARE_CAP_SCALEOUT = 0x20;

    /**
     * 
     */
    public static final int SMB2_SHARE_CAP_CLUSTER = 0x40;

    /**
     * 
     */

        connectionState = 0;
    }

    synchronized SmbTree getSmbTree( String share, String service ) {
        SmbTree t;

        if( share == null ) {
            share = "IPC$";
        }
        for( Enumeration e = trees.elements(); e.hasMoreElements(); ) {
            t = (SmbTree)e.nextElement();
            if( t.matches( share, service )) {
                return t;
            }
        }

                    Assume.assumeTrue("No permission for share security accesss", false);
                }
                throw e;
            }
        }
    }


    @Test
    public void testShareSize () throws IOException {
        try ( SmbResource f = getDefaultShareRoot() ) {
            long l = f.length();
            Assume.assumeTrue("No share size reported", l != 0);
        }
    }

            int _share_namep = _src.dec_ndr_long();

            if ( _server_namep != 0 ) {
                _src = _src.deferred;
                this.server_name = _src.dec_ndr_string();

            }
            if ( _share_namep != 0 ) {
                _src = _src.deferred;
                this.share_name = _src.dec_ndr_string();

            }
        }
    }

    // Add small multiples of MIN_VALUE and MIN_NORMAL
    for (int scale = 1; scale <= 4; scale++) {
      for (double d : Doubles.asList(Double.MIN_VALUE, Double.MIN_NORMAL)) {
        fractionalBuilder.add(d * scale).add(-d * scale);
      }
    }
    for (int i = Double.MIN_EXPONENT; i <= Double.MAX_EXPONENT; i++) {
      for (int direction : new int[] {1, -1}) {

    /**
     * Sent by the server in the Type 2 message to indicate that the
     * target authentication realm is a share (presumably for share-level
     * authentication).
     */
    public static final int NTLMSSP_TARGET_TYPE_SHARE = 0x00040000;

    /**
     * Indicates that the NTLM2 signing and sealing scheme should be used

  @CheckForNull
  K getKey();

  /*
   * Used by entries that use access order. Access entries are maintained in a doubly-linked list.
   * New entries are added at the tail of the list at write time; stale entries are expired from
   * the head of the list.
   */

  /** Returns the time that this entry was last accessed, in ns. */
  @SuppressWarnings("GoodTime")
  long getAccessTime();

      tmp += UnsignedLongs.remainder(longs[j], divisors[j]);
    }
    return tmp;
  }

  @Benchmark
  long parseUnsignedLong(int reps) {
    long tmp = 0;
    // Given that we make three calls per pass, we scale reps down in order
    // to do a comparable amount of work to other measurements.
    int scaledReps = reps / 3 + 1;
    for (int i = 0; i < scaledReps; i++) {
      int j = i & ARRAY_MASK;

    /**
     * @return tree id
     */
    int getTid ();


    /**
     * @return service
     */
    String getService ();


    /**
     * @return whether the share is in DFS
     */
    boolean isShareDfs ();


    /**
     * @return whether the tree id is a valid one
     */
    boolean isValidTid ();