* @return position of terminating null bytes
     */
    public static int findUNITermination(final byte[] buffer, final int bufferIndex, final int maxLen) {
        int len = 0;
        while (buffer[bufferIndex + len] != (byte) 0x00 || buffer[bufferIndex + len + 1] != (byte) 0x00) {
            len += 2;
            if (len > maxLen) {
                if (log.isDebugEnabled()) {

        when(context2.getURLPath()).thenReturn("/share/");
        when(context2.getServer()).thenReturn("server");

        base2.resolveInContext(context2, "sub/child");
        assertEquals("/share/sub/child", base2.getURLPath());
        assertEquals("\\sub\\child", base2.getUNCPath());
        assertEquals("share", base2.getShare());
    }

      public void cancel(boolean mayInterruptIfRunning) {
        /*
         * Lock to ensure that a task cannot be rescheduled while a cancel is ongoing.
         *
         * In theory, cancel() could execute arbitrary listeners -- bad to do while holding a lock.
         * However, we don't expose currentFuture to users, so they can't attach listeners. And the

# SMB3 Lease Feature - Detailed Design Document

## 1. Overview

SMB3 leases provide a client caching mechanism that replaces the traditional oplock mechanism. Leases enable better performance through client-side caching while maintaining cache coherency across multiple clients.

## 2. Protocol Specification Reference

- **MS-SMB2 Section 2.2.13**: SMB2 CREATE Request with Lease Context
- **MS-SMB2 Section 2.2.14**: SMB2 CREATE Response with Lease State

         *
         * @return The {@link DownloadedArtifact} instance.
         */
        DownloadedArtifact getArtifact();

        /**
         * Returns a mapping of repositories to the exceptions encountered while resolving the artifact.
         *
         * @return A {@link Map} where keys are {@link Repository} instances and values are {@link Exception} instances.
         */
        Map<Repository, List<Exception>> getExceptions();

      assertThat(graph.edges()).isEmpty();
      AbstractGraphTest.validateGraph(graph);

      while (graph.nodes().size() < NUM_NODES) {
        graph.addNode(gen.nextInt(NODE_POOL_SIZE));
      }
      ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes());
      while (graph.edges().size() < NUM_EDGES) {
        graph.putEdge(getRandomElement(nodeList, gen), getRandomElement(nodeList, gen));
      }

                session.send(request, response);
            } catch (final SmbException se) {
                if (se.getNtStatus() == NtStatus.NT_STATUS_NETWORK_NAME_DELETED) {
                    /* Someone removed the share while we were
                     * connected. Bastards! Disconnect this tree
                     * so that it reconnects cleanly should the share
                     * reappear in this client's lifetime.
                     */

  // Outputs of the while loop corresponding to the two inputs above
  // The first one will the function's output
  std::vector<TF_Output> outputs;

  // Add while loop to func_graph_
  {
    // The inputs to the while loop
    std::vector<TF_Output> inputs = {{feed1, 0}, {feed2, 0}};
    std::unique_ptr<TF_WhileParams> params(new TF_WhileParams(

  ) {
    var keyIndex = 0
    val keyLength = key.size
    do {
      val buffer = cursor.data
      var i = cursor.start
      val end = cursor.end
      if (buffer != null) {
        while (i < end) {
          keyIndex %= keyLength // Reassign to prevent overflow breaking counter.

          // Byte xor is experimental in Kotlin so we coerce bytes to int, xor them
          // and convert back to byte.

        final int fraglen = Encdec.dec_uint16le(inB, 8);
        if (fraglen > getMaxRecv()) {
            throw new IOException("Unexpected fragment length: " + fraglen);
        }

        while (have < fraglen) {
            final int r = this.handle.recv(inB, have, fraglen - have);
            if (r == 0) {
                throw new IOException("Unexpected EOF");
            }
            have += r;