forked from Imagelibrary/littlefs
Compare commits
6 Commits
fix-superb
...
v2.8.2
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
3513ff1afc | ||
|
|
8a22bd6e67 | ||
|
|
9b82db72d8 | ||
|
|
99b84ee3db | ||
|
|
e91a29d2b5 | ||
|
|
10bcff1af8 |
2
.github/workflows/release.yml
vendored
2
.github/workflows/release.yml
vendored
@@ -112,7 +112,7 @@ jobs:
|
||||
table[$i,$j]=$c_camel
|
||||
((j+=1))
|
||||
|
||||
for s in code stack struct
|
||||
for s in code stack structs
|
||||
do
|
||||
f=sizes/thumb${c:+-$c}.$s.csv
|
||||
[ -e $f ] && table[$i,$j]=$( \
|
||||
|
||||
@@ -59,7 +59,7 @@ This leaves us with three major requirements for an embedded filesystem.
|
||||
RAM to temporarily store filesystem metadata.
|
||||
|
||||
For ROM, this means we need to keep our design simple and reuse code paths
|
||||
were possible. For RAM we have a stronger requirement, all RAM usage is
|
||||
where possible. For RAM we have a stronger requirement, all RAM usage is
|
||||
bounded. This means RAM usage does not grow as the filesystem changes in
|
||||
size or number of files. This creates a unique challenge as even presumably
|
||||
simple operations, such as traversing the filesystem, become surprisingly
|
||||
@@ -626,7 +626,7 @@ log₂_n_ pointers that skip to different preceding elements of the
|
||||
skip-list.
|
||||
|
||||
The name comes from heavy use of the [CTZ instruction][wikipedia-ctz], which
|
||||
lets us calculate the power-of-two factors efficiently. For a give block _n_,
|
||||
lets us calculate the power-of-two factors efficiently. For a given block _n_,
|
||||
that block contains ctz(_n_)+1 pointers.
|
||||
|
||||
```
|
||||
|
||||
Reference in New Issue
Block a user