| /freebsd/contrib/mandoc/ |
| H A D | mandoc_escape.3 | 22 .Nd parse roff escape sequences
76 Some escape sequences allow arbitrary characters
93 escape sequences that require in-place expansion, in particular
117 in turn contain other escape sequences,
127 need to skip escape sequences while scanning the input, see the files
149 to purge escape sequences from text.
157 For escape sequences taking an argument, the pointer
162 For escape sequences not taking an argument,
175 For sequences taking an argument, the function
220 Such ASCII character escape sequences can be rendered using the function
[all …]
|
| H A D | mchars_alloc.3 | 106 escape sequences.
129 escape sequences.
161 escape sequences.
194 escape sequences.
|
| /freebsd/sys/contrib/openzfs/module/zstd/lib/compress/ |
| H A D | zstd_ldm.h | 31 * Generates the sequences using the long distance match finder.
32 * Generates long range matching sequences in `sequences`, which parse a prefix
33 * of the source. `sequences` must be large enough to store every sequence,
40 * sequences.
43 ldmState_t* ldms, RawSeqStore_t* sequences,
49 * Compresses a block using the predefined sequences, along with a secondary
51 * secondary block compressor, and those sequences are interspersed with the
52 * predefined sequences. Returns the length of the last literals.
53 * Updates `rawSeqStore.pos` to indicate how many sequences have been consumed.
59 * sequences can be any size, and may be longer than the block. In the case that
[all …]
|
| H A D | zstd_compress_sequences.c | 297 SeqDef const* sequences, size_t nbSeq, int longOffsets) in ZSTD_encodeSequences_body() argument
315 BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]); in ZSTD_encodeSequences_body()
317 BIT_addBits(&blockStream, sequences[nbSeq-1].mlBase, ML_bits[mlCodeTable[nbSeq-1]]); in ZSTD_encodeSequences_body()
323 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, extraBits); in ZSTD_encodeSequences_body()
326 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase >> extraBits, in ZSTD_encodeSequences_body()
329 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, ofCodeTable[nbSeq-1]); in ZSTD_encodeSequences_body()
342 (unsigned)sequences[n].litLength, in ZSTD_encodeSequences_body()
343 (unsigned)sequences[n].mlBase + MINMATCH, in ZSTD_encodeSequences_body()
344 (unsigned)sequences[n].offBase); in ZSTD_encodeSequences_body()
353 BIT_addBits(&blockStream, sequences[n].litLength, llBits); in ZSTD_encodeSequences_body()
[all …]
|
| H A D | zstd_compress_superblock.c | 131 const SeqDef* sequences, size_t nbSeqs, in ZSTD_seqDecompressedSize() argument
138 const ZSTD_SequenceLength seqLen = ZSTD_getSequenceLength(seqStore, sequences+n); in ZSTD_seqDecompressedSize()
142 DEBUGLOG(5, "ZSTD_seqDecompressedSize: %u sequences from %p: %u literals + %u matchlength", in ZSTD_seqDecompressedSize()
143 (unsigned)nbSeqs, (const void*)sequences, in ZSTD_seqDecompressedSize()
154 * Compresses sequences section for a sub-block.
158 * We set entropyWritten=1 when we succeed in compressing the sequences.
160 * @return : compressed size of sequences section of a sub-block
166 const SeqDef* sequences, size_t nbSeq, in ZSTD_compressSubBlock_sequences() argument
181 /* Sequences Header */ in ZSTD_compressSubBlock_sequences()
217 sequences, nbSeq, in ZSTD_compressSubBlock_sequences()
[all …]
|
| H A D | zstd_ldm.c | 528 ldmState_t* ldmState, RawSeqStore_t* sequences, in ZSTD_ldm_generateSequences() argument
547 assert(sequences->pos <= sequences->size); in ZSTD_ldm_generateSequences()
548 assert(sequences->size <= sequences->capacity); in ZSTD_ldm_generateSequences()
549 for (chunk = 0; chunk < nbChunks && sequences->size < sequences->capacity; ++chunk) { in ZSTD_ldm_generateSequences()
556 size_t const prevSize = sequences->size; in ZSTD_ldm_generateSequences()
578 * be split into two sequences. This condition holds when using in ZSTD_ldm_generateSequences()
583 /* 3. Generate the sequences for the chunk, and get newLeftoverSize. */ in ZSTD_ldm_generateSequences()
585 ldmState, sequences, params, chunkStart, chunkSize); in ZSTD_ldm_generateSequences()
593 if (prevSize < sequences->size) { in ZSTD_ldm_generateSequences()
594 sequences->seq[prevSize].litLength += (U32)leftoverSize; in ZSTD_ldm_generateSequences()
[all …]
|
| H A D | zstd_compress_internal.h | 84 * Sequences *
101 SeqDef* sequences; /* ptr to end of sequences */ member
124 …* Returns the ZSTD_SequenceLength for the given sequences. It handles the decoding of long sequenc…
207 rawSeq* seq; /* The start of the sequences */
211 size_t size; /* The number of sequences. <= capacity. */
402 * @postBlockSplitter executes split analysis after sequences are produced,
404 * @preBlockSplitter_level splits before knowing sequences,
496 SeqStore_t seqStore; /* sequences storage ptrs */
498 rawSeq* ldmSequences; /* Storage for the ldm output sequences */
500 RawSeqStore_t externSeqStore; /* Mutable reference to external sequences */
[all …]
|
| /freebsd/sys/contrib/zstd/lib/compress/ |
| H A D | zstd_ldm.h | 30 * Generates the sequences using the long distance match finder.
31 * Generates long range matching sequences in `sequences`, which parse a prefix
32 * of the source. `sequences` must be large enough to store every sequence,
39 * sequences.
42 ldmState_t* ldms, RawSeqStore_t* sequences,
48 * Compresses a block using the predefined sequences, along with a secondary
50 * secondary block compressor, and those sequences are interspersed with the
51 * predefined sequences. Returns the length of the last literals.
52 * Updates `rawSeqStore.pos` to indicate how many sequences have been consumed.
58 * sequences can be any size, and may be longer than the block. In the case that
[all …]
|
| H A D | zstd_compress_sequences.c | 296 SeqDef const* sequences, size_t nbSeq, int longOffsets) in ZSTD_encodeSequences_body() argument
314 BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]); in ZSTD_encodeSequences_body()
316 BIT_addBits(&blockStream, sequences[nbSeq-1].mlBase, ML_bits[mlCodeTable[nbSeq-1]]); in ZSTD_encodeSequences_body()
322 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, extraBits); in ZSTD_encodeSequences_body()
325 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase >> extraBits, in ZSTD_encodeSequences_body()
328 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, ofCodeTable[nbSeq-1]); in ZSTD_encodeSequences_body()
341 (unsigned)sequences[n].litLength, in ZSTD_encodeSequences_body()
342 (unsigned)sequences[n].mlBase + MINMATCH, in ZSTD_encodeSequences_body()
343 (unsigned)sequences[n].offBase); in ZSTD_encodeSequences_body()
352 BIT_addBits(&blockStream, sequences[n].litLength, llBits); in ZSTD_encodeSequences_body()
[all …]
|
| H A D | zstd_compress_superblock.c | 130 const SeqDef* sequences, size_t nbSeqs, in ZSTD_seqDecompressedSize() argument
137 const ZSTD_SequenceLength seqLen = ZSTD_getSequenceLength(seqStore, sequences+n); in ZSTD_seqDecompressedSize()
141 DEBUGLOG(5, "ZSTD_seqDecompressedSize: %u sequences from %p: %u literals + %u matchlength", in ZSTD_seqDecompressedSize()
142 (unsigned)nbSeqs, (const void*)sequences, in ZSTD_seqDecompressedSize()
153 * Compresses sequences section for a sub-block.
157 * We set entropyWritten=1 when we succeed in compressing the sequences.
159 * @return : compressed size of sequences section of a sub-block
165 const SeqDef* sequences, size_t nbSeq, in ZSTD_compressSubBlock_sequences() argument
180 /* Sequences Header */ in ZSTD_compressSubBlock_sequences()
216 sequences, nbSeq, in ZSTD_compressSubBlock_sequences()
[all …]
|
| H A D | zstd_ldm.c | 527 ldmState_t* ldmState, RawSeqStore_t* sequences, in ZSTD_ldm_generateSequences() argument
546 assert(sequences->pos <= sequences->size); in ZSTD_ldm_generateSequences()
547 assert(sequences->size <= sequences->capacity); in ZSTD_ldm_generateSequences()
548 for (chunk = 0; chunk < nbChunks && sequences->size < sequences->capacity; ++chunk) { in ZSTD_ldm_generateSequences()
555 size_t const prevSize = sequences->size; in ZSTD_ldm_generateSequences()
577 * be split into two sequences. This condition holds when using in ZSTD_ldm_generateSequences()
582 /* 3. Generate the sequences for the chunk, and get newLeftoverSize. */ in ZSTD_ldm_generateSequences()
584 ldmState, sequences, params, chunkStart, chunkSize); in ZSTD_ldm_generateSequences()
592 if (prevSize < sequences->size) { in ZSTD_ldm_generateSequences()
593 sequences->seq[prevSize].litLength += (U32)leftoverSize; in ZSTD_ldm_generateSequences()
[all …]
|
| H A D | zstd_compress_internal.h | 83 * Sequences *
100 SeqDef* sequences; /* ptr to end of sequences */ member
123 …* Returns the ZSTD_SequenceLength for the given sequences. It handles the decoding of long sequenc…
206 rawSeq* seq; /* The start of the sequences */
210 size_t size; /* The number of sequences. <= capacity. */
401 * @postBlockSplitter executes split analysis after sequences are produced,
403 * @preBlockSplitter_level splits before knowing sequences,
495 SeqStore_t seqStore; /* sequences storage ptrs */
497 rawSeq* ldmSequences; /* Storage for the ldm output sequences */
499 RawSeqStore_t externSeqStore; /* Mutable reference to external sequences */
[all …]
|
| /freebsd/contrib/libyaml/tests/ |
| H A D | test-reader.c | 35 {"5 bytes sequences are not allowed", "\xf8\x88\x80\x80\x80!", 0},
36 {"6 bytes sequences are not allowed", "\xfc\x84\x80\x80\x80\x80!", 0},
66 {"32 first bytes of 2-byte sequences {0xc0-0xdf}",
69 {"16 first bytes of 3-byte sequences {0xe0-0xef}",
71 …{"8 first bytes of 4-byte sequences {0xf0-0xf7}", "\xf0 |\xf1 |\xf2 |\xf3 |\xf4 |\xf5 |\xf6 |\xf7 …
72 {"4 first bytes of 5-byte sequences {0xf8-0xfb}", "\xf8 |\xf9 |\xfa |\xfb !", 0},
73 {"2 first bytes of 6-byte sequences {0xfc-0xfd}", "\xfc |\xfd !", 0},
75 {"sequences with last byte missing {u-0}",
77 {"sequences with last byte missing {u-...FF}",
82 {"overlong sequences {u-2f}",
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Mips/ |
| H A D | MipsAnalyzeImmediate.h | 34 /// AddInstr - Add I to all instruction sequences in SeqLs.
37 /// GetInstSeqLsADDiu - Get instruction sequences which end with an ADDiu to
41 /// GetInstSeqLsORi - Get instrutcion sequences which end with an ORi to
45 /// GetInstSeqLsSLL - Get instruction sequences which end with a SLL to
49 /// GetInstSeqLs - Get instruction sequences to load immediate Imm.
|
| /freebsd/usr.bin/col/ |
| H A D | col.1 | 69 Force unknown control sequences to be passed through unchanged.
72 will filter out any control sequences from the input other than those
80 understands both the escape sequences of the form escape-digit
86 The control sequences for carriage motion and their ASCII values
123 All unrecognized control characters and escape sequences are
|
| /freebsd/usr.bin/env/ |
| H A D | env.1 | 135 option recognizes some special character escape sequences and
243 sequences which represent some action to take.
244 The character escape sequences are in backslash notation.
289 The sequences for <single-quote> and backslash are the only sequences
291 The other sequences have no special meaning inside a single-quoted
293 All escape sequences are recognized inside of a double-quoted string.
312 Those values will not be checked for any of the escape sequences as
|
| /freebsd/sys/dev/isci/scil/ |
| H A D | sati_translator_sequence.h | 61 * various sequences of commands that occur in this translator.
74 // SCSI Primary Command (SPC) sequences.
102 //Log Sense Sequences
108 // SCSI Block Command (SBC) sequences.
135 // SCSI Task Requests sequences
303 * This field is utilized for sequences requiring data translation.
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/ |
| H A D | SequenceToOffsetTable.h | 1 //===-- SequenceToOffsetTable.h - Compress similar sequences ----*- C++ -*-===//
9 // SequenceToOffsetTable can be used to emit a number of sequences as one big
39 /// SequenceToOffsetTable - Collect a number of terminated sequences of T.
40 /// Compute the layout of a table that contains all the sequences, possibly by
59 // Keep sequences ordered according to SeqLess so suffixes are easy to find.
63 // Sequences added so far, with suffixes removed.
|
| /freebsd/contrib/googletest/googletest/include/gtest/ |
| H A D | gtest-param-test.h | 206 // Range() returns generators providing sequences of values in a range.
216 // * The generated sequences never include end. For example, Range(1, 5)
225 // Elements in the resulting sequences will also have that type.
226 // * Condition start < end must be satisfied in order for resulting sequences
245 // - returns a generator producing sequences with elements from
248 // - returns a generator producing sequences with elements from
251 // - returns a generator producing sequences with elements from
320 // - returns a generator producing sequences with elements v1, v2, ..., vN.
344 // - returns a generator producing sequences with elements {false, true}.
362 // Combine() allows the user to combine two or more sequences to produce
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64A53Fix835769.cpp | 9 // It works around it by inserting a nop instruction in code sequences that
200 // List of terminating instructions in matching sequences in runOnBasicBlock()
201 std::vector<MachineInstr*> Sequences; in runOnBasicBlock() local
223 Sequences.push_back(CurrInstr); in runOnBasicBlock()
231 LLVM_DEBUG(dbgs() << "Scan complete, " << Sequences.size() in runOnBasicBlock()
234 // Then update the basic block, inserting nops between the detected sequences. in runOnBasicBlock()
235 for (auto &MI : Sequences) { in runOnBasicBlock()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | edit_distance.h | 11 /// sequences, with each element of each sequence being analogous to a character
24 /// Determine the edit distance between two sequences.
30 /// \param Map A Functor to apply to each item of the sequences before
43 /// the given sequences into the other. If zero, the sequences are identical.
|
| /freebsd/sys/contrib/dev/athk/ |
| H A D | dfs_pri_detector.c | 297 list_add(&new_ps->head, &pde->sequences); in pseq_handler_create_sequences()
302 /* check new ts and add to all matching existing sequences */
308 list_for_each_entry_safe(ps, ps2, &pde->sequences, head) { in pseq_handler_add_to_existing_seqs()
340 if (list_empty(&pde->sequences)) in pseq_handler_check_detection()
343 list_for_each_entry(ps, &pde->sequences, head) { in pseq_handler_check_detection()
357 /* free pulse queue and sequences list and give objects back to pools */
362 list_for_each_entry_safe(ps, ps0, &pde->sequences, head) { in pri_detector_reset()
428 INIT_LIST_HEAD(&de->sequences); in pri_detector_init()
|
| H A D | dfs_pri_detector.h | 53 * @sequences: list_head holding potential pulse sequences
69 struct list_head sequences; member
|
| /freebsd/usr.bin/seq/ |
| H A D | seq.1 | 38 .Nd print sequences of numbers
97 can contain character escape sequences in backslash notation as
108 can contain character escape sequences in backslash notation as
119 can contain character escape sequences in backslash notation as
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CloneDetection.cpp | 37 // If both sequences reside in different declarations, they can never contain in contains()
93 Sequences.push_back(StmtSequence(D->getBody(), D)); in analyzeCodeBody()
107 /// Returns true if and only if all sequences in \p OtherGroup are
111 // We have less sequences in the current group than we have in the other, in containsGroup()
332 /// Returns true if both sequences are clones of each other.
350 std::vector<CloneDetector::CloneGroup> &Sequences) { in constrain() argument
354 for (CloneDetector::CloneGroup &Group : Sequences) { in constrain()
405 // Sequences is the output parameter, so we copy our result into it. in constrain()
406 Sequences = Result; in constrain()
410 std::vector<CloneDetector::CloneGroup> &Sequences) { in constrain() argument
[all …]
|