HomeSort by: relevance | last modified time | path
    Searched defs:piece (Results 1 - 25 of 54) sorted by relevancy

1 2 3

  /src/external/lgpl3/gmp/dist/printf/
printffuns.c 59 int i, piece, ret; local
65 piece = MIN (i, sizeof (buf));
66 ret = fwrite (buf, 1, piece, fp);
69 ASSERT (ret == piece);
printffuns.c 59 int i, piece, ret; local
65 piece = MIN (i, sizeof (buf));
66 ret = fwrite (buf, 1, piece, fp);
69 ASSERT (ret == piece);
  /src/lib/libc/hash/md2/
md2.c 143 unsigned int idx, piece; local
148 for (idx = 0; idx < inputLen; idx += piece) {
149 piece = 32 - context->i;
150 if ((inputLen - idx) < piece)
151 piece = inputLen - idx;
152 memcpy(&context->X[context->i], &input[idx], (size_t)piece);
153 if ((context->i += piece) == 32)
md2.c 143 unsigned int idx, piece; local
148 for (idx = 0; idx < inputLen; idx += piece) {
149 piece = 32 - context->i;
150 if ((inputLen - idx) < piece)
151 piece = inputLen - idx;
152 memcpy(&context->X[context->i], &input[idx], (size_t)piece);
153 if ((context->i += piece) == 32)
  /src/lib/libc/gen/
sysctlgetmibinfo.c 417 const char *piece, *dot; local
483 piece = gname;
484 while (piece != NULL && *piece != '\0') {
488 dot = strchr(piece, sep[0]);
490 l = strlcpy(token, piece, sizeof(token));
492 COPY_OUT_DATA(piece, cname, csz, namelenp, nl);
497 else if (dot - piece > (intptr_t)(sizeof(token) - 1)) {
503 strncpy(token, piece, (size_t)(dot - piece));
    [all...]
sysctlgetmibinfo.c 417 const char *piece, *dot; local
483 piece = gname;
484 while (piece != NULL && *piece != '\0') {
488 dot = strchr(piece, sep[0]);
490 l = strlcpy(token, piece, sizeof(token));
492 COPY_OUT_DATA(piece, cname, csz, namelenp, nl);
497 else if (dot - piece > (intptr_t)(sizeof(token) - 1)) {
503 strncpy(token, piece, (size_t)(dot - piece));
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Rewrite/Core/
RewriteRope.h 130 llvm::StringRef piece() const { function in class:clang::RopePieceBTreeIterator
RewriteRope.h 130 llvm::StringRef piece() const { function in class:clang::RopePieceBTreeIterator
  /src/external/gpl2/gmake/dist/
vmsify.c 909 static char piece[512]; local
915 p = piece;
989 return piece;
vmsify.c 909 static char piece[512]; local
915 p = piece;
989 return piece;
  /src/external/gpl3/gdb.old/dist/gdb/
type-stack.h 52 enum type_pieces piece; member in union:type_stack_elt
86 elt.piece = tp;
125 return elt.piece;
type-stack.h 52 enum type_pieces piece; member in union:type_stack_elt
86 elt.piece = tp;
125 return elt.piece;
  /src/external/gpl3/gdb/dist/gdb/
type-stack.h 52 enum type_pieces piece; member in union:type_stack_elt
86 elt.piece = tp;
125 return elt.piece;
type-stack.h 52 enum type_pieces piece; member in union:type_stack_elt
86 elt.piece = tp;
125 return elt.piece;
  /src/sys/fs/udf/
udf_readwrite.c 278 * For reading, the size of allocated piece is returned in multiple of sector
293 int piece; local
316 piece = MIN(MAXPHYS/sector_size, sectors);
317 DPRINTF(READ, ("read in %d + %d\n", (uint32_t) rblkno, piece));
320 nestiobuf_setup(buf, nestbuf, buf_offset, piece * sector_size);
334 lblkno += piece;
335 rblkno += piece;
336 buf_offset += piece * sector_size;
337 sectors -= piece;
361 /* read initial piece */
435 int piece; local
    [all...]
udf_readwrite.c 278 * For reading, the size of allocated piece is returned in multiple of sector
293 int piece; local
316 piece = MIN(MAXPHYS/sector_size, sectors);
317 DPRINTF(READ, ("read in %d + %d\n", (uint32_t) rblkno, piece));
320 nestiobuf_setup(buf, nestbuf, buf_offset, piece * sector_size);
334 lblkno += piece;
335 rblkno += piece;
336 buf_offset += piece * sector_size;
337 sectors -= piece;
361 /* read initial piece */
435 int piece; local
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
PathDiagnostic.cpp 84 for (auto &Piece : *this) {
85 switch (Piece->getKind()) {
87 auto &Call = cast<PathDiagnosticCallPiece>(*Piece);
96 auto &Macro = cast<PathDiagnosticMacroPiece>(*Piece);
100 Current.push_back(Piece);
103 // FIXME: This probably shouldn't mutate the original path piece.
112 Current.push_back(Piece);
170 const PathDiagnosticPiece *piece = I.get(); local
171 FullSourceLoc L = piece->getLocation().asLocation().getExpansionLoc();
181 ArrayRef<SourceRange> Ranges = piece->getRanges()
1067 const PathDiagnosticPiece *piece = I.get(); local
    [all...]
PathDiagnostic.cpp 84 for (auto &Piece : *this) {
85 switch (Piece->getKind()) {
87 auto &Call = cast<PathDiagnosticCallPiece>(*Piece);
96 auto &Macro = cast<PathDiagnosticMacroPiece>(*Piece);
100 Current.push_back(Piece);
103 // FIXME: This probably shouldn't mutate the original path piece.
112 Current.push_back(Piece);
170 const PathDiagnosticPiece *piece = I.get(); local
171 FullSourceLoc L = piece->getLocation().asLocation().getExpansionLoc();
181 ArrayRef<SourceRange> Ranges = piece->getRanges()
1067 const PathDiagnosticPiece *piece = I.get(); local
    [all...]
  /src/external/gpl3/gcc.old/dist/lto-plugin/
lto-plugin.c 593 const unsigned piece = 32; local
594 char *buf, *s = xmalloc (piece);
599 if (!fgets (buf, piece, f))
607 s = xrealloc (s, len + piece);
lto-plugin.c 593 const unsigned piece = 32; local
594 char *buf, *s = xmalloc (piece);
599 if (!fgets (buf, piece, f))
607 s = xrealloc (s, len + piece);
  /src/external/gpl3/gdb.old/dist/gdb/dwarf2/
expr.c 129 for (dwarf_expr_piece &piece : c->pieces)
130 if (piece.location == DWARF_VALUE_STACK)
131 piece.v.value->incref ();
141 function is true if any piece is optimized out. When
190 /* Advance to the first non-skipped piece. */
369 /* Use zeroes if piece reaches beyond stack value. */
373 /* Piece is anchored at least significant bit end. */
515 dwarf_expr_piece *piece = NULL; local
551 piece = p;
555 gdb_assert (piece != NULL && c->per_cu != nullptr)
    [all...]
expr.c 129 for (dwarf_expr_piece &piece : c->pieces)
130 if (piece.location == DWARF_VALUE_STACK)
131 piece.v.value->incref ();
141 function is true if any piece is optimized out. When
190 /* Advance to the first non-skipped piece. */
369 /* Use zeroes if piece reaches beyond stack value. */
373 /* Piece is anchored at least significant bit end. */
515 dwarf_expr_piece *piece = NULL; local
551 piece = p;
555 gdb_assert (piece != NULL && c->per_cu != nullptr)
    [all...]
  /src/external/gpl3/gdb/dist/gdb/dwarf2/
expr.c 129 for (dwarf_expr_piece &piece : c->pieces)
130 if (piece.location == DWARF_VALUE_STACK)
131 piece.v.value->incref ();
141 function is true if any piece is optimized out. When
190 /* Advance to the first non-skipped piece. */
222 /* If the piece is located in a register, but does not
223 occupy the entire register, the placement of the piece
388 /* Use zeroes if piece reaches beyond stack value. */
392 /* Piece is anchored at least significant bit end. */
534 dwarf_expr_piece *piece = NULL local
    [all...]
expr.c 129 for (dwarf_expr_piece &piece : c->pieces)
130 if (piece.location == DWARF_VALUE_STACK)
131 piece.v.value->incref ();
141 function is true if any piece is optimized out. When
190 /* Advance to the first non-skipped piece. */
222 /* If the piece is located in a register, but does not
223 occupy the entire register, the placement of the piece
388 /* Use zeroes if piece reaches beyond stack value. */
392 /* Piece is anchored at least significant bit end. */
534 dwarf_expr_piece *piece = NULL local
    [all...]
  /src/usr.bin/make/
dir.c 775 const char *prefix, *middle, *piece, *middle_end, *suffix; local
794 piece = middle;
795 while (piece < middle_end + 1) {
796 const char *piece_end = separator_comma(piece);
797 size_t piece_len = (size_t)(piece_end - piece);
799 char *file = concat3(prefix, prefix_len, piece, piece_len,
810 piece = piece_end + 1;
1399 /* XXX: Is every piece of memory freed as it should? */

Completed in 46 milliseconds

1 2 3