Skip to content

Implement SleeperList without locks #6838

New issue

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

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

Already on GitHub? # to your account

Closed
brson opened this issue May 30, 2013 · 2 comments
Closed

Implement SleeperList without locks #6838

brson opened this issue May 30, 2013 · 2 comments
Labels
A-runtime Area: std's runtime and "pre-main" init for handling backtraces, unwinds, stack overflows

Comments

@brson
Copy link
Contributor

brson commented May 30, 2013

This is a data structure that tracks sleeping schedulers, currently a stack behind a mutex. It needs to be implemented without locks. It can be bounded by some constant, MAX_SCHEDULERS.

@catamorphism
Copy link
Contributor

Visiting for triage. Doesn't look like a release blocker to me.

@alexcrichton
Copy link
Member

Closed by #9710

# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
A-runtime Area: std's runtime and "pre-main" init for handling backtraces, unwinds, stack overflows
Projects
None yet
Development

No branches or pull requests

3 participants