/freebsd-9.3-release/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-9.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | FunctionSummary.h | 73 I->second.InlineChecked = 1; 74 I->second.MayInline = 1; 79 I->second.InlineChecked = 1; 80 I->second.MayInline = 0; 89 if (I != Map.end() && I->second.InlineChecked) 90 return I->second.MayInline; 96 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; 100 I->second.TotalBasicBlocks = TotalIDs; 108 return I->second.VisitedBasicBlocks.count(); 115 return I->second [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | FunctionSummary.cpp | 21 Total += I->second.TotalBasicBlocks; 29 Total += I->second.VisitedBasicBlocks.count();
|
H A D | ConstraintManager.cpp | 34 if (P.first && !P.second) 36 if (!P.first && P.second)
|
/freebsd-9.3-release/sys/i386/isa/ |
H A D | pmtimer.c | 100 u_int second, minute, hour; local 124 second = resume_time.tv_sec - suspend_time.tv_sec; 130 second = resume_time.tv_sec; 132 hour = second / 3600; 133 second %= 3600; 134 minute = second / 60; 135 second %= 60; 137 hour, minute, second);
|
/freebsd-9.3-release/tools/regression/usr.sbin/etcupdate/ |
H A D | always.sh | 67 states="equal first second difftype difflinks difffiles" 94 # /first/difftype/second: File with different local type 96 mkfifo $OLD/first/difftype/second/fifo 97 mkdir $TEST/first/difftype/second/fifo 99 # /first/difflinks/second: Modified link removed. Should 101 ln -s "old link" $OLD/first/difflinks/second/link 102 ln -s "test link" $TEST/first/difflinks/second/link 104 # /first/difffiles/second: Modified file removed. Should 106 echo "foo" > $OLD/first/difffiles/second/file 107 echo "bar" > $TEST/first/difffiles/second/fil [all...] |
H A D | tests.sh | 67 states="equal first second difftype difflinks difffiles" 90 # compare is "equal"), then the second and third comparisons 95 # of the '*/second/second' cases are relevant. 146 # /first/equal/second: Remove unmodified files. The files 149 mkfifo $i/first/equal/second/fifo 150 echo "foo" > $i/first/equal/second/file 151 mkdir $i/first/equal/second/emptydir 152 ln -s "bar" $i/first/equal/second/link 153 mkdir $i/first/equal/second/fulldi [all...] |
/freebsd-9.3-release/contrib/ntp/tests/libntp/ |
H A D | clocktime.c | 58 const int yday=175, hour=12, minute=50, second=0, tzoff=0; local 63 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, 84 const int yday=175, hour=12, minute=0, second=0, tzoff=0; local 89 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, 108 const int yday=175, hour=4, minute=0, second=0, tzoff=8; local 113 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, timestamp, 129 const int yday=2, hour=11, minute=0, second=0, tzoff=0; local 134 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzoff, timestamp, 150 const int yday=365, hour=23, minute=0, second=0, tzoff=0; local 155 TEST_ASSERT_TRUE(clocktime(yday, hour, minute, second, tzof 171 const int yday=1, hour=1, minute=0, second=0, tzoff=0; local 188 const int yday=100, hour=12, minute=0, second=0, tzoff=0; local [all...] |
H A D | lfpfunc.c | 29 int l_fp_scmp(const l_fp first, const l_fp second); 30 int l_fp_ucmp(const l_fp first, l_fp second); 32 l_fp l_fp_add(const l_fp first, const l_fp second); 33 l_fp l_fp_subtract(const l_fp first, const l_fp second); 39 void l_fp_swap(l_fp * first, l_fp *second); 40 bool l_isgt(const l_fp first, const l_fp second); 41 bool l_isgtu(const l_fp first, const l_fp second); 42 bool l_ishis(const l_fp first, const l_fp second); 43 bool l_isgeq(const l_fp first, const l_fp second); 44 bool l_isequ(const l_fp first, const l_fp second); 69 l_fp_scmp(const l_fp first, const l_fp second) argument 86 l_fp_ucmp(const l_fp first, l_fp second) argument 129 l_fp_add(const l_fp first, const l_fp second) argument 138 l_fp_subtract(const l_fp first, const l_fp second) argument 189 l_fp_swap(l_fp * first, l_fp *second) argument 207 l_isgt(const l_fp first, const l_fp second) argument 214 l_isgtu(const l_fp first, const l_fp second) argument 221 l_ishis(const l_fp first, const l_fp second) argument 228 l_isgeq(const l_fp first, const l_fp second) argument 235 l_isequ(const l_fp first, const l_fp second) argument [all...] |
/freebsd-9.3-release/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-9.3-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | MaximumSpanningTree.h | 47 if (X.second > Y.second) return true; 48 if (X.second < Y.second) return false; 56 size_t XSizeB = getBlockSize(X.first.second); 57 size_t YSizeB = getBlockSize(Y.first.second); 83 Forest.insert(e.second); 91 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) { 92 Forest.unionSets(e.first, e.second);
|
/freebsd-9.3-release/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);
|
H A D | erase_store_hash_fn_imps.hpp | 58 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); 73 r_key, pos_hash_pair.second))
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 57 p_e->m_hash = ranged_probe_fn_base::operator()(PB_DS_V2F(r_val)).second;
|
/freebsd-9.3-release/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);
|
H A D | info_fn_imps.hpp | 94 if (p_mapped_value->second != it->second)
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 58 p->m_hash = ranged_hash_fn_base::operator()((const_key_reference)(PB_DS_V2F(p->m_value))).second;
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ExecutionEngine/ |
H A D | GenericValue.h | 29 unsigned int second; member in struct:llvm::GenericValue::IntPair 45 GenericValue() : IntVal(1,0) {UIntPairVal.first = 0; UIntPairVal.second = 0;}
|
/freebsd-9.3-release/contrib/llvm/lib/Object/ |
H A D | ELFObjectFile.cpp | 28 if (Ident.first == ELF::ELFCLASS32 && Ident.second == ELF::ELFDATA2LSB) 38 else if (Ident.first == ELF::ELFCLASS32 && Ident.second == ELF::ELFDATA2MSB) 48 else if (Ident.first == ELF::ELFCLASS64 && Ident.second == ELF::ELFDATA2MSB) 58 else if (Ident.first == ELF::ELFCLASS64 && Ident.second == ELF::ELFDATA2LSB) {
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | MapVector.h | 80 unsigned &I = Result.first->second; 81 if (Result.second) { 85 return Vector[I].second; 90 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; 96 unsigned &I = Result.first->second; 97 if (Result.second) { 98 Vector.push_back(std::make_pair(KV.first, KV.second)); 113 (Vector.begin() + Pos->second); 119 (Vector.begin() + Pos->second); [all...] |
/freebsd-9.3-release/contrib/llvm/lib/TableGen/ |
H A D | StringMatcher.cpp | 55 StringRef Code = Matches[0]->second; 60 Code = Split.second; 64 Code = Split.second; 110 << LI->second.size() << " string"; 111 if (LI->second.size() != 1) OS << 's'; 113 if (EmitStringMatcherForChar(LI->second, CharNo+1, IndentCount+1)) 142 << LI->second.size() 143 << " string" << (LI->second.size() == 1 ? "" : "s") << " to match.\n"; 144 if (EmitStringMatcherForChar(LI->second, 0, Indent))
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | PassManager.cpp | 41 if (I->second->invalidate(M)) 51 if (I->second->invalidate(F)) { 69 if (I->second->invalidate(M)) 81 FunctionAnalysisResultListT &ResultsList = FI->second; 85 if (I->second->invalidate(F)) { 112 RI->second = PI->second->run(M); 115 return *RI->second; 135 ResultList.push_back(std::make_pair(PassID, PI->second->run(F))); 136 RI->second [all...] |
/freebsd-9.3-release/contrib/ntp/libntp/ |
H A D | caltontp.c | 50 REQUIRE(jt->second <= SECSPERMIN); 66 jt->second));
|
/freebsd-9.3-release/usr.bin/lex/ |
H A D | nfa.c | 359 * branch = mkbranch( first, second ); 361 * branch - a machine which matches either first's pattern or second's 362 * first, second - machines whose patterns are to be or'ed (the | operator) 364 * Note that first and second are NEITHER destroyed by the operation. Also, 369 int mkbranch( first, second ) 370 int first, second; 375 return second; 377 else if ( second == NO_TRANSITION ) 383 mkxtion( eps, second ); 446 * new = mkor( first, second ); [all...] |