/external/libyuv/files/source/ |
D | row_common.cc | 1074 #define UB -128 /* max(-128, round(-2.018 * 64)) */ macro 1080 #define BB (UB * 128 + YGB) 1086 {-UB, -VR, -UB, -VR, -UB, -VR, -UB, -VR}, 1087 {-UB, -VR, -UB, -VR, -UB, -VR, -UB, -VR}, 1093 {-VR, -UB, -VR, -UB, -VR, -UB, -VR, -UB}, 1094 {-VR, -UB, -VR, -UB, -VR, -UB, -VR, -UB}, 1101 {-UB, -UB, -UB, -UB, -VR, -VR, -VR, -VR, 0, 0, 0, 0, 0, 0, 0, 0}, 1106 {-VR, -VR, -VR, -VR, -UB, -UB, -UB, -UB, 0, 0, 0, 0, 0, 0, 0, 0}, 1112 {UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, 1113 UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0}, [all …]
|
/external/libvpx/libvpx/third_party/libyuv/source/ |
D | row_common.cc | 1074 #define UB -128 /* max(-128, round(-2.018 * 64)) */ macro 1080 #define BB (UB * 128 + YGB) 1086 {-UB, -VR, -UB, -VR, -UB, -VR, -UB, -VR}, 1087 {-UB, -VR, -UB, -VR, -UB, -VR, -UB, -VR}, 1093 {-VR, -UB, -VR, -UB, -VR, -UB, -VR, -UB}, 1094 {-VR, -UB, -VR, -UB, -VR, -UB, -VR, -UB}, 1101 {-UB, -UB, -UB, -UB, -VR, -VR, -VR, -VR, 0, 0, 0, 0, 0, 0, 0, 0}, 1106 {-VR, -VR, -VR, -VR, -UB, -UB, -UB, -UB, 0, 0, 0, 0, 0, 0, 0, 0}, 1112 {UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, 1113 UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0}, [all …]
|
/external/llvm-project/polly/test/ScopInfo/ |
D | invariant_loads_complicated_dependences.ll | 5 ; CHECK-NEXT: [LB, UB] -> { Stmt_for_body[i0] -> MemRef_LBptr[0] }; 6 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : } 8 ; CHECK-NEXT: [LB, UB] -> { Stmt_do_cond[i0, i1] -> MemRef_UBptr[0] }; 9 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : } 11 ; CHECK-NEXT: [LB, UB] -> { Stmt_if_then[i0, i1] -> MemRef_V[0] }; 12 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : LB >= 6 or (UB > LB and UB >= 6) } 14 ; CHECK-NEXT: [LB, UB] -> { Stmt_if_else[i0, i1] -> MemRef_U[0] }; 15 ; CHECK-NEXT: Execution Context: [LB, UB] -> { : LB <= 5 } 18 ; void f(int *restrict A, int *restrict V, int *restrict U, int *restrict UB, 27 ; } while (j++ < /* invariant load */ *UB); [all …]
|
D | invariant_loads_cyclic_dependences.ll | 3 ; Negative test. If we assume UB[*V] to be invariant we get a cyclic 6 ; that the access happened. However, at the moment we assume UB[*V] 12 ; void f(int *restrict V, int *restrict UB, int *restrict A) { 17 ; x = /* invariant load dependent on UB[*V] */ *V; 19 ; } while (j++ < /* invariant load dependent on *V */ UB[x]); 25 define void @f(i32* noalias %V, i32* noalias %UB, i32* noalias %A) { 49 %arrayidx3 = getelementptr inbounds i32, i32* %UB, i32 %tmp
|
D | invariant_load_loop_ub.ll | 8 ; void f(int *A, int *UB) { 9 ; for (int i = 0; i < *UB; i++) 15 define void @f(i32* %A, i32* %UB) { 21 %tmp = load i32, i32* %UB, align 4
|
/external/llvm-project/polly/lib/CodeGen/ |
D | LoopGeneratorsKMP.cpp | 22 Value *LB, Value *UB, in createCallSpawnThreads() argument 56 UB, in createCallSpawnThreads() 65 Value *LB, Value *UB, in deployParallelExecution() argument 74 createCallSpawnThreads(SubFn, SubFnParam, LB, UB, Stride); in deployParallelExecution() 171 Value *UB = &*AI; in createSubFn() local 188 Builder.CreateAlignedStore(UB, UBPtr, Alignment); in createSubFn() 194 Value *AdjustedUB = Builder.CreateAdd(UB, ConstantInt::get(LongType, -1), in createSubFn() 209 UB = AdjustedUB; in createSubFn() 210 createCallDispatchInit(ID, LB, UB, Stride, ChunkSize); in createSubFn() 227 UB = Builder.CreateAlignedLoad(UBPtr, Alignment, "polly.indvar.UB"); in createSubFn() [all …]
|
D | LoopGeneratorsGOMP.cpp | 22 Value *LB, Value *UB, in createCallSpawnThreads() argument 45 LB, UB, Stride}; in createCallSpawnThreads() 52 Value *LB, Value *UB, in deployParallelExecution() argument 55 createCallSpawnThreads(SubFn, SubFnParam, LB, UB, Stride); in deployParallelExecution() 146 Value *UB = Builder.CreateLoad(UBPtr, "polly.par.UB"); in createSubFn() local 150 UB = Builder.CreateSub(UB, ConstantInt::get(LongType, 1), in createSubFn() 157 createLoop(LB, UB, Stride, Builder, LI, DT, AfterBB, ICmpInst::ICMP_SLE, in createSubFn()
|
D | LoopGenerators.cpp | 82 Value *polly::createLoop(Value *LB, Value *UB, Value *Stride, in createLoop() argument 91 assert(LB->getType() == UB->getType() && "Types of loop bounds do not match"); in createLoop() 92 IntegerType *LoopIVType = dyn_cast<IntegerType>(UB->getType()); in createLoop() 136 LoopGuard = Builder.CreateICmp(Predicate, LB, UB); in createLoop() 157 Builder.CreateICmp(Predicate, IncrementedIV, UB, "polly.loop_cond"); in createLoop() 176 Value *LB, Value *UB, Value *Stride, SetVector<Value *> &UsedValues, in createParallelLoop() argument 193 UB = Builder.CreateAdd(UB, ConstantInt::get(LongType, 1)); in createParallelLoop() 196 deployParallelExecution(SubFn, SubFnParam, LB, UB, Stride); in createParallelLoop()
|
/external/igt-gpu-tools/assembler/doc/examples/ |
D | packed_yuv_wm.g4a | 24 add (1) g4.4<1>F g1.8<0,1,0>UW 1UB { align1 }; 26 add (1) g4.12<1>F g1.8<0,1,0>UW 1UB { align1 }; 30 add (1) g6.8<1>F g1.10<0,1,0>UW 1UB { align1 }; 31 add (1) g6.12<1>F g1.10<0,1,0>UW 1UB { align1 }; 34 add (1) g4.20<1>F g1.12<0,1,0>UW 1UB { align1 }; 36 add (1) g4.28<1>F g1.12<0,1,0>UW 1UB { align1 }; 40 add (1) g6.24<1>F g1.14<0,1,0>UW 1UB { align1 }; 41 add (1) g6.28<1>F g1.14<0,1,0>UW 1UB { align1 }; 44 add (1) g5.4<1>F g1.16<0,1,0>UW 1UB { align1 }; 46 add (1) g5.12<1>F g1.16<0,1,0>UW 1UB { align1 }; [all …]
|
/external/protobuf/java/core/src/main/java/com/google/protobuf/ |
D | ExtensionSchema.java | 61 abstract <UT, UB> UB parseExtension( in parseExtension() 66 UB unknownFields, in parseExtension() 67 UnknownFieldSchema<UT, UB> unknownFieldSchema) in parseExtension()
|
D | MessageSetSchema.java | 125 private <UT, UB> void writeUnknownFieldsHelper( in writeUnknownFieldsHelper() 126 UnknownFieldSchema<UT, UB> unknownFieldSchema, T message, Writer writer) throws IOException { in writeUnknownFieldsHelper() 235 private <UT, UB, ET extends FieldSet.FieldDescriptorLite<ET>> void mergeFromHelper( in mergeFromHelper() 236 UnknownFieldSchema<UT, UB> unknownFieldSchema, in mergeFromHelper() 242 UB unknownFields = unknownFieldSchema.getBuilderFromMessage(message); in mergeFromHelper() 273 private <UT, UB, ET extends FieldSet.FieldDescriptorLite<ET>> 279 UnknownFieldSchema<UT, UB> unknownFieldSchema, in parseMessageSetItemOrUnknownField() 280 UB unknownFields) in parseMessageSetItemOrUnknownField() 387 private <UT, UB> int getUnknownFieldsSerializedSize( in getUnknownFieldsSerializedSize() 388 UnknownFieldSchema<UT, UB> schema, T message) { in getUnknownFieldsSerializedSize()
|
D | SchemaUtil.java | 894 static <T, UT, UB> void mergeUnknownFields( in mergeUnknownFields() 895 UnknownFieldSchema<UT, UB> schema, T message, T other) { in mergeUnknownFields() 903 static <UT, UB> UB filterUnknownEnumList( in filterUnknownEnumList() 907 UB unknownFields, in filterUnknownEnumList() 908 UnknownFieldSchema<UT, UB> unknownFieldSchema) { in filterUnknownEnumList() 943 static <UT, UB> UB filterUnknownEnumList( in filterUnknownEnumList() 947 UB unknownFields, in filterUnknownEnumList() 948 UnknownFieldSchema<UT, UB> unknownFieldSchema) { in filterUnknownEnumList() 983 static <UT, UB> UB storeUnknownEnum( in storeUnknownEnum() 984 int number, int enumValue, UB unknownFields, UnknownFieldSchema<UT, UB> unknownFieldSchema) { in storeUnknownEnum()
|
/external/llvm-project/polly/test/Isl/CodeGen/ |
D | invariant_load_loop_ub.ll | 5 ; void f(int *A, int *UB) { 6 ; for (int i = 0; i < *UB; i++) 12 define void @f(i32* %A, i32* %UB) { 18 %tmp = load i32, i32* %UB, align 4
|
/external/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.ctor/ |
D | move_convert.runtime.pass.cpp | 53 using UB = std::unique_ptr<B[]>; in test_sfinae() typedef 54 static_assert(!std::is_constructible<UA, UB&&>::value, ""); in test_sfinae() 58 using UB = std::unique_ptr<B[], GenericConvertingDeleter<1> >; in test_sfinae() typedef 59 static_assert(!std::is_constructible<UA, UB&&>::value, ""); in test_sfinae()
|
/external/llvm-project/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.ctor/ |
D | move_convert.runtime.pass.cpp | 53 using UB = std::unique_ptr<B[]>; in test_sfinae() typedef 54 static_assert(!std::is_constructible<UA, UB&&>::value, ""); in test_sfinae() 58 using UB = std::unique_ptr<B[], GenericConvertingDeleter<1> >; in test_sfinae() typedef 59 static_assert(!std::is_constructible<UA, UB&&>::value, ""); in test_sfinae()
|
/external/llvm-project/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.asgn/ |
D | move_convert.single.pass.cpp | 78 using UB = std::unique_ptr<B>; in test_sfinae() typedef 82 static_assert(std::is_assignable<UA, UB&&>::value, ""); in test_sfinae() 83 static_assert(!std::is_assignable<UA, UB&>::value, ""); in test_sfinae() 84 static_assert(!std::is_assignable<UA, const UB&>::value, ""); in test_sfinae() 88 static_assert(!std::is_assignable<UAD, UB&&>::value, ""); in test_sfinae()
|
/external/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.asgn/ |
D | move_convert.single.pass.cpp | 78 using UB = std::unique_ptr<B>; in test_sfinae() typedef 82 static_assert(std::is_assignable<UA, UB&&>::value, ""); in test_sfinae() 83 static_assert(!std::is_assignable<UA, UB&>::value, ""); in test_sfinae() 84 static_assert(!std::is_assignable<UA, const UB&>::value, ""); in test_sfinae() 88 static_assert(!std::is_assignable<UAD, UB&&>::value, ""); in test_sfinae()
|
/external/libaom/libaom/third_party/libyuv/source/ |
D | row_gcc.cc | 1437 #define UB -128 /* max(-128, round(-2.018 * 64)) */ macro 1443 #define BB (UB * 128 + YGB) 1449 { UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, 1450 UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0 }, 1463 { 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 1464 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB, 0, UB }, 1477 #undef UB
|
/external/llvm-project/polly/include/polly/CodeGen/ |
D | LoopGeneratorsKMP.h | 70 Value *UB, Value *Stride); 73 Value *UB, Value *Stride) override; 101 void createCallDispatchInit(Value *GlobalThreadID, Value *LB, Value *UB,
|
/external/walt/hardware/enclosure/ |
D | WALT_recessed_enclosure.stl | 21 …UB꼱@�@��UB���@�@��UB���@��L@V��2��<��UB���@��L@��UB���@�@)�UBy�@�@����…
|
/external/igt-gpu-tools/assembler/test/ |
D | regtype.g4a | 4 .default_register_type :UB 6 .default_register_type UB
|
/external/mesa3d/src/intel/tools/tests/gen7/ |
D | or.asm | 17 or(1) g113.21<1>UB g59<0,1,0>UB g59.16<0,1,0>UB { align1 WE_all 1N };
|
/external/llvm/lib/Analysis/ |
D | ObjCARCAliasAnalysis.cpp | 58 const Value *UB = GetUnderlyingObjCPtr(SB, DL); in alias() local 59 if (UA != SA || UB != SB) { in alias() 60 Result = AAResultBase::alias(MemoryLocation(UA), MemoryLocation(UB)); in alias()
|
/external/mesa3d/src/intel/tools/tests/gen7.5/ |
D | or.asm | 20 or(1) g113.21<1>UB g16<0,1,0>UB g16.16<0,1,0>UB { align1 WE_all 1N };
|
/external/llvm-project/mlir/test/Transforms/ |
D | scf-loop-unroll.mlir | 38 // CHECK-NEXT: %[[UB:.*]] = subi %[[N]], %[[REM]] 39 // CHECK-NEXT: %[[SUM:.*]]:2 = scf.for {{.*}} = %[[C0]] to %[[UB]] step %[[C3]] iter_args 41 …// CHECK-NEXT: %[[SUM1:.*]]:2 = scf.for {{.*}} = %[[UB]] to %[[N]] step %[[C1]] iter_args(%[[V1:.*…
|