diff options
| author | jsmall-nvidia <jsmall@nvidia.com> | 2023-04-25 10:43:29 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-04-25 10:43:29 -0400 |
| commit | 7b7c095b37e85ca3a8f55eff1c3d9643d467b8e0 (patch) | |
| tree | 9c71955dbc956b0058b19818ca127c8132cda512 /source/slang/slang-ir-dominators.cpp | |
| parent | 284cee1f246c072f190c87c8fb60c1d2181e458f (diff) | |
Dictionary using lowerCamel (#2835)
* #include an absolute path didn't work - because paths were taken to always be relative.
* WIP lowerCamel Dictionary.
* WIP more lowerCamel fixes for Dictionary.
* Add/Remove/Clear
* GetValue/Contains
* Fix tabs in dictionary.
Count -> getCount
* Fix fields with caps.
* Key -> key
Value -> value
Use m_ for members where appropriate.
Use lowerCamel in linked list.
* Some small fixes/improvements to Dictionary.
* Kick CI.
Diffstat (limited to 'source/slang/slang-ir-dominators.cpp')
| -rw-r--r-- | source/slang/slang-ir-dominators.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/source/slang/slang-ir-dominators.cpp b/source/slang/slang-ir-dominators.cpp index e03ae9425..6c2045b7f 100644 --- a/source/slang/slang-ir-dominators.cpp +++ b/source/slang/slang-ir-dominators.cpp @@ -179,7 +179,7 @@ IRDominatorTree::DominatedList IRDominatorTree::getProperlyDominatedBlocks(IRBlo Int IRDominatorTree::getBlockIndex(IRBlock* block) { Int index = kInvalidIndex; - if(!mapBlockToIndex.TryGetValue(block, index)) + if(!mapBlockToIndex.tryGetValue(block, index)) { SLANG_UNEXPECTED("block was not present in dominator tree"); } @@ -188,7 +188,7 @@ Int IRDominatorTree::getBlockIndex(IRBlock* block) bool IRDominatorTree::isUnreachable(IRBlock* block) { - return !mapBlockToIndex.ContainsKey(block); + return !mapBlockToIndex.containsKey(block); } @@ -279,11 +279,11 @@ struct DepthFirstSearchContext template<typename SuccessorFunc> void walk(IRBlock* block, const SuccessorFunc& getSuccessors) { - visited.Add(block); + visited.add(block); preVisit(block); for(auto succ : getSuccessors(block)) { - if(!visited.Contains(succ)) + if(!visited.contains(succ)) { walk(succ, getSuccessors); } @@ -328,7 +328,7 @@ void computePostorder(IRGlobalValueWithCode* code, List<IRBlock*>& outOrder) List<IRBlock*> prefix; for (auto block : code->getBlocks()) { - if (!context.visited.Contains(block)) + if (!context.visited.contains(block)) { prefix.add(block); } @@ -753,7 +753,7 @@ struct DominatorTreeComputationContext // from the block to the node index. // node.block = block; - dominatorTree->mapBlockToIndex.Add(block, nodeIndex); + dominatorTree->mapBlockToIndex.add(block, nodeIndex); // Filling in the parent is easy enough, just with the detail that // we need to handle the invalid case explicitly (for a node with |