| /external/compiler-rt/lib/builtins/ |
| mulodi4.c | 43 di_int sb = b >> (N - 1); local
44 di_int abs_b = (b ^ sb) - sb;
47 if (sa == sb)
|
| mulosi4.c | 43 si_int sb = b >> (N - 1); local
44 si_int abs_b = (b ^ sb) - sb;
47 if (sa == sb)
|
| muloti4.c | 45 ti_int sb = b >> (N - 1); local
46 ti_int abs_b = (b ^ sb) - sb;
49 if (sa == sb)
|
| mulvdi3.c | 41 di_int sb = b >> (N - 1); local
42 di_int abs_b = (b ^ sb) - sb;
45 if (sa == sb)
|
| mulvsi3.c | 41 si_int sb = b >> (N - 1); local
42 si_int abs_b = (b ^ sb) - sb;
45 if (sa == sb)
|
| mulvti3.c | 43 ti_int sb = b >> (N - 1); local
44 ti_int abs_b = (b ^ sb) - sb;
47 if (sa == sb)
|
| /external/e2fsprogs/e2fsck/ |
| quota.c | 52 struct ext2_super_block *sb = ctx->fs->super; local
59 !(sb->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_QUOTA))
62 pctx.ino = sb->s_usr_quota_inum;
63 if (sb->s_usr_quota_inum &&
64 (sb->s_usr_quota_inum != EXT4_USR_QUOTA_INO) &&
66 move_quota_inode(fs, sb->s_usr_quota_inum, EXT4_USR_QUOTA_INO,
68 sb->s_usr_quota_inum = EXT4_USR_QUOTA_INO;
71 pctx.ino = sb->s_grp_quota_inum;
72 if (sb->s_grp_quota_inum &&
73 (sb->s_grp_quota_inum != EXT4_GRP_QUOTA_INO) &
[all...] |
| /external/e2fsprogs/ext2ed/ |
| super_com.c | 149 struct ext2_super_block sb; local
151 sb=type_data.u.t_ext2_super_block;
153 type_data.u.t_ext2_super_block=sb;
|
| /external/e2fsprogs/lib/ext2fs/ |
| tst_super_size.c | 21 struct sb_struct sb; variable in typeref:struct:sb_struct
27 #define check_field(x, s) cur_offset = do_field(#x, s, sizeof(sb.x), \
|
| /external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
| HTTPTokener.java | 52 StringBuffer sb = new StringBuffer(); local
64 return sb.toString();
66 sb.append(c);
71 return sb.toString();
73 sb.append(c);
|
| /external/jmonkeyengine/engine/src/networking/com/jme3/network/rmi/ |
| RemoteObjectDefMessage.java | 53 StringBuilder sb = new StringBuilder(); local
54 sb.append("RemoteObjectDefMessage[\n");
56 sb.append("\t").append(def).append("\n");
58 sb.append("]");
59 return sb.toString();
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 34 const unsigned sb = sizeof(ib)/sizeof(ib[0]); local
35 std::reverse(Iter(ib), Iter(ib+sb));
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 43 const unsigned sb = sizeof(ib)/sizeof(ib[0]); local
44 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
45 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
46 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0));
47 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb));
48 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb));
49 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib))
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 31 const unsigned sb = sizeof(ib)/sizeof(ib[0]); local
43 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb))
46 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb))
|
| mismatch_pred.pass.cpp | 34 const unsigned sb = sizeof(ib)/sizeof(ib[0]); local
52 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ())
54 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib + sb), EQ())
57 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), std::ref(bcp))
59 assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb));
66 assert(std::mismatch(ia, ia + sa, ib, ib + sb, EQ()) ==
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 30 const unsigned sb = sizeof(ib)/sizeof(ib[0]); local
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb)));
42 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa)));
|
| includes_comp.pass.cpp | 31 const unsigned sb = sizeof(ib)/sizeof(ib[0]); local
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>()));
43 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>()));
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 33 const int sb = sizeof(ib)/sizeof(ib[0]); local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
| set_intersection_comp.pass.cpp | 35 const int sb = sizeof(ib)/sizeof(ib[0]); local
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 34 const int sb = sizeof(ib)/sizeof(ib[0]); local
39 Iter2(ib), Iter2(ib+sb), OutIter(ic));
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| set_symmetric_difference_comp.pass.cpp | 36 const int sb = sizeof(ib)/sizeof(ib[0]); local
41 Iter2(ib), Iter2(ib+sb),
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 33 const int sb = sizeof(ib)/sizeof(ib[0]); local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
|
| set_union_comp.pass.cpp | 35 const int sb = sizeof(ib)/sizeof(ib[0]); local
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
|
| /external/libcxx/test/std/input.output/iostream.format/ext.manip/ |
| put_money.pass.cpp | 56 testbuf<char> sb; local
57 std::ostream os(&sb);
62 assert(sb.str() == "-$1,234,567.89");
65 testbuf<char> sb; local
66 std::ostream os(&sb);
71 assert(sb.str() == "-USD 1,234,567.89");
74 testbuf<wchar_t> sb; local
75 std::wostream os(&sb);
80 assert(sb.str() == L"-$1,234,567.89");
83 testbuf<wchar_t> sb; local
[all...] |
| put_time.pass.cpp | 54 testbuf<char> sb; local
55 std::ostream os(&sb);
67 assert(sb.str() == "Sat Dec 31 23:55:59 2061");
70 testbuf<wchar_t> sb; local
71 std::wostream os(&sb);
82 assert(sb.str() == L"Sat Dec 31 23:55:59 2061");
|
