userspace-rcu.git
2013-06-03  Mathieu DesnoyersAdd QSBR minimal example
2013-06-03  Mathieu Desnoyersrcuja: document attach role in no dead-end guarantees
2013-06-03  Mathieu Desnoyersrcuja: lookup lower equal cannot reach dead-end
2013-06-03  Mathieu Desnoyersrcuja: lower equal: handle concurrent removal with...
2013-06-03  Mathieu Desnoyersrcuja: remove unneeded endian.h
2013-06-03  Mathieu Desnoyersrcuja: remove unneeded bitfield.h
2013-06-03  Mathieu Desnoyersrcuja tests: test lookup lower equal for 8-bit and...
2013-06-03  Mathieu Desnoyersrcuja: implement lookup_lower_equal
2013-06-03  Mathieu Desnoyersrcuja tests: fix sanity test printout
2013-05-31  Mathieu Desnoyersrcuja test: add specific free_node()
2013-05-31  Mathieu Desnoyersrcuja test: cleanup
2013-05-31  Mathieu Desnoyersrcuja.sh: add node leak detection
2013-05-31  Mathieu Desnoyersrcuja tests: node leak detection
2013-05-31  Mathieu Desnoyersexpand runja.sh
2013-05-31  Mathieu Desnoyersja tests: add printout
2013-05-31  Mathieu Desnoyersrcuja tests: add vs add unique
2013-05-31  Mathieu Desnoyersrunja.sh: run sanity tests
2013-05-31  Mathieu Desnoyersrcuja: return errors on destroy
2013-05-31  Mathieu Desnoyersrcuja tests: return errors
2013-05-31  Mathieu Desnoyersrcuja: add runja.sh
2013-05-31  Mathieu Desnoyersrcuja: cleanup destroy print output
2013-05-31  Mathieu Desnoyersrcuja: move debugging info into judy array structure
2013-05-31  Mathieu Desnoyersrcuja: use rcu_barrier in destroy
2013-05-31  Mathieu DesnoyersImplement rcu_barrier()
2013-05-31  Mathieu Desnoyersrcuja: tweak pigeon min child for 32-bit
2013-05-31  Mathieu Desnoyersrcuja: tweak pigeon min child for 64-bit
2013-05-31  Mathieu Desnoyersrcuja testing: add arbitrary wait
2013-05-31  Mathieu Desnoyersrcuja fix: perform lookup in attach node
2013-05-30  Mathieu Desnoyersrcuja: implement add unique
2013-05-30  Mathieu Desnoyersrcuja: fixes and add redesign of "add"
2013-05-30  Mathieu Desnoyersrcuja test: destroy should be done online
2013-05-30  Mathieu Desnoyersrcuja: print info about allocated/freed/fallback nodes
2013-05-30  Mathieu Desnoyersrcuja fix: fix 2d distance calculation
2013-05-30  Mathieu Desnoyersrcuja fix: update 2d distance calculation
2013-05-30  Mathieu Desnoyersrcuja: add same can use same fallback as add next
2013-05-30  Mathieu Desnoyersrcuja: implement 2d distribution
2013-05-29  Mathieu Desnoyersrcuja 1d distribution: cleanup
2013-05-28  Mathieu Desnoyersrcuja: implement 1 dimension pool distribution
2013-05-28  Mathieu DesnoyersFix rcuja: fallback when adding element to full pool
2013-05-28  Mathieu Desnoyersrcuja test: fix -k option
2013-05-27  Mathieu Desnoyersrcuja: Add missing header
2013-05-27  Mathieu Desnoyersrcuja test: print mul fact
2013-05-27  Mathieu Desnoyersrcuja test: add key multiplication factor
2013-05-27  Mathieu Desnoyerstest rcuja: add ratio parameter
2013-05-27  Mathieu Desnoyersrcuja fix: list prev pointer vs recompaction
2013-05-27  Mathieu DesnoyersFix rcuja: concurrency checks
2013-05-27  Mathieu Desnoyersrcuja test: use poison_free
2013-05-27  Mathieu Desnoyersrcuja test: add missing rcu read unlock
2013-05-23  Mathieu Desnoyersrcuja fix: handle add/removal/add concurrency
2013-05-23  Mathieu Desnoyersrcuja fix: del wrt concurrency
2013-05-23  Mathieu DesnoyersFix urcu test: incorrect handling of del/free
2013-05-23  Mathieu Desnoyershlist: remove needless "member" parameter
2013-05-23  Mathieu DesnoyersFix rcuja: chain/unchain locking vs retry
2013-05-23  Mathieu DesnoyersFix rcuja: delete last node
2013-05-22  Mathieu Desnoyersrcuja fix: get the right node
2013-05-18  Mathieu DesnoyersFix rcuja: handle concurrent updates
2013-05-18  Mathieu Desnoyersrcuja: Add debug output
2013-05-14  Mathieu Desnoyersrcuja test: add rcu_ prefix to debug_yield_read
2013-05-14  Mathieu Desnoyersrcuja: allow non-power of 2 keys
2013-05-14  Mathieu Desnoyersrcuja: add multithread test
2013-05-14  Mathieu DesnoyersFix: rcuja: typo
2013-05-14  Mathieu Desnoyersrcuja: test duplicate node/key support
2013-05-14  Mathieu Desnoyersrcuja: fix duplicate node/key support
2013-05-14  Mathieu Desnoyershlist: implement non-entry API
2013-05-14  Mathieu Desnoyersrcuja: fix delete
2013-05-14  Mathieu Desnoyersrcuja: free all leaf nodes at destruction
2013-05-14  Mathieu Desnoyershlist: implement cds_hlist_first_entry_rcu
2013-05-14  Mathieu Desnoyersrcuja: implement delete function
2013-05-14  Mathieu Desnoyershlist: implement cds_hlist_empty
2013-05-14  Mathieu Desnoyersrcuja: partial implementation of cds_ja_del
2013-05-14  Mathieu Desnoyersrcuja: implement ja_node_clear_nth
2013-05-14  Mathieu Desnoyersrcuja: extend tests, more fixes
2013-05-14  Mathieu Desnoyersrcuja: fix max depth test
2013-05-14  Mathieu Desnoyersrcuja: swap key
2013-05-14  Mathieu Desnoyersrcuja: add fallback nodes
2013-05-14  Mathieu Desnoyersrcuja: various fixes
2013-05-14  Mathieu Desnoyersrcuja: add basic test
2013-05-14  Mathieu Desnoyersrcuja: create shadow node for root
2013-05-14  Mathieu Desnoyersrcuja: implement add
2013-05-14  Mathieu Desnoyersrcuja: implement lookup
2013-05-14  Mathieu Desnoyersrcuja: rename cds_ja_node to cds_ja_inode
2013-05-14  Mathieu Desnoyersrcuja: new and destroy
2013-05-14  Mathieu Desnoyersrcuja: rename to cds_ja
2013-05-14  Mathieu Desnoyersrcuja: add comment about use of number of nodes
2013-05-14  Mathieu Desnoyersrcuja: fix iteration on recompact add
2013-05-14  Mathieu Desnoyersrcuja: share lock across all nodes with same key
2013-05-14  Mathieu Desnoyersrcuja: no need to link with urcu lib anymore
2013-05-14  Mathieu Desnoyersrcuja: use rcu ja app flavor for shadow hash table
2013-05-14  Mathieu Desnoyersrcuja: shadow clear also frees the rcu ja node associated
2013-05-14  Mathieu Desnoyersrcuja: implement shadow node hash table
2013-05-14  Mathieu Desnoyersrcuja: add shadow nodes hash table
2013-05-14  Mathieu Desnoyersrcuja: add data structures for rcu_ja and shadow nodes
2013-05-14  Mathieu Desnoyersrcuja: add missing assign in recompact
2013-05-14  Mathieu Desnoyersrcuja: implement node add recompaction
2013-05-14  Mathieu Desnoyersrcuja: set node update, rcu-ize get node/set node
2013-05-14  Mathieu Desnoyersrcuja: cleanup
2013-05-14  Mathieu Desnoyersrcuja: implement node set nth
2013-05-14  Mathieu Desnoyersrcuja: introduce union to represent nodes
2013-05-14  Mathieu Desnoyersrcuja testpop: print extra items in subclass instead...
2013-05-14  Mathieu DesnoyersUse statistical approach to approximate the max number...
next
This page took 0.037654 seconds and 4 git commands to generate.