Skip to content

Extend NonBlockingSemaphore and make release for 1-permit case atomic #8446

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 27, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -66,7 +66,7 @@ public boolean acquire(final int count) {
@Override
public int release(final int count) {
reset();
return available();
return 1;
}

@Override
Expand Down
Original file line number Diff line number Diff line change
@@ -1,15 +1,16 @@
package com.datadog.iast.util

import datadog.trace.test.util.DDSpecification

import groovy.transform.CompileDynamic
import spock.lang.Specification

import java.util.concurrent.Callable
import java.util.concurrent.CountDownLatch
import java.util.concurrent.Executors
import java.util.concurrent.TimeUnit

@CompileDynamic
class NonBlockingSemaphoreTest extends DDSpecification {
class NonBlockingSemaphoreTest extends Specification {

void 'test that the semaphore controls access to a shared resource (#permitCount)'(final int permitCount) {
given:
Expand Down Expand Up @@ -71,6 +72,40 @@ class NonBlockingSemaphoreTest extends DDSpecification {
2 | _
}

void 'can never acquire more permits than the total'(final int permitCount) {
given:
final semaphore = NonBlockingSemaphore.withPermitCount(permitCount)

when:
final acquired = semaphore.acquire(permitCount+1)

then:
!acquired

where:
permitCount | _
1 | _
2 | _
}

void 'can perform extra releases'(final int permitCount) {
given:
final semaphore = NonBlockingSemaphore.withPermitCount(permitCount)

when:
for (int i = 0; i < permitCount * 2; i++) {
assert semaphore.release() == permitCount
}

then:
semaphore.available() == permitCount

where:
permitCount | _
1 | _
2 | _
}

void 'reset helps recover when there is starvation (#permitCount)'(final int permitCount) {
given:
final semaphore = NonBlockingSemaphore.withPermitCount(permitCount)
Expand All @@ -97,24 +132,41 @@ class NonBlockingSemaphoreTest extends DDSpecification {
given:
final int threads = 100
final semaphore = NonBlockingSemaphore.unlimited()
final latch = new CountDownLatch(threads)
final executors = Executors.newFixedThreadPool(threads)

when:
final acquired = (1..threads).collect {
executors.submit({
latch.countDown()
if (semaphore.acquire()) {
TimeUnit.MILLISECONDS.sleep(100)
semaphore.release()
return 1
}
return 0
} as Callable<Integer>)
}.collect { it.get() }.sum()
semaphore.acquire()? 1 : 0
}.collect { it }.sum()

then:
acquired == threads
semaphore.available() == Integer.MAX_VALUE

when:
int availableAfterRelease = semaphore.release()

then:
availableAfterRelease == Integer.MAX_VALUE
semaphore.available() == Integer.MAX_VALUE

when:
semaphore.reset()

then:
semaphore.available() == Integer.MAX_VALUE
}

void 'cannot create a semaphore without at least 1 permit'() {
when:
NonBlockingSemaphore.withPermitCount(0)

then:
thrown(AssertionError)

when:
NonBlockingSemaphore.withPermitCount(-1)

then:
thrown(AssertionError)
}
}
Loading