Home
last modified time | relevance | path

Searched refs:second (Results 1 – 25 of 1797) sorted by relevance

12345678910>>...72

/NextBSD/usr.sbin/etcupdate/tests/
HDalways_test.sh97 mkfifo $OLD/first/difftype/second/fifo
98 mkdir $TEST/first/difftype/second/fifo
102 ln -s "old link" $OLD/first/difflinks/second/link
103 ln -s "test link" $TEST/first/difflinks/second/link
107 echo "foo" > $OLD/first/difffiles/second/file
108 echo "bar" > $TEST/first/difffiles/second/file
113 mkdir $NEW/second/second/difftype/dir
114 mkfifo $TEST/second/second/difftype/dir
118 ln -s "new link" $NEW/second/second/difflinks/link
119 ln -s "test link" $TEST/second/second/difflinks/link
[all …]
HDtests_test.sh150 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/fulldir
155 echo "foo" > $i/first/equal/second/fulldir/file
176 mkfifo $OLD/first/difftype/second/fifo
177 mkdir $TEST/first/difftype/second/fifo
184 ln -s "old link" $OLD/first/difflinks/second/link
185 ln -s "test link" $TEST/first/difflinks/second/link
[all …]
/NextBSD/contrib/bmake/unit-tests/
HDescape.exp47 …second\ line; printf "%s=:%s:\n" VAR1BSNLs first\ line\ one\ space\ on\ second\ line; printf "…
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 line:
53 VAR1BSNLtt=:first line two tabs on second line:
54 VAR1BSNLxx=:first line many spaces and tabs [ ] on second line:
63 second line spaces should be retained':
65 second line spaces should be retained:
67 second line tab should be elided':
[all …]
/NextBSD/contrib/ntp/tests/libntp/
HDlfpfunc.c32 int l_fp_scmp(const l_fp first, const l_fp second);
33 int l_fp_ucmp(const l_fp first, l_fp second);
35 l_fp l_fp_add(const l_fp first, const l_fp second);
36 l_fp l_fp_subtract(const l_fp first, const l_fp second);
42 void l_fp_swap(l_fp * first, l_fp *second);
43 bool l_isgt(const l_fp first, const l_fp second);
44 bool l_isgtu(const l_fp first, const l_fp second);
45 bool l_ishis(const l_fp first, const l_fp second);
46 bool l_isgeq(const l_fp first, const l_fp second);
47 bool l_isequ(const l_fp first, const l_fp second);
[all …]
HDclocktime.c58 const int yday=175, hour=12, minute=50, second=0, tzoff=0; in test_CurrentYear() local
63 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, in test_CurrentYear()
84 const int yday=175, hour=12, minute=0, second=0, tzoff=0; in test_CurrentYearFuzz() local
89 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, in test_CurrentYearFuzz()
108 const int yday=175, hour=4, minute=0, second=0, tzoff=8; in test_TimeZoneOffset() local
113 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, timestamp, in test_TimeZoneOffset()
129 const int yday=2, hour=11, minute=0, second=0, tzoff=0; in test_WrongYearStart() local
134 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, timestamp, in test_WrongYearStart()
150 const int yday=365, hour=23, minute=0, second=0, tzoff=0; in test_PreviousYear() local
155 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, timestamp, in test_PreviousYear()
[all …]
HDcalendar.c12 int isGT(int first, int second);
54 isGT(int first, int second) in isGT() argument
56 if(first > second) { in isGT()
83 (u_int)cal->hour, (u_int)cal->minute, (u_int)cal->second); in CalendarFromCalToString()
95 (u_int)iso->hour, (u_int)iso->minute, (u_int)iso->second); in CalendarFromIsoToString()
111 expected->second == actual->second) { in IsEqualCal()
136 expected->second == actual->second) { in IsEqualIso()
407 date.hour = date.minute = date.second = 0; in test_RoundTripYearStart()
427 date.hour = date.minute = date.second = 0; in test_RoundTripMonthStart()
446 date.hour = date.minute = date.second = 0; in test_RoundTripWeekStart()
[all …]
/NextBSD/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
HDFunctionSummary.h73 I->second.InlineChecked = 1; in markMayInline()
74 I->second.MayInline = 1; in markMayInline()
79 I->second.InlineChecked = 1; in markShouldNotInline()
80 I->second.MayInline = 0; in markShouldNotInline()
89 if (I != Map.end() && I->second.InlineChecked) in mayInline()
90 return I->second.MayInline; in mayInline()
96 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; in markVisitedBasicBlock()
100 I->second.TotalBasicBlocks = TotalIDs; in markVisitedBasicBlock()
108 return I->second.VisitedBasicBlocks.count(); in getNumVisitedBasicBlocks()
115 return I->second.TimesInlined; in getNumTimesInlined()
[all …]
/NextBSD/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/types/
HDtst.relenum.d48 second enumerator
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 > one && one != two && zero != first/
/NextBSD/contrib/llvm/lib/Transforms/ObjCARC/
HDBlotMapVector.h39 assert(I->second < Vector.size()); in ~BlotMapVector()
40 assert(Vector[I->second].first == I->first); in ~BlotMapVector()
52 if (Pair.second) {
54 Pair.first->second = Num;
56 return Vector[Num].second;
58 return Vector[Pair.first->second].second;
64 if (Pair.second) { in insert()
66 Pair.first->second = Num; in insert()
70 return std::make_pair(Vector.begin() + Pair.first->second, false); in insert()
77 return Vector.begin() + It->second; in find()
[all …]
/NextBSD/contrib/llvm/lib/Target/
HDTargetRecip.cpp101 KV.second.Enabled = Enable; in parseGlobalParams()
106 KV.second.RefinementSteps = RefSteps; in parseGlobalParams()
150 if (Iter->second.Enabled != Uninitialized) in parseIndividualParams()
154 Iter->second.Enabled = !IsDisabled; in parseIndividualParams()
156 Iter->second.RefinementSteps = RefSteps; in parseIndividualParams()
181 assert(Iter->second.Enabled != Uninitialized && in isEnabled()
183 return Iter->second.Enabled; in isEnabled()
189 assert(Iter->second.RefinementSteps != Uninitialized && in getRefinementSteps()
191 return Iter->second.RefinementSteps; in getRefinementSteps()
199 RecipParams &RP = KV.second; in setDefaults()
[all …]
/NextBSD/contrib/llvm/lib/Transforms/Instrumentation/
HDMaximumSpanningTree.h47 if (X.second > Y.second) return true; in operator()
48 if (X.second < Y.second) return false; in operator()
56 size_t XSizeB = getBlockSize(X.first.second); in operator()
57 size_t YSizeB = getBlockSize(Y.first.second); in operator()
83 Forest.insert(e.second); in MaximumSpanningTree()
91 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) { in MaximumSpanningTree()
92 Forest.unionSets(e.first, e.second); in MaximumSpanningTree()
/NextBSD/contrib/libstdc++/include/bits/
Dstl_pair.h74 _T2 second; ///< @c second is a copy of the second object member
81 : first(), second() { } in pair()
85 : first(__a), second(__b) { } in pair()
90 : first(__p.first), second(__p.second) { } in pair()
97 { return __x.first == __y.first && __x.second == __y.second; }
104 || (!(__y.first < __x.first) && __x.second < __y.second); }
/NextBSD/sys/i386/isa/
HDpmtimer.c96 u_int second, minute, hour; in pmtimer_resume() local
120 second = resume_time.tv_sec; in pmtimer_resume()
122 second = resume_time.tv_sec - suspend_time.tv_sec; in pmtimer_resume()
124 hour = second / 3600; in pmtimer_resume()
125 second %= 3600; in pmtimer_resume()
126 minute = second / 60; in pmtimer_resume()
127 second %= 60; in pmtimer_resume()
129 hour, minute, second); in pmtimer_resume()
/NextBSD/contrib/llvm/tools/clang/lib/CodeGen/
HDCGExprComplex.cpp354 Builder.CreateAlignedStore(Val.second, ImagPtr, AlignI, in EmitStoreOfComplex()
406 Val.second = CGF.EmitScalarConversion(Val.second, SrcType, DestType); in EmitComplexToComplexCast()
512 ResI = Builder.CreateFNeg(Op.second, "neg.i"); in VisitUnaryMinus()
515 ResI = Builder.CreateNeg(Op.second, "neg.i"); in VisitUnaryMinus()
526 if (Op.second->getType()->isFloatingPointTy()) in VisitUnaryNot()
527 ResI = Builder.CreateFNeg(Op.second, "conj.i"); in VisitUnaryNot()
529 ResI = Builder.CreateNeg(Op.second, "conj.i"); in VisitUnaryNot()
539 if (Op.LHS.second && Op.RHS.second) in EmitBinAdd()
540 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i"); in EmitBinAdd()
542 ResI = Op.LHS.second ? Op.LHS.second : Op.RHS.second; in EmitBinAdd()
[all …]
/NextBSD/contrib/llvm/tools/lldb/source/Target/
HDSectionLoadList.cpp73 section_load_addr = pos->second; in GetSectionLoadAddress()
105 if (load_addr == sta_pos->second) in SetSectionLoadAddress()
108 sta_pos->second = load_addr; in SetSectionLoadAddress()
127 if (warn_multiple && section != ats_pos->second) in SetSectionLoadAddress()
132 ModuleSP curr_module_sp (ats_pos->second->GetModule()); in SetSectionLoadAddress()
140 ats_pos->second->GetName().GetCString()); in SetSectionLoadAddress()
144 ats_pos->second = section; in SetSectionLoadAddress()
188 addr_t load_addr = sta_pos->second; in SetSectionUnloaded()
248 if (offset < pos->second->GetByteSize()) in ResolveLoadAddress()
252 return pos->second->ResolveContainedAddress (offset, so_addr); in ResolveLoadAddress()
[all …]
/NextBSD/contrib/ntp/
HDREADME.leapsmear19 Whenever a leap second is to be handled ntpd either:
21 - passes the leap second announcement down to the OS kernel (if the OS
22 supports this) and the kernel handles the leap second automatically, or
24 - applies the leap second correction itself.
26 NTP servers also pass a leap second warning flag down to their clients via
28 approaching leap second, and can handle the leap second appropriately.
33 If a leap second is to be inserted then in most Unix-like systems the OS
34 kernel just steps the time back by 1 second at the beginning of the leap
35 second, so the last second of the UTC day is repeated and thus duplicate
39 system time is stepped back, e.g. due to a leap second insertion. Thus,
[all …]
/NextBSD/contrib/llvm/tools/clang/lib/Basic/
HDFileManager.cpp140 if (NamedDirEnt.second) in addAncestorsAsVirtualDirs()
146 NamedDirEnt.second = UDE; in addAncestorsAsVirtualDirs()
179 if (NamedDirEnt.second) in getDirectory()
180 return NamedDirEnt.second == NON_EXISTENT_DIR ? nullptr in getDirectory()
181 : NamedDirEnt.second; in getDirectory()
186 NamedDirEnt.second = NON_EXISTENT_DIR; in getDirectory()
207 NamedDirEnt.second = &UDE; in getDirectory()
226 if (NamedFileEnt.second) in getFile()
227 return NamedFileEnt.second == NON_EXISTENT_FILE ? nullptr in getFile()
228 : NamedFileEnt.second; in getFile()
[all …]
/NextBSD/contrib/llvm/include/llvm/ADT/
HDMapVector.h78 unsigned &I = Result.first->second;
79 if (Result.second) {
83 return Vector[I].second;
88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
94 unsigned &I = Result.first->second; in insert()
95 if (Result.second) { in insert()
96 Vector.push_back(std::make_pair(KV.first, KV.second)); in insert()
111 (Vector.begin() + Pos->second); in find()
117 (Vector.begin() + Pos->second); in find()
143 assert(I.second != Index && "Index was already erased!"); in erase()
[all …]
/NextBSD/contrib/llvm/lib/TableGen/
HDStringMatcher.cpp55 StringRef Code = Matches[0]->second; in EmitStringMatcherForChar()
60 Code = Split.second; in EmitStringMatcherForChar()
64 Code = Split.second; in EmitStringMatcherForChar()
110 << LI->second.size() << " string"; in EmitStringMatcherForChar()
111 if (LI->second.size() != 1) OS << 's'; in EmitStringMatcherForChar()
113 if (EmitStringMatcherForChar(LI->second, CharNo+1, IndentCount+1)) in EmitStringMatcherForChar()
142 << LI->second.size() in Emit()
143 << " string" << (LI->second.size() == 1 ? "" : "s") << " to match.\n"; in Emit()
144 if (EmitStringMatcherForChar(LI->second, 0, Indent)) in Emit()
/NextBSD/contrib/flex/
HDnfa.c373 int mkbranch (first, second) in mkbranch() argument
374 int first, second; in mkbranch()
379 return second;
381 else if (second == NO_TRANSITION)
387 mkxtion (eps, second);
459 int mkor (first, second) in mkor() argument
460 int first, second; in mkor()
465 return second;
467 else if (second == NIL)
478 mkxtion (first, second);
[all …]
/NextBSD/contrib/llvm/lib/Transforms/Vectorize/
HDBBVectorize.cpp745 for (std::vector<Value *>::iterator J = I->second.begin(), in vectorizePairs()
746 JE = I->second.end(); J != JE; ++J) in vectorizePairs()
768 for (std::vector<ValuePair>::iterator J = I->second.begin(), in vectorizePairs()
769 JE = I->second.end(); J != JE; ++J) in vectorizePairs()
801 else if (FixedOrderPairs.count(ValuePair(I->second, I->first))) in vectorizePairs()
802 AllFixedOrderPairs.insert(ValuePair(I->second, I->first)); in vectorizePairs()
821 for (std::vector<ValuePair>::iterator J = I->second.begin(), in vectorizePairs()
822 JE = I->second.end(); J != JE; ++J) in vectorizePairs()
1354 for (User *UJ : P.second->users()) { in computePairsConnectedTo()
1356 P.second == SJ->getPointerOperand()) in computePairsConnectedTo()
[all …]
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
Dcc_ht_map_.hpp101 #define PB_DS_V2S(X) (X).second
398 return (p_e->m_value.second); in subscript_imp()
402 return insert_new_imp(value_type(r_key, mapped_type()), pos)->second; in subscript_imp()
413 !hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second)) in subscript_imp()
423 return p_e->m_value.second; in subscript_imp()
428 pos_hash_pair)->second; in subscript_imp()
467 p_e->m_hash = r_pos_hash_pair.second; in insert_new_imp()
508 r_key, pos_hash_pair.second)) in find_key_pointer()
555 for (++r_pos.second; r_pos.second < m_num_e; ++r_pos.second) in inc_it_state()
556 if (m_entries[r_pos.second] != NULL) in inc_it_state()
[all …]
/NextBSD/contrib/llvm/lib/Analysis/IPA/
HDCallGraph.cpp44 I.second->allReferencesDropped(); in ~CallGraph()
47 delete I.second; in ~CallGraph()
108 Nodes.push_back(I->second); in print()
154 I->second->F = const_cast<Function*>(To); in spliceFunction()
155 FunctionMap[To] = I->second; in spliceFunction()
185 if (Function *FI = I->second->getFunction()) in print()
204 I->second->DropRef(); in removeCallEdgeFor()
217 if (CalledFunctions[i].second == Callee) { in removeAnyCallEdgeTo()
231 if (CR.second == Callee && CR.first == nullptr) { in removeOneAbstractEdgeTo()
248 I->second->DropRef(); in replaceCallEdge()
[all …]
/NextBSD/contrib/llvm/tools/lldb/source/Plugins/Process/Utility/
HDDynamicRegisterInfo.cpp449 if (pos->second.size() > 1) in Finalize()
451 std::sort (pos->second.begin(), pos->second.end()); in Finalize()
452 … reg_num_collection::iterator unique_end = std::unique (pos->second.begin(), pos->second.end()); in Finalize()
453 if (unique_end != pos->second.end()) in Finalize()
454 pos->second.erase(unique_end, pos->second.end()); in Finalize()
456 assert (!pos->second.empty()); in Finalize()
457 if (pos->second.back() != LLDB_INVALID_REGNUM) in Finalize()
458 pos->second.push_back(LLDB_INVALID_REGNUM); in Finalize()
481 for (const uint32_t invalidate_reg_num : pos->second) in Finalize()
486 for (const uint32_t concrete_invalidate_reg_num : invalidate_pos->second) in Finalize()
[all …]
/NextBSD/contrib/tzdata/
HDleap-seconds.list23 # The second column shows the number of seconds that
66 # 4. The decision to insert a leap second into UTC is currently
88 # leap second is not well defined. The official name of that leap
89 # second is 23:59:60, but there is no way of representing that time
92 # one second during the leap second and use a time that is equivalent
96 # is used for the second time. Thus the leap second which
102 # 30 June 1972 23:59:60 (2287785599,second time): TAI= UTC + 11 seconds
106 # If your system realizes the leap second by repeating 00:00:00 UTC twice
108 # in the table must occur the second time that a time equivalent to
114 # 1 July 1972 00:00:00 (2287785600,second time): TAI= UTC + 11 seconds
[all …]

12345678910>>...72