/freebsd-9.3-release/contrib/llvm/lib/Target/Hexagon/ |
H A D | HexagonMachineFunctionInfo.h | 66 (PacketInfo.find(MI)->second & Hexagon::StartPacket)); 70 (PacketInfo.find(MI)->second & Hexagon::EndPacket));
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | PostOrderCFGView.cpp | 42 PostOrderCFGView::BlockOrderTy::const_iterator b1It = POV.BlockOrder.find(b1); 43 PostOrderCFGView::BlockOrderTy::const_iterator b2It = POV.BlockOrder.find(b2);
|
/freebsd-9.3-release/etc/periodic/daily/ |
H A D | 100.clean-disks | 44 rc=$(find / \( ! -fstype local -o -fstype rdonly \) -prune -o \
|
H A D | 120.clean-preserve | 41 rc=$(find . ! -name . -mtime +$daily_clean_preserve_days \
|
H A D | 140.clean-rwho | 41 rc=$(find . ! -name . -mtime +$daily_clean_rwho_days \
|
H A D | 405.status-ata-raid | 20 for raid in `find /dev/ -name 'ar[0-9]*' -type c | egrep '[0-9]$' \
|
/freebsd-9.3-release/etc/periodic/security/ |
H A D | 100.chksetuid | 47 find -sx $MP /dev/null -type f \
|
H A D | 110.neggrpperm | 45 n=$(find -sx $MP /dev/null -type f \
|
/freebsd-9.3-release/etc/rc.d/ |
H A D | ldconfig | 28 _files=`find ${i} -type f` 46 _files=`find ${i} -type f`
|
/freebsd-9.3-release/share/mk/ |
H A D | bsd.kmod.mk | 12 .error "can't find kernel source tree"
|
/freebsd-9.3-release/share/sendmail/ |
H A D | Makefile | 7 CFDIRS!= (cd ${SENDMAIL_DIR}; find -L ${CFDIR} \( \( -name CVS -o -name .svn \) -prune \) -o -type d -print) 8 CFFILES!= (cd ${SENDMAIL_DIR}; find -L ${CFDIR} \( \( -name CVS -o -name .svn \) -prune \) -o -type f -print)
|
/freebsd-9.3-release/tools/tools/kernxref/ |
H A D | kernxref.sh | 70 MOD_OBJS=`find modules -name \*.o`
|
/freebsd-9.3-release/usr.bin/kdump/ |
H A D | mkioctls | 24 find -H -s * -name '*.h' | grep -v '.*disk.*\.h' | \ 89 # find where the name starts
|
/freebsd-9.3-release/contrib/bind9/lib/dns/include/dns/ |
H A D | adb.h | 144 * An event is desired. Check this bit in the returned find to see 161 * Return lame servers in a find, so that all addresses are returned. 178 * An event is desired. Check this bit in the returned find to see 203 * Return lame servers in a find, so that all addresses are returned. 338 in_port_t port, dns_adbfind_t **find); 344 unsigned int depth, dns_adbfind_t **find); 354 * If no events will be generated, the *find->result_v4 and/or result_v6 401 *\li find != NULL && *find == NULL. 424 dns_adb_cancelfind(dns_adbfind_t *find); [all...] |
/freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
H A D | AliasDebugger.cpp | 98 assert(Vals.find(LocA.Ptr) != Vals.end() && 100 assert(Vals.find(LocB.Ptr) != Vals.end() && 107 assert(Vals.find(Loc.Ptr) != Vals.end() && "Never seen value in AA before"); 117 assert(Vals.find(Loc.Ptr) != Vals.end() && "Never seen value in AA before"); 122 assert(Vals.find(V) != Vals.end() && "Never seen value in AA before");
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowValues.h | 88 typename EdgeDataMapTy::iterator I = EdgeDataMap.find(E); 102 typename BlockDataMapTy::iterator I = BlockDataMap.find(B); 119 typename StmtDataMapTy::iterator I = StmtDataMap->find(S);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Serialization/ |
H A D | ContinuousRangeMap.h | 91 iterator find(Int K) { function in class:clang::ContinuousRangeMap 100 const_iterator find(Int K) const { function in class:clang::ContinuousRangeMap 101 return const_cast<ContinuousRangeMap*>(this)->find(K);
|
/freebsd-9.3-release/crypto/openssh/contrib/ |
H A D | findssl.sh | 119 headers=`find / -name opensslv.h -print 2>/dev/null` 138 libraries=`find / -name 'libcrypto.s*' -print 2>/dev/null` 167 libraries=`find / -name libcrypto.a -print 2>/dev/null`
|
/freebsd-9.3-release/crypto/heimdal/lib/sl/ |
H A D | slc-gram.c | 1786 find(struct assignment *as, const char *name) 1828 a = find(as, "name"); 1834 b = find(as, "argument"); 1839 b = find(as, "help"); 1867 lopt = find(as, "long"); 1869 lopt = find(as, "name"); 1873 type = find(as, "type"); 1973 type = find(tmp->u.assignment, "type"); 1992 name = find(as, "name"); 1995 arg = find(a 1783 find(struct assignment *as, const char *name) function [all...] |
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | SparseSet.h | 87 /// clear() and iteration as fast as a vector. The find(), insert(), and 103 /// When SparseT is uint32_t, find() only touches 2 cache lines, but the sparse 106 /// When SparseT is uint8_t (the default), find() touches up to 2+[N/256] cache 190 // Sparse does not need to be cleared, see find(). 196 /// @param Idx A valid index to find. 217 /// find - Find an element by its key. 219 /// @param Key A valid key to find. 222 iterator find(const KeyT &Key) { 226 const_iterator find(const KeyT &Key) const { 233 return find(Ke [all...] |
H A D | UniqueVector.h | 55 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
|
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Solution.h | 83 SelectionsMap::const_iterator sItr = selections.find(nodeId);
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | AllocationOrder.cpp | 49 assert(std::find(Order.begin(), Order.end(), Hints[I]) != Order.end() &&
|
H A D | AllocationOrder.h | 79 return std::find(Hints.begin(), Hints.end(), PhysReg) != Hints.end();
|
H A D | LiveIntervalUnion.cpp | 36 SegmentIter SegPos = Segments.find(RegPos->start); 63 SegmentIter SegPos = Segments.find(RegPos->start); 105 std::find(InterferingVRegs.begin(), InterferingVRegs.end(), VirtReg); 137 LiveUnionI.find(VirtRegI->start);
|