Lines Matching refs:it

43 stream-based nature it is not indexed.
76 …ed, more specifically `jenkins_hashlittle2()` with the first 32bit integer it returns as higher 32…
86 If any kind of corruption is noticed by a writer it should immediately rotate
88 original file, but it should be left around so that as little data as possible
91 If any kind of corruption is noticed by a reader it should try hard to handle
93 to as much data around it as possible.
95 A reader should verify all offsets and other data as it reads it. This includes
97 trying to read it via a memory map.
143 The Header struct defines, well, you guessed it, the file header:
186 the machine it is running on it should immediately rotate the file and start a
192 When a writer opens a file it shall initialize the **boot_id** to the current
197 the actual file size on disk is smaller than the reported value it shall
200 Header, it shall immediately rotate the file and start a new one.
228 when it is a good time to rotate the journal file, because hash collisions
296 set to STATE_OFFLINE. After a file has been rotated it should be set to
298 STATE_OFFLINE it should immediately rotate the file and start a new one,
328 This weak synchronization model means that it is crucial that readers verify
329 the structural integrity of the file as they read it and handle invalid
335 might become consistent later on. Payload OTOH requires less scrutiny, as it
336 should only be linked up (and hence visible to readers) after it was
338 file systems it is a good idea to verify the payload hashes when reading, in
345 generated. Note that this is not used as a transaction scheme (it doesn't
405 in the **file_id** field of the file header. If the flag is not set it is the
407 it makes the format more robust against attackers that want to trigger hash
540 number of fields should be pretty static as it depends only on developers'
561 it. An Entry Array with **next_entry_array_offset** set to 0 is the last in the
575 itself, an ENTRY_ARRAY object is only needed if it is referenced by more than
606 calculating the HMAC for the objects it reads. Each time a tag object is
649 When listing all possible values a certain field can take it is sufficient to
650 look up the FIELD object and follow the chain of links to all DATA it includes.
656 it should be appended and added to the data hash table. When a data field's data
663 above). Before the file is closed a tag should be written too, to seal it off.
692 And that's all there is to it.