Searched full:log (Results 1 – 6 of 6) sorted by relevance
| /littlefs-2.7.6/scripts/ |
| D | readmdir.py | 165 self.log = self.pair[0].log
180 self.log = []
202 self.log = self.all_.copy()
215 for tag in self.log:
232 return bool(self.log)
256 for tag in reversed(self.log):
304 self._dump_tags(self.log, f=f, truncate=truncate)
341 elif args.log:
361 parser.add_argument('-l', '--log', action='store_true',
362 help="Show tags in log.")
[all …]
|
| D | readtree.py | 109 if not any([args.no_truncate, args.tags, args.log, args.all]) else ""))
134 if args.log:
177 parser.add_argument('-l', '--log', action='store_true',
178 help="Show tags in log.")
180 help="Show all tags in log, included tags in corrupted commits.")
|
| /littlefs-2.7.6/ |
| D | DESIGN.md | 111 data, instead the entire storage is used for a circular log which is
113 changes, while reading requires traversing the log to reconstruct a file.
132 process of cleaning up outdated data from the end of the log, I've yet to
145 block based filesystem and add a bounded log where we note every change
189 reach the root of our filesystem, which is often stored in a very small log.
217 storing data changes directly in a log. They even disassociate the storage
293 storage, in the worst case a small log costs 4x the size of the original data.
358 append more entries, we can simply append the entries to the log. Because
443 more space is available, but because we have small logs, overflowing a log
448 increasing the size of the log and dealing with the scalability issues
[all …]
|
| D | lfs_util.h | 45 #include <logging/log.h>
|
| D | SPEC.md | 43 On top of this, each metadata block behaves as an appendable log, containing a
44 variable number of commits. Commits can be appended to the metadata log in
|
| D | .travis.yml | 351 CHANGES=$(git log --oneline $PREV.. --grep='^Merge' --invert-grep)
|
