| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86InstrFoldTables.cpp | 173 // Index 0, folded load and store, no alignment requirement. in X86MemUnfoldTable() 181 // Index 1, folded load in X86MemUnfoldTable() 185 // Index 2, folded load in X86MemUnfoldTable() 189 // Index 3, folded load in X86MemUnfoldTable() 193 // Index 4, folded load in X86MemUnfoldTable() 198 // Index 1, folded broadcast in X86MemUnfoldTable() 202 // Index 2, folded broadcast in X86MemUnfoldTable() 206 // Index 3, folded broadcast in X86MemUnfoldTable() 210 // Index 4, folded broadcast in X86MemUnfoldTable()
|
| H A D | X86InstrXOP.td | 20 Sched<[SchedWriteVecALU.XMM.Folded, SchedWriteVecALU.XMM.ReadAfterFold]>; 51 Sched<[sched.Folded, sched.ReadAfterFold]>; 62 Sched<[sched.Folded, sched.ReadAfterFold]>; 73 Sched<[sched.Folded, sched.ReadAfterFold]>; 108 XOP, VVVV, REX_W, Sched<[sched.Folded, sched.ReadAfterFold]>; 115 XOP, Sched<[sched.Folded, sched.ReadAfterFold]>; 153 XOP, Sched<[sched.Folded, sched.ReadAfterFold]>; 184 VR128:$src3))]>, XOP, VVVV, Sched<[sched.Folded, sched.ReadAfterFold]>; 264 XOP, VVVV, Sched<[sched.Folded, sched.ReadAfterFold]>; 299 XOP, VVVV, REX_W, Sched<[sched.Folded, sche [all...] |
| H A D | X86InstrFMA.td | 20 // For the memory variant the folded operand must be in 3. Thus, 53 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 73 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 95 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 195 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 215 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 237 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 283 []>, Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 407 Sched<[sched.Folded, sched.ReadAfterFold, sched.ReadAfterFold]>; 414 Sched<[sched.Folded, sched.ReadAfterFold, [all …]
|
| H A D | X86Schedule.td | 12 // Instructions with folded loads need to read the memory operand immediately, 26 // Instructions with both a load and a store folded are modeled as a folded 42 // variants: With and without a folded load. 44 // with a folded load. 46 // The SchedWrite to use when a load is folded into the instruction. 47 SchedWrite Folded; 49 // until the folded load has completed. 59 let Folded = !cast<SchedWrite>(NAME#"Ld"); 73 def : WriteRes<SchedRW.Folded, []>; [all...] |
| H A D | X86InstrSSE.td | 38 Sched<[sched.Folded, sched.ReadAfterFold]>; 61 Sched<[sched.Folded, sched.ReadAfterFold]>; 85 Sched<[sched.Folded, sched.ReadAfterFold]>; 107 Sched<[sched.Folded, sched.ReadAfterFold]>; 670 Sched<[SchedWriteFShuffle.XMM.Folded, SchedWriteFShuffle.XMM.ReadAfterFold]>; 678 Sched<[SchedWriteFShuffle.XMM.Folded, SchedWriteFShuffle.XMM.ReadAfterFold]>; 868 Sched<[sched.Folded]>; 883 Sched<[sched.Folded]>; 898 Sched<[sched.Folded, sched.ReadAfterFold]>; 1049 Sched<[sched.Folded]>; [all …]
|
| H A D | X86InstrMMX.td | 48 Sched<[sched.Folded, sched.ReadAfterFold]>; 64 Sched<[sched.Folded, sched.ReadAfterFold]>; 84 Sched<[sched.Folded]>; 103 Sched<[sched.Folded, sched.ReadAfterFold]>; 120 Sched<[sched.Folded, sched.ReadAfterFold]>; 131 Sched<[sched.Folded]>; 144 Sched<[WriteCvtI2PS.Folded]>; 484 Sched<[SchedWriteShuffle.MMX.Folded]>; 535 Sched<[WriteVecInsert.Folded, WriteVecInsert.ReadAfterFold]>;
|
| H A D | X86InstrConditionalCompare.td | 59 let SchedRW = [WriteALU.Folded] in { 68 let SchedRW = [WriteALU.Folded, WriteALU.ReadAfterFold] in { 126 let SchedRW = [WriteALU.Folded] in { 132 let SchedRW = [WriteALU.Folded, WriteALU.ReadAfterFold] in {
|
| H A D | X86InstrAVX512.td | 394 Sched<[sched.Folded, sched.ReadAfterFold]>; 664 Sched<[SchedWriteFShuffle.XMM.Folded, SchedWriteFShuffle.XMM.ReadAfterFold]>; 1291 Sched<[SchedWriteShuffle.YMM.Folded]>, 1307 Sched<[SchedWriteShuffle.YMM.Folded]>, 1627 EVEX, VVVV, AVX5128IBase, Sched<[sched.Folded, sched.ReadAfterFold]>; 1643 Sched<[sched.Folded, sched.ReadAfterFold]>; 1748 EVEX, VVVV, AVX5128IBase, Sched<[sched.Folded, sched.ReadAfterFold]>; 1762 Sched<[sched.Folded, sched.ReadAfterFold]>; 1843 Sched<[sched.Folded, sched.ReadAfterFold]>; 1849 Sched<[sched.Folded, sched.ReadAfterFold]>; [all …]
|
| H A D | X86Instr3DNow.td | 36 []>, Sched<[sched.Folded, sched.ReadAfterFold]>; 48 []>, Sched<[sched.Folded, sched.ReadAfterFold]>;
|
| H A D | X86InstrCMovSetCC.td | 23 let SchedRW = [WriteCMOV.Folded, WriteCMOV.ReadAfterFold] in 49 let SchedRW = [WriteCMOV.Folded, WriteCMOV.ReadAfterFold] in { 90 // Conditional moves with folded loads with operands swapped and conditions
|
| H A D | X86InstrUtils.td | 1028 Sched<[WriteALU.Folded, WriteALU.ReadAfterFold]> { 1052 let SchedRW = [WriteADC.Folded, WriteADC.ReadAfterFold, 1123 let SchedRW = [WriteALU.Folded, WriteALU.ReadAfterFold]; 1137 Sched<[WriteALU.Folded, ReadDefault, ReadDefault, ReadDefault, 1165 Sched<[WriteADC.Folded, WriteADC.ReadAfterFold]>; 1194 Sched<[WriteALU.Folded]>, DefEFLAGS; 1198 Sched<[WriteALU.Folded, WriteALU.ReadAfterFold]>, NDD<1>; 1204 Sched<[WriteALU.Folded, WriteALU.ReadAfterFold]>, DefEFLAGS, NDD<1>; 1224 Sched<[WriteADC.Folded, WriteADC.ReadAfterFold]>, DefEFLAGS, UseEFLAGS, NDD<1>; 1250 : BinOpMI8<m, binop_args, t, f, (outs)>, Sched<[WriteALU.Folded]>, DefEFLAGS; [all …]
|
| H A D | X86ScheduleSLM.td | 57 // Many SchedWrites are defined in pairs with and without a folded load. 58 // Instructions with folded loads are usually micro-fused, so they only appear 61 // folded loads. 75 def : WriteRes<SchedRW.Folded, !listconcat([SLM_MEC_RSV], ExePorts)> { 82 // A folded store needs a cycle on MEC_RSV for the store data (using the same uop),
|
| /freebsd/sys/kgssapi/krb5/ |
| H A D | kcrypto.c | 186 uint8_t *folded; in krb5_derive_key() local 194 folded = malloc(ec->ec_blocklen, M_GSSAPI, M_WAITOK); in krb5_derive_key() 195 krb5_n_fold(folded, ec->ec_blocklen, constant, constantlen); in krb5_derive_key() 205 for (i = 0, p = bytes, q = folded; i < randomlen; in krb5_derive_key() 216 free(folded, M_GSSAPI); in krb5_derive_key()
|
| /freebsd/contrib/libyaml/examples/ |
| H A D | strings.yaml | 5 folded: > 6 This entire block of text will be the value of 'folded', but this
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | DJB.cpp | 41 // The case-folded output should always be a valid unicode character, so use in toUTF8() 79 StringRef Folded = toUTF8(C, Storage); in caseFoldingDjbHash() local 80 H = djbHash(Folded, H); in caseFoldingDjbHash()
|
| /freebsd/contrib/sendmail/editmap/ |
| H A D | editmap.8 | 79 are folded to lower case. 85 The value is never case folded.
|
| /freebsd/contrib/bmake/unit-tests/ |
| H A D | dollar.exp | 41 For some reason, multiple dollars are folded into one. 47 For some reason, multiple dollars are folded into one.
|
| H A D | dollar.mk | 73 $C 'For some reason, multiple dollars are folded into one.' 78 $C 'For some reason, multiple dollars are folded into one.'
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/Coverage/ |
| H A D | CoverageMapping.h | 361 bool Folded; member 367 FalseExecutionCount(0), Folded(false), in CountedRegion() 373 FalseExecutionCount(FalseExecutionCount), Folded(false), in CountedRegion() 450 BoolVector Folded; member 456 TVPairMap &&IndependencePairs, BoolVector &&Folded, in MCDCRecord() 460 Folded(std::move(Folded)), PosToID(std::move(PosToID)), in MCDCRecord() 468 bool isCondFolded(unsigned Condition) const { return Folded[Condition]; } in isCondFolded() 509 unsigned Folded = 0; in getPercentCovered() local 513 Folded++; in getPercentCovered() 518 unsigned Total = getNumConditions() - Folded; in getPercentCovered() [all …]
|
| /freebsd/contrib/sendmail/makemap/ |
| H A D | makemap.8 | 141 are folded to lower case. 147 The value is never case folded.
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-cov/ |
| H A D | CoverageSummaryInfo.cpp | 22 // Skip folded branches. in sumBranches() 23 if (BR.Folded) in sumBranches()
|
| /freebsd/contrib/llvm-project/lld/MachO/ |
| H A D | UnwindInfoSection.cpp | 89 // Adjacent entries with the same encoding can be folded to great 436 // unwind info can't be folded if it's using this encoding since both in canFoldEncoding() 487 // entries that can be folded into a single entry and written to ... in finalize() 500 // address for the functions with the folded entries, which in turn would in finalize() 505 // folded anyway. in finalize() 527 // Count frequencies of the folded encodings in finalize() 555 // Split folded encodings into pages, where each page is limited by ... in finalize()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | X86FoldTablesEmitter.cpp | 183 // performs a load OR a store, and their #i'th operand is folded. 186 // a broadcast load and their #i'th operand is folded. 400 // Instructions with one output in their memory form use the memory folded in operator ()() 426 // Only one operand can be folded. in operator ()() 557 // If the instruction writes to the folded operand, it will appear as in updateTables() 559 // memory form instruction. If the instruction reads from the folded in updateTables()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | FastISel.h | 285 /// folded into the same machineinstr. For example we could have: 292 /// (and any other folded instructions) because it is between A and C. 487 /// Check if \c Add is an add that can be safely folded into \c GEP. 489 /// \c Add can be folded into \c GEP if:
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
| H A D | ConstantHoisting.h | 14 // cost. If the constant can be folded into the instruction (the cost is 19 // If the cost is more than TCC_BASIC, then the integer constant can't be folded
|