mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
07d36a8194
- This doesn't actually improve the algorithm (its still linear), but the generated (match) code is now fairly compact and table driven. Still need a generic string matcher. - The table still needs to be compressed, this is quite simple to do and should shrink it to under 16k. - This also simplifies and restructures the code to make the match classes more explicit, in anticipation of resolving ambiguities. llvm-svn: 78461 |
||
|---|---|---|
| .. | ||
| assignment.s | ||
| conditional_asm.s | ||
| dg.exp | ||
| directive_abort.s | ||
| directive_align.s | ||
| directive_ascii.s | ||
| directive_comm.s | ||
| directive_desc.s | ||
| directive_fill.s | ||
| directive_include.s | ||
| directive_lcomm.s | ||
| directive_lsym.s | ||
| directive_org.s | ||
| directive_set.s | ||
| directive_space.s | ||
| directive_subsections_via_symbols.s | ||
| directive_symbol_attrs.s | ||
| directive_values.s | ||
| directive_zerofill.s | ||
| exprs.s | ||
| hello.s | ||
| labels.s | ||
| x86_instructions.s | ||
| x86_operands.s | ||