| /external/mesa3d/docs/relnotes/ |
| D | 10.4.3.rst | 38 r600g+nine: Bioshock shader failure after
49 - st/nine: Add new texture format strings
50 - st/nine: Correctly advertise D3DPMISCCAPS_CLIPTLVERTS
51 - st/nine: NineBaseTexture9: fix setting of last_layer
52 - st/nine: CubeTexture: fix GetLevelDesc
53 - st/nine: Fix crash when deleting non-implicit swapchain
54 - st/nine: Return D3DERR_INVALIDCALL when trying to create a texture of
56 - st/nine: NineBaseTexture9: update sampler view creation
57 - st/nine: Check if srgb format is supported before trying to use it.
58 - st/nine: Add ATI1 and ATI2 support
[all …]
|
| D | 18.0.1.rst | 36 - mesa-17.2.0/src/gallium/state_trackers/nine/nine_ff.c:1938: bad
44 - Hang when running nine ff lighting shader with radeonsi
69 - st/nine: Fix bad tracking of vs textures for NINESBT_ALL
70 - st/nine: Fixes warning about implicit conversion
71 - st/nine: Fix non inversible matrix check
72 - st/nine: Declare lighting consts for ff shaders
73 - st/nine: Do not use scratch for face register
|
| D | 17.3.8.rst | 31 - mesa-17.2.0/src/gallium/state_trackers/nine/nine_ff.c:1938: bad
56 - st/nine: Fix bad tracking of vs textures for NINESBT_ALL
57 - st/nine: Fixes warning about implicit conversion
58 - st/nine: Fix non inversible matrix check
|
| D | 18.2.2.rst | 57 - st/nine: Clamp RCP when 0*inf!=0
58 - st/nine: Avoid redundant SetCursorPos calls
59 - st/nine: Increase maximum number of temp registers
|
| D | 17.3.9.rst | 43 - Hang when running nine ff lighting shader with radeonsi
58 - st/nine: Declare lighting consts for ff shaders
59 - st/nine: Do not use scratch for face register
|
| D | 18.2.8.rst | 54 - st/nine: Fix volumetexture dtor on ctor failure
55 - st/nine: Bind src not dst in nine_context_box_upload
56 - st/nine: Add src reference to nine_context_range_upload
|
| /external/mesa3d/src/gallium/frontends/nine/ |
| D | nine_helpers.h | 76 #define NINE_DEVICE_CHILD_NEW(nine, out, dev, ...) \ argument
79 struct Nine##nine *__data; \
81 __data = CALLOC_STRUCT(Nine##nine); \
84 …dev)->params.BehaviorFlags & D3DCREATE_MULTITHREADED) ? &Lock##nine##_vtable : &Nine##nine##_vtabl…
85 __params.guids = Nine##nine##_IIDs; \
86 __params.dtor = (void *)Nine##nine##_dtor; \
91 HRESULT __hr = Nine##nine##_ctor(__data, &__params, ## __VA_ARGS__); \
93 Nine##nine##_dtor(__data); \
102 #define NINE_DEVICE_CHILD_BIND_NEW(nine, out, dev, ...) \ argument
105 struct Nine##nine *__data; \
[all …]
|
| D | README | 5 --with-gallium-drivers=nouveau,r600,swrast --enable-nine \
36 Every Direct3D9 program will now try using nine before wined3d
75 stone, so feel free to hack on those as well as st/nine.
|
| /external/eigen/bench/btl/generic_bench/utils/ |
| D | size_lin_log.hh | 29 int nine=9; in size_lin_log() local
35 for (int i=0;i<nine;i++){ in size_lin_log()
42 size_log(nb_point-nine,ten,size_max,log_size); in size_lin_log()
44 for (int i=0;i<nb_point-nine;i++){ in size_lin_log()
46 X[i+nine]=log_size[i]; in size_lin_log()
|
| /external/llvm-project/llvm/test/tools/llvm-strings/ |
| D | radix-filename.test | 11 RUN: echo nine >> %t
28 CHECK-NONE: [[FILE]]: nine
35 CHECK-DEC: [[FILE]]: 40 nine
42 CHECK-OCT: [[FILE]]: 50 nine
49 CHECK-HEX: [[FILE]]: 28 nine
|
| D | radix.test | 13 nine
36 CHECK-NONE: {{^}}nine
43 CHECK-DEC: {{^}} 40 nine
50 CHECK-OCT: {{^}} 50 nine
57 CHECK-HEX: {{^}} 28 nine
|
| /external/rust/crates/proc-macro-error/tests/ui/ |
| D | proc_macro_hack.stderr | 4 8 | let nine = add_one!(two) + add_one!(2 + 3);
12 8 | let nine = add_one!(two) + add_one!(2 + 3);
20 8 | let nine = add_one!(two) + add_one!(2 + 3);
|
| D | proc_macro_hack.rs | 8 let nine = add_one!(two) + add_one!(2 + 3); in main() localVariable
9 println!("nine = {}", nine); in main()
|
| /external/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ |
| D | ostream_joiner.cons.pass.cpp | 30 const std::string nine = "9"; in main() local
42 { exp::ostream_joiner<std::string> oj(std::cout, nine); } in main()
54 { exp::ostream_joiner<std::string, wchar_t> oj(std::wcout, nine); } in main()
|
| /external/llvm-project/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ |
| D | ostream_joiner.cons.pass.cpp | 30 const std::string nine = "9"; in main() local
42 { exper::ostream_joiner<std::string> oj(std::cout, nine); } in main()
54 { exper::ostream_joiner<std::string, wchar_t> oj(std::wcout, nine); } in main()
|
| /external/fonttools/Tests/mtiLib/data/mti/ |
| D | contextcoverage.txt | 18 nine
35 nine
|
| D | chainedcoverage.txt | 18 nine
35 nine
|
| /external/protobuf/js/commonjs/ |
| D | strict_test.js | 47 var simple1 = new test9_pb.jspb.exttest.strict.nine.Simple9()
48 var simple2 = new test9_pb.jspb.exttest.strict.nine.Simple9()
|
| /external/fonttools/Tests/feaLib/data/ |
| D | feature_aalt.fea | 22 sub [zero one two three four five six seven eight nine] [A a]' by ordfeminine;
23 sub [zero one two three four five six seven eight nine] [O o]' by ordmasculine;
|
| D | GPOS_1.fea | 3 @sevenEightNine = [seven eight nine];
30 pos nine -100;
|
| D | bug463.fea | 3 @DIGIT = [zero one two three four five six seven eight nine];
|
| /external/skqp/gm/ |
| D | windowrectangles.cpp | 51 SkRRect nine; in onDraw() local
52 nine.setNinePatch(SkRect::MakeXYWH(550 - 30.25 - 100, 370.75, 100, 150), 12, 35, 23, 20); in onDraw()
53 stack.clipRRect(nine, SkMatrix::I(), kDifference_SkClipOp, true); in onDraw()
|
| /external/rust/crates/libz-sys/src/zlib/doc/ |
| D | algorithm.txt | 84 of the first table is nine bits. Also the distance trees have 30 possible
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
98 symbol is shorter than nine bits, then that symbol's translation is duplicated
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table. If a
101 symbol is nine bits long, it appears in the table once.
103 If the symbol is longer than nine bits, then that entry in the table points
112 So a table entry either points to another table (in which case nine bits in
|
| /external/rust/crates/libz-sys/src/zlib-ng/doc/ |
| D | algorithm.txt | 84 of the first table is nine bits. Also the distance trees have 30 possible
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
98 symbol is shorter than nine bits, then that symbol's translation is duplicated
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table. If a
101 symbol is nine bits long, it appears in the table once.
103 If the symbol is longer than nine bits, then that entry in the table points
112 So a table entry either points to another table (in which case nine bits in
|
| /external/python/cpython2/Modules/zlib/ |
| D | algorithm.txt | 84 of the first table is nine bits. Also the distance trees have 30 possible
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
98 symbol is shorter than nine bits, then that symbol's translation is duplicated
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table. If a
101 symbol is nine bits long, it appears in the table once.
103 If the symbol is longer than nine bits, then that entry in the table points
112 So a table entry either points to another table (in which case nine bits in
|