blob: acea600fbb0da4855f2af76550ce7ed7732fb2ab [file] [log] [blame]
Chris Lattner8c6a41e2006-11-17 22:10:59 +00001//===-- PPCPredicates.h - PPC Branch Predicate Information ------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattnerf3ebc3f2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Chris Lattner8c6a41e2006-11-17 22:10:59 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This file describes the PowerPC branch predicates.
11//
12//===----------------------------------------------------------------------===//
13
Benjamin Kramera7c40ef2014-08-13 16:26:38 +000014#ifndef LLVM_LIB_TARGET_POWERPC_MCTARGETDESC_PPCPREDICATES_H
15#define LLVM_LIB_TARGET_POWERPC_MCTARGETDESC_PPCPREDICATES_H
Chris Lattner8c6a41e2006-11-17 22:10:59 +000016
Rafael Espindolafb8ac2d2012-12-20 05:13:09 +000017// GCC #defines PPC on Linux but we use it as our namespace name
18#undef PPC
19
Sylvestre Ledru37ef20d2013-03-17 12:40:42 +000020// Generated files will use "namespace PPC". To avoid symbol clash,
21// undefine PPC here. PPC may be predefined on some hosts.
22#undef PPC
23
Chris Lattner8c6a41e2006-11-17 22:10:59 +000024namespace llvm {
25namespace PPC {
26 /// Predicate - These are "(BI << 5) | BO" for various predicates.
27 enum Predicate {
Ulrich Weigand86247b62013-06-24 16:52:04 +000028 PRED_LT = (0 << 5) | 12,
29 PRED_LE = (1 << 5) | 4,
30 PRED_EQ = (2 << 5) | 12,
31 PRED_GE = (0 << 5) | 4,
32 PRED_GT = (1 << 5) | 12,
33 PRED_NE = (2 << 5) | 4,
34 PRED_UN = (3 << 5) | 12,
35 PRED_NU = (3 << 5) | 4,
36 PRED_LT_MINUS = (0 << 5) | 14,
37 PRED_LE_MINUS = (1 << 5) | 6,
38 PRED_EQ_MINUS = (2 << 5) | 14,
39 PRED_GE_MINUS = (0 << 5) | 6,
40 PRED_GT_MINUS = (1 << 5) | 14,
41 PRED_NE_MINUS = (2 << 5) | 6,
42 PRED_UN_MINUS = (3 << 5) | 14,
43 PRED_NU_MINUS = (3 << 5) | 6,
44 PRED_LT_PLUS = (0 << 5) | 15,
45 PRED_LE_PLUS = (1 << 5) | 7,
46 PRED_EQ_PLUS = (2 << 5) | 15,
47 PRED_GE_PLUS = (0 << 5) | 7,
48 PRED_GT_PLUS = (1 << 5) | 15,
49 PRED_NE_PLUS = (2 << 5) | 7,
50 PRED_UN_PLUS = (3 << 5) | 15,
Hal Finkel940ab932014-02-28 00:27:01 +000051 PRED_NU_PLUS = (3 << 5) | 7,
52
53 // When dealing with individual condition-register bits, we have simple set
54 // and unset predicates.
Hal Finkelb39a0472014-02-28 00:45:27 +000055 PRED_BIT_SET = 1024,
56 PRED_BIT_UNSET = 1025
Chris Lattner8c6a41e2006-11-17 22:10:59 +000057 };
58
Hal Finkel65539e32015-12-12 00:32:00 +000059 // Bit for branch taken (plus) or not-taken (minus) hint
60 enum BranchHintBit {
61 BR_NO_HINT = 0x0,
62 BR_NONTAKEN_HINT = 0x2,
63 BR_TAKEN_HINT = 0x3,
64 BR_HINT_MASK = 0X3
65 };
66
Chris Lattner8c6a41e2006-11-17 22:10:59 +000067 /// Invert the specified predicate. != -> ==, < -> >=.
68 Predicate InvertPredicate(Predicate Opcode);
Hal Finkel0f64e212013-04-20 05:16:26 +000069
70 /// Assume the condition register is set by MI(a,b), return the predicate if
71 /// we modify the instructions such that condition register is set by MI(b,a).
72 Predicate getSwappedPredicate(Predicate Opcode);
Alexander Kornienkof00654e2015-06-23 09:49:53 +000073}
74}
Chris Lattner8c6a41e2006-11-17 22:10:59 +000075
76#endif