TF_SetStatus(status, TF_OK, "");
  if (retvals[0] != nullptr) {
    TFE_DeleteTensorHandle(retvals[0]);
  }
  retvals[0] = nullptr;
  TFE_Execute(matmul2, &retvals[0], &num_retvals, status);
  EXPECT_EQ(TF_OK, TF_GetCode(status));
  TF_Tensor* t = TFE_TensorHandleResolve(retvals[0], status);
  EXPECT_EQ(TF_OK, TF_GetCode(status));
  TF_DeleteTensor(t);

        lsarpc.LsarClose lsarClose = new lsarpc.LsarClose(mockHandle);

        when(mockNdrBuffer.dec_ndr_long()).thenReturn(123); // retval

        lsarClose.decode_out(mockNdrBuffer);

        verify(mockHandle).decode(mockNdrBuffer);
        assertEquals(123, lsarClose.retval);
    }

    // Test for LsarQueryInformationPolicy
    @Test
    void testLsarQueryInformationPolicyConstructorAndGetOpnum() {

   * higher than performing just the operation without enforcing the capacity constraint.
   *
   * This implementation uses a per-segment queue to record a memento of the additions, removals,
   * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
   * its capacity threshold.
   *

   * higher than performing just the operation without enforcing the capacity constraint.
   *
   * This implementation uses a per-segment queue to record a memento of the additions, removals,
   * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
   * its capacity threshold.
   *