Home
last modified time | relevance | path

Searched refs:tag (Results 1 – 6 of 6) sorted by relevance

/littlefs-3.5.0-3.4.0/scripts/
Dreadmdir.py32 self.tag = args[0]
49 self.tag = (type << 20) | (id << 10) | size
55 return not bool(self.tag & 0x80000000)
59 return not bool(self.tag & 0x40000000)
63 return bool(self.tag & 0x20000000)
67 return not bool(self.tag & 0x10000000)
71 return (self.tag & 0x7ff00000) >> 20
75 return (self.tag & 0x70000000) >> 20
79 return (self.tag & 0x7ff00000) >> 20
83 return (self.tag & 0x000ffc00) >> 10
[all …]
Dreadtree.py89 for tag in mdir.tags:
90 if tag.is_('dir'):
92 npath = tag.data.decode('utf8')
93 dirstruct = mdir[Tag('dirstruct', tag.id, 0)]
113 tag = Tag(struct.unpack('<I', gstate[0:4].ljust(4, b'\xff'))[0])
115 if tag.size or not tag.isvalid:
116 print(" orphans >=%d" % max(tag.size, 1))
117 if tag.type:
119 blocks[0], blocks[1], tag.id))
/littlefs-3.5.0-3.4.0/
Dlfs.c320 static inline bool lfs_tag_isvalid(lfs_tag_t tag) { in lfs_tag_isvalid() argument
321 return !(tag & 0x80000000); in lfs_tag_isvalid()
324 static inline bool lfs_tag_isdelete(lfs_tag_t tag) { in lfs_tag_isdelete() argument
325 return ((int32_t)(tag << 22) >> 22) == -1; in lfs_tag_isdelete()
328 static inline uint16_t lfs_tag_type1(lfs_tag_t tag) { in lfs_tag_type1() argument
329 return (tag & 0x70000000) >> 20; in lfs_tag_type1()
332 static inline uint16_t lfs_tag_type3(lfs_tag_t tag) { in lfs_tag_type3() argument
333 return (tag & 0x7ff00000) >> 20; in lfs_tag_type3()
336 static inline uint8_t lfs_tag_chunk(lfs_tag_t tag) { in lfs_tag_chunk() argument
337 return (tag & 0x0ff00000) >> 20; in lfs_tag_chunk()
[all …]
DSPEC.md102 Entries themselves are stored as a 32-bit tag followed by a variable length
106 this without duplicating the space for each tag, neighboring entries have their
115 | tag ~A |---> xor -> tag A | tag ~A |---> xor -> 0xffffffff
121 | tag AxB |---> xor -> tag B | tag AxB |---> xor -> tag A
127 | tag BxC |---> xor -> tag C | tag BxC |---> xor -> tag B
130 | | | | tag C
136 One last thing to note before we get into the details around tag encoding. Each
137 tag contains a valid bit used to indicate if the tag and containing commit is
138 valid. This valid bit is the first bit found in the tag and the commit and can
146 .-| revision count | tag ~A | \
[all …]
Dlfs.h382 uint32_t tag; member
DREADME.md208 Individual files contain the following tag instead of the full license text.