| /freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
| H A D | version.c | 220 apr_array_header_t *pieces =
223 if ((pieces->nelts < 2) || (pieces->nelts > 3))
233 APR_ARRAY_IDX(pieces, 0, const char *));
239 APR_ARRAY_IDX(pieces, 1, const char *));
247 if (pieces->nelts == 3)
249 const char *piece = APR_ARRAY_IDX(pieces, 2, const char *);
219 apr_array_header_t *pieces = local
|
| /freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
| H A D | InputSection.h | 254 std::vector<SectionPiece> pieces; member in class:lld::elf::MergeInputSection
260 size_t begin = pieces[i].inputOff;
262 (pieces.size() - 1 == i) ? data().size() : pieces[i + 1].inputOff;
263 return {toStringRef(data().slice(begin, end - begin)), pieces[i].hash};
307 std::vector<EhSectionPiece> pieces; member in class:lld::elf::EhInputSection
|
| H A D | MapFile.cpp | 105 // .eh_frame tend to contain a lot of section pieces that are contiguous
106 // both in input file and output file. Such pieces are squashed before
109 std::vector<EhSectionPiece> pieces; local
113 if (!pieces.empty()) {
114 EhSectionPiece &last = pieces.back();
121 pieces.push_back(p);
124 // Gather section pieces.
131 // Print out section pieces.
133 for (EhSectionPiece &p : pieces) {
|
| H A D | Relocations.cpp | 975 pieces = eh->pieces;
982 if (pieces.empty())
985 while (i != pieces.size() && pieces[i].inputOff + pieces[i].size <= off)
987 if (i == pieces.size())
991 assert(pieces[i].inputOff <= off && "Relocation not in any piece");
994 if (pieces[i].outputOff == -1)
996 return pieces[
1000 ArrayRef<EhSectionPiece> pieces; member in class:lld::elf::__anon1132::OffsetGetter
[all...] |
| H A D | MarkLive.cpp | 138 for (size_t i = 0, end = eh.pieces.size(); i < end; ++i) {
139 EhSectionPiece &piece = eh.pieces[i];
|
| H A D | InputSection.cpp | 1217 pieces.emplace_back(off, this, size, getReloc(off, size, rels, relI));
1255 pieces.emplace_back(off, xxHash64(s.substr(0, size)), !isAlloc);
1270 pieces.emplace_back(i, xxHash64(data.slice(i, entSize)), !isAlloc);
1292 assert(pieces.empty());
1307 pieces, [=](SectionPiece p) { return p.inputOff <= offset; });
|
| H A D | SyntheticSections.cpp | 404 for (EhSectionPiece &piece : sec->pieces) {
591 // getOffset() takes care of discontiguous section pieces.
3159 // Add all string pieces to the string table builder to create section
3162 for (size_t i = 0, e = sec->pieces.size(); i != e; ++i)
3163 if (sec->pieces[i].live)
3173 for (size_t i = 0, e = sec->pieces.size(); i != e; ++i)
3174 if (sec->pieces[i].live)
3175 sec->pieces[i].outputOff = builder.getOffset(sec->getData(i));
3203 // Add section pieces to the builders.
3206 for (size_t i = 0, e = sec->pieces
[all...] |
| /freebsd-11-stable/contrib/gdb/gdb/ |
| H A D | dwarf2expr.h | 81 /* An array of pieces. PIECES points to its first element;
95 actually marks all the values it computes as pieces.
106 struct dwarf_expr_piece *pieces; member in struct:dwarf_expr_context
|
| H A D | dwarf2expr.c | 46 retval->pieces = 0;
56 xfree (ctx->pieces);
115 if (ctx->pieces)
116 ctx->pieces = xrealloc (ctx->pieces,
120 ctx->pieces = xmalloc (ctx->num_pieces
123 p = &ctx->pieces[ctx->num_pieces - 1];
|
| H A D | dwarf2loc.c | 244 struct dwarf_expr_piece *p = &ctx->pieces[i];
358 /* If the location has several pieces, and any of them are in
361 if (ctx->pieces[i].in_reg)
|
| /freebsd-11-stable/usr.sbin/ckdist/ |
| H A D | ckdist.c | 278 int rval, error, c, pieces, cnt, fd; local
287 if ((c = sscanf(buf, "Pieces = %d%c", &pieces, &ch)) != 2 ||
288 ch != '\n' || pieces < 1)
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | BugReporter.cpp | 99 /// Map from each node to the diagnostic pieces visitors emit for them.
178 "Failed to find the context associated with these pieces!");
211 /// The diagnostic pieces visitors emitted, which is expected to be collected
228 /// This function is responsible for generating diagnostic pieces that are
367 /// can lead to redundant diagnostic pieces at the same point in a path.
394 // Check to see if we should keep one of the two pieces. If we
415 /// Recursively scan through a path and prune out calls and macros pieces
419 PathPieces &pieces,
423 const unsigned N = pieces.size();
428 auto piece = std::move(pieces
418 removeUnneededCalls(const PathDiagnosticConstruct &C, PathPieces &pieces, const PathSensitiveBugReport *R, bool IsInteresting = false) argument
1410 addContextEdges(PathPieces &pieces, const LocationContext *LC) argument
1491 simplifySimpleBranches(PathPieces &pieces) argument
[all...] |
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Expression/ |
| H A D | DWARFExpression.cpp | 938 Value pieces; // Used for DW_OP_piece local
2079 pieces.AppendDataToHostBuffer(curr_piece);
2175 // so subsequent pieces will be able to access this piece and add
2177 if (pieces.AppendDataToHostBuffer(curr_piece) == 0) {
2185 if (pieces.GetBuffer().GetByteSize() != op_piece_offset) {
2190 op_piece_offset, pieces.GetBuffer().GetByteSize());
2194 if (pieces.AppendDataToHostBuffer(curr_piece) == 0) {
2537 if (pieces.GetBuffer().GetByteSize()) {
2538 result = pieces;
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | PathDiagnostic.cpp | 1049 static void compute_path_size(const PathPieces &pieces, unsigned &size) { argument
1050 for (const auto &I : pieces) {
|
| /freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | PathDiagnostic.h | 362 // Path "pieces" for path-sensitive diagnostics.
584 static PathDiagnosticCallPiece *construct(PathPieces &pieces,
726 /// each which represent the pieces of the path.
|