HomeSort by relevance Sort by last modified time
    Searched full:i150 (Results 1 - 12 of 12) sorted by null

  /external/llvm/test/Transforms/CodeGenPrepare/
2008-11-24-RAUW-Self.ll 134 bb3.i147.mulflt.exit157_crit_edge: ; preds = %bb8.i150, %bb3.i147
141 br i1 false, label %bb8.i150, label %bb7.i149.bb12.i154_crit_edge
146 bb8.i150: ; preds = %bb7.i149
149 bb10.i151: ; preds = %bb8.i150
  /external/llvm/test/CodeGen/Generic/
APIntParam.ll 151 @i150_s = external global i150 ; <i150*> [#uses=1]
1004 define void @i150_ls(i150 %x) nounwind {
1005 store i150 %x, i150* @i150_s
    [all...]
APIntSextParam.ll 151 @i150_s = external global i150 ; <i150*> [#uses=1]
1004 define void @i150_ls(i150 signext %x) nounwind {
1005 store i150 %x, i150* @i150_s
    [all...]
APIntZextParam.ll 151 @i150_s = external global i150 ; <i150*> [#uses=1]
1004 define void @i150_ls(i150 zeroext %x) nounwind {
1005 store i150 %x, i150* @i150_s
    [all...]
APIntLoadStore.ll 300 @i150_l = external global i150 ; <i150*> [#uses=1]
301 @i150_s = external global i150 ; <i150*> [#uses=1]
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 292 int i150[] = {0, 0, 1, 1, 1, 1, 0}; local
419 assert(std::is_heap(i150, i150+7) == (std::is_heap_until(i150, i150+7) == i150+7));
is_heap_until.pass.cpp 292 int i150[] = {0, 0, 1, 1, 1, 1, 0}; local
419 assert(std::is_heap_until(i150, i150+7) == i150+2);