Fix: rcuja merge fixes
[userspace-rcu.git] / rcuja / rcuja.c
2015-05-04  Mathieu DesnoyersMerge branch 'master' into urcu/rcuja-range-merge
2013-06-26  Mathieu DesnoyersMerge branch 'master' into urcu/rcuja-range
2013-06-14  Mathieu DesnoyersMerge branch 'master' into urcu/rcuja-range
2013-06-13  Mathieu Desnoyersrcuja: add missing rcu_dereference
2013-06-13  Mathieu Desnoyersrcuja: disable node accounting by default
2013-06-11  Mathieu Desnoyersrcuja: fix iteration and lookup below/above equal
2013-06-09  Mathieu Desnoyersrcuja: fix below/above "or equal" lookup
2013-06-07  Mathieu Desnoyersrcuja: add duplicate at end of list
2013-06-07  Mathieu Desnoyersrcuja: remove unneeded headers
2013-06-07  Mathieu Desnoyersrcuja: update copyright dates
2013-06-07  Mathieu Desnoyersrcuja: derived work from HP Judy array
2013-06-07  Mathieu Desnoyersrcuja: below/above skip NULL pointers
2013-06-07  Mathieu Desnoyersrcuja: remove "free_node_cb" from destroy
2013-06-07  Mathieu Desnoyersrcuja: cleanup
2013-06-07  Mathieu Desnoyersrcuja: below/equal result key
2013-06-07  Mathieu Desnoyersrcuja: below equal/above equal
2013-06-06  Mathieu Desnoyersrcuja: document that destroy free_node_cb does not...
2013-06-06  Mathieu Desnoyersrcuja: rename new_node to node in add functions
2013-06-06  Mathieu Desnoyersrcuja: fix 8-bit overflow in 1d/2d distribution sum
2013-06-06  Mathieu Desnoyersrcuja: 2d distribution sum improvement
2013-06-05  Mathieu Desnoyersrcuja: implement ja_node_ptr fast path
2013-06-05  Mathieu Desnoyersrcuja API: remove dependency on hlist
2013-06-05  Mathieu Desnoyersrcuja: API change: move rcu_head to user code
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 bitfield.h
2013-06-03  Mathieu Desnoyersrcuja: implement lookup_lower_equal
2013-05-31  Mathieu Desnoyersrcuja: return errors on destroy
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 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: 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-27  Mathieu Desnoyersrcuja fix: list prev pointer vs recompaction
2013-05-27  Mathieu DesnoyersFix rcuja: concurrency checks
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 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-14  Mathieu Desnoyersrcuja: allow non-power of 2 keys
2013-05-14  Mathieu DesnoyersFix: rcuja: typo
2013-05-14  Mathieu Desnoyersrcuja: fix duplicate node/key support
2013-05-14  Mathieu Desnoyersrcuja: fix delete
2013-05-14  Mathieu Desnoyersrcuja: free all leaf nodes at destruction
2013-05-14  Mathieu Desnoyersrcuja: implement delete function
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: 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: 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 DesnoyersUse statistical approach to approximate the max number...
2013-05-14  Mathieu Desnoyersrcuja: use pool of linear array instead of bitmap
2013-05-14  Mathieu DesnoyersRCU judy array: implement node get functions
2013-05-14  Mathieu Desnoyersrcuja: Increase granularity
2013-05-14  Mathieu DesnoyersRCU Judy Array Design and initial files
This page took 0.211302 seconds and 95 git commands to generate.