mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-10-19 11:30:15 +00:00
43 lines
1.2 KiB
C++
43 lines
1.2 KiB
C++
|
// Copyright (c) 2016 Google Inc.
|
||
|
|
//
|
||
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
|
// you may not use this file except in compliance with the License.
|
||
|
|
// You may obtain a copy of the License at
|
||
|
|
//
|
||
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
||
|
|
//
|
||
|
|
// Unless required by applicable law or agreed to in writing, software
|
||
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
|
// See the License for the specific language governing permissions and
|
||
|
|
// limitations under the License.
|
||
|
|
|
||
|
|
#include "basic_block.h"
|
||
|
|
|
||
|
|
namespace spvtools {
|
||
|
|
namespace ir {
|
||
|
|
|
||
|
|
void BasicBlock::ForEachSuccessorLabel(
|
||
|
|
const std::function<void(const uint32_t)>& f) {
|
||
|
|
const auto br = &*insts_.back();
|
||
|
|
switch (br->opcode()) {
|
||
|
|
case SpvOpBranch: {
|
||
|
|
f(br->GetOperand(0).words[0]);
|
||
|
|
} break;
|
||
|
|
case SpvOpBranchConditional:
|
||
|
|
case SpvOpSwitch: {
|
||
|
|
bool is_first = true;
|
||
|
|
br->ForEachInId([&is_first, &f](const uint32_t* idp) {
|
||
|
|
if (!is_first) f(*idp);
|
||
|
|
is_first = false;
|
||
|
|
});
|
||
|
|
} break;
|
||
|
|
default:
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace ir
|
||
|
|
} // namespace spvtools
|
||
|
|
|