lbrycrd

LBRYCommunity/lbrycrd

Fork 0

Commit graph

Author	SHA1	Message	Date
Brandon Dahler	51ed9ec971	Cleanup code using forward declarations. Use misc methods of avoiding unnecesary header includes. Replace int typedefs with int##_t from stdint.h. Replace PRI64[xdu] with PRI[xdu]64 from inttypes.h. Normalize QT_VERSION ifs where possible. Resolve some indirect dependencies as direct ones. Remove extern declarations from .cpp files.	2013-11-10 09:36:28 -06:00
Wladimir J. van der Laan	e95568b78d	Handle locked pages more robustly (Fixes issue #1462 ) Memory locks do not stack, that is, pages which have been locked several times by calls to mlock() will be unlocked by a single call to munlock(). This can result in keying material ending up in swap when those functions are used naively. In this commit a class "LockedPageManager" is added that simulates stacking memory locks by keeping a counter per page.	2012-08-23 06:55:35 +02:00

Author

SHA1

Message

Date

Brandon Dahler

51ed9ec971

Cleanup code using forward declarations.

Use misc methods of avoiding unnecesary header includes.
Replace int typedefs with int##_t from stdint.h.
Replace PRI64[xdu] with PRI[xdu]64 from inttypes.h.
Normalize QT_VERSION ifs where possible.
Resolve some indirect dependencies as direct ones.
Remove extern declarations from .cpp files.

2013-11-10 09:36:28 -06:00

Wladimir J. van der Laan

e95568b78d

Handle locked pages more robustly (Fixes issue #1462 )

Memory locks do not stack, that is, pages which have been locked several times by calls to mlock()
will be unlocked by a single call to munlock(). This can result in keying material ending up in swap when
those functions are used naively. In this commit a class "LockedPageManager" is added
that simulates stacking memory locks by keeping a counter per page.

2012-08-23 06:55:35 +02:00

2 commits