/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/types/ |
H A D | tst.relenum.d | 48 second 52 /zero >= one || second <= first || zero == second/ 56 printf("null = %d; first = %d; second = %d", null, first, second); 61 /second < one || two > second || null == first/ 65 printf("null = %d; first = %d; second = %d", null, first, second); 70 /first < two && second > on [all...] |
/freebsd-11-stable/contrib/byacc/test/ |
H A D | err_syntax16.y | 6 %token second 14 second : label
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | FunctionSummary.cpp | 21 Total += I.second.TotalBasicBlocks; 28 Total += I.second.VisitedBasicBlocks.count();
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Frontend/ |
H A D | TextDiagnosticBuffer.cpp | 60 Diag << Notes[I.second].second; 63 Diag << Warnings[I.second].second; 66 Diag << Remarks[I.second].second; 70 Diag << Errors[I.second].second;
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | FunctionSummary.h | 75 I->second.InlineChecked = 1; 76 I->second.MayInline = 1; 81 I->second.InlineChecked = 1; 82 I->second.MayInline = 0; 91 if (I != Map.end() && I->second.InlineChecked) 92 return I->second.MayInline; 98 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; 102 I->second.TotalBasicBlocks = TotalIDs; 110 return I->second.VisitedBasicBlocks.count(); 117 return I->second [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUArgumentUsageInfo.cpp | 58 << " PrivateSegmentBuffer: " << FI.second.PrivateSegmentBuffer 59 << " DispatchPtr: " << FI.second.DispatchPtr 60 << " QueuePtr: " << FI.second.QueuePtr 61 << " KernargSegmentPtr: " << FI.second.KernargSegmentPtr 62 << " DispatchID: " << FI.second.DispatchID 63 << " FlatScratchInit: " << FI.second.FlatScratchInit 64 << " PrivateSegmentSize: " << FI.second.PrivateSegmentSize 65 << " WorkGroupIDX: " << FI.second.WorkGroupIDX 66 << " WorkGroupIDY: " << FI.second.WorkGroupIDY 67 << " WorkGroupIDZ: " << FI.second [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | ImportedFunctionsInliningStatistics.cpp | 52 // We could avoid second lookup, but it would make the code ultra ugly. 107 assert(Node->second->NumberOfInlines >= Node->second->NumberOfRealInlines); 108 if (Node->second->NumberOfInlines == 0) 111 if (Node->second->Imported) { 114 int(Node->second->NumberOfRealInlines > 0); 118 int(Node->second->NumberOfRealInlines > 0); 123 << (Node->second->Imported ? "imported " : "not imported ") 125 << ": #inlines = " << Node->second->NumberOfInlines 127 << Node->second [all...] |
/freebsd-11-stable/contrib/expat/tests/ |
H A D | udiffer.py | 48 parser.add_argument('second', metavar='FILE') 52 second = _read_lines(config.second) 54 diffs = list(difflib.unified_diff(first, second, fromfile=config.first, 55 tofile=config.second))
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | UserIDResolver.cpp | 22 if (iter_bool.second) 23 iter_bool.first->second = (this->*do_get)(id); 24 if (iter_bool.first->second) 25 return llvm::StringRef(*iter_bool.first->second);
|
/freebsd-11-stable/sys/i386/isa/ |
H A D | pmtimer.c | 96 u_int second, minute, hour; local 120 second = resume_time.tv_sec; 122 second = resume_time.tv_sec - suspend_time.tv_sec; 124 hour = second / 3600; 125 second %= 3600; 126 minute = second / 60; 127 second %= 60; 129 hour, minute, second);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/ |
H A D | InMemoryModuleCache.cpp | 19 if (I->second.IsFinal) 21 return I->second.Buffer ? Tentative : ToBuild; 28 assert(Insertion.second && "Already has a PCM"); 29 return *Insertion.first->second.Buffer; 48 return I->second.Buffer.get(); 63 auto &PCM = I->second; 77 auto &PCM = I->second;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 37 assert(I->second < Vector.size()); 38 assert(Vector[I->second].first == I->first); 58 if (Pair.second) { 60 Pair.first->second = Num; 62 return Vector[Num].second; 64 return Vector[Pair.first->second].second; 70 if (Pair.second) { 72 Pair.first->second = Num; 76 return std::make_pair(Vector.begin() + Pair.first->second, fals [all...] |
/freebsd-11-stable/contrib/libstdc++/include/bits/ |
H A D | stl_pair.h | 71 typedef _T2 second_type; ///< @c second_type is the second bound type 74 _T2 second; ///< @c second is a copy of the second object member in struct:pair 78 /** The default constructor creates @c first and @c second using their 81 : first(), second() { } 85 : first(__a), second(__b) { } 90 : first(__p.first), second(__p.second) { } 97 { return __x.first == __y.first && __x.second [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | MaximumSpanningTree.h | 46 if (X.second > Y.second) return true; 47 if (X.second < Y.second) return false; 55 size_t XSizeB = getBlockSize(X.first.second); 56 size_t YSizeB = getBlockSize(Y.first.second); 81 Forest.insert(e.second); 89 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) { 90 Forest.unionSets(e.first, e.second);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | SyntheticCountsUtils.cpp | 57 auto OptProfCount = GetProfCount(E.first, E.second); 60 auto Callee = CGT::edge_dest(E.second); 66 AddCount(Entry.first, Entry.second); 70 auto OptProfCount = GetProfCount(E.first, E.second); 73 auto Callee = CGT::edge_dest(E.second);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
H A D | InjectedSourceStream.cpp | 43 if (Entry.second.Size != sizeof(SrcHeaderBlockEntry)) 46 if (Entry.second.Version != 52 auto Name = Strings.getStringForID(Entry.second.FileNI); 55 auto ObjName = Strings.getStringForID(Entry.second.ObjNI); 58 auto VName = Strings.getStringForID(Entry.second.VFileNI);
|
/freebsd-11-stable/contrib/bmake/unit-tests/ |
H A D | escape.exp | 47 printf "%s=:%s:\n" VAR1BSNL00 first\ line; printf "%s=:%s:\n" VAR1BSNL0 first\ line\ no\ space\ on\ second\ line; printf "%s=:%s:\n" VAR1BSNLs first\ line\ one\ space\ on\ second\ line; printf "%s=:%s:\n" VAR1BSNLss first\ line\ two\ spaces\ on\ second\ line; printf "%s=:%s:\n" VAR1BSNLt first\ line\ one\ tab\ on\ second\ line; printf "%s=:%s:\n" VAR1BSNLtt first\ line\ two\ tabs\ on\ second\ line; printf "%s=:%s:\n" VAR1BSNLxx first\ line\ many\ spaces\ and\ tabs\ \[\ \ \ \ \]\ on\ second\ line; 49 VAR1BSNL0=:first line no space on second line: 50 VAR1BSNLs=:first line one space on second line: 51 VAR1BSNLss=:first line two spaces on second line: 52 VAR1BSNLt=:first line one tab on second lin [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | WebAssemblyDisassemblerEmitter.cpp | 55 if (CGIP.second) { 60 auto IsCanonicalExisting = CGIP.second->TheDef->getValue("IsCanonical") 74 if (CGIP.second->AsmString.size() <= CGI.AsmString.size()) 97 if (PrefixPair.second.empty()) 102 auto InstIt = PrefixPair.second.find(I); 103 if (InstIt != PrefixPair.second.end()) { 105 assert(InstIt->second.second); 106 auto &CGI = *InstIt->second.second; [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | insert_store_hash_fn_imps.hpp | 65 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); 76 std::make_pair(pos, pos_hash_pair.second) : 77 std::make_pair(ins_pos, pos_hash_pair.second)); 86 r_key, pos_hash_pair.second)) 90 return std::make_pair(pos, pos_hash_pair.second); 101 return std::make_pair(ins_pos, pos_hash_pair.second);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | cmp_fn_imps.hpp | 77 if (p_mapped_value->second != it->second)
|
H A D | debug_store_hash_fn_imps.hpp | 56 _GLIBCXX_DEBUG_ASSERT(p_e->m_hash == pos_hash_pair.second);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/ |
H A D | GenericValue.h | 26 unsigned int second; member in struct:llvm::GenericValue::IntPair 44 UIntPairVal.second = 0;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/ |
H A D | CodeEmitter.cpp | 21 if (EI.second) 32 EI.second = Code.size() - EI.first;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | CFGDiff.h | 51 // - second pair item is BasicBlock *, then InverseEdge = false (so it inherits 53 // - second pair item is Inverse<BasicBlock *>, then InverseEdge = true (so it 92 for (auto Child : Pair.second) { 124 auto &EdgesForBB = It->second; 135 return make_range(It->second.begin(), It->second.end()); 168 return !N.first->ignoreChild(BB, N.second, false); 182 auto InsertVec = N.first->getAddedChildren(N.second, false); 185 make_range<ExistingChildIterator>({succ_begin(N.second), N.first}, 186 {succ_end(N.second), [all...] |
/freebsd-11-stable/usr.sbin/etcupdate/tests/ |
H A D | tests_test.sh | 68 states="equal first second difftype difflinks difffiles" 91 # compare is "equal"), then the second and third comparisons 96 # of the '*/second/second' cases are relevant. 147 # /first/equal/second: Remove unmodified files. The files 150 mkfifo $i/first/equal/second/fifo 151 echo "foo" > $i/first/equal/second/file 152 mkdir $i/first/equal/second/emptydir 153 ln -s "bar" $i/first/equal/second/link 154 mkdir $i/first/equal/second/fulldi [all...] |