| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | X86DisassemblerTables.cpp | 604 if (decision.instructionIDs[index] != decision.instructionIDs[0]) in getDecisionType() 608 (decision.instructionIDs[index] != decision.instructionIDs[0xc0])) in getDecisionType() 612 (decision.instructionIDs[index] != decision.instructionIDs[0x00])) in getDecisionType() 616 (decision.instructionIDs[index] != decision.instructionIDs[index&0xf8])) in getDecisionType() 620 (decision.instructionIDs[index] != decision.instructionIDs[index&0x38])) in getDecisionType() 670 ModRMDecisionType dt = getDecisionType(decision); in emitModRMDecision() 760 ModRMDecisionType dt = getDecisionType(decision); in emitOpcodeDecision() 1031 if (decision.instructionIDs[index] == uid) in setTableFields() 1034 if (decision.instructionIDs[index] != 0) { in setTableFields() 1059 decision.instructionIDs[index] = uid; in setTableFields() [all …]
|
| H A D | X86DisassemblerTables.h | 94 ModRMDecision &decision) const; 122 OpcodeDecision &decision) const; 156 ContextDecision &decision, const char* name) const; 225 void setTableFields(ModRMDecision &decision,
|
| /llvm-project-15.0.7/llvm/test/Transforms/LICM/ |
| H A D | 2007-09-17-PromoteValue.ll | 4 ; icmp eq %struct.decision* null, null condition. 6 %struct.decision = type { i8, %struct.decision* } 13 %tmp3.i = icmp eq %struct.decision* null, null ; <i1> [#uses=1] 17 %tmp1.i = getelementptr %struct.decision, %struct.decision* null, i32 0, i32 0 ; <i8*> [#uses=1]
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/quality/ |
| H A D | README.md | 4 …decision forest** is a collection of many decision trees. A **decision tree** is a full binary tre… 6 In order to predict the relevance of a code completion item, we traverse each of the decision trees… 48 The file `forest.json` defines the decision forest. It is a json list of **DecisionTree**.
|
| /llvm-project-15.0.7/lldb/docs/use/ |
| H A D | python.rst | 282 The idea is as follows. The binary search algorithm has two main decision 283 points: the decision to follow the right branch; and, the decision to follow 284 the left branch. We will set a breakpoint at each of these decision points, and 287 function. Each time one of these decision breakpoints is hit, the script will 288 compare the actual decision with the decision the front of the path variable 289 says should be made (the first character of the path). If the actual decision 292 being hit. But if the decision differs from what the path says it should be, 294 user sitting at the first point where a wrong decision is being made. 324 decision to go right: 357 our decision (recall that we are at the breakpoint for the decision to go [all …]
|
| /llvm-project-15.0.7/llvm/docs/HistoricalNotes/ |
| H A D | 2001-05-19-ExceptionResponse.txt | 16 Hrm... I guess that is an implementation decision. It can either be 42 Like everything, we can probably defer a final decision until later. :)
|
| H A D | 2001-06-01-GCCOptimizations.txt | 60 Wouldn't it be nice if there were a obvious decision to be made? :)
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/Disassembler/ |
| H A D | X86Disassembler.cpp | 1033 const ContextDecision *decision; in getInstructionIDWithAttrMask() local 1036 decision = &ONEBYTE_SYM; in getInstructionIDWithAttrMask() 1039 decision = &TWOBYTE_SYM; in getInstructionIDWithAttrMask() 1042 decision = &THREEBYTE38_SYM; in getInstructionIDWithAttrMask() 1045 decision = &THREEBYTE3A_SYM; in getInstructionIDWithAttrMask() 1048 decision = &XOP8_MAP_SYM; in getInstructionIDWithAttrMask() 1051 decision = &XOP9_MAP_SYM; in getInstructionIDWithAttrMask() 1054 decision = &XOPA_MAP_SYM; in getInstructionIDWithAttrMask() 1057 decision = &THREEDNOW_MAP_SYM; in getInstructionIDWithAttrMask() 1060 decision = &MAP5_SYM; in getInstructionIDWithAttrMask() [all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/SampleProfile/ |
| H A D | csspgo-use-preinliner.ll | 1 …Test for CSSPGO's sample loader inlining to make sure it can use llvm-profgen preinliner's decision 14 ; `[main:3 @ _Z5funcAi]` does not have preinline decision, so it's up for loader inliner to decided. 16 ; `[main:3 @ _Z5funcAi:1 @ _Z8funcLeafi]` is inlined according to preinline decision. 19 … `[_Z5funcBi:1 @ _Z8funcLeafi]` becomes synthetic context, so preinline decision is ignored and we…
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | DevelopmentModeInlineAdvisor.cpp | 62 The first value must always correspond to the decision.)"));
|
| /llvm-project-15.0.7/mlir/test/Transforms/ |
| H A D | test-legalize-target-materialization-no-uses.mlir | 13 // materialization decision is taken, the i64 replacement of the first type
|
| /llvm-project-15.0.7/lld/test/ELF/ |
| H A D | ppc64-toc-restore-recursive-call.s | 12 # The decision to use a plt-stub for the recursive call is not one I feel
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/cppcoreguidelines/ |
| H A D | virtual-class-destructor.rst | 19 private destructors. There, the decision whether to make them private and
|
| /llvm-project-15.0.7/mlir/docs/Dialects/ |
| H A D | TOSA.md | 9 describes the decision process for how TOSA expresses operators in 75 the decision was to keep these ops in the dialect (as opposed to deferring
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | GitRepositoryPolicy.md | 4 not covered in this document is most likely a case-by-case decision. In these
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | tls-addr-non-leaf-function.ll | 15 ; MachineFrameInfo that the function contained calls. This affected the decision
|
| H A D | patchable-function-entry-ibt.ll | 74 ;; Another basic block has ENDBR, but it doesn't affect our decision to not create .Lpatch0
|
| H A D | distancemap.mir | 8 # ADD instruction, and a different commute decision is made.
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AArch64/ |
| H A D | patchable-function-entry-bti.ll | 59 ;; Other basic blocks have BTI, but they don't affect our decision to not create .Lpatch0
|
| /llvm-project-15.0.7/llvm/docs/GlobalISel/ |
| H A D | index.rst | 100 whether a given function is supported by GlobalISel or not. The decision would
|
| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | tailcall-speculatable-callee.ll | 4 ; The tests check the behavior of the tail call decision when the callee is speculatable.
|
| /llvm-project-15.0.7/llvm/test/Transforms/Inline/ML/ |
| H A D | bounds-checks-rewards.ll | 6 ; factor, we penalize the 'bad' decision.
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/AArch64/ |
| H A D | thresholdO3-cost-model.ll | 5 ; Changes to the cost model may cause that decision to differ.
|
| /llvm-project-15.0.7/llvm/test/ThinLTO/X86/ |
| H A D | devirt_check.ll | 4 ; that the devirtualization decision was correct and trap or fallback if not.
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Mips/ |
| H A D | fp64a.ll | 4 ; this to the top 32-bits of the even register) but we have to make the decision
|