Implementation of name mangling algorithm.
This has to ensure that file names are unique among all files in an iso directory. Current implementation can be improved by using a hash table to keep the names, instead of iterate over all children. An alternative method, keeping children sorted all the time, thus allowing binary search, has been considered but discarded. Current implementation support up to 9,999,999 equal files per directory.
This commit is contained in:
@ -13,6 +13,8 @@ extern inline int div_up(int n, int div);
|
||||
|
||||
extern inline int round_up(int n, int mul);
|
||||
|
||||
int int_pow(int base, int power);
|
||||
|
||||
/**
|
||||
* Convert a given string from any input charset to ASCII
|
||||
*
|
||||
|
Reference in New Issue
Block a user