try {
        Object actualReturnValue = method.invoke(wrapper, passedArgs);
        // If we think this might be a 'chaining' call then we allow the return value to either
        // be the wrapper or the returnValue.
        if (!isPossibleChainingCall || wrapper != actualReturnValue) {
          assertEquals(

        data[7] = (byte) (high >> 24);

        PacDataInputStream pdis = createInputStream(data);
        Date date = pdis.readFiletime();
        assertNotNull(date);
        // Allow for a small difference due to precision loss
        assertEquals(time / 1000, date.getTime() / 1000);

        // Test with null date (0x7fffffff ffffffff)

        // Test setting timestamp 1 hour ago
        long testTime = System.currentTimeMillis() - 3600000;
        file.setLastModified(testTime);

        long retrievedTime = file.lastModified();
        // Allow for reasonable precision differences
        assertTrue(Math.abs(retrievedTime - testTime) < 10000, "Set timestamp should be approximately correct");
    }

    // ========== Path and URL Operations ==========

        return buffer.limit();
    }

    /**
     * Check if region has specific access permission
     *
     * @param access access permission to check
     * @return true if access is allowed, false otherwise
     */
    public boolean hasAccess(RdmaAccess access) {
        return accessFlags.contains(access);
    }

    /**
     * Check if memory region is still valid
     *

        if (settings.get(USER_DICT_PATH_OPTION) != null && settings.get(USER_DICT_RULES_OPTION) != null) {
            throw new IllegalArgumentException(
                    "It is not allowed to use [" + USER_DICT_PATH_OPTION + "] in conjunction" + " with [" + USER_DICT_RULES_OPTION + "]");
        }
        try {
            Set<String> dup = new HashSet<>();
            List<String> ruleList =

    }

    /*
     * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
     * guaranteed to be either exact or one less than the correct value. This follows from fact that
     * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite
     * trivial.
     */
    long quotient = ((dividend >>> 1) / divisor) << 1;

mvn jacoco:report

# License header validation
mvn apache-rat:check

# API compatibility checking
mvn clirr:check
```

### Architecture Overview

The library follows a layered architecture:

- **Context Layer**: `CIFSContext` interface provides the main entry point
- **Resource Layer**: `SmbResource` interface represents SMB network resources  

    /**
     * Share flag indicating that shared delete is forced for this share.
     */
    public static final int SMB2_SHAREFLAG_FORCE_SHARED_DELETE = 0x200;
    /**
     * Share flag indicating that namespace caching is allowed on this share.
     */
    public static final int SMB2_SHAREFLAG_ALLOW_NAMESPACE_CACHING = 0x400;
    /**
     * Share flag indicating that access-based directory enumeration is enabled.
     */

# Source files generated by annotation processors appear directly
# under the root of srcjars jars created by bazel, rather than under
# the maven-style src/main/java subdirectory.
#
# Bazel manages annotation generated source as follows: First, it
# calls javac with options that create generated files under a
# bazel-out directory. Next, it archives the generated source files
# into a srcjar directly under the root. There doesn't appear to be a

  final void retryUpdate(long x, int @Nullable [] hc, boolean wasUncontended) {
    int h;
    if (hc == null) {
      threadHashCode.set(hc = new int[1]); // Initialize randomly
      int r = rng.nextInt(); // Avoid zero to allow xorShift rehash
      h = hc[0] = (r == 0) ? 1 : r;
    } else h = hc[0];
    boolean collide = false; // True if last slot nonempty
    for (; ; ) {
      Cell[] as;
      Cell a;
      int n;