HomeSort by relevance Sort by last modified time
    Searched defs:ir (Results 1 - 25 of 194) sorted by null

1 2 3 4 5 6 7 8

  /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
  /external/libcxx/test/std/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);
  /external/libcxx/test/std/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/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);
  /external/libcxx/test/std/numerics/numeric.ops/numeric.iota/
iota.pass.cpp 25 int ir[] = {5, 6, 7, 8, 9}; local
29 assert(ia[i] == ir[i]);
  /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/clang/test/CXX/basic/basic.lookup/basic.lookup.argdep/
p2-template-id.cpp 15 int &ir = f((N2::Y<N1::X>*)0); local
  /external/libcxx/test/std/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/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...]
  /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]);
  /cts/tools/vm-tests-tf/src/util/build/
CharactersStreamSucker.java 34 private final BufferedReader ir; field in class:CharactersStreamSucker
43 this.ir = new BufferedReader(new InputStreamReader(is));
56 while ((line = ir.readLine()) != null) {
  /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/libcxx/test/std/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);
set_intersection_comp.pass.cpp 37 int ir[] = {2, 4, 4}; local
38 const int sr = sizeof(ir)/sizeof(ir[0]);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
  /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
set_symmetric_difference.pass.cpp 36 int ir[] = {1, 2, 3, 3, 3, 4, 4, 6}; local
37 const int sr = sizeof(ir)/sizeof(ir[0]);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_symmetric_difference_comp.pass.cpp 38 int ir[] = {1, 2, 3, 3, 3, 4, 4, 6}; local
39 const int sr = sizeof(ir)/sizeof(ir[0]);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
  /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/
set_union.pass.cpp 35 int ir[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 6}; 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);
set_union_comp.pass.cpp 37 int ir[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 6}; local
38 const int sr = sizeof(ir)/sizeof(ir[0]);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);

Completed in 368 milliseconds

1 2 3 4 5 6 7 8