liburcu 0.9.1-2 source package in Ubuntu
Changelog
liburcu (0.9.1-2) unstable; urgency=medium [ Michael Jeanson ] * [bbdf92d] Fix regtest hang (Closes: #804726) -- Jon Bernard <email address hidden> Thu, 12 Nov 2015 02:53:27 +0000
Upload details
- Uploaded by:
- Jon Bernard
- Uploaded to:
- Sid
- Original maintainer:
- Jon Bernard
- Architectures:
- any
- Section:
- libs
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| liburcu_0.9.1-2.dsc | 1.9 KiB | 125587160df988f97a63fa88136dd35879053cea8af484aa8b590e76a4a1fe4e |
| liburcu_0.9.1.orig.tar.bz2 | 457.2 KiB | f8d278e9d95bec97c9ba954fc4c3fb584936bc0010713a8fe358b916bafd8715 |
| liburcu_0.9.1-2.debian.tar.xz | 8.2 KiB | 5d022ecc0fff57668616a28fd9c42b13ce358d51a79ac830cda3ac0d3cdfd293 |
Available diffs
- diff from 0.8.7-2 to 0.9.1-2 (253.7 KiB)
- diff from 0.9.1-1 to 0.9.1-2 (1.6 KiB)
No changes file available.
Binary packages built by this source
- liburcu-dev: userspace RCU (read-copy-update) library - development files
This data synchronization library provides read-side access which scales
linearly with the number of cores. It does so by allowing multiples copies of
a given data structure to live at the same time, and by monitoring the data
structure accesses to detect grace periods after which memory reclamation is
possible.
.
Install this package if you wish to develop your own programs using the
userspace RCU library.
- liburcu4: userspace RCU (read-copy-update) library
This data synchronization library provides read-side access which scales
linearly with the number of cores. It does so by allowing multiples copies of
a given data structure to live at the same time, and by monitoring the data
structure accesses to detect grace periods after which memory reclamation is
possible.
- liburcu4-dbgsym: debug symbols for package liburcu4
This data synchronization library provides read-side access which scales
linearly with the number of cores. It does so by allowing multiples copies of
a given data structure to live at the same time, and by monitoring the data
structure accesses to detect grace periods after which memory reclamation is
possible.
