##### Figure 1 - Secure Channel construction

```
plaintext   := chunk_0          ||       chunk_1          ||       chunk_2          ||       ...
                 |                         |                         |

      this.chunks = chunks;
      this.chunkShift = chunkShift;
      this.chunkMask = (1 << chunkShift) - 1;
      int total = 0;
      for (CharSequence element : chunks) {
        total += element.length();
      }
      this.length = total;
    }

    @Override
    public int length() {
      return length;
    }

    @Override

 * copy operations with multiple chunk specifications.
 *
 * @author mbechler
 *
 */
public class SrvCopychunkCopy implements Encodable {

    private final byte[] sourceKey;
    private final SrvCopychunk[] chunks;

    /**
     * Constructs a server copy chunk operation request
     * @param sourceKey the resume key identifying the source file
     * @param chunks the array of copy chunk descriptors
     */

        }

        @Test
        @DisplayName("Should handle mismatched chunk and total bytes")
        void testMismatchedValues() throws SMBProtocolDecodingException {
            // This could happen if the last chunk is smaller
            byte[] buffer = createValidCopyChunkResponse(10, // 10 chunks
                    65536, // Last chunk size (not average)
                    589824 // Total less than 10 * 65536
            );

        void testEncodeMultipleChunks() {
            // Given
            SrvCopychunk chunk1 = new SrvCopychunk(100, 200, 300);
            SrvCopychunk chunk2 = new SrvCopychunk(400, 500, 600);
            SrvCopychunk chunk3 = new SrvCopychunk(700, 800, 900);
            SrvCopychunkCopy copy = new SrvCopychunkCopy(sourceKey, chunk1, chunk2, chunk3);

            // When

   * Computes a hash code based on the data that have been provided to this hasher. This is called
   * after all chunks are handled with {@link #process} and any leftover bytes that did not make a
   * complete chunk are handled with {@link #processRemaining}.
   */
  protected abstract HashCode makeHash();

  // Process pent-up data in chunks
  private void munchIfFull() {
    if (buffer.remaining() < 8) {

    private int totalBytesWritten;

    /**
     * Gets the number of bytes written in the last chunk
     * @return the chunkBytesWritten
     */
    public int getChunkBytesWritten() {
        return this.chunkBytesWritten;
    }

    /**
     * Gets the number of chunks successfully written
     * @return the chunksWritten
     */
    public int getChunksWritten() {

    /**
     * Returns a new tree starting at this node, filtering the children.
     * Note that this node will not be filtered and only the children
     * and its descendant will be checked.
     *
     * @param filter the filter to apply
     * @return a new filtered graph
     */
    @Nonnull
    Node filter(@Nonnull Predicate<Node> filter);

    /**

		_, err := f.Write(chunk)
		if err != nil {
			t.Fatal("write chunk:", err)
		}
	}
	if frag := int(size % chunkSize); frag > 0 {
		_, err := f.Write(chunk[:frag])
		if err != nil {
			t.Fatal("write chunk:", err)
		}
	}
	end := []byte("END\n")
	_, err = f.Write(end)
	if err != nil {
		t.Fatal("write end:", err)
	}
	if err := w.Close(); err != nil {
		t.Fatal(err)
	}

                                    + " deploying machines are reasonably synchronized.");
                    versioning.setLastUpdated(now);
                    changed = true;
                }
            }
        }

        if (changed) {
            getLogger().debug("Repairing metadata in " + metadataFile);

            try (OutputStream out = Files.newOutputStream(metadataFile.toPath())) {