| /src/external/gpl3/gdb.old/dist/gdb/unittests/ |
| format_pieces-selftests.c | 32 /* Verify that parsing STR gives pieces equal to EXPECTED_PIECES. */
38 ::format_pieces pieces (&str, gdb_format);
40 SELF_CHECK ((pieces.end () - pieces.begin ()) == expected_pieces.size ());
41 SELF_CHECK (std::equal (pieces.begin (), pieces.end (),
|
| /src/external/gpl3/gdb/dist/gdb/unittests/ |
| format_pieces-selftests.c | 32 /* Verify that parsing STR gives pieces equal to EXPECTED_PIECES. */
38 ::format_pieces pieces (&str, gdb_format);
40 SELF_CHECK ((pieces.end () - pieces.begin ()) == expected_pieces.size ());
41 SELF_CHECK (std::equal (pieces.begin (), pieces.end (),
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/ |
| pieces.S | 21 The original program is "pieces.c", in this directory.
24 .file "pieces.c"
38 .file 1 "pieces.c"
39 # pieces.c:29
47 # pieces.c:30
50 # pieces.c:31
62 # pieces.c:35
75 # pieces.c:38
78 # pieces.c:35
82 # pieces.c:3
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/ |
| pieces.S | 21 The original program is "pieces.c", in this directory.
24 .file "pieces.c"
38 .file 1 "pieces.c"
39 # pieces.c:29
47 # pieces.c:30
50 # pieces.c:31
62 # pieces.c:35
75 # pieces.c:38
78 # pieces.c:35
82 # pieces.c:3
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/tests/ |
| lang-c | 35 printf (ngettext ("a piece of cake", "%d pieces of cake", n), n);
67 msgid_plural "%d pieces of cake"
93 msgid_plural "%d pieces of cake"
|
| lang-csharp | 44 Console.WriteLine(String.Format(catalog.GetPluralString("a piece of cake","{0} pieces of cake",n), n));
65 msgid_plural "{0} pieces of cake"
90 msgid_plural "{0} pieces of cake"
|
| lang-java | 68 System.out.println(MessageFormat.format(GettextResource.ngettext(catalog,"a piece of cake","{0,number} pieces of cake",n), new Object[] { new Integer(n) }));
89 msgid_plural "{0,number} pieces of cake"
114 msgid_plural "{0,number} pieces of cake"
|
| lang-objc | 51 printf (ngettext ("a piece of cake", "%d pieces of cake", n), n);
83 msgid_plural "%d pieces of cake"
109 msgid_plural "%d pieces of cake"
|
| lang-bash | 25 $echo "`eval_ngettext "a piece of cake" "\\$n pieces of cake" $n`"
44 msgid_plural "$n pieces of cake"
65 msgid_plural "$n pieces of cake"
|
| /src/usr.bin/make/unit-tests/ |
| job-output-long-lines.mk | 11 # output lines that are longer than this buffer size, these output pieces are
|
| /src/external/gpl3/gdb.old/dist/gdb/dwarf2/ |
| expr.c | 100 /* The pieces describing this variable. */
101 std::vector<dwarf_expr_piece> pieces; member in struct:piece_closure
109 PIECES. */
114 std::vector<dwarf_expr_piece> &&pieces,
123 c->pieces = std::move (pieces);
129 for (dwarf_expr_piece &piece : c->pieces)
137 mode": copy FROM into the pieces comprising V. If FROM == NULL,
139 composing it from its pieces. If CHECK_OPTIMIZED is true, then no
191 for (i = 0; i < c->pieces.size () && bits_to_skip >= c->pieces[i].size; i++
[all...] |
| /src/external/gpl3/gdb/dist/gdb/dwarf2/ |
| expr.c | 101 /* The pieces describing this variable. */
102 std::vector<dwarf_expr_piece> pieces; member in struct:piece_closure
110 PIECES. */
114 std::vector<dwarf_expr_piece> &&pieces,
123 c->pieces = std::move (pieces);
129 for (dwarf_expr_piece &piece : c->pieces)
137 mode": copy FROM into the pieces comprising V. If FROM == NULL,
139 composing it from its pieces. If CHECK_OPTIMIZED is true, then no
191 for (i = 0; i < c->pieces.size () && bits_to_skip >= c->pieces[i].size; i++
[all...] |
| /src/external/lgpl3/gmp/dist/tune/ |
| speed.h | 3011 mp_size_t j, pieces, psize; \
3024 pieces = SPEED_BLOCK_SIZE * datafactor / s->size / s->size; \
3025 pieces = MIN (pieces, SPEED_BLOCK_SIZE / s->size); \
3026 pieces = MAX (pieces, 1); \
3028 psize = pieces * s->size; \
3031 MPN_COPY (px, pieces==1 ? s->xp : s->xp_block, psize); \
3032 MPN_COPY (py, pieces==1 ? s->yp : s->yp_block, psize); \
3036 for (j = 0; j < pieces; j++)
[all...] |
| /src/external/bsd/cron/dist/ |
| INSTALL | 59 Edit your /usr/lib/crontab file into little pieces -- see the CONVERSION file
62 Use the `crontab' command to install all the little pieces you just created.
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/ |
| backtracking.d | 1021 CtState[] pieces;
1035 pieces ~= r;
1040 pieces ~= ctGenBlock(ir[optL..$], addr);
1041 addr = pieces[$-1].addr;
1045 r = pieces[0];
1046 for (uint i = 1; i < pieces.length; i++)
1050 goto case $$; `, pieces[i-1].addr, addr);
1051 r.code ~= pieces[i].code;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | 102 /// Map from each node to the diagnostic pieces visitors emit for them.
181 "Failed to find the context associated with these pieces!");
214 /// The diagnostic pieces visitors emitted, which is expected to be collected
231 /// This function is responsible for generating diagnostic pieces that are
370 /// can lead to redundant diagnostic pieces at the same point in a path.
397 // Check to see if we should keep one of the two pieces. If we
418 /// Recursively scan through a path and prune out calls and macros pieces
422 PathPieces &pieces,
426 const unsigned N = pieces.size();
431 auto piece = std::move(pieces.front())
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/sparc32/v9/ |
| addmul_1.asm | 35 C invariant v operand split into two 16-bit pieces, and the u operand split
36 C into 32-bit pieces. We convert the two 48-bit products and transfer them to
|
| mul_1.asm | 35 C invariant v operand split into two 16-bit pieces, and the u operand split
36 C into 32-bit pieces. We convert the two 48-bit products and transfer them to
|
| submul_1.asm | 35 C invariant v operand split into two 16-bit pieces, and the u operand split
36 C into 32-bit pieces. We convert the two 48-bit products and transfer them to
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| sorting.d | 891 auto pieces = partition3(a, 4);
892 assert(pieces[0] == [ 1, 3 ]);
893 assert(pieces[1] == [ 4, 4, 4 ]);
894 assert(pieces[2] == [ 8, 7 ]);
910 auto pieces = partition3(a, 25);
911 assert(pieces[0].length + pieces[1].length + pieces[2].length == a.length);
912 foreach (e; pieces[0])
916 foreach (e; pieces[1]
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/scan-build-py/libscanbuild/ |
| analyze.py | 105 def prefix_with(constant, pieces):
111 return [elem for piece in pieces for elem in [constant, piece]]
|
| /src/external/lgpl3/gmp/dist/mpn/sparc64/ultrasparc1234/ |
| addmul_2.asm | 39 C 2-limb v operand split into eight 16-bit pieces, and the n-limb u operand
40 C split into 32-bit pieces. We sum four 48-bit partial products using
|
| mul_1.asm | 39 C invariant v operand split into four 16-bit pieces, and the s1 operand split
40 C into 32-bit pieces. We sum pairs of 48-bit partial products using
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| PathDiagnostic.cpp | 1065 static void compute_path_size(const PathPieces &pieces, unsigned &size) {
1066 for (const auto &I : pieces) {
|
| /src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| aarch64.cc | 219 DOESNT_MATTER. We need to be able to collect enough pieces to
222 able to store at least 8 pieces.
224 We also need to be able to store enough pieces to represent
227 we need at least 12 pieces. */
259 /* Divides types analyzed as IS_PST into individual pieces. The pieces
261 auto_vec<piece, MAX_PIECES> pieces; member in class:__anon15282::pure_scalable_type_info
2972 for (unsigned int i = 0; i < pieces.length (); ++i)
2973 res += pieces[i].num_zr;
2983 for (unsigned int i = 0; i < pieces.length (); ++i
[all...] |
