HomeSort by: relevance | last modified time | path
    Searched refs:Merge (Results 1 - 25 of 45) sorted by relevancy

1 2

  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerMerge.h 12 // Take the existing corpus (possibly empty) and merge new inputs into
33 // reads the control files and does the merge based entirely on the contents
69 size_t Merge(const Set<uint32_t> &InitialFeatures,
71 size_t Merge(Vector<std::string> *NewFiles) {
72 return Merge(Set<uint32_t>{}, NewFiles);
FuzzerInternal.h 74 // Merge Corpora[1:] into Corpora[0].
75 void Merge(const Vector<std::string> &Corpora);
FuzzerMerge.cpp 33 Printf("MERGE: failed to parse the control file (unexpected error)\n");
126 size_t Merger::Merge(const Set<uint32_t> &InitialFeatures,
210 Printf("MERGE-INNER: using the control file '%s'\n", CFPath.c_str());
216 Printf("MERGE-INNER: '%s' caused a failure at the previous merge step\n",
219 Printf("MERGE-INNER: %zd total files;"
272 Printf("MERGE-OUTER: failed to write to the control file: %s\n",
285 Printf("Merge requires two or more corpus dirs\n");
296 Printf("MERGE-OUTER: non-empty control file provided: '%s'\n",
301 Printf("MERGE-OUTER: control file ok, %zd files total,
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/scripts/
merge_data_flow.py 10 # Merge several data flow traces into one.
18 def Merge(a, b):
29 D[F] = Merge(D[F], BV)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
PtrState.h 94 /// Conservatively merge the two RRInfo. Returns true if a partial merge has
96 bool Merge(const RRInfo &Other);
155 void Merge(const PtrState &Other, bool TopDown);
PtrState.cpp 99 bool RRInfo::Merge(const RRInfo &Other) {
100 // Conservatively merge the ReleaseMetadata information.
104 // Conservatively merge the boolean state.
109 // Merge the call sets.
112 // Merge the insert point sets. If there are any differences,
113 // that makes this a partial merge.
147 void PtrState::Merge(const PtrState &Other, bool TopDown) {
156 // If we're doing a merge on a path that's previously seen a partial
157 // merge, conservatively drop the sequence, to avoid doing partial
158 // RR elimination. If the branch predicates for the two merge differ
    [all...]
ObjCARCOpts.cpp 350 /// The top-down traversal uses this to merge information about predecessors to
377 // merge the entries. Otherwise, copy the entry and merge it with an empty
382 Pair.first->second.Merge(Pair.second ? TopDownPtrState() : MI->second,
387 // same key, force it to merge with an empty entry.
390 MI->second.Merge(TopDownPtrState(), /*TopDown=*/true);
393 /// The bottom-up traversal uses this to merge information about successors to
420 // same key, merge the entries. Otherwise, copy the entry and merge
425 Pair.first->second.Merge(Pair.second ? BottomUpPtrState() : MI->second
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/scripts/
sancov.py 2 # Merge or print the coverage data collected by asan's coverage.
4 # We need to merge these integers into a set and then
19 " " + prog_name + " merge FILE [FILE...] > OUTPUT\n" \
79 def Merge(files):
90 s = Merge(files)
100 s = Merge(files)
244 elif sys.argv[1] == "merge":
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/tests/
FuzzerUnittest.cpp 611 TEST(Merge, Bad) {
641 static void Merge(const std::string &Input,
649 EXPECT_EQ(NumNewFeatures, M.Merge(&NewFiles));
654 TEST(Merge, Good) {
707 EXPECT_EQ(0U, M.Merge(&NewFiles));
718 EXPECT_EQ(3U, M.Merge(&NewFiles));
732 EXPECT_EQ(3U, M.Merge(InitialFeatures, &NewFiles));
736 TEST(Merge, Merge) {
738 Merge("3\n1\nA\nB\nC\n
    [all...]
  /src/crypto/external/bsd/heimdal/dist/packages/windows/installer/
NTMakefile 55 # Heimdal Merge Modules
163 MMDIR=$(ProgramFiles)\Common Files\Merge Modules
165 MMDIR=$(SystemDrive)\Program Files (x86)\Common Files\Merge Modules
  /src/external/historical/nawk/dist/
FIXES.1e 116 Merge PR #99, which gets the right header for strcasecmp.
120 Merge PR #98: Disallow hex data. Allow only +nan, -nan,
139 Merge PR #93, which adds casts to (void*) for debug prints
149 Merge PRs 88-91 which fix small bugs. Thanks to Todd Miller and
156 Merge PRs 85 and 86 which fix regressions. Thanks to
160 Merge PRs 82 and 84. The latter fixes issue #83. Thanks to
207 Merge PR #70, which avoids use of variable length arrays. Thanks
347 Merge PRs as follows:
  /src/external/apache2/llvm/dist/clang/lib/AST/
APValue.cpp 1040 LV.merge(MergeLV);
1043 auto Merge = [&](const APValue &V) {
1065 if (Merge(V.getStructBase(I)))
1068 if (Merge(V.getStructField(I)))
1075 Merge(V.getUnionValue());
1080 if (Merge(V.getArrayInitializedElt(I)))
1083 Merge(V.getArrayFiller());
  /src/usr.sbin/etcupdate/
etcupdate 36 # see the modifications and either install the new version or merge the
369 m Merge the currently installed and new files
379 m Merge again (your old file against the result from the previous merge)
382 u Undo merge (start again with the original version of the new file)
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
TypeBasedAliasAnalysis.cpp 524 void Instruction::getAAMetadata(AAMDNodes &N, bool Merge) const {
525 if (Merge) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonBlockRanges.cpp 58 void HexagonBlockRanges::IndexRange::merge(const IndexRange &A) { function in class:HexagonBlockRanges::IndexRange
81 // Merge all overlapping ranges in the list, so that all that remains
92 // If MergeAdjacent is true, merge ranges A and B, where A.end == B.start.
94 bool Merge = MergeAdjacent && (Iter->end() == Next->start());
95 if (Merge || Iter->overlaps(*Next)) {
96 Iter->merge(*Next);
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsLegalizerInfo.cpp 412 auto Merge = MIRBuilder.buildMerge(s64, {Load_P2Half, Load_Rem});
413 MIRBuilder.buildTrunc(Val, Merge);
  /src/external/gpl3/gdb/dist/gnulib/import/extra/
gitlog-to-changelog 382 if ( grep /^(; )?Merge from /, @line )
390 ## Reset at each merge to reduce chance of false matches.
  /src/external/gpl3/gdb.old/dist/gnulib/import/extra/
gitlog-to-changelog 382 if ( grep /^(; )?Merge from /, @line )
390 ## Reset at each merge to reduce chance of false matches.
  /src/external/lgpl3/gmp/dist/mpn/x86_64/bd1/
mul_basecase.asm 56 C * Merge bull-specific mul_1, if it is not slower the TOOM22 range.
59 C * Merge faster mul_2, such as the one in the same directory as this file.
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
SveEmitter.cpp 159 // The merge suffix such as _m, _x or _z.
320 // Returns the SVETypeFlags for the given merge type.
998 uint64_t Merge = R->getValueAsInt("Merge");
1050 Name, Proto, Merge, MergeSuffix, MemEltType, LLVMName, Flags, ImmChecks,
1056 Name, Proto, Merge, MergeSuffix, MemEltType, LLVMName, Flags,
  /src/sys/arch/mac68k/obio/
iwm.s 871 orb %d3,%d2 | Merge 6&2
883 orb %d3,%d2 | Merge 6&2
894 orb %d3,%d1 | Merge 6&2
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
CallLowering.cpp 430 auto Merge = B.buildMerge(RealDstEltTy, Regs.take_front(PartsPerElt));
432 MRI.setType(Merge.getReg(0), RealDstEltTy);
433 EltMerges.push_back(Merge.getReg(0));
753 // Merge the split registers into the expected larger result vregs of
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
Instruction.h 306 /// When Merge is true, the existing AA metadata is merged with that from this
308 void getAAMetadata(AAMDNodes &N, bool Merge = false) const;
482 /// Merge 2 debug locations and apply it to the Instruction. If the
485 /// you merge 2 iterations, you need to rebuild the hashmap to find the
489 /// O(2*N*I), where N is # of Instructions to merge, and I is the
  /src/external/lgpl3/gmp/dist/mpn/ia64/
dive_1.asm 54 C Possible improvement: Merge more of the feed-in code into the inverse
  /src/external/apache2/llvm/dist/clang/lib/Serialization/
ASTReader.cpp 3278 // merge step?
7182 // FIXME: Merging a function definition should merge
9379 for (auto &Merge : OdrMergeFailures) {
9380 Merge.first->buildLookup();
9381 Merge.first->decls_begin();
9382 Merge.first->bases_begin();
9383 Merge.first->vbases_begin();
9384 for (auto &RecordPair : Merge.second) {
9395 for (auto &Merge : FunctionOdrMergeFailures) {
9396 Merge.first->buildLookup()
    [all...]

Completed in 53 milliseconds

1 2