| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| basic.cpp | 4 int &ir = { 17 }; // expected-error{{reference to type 'int' cannot bind to an initializer list}} local
|
| /external/clang/test/CXX/over/over.match/over.match.best/ |
| p1.cpp | 9 int &ir = f0(ip, 0); local
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| back.pass.cpp | 24 int& ir = q.back(); local
25 assert(ir == 3);
|
| front.pass.cpp | 24 int& ir = q.front(); local
25 assert(ir == 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| top.pass.cpp | 24 int& ir = q.top(); local
25 assert(ir == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/numeric.iota/ |
| iota.pass.cpp | 25 int ir[] = {5, 6, 7, 8, 9}; local
29 assert(ia[i] == ir[i]);
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ir_hv_accept.cpp | 24 #include "ir.h"
28 * Implementations of all hierarchical visitor accept methods for IR
53 ir_instruction *const ir = (ir_instruction *) n; local
55 v->base_ir = ir;
56 ir_visitor_status s = ir->accept(v);
|
| ir_basic_block.cpp | 30 #include "ir.h"
38 * Basic block analysis is pretty easy in our IR thanks to the lack of
62 ir_instruction *ir = (ir_instruction *)iter.get(); local
68 leader = ir;
70 if ((ir_if = ir->as_if())) {
71 callback(leader, ir, data);
76 } else if ((ir_loop = ir->as_loop())) {
77 callback(leader, ir, data);
80 } else if (ir->as_return() || ir->as_call())
[all...] |
| opt_dead_code.cpp | 30 #include "ir.h"
135 ir_instruction *ir = (ir_instruction *)iter.get(); local
136 ir_function *f = ir->as_function();
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.argdep/ |
| p2-template-id.cpp | 15 int &ir = f((N2::Y<N1::X>*)0); local
|
| /external/clang/test/SemaCXX/ |
| attr-unavailable.cpp | 11 int &ir = foo(1); local
35 int &ir = foo(1); local
|
| /external/clang/test/SemaTemplate/ |
| default-arguments-cxx0x.cpp | 26 int &ir = f1(HasValue()); local
|
| /external/mesa3d/src/glsl/ |
| ir_hv_accept.cpp | 24 #include "ir.h"
28 * Implementations of all hierarchical visitor accept methods for IR
53 ir_instruction *const ir = (ir_instruction *) n; local
55 v->base_ir = ir;
56 ir_visitor_status s = ir->accept(v);
|
| ir_basic_block.cpp | 30 #include "ir.h"
38 * Basic block analysis is pretty easy in our IR thanks to the lack of
62 ir_instruction *ir = (ir_instruction *)iter.get(); local
68 leader = ir;
70 if ((ir_if = ir->as_if())) {
71 callback(leader, ir, data);
76 } else if ((ir_loop = ir->as_loop())) {
77 callback(leader, ir, data);
80 } else if (ir->as_return() || ir->as_call())
[all...] |
| opt_dead_code.cpp | 30 #include "ir.h"
135 ir_instruction *ir = (ir_instruction *)iter.get(); local
136 ir_function *f = ir->as_function();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/adjacent.difference/ |
| adjacent_difference.pass.cpp | 32 int ir[] = {15, -5, -4, -3, -2}; local
38 assert(ib[i] == ir[i]);
|
| adjacent_difference_op.pass.cpp | 33 int ir[] = {15, 25, 16, 9, 4}; local
40 assert(ib[i] == ir[i]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/partial.sum/ |
| partial_sum.pass.cpp | 30 int ir[] = {1, 3, 6, 10, 15}; local
36 assert(ib[i] == ir[i]);
|
| partial_sum_op.pass.cpp | 32 int ir[] = {1, -1, -4, -8, -13}; local
38 assert(ib[i] == ir[i]);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkScan.cpp | 60 SkIRect ir; local
62 r.round(&ir);
63 SkScan::FillIRect(ir, clip, blitter);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| wrap_yasm.py | 17 import ir namespace
|
| /external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
| p18.cpp | 17 int &ir = i; local
20 [=,&irc,&ir] {
27 static_assert(is_same<decltype(ir), int&>::value, "should be int&");
28 static_assert(is_same<decltype((ir)), int&>::value, "should be int&");
|
| /external/clang/test/CXX/temp/temp.decls/temp.fct/temp.func.order/ |
| p3.cpp | 15 float& ir = (xi == xf); local
|
| /external/skia/src/core/ |
| SkScan.cpp | 60 SkIRect ir; local
62 r.round(&ir);
63 SkScan::FillIRect(ir, clip, blitter);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 35 int ir[] = {2, 4, 4}; local
36 const int sr = sizeof(ir)/sizeof(ir[0]);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
