HelenOS
HelenOS-doc
HelenOS-historic
Català-Valencià – Catalan
中文 – Chinese (Simplified)
中文 – Chinese (Traditional)
Česky – Czech
Dansk – Danish
Nederlands – Dutch
English – English
Suomi – Finnish
Français – French
Deutsch – German
עברית – Hebrew
हिंदी – Hindi
Magyar – Hungarian
Bahasa Indonesia – Indonesian
Italiano – Italian
日本語 – Japanese
한국어 – Korean
Македонски – Macedonian
मराठी – Marathi
Norsk – Norwegian
Polski – Polish
Português – Portuguese
Português – Portuguese (Brazil)
Русский – Russian
Slovenčina – Slovak
Slovenščina – Slovenian
Español – Spanish
Svenska – Swedish
Türkçe – Turkish
Українська – Ukrainian
Oëzbekcha – Uzbek
Subversion Repositories
HelenOS
(root)
/
branches
/
rcu
/
kernel
/
generic
/
src
/
adt/
– Rev 2496
Rev
Go to most recent revision
|
Show changed files
|
Directory listing
|
RSS feed
Filtering Options
From rev
To rev
Max revs
Search history for
Show All
Clear current filter
Rev
Age
Author
Path
Log message
Diff
2496
6167 d 12 h
jermar
/branches/rcu/kernel/generic/
Cleanup of the RCU branch.
Cleanup avl.h and avl.c a little bit.
Do we really need to have so much of code replication even within one AVL
tree implementation?
2466
6214 d 19 h
mencl
/branches/rcu/kernel/
Added forgoten favl.h and favl.c and changed balance atribute of avl
tree to int8_t.
2461
6217 d 13 h
mencl
/branches/rcu/kernel/
Added Fast avl tree structure which should be used as timeout data structure instead of simple avl tree. This
structure has much faster search min and delete min operations (constant time).
2456
6218 d 11 h
hudecek
/branches/rcu/kernel/
Model use of RCU
2450
6220 d 15 h
mencl
/branches/rcu/kernel/
Repaired avl and extavl tree timeout unregister and delete_min. These
faults caused problems with initializing cpus and they appeared only in
multi processor systems.
2431
6227 d 11 h
mencl
/branches/rcu/kernel/
Repaired extavl and extavlrel data structures, added benchmark tests for avl based data structures and
simulating timeout mechanismus
2421
6229 d 11 h
mencl
/branches/rcu/kernel/
Repaired and debuged data structures and added timeout test
2416
6230 d 11 h
mencl
/branches/rcu/
All timeout structures and tests added
Use timeout structures in timeout mechanism - not tested yet
2307
6248 d 11 h
hudecek
/branches/rcu/
Updated branch to latest trunk revision
2131
6291 d 16 h
decky
/branches/
add development branches
2112
6338 d 20 h
decky
/trunk/kernel/generic/src/adt/
explicit typecast, fix signed/unsigned comparison
2111
6338 d 21 h
decky
/trunk/kernel/generic/src/adt/
fix signed/unsigned comparison
2089
6346 d 20 h
decky
/trunk/
huge type system cleanup
remove cyclical type dependencies across multiple header files
many minor coding style fixes
2071
6357 d 12 h
jermar
/trunk/
(c) versus (C)
1787
6547 d 15 h
decky
/
move kernel/trunk, uspace/trunk and boot/trunk to trunk/kernel, trunk/uspace and trunk/boot
1780
6554 d 16 h
jermar
/kernel/trunk/
Replace old __u?? types with respective C99 variants (e.g. uint32_t, int64_t, uintptr_t etc.).
1757
6568 d 21 h
jermar
/kernel/trunk/
Cleanup of comments.
1708
6572 d 22 h
jermar
/kernel/trunk/
Fix some broken doxygen comments.
1705
6574 d 22 h
cejka
/kernel/trunk/
Added file with modules definitions and descriptions.
We are able to change modules order and their description in one place.
1704
6575 d 1 h
cejka
/kernel/trunk/
Fixed first letter size of subgroup name in Others.
1702
6575 d 19 h
cejka
/kernel/trunk/
Kernel doxygen comments updated.
1549
6585 d 18 h
vana
/kernel/trunk/generic/src/adt/
Bitmap functions patch
1483
6587 d 19 h
jermar
/kernel/trunk/generic/src/
Implement recursive function for deallocating the whole B+tree.
Make use of this function in address space management.
1337
6604 d 17 h
jermar
/kernel/trunk/generic/src/adt/
Remove a misleading comment.
1262
6619 d 14 h
jermar
/kernel/trunk/generic/src/adt/
Fix a bug caused by an unsigned subtraction of bigger value from smaller value in bitmap implementation.
Fix wrong calculation of unaligned leading bits in bitmap implementation.
1248
6622 d 16 h
jermar
/kernel/trunk/
Add some @file doxygen comments and improve already existing comments.
1221
6627 d 10 h
decky
/kernel/trunk/
printf-related and other code cleanup
1200
6632 d 17 h
jermar
/kernel/trunk/
Add bitmap ADT.
1196
6633 d 20 h
cejka
/kernel/trunk/
Printf ported back from uspace to kernel.
Printf calls changed to match new conventions.
1177
6637 d 20 h
jermar
/kernel/trunk/generic/
Modify B+tree node key width to be 64-bit wide on all platforms.
1164
6640 d 16 h
jermar
/kernel/trunk/generic/
Switch B+tree node allocation from malloc() to a dedicated slab - btree_node_slab.
1154
6644 d 15 h
jermar
/kernel/trunk/generic/src/adt/
Fix critical bug in hash table initialization.
Only half of the table was actually allocated and initialized.
1150
6646 d 0 h
jermar
/kernel/trunk/generic/
Rename btree_node_left_sibling() to btree_leaf_node_left_neighbour()
and btree_node_right_sibling() to btree_leaf_node_right_neighbour()
as the left and right neighbours of a node needn't be its siblings.
1148
6646 d 11 h
jermar
/kernel/trunk/generic/src/
s/B+-tree/B+tree/
1147
6646 d 11 h
jermar
/kernel/trunk/generic/
Deploy B+tree in address space area management.
Change as_remap() to check for conflicts with other address space areas only when the area in question grows.
1144
6648 d 14 h
jermar
/kernel/trunk/
Completed B+-tree support.
Enable btree_remove().
Reorder some static functions and group them together.
Fix order of nodes in the leaf_head list.
1142
6648 d 22 h
jermar
/kernel/trunk/
Update B+-tree code.
The code is there, btree_remove() has not been tested yet.
(Fixes, if any, are to come later today.)
1140
6650 d 14 h
jermar
/kernel/trunk/generic/
Change B+-tree from 2-3-4 tree to 2-3-4-5 tree by adding space for the fourth key.
This should make key removal easier.
1136
6654 d 14 h
jermar
/kernel/trunk/generic/src/adt/
Try to avoid splitting full B+-tree nodes by trying left or right rotation first.
(This improved memory consumption of this algorithm by some 40% - meassured on 101-item set).
1134
6655 d 17 h
jermar
/kernel/trunk/generic/src/adt/
Change B+-tree to:
- store lesser keys in a key's left subtree
- propagate the bigger of medians (if there are two medians) when splitting a node