m := NewDRWMutex(ds, "")
	var acc0, acc1 uint64
	b.SetParallelism(4)
	b.RunParallel(func(pb *testing.PB) {
		c := make(chan bool)
		var data [4 << 10]uint64
		for i := 0; pb.Next(); i++ {
			if i%4 == 0 {
				m.Lock(id, source)
				acc0 -= 100
				acc1 += 100
				m.Unlock(b.Context())
			} else {
				for i := 0; i < len(data); i += 4 {

LSR $32, acc2, t0 MUL acc2, const1, t1 UMULH acc2, const1, acc2 ADCS t0, acc0 ADCS t1, acc1 ADC $0, acc2 // Last reduction step ADDS acc3<<32, acc0, acc0 LSR $32, acc3, t0 MUL acc3, const1, t1 UMULH acc3, const1, acc3 ADCS t0, acc1 ADCS t1, acc2 ADC $0, acc3 SUBS $-1, acc0, t0 SBCS const0, acc1, t1 SBCS $0, acc2, t2 SBCS const1, acc3, t3 CSEL CS, t0, acc0, acc0 CSEL CS, t1, acc1, acc1 CSEL CS, t2, acc2, acc2 CSEL CS, t3, acc3, acc3 STP (acc0, acc1), 0*16(res_ptr) STP (acc2, acc3), 1*16(res_ptr) RET...

LSR $32, acc2, t0 MUL acc2, const1, t1 UMULH acc2, const1, acc2 ADCS t0, acc0 ADCS t1, acc1 ADC $0, acc2 // Last reduction step ADDS acc3<<32, acc0, acc0 LSR $32, acc3, t0 MUL acc3, const1, t1 UMULH acc3, const1, acc3 ADCS t0, acc1 ADCS t1, acc2 ADC $0, acc3 SUBS $-1, acc0, t0 SBCS const0, acc1, t1 SBCS $0, acc2, t2 SBCS const1, acc3, t3 CSEL CS, t0, acc0, acc0 CSEL CS, t1, acc1, acc1 CSEL CS, t2, acc2, acc2 CSEL CS, t3, acc3, acc3 STP (acc0, acc1), 0*16(res_ptr) STP (acc2, acc3), 1*16(res_ptr) RET...

        void shouldHandleEmptyApplyToText() {
            ACE ace1 = mock(ACE.class);
            ACE ace2 = mock(ACE.class);
            when(ace1.getApplyToText()).thenReturn("");
            when(ace2.getApplyToText()).thenReturn(null);

            assertEquals("", ace1.getApplyToText(), "Should handle empty apply text");

		SecretKey:  svcSK,
	})
	if err != nil {
		c.Fatalf("Unable to create svc acc: %v", err)
	}
	svcClient := s.getUserClient(c, cr.AccessKey, cr.SecretKey, "")
	c.mustListObjects(ctx, svcClient, bucket)

	err = madmClient.DeleteServiceAccount(ctx, svcAK)
	if err != nil {
		c.Fatalf("unable to delete svc acc: %v", err)
	}
	c.mustNotListObjects(ctx, svcClient, bucket)
}

                )
              }
            },
          ),
        ).sslSocketFactory(sslSocketFactory, handshakeCertificates.trustManager)
        .build()

    server.enqueue(MockResponse(body = "abc1"))
    server.enqueue(MockResponse(body = "abc2"))

    val request = Request(server.url("/"))

    client.newCall(request).execute().use { response ->
      assertEquals(200, response.code)
    }

			a.N = atomic.LoadInt64(&old.N)
			e.mu.Lock()
			e.addAll(t-1, a)
			e.mu.Unlock()
			acc = newAcc
		} else {
			// We may be able to grab the new accumulator by yielding.
			runtime.Gosched()
			acc = e.cached.Load()
		}
	}
	atomic.AddInt64(&acc.N, 1)
	atomic.AddInt64(&acc.Total, int64(value))
	atomic.AddInt64(&acc.Size, sz)
}

// total returns the total call count and latency for the last minute.

    enableTls()

    client =
      client
        .newBuilder()
        .eventListenerFactory(clientTestRule.wrap(eventRecorder))
        .build()

    server.enqueue(MockResponse(body = "abc1"))
    server.enqueue(MockResponse(body = "abc2"))

    val request = Request.Builder().url(server.url("/")).build()

    client.newCall(request).execute().use { response ->
      assertEquals(200, response.code)

        try {
            return new SID(textual);
        } catch (SmbException e) {
            throw new RuntimeException(e);
        }
    }

    @Test
    @DisplayName("resolveSids(DcerpcHandle,...) populates acct, domain and type for known types")
    void resolveSids_populatesFields_happyPath() throws Exception {
        SIDCacheImpl cache = new SIDCacheImpl(mock(CIFSContext.class));
        DcerpcHandle handle = mock(DcerpcHandle.class);

					}
				}
				svcAccts[user] = madmin.SRSvcAccCreate{
					Parent:        acc.Credentials.ParentUser,
					AccessKey:     user,
					SecretKey:     acc.Credentials.SecretKey,
					Groups:        acc.Credentials.Groups,
					Claims:        claims,
					SessionPolicy: policyJSON,
					Status:        acc.Credentials.Status,
					Name:          sa.Name,
					Description:   sa.Description,