Support branch prediction bits, more bd mnemonics, more rlwinm mnemonics

This commit is contained in:
Luke Street 2022-10-10 17:53:24 -04:00
parent 20abce13e4
commit 4d8e473331
7 changed files with 1869 additions and 272 deletions

View File

@ -7,7 +7,7 @@ pub struct FormattedIns(pub Ins);
impl Display for FormattedIns {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
let simple = self.0.clone().simplified();
write!(f, "{}{}", simple.mnemonic, simple.ins.suffix())?;
write!(f, "{}{}", simple.mnemonic, simple.suffix)?;
let mut writing_offset = false;
for (i, arg) in simple.args.iter().enumerate() {
if i == 0 {

File diff suppressed because it is too large Load Diff

View File

@ -215,8 +215,6 @@ impl Display for Bit {
// Unsigned opaque argument.
field_arg!(OpaqueU, u32);
const SPR_LR: usize = 16;
#[derive(Debug, Clone)]
pub enum Argument {
GPR(GPR),
@ -373,13 +371,11 @@ impl Ins {
self.branch_offset().and_then(|offset| {
if self.field_AA() {
Some(offset as u32)
} else {
if offset < 0 {
} else if offset < 0 {
self.addr.checked_sub((-offset) as u32)
} else {
self.addr.checked_add(offset as u32)
}
}
})
}
@ -419,12 +415,13 @@ impl Ins {
pub struct SimplifiedIns {
pub ins: Ins,
pub mnemonic: &'static str,
pub suffix: String,
pub args: Vec<Argument>,
}
impl Display for SimplifiedIns {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
write!(f, "{}{} ", self.mnemonic, self.ins.suffix())?;
write!(f, "{}{} ", self.mnemonic, self.suffix)?;
let mut writing_offset = false;
for (i, argument) in self.args.iter().enumerate() {
write!(f, "{}", argument)?;
@ -449,6 +446,7 @@ impl SimplifiedIns {
pub(crate) fn basic_form(ins: Ins) -> Self {
Self {
mnemonic: ins.op.mnemonic(),
suffix: ins.suffix(),
args: ins
.fields()
.iter()

View File

@ -95,6 +95,7 @@ fn test_ins_b() {
assert_asm!(0x4BE03C99, "bl -0x1fc368");
assert_asm!(0x4BDC1A59, "bl -0x23e5a8");
assert_asm!(0x48000063, "bla 0x60");
assert_asm!(0x48000002, "ba 0x0");
}
#[test]
@ -121,18 +122,29 @@ fn test_ins_bc() {
assert_asm!(0x418502E4, "bgt cr1, 0x2e4");
assert_asm!(0x419A0138, "beq cr6, 0x138");
assert_asm!(0x419C0008, "blt cr7, 0x8");
assert_asm!(0x4240FFF0, "bdz -0x10");
assert_asm!(0x4200F560, "bdnz -0xaa0");
assert_asm!(0x40010014, "bdnzf gt, 0x14");
assert_asm!(0x40410035, "bdzfl gt, 0x34");
assert_asm!(0x41430023, "bdztla so, 0x20");
assert_asm!(0x4108FFE3, "bdnztla 4*cr2+lt, -0x20");
assert_asm!(0x40A20008, "bne+ 0x8");
}
#[test]
fn test_ins_bcctr() {
assert_asm!(0x4E800420, "bctr");
assert_asm!(0x4E800421, "bctrl");
assert_asm!(0x4D820420, "beqctr");
assert_asm!(0x4D8D0421, "bgtctrl cr3");
assert_asm!(0x4DA20420, "beqctr+");
assert_asm!(0x4DB90421, "bgtctrl+ cr6");
}
#[test]
fn test_ins_bclr() {
assert_asm!(0x4C800020, "bgelr");
assert_asm!(0x4CA00020, "bgelr+");
assert_asm!(0x4C810020, "blelr");
assert_asm!(0x4C820020, "bnelr");
assert_asm!(0x4C9E0020, "bnelr cr7");
@ -142,6 +154,8 @@ fn test_ins_bclr() {
assert_asm!(0x4D860020, "beqlr cr1");
assert_asm!(0x4E800020, "blr");
assert_asm!(0x4E800021, "blrl");
assert_asm!(0x4D000020, "bdnztlr lt");
assert_asm!(0x4C1F0021, "bdnzflrl 4*cr7+so");
}
#[test]
@ -171,9 +185,46 @@ fn test_ins_cntlzw() {
assert_asm!(0x7C030034, "cntlzw r3, r0");
}
#[test]
fn test_ins_crand() {
assert_asm!(0x4C853202, "crand 4*cr1+lt, 4*cr1+gt, 4*cr1+eq");
}
#[test]
fn test_ins_crandc() {
assert_asm!(0x4C642902, "crandc so, 4*cr1+lt, 4*cr1+gt");
}
#[test]
fn test_ins_creqv() {
assert_asm!(0x4CE00A42, "creqv 4*cr1+so, lt, gt");
}
#[test]
fn test_ins_crnand() {
assert_asm!(0x4C2219C2, "crnand gt, eq, so");
}
#[test]
fn test_ins_cror() {
assert_asm!(0x4C411382, "cror eq, gt, eq");
assert_asm!(0x4CA63B82, "cror 4*cr1+gt, 4*cr1+eq, 4*cr1+so");
}
#[test]
fn test_ins_crorc() {
assert_asm!(0x4C432342, "crorc eq, so, 4*cr1+lt");
}
#[test]
fn test_ins_crnor() {
assert_asm!(0x4C011042, "crnor lt, gt, eq");
assert_asm!(0x4CA63042, "crnot 4*cr1+gt, 4*cr1+eq");
}
#[test]
fn test_ins_crxor() {
assert_asm!(0x4CC70182, "crxor 4*cr1+eq, 4*cr1+so, lt");
}
#[test]
@ -634,7 +685,7 @@ fn test_ins_psq_lx() {
rA(GPR(0)),
rB(GPR(0)),
ps_WX(OpaqueU(0)),
ps_IX(GQR(0))
ps_IX(GQR(0)),
]
);
assert_eq!(ins.defs(), vec![frD(FPR(0))]);
@ -802,12 +853,22 @@ fn test_ins_rlwinm() {
// mnemonics
assert_asm!(0x57E5103A, "slwi r5, r31, 2");
assert_asm!(0x54832026, "extlwi r3, r4, 20, 4");
assert_asm!(0x5483AB3E, "extrwi r3, r4, 20, 1");
assert_asm!(0x540027BE, "extrwi r0, r0, 2, 2");
assert_asm!(0x54839B3E, "rlwinm r3, r4, 19, 12, 31");
assert_asm!(0x5483203E, "rotlwi r3, r4, 4");
assert_asm!(0x5483E03E, "rotrwi r3, r4, 4");
assert_asm!(0x5464043E, "clrlwi r4, r3, 16");
assert_asm!(0x54830036, "clrrwi r3, r4, 4");
assert_asm!(0x54640fbc, "clrlslwi r4, r3, 31, 1");
}
#[test]
fn test_ins_rlwnm() {
assert_asm!(0x5D6A67FE, "rlwnm r10, r11, r12, 31, 31");
assert_asm!(0x5FC52EFE, "rlwnm r5, r30, r5, 27, 31");
assert_asm!(0x5FC5283F, "rotlw. r5, r30, r5");
}
#[test]

View File

@ -205,12 +205,9 @@ impl From<&DolHeaderData> for DolHeader {
impl DolHeader {
pub fn section_at(&self, addr: u32) -> Option<&DolSection> {
for section in &self.sections {
if (section.target..(section.target + section.size)).contains(&addr) {
return Some(section);
}
}
None
self.sections.iter()
.find(|&section| (section.target..(section.target + section.size))
.contains(&addr))
}
}

View File

@ -6,7 +6,7 @@ use std::process::{Command, Stdio};
use std::str::FromStr;
use itertools::Itertools;
use proc_macro2::{Ident, Literal, Span, TokenStream, TokenTree};
use proc_macro2::{Group, Ident, Literal, Span, TokenStream, TokenTree};
use quote::quote;
use serde::{Deserialize, Deserializer};
use syn::{LitChar, LitInt, LitStr};
@ -232,7 +232,8 @@ impl Opcode {
pub(crate) struct Mnemonic {
name: String,
opcode: String,
modifiers: Vec<String>,
// Overrides modifier list from opcode
modifiers: Option<Vec<String>>,
args: Vec<String>,
condition: String,
}
@ -243,23 +244,31 @@ pub(crate) struct Modifier {
name: String,
suffix: char,
bit: u8,
condition: String,
}
impl Modifier {
fn express_value_self(&self) -> TokenStream {
fn express_value_self(&self, field_by_name: &HashMap<String, &Field>) -> Result<TokenStream> {
if self.condition.is_empty() {
let modifier_bit = self.bit as usize;
quote!(self.bit(#modifier_bit))
Ok(quote!(self.bit(#modifier_bit)))
} else {
compile_mnemonic_condition(
field_by_name,
&self.condition,
)
}
}
fn construct_accessor(&self) -> TokenStream {
fn construct_accessor(&self, field_by_name: &HashMap<String, &Field>) -> Result<TokenStream> {
let field_variant = to_rust_ident("field_", &self.name);
let value = self.express_value_self();
quote! {
let value = self.express_value_self(field_by_name)?;
Ok(quote! {
#[inline(always)]
pub fn #field_variant(&self) -> bool {
#value
}
}
})
}
}
@ -482,7 +491,7 @@ impl Isa {
});
// Generate modifiers.
let suffix = express_suffix(&modifier_by_name, opcode)?;
let suffix = express_suffix(&modifier_by_name, &field_by_name, &opcode.modifiers)?;
suffix_match_arms.push(quote! {
Opcode::#ident => #suffix,
});
@ -556,21 +565,29 @@ impl Isa {
)?);
// Emit branch.
let mnemonic_lit = LitStr::new(&mnemonic.name, Span::call_site());
// Emit suffix.
let modifiers = mnemonic.modifiers.as_ref().unwrap_or(&opcode.modifiers);
let suffix = express_suffix(&modifier_by_name, &field_by_name, modifiers)?;
// Extract arguments.
let mut args = Vec::new();
for arg in &mnemonic.args {
let (field_name, expression) = arg.split_once('=').unwrap_or((arg, arg));
let field = field_by_name
.get(arg)
.get(field_name)
.unwrap_or_else(|| panic!("field not found: {}", arg));
let variant = Ident::new(field.arg.as_ref().unwrap(), Span::call_site());
let value = field.express_value_self();
args.push(quote!(Argument::#variant(#variant(#value as _)),));
let value = compile_mnemonic_condition(
&field_by_name,
expression,
)?;
args.push(quote!(Argument::#variant(#variant((#value) as _)),));
}
let args = token_stream!(args);
simplified_conditions.push(quote! {
{
return SimplifiedIns {
mnemonic: #mnemonic_lit,
suffix: #suffix,
args: vec![#args],
ins: self,
};
@ -592,11 +609,10 @@ impl Isa {
let simplified_ins_match_arms = token_stream!(simplified_ins_match_arms);
let field_accessors =
TokenStream::from_iter(self.fields.iter().map(|field| field.construct_accessor()));
let modifier_accessors = TokenStream::from_iter(
self.modifiers
let modifiers: Vec<TokenStream> = self.modifiers
.iter()
.map(|modifier| modifier.construct_accessor()),
);
.map(|modifier| modifier.construct_accessor(&field_by_name)).try_collect()?;
let modifier_accessors = TokenStream::from_iter(modifiers);
// Generate final fields function.
let ins_impl = quote! {
#[allow(clippy::all, unused_mut)]
@ -701,31 +717,41 @@ fn compile_mnemonic_condition(
code: &str,
) -> Result<TokenStream> {
let src_stream = TokenStream::from_str(code)?;
let token_iter = src_stream.into_iter().flat_map(|token| {
if let TokenTree::Ident(ref ident) = token {
fn map_ident(field_by_name: &HashMap<String, &Field>, token: TokenTree) -> TokenStream {
match token {
TokenTree::Ident(ref ident) => {
if let Some(field) = field_by_name.get(&ident.to_string()) {
return field.express_value_self();
}
}
TokenTree::Group(ref group) => {
let iter = group.stream().into_iter().flat_map(|token| map_ident(field_by_name, token));
let stream = TokenStream::from_iter(iter);
return TokenStream::from(TokenTree::Group(Group::new(group.delimiter(), stream)));
}
_ => {}
}
token.into()
});
}
let token_iter = src_stream.into_iter().flat_map(|token| map_ident(field_by_name, token));
Ok(TokenStream::from_iter(token_iter))
}
fn express_suffix(
modifier_by_name: &HashMap<String, &Modifier>,
opcode: &Opcode,
field_by_name: &HashMap<String, &Field>,
modifiers: &[String],
) -> Result<TokenStream> {
Ok(if opcode.modifiers.is_empty() {
Ok(if modifiers.is_empty() {
quote!(String::new())
} else {
let mut chars = Vec::new();
for mod_name in &opcode.modifiers {
for mod_name in modifiers {
let modifier: &Modifier = modifier_by_name
.get(mod_name)
.ok_or_else(|| Error::from(format!("undefined modifier {}", mod_name)))?;
let lit_char = LitChar::new(modifier.suffix, Span::call_site());
let modifier_bit = modifier.express_value_self();
let modifier_bit = modifier.express_value_self(field_by_name)?;
chars.push(quote! {
if #modifier_bit {
s.push(#lit_char);

261
isa.yaml
View File

@ -20,7 +20,7 @@ fields:
arg: OpaqueU
bits: 6..11
- name: BI
arg: OpaqueU
arg: CRBit
bits: 11..16
- name: BH
arg: OpaqueU
@ -175,6 +175,18 @@ modifiers:
- name: AA
suffix: a
bit: 30
# Predict branch to be taken
- name: BP
suffix: +
condition: BO & 1 == 1 && BD >= 0
# Predict branch not to be taken (fall through)
- name: BNP
suffix: '-'
condition: BO & 1 == 1 && BD < 0
# Predict branch to be taken (implicit dest for LR/CTR)
- name: BP_ND
suffix: +
condition: BO & 1 == 1
opcodes:
- name: add
@ -302,14 +314,14 @@ opcodes:
desc: Branch Conditional
bitmask: 0xfc000000
pattern: 0x40000000
modifiers: [ LK, AA ]
modifiers: [ LK, AA, BP, BNP ]
args: [ BO, BI, BD ]
- name: bcctr
desc: Branch Conditional to Count Register
bitmask: 0xfc007ffe
pattern: 0x4c000420
modifiers: [ LK ]
modifiers: [ LK, BP_ND ]
args: [ BO, BI, BH ]
uses: [ ctr ]
@ -317,7 +329,7 @@ opcodes:
desc: Branch Conditional to Link Register
bitmask: 0xfc007ffe
pattern: 0x4c000020
modifiers: [ LK ]
modifiers: [ LK, BP_ND ]
args: [ BO, BI, BH ]
uses: [ lr ]
@ -1974,14 +1986,34 @@ mnemonics:
condition: rA == 0 && rS == 0 && uimm == 0
# Rotates/Shifts
- name: rotlw
opcode: rlwnm
args: [ rA, rS, rB ]
condition: MB == 0 && ME == 31
# TODO rlwimi: inslwi/insrwi
# Rotates/Shifts Immediate
- name: clrrwi
opcode: rlwinm
args: [ rA, rS, ME=31-ME ]
condition: SH == 0 && MB == 0 && ME < 32
- name: clrlwi
opcode: rlwinm
args: [ rA, rS, MB ]
condition: SH == 0 && ME == 31
- name: clrlslwi
opcode: rlwinm
args: [ rA, rS, MB=32-SH, SH ]
condition: SH < 32 && MB >= SH && ME == 31 - SH
- name: rotlwi
opcode: rlwinm
args: [ rA, rS, SH ]
condition: MB == 0 && ME == 31
condition: MB == 0 && ME == 31 && SH <= 16
- name: rotrwi
opcode: rlwinm
args: [ rA, rS, SH=32-SH ]
condition: MB == 0 && ME == 31 && SH > 16
- name: slwi
opcode: rlwinm
args: [ rA, rS, SH ]
@ -1990,6 +2022,14 @@ mnemonics:
opcode: rlwinm
args: [ rA, rS, MB ]
condition: ME == 31 && 32 - MB == SH
- name: extlwi
opcode: rlwinm
args: [ rA, rS, ME=ME+1, SH ]
condition: MB == 0
- name: extrwi
opcode: rlwinm
args: [ rA, rS, MB=32-MB, SH=SH-(32-MB) ]
condition: ME == 31 && SH >= 32 - MB
# Compares Word
- name: cmpwi
@ -2070,11 +2110,11 @@ mnemonics:
condition: crbD == crbA && crbD == crbB
- name: crmove
opcode: cror
args: [ crbD, crbA, crbB ]
args: [ crbD, crbA ]
condition: crbA == crbB
- name: crnot
opcode: crnor
args: [ crbD, crbA, crbB ]
args: [ crbD, crbA ]
condition: crbA == crbB
# Misc
@ -2223,111 +2263,109 @@ mnemonics:
condition: spr & 0b1111111001 == 537
# Branch Conditional
# bc branch always
- name: b
opcode: bc
modifiers: [ LK, AA ]
condition: BO == 20 && BI == 0
# bc branch if negative
- name: blt
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 12 && BI & 0b11 == 0b00 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 0
- name: blt
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 12 && BI & 0b11 == 0b00
condition: BO & 0b11110 == 12 && BI & 0b11 == 0
# bc branch if not positive
- name: ble
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 4 && BI & 0b11 == 0b01 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 1
- name: ble
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 4 && BI & 0b11 == 0b01
condition: BO & 0b11110 == 4 && BI & 0b11 == 1
# bc branch if zero
- name: beq
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 12 && BI & 0b11 == 0b10 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 2
- name: beq
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 12 && BI & 0b11 == 0b10
condition: BO & 0b11110 == 12 && BI & 0b11 == 2
# bc branch if not negative
- name: bge
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 4 && BI & 0b11 == 0b00 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 0
- name: bge
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 4 && BI & 0b11 == 0b00
condition: BO & 0b11110 == 4 && BI & 0b11 == 0
# bc branch if positive
- name: bgt
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 12 && BI & 0b11 == 0b01 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 1
- name: bgt
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 12 && BI & 0b11 == 0b01
condition: BO & 0b11110 == 12 && BI & 0b11 == 1
# bc branch if not zero
- name: bne
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 4 && BI & 0b11 == 0b10 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 2
- name: bne
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 4 && BI & 0b11 == 0b10
condition: BO & 0b11110 == 4 && BI & 0b11 == 2
# bc branch if summary overflow
- name: bso
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 12 && BI & 0b11 == 0b11 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 3
- name: bso
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 12 && BI & 0b11 == 0b11
condition: BO & 0b11110 == 12 && BI & 0b11 == 3
# bc branch if not summary overflow
- name: bns
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 4 && BI & 0b11 == 0b11 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 3
- name: bns
opcode: bc
modifiers: [ LK, AA ]
args: [ crfS, BD ]
condition: BO == 4 && BI & 0b11 == 0b11
condition: BO & 0b11110 == 4 && BI & 0b11 == 3
# bc decrement CTR, branch if CTR non-zero
- name: bdnz
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 16 && BI == 0
condition: BO & 0b11110 == 16 && BI == 0
# bc decrement CTR, branch if CTR non-zero AND condition true
- name: bdnzt
opcode: bc
args: [ BI, BD ]
condition: BO & 0b11110 == 8
# bc decrement CTR, branch if CTR non-zero AND condition false
- name: bdnzf
opcode: bc
args: [ BI, BD ]
condition: BO & 0b11110 == 0
# bc decrement CTR, branch if CTR zero
- name: bdz
opcode: bc
modifiers: [ LK, AA ]
args: [ BD ]
condition: BO == 18 && BI == 0
# TODO support conditional bd...
condition: BO & 0b11110 == 18 && BI == 0
# bc decrement CTR, branch if CTR zero AND condition true
- name: bdzt
opcode: bc
args: [ BI, BD ]
condition: BO & 0b11110 == 10
# bc decrement CTR, branch if CTR zero AND condition false
- name: bdzf
opcode: bc
args: [ BI, BD ]
condition: BO & 0b11110 == 2
# Branch Conditional to Count Register
# bcctr branch always
@ -2338,86 +2376,69 @@ mnemonics:
# bcctr branch if negative
- name: bltctr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b00 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 0
- name: bltctr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b00
condition: BO & 0b11110 == 12 && BI & 0b11 == 0
# bcctr branch if not positive
- name: blectr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b01 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 1
- name: blectr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b01
condition: BO & 0b11110 == 4 && BI & 0b11 == 1
# bcctr branch if zero
- name: beqctr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b10 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 2
- name: beqctr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b10
condition: BO & 0b11110 == 12 && BI & 0b11 == 2
# bcctr branch if not negative
- name: bgectr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b00 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 0
- name: bgectr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b00
condition: BO & 0b11110 == 4 && BI & 0b11 == 0
# bcctr branch if positive
- name: bgtctr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b01 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 1
- name: bgtctr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b01
condition: BO & 0b11110 == 12 && BI & 0b11 == 1
# bcctr branch if not zero
- name: bnectr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b10 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 2
- name: bnectr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b10
condition: BO & 0b11110 == 4 && BI & 0b11 == 2
# bcctr branch if summary overflow
- name: bsoctr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b11 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 3
- name: bsoctr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b11
condition: BO & 0b11110 == 12 && BI & 0b11 == 3
# bcctr branch if not summary overflow
- name: bnsctr
opcode: bcctr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b11 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 3
- name: bnsctr
opcode: bcctr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b11
condition: BO & 0b11110 == 4 && BI & 0b11 == 3
# Branch Conditional to Link Register
# bclr branch always
- name: blr
opcode: bclr
@ -2426,80 +2447,92 @@ mnemonics:
# bclr branch if negative
- name: bltlr
opcode: bclr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b00 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 0
- name: bltlr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b00
condition: BO & 0b11110 == 12 && BI & 0b11 == 0
# bclr branch if not positive
- name: blelr
opcode: bclr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b01 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 1
- name: blelr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b01
condition: BO & 0b11110 == 4 && BI & 0b11 == 1
# bclr branch if zero
- name: beqlr
opcode: bclr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b10 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 2
- name: beqlr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b10
condition: BO & 0b11110 == 12 && BI & 0b11 == 2
# bclr branch if not negative
- name: bgelr
opcode: bclr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b00 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 0
- name: bgelr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b00
condition: BO & 0b11110 == 4 && BI & 0b11 == 0
# bclr branch if positive
- name: bgtlr
opcode: bclr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b01 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 1
- name: bgtlr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b01
condition: BO & 0b11110 == 12 && BI & 0b11 == 1
# bclr branch if not zero
- name: bnelr
opcode: bclr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b10 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 2
- name: bnelr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b10
condition: BO & 0b11110 == 4 && BI & 0b11 == 2
# bclr branch if summary overflow
- name: bsolr
opcode: bclr
modifiers: [ LK ]
condition: BO == 12 && BI & 0b11 == 0b11 && crfS == 0
condition: BO & 0b11110 == 12 && BI == 3
- name: bsolr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 12 && BI & 0b11 == 0b11
condition: BO & 0b11110 == 12 && BI & 0b11 == 3
# bclr branch if not summary overflow
- name: bnslr
opcode: bclr
modifiers: [ LK ]
condition: BO == 4 && BI & 0b11 == 0b11 && crfS == 0
condition: BO & 0b11110 == 4 && BI == 3
- name: bnslr
opcode: bclr
modifiers: [ LK ]
args: [ crfS ]
condition: BO == 4 && BI & 0b11 == 0b11
condition: BO & 0b11110 == 4 && BI & 0b11 == 3
# bclr decrement CTR, branch if CTR non-zero
- name: bdnzlr
opcode: bclr
condition: BO & 0b11110 == 16 && BI == 0
# bclr decrement CTR, branch if CTR non-zero AND condition true
- name: bdnztlr
opcode: bclr
args: [ BI ]
condition: BO & 0b11110 == 8
# bclr decrement CTR, branch if CTR non-zero AND condition false
- name: bdnzflr
opcode: bclr
args: [ BI ]
condition: BO & 0b11110 == 0
# bclr decrement CTR, branch if CTR zero
- name: bdzlr
opcode: bclr
condition: BO & 0b11110 == 18 && BI == 0
# bclr decrement CTR, branch if CTR zero AND condition true
- name: bdztlr
opcode: bclr
args: [ BI ]
condition: BO & 0b11110 == 10
# bclr decrement CTR, branch if CTR zero AND condition false
- name: bdzflr
opcode: bclr
args: [ BI ]
condition: BO & 0b11110 == 0