in an unspecified order.
This means that races on multiword data structures
can lead to inconsistent values not corresponding to a single write.
When the values depend on the consistency
of internal (pointer, length) or (pointer, type) pairs,
as can be the case for interface values, maps,
slices, and strings in most Go implementations,
such races can in turn lead to arbitrary memory corruption.
</p>

<p>

            when(mockNdrBuffer.dec_ndr_short()).thenReturn((int) (short) 0, (int) (short) 0);
            when(mockNdrBuffer.dec_ndr_long()).thenReturn(0); // Null referent pointer

            // When: Decoding the unicode string
            unicodeString.decode(mockNdrBuffer);

            // Then: Verify the decoding sequence and values
            verify(mockNdrBuffer).align(4);

        // Prepare test data with minimal valid resource record
        byte[] src = new byte[100];
        int srcIndex = 10;

        // Set up a minimal resource record response
        // Name pointer (0xC00C)
        src[srcIndex] = (byte) 0xC0;
        src[srcIndex + 1] = 0x0C;
        // Record type (NBSTAT = 0x0021)
        src[srcIndex + 2] = 0x00;
        src[srcIndex + 3] = 0x21;

#include "tensorflow/core/lib/llvm_rtti/llvm_rtti.h"
#include "tensorflow/core/platform/errors.h"

namespace tensorflow {
namespace gradients {
namespace {

// TODO(b/172558015): Using the pointer address as the identifier for the tensor
// may lead to collisions. Introduce another way to get a unique id for this
// tensor.
int64_t ToId(const AbstractTensorHandle* t) {

                final int structStart = dstIndex;

                SMBUtil.writeInt4(0, dst, structStart); // Next
                if (lastStart > 0) {
                    // set next pointer of previous CREATE_CONTEXT
                    SMBUtil.writeInt4(structStart - dstIndex, dst, lastStart);
                }

                dstIndex += 4;
                final byte[] cnBytes = createContext.getName();

//
// This function will block till the operation that produces `h` has completed.
TF_CAPI_EXPORT extern const char* TFE_TensorHandleBackingDeviceName(
    TFE_TensorHandle* h, TF_Status* status);

// Return a pointer to a new TFE_TensorHandle that shares the underlying tensor
// with `h`. On success, `status` is set to OK. On failure, `status` reflects
// the error and a nullptr is returned.

        byte[] dst = new byte[4];
        assertDoesNotThrow(() -> raf.readFully(dst));
        assertEquals(2, calls.get());
    }

    @Test
    @DisplayName("skipBytes(): advances file pointer for positive values")
    void skipBytes_advancesFP() throws Exception {
        SmbRandomAccessFile raf = newInstance("r", false, false, false);
        assertEquals(0L, raf.getFilePointer());

}

func (w *Walker) writeType(buf *bytes.Buffer, typ types.Type) {
	switch typ := typ.(type) {
	case *types.Basic:
		s := typ.Name()
		switch typ.Kind() {
		case types.UnsafePointer:
			s = "unsafe.Pointer"
		case types.UntypedBool:
			s = "ideal-bool"
		case types.UntypedInt:
			s = "ideal-int"
		case types.UntypedRune:
			// "ideal-char" for compatibility with old tool
			// TODO(gri) change to "ideal-rune"

	h.workers.Add(1)
	defer h.workers.Add(-1)

	h.wg.Add(1)
	defer h.wg.Done()

	entries := make([]any, 0)
	name := h.Name()

	defer func() {
		// re-load the global buffer pointer
		// in case it was modified by a new target.
		logChLock.Lock()
		currentGlobalBuffer, ok := logChBuffers[name]
		logChLock.Unlock()
		if !ok {
			return
		}

		for _, v := range entries {

   * double the index of the entry in entrySet.asList.)
   *
   * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing.
   * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length],
   * save that if that location is already full, we try the next index, and the next, until we