| /external/eigen/blas/ |
| lsame.f | 56 IF (INTA.GE.97 .AND. INTA.LE.122) INTA = INTA - 32
57 IF (INTB.GE.97 .AND. INTB.LE.122) INTB = INTB - 32
64 IF (INTA.GE.129 .AND. INTA.LE.137 .OR.
65 + INTA.GE.145 .AND. INTA.LE.153 .OR.
66 + INTA.GE.162 .AND. INTA.LE.169) INTA = INTA + 64
67 IF (INTB.GE.129 .AND. INTB.LE.137 .OR.
68 + INTB.GE.145 .AND. INTB.LE.153 .OR.
69 + INTB.GE.162 .AND. INTB.LE.169) INTB = INTB + 64
76 IF (INTA.GE.225 .AND. INTA.LE.250) INTA = INTA - 32
77 IF (INTB.GE.225 .AND. INTB.LE.250) INTB = INTB - 3
[all...] |
| drotmg.f | 86 IF (.NOT.DU.LE.ZERO) GO TO 30
142 IF (.NOT.DD1.LE.RGAMSQ) GO TO 130
167 IF (.NOT.DABS(DD2).LE.RGAMSQ) GO TO 190
|
| srotmg.f | 88 IF (.NOT.SU.LE.ZERO) GO TO 30
144 IF (.NOT.SD1.LE.RGAMSQ) GO TO 130
169 IF (.NOT.ABS(SD2).LE.RGAMSQ) GO TO 190
|
| /external/clang/include/clang/AST/ |
| EvaluatedExprVisitor.h | 75 void VisitLambdaExpr(LambdaExpr *LE) {
77 for (LambdaExpr::capture_init_iterator I = LE->capture_init_begin(),
78 E = LE->capture_init_end();
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTX.h | 38 LE,
52 case NVPTXCC::LE:
53 return "le";
157 LE,
|
| /external/llvm/lib/Target/Mips/ |
| Mips16HardFloat.cpp | 180 bool LE, bool ToFP) {
193 if (LE) {
202 if (LE) {
211 if (LE) {
224 if (LE) {
247 bool LE = Subtarget.isLittle();
269 swapFPIntParams(PV, M, IAH, LE, true);
282 if (LE) {
291 if (LE) {
300 if (LE) {
[all...] |
| /external/dexmaker/src/main/java/com/google/dexmaker/ |
| Comparison.java | 36 LE() {
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| ErlangGCPrinter.cpp | 113 LE = MD.live_end(PI);
114 LI != LE; ++LI) {
|
| /external/valgrind/main/none/tests/s390x/ |
| cgij.c | 23 #define LE C
62 CGIJ(7,LE,8,2a) "\n\t" /* 0x2a == 42 */
|
| cij.c | 23 #define LE C
62 CIJ(7,LE,8,2a) "\n\t" /* 0x2a == 42 */
|
| clgij.c | 23 #define LE C
62 CLGIJ(7,LE,8,2a) "\n\t" /* 0x2a == 42 */
|
| clij.c | 23 #define LE C
62 CLIJ(7,LE,8,2a) "\n\t" /* 0x2a == 42 */
|
| cgrj.c | 23 #define LE C
67 CGRJ(7,8,8,LE) "\n\t"
|
| clgrj.c | 23 #define LE C
67 CLGRJ(7,8,8,LE) "\n\t"
|
| clrj.c | 23 #define LE C
67 CLRJ(7,8,8,LE) "\n\t"
|
| crj.c | 23 #define LE C
67 CRJ(7,8,8,LE) "\n\t"
|
| /frameworks/av/include/media/stagefright/foundation/ |
| ADebug.h | 53 MAKE_COMPARATOR(LE,<=)
73 #define CHECK_LE(x,y) CHECK_OP(x,y,LE,<=)
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 114 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
115 LI != LE; ++LI) {
207 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
208 LI != LE; ++LI) {
229 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end();
230 LI != LE; ++LI)
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 195 BasicBlock::iterator LI = L->begin(), LE = L->end();
201 assert(LI != LE && RI != R->end());
216 } while (LI != LE); // This is sufficient: we can't get equality of
221 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI)
467 LI = L->arg_begin(), LE = L->arg_end(),
469 LI != LE && RI != RE; ++LI, ++RI)
491 BasicBlock::iterator LE = LStart->getParent()->end();
494 unsigned NL = std::distance(LStart, LE);
522 for (BasicBlock::iterator LI = LStart; LI != LE; ++LI, ++Index) {
566 assert(LI != LE && RI != RE)
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFCompileUnit.h | 48 const RelocAddrMap *M, bool LE) :
51 AddrOffsetSection(AOS), RelocMap(M), isLittleEndian(LE) {
|
| /external/javassist/src/main/javassist/compiler/ |
| TokenId.java | 75 int LE = 357; // <=
|
| /external/llvm/lib/Target/ARM/MCTargetDesc/ |
| ARMBaseInfo.h | 43 LE, // Less than or equal <, ==, or unordered
62 case GT: return LE;
63 case LE: return GT;
83 case ARMCC::LE: return "le";
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
| TestExpressionFeatures.g3 | 64 LE = '<=';
|
| /dalvik/vm/compiler/codegen/x86/libenc/ |
| enc_defs_ext.h | 116 CCM(CMOV,LE), CCM(CMOV,NG),
230 CCM(J,LE), CCM(J,NG),
291 CCM(SET,LE), CCM(SET,NG),
|
| /ndk/sources/host-tools/nawk-20071023/ |
| maketab.c | 48 { LE, "relop", " <= " },
|
