| File: | build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc |
| Warning: | line 714, column 10 Excessive padding in 'struct (anonymous namespace)::MatchEntry' (2 padding bytes, where 0 is optimal). Optimal fields order: Opcode, Mnemonic, ConvertFn, RequiredFeatures, Classes, consider reordering the fields or adding explicit padding members |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | /*===- TableGen'erated file -------------------------------------*- C++ -*-===*\ |
| 2 | |* *| |
| 3 | |* Assembly Matcher Source Fragment *| |
| 4 | |* *| |
| 5 | |* Automatically generated file, do not edit! *| |
| 6 | |* *| |
| 7 | \*===----------------------------------------------------------------------===*/ |
| 8 | |
| 9 | |
| 10 | #ifdef GET_ASSEMBLER_HEADER |
| 11 | #undef GET_ASSEMBLER_HEADER |
| 12 | // This should be included into the middle of the declaration of |
| 13 | // your subclasses implementation of MCTargetAsmParser. |
| 14 | uint64_t ComputeAvailableFeatures(const FeatureBitset& FB) const; |
| 15 | void convertToMCInst(unsigned Kind, MCInst &Inst, unsigned Opcode, |
| 16 | const OperandVector &Operands); |
| 17 | void convertToMapAndConstraints(unsigned Kind, |
| 18 | const OperandVector &Operands) override; |
| 19 | unsigned MatchInstructionImpl(const OperandVector &Operands, |
| 20 | MCInst &Inst, |
| 21 | uint64_t &ErrorInfo, |
| 22 | bool matchingInlineAsm, |
| 23 | unsigned VariantID = 0); |
| 24 | #endif // GET_ASSEMBLER_HEADER_INFO |
| 25 | |
| 26 | |
| 27 | #ifdef GET_OPERAND_DIAGNOSTIC_TYPES |
| 28 | #undef GET_OPERAND_DIAGNOSTIC_TYPES |
| 29 | |
| 30 | #endif // GET_OPERAND_DIAGNOSTIC_TYPES |
| 31 | |
| 32 | |
| 33 | #ifdef GET_REGISTER_MATCHER |
| 34 | #undef GET_REGISTER_MATCHER |
| 35 | |
| 36 | // Flags for subtarget features that participate in instruction matching. |
| 37 | enum SubtargetFeatureFlag : uint8_t { |
| 38 | Feature_None = 0 |
| 39 | }; |
| 40 | |
| 41 | static unsigned MatchRegisterName(StringRef Name) { |
| 42 | switch (Name.size()) { |
| 43 | default: break; |
| 44 | case 2: // 20 strings to match. |
| 45 | switch (Name[0]) { |
| 46 | default: break; |
| 47 | case 'r': // 10 strings to match. |
| 48 | switch (Name[1]) { |
| 49 | default: break; |
| 50 | case '0': // 1 string to match. |
| 51 | return 1; // "r0" |
| 52 | case '1': // 1 string to match. |
| 53 | return 2; // "r1" |
| 54 | case '2': // 1 string to match. |
| 55 | return 3; // "r2" |
| 56 | case '3': // 1 string to match. |
| 57 | return 4; // "r3" |
| 58 | case '4': // 1 string to match. |
| 59 | return 5; // "r4" |
| 60 | case '5': // 1 string to match. |
| 61 | return 6; // "r5" |
| 62 | case '6': // 1 string to match. |
| 63 | return 7; // "r6" |
| 64 | case '7': // 1 string to match. |
| 65 | return 8; // "r7" |
| 66 | case '8': // 1 string to match. |
| 67 | return 9; // "r8" |
| 68 | case '9': // 1 string to match. |
| 69 | return 10; // "r9" |
| 70 | } |
| 71 | break; |
| 72 | case 'w': // 10 strings to match. |
| 73 | switch (Name[1]) { |
| 74 | default: break; |
| 75 | case '0': // 1 string to match. |
| 76 | return 13; // "w0" |
| 77 | case '1': // 1 string to match. |
| 78 | return 14; // "w1" |
| 79 | case '2': // 1 string to match. |
| 80 | return 15; // "w2" |
| 81 | case '3': // 1 string to match. |
| 82 | return 16; // "w3" |
| 83 | case '4': // 1 string to match. |
| 84 | return 17; // "w4" |
| 85 | case '5': // 1 string to match. |
| 86 | return 18; // "w5" |
| 87 | case '6': // 1 string to match. |
| 88 | return 19; // "w6" |
| 89 | case '7': // 1 string to match. |
| 90 | return 20; // "w7" |
| 91 | case '8': // 1 string to match. |
| 92 | return 21; // "w8" |
| 93 | case '9': // 1 string to match. |
| 94 | return 22; // "w9" |
| 95 | } |
| 96 | break; |
| 97 | } |
| 98 | break; |
| 99 | case 3: // 4 strings to match. |
| 100 | switch (Name[0]) { |
| 101 | default: break; |
| 102 | case 'r': // 2 strings to match. |
| 103 | if (Name[1] != '1') |
| 104 | break; |
| 105 | switch (Name[2]) { |
| 106 | default: break; |
| 107 | case '0': // 1 string to match. |
| 108 | return 11; // "r10" |
| 109 | case '1': // 1 string to match. |
| 110 | return 12; // "r11" |
| 111 | } |
| 112 | break; |
| 113 | case 'w': // 2 strings to match. |
| 114 | if (Name[1] != '1') |
| 115 | break; |
| 116 | switch (Name[2]) { |
| 117 | default: break; |
| 118 | case '0': // 1 string to match. |
| 119 | return 23; // "w10" |
| 120 | case '1': // 1 string to match. |
| 121 | return 24; // "w11" |
| 122 | } |
| 123 | break; |
| 124 | } |
| 125 | break; |
| 126 | } |
| 127 | return 0; |
| 128 | } |
| 129 | |
| 130 | #endif // GET_REGISTER_MATCHER |
| 131 | |
| 132 | |
| 133 | #ifdef GET_SUBTARGET_FEATURE_NAME |
| 134 | #undef GET_SUBTARGET_FEATURE_NAME |
| 135 | |
| 136 | // User-level names for subtarget features that participate in |
| 137 | // instruction matching. |
| 138 | static const char *getSubtargetFeatureName(uint64_t Val) { |
| 139 | return "(unknown)"; |
| 140 | } |
| 141 | |
| 142 | #endif // GET_SUBTARGET_FEATURE_NAME |
| 143 | |
| 144 | |
| 145 | #ifdef GET_MATCHER_IMPLEMENTATION |
| 146 | #undef GET_MATCHER_IMPLEMENTATION |
| 147 | |
| 148 | enum { |
| 149 | Tie0_0_0, |
| 150 | Tie0_0_3, |
| 151 | Tie0_12_12, |
| 152 | }; |
| 153 | |
| 154 | const char TiedAsmOperandTable[][3] = { |
| 155 | /* Tie0_0_0 */ { 0, 0, 0 }, |
| 156 | /* Tie0_0_3 */ { 0, 0, 3 }, |
| 157 | /* Tie0_12_12 */ { 0, 12, 12 }, |
| 158 | }; |
| 159 | |
| 160 | namespace { |
| 161 | enum OperatorConversionKind { |
| 162 | CVT_Done, |
| 163 | CVT_Reg, |
| 164 | CVT_Tied, |
| 165 | CVT_95_Reg, |
| 166 | CVT_95_addImmOperands, |
| 167 | CVT_imm_95_0, |
| 168 | CVT_NUM_CONVERTERS |
| 169 | }; |
| 170 | |
| 171 | enum InstructionConversionKind { |
| 172 | Convert__Reg1_0__Reg1_2, |
| 173 | Convert__Reg1_0__Imm1_2, |
| 174 | Convert__Reg1_0__Tie0_0_0__Reg1_3, |
| 175 | Convert__Reg1_0__Tie0_0_0__Imm1_3, |
| 176 | Convert__Reg1_0__Tie0_0_3, |
| 177 | Convert__Reg1_0__Tie0_0_0__Reg1_4, |
| 178 | Convert__Reg1_0__Tie0_0_0__Imm1_4, |
| 179 | Convert__Reg1_0__Tie0_0_0__Reg1_5, |
| 180 | Convert__Reg1_0__Tie0_0_0__Imm1_5, |
| 181 | Convert__Reg1_0__Reg1_8__Imm1_9, |
| 182 | Convert__Reg1_10__Reg1_6__Imm1_7, |
| 183 | Convert__Imm1_1, |
| 184 | Convert_NoOperands, |
| 185 | Convert__Reg1_1__Reg1_3__Imm1_5, |
| 186 | Convert__Reg1_1__Imm1_3__Imm1_5, |
| 187 | Convert__Reg1_1__Reg1_4__Imm1_6, |
| 188 | Convert__Reg1_1__Imm1_4__Imm1_6, |
| 189 | Convert__Reg1_1__Reg1_5__Imm1_7, |
| 190 | Convert__Reg1_1__Imm1_5__Imm1_7, |
| 191 | Convert__Reg1_1__Imm1_2__Imm1_3, |
| 192 | Convert__Reg1_1__Reg1_2__Imm1_3, |
| 193 | Convert__Reg1_12__Reg1_7__Imm1_8__Tie0_12_12, |
| 194 | Convert__imm_95_0__Reg1_9, |
| 195 | Convert__imm_95_0__Imm1_9, |
| 196 | CVT_NUM_SIGNATURES |
| 197 | }; |
| 198 | |
| 199 | } // end anonymous namespace |
| 200 | |
| 201 | static const uint8_t ConversionTable[CVT_NUM_SIGNATURES][9] = { |
| 202 | // Convert__Reg1_0__Reg1_2 |
| 203 | { CVT_95_Reg, 0, CVT_95_Reg, 2, CVT_Done }, |
| 204 | // Convert__Reg1_0__Imm1_2 |
| 205 | { CVT_95_Reg, 0, CVT_95_addImmOperands, 2, CVT_Done }, |
| 206 | // Convert__Reg1_0__Tie0_0_0__Reg1_3 |
| 207 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_0, CVT_95_Reg, 3, CVT_Done }, |
| 208 | // Convert__Reg1_0__Tie0_0_0__Imm1_3 |
| 209 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_0, CVT_95_addImmOperands, 3, CVT_Done }, |
| 210 | // Convert__Reg1_0__Tie0_0_3 |
| 211 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_3, CVT_Done }, |
| 212 | // Convert__Reg1_0__Tie0_0_0__Reg1_4 |
| 213 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_0, CVT_95_Reg, 4, CVT_Done }, |
| 214 | // Convert__Reg1_0__Tie0_0_0__Imm1_4 |
| 215 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_0, CVT_95_addImmOperands, 4, CVT_Done }, |
| 216 | // Convert__Reg1_0__Tie0_0_0__Reg1_5 |
| 217 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_0, CVT_95_Reg, 5, CVT_Done }, |
| 218 | // Convert__Reg1_0__Tie0_0_0__Imm1_5 |
| 219 | { CVT_95_Reg, 0, CVT_Tied, Tie0_0_0, CVT_95_addImmOperands, 5, CVT_Done }, |
| 220 | // Convert__Reg1_0__Reg1_8__Imm1_9 |
| 221 | { CVT_95_Reg, 0, CVT_95_Reg, 8, CVT_95_addImmOperands, 9, CVT_Done }, |
| 222 | // Convert__Reg1_10__Reg1_6__Imm1_7 |
| 223 | { CVT_95_Reg, 10, CVT_95_Reg, 6, CVT_95_addImmOperands, 7, CVT_Done }, |
| 224 | // Convert__Imm1_1 |
| 225 | { CVT_95_addImmOperands, 1, CVT_Done }, |
| 226 | // Convert_NoOperands |
| 227 | { CVT_Done }, |
| 228 | // Convert__Reg1_1__Reg1_3__Imm1_5 |
| 229 | { CVT_95_Reg, 1, CVT_95_Reg, 3, CVT_95_addImmOperands, 5, CVT_Done }, |
| 230 | // Convert__Reg1_1__Imm1_3__Imm1_5 |
| 231 | { CVT_95_Reg, 1, CVT_95_addImmOperands, 3, CVT_95_addImmOperands, 5, CVT_Done }, |
| 232 | // Convert__Reg1_1__Reg1_4__Imm1_6 |
| 233 | { CVT_95_Reg, 1, CVT_95_Reg, 4, CVT_95_addImmOperands, 6, CVT_Done }, |
| 234 | // Convert__Reg1_1__Imm1_4__Imm1_6 |
| 235 | { CVT_95_Reg, 1, CVT_95_addImmOperands, 4, CVT_95_addImmOperands, 6, CVT_Done }, |
| 236 | // Convert__Reg1_1__Reg1_5__Imm1_7 |
| 237 | { CVT_95_Reg, 1, CVT_95_Reg, 5, CVT_95_addImmOperands, 7, CVT_Done }, |
| 238 | // Convert__Reg1_1__Imm1_5__Imm1_7 |
| 239 | { CVT_95_Reg, 1, CVT_95_addImmOperands, 5, CVT_95_addImmOperands, 7, CVT_Done }, |
| 240 | // Convert__Reg1_1__Imm1_2__Imm1_3 |
| 241 | { CVT_95_Reg, 1, CVT_95_addImmOperands, 2, CVT_95_addImmOperands, 3, CVT_Done }, |
| 242 | // Convert__Reg1_1__Reg1_2__Imm1_3 |
| 243 | { CVT_95_Reg, 1, CVT_95_Reg, 2, CVT_95_addImmOperands, 3, CVT_Done }, |
| 244 | // Convert__Reg1_12__Reg1_7__Imm1_8__Tie0_12_12 |
| 245 | { CVT_95_Reg, 12, CVT_95_Reg, 7, CVT_95_addImmOperands, 8, CVT_Tied, Tie0_12_12, CVT_Done }, |
| 246 | // Convert__imm_95_0__Reg1_9 |
| 247 | { CVT_imm_95_0, 0, CVT_95_Reg, 9, CVT_Done }, |
| 248 | // Convert__imm_95_0__Imm1_9 |
| 249 | { CVT_imm_95_0, 0, CVT_95_addImmOperands, 9, CVT_Done }, |
| 250 | }; |
| 251 | |
| 252 | void BPFAsmParser:: |
| 253 | convertToMCInst(unsigned Kind, MCInst &Inst, unsigned Opcode, |
| 254 | const OperandVector &Operands) { |
| 255 | assert(Kind < CVT_NUM_SIGNATURES && "Invalid signature!")(static_cast <bool> (Kind < CVT_NUM_SIGNATURES && "Invalid signature!") ? void (0) : __assert_fail ("Kind < CVT_NUM_SIGNATURES && \"Invalid signature!\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 255, __extension__ __PRETTY_FUNCTION__)); |
| 256 | const uint8_t *Converter = ConversionTable[Kind]; |
| 257 | unsigned OpIdx; |
| 258 | Inst.setOpcode(Opcode); |
| 259 | for (const uint8_t *p = Converter; *p; p+= 2) { |
| 260 | OpIdx = *(p + 1); |
| 261 | switch (*p) { |
| 262 | default: llvm_unreachable("invalid conversion entry!")::llvm::llvm_unreachable_internal("invalid conversion entry!" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 262); |
| 263 | case CVT_Reg: |
| 264 | static_cast<BPFOperand&>(*Operands[OpIdx]).addRegOperands(Inst, 1); |
| 265 | break; |
| 266 | case CVT_Tied: { |
| 267 | assert(OpIdx < (size_t)(std::end(TiedAsmOperandTable) -(static_cast <bool> (OpIdx < (size_t)(std::end(TiedAsmOperandTable ) - std::begin(TiedAsmOperandTable)) && "Tied operand not found" ) ? void (0) : __assert_fail ("OpIdx < (size_t)(std::end(TiedAsmOperandTable) - std::begin(TiedAsmOperandTable)) && \"Tied operand not found\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 269, __extension__ __PRETTY_FUNCTION__)) |
| 268 | std::begin(TiedAsmOperandTable)) &&(static_cast <bool> (OpIdx < (size_t)(std::end(TiedAsmOperandTable ) - std::begin(TiedAsmOperandTable)) && "Tied operand not found" ) ? void (0) : __assert_fail ("OpIdx < (size_t)(std::end(TiedAsmOperandTable) - std::begin(TiedAsmOperandTable)) && \"Tied operand not found\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 269, __extension__ __PRETTY_FUNCTION__)) |
| 269 | "Tied operand not found")(static_cast <bool> (OpIdx < (size_t)(std::end(TiedAsmOperandTable ) - std::begin(TiedAsmOperandTable)) && "Tied operand not found" ) ? void (0) : __assert_fail ("OpIdx < (size_t)(std::end(TiedAsmOperandTable) - std::begin(TiedAsmOperandTable)) && \"Tied operand not found\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 269, __extension__ __PRETTY_FUNCTION__)); |
| 270 | unsigned TiedResOpnd = TiedAsmOperandTable[OpIdx][0]; |
| 271 | Inst.addOperand(Inst.getOperand(TiedResOpnd)); |
| 272 | break; |
| 273 | } |
| 274 | case CVT_95_Reg: |
| 275 | static_cast<BPFOperand&>(*Operands[OpIdx]).addRegOperands(Inst, 1); |
| 276 | break; |
| 277 | case CVT_95_addImmOperands: |
| 278 | static_cast<BPFOperand&>(*Operands[OpIdx]).addImmOperands(Inst, 1); |
| 279 | break; |
| 280 | case CVT_imm_95_0: |
| 281 | Inst.addOperand(MCOperand::createImm(0)); |
| 282 | break; |
| 283 | } |
| 284 | } |
| 285 | } |
| 286 | |
| 287 | void BPFAsmParser:: |
| 288 | convertToMapAndConstraints(unsigned Kind, |
| 289 | const OperandVector &Operands) { |
| 290 | assert(Kind < CVT_NUM_SIGNATURES && "Invalid signature!")(static_cast <bool> (Kind < CVT_NUM_SIGNATURES && "Invalid signature!") ? void (0) : __assert_fail ("Kind < CVT_NUM_SIGNATURES && \"Invalid signature!\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 290, __extension__ __PRETTY_FUNCTION__)); |
| 291 | unsigned NumMCOperands = 0; |
| 292 | const uint8_t *Converter = ConversionTable[Kind]; |
| 293 | for (const uint8_t *p = Converter; *p; p+= 2) { |
| 294 | switch (*p) { |
| 295 | default: llvm_unreachable("invalid conversion entry!")::llvm::llvm_unreachable_internal("invalid conversion entry!" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 295); |
| 296 | case CVT_Reg: |
| 297 | Operands[*(p + 1)]->setMCOperandNum(NumMCOperands); |
| 298 | Operands[*(p + 1)]->setConstraint("r"); |
| 299 | ++NumMCOperands; |
| 300 | break; |
| 301 | case CVT_Tied: |
| 302 | ++NumMCOperands; |
| 303 | break; |
| 304 | case CVT_95_Reg: |
| 305 | Operands[*(p + 1)]->setMCOperandNum(NumMCOperands); |
| 306 | Operands[*(p + 1)]->setConstraint("r"); |
| 307 | NumMCOperands += 1; |
| 308 | break; |
| 309 | case CVT_95_addImmOperands: |
| 310 | Operands[*(p + 1)]->setMCOperandNum(NumMCOperands); |
| 311 | Operands[*(p + 1)]->setConstraint("m"); |
| 312 | NumMCOperands += 1; |
| 313 | break; |
| 314 | case CVT_imm_95_0: |
| 315 | Operands[*(p + 1)]->setMCOperandNum(NumMCOperands); |
| 316 | Operands[*(p + 1)]->setConstraint(""); |
| 317 | ++NumMCOperands; |
| 318 | break; |
| 319 | } |
| 320 | } |
| 321 | } |
| 322 | |
| 323 | namespace { |
| 324 | |
| 325 | /// MatchClassKind - The kinds of classes which participate in |
| 326 | /// instruction matching. |
| 327 | enum MatchClassKind { |
| 328 | InvalidMatchClass = 0, |
| 329 | OptionalMatchClass = 1, |
| 330 | MCK__EXCLAIM_, // '!' |
| 331 | MCK__38_, // '&' |
| 332 | MCK__40_, // '(' |
| 333 | MCK__41_, // ')' |
| 334 | MCK__STAR_, // '*' |
| 335 | MCK__43_, // '+' |
| 336 | MCK__MINUS_, // '-' |
| 337 | MCK__47_, // '/' |
| 338 | MCK__LT_, // '<' |
| 339 | MCK__61_, // '=' |
| 340 | MCK__GT_, // '>' |
| 341 | MCK__91_, // '[' |
| 342 | MCK__93_, // ']' |
| 343 | MCK__94_, // '^' |
| 344 | MCK_be16, // 'be16' |
| 345 | MCK_be32, // 'be32' |
| 346 | MCK_be64, // 'be64' |
| 347 | MCK_call, // 'call' |
| 348 | MCK_callx, // 'callx' |
| 349 | MCK_exit, // 'exit' |
| 350 | MCK_goto, // 'goto' |
| 351 | MCK_if, // 'if' |
| 352 | MCK_ld_95_pseudo, // 'ld_pseudo' |
| 353 | MCK_le16, // 'le16' |
| 354 | MCK_le32, // 'le32' |
| 355 | MCK_le64, // 'le64' |
| 356 | MCK_lea, // 'lea' |
| 357 | MCK_ll, // 'll' |
| 358 | MCK_lock, // 'lock' |
| 359 | MCK_nop, // 'nop' |
| 360 | MCK_s, // 's' |
| 361 | MCK_skb, // 'skb' |
| 362 | MCK_u16, // 'u16' |
| 363 | MCK_u32, // 'u32' |
| 364 | MCK_u64, // 'u64' |
| 365 | MCK_u8, // 'u8' |
| 366 | MCK__124_, // '|' |
| 367 | MCK_LAST_TOKEN = MCK__124_, |
| 368 | MCK_R0, // register class 'R0' |
| 369 | MCK_GPR, // register class 'GPR' |
| 370 | MCK_GPR32, // register class 'GPR32' |
| 371 | MCK_LAST_REGISTER = MCK_GPR32, |
| 372 | MCK_Imm, // user defined class 'ImmAsmOperand' |
| 373 | NumMatchClassKinds |
| 374 | }; |
| 375 | |
| 376 | } |
| 377 | |
| 378 | static unsigned getDiagKindFromRegisterClass(MatchClassKind RegisterClass) { |
| 379 | return MCTargetAsmParser::Match_InvalidOperand; |
| 380 | } |
| 381 | |
| 382 | static MatchClassKind matchTokenString(StringRef Name) { |
| 383 | switch (Name.size()) { |
| 384 | default: break; |
| 385 | case 1: // 16 strings to match. |
| 386 | switch (Name[0]) { |
| 387 | default: break; |
| 388 | case '!': // 1 string to match. |
| 389 | return MCK__EXCLAIM_; // "!" |
| 390 | case '&': // 1 string to match. |
| 391 | return MCK__38_; // "&" |
| 392 | case '(': // 1 string to match. |
| 393 | return MCK__40_; // "(" |
| 394 | case ')': // 1 string to match. |
| 395 | return MCK__41_; // ")" |
| 396 | case '*': // 1 string to match. |
| 397 | return MCK__STAR_; // "*" |
| 398 | case '+': // 1 string to match. |
| 399 | return MCK__43_; // "+" |
| 400 | case '-': // 1 string to match. |
| 401 | return MCK__MINUS_; // "-" |
| 402 | case '/': // 1 string to match. |
| 403 | return MCK__47_; // "/" |
| 404 | case '<': // 1 string to match. |
| 405 | return MCK__LT_; // "<" |
| 406 | case '=': // 1 string to match. |
| 407 | return MCK__61_; // "=" |
| 408 | case '>': // 1 string to match. |
| 409 | return MCK__GT_; // ">" |
| 410 | case '[': // 1 string to match. |
| 411 | return MCK__91_; // "[" |
| 412 | case ']': // 1 string to match. |
| 413 | return MCK__93_; // "]" |
| 414 | case '^': // 1 string to match. |
| 415 | return MCK__94_; // "^" |
| 416 | case 's': // 1 string to match. |
| 417 | return MCK_s; // "s" |
| 418 | case '|': // 1 string to match. |
| 419 | return MCK__124_; // "|" |
| 420 | } |
| 421 | break; |
| 422 | case 2: // 3 strings to match. |
| 423 | switch (Name[0]) { |
| 424 | default: break; |
| 425 | case 'i': // 1 string to match. |
| 426 | if (Name[1] != 'f') |
| 427 | break; |
| 428 | return MCK_if; // "if" |
| 429 | case 'l': // 1 string to match. |
| 430 | if (Name[1] != 'l') |
| 431 | break; |
| 432 | return MCK_ll; // "ll" |
| 433 | case 'u': // 1 string to match. |
| 434 | if (Name[1] != '8') |
| 435 | break; |
| 436 | return MCK_u8; // "u8" |
| 437 | } |
| 438 | break; |
| 439 | case 3: // 6 strings to match. |
| 440 | switch (Name[0]) { |
| 441 | default: break; |
| 442 | case 'l': // 1 string to match. |
| 443 | if (memcmp(Name.data()+1, "ea", 2) != 0) |
| 444 | break; |
| 445 | return MCK_lea; // "lea" |
| 446 | case 'n': // 1 string to match. |
| 447 | if (memcmp(Name.data()+1, "op", 2) != 0) |
| 448 | break; |
| 449 | return MCK_nop; // "nop" |
| 450 | case 's': // 1 string to match. |
| 451 | if (memcmp(Name.data()+1, "kb", 2) != 0) |
| 452 | break; |
| 453 | return MCK_skb; // "skb" |
| 454 | case 'u': // 3 strings to match. |
| 455 | switch (Name[1]) { |
| 456 | default: break; |
| 457 | case '1': // 1 string to match. |
| 458 | if (Name[2] != '6') |
| 459 | break; |
| 460 | return MCK_u16; // "u16" |
| 461 | case '3': // 1 string to match. |
| 462 | if (Name[2] != '2') |
| 463 | break; |
| 464 | return MCK_u32; // "u32" |
| 465 | case '6': // 1 string to match. |
| 466 | if (Name[2] != '4') |
| 467 | break; |
| 468 | return MCK_u64; // "u64" |
| 469 | } |
| 470 | break; |
| 471 | } |
| 472 | break; |
| 473 | case 4: // 10 strings to match. |
| 474 | switch (Name[0]) { |
| 475 | default: break; |
| 476 | case 'b': // 3 strings to match. |
| 477 | if (Name[1] != 'e') |
| 478 | break; |
| 479 | switch (Name[2]) { |
| 480 | default: break; |
| 481 | case '1': // 1 string to match. |
| 482 | if (Name[3] != '6') |
| 483 | break; |
| 484 | return MCK_be16; // "be16" |
| 485 | case '3': // 1 string to match. |
| 486 | if (Name[3] != '2') |
| 487 | break; |
| 488 | return MCK_be32; // "be32" |
| 489 | case '6': // 1 string to match. |
| 490 | if (Name[3] != '4') |
| 491 | break; |
| 492 | return MCK_be64; // "be64" |
| 493 | } |
| 494 | break; |
| 495 | case 'c': // 1 string to match. |
| 496 | if (memcmp(Name.data()+1, "all", 3) != 0) |
| 497 | break; |
| 498 | return MCK_call; // "call" |
| 499 | case 'e': // 1 string to match. |
| 500 | if (memcmp(Name.data()+1, "xit", 3) != 0) |
| 501 | break; |
| 502 | return MCK_exit; // "exit" |
| 503 | case 'g': // 1 string to match. |
| 504 | if (memcmp(Name.data()+1, "oto", 3) != 0) |
| 505 | break; |
| 506 | return MCK_goto; // "goto" |
| 507 | case 'l': // 4 strings to match. |
| 508 | switch (Name[1]) { |
| 509 | default: break; |
| 510 | case 'e': // 3 strings to match. |
| 511 | switch (Name[2]) { |
| 512 | default: break; |
| 513 | case '1': // 1 string to match. |
| 514 | if (Name[3] != '6') |
| 515 | break; |
| 516 | return MCK_le16; // "le16" |
| 517 | case '3': // 1 string to match. |
| 518 | if (Name[3] != '2') |
| 519 | break; |
| 520 | return MCK_le32; // "le32" |
| 521 | case '6': // 1 string to match. |
| 522 | if (Name[3] != '4') |
| 523 | break; |
| 524 | return MCK_le64; // "le64" |
| 525 | } |
| 526 | break; |
| 527 | case 'o': // 1 string to match. |
| 528 | if (memcmp(Name.data()+2, "ck", 2) != 0) |
| 529 | break; |
| 530 | return MCK_lock; // "lock" |
| 531 | } |
| 532 | break; |
| 533 | } |
| 534 | break; |
| 535 | case 5: // 1 string to match. |
| 536 | if (memcmp(Name.data()+0, "callx", 5) != 0) |
| 537 | break; |
| 538 | return MCK_callx; // "callx" |
| 539 | case 9: // 1 string to match. |
| 540 | if (memcmp(Name.data()+0, "ld_pseudo", 9) != 0) |
| 541 | break; |
| 542 | return MCK_ld_95_pseudo; // "ld_pseudo" |
| 543 | } |
| 544 | return InvalidMatchClass; |
| 545 | } |
| 546 | |
| 547 | /// isSubclass - Compute whether \p A is a subclass of \p B. |
| 548 | static bool isSubclass(MatchClassKind A, MatchClassKind B) { |
| 549 | if (A == B) |
| 550 | return true; |
| 551 | |
| 552 | switch (A) { |
| 553 | default: |
| 554 | return false; |
| 555 | |
| 556 | case MCK_R0: |
| 557 | return B == MCK_GPR; |
| 558 | } |
| 559 | } |
| 560 | |
| 561 | static unsigned validateOperandClass(MCParsedAsmOperand &GOp, MatchClassKind Kind) { |
| 562 | BPFOperand &Operand = (BPFOperand&)GOp; |
| 563 | if (Kind == InvalidMatchClass) |
| 564 | return MCTargetAsmParser::Match_InvalidOperand; |
| 565 | |
| 566 | if (Operand.isToken() && Kind <= MCK_LAST_TOKEN) |
| 567 | return isSubclass(matchTokenString(Operand.getToken()), Kind) ? |
| 568 | MCTargetAsmParser::Match_Success : |
| 569 | MCTargetAsmParser::Match_InvalidOperand; |
| 570 | |
| 571 | switch (Kind) { |
| 572 | default: break; |
| 573 | // 'Imm' class |
| 574 | case MCK_Imm: |
| 575 | if (Operand.isImm()) |
| 576 | return MCTargetAsmParser::Match_Success; |
| 577 | break; |
| 578 | } // end switch (Kind) |
| 579 | |
| 580 | if (Operand.isReg()) { |
| 581 | MatchClassKind OpKind; |
| 582 | switch (Operand.getReg()) { |
| 583 | default: OpKind = InvalidMatchClass; break; |
| 584 | case BPF::W0: OpKind = MCK_GPR32; break; |
| 585 | case BPF::W1: OpKind = MCK_GPR32; break; |
| 586 | case BPF::W2: OpKind = MCK_GPR32; break; |
| 587 | case BPF::W3: OpKind = MCK_GPR32; break; |
| 588 | case BPF::W4: OpKind = MCK_GPR32; break; |
| 589 | case BPF::W5: OpKind = MCK_GPR32; break; |
| 590 | case BPF::W6: OpKind = MCK_GPR32; break; |
| 591 | case BPF::W7: OpKind = MCK_GPR32; break; |
| 592 | case BPF::W8: OpKind = MCK_GPR32; break; |
| 593 | case BPF::W9: OpKind = MCK_GPR32; break; |
| 594 | case BPF::W10: OpKind = MCK_GPR32; break; |
| 595 | case BPF::W11: OpKind = MCK_GPR32; break; |
| 596 | case BPF::R0: OpKind = MCK_R0; break; |
| 597 | case BPF::R1: OpKind = MCK_GPR; break; |
| 598 | case BPF::R2: OpKind = MCK_GPR; break; |
| 599 | case BPF::R3: OpKind = MCK_GPR; break; |
| 600 | case BPF::R4: OpKind = MCK_GPR; break; |
| 601 | case BPF::R5: OpKind = MCK_GPR; break; |
| 602 | case BPF::R6: OpKind = MCK_GPR; break; |
| 603 | case BPF::R7: OpKind = MCK_GPR; break; |
| 604 | case BPF::R8: OpKind = MCK_GPR; break; |
| 605 | case BPF::R9: OpKind = MCK_GPR; break; |
| 606 | case BPF::R10: OpKind = MCK_GPR; break; |
| 607 | case BPF::R11: OpKind = MCK_GPR; break; |
| 608 | } |
| 609 | return isSubclass(OpKind, Kind) ? (unsigned)MCTargetAsmParser::Match_Success : |
| 610 | getDiagKindFromRegisterClass(Kind); |
| 611 | } |
| 612 | |
| 613 | if (Kind > MCK_LAST_TOKEN && Kind <= MCK_LAST_REGISTER) |
| 614 | return getDiagKindFromRegisterClass(Kind); |
| 615 | |
| 616 | return MCTargetAsmParser::Match_InvalidOperand; |
| 617 | } |
| 618 | |
| 619 | #ifndef NDEBUG |
| 620 | const char *getMatchClassName(MatchClassKind Kind) { |
| 621 | switch (Kind) { |
| 622 | case InvalidMatchClass: return "InvalidMatchClass"; |
| 623 | case OptionalMatchClass: return "OptionalMatchClass"; |
| 624 | case MCK__EXCLAIM_: return "MCK__EXCLAIM_"; |
| 625 | case MCK__38_: return "MCK__38_"; |
| 626 | case MCK__40_: return "MCK__40_"; |
| 627 | case MCK__41_: return "MCK__41_"; |
| 628 | case MCK__STAR_: return "MCK__STAR_"; |
| 629 | case MCK__43_: return "MCK__43_"; |
| 630 | case MCK__MINUS_: return "MCK__MINUS_"; |
| 631 | case MCK__47_: return "MCK__47_"; |
| 632 | case MCK__LT_: return "MCK__LT_"; |
| 633 | case MCK__61_: return "MCK__61_"; |
| 634 | case MCK__GT_: return "MCK__GT_"; |
| 635 | case MCK__91_: return "MCK__91_"; |
| 636 | case MCK__93_: return "MCK__93_"; |
| 637 | case MCK__94_: return "MCK__94_"; |
| 638 | case MCK_be16: return "MCK_be16"; |
| 639 | case MCK_be32: return "MCK_be32"; |
| 640 | case MCK_be64: return "MCK_be64"; |
| 641 | case MCK_call: return "MCK_call"; |
| 642 | case MCK_callx: return "MCK_callx"; |
| 643 | case MCK_exit: return "MCK_exit"; |
| 644 | case MCK_goto: return "MCK_goto"; |
| 645 | case MCK_if: return "MCK_if"; |
| 646 | case MCK_ld_95_pseudo: return "MCK_ld_95_pseudo"; |
| 647 | case MCK_le16: return "MCK_le16"; |
| 648 | case MCK_le32: return "MCK_le32"; |
| 649 | case MCK_le64: return "MCK_le64"; |
| 650 | case MCK_lea: return "MCK_lea"; |
| 651 | case MCK_ll: return "MCK_ll"; |
| 652 | case MCK_lock: return "MCK_lock"; |
| 653 | case MCK_nop: return "MCK_nop"; |
| 654 | case MCK_s: return "MCK_s"; |
| 655 | case MCK_skb: return "MCK_skb"; |
| 656 | case MCK_u16: return "MCK_u16"; |
| 657 | case MCK_u32: return "MCK_u32"; |
| 658 | case MCK_u64: return "MCK_u64"; |
| 659 | case MCK_u8: return "MCK_u8"; |
| 660 | case MCK__124_: return "MCK__124_"; |
| 661 | case MCK_R0: return "MCK_R0"; |
| 662 | case MCK_GPR: return "MCK_GPR"; |
| 663 | case MCK_GPR32: return "MCK_GPR32"; |
| 664 | case MCK_Imm: return "MCK_Imm"; |
| 665 | case NumMatchClassKinds: return "NumMatchClassKinds"; |
| 666 | } |
| 667 | llvm_unreachable("unhandled MatchClassKind!")::llvm::llvm_unreachable_internal("unhandled MatchClassKind!" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 667); |
| 668 | } |
| 669 | |
| 670 | #endif // NDEBUG |
| 671 | uint64_t BPFAsmParser:: |
| 672 | ComputeAvailableFeatures(const FeatureBitset& FB) const { |
| 673 | uint64_t Features = 0; |
| 674 | return Features; |
| 675 | } |
| 676 | |
| 677 | static bool checkAsmTiedOperandConstraints(unsigned Kind, |
| 678 | const OperandVector &Operands, |
| 679 | uint64_t &ErrorInfo) { |
| 680 | assert(Kind < CVT_NUM_SIGNATURES && "Invalid signature!")(static_cast <bool> (Kind < CVT_NUM_SIGNATURES && "Invalid signature!") ? void (0) : __assert_fail ("Kind < CVT_NUM_SIGNATURES && \"Invalid signature!\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 680, __extension__ __PRETTY_FUNCTION__)); |
| 681 | const uint8_t *Converter = ConversionTable[Kind]; |
| 682 | for (const uint8_t *p = Converter; *p; p+= 2) { |
| 683 | switch (*p) { |
| 684 | case CVT_Tied: { |
| 685 | unsigned OpIdx = *(p+1); |
| 686 | assert(OpIdx < (size_t)(std::end(TiedAsmOperandTable) -(static_cast <bool> (OpIdx < (size_t)(std::end(TiedAsmOperandTable ) - std::begin(TiedAsmOperandTable)) && "Tied operand not found" ) ? void (0) : __assert_fail ("OpIdx < (size_t)(std::end(TiedAsmOperandTable) - std::begin(TiedAsmOperandTable)) && \"Tied operand not found\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 688, __extension__ __PRETTY_FUNCTION__)) |
| 687 | std::begin(TiedAsmOperandTable)) &&(static_cast <bool> (OpIdx < (size_t)(std::end(TiedAsmOperandTable ) - std::begin(TiedAsmOperandTable)) && "Tied operand not found" ) ? void (0) : __assert_fail ("OpIdx < (size_t)(std::end(TiedAsmOperandTable) - std::begin(TiedAsmOperandTable)) && \"Tied operand not found\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 688, __extension__ __PRETTY_FUNCTION__)) |
| 688 | "Tied operand not found")(static_cast <bool> (OpIdx < (size_t)(std::end(TiedAsmOperandTable ) - std::begin(TiedAsmOperandTable)) && "Tied operand not found" ) ? void (0) : __assert_fail ("OpIdx < (size_t)(std::end(TiedAsmOperandTable) - std::begin(TiedAsmOperandTable)) && \"Tied operand not found\"" , "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 688, __extension__ __PRETTY_FUNCTION__)); |
| 689 | unsigned OpndNum1 = TiedAsmOperandTable[OpIdx][1]; |
| 690 | unsigned OpndNum2 = TiedAsmOperandTable[OpIdx][2]; |
| 691 | if (OpndNum1 != OpndNum2) { |
| 692 | auto &SrcOp1 = Operands[OpndNum1]; |
| 693 | auto &SrcOp2 = Operands[OpndNum2]; |
| 694 | if (SrcOp1->isReg() && SrcOp2->isReg() && |
| 695 | SrcOp1->getReg() != SrcOp2->getReg()) { |
| 696 | ErrorInfo = OpndNum2; |
| 697 | return false; |
| 698 | } |
| 699 | } |
| 700 | break; |
| 701 | } |
| 702 | default: |
| 703 | break; |
| 704 | } |
| 705 | } |
| 706 | return true; |
| 707 | } |
| 708 | |
| 709 | static const char *const MnemonicTable = |
| 710 | "\000\001*\004call\005callx\004exit\004goto\002if\tld_pseudo\003lea\004l" |
| 711 | "ock\003nop\002r0"; |
| 712 | |
| 713 | namespace { |
| 714 | struct MatchEntry { |
Excessive padding in 'struct (anonymous namespace)::MatchEntry' (2 padding bytes, where 0 is optimal).
Optimal fields order:
Opcode,
Mnemonic,
ConvertFn,
RequiredFeatures,
Classes,
consider reordering the fields or adding explicit padding members | |
| 715 | uint8_t Mnemonic; |
| 716 | uint16_t Opcode; |
| 717 | uint8_t ConvertFn; |
| 718 | uint8_t RequiredFeatures; |
| 719 | uint8_t Classes[13]; |
| 720 | StringRef getMnemonic() const { |
| 721 | return StringRef(MnemonicTable + Mnemonic + 1, |
| 722 | MnemonicTable[Mnemonic]); |
| 723 | } |
| 724 | }; |
| 725 | |
| 726 | // Predicate for searching for an opcode. |
| 727 | struct LessOpcode { |
| 728 | bool operator()(const MatchEntry &LHS, StringRef RHS) { |
| 729 | return LHS.getMnemonic() < RHS; |
| 730 | } |
| 731 | bool operator()(StringRef LHS, const MatchEntry &RHS) { |
| 732 | return LHS < RHS.getMnemonic(); |
| 733 | } |
| 734 | bool operator()(const MatchEntry &LHS, const MatchEntry &RHS) { |
| 735 | return LHS.getMnemonic() < RHS.getMnemonic(); |
| 736 | } |
| 737 | }; |
| 738 | } // end anonymous namespace. |
| 739 | |
| 740 | static const MatchEntry MatchTable0[] = { |
| 741 | { 0 /* */, BPF::MOV_rr, Convert__Reg1_0__Reg1_2, 0, { MCK_GPR, MCK__61_, MCK_GPR }, }, |
| 742 | { 0 /* */, BPF::MOV_ri, Convert__Reg1_0__Imm1_2, 0, { MCK_GPR, MCK__61_, MCK_Imm }, }, |
| 743 | { 0 /* */, BPF::MOV_rr_32, Convert__Reg1_0__Reg1_2, 0, { MCK_GPR32, MCK__61_, MCK_GPR32 }, }, |
| 744 | { 0 /* */, BPF::MOV_ri_32, Convert__Reg1_0__Imm1_2, 0, { MCK_GPR32, MCK__61_, MCK_Imm }, }, |
| 745 | { 0 /* */, BPF::AND_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__38_, MCK__61_, MCK_GPR }, }, |
| 746 | { 0 /* */, BPF::AND_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__38_, MCK__61_, MCK_Imm }, }, |
| 747 | { 0 /* */, BPF::MUL_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__STAR_, MCK__61_, MCK_GPR }, }, |
| 748 | { 0 /* */, BPF::MUL_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__STAR_, MCK__61_, MCK_Imm }, }, |
| 749 | { 0 /* */, BPF::ADD_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__43_, MCK__61_, MCK_GPR }, }, |
| 750 | { 0 /* */, BPF::ADD_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__43_, MCK__61_, MCK_Imm }, }, |
| 751 | { 0 /* */, BPF::SUB_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__MINUS_, MCK__61_, MCK_GPR }, }, |
| 752 | { 0 /* */, BPF::SUB_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__MINUS_, MCK__61_, MCK_Imm }, }, |
| 753 | { 0 /* */, BPF::DIV_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__47_, MCK__61_, MCK_GPR }, }, |
| 754 | { 0 /* */, BPF::DIV_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__47_, MCK__61_, MCK_Imm }, }, |
| 755 | { 0 /* */, BPF::NEG_64, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK__MINUS_, MCK_GPR }, }, |
| 756 | { 0 /* */, BPF::BE16, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK_be16, MCK_GPR }, }, |
| 757 | { 0 /* */, BPF::BE32, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK_be32, MCK_GPR }, }, |
| 758 | { 0 /* */, BPF::BE64, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK_be64, MCK_GPR }, }, |
| 759 | { 0 /* */, BPF::LE16, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK_le16, MCK_GPR }, }, |
| 760 | { 0 /* */, BPF::LE32, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK_le32, MCK_GPR }, }, |
| 761 | { 0 /* */, BPF::LE64, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR, MCK__61_, MCK_le64, MCK_GPR }, }, |
| 762 | { 0 /* */, BPF::LD_imm64, Convert__Reg1_0__Imm1_2, 0, { MCK_GPR, MCK__61_, MCK_Imm, MCK_ll }, }, |
| 763 | { 0 /* */, BPF::XOR_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__94_, MCK__61_, MCK_GPR }, }, |
| 764 | { 0 /* */, BPF::XOR_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__94_, MCK__61_, MCK_Imm }, }, |
| 765 | { 0 /* */, BPF::OR_rr, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR, MCK__124_, MCK__61_, MCK_GPR }, }, |
| 766 | { 0 /* */, BPF::OR_ri, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR, MCK__124_, MCK__61_, MCK_Imm }, }, |
| 767 | { 0 /* */, BPF::AND_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__38_, MCK__61_, MCK_GPR32 }, }, |
| 768 | { 0 /* */, BPF::AND_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__38_, MCK__61_, MCK_Imm }, }, |
| 769 | { 0 /* */, BPF::MUL_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__STAR_, MCK__61_, MCK_GPR32 }, }, |
| 770 | { 0 /* */, BPF::MUL_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__STAR_, MCK__61_, MCK_Imm }, }, |
| 771 | { 0 /* */, BPF::ADD_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__43_, MCK__61_, MCK_GPR32 }, }, |
| 772 | { 0 /* */, BPF::ADD_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__43_, MCK__61_, MCK_Imm }, }, |
| 773 | { 0 /* */, BPF::SUB_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__MINUS_, MCK__61_, MCK_GPR32 }, }, |
| 774 | { 0 /* */, BPF::SUB_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__MINUS_, MCK__61_, MCK_Imm }, }, |
| 775 | { 0 /* */, BPF::DIV_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__47_, MCK__61_, MCK_GPR32 }, }, |
| 776 | { 0 /* */, BPF::DIV_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__47_, MCK__61_, MCK_Imm }, }, |
| 777 | { 0 /* */, BPF::NEG_32, Convert__Reg1_0__Tie0_0_3, 0, { MCK_GPR32, MCK__61_, MCK__MINUS_, MCK_GPR32 }, }, |
| 778 | { 0 /* */, BPF::XOR_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__94_, MCK__61_, MCK_GPR32 }, }, |
| 779 | { 0 /* */, BPF::XOR_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__94_, MCK__61_, MCK_Imm }, }, |
| 780 | { 0 /* */, BPF::OR_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_3, 0, { MCK_GPR32, MCK__124_, MCK__61_, MCK_GPR32 }, }, |
| 781 | { 0 /* */, BPF::OR_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_3, 0, { MCK_GPR32, MCK__124_, MCK__61_, MCK_Imm }, }, |
| 782 | { 0 /* */, BPF::SLL_rr, Convert__Reg1_0__Tie0_0_0__Reg1_4, 0, { MCK_GPR, MCK__LT_, MCK__LT_, MCK__61_, MCK_GPR }, }, |
| 783 | { 0 /* */, BPF::SLL_ri, Convert__Reg1_0__Tie0_0_0__Imm1_4, 0, { MCK_GPR, MCK__LT_, MCK__LT_, MCK__61_, MCK_Imm }, }, |
| 784 | { 0 /* */, BPF::SRL_rr, Convert__Reg1_0__Tie0_0_0__Reg1_4, 0, { MCK_GPR, MCK__GT_, MCK__GT_, MCK__61_, MCK_GPR }, }, |
| 785 | { 0 /* */, BPF::SRL_ri, Convert__Reg1_0__Tie0_0_0__Imm1_4, 0, { MCK_GPR, MCK__GT_, MCK__GT_, MCK__61_, MCK_Imm }, }, |
| 786 | { 0 /* */, BPF::SLL_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_4, 0, { MCK_GPR32, MCK__LT_, MCK__LT_, MCK__61_, MCK_GPR32 }, }, |
| 787 | { 0 /* */, BPF::SLL_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_4, 0, { MCK_GPR32, MCK__LT_, MCK__LT_, MCK__61_, MCK_Imm }, }, |
| 788 | { 0 /* */, BPF::SRL_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_4, 0, { MCK_GPR32, MCK__GT_, MCK__GT_, MCK__61_, MCK_GPR32 }, }, |
| 789 | { 0 /* */, BPF::SRL_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_4, 0, { MCK_GPR32, MCK__GT_, MCK__GT_, MCK__61_, MCK_Imm }, }, |
| 790 | { 0 /* */, BPF::SRA_rr, Convert__Reg1_0__Tie0_0_0__Reg1_5, 0, { MCK_GPR, MCK_s, MCK__GT_, MCK__GT_, MCK__61_, MCK_GPR }, }, |
| 791 | { 0 /* */, BPF::SRA_ri, Convert__Reg1_0__Tie0_0_0__Imm1_5, 0, { MCK_GPR, MCK_s, MCK__GT_, MCK__GT_, MCK__61_, MCK_Imm }, }, |
| 792 | { 0 /* */, BPF::SRA_rr_32, Convert__Reg1_0__Tie0_0_0__Reg1_5, 0, { MCK_GPR32, MCK_s, MCK__GT_, MCK__GT_, MCK__61_, MCK_GPR32 }, }, |
| 793 | { 0 /* */, BPF::SRA_ri_32, Convert__Reg1_0__Tie0_0_0__Imm1_5, 0, { MCK_GPR32, MCK_s, MCK__GT_, MCK__GT_, MCK__61_, MCK_Imm }, }, |
| 794 | { 0 /* */, BPF::LDH, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR, MCK__61_, MCK__STAR_, MCK__40_, MCK_u16, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 795 | { 0 /* */, BPF::LDW, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR, MCK__61_, MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 796 | { 0 /* */, BPF::LDD, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR, MCK__61_, MCK__STAR_, MCK__40_, MCK_u64, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 797 | { 0 /* */, BPF::LDB, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR, MCK__61_, MCK__STAR_, MCK__40_, MCK_u8, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 798 | { 0 /* */, BPF::LDH32, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR32, MCK__61_, MCK__STAR_, MCK__40_, MCK_u16, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 799 | { 0 /* */, BPF::LDW32, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR32, MCK__61_, MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 800 | { 0 /* */, BPF::LDB32, Convert__Reg1_0__Reg1_8__Imm1_9, 0, { MCK_GPR32, MCK__61_, MCK__STAR_, MCK__40_, MCK_u8, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_ }, }, |
| 801 | { 1 /* * */, BPF::STH, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u16, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR }, }, |
| 802 | { 1 /* * */, BPF::STH32, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u16, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR32 }, }, |
| 803 | { 1 /* * */, BPF::STW, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR }, }, |
| 804 | { 1 /* * */, BPF::STW32, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR32 }, }, |
| 805 | { 1 /* * */, BPF::STD, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u64, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR }, }, |
| 806 | { 1 /* * */, BPF::STB, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u8, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR }, }, |
| 807 | { 1 /* * */, BPF::STB32, Convert__Reg1_10__Reg1_6__Imm1_7, 0, { MCK__STAR_, MCK__40_, MCK_u8, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__61_, MCK_GPR32 }, }, |
| 808 | { 3 /* call */, BPF::JAL, Convert__Imm1_1, 0, { MCK_call, MCK_Imm }, }, |
| 809 | { 8 /* callx */, BPF::JALX, Convert__Imm1_1, 0, { MCK_callx, MCK_Imm }, }, |
| 810 | { 14 /* exit */, BPF::RET, Convert_NoOperands, 0, { MCK_exit }, }, |
| 811 | { 19 /* goto */, BPF::JMP, Convert__Imm1_1, 0, { MCK_goto, MCK_Imm }, }, |
| 812 | { 24 /* if */, BPF::JULT_rr, Convert__Reg1_1__Reg1_3__Imm1_5, 0, { MCK_if, MCK_GPR, MCK__LT_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 813 | { 24 /* if */, BPF::JULT_ri, Convert__Reg1_1__Imm1_3__Imm1_5, 0, { MCK_if, MCK_GPR, MCK__LT_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 814 | { 24 /* if */, BPF::JUGT_rr, Convert__Reg1_1__Reg1_3__Imm1_5, 0, { MCK_if, MCK_GPR, MCK__GT_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 815 | { 24 /* if */, BPF::JUGT_ri, Convert__Reg1_1__Imm1_3__Imm1_5, 0, { MCK_if, MCK_GPR, MCK__GT_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 816 | { 24 /* if */, BPF::JNE_rr, Convert__Reg1_1__Reg1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__EXCLAIM_, MCK__61_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 817 | { 24 /* if */, BPF::JNE_ri, Convert__Reg1_1__Imm1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__EXCLAIM_, MCK__61_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 818 | { 24 /* if */, BPF::JULE_rr, Convert__Reg1_1__Reg1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__LT_, MCK__61_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 819 | { 24 /* if */, BPF::JULE_ri, Convert__Reg1_1__Imm1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__LT_, MCK__61_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 820 | { 24 /* if */, BPF::JEQ_rr, Convert__Reg1_1__Reg1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__61_, MCK__61_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 821 | { 24 /* if */, BPF::JEQ_ri, Convert__Reg1_1__Imm1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__61_, MCK__61_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 822 | { 24 /* if */, BPF::JUGE_rr, Convert__Reg1_1__Reg1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__GT_, MCK__61_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 823 | { 24 /* if */, BPF::JUGE_ri, Convert__Reg1_1__Imm1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK__GT_, MCK__61_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 824 | { 24 /* if */, BPF::JSLT_rr, Convert__Reg1_1__Reg1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK_s, MCK__LT_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 825 | { 24 /* if */, BPF::JSLT_ri, Convert__Reg1_1__Imm1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK_s, MCK__LT_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 826 | { 24 /* if */, BPF::JSGT_rr, Convert__Reg1_1__Reg1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK_s, MCK__GT_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 827 | { 24 /* if */, BPF::JSGT_ri, Convert__Reg1_1__Imm1_4__Imm1_6, 0, { MCK_if, MCK_GPR, MCK_s, MCK__GT_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 828 | { 24 /* if */, BPF::JSLE_rr, Convert__Reg1_1__Reg1_5__Imm1_7, 0, { MCK_if, MCK_GPR, MCK_s, MCK__LT_, MCK__61_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 829 | { 24 /* if */, BPF::JSLE_ri, Convert__Reg1_1__Imm1_5__Imm1_7, 0, { MCK_if, MCK_GPR, MCK_s, MCK__LT_, MCK__61_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 830 | { 24 /* if */, BPF::JSGE_rr, Convert__Reg1_1__Reg1_5__Imm1_7, 0, { MCK_if, MCK_GPR, MCK_s, MCK__GT_, MCK__61_, MCK_GPR, MCK_goto, MCK_Imm }, }, |
| 831 | { 24 /* if */, BPF::JSGE_ri, Convert__Reg1_1__Imm1_5__Imm1_7, 0, { MCK_if, MCK_GPR, MCK_s, MCK__GT_, MCK__61_, MCK_Imm, MCK_goto, MCK_Imm }, }, |
| 832 | { 27 /* ld_pseudo */, BPF::LD_pseudo, Convert__Reg1_1__Imm1_2__Imm1_3, 0, { MCK_ld_95_pseudo, MCK_GPR, MCK_Imm, MCK_Imm }, }, |
| 833 | { 37 /* lea */, BPF::FI_ri, Convert__Reg1_1__Reg1_2__Imm1_3, 0, { MCK_lea, MCK_GPR, MCK_GPR, MCK_Imm }, }, |
| 834 | { 41 /* lock */, BPF::XADD32, Convert__Reg1_12__Reg1_7__Imm1_8__Tie0_12_12, 0, { MCK_lock, MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__43_, MCK__61_, MCK_GPR }, }, |
| 835 | { 41 /* lock */, BPF::XADD64, Convert__Reg1_12__Reg1_7__Imm1_8__Tie0_12_12, 0, { MCK_lock, MCK__STAR_, MCK__40_, MCK_u64, MCK__STAR_, MCK__41_, MCK__40_, MCK_GPR, MCK_Imm, MCK__41_, MCK__43_, MCK__61_, MCK_GPR }, }, |
| 836 | { 46 /* nop */, BPF::NOP, Convert__Imm1_1, 0, { MCK_nop, MCK_Imm }, }, |
| 837 | { 50 /* r0 */, BPF::LD_IND_H, Convert__imm_95_0__Reg1_9, 0, { MCK_R0, MCK__61_, MCK__STAR_, MCK__40_, MCK_u16, MCK__STAR_, MCK__41_, MCK_skb, MCK__91_, MCK_GPR, MCK__93_ }, }, |
| 838 | { 50 /* r0 */, BPF::LD_ABS_H, Convert__imm_95_0__Imm1_9, 0, { MCK_R0, MCK__61_, MCK__STAR_, MCK__40_, MCK_u16, MCK__STAR_, MCK__41_, MCK_skb, MCK__91_, MCK_Imm, MCK__93_ }, }, |
| 839 | { 50 /* r0 */, BPF::LD_IND_W, Convert__imm_95_0__Reg1_9, 0, { MCK_R0, MCK__61_, MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK_skb, MCK__91_, MCK_GPR, MCK__93_ }, }, |
| 840 | { 50 /* r0 */, BPF::LD_ABS_W, Convert__imm_95_0__Imm1_9, 0, { MCK_R0, MCK__61_, MCK__STAR_, MCK__40_, MCK_u32, MCK__STAR_, MCK__41_, MCK_skb, MCK__91_, MCK_Imm, MCK__93_ }, }, |
| 841 | { 50 /* r0 */, BPF::LD_IND_B, Convert__imm_95_0__Reg1_9, 0, { MCK_R0, MCK__61_, MCK__STAR_, MCK__40_, MCK_u8, MCK__STAR_, MCK__41_, MCK_skb, MCK__91_, MCK_GPR, MCK__93_ }, }, |
| 842 | { 50 /* r0 */, BPF::LD_ABS_B, Convert__imm_95_0__Imm1_9, 0, { MCK_R0, MCK__61_, MCK__STAR_, MCK__40_, MCK_u8, MCK__STAR_, MCK__41_, MCK_skb, MCK__91_, MCK_Imm, MCK__93_ }, }, |
| 843 | }; |
| 844 | |
| 845 | #include "llvm/Support/Debug.h" |
| 846 | #include "llvm/Support/Format.h" |
| 847 | |
| 848 | unsigned BPFAsmParser:: |
| 849 | MatchInstructionImpl(const OperandVector &Operands, |
| 850 | MCInst &Inst, |
| 851 | uint64_t &ErrorInfo, |
| 852 | bool matchingInlineAsm, unsigned VariantID) { |
| 853 | // Eliminate obvious mismatches. |
| 854 | if (Operands.size() > 13) { |
| 855 | ErrorInfo = 13; |
| 856 | return Match_InvalidOperand; |
| 857 | } |
| 858 | |
| 859 | // Get the current feature set. |
| 860 | uint64_t AvailableFeatures = getAvailableFeatures(); |
| 861 | |
| 862 | // Get the instruction mnemonic, which is the first token. |
| 863 | StringRef Mnemonic; |
| 864 | if (Operands[0]->isToken()) |
| 865 | Mnemonic = ((BPFOperand&)*Operands[0]).getToken(); |
| 866 | |
| 867 | // Some state to try to produce better error messages. |
| 868 | bool HadMatchOtherThanFeatures = false; |
| 869 | bool HadMatchOtherThanPredicate = false; |
| 870 | unsigned RetCode = Match_InvalidOperand; |
| 871 | uint64_t MissingFeatures = ~0ULL; |
| 872 | // Set ErrorInfo to the operand that mismatches if it is |
| 873 | // wrong for all instances of the instruction. |
| 874 | ErrorInfo = ~0ULL; |
| 875 | // Find the appropriate table for this asm variant. |
| 876 | const MatchEntry *Start, *End; |
| 877 | switch (VariantID) { |
| 878 | default: llvm_unreachable("invalid variant!")::llvm::llvm_unreachable_internal("invalid variant!", "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 878); |
| 879 | case 0: Start = std::begin(MatchTable0); End = std::end(MatchTable0); break; |
| 880 | } |
| 881 | // Search the table. |
| 882 | auto MnemonicRange = std::make_pair(Start, End); |
| 883 | unsigned SIndex = Mnemonic.empty() ? 0 : 1; |
| 884 | if (!Mnemonic.empty()) |
| 885 | MnemonicRange = std::equal_range(Start, End, Mnemonic.lower(), LessOpcode()); |
| 886 | |
| 887 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "AsmMatcher: found " << std::distance(MnemonicRange.first, MnemonicRange.second) << " encodings with mnemonic '" << Mnemonic << "'\n" ; } } while (false) |
| 888 | std::distance(MnemonicRange.first, MnemonicRange.second) <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "AsmMatcher: found " << std::distance(MnemonicRange.first, MnemonicRange.second) << " encodings with mnemonic '" << Mnemonic << "'\n" ; } } while (false) |
| 889 | " encodings with mnemonic '" << Mnemonic << "'\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "AsmMatcher: found " << std::distance(MnemonicRange.first, MnemonicRange.second) << " encodings with mnemonic '" << Mnemonic << "'\n" ; } } while (false); |
| 890 | |
| 891 | // Return a more specific error code if no mnemonics match. |
| 892 | if (MnemonicRange.first == MnemonicRange.second) |
| 893 | return Match_MnemonicFail; |
| 894 | |
| 895 | for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second; |
| 896 | it != ie; ++it) { |
| 897 | bool HasRequiredFeatures = |
| 898 | (AvailableFeatures & it->RequiredFeatures) == it->RequiredFeatures; |
| 899 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Trying to match opcode " << MII.getName(it->Opcode) << "\n"; } } while (false) |
| 900 | << MII.getName(it->Opcode) << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Trying to match opcode " << MII.getName(it->Opcode) << "\n"; } } while (false); |
| 901 | bool OperandsValid = true; |
| 902 | for (unsigned FormalIdx = SIndex, ActualIdx = SIndex; FormalIdx != 13; ++FormalIdx) { |
| 903 | auto Formal = static_cast<MatchClassKind>(it->Classes[FormalIdx]); |
| 904 | DEBUG_WITH_TYPE("asm-matcher",do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << " Matching formal operand class " << getMatchClassName(Formal) << " against actual operand at index " << ActualIdx; } } while (false) |
| 905 | dbgs() << " Matching formal operand class " << getMatchClassName(Formal)do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << " Matching formal operand class " << getMatchClassName(Formal) << " against actual operand at index " << ActualIdx; } } while (false) |
| 906 | << " against actual operand at index " << ActualIdx)do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << " Matching formal operand class " << getMatchClassName(Formal) << " against actual operand at index " << ActualIdx; } } while (false); |
| 907 | if (ActualIdx < Operands.size()) |
| 908 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << " ("; Operands[ActualIdx]-> print(dbgs()); dbgs() << "): "; } } while (false) |
| 909 | Operands[ActualIdx]->print(dbgs()); dbgs() << "): ")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << " ("; Operands[ActualIdx]-> print(dbgs()); dbgs() << "): "; } } while (false); |
| 910 | else |
| 911 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << ": "; } } while (false); |
| 912 | if (ActualIdx >= Operands.size()) { |
| 913 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "actual operand index out of range " ; } } while (false); |
| 914 | OperandsValid = (Formal == InvalidMatchClass) || isSubclass(Formal, OptionalMatchClass); |
| 915 | if (!OperandsValid) ErrorInfo = ActualIdx; |
| 916 | break; |
| 917 | } |
| 918 | MCParsedAsmOperand &Actual = *Operands[ActualIdx]; |
| 919 | unsigned Diag = validateOperandClass(Actual, Formal); |
| 920 | if (Diag == Match_Success) { |
| 921 | DEBUG_WITH_TYPE("asm-matcher",do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "match success using generic matcher\n" ; } } while (false) |
| 922 | dbgs() << "match success using generic matcher\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "match success using generic matcher\n" ; } } while (false); |
| 923 | ++ActualIdx; |
| 924 | continue; |
| 925 | } |
| 926 | // If the generic handler indicates an invalid operand |
| 927 | // failure, check for a special case. |
| 928 | if (Diag != Match_Success) { |
| 929 | unsigned TargetDiag = validateTargetOperandClass(Actual, Formal); |
| 930 | if (TargetDiag == Match_Success) { |
| 931 | DEBUG_WITH_TYPE("asm-matcher",do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "match success using target matcher\n" ; } } while (false) |
| 932 | dbgs() << "match success using target matcher\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "match success using target matcher\n" ; } } while (false); |
| 933 | ++ActualIdx; |
| 934 | continue; |
| 935 | } |
| 936 | // If the target matcher returned a specific error code use |
| 937 | // that, else use the one from the generic matcher. |
| 938 | if (TargetDiag != Match_InvalidOperand && HasRequiredFeatures) |
| 939 | Diag = TargetDiag; |
| 940 | } |
| 941 | // If current formal operand wasn't matched and it is optional |
| 942 | // then try to match next formal operand |
| 943 | if (Diag == Match_InvalidOperand && isSubclass(Formal, OptionalMatchClass)) { |
| 944 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "ignoring optional operand\n" ; } } while (false); |
| 945 | continue; |
| 946 | } |
| 947 | // If this operand is broken for all of the instances of this |
| 948 | // mnemonic, keep track of it so we can report loc info. |
| 949 | // If we already had a match that only failed due to a |
| 950 | // target predicate, that diagnostic is preferred. |
| 951 | if (!HadMatchOtherThanPredicate && |
| 952 | (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) { |
| 953 | if (HasRequiredFeatures && (ErrorInfo != ActualIdx || Diag != Match_InvalidOperand)) |
| 954 | RetCode = Diag; |
| 955 | ErrorInfo = ActualIdx; |
| 956 | } |
| 957 | // Otherwise, just reject this instance of the mnemonic. |
| 958 | OperandsValid = false; |
| 959 | break; |
| 960 | } |
| 961 | |
| 962 | if (!OperandsValid) { |
| 963 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Opcode result: multiple " "operand mismatches, ignoring " "this opcode\n"; } } while ( false) |
| 964 | "operand mismatches, ignoring "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Opcode result: multiple " "operand mismatches, ignoring " "this opcode\n"; } } while ( false) |
| 965 | "this opcode\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Opcode result: multiple " "operand mismatches, ignoring " "this opcode\n"; } } while ( false); |
| 966 | continue; |
| 967 | } |
| 968 | if (!HasRequiredFeatures) { |
| 969 | HadMatchOtherThanFeatures = true; |
| 970 | uint64_t NewMissingFeatures = it->RequiredFeatures & ~AvailableFeatures; |
| 971 | DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features: "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Missing target features: " << format_hex(NewMissingFeatures, 18) << "\n"; } } while (false) |
| 972 | << format_hex(NewMissingFeatures, 18)do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Missing target features: " << format_hex(NewMissingFeatures, 18) << "\n"; } } while (false) |
| 973 | << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Missing target features: " << format_hex(NewMissingFeatures, 18) << "\n"; } } while (false); |
| 974 | if (countPopulation(NewMissingFeatures) <= |
| 975 | countPopulation(MissingFeatures)) |
| 976 | MissingFeatures = NewMissingFeatures; |
| 977 | continue; |
| 978 | } |
| 979 | |
| 980 | Inst.clear(); |
| 981 | |
| 982 | Inst.setOpcode(it->Opcode); |
| 983 | // We have a potential match but have not rendered the operands. |
| 984 | // Check the target predicate to handle any context sensitive |
| 985 | // constraints. |
| 986 | // For example, Ties that are referenced multiple times must be |
| 987 | // checked here to ensure the input is the same for each match |
| 988 | // constraints. If we leave it any later the ties will have been |
| 989 | // canonicalized |
| 990 | unsigned MatchResult; |
| 991 | if ((MatchResult = checkEarlyTargetMatchPredicate(Inst, Operands)) != Match_Success) { |
| 992 | Inst.clear(); |
| 993 | DEBUG_WITH_TYPE(do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Early target match predicate failed with diag code " << MatchResult << "\n"; } } while (false) |
| 994 | "asm-matcher",do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Early target match predicate failed with diag code " << MatchResult << "\n"; } } while (false) |
| 995 | dbgs() << "Early target match predicate failed with diag code "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Early target match predicate failed with diag code " << MatchResult << "\n"; } } while (false) |
| 996 | << MatchResult << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Early target match predicate failed with diag code " << MatchResult << "\n"; } } while (false); |
| 997 | RetCode = MatchResult; |
| 998 | HadMatchOtherThanPredicate = true; |
| 999 | continue; |
| 1000 | } |
| 1001 | |
| 1002 | if (matchingInlineAsm) { |
| 1003 | convertToMapAndConstraints(it->ConvertFn, Operands); |
| 1004 | if (!checkAsmTiedOperandConstraints(it->ConvertFn, Operands, ErrorInfo)) |
| 1005 | return Match_InvalidTiedOperand; |
| 1006 | |
| 1007 | return Match_Success; |
| 1008 | } |
| 1009 | |
| 1010 | // We have selected a definite instruction, convert the parsed |
| 1011 | // operands into the appropriate MCInst. |
| 1012 | convertToMCInst(it->ConvertFn, Inst, it->Opcode, Operands); |
| 1013 | |
| 1014 | // We have a potential match. Check the target predicate to |
| 1015 | // handle any context sensitive constraints. |
| 1016 | if ((MatchResult = checkTargetMatchPredicate(Inst)) != Match_Success) { |
| 1017 | DEBUG_WITH_TYPE("asm-matcher",do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Target match predicate failed with diag code " << MatchResult << "\n"; } } while (false) |
| 1018 | dbgs() << "Target match predicate failed with diag code "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Target match predicate failed with diag code " << MatchResult << "\n"; } } while (false) |
| 1019 | << MatchResult << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Target match predicate failed with diag code " << MatchResult << "\n"; } } while (false); |
| 1020 | Inst.clear(); |
| 1021 | RetCode = MatchResult; |
| 1022 | HadMatchOtherThanPredicate = true; |
| 1023 | continue; |
| 1024 | } |
| 1025 | |
| 1026 | if (!checkAsmTiedOperandConstraints(it->ConvertFn, Operands, ErrorInfo)) |
| 1027 | return Match_InvalidTiedOperand; |
| 1028 | |
| 1029 | DEBUG_WITH_TYPE(do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Opcode result: complete match, selecting this opcode\n" ; } } while (false) |
| 1030 | "asm-matcher",do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Opcode result: complete match, selecting this opcode\n" ; } } while (false) |
| 1031 | dbgs() << "Opcode result: complete match, selecting this opcode\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType ("asm-matcher")) { dbgs() << "Opcode result: complete match, selecting this opcode\n" ; } } while (false); |
| 1032 | return Match_Success; |
| 1033 | } |
| 1034 | |
| 1035 | // Okay, we had no match. Try to return a useful error code. |
| 1036 | if (HadMatchOtherThanPredicate || !HadMatchOtherThanFeatures) |
| 1037 | return RetCode; |
| 1038 | |
| 1039 | // Missing feature matches return which features were missing |
| 1040 | ErrorInfo = MissingFeatures; |
| 1041 | return Match_MissingFeature; |
| 1042 | } |
| 1043 | |
| 1044 | #endif // GET_MATCHER_IMPLEMENTATION |
| 1045 | |
| 1046 | |
| 1047 | #ifdef GET_MNEMONIC_SPELL_CHECKER |
| 1048 | #undef GET_MNEMONIC_SPELL_CHECKER |
| 1049 | |
| 1050 | static std::string BPFMnemonicSpellCheck(StringRef S, uint64_t FBS, unsigned VariantID) { |
| 1051 | const unsigned MaxEditDist = 2; |
| 1052 | std::vector<StringRef> Candidates; |
| 1053 | StringRef Prev = ""; |
| 1054 | |
| 1055 | // Find the appropriate table for this asm variant. |
| 1056 | const MatchEntry *Start, *End; |
| 1057 | switch (VariantID) { |
| 1058 | default: llvm_unreachable("invalid variant!")::llvm::llvm_unreachable_internal("invalid variant!", "/build/llvm-toolchain-snapshot-7~svn329677/build-llvm/lib/Target/BPF/BPFGenAsmMatcher.inc" , 1058); |
| 1059 | case 0: Start = std::begin(MatchTable0); End = std::end(MatchTable0); break; |
| 1060 | } |
| 1061 | |
| 1062 | for (auto I = Start; I < End; I++) { |
| 1063 | // Ignore unsupported instructions. |
| 1064 | if ((FBS & I->RequiredFeatures) != I->RequiredFeatures) |
| 1065 | continue; |
| 1066 | |
| 1067 | StringRef T = I->getMnemonic(); |
| 1068 | // Avoid recomputing the edit distance for the same string. |
| 1069 | if (T.equals(Prev)) |
| 1070 | continue; |
| 1071 | |
| 1072 | Prev = T; |
| 1073 | unsigned Dist = S.edit_distance(T, false, MaxEditDist); |
| 1074 | if (Dist <= MaxEditDist) |
| 1075 | Candidates.push_back(T); |
| 1076 | } |
| 1077 | |
| 1078 | if (Candidates.empty()) |
| 1079 | return ""; |
| 1080 | |
| 1081 | std::string Res = ", did you mean: "; |
| 1082 | unsigned i = 0; |
| 1083 | for( ; i < Candidates.size() - 1; i++) |
| 1084 | Res += Candidates[i].str() + ", "; |
| 1085 | return Res + Candidates[i].str() + "?"; |
| 1086 | } |
| 1087 | |
| 1088 | #endif // GET_MNEMONIC_SPELL_CHECKER |
| 1089 |