aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Support/MemoryBuffer.cpp
diff options
context:
space:
mode:
authorKrzysztof Parzyszek <Krzysztof.Parzyszek@amd.com>2024-11-20 08:33:17 -0600
committerGitHub <noreply@github.com>2024-11-20 08:33:17 -0600
commitcfd67c214938a1f4ab3eff45a79a5a3da543d4b6 (patch)
tree12241152ca4f3a4ea71ffd41e2b9819980b3583a /llvm/lib/Support/MemoryBuffer.cpp
parentb49c4af186a6de8f201ed6a4c326ebf822d4fd84 (diff)
downloadllvm-cfd67c214938a1f4ab3eff45a79a5a3da543d4b6.zip
llvm-cfd67c214938a1f4ab3eff45a79a5a3da543d4b6.tar.gz
llvm-cfd67c214938a1f4ab3eff45a79a5a3da543d4b6.tar.bz2
[flang][OpenMP] Normalize clause modifiers that exist on their own (#116655)
This is the first part of the effort to make parsing of clause modifiers more uniform and robust. Currently, when multiple modifiers are allowed, the parser will expect them to appear in a hard-coded order. Additionally, modifier properties (such as "ultimate") are checked separately for each case. The overall plan is 1. Extract all modifiers into their own top-level classes, and then equip them with sets of common properties that will allow performing the property checks generically, without refering to the specific kind of the modifier. 2. Define a parser (as a separate class) for each modifier. 3. For each clause define a union (std::variant) of all allowable modifiers, and parse the modifiers as a list of these unions. The intent is also to isolate parts of the code that could eventually be auto-generated. OpenMP modifier overhaul: #1/3
Diffstat (limited to 'llvm/lib/Support/MemoryBuffer.cpp')
0 files changed, 0 insertions, 0 deletions