/freebsd-9.3-release/tools/tools/cd2dvd/ |
H A D | cd2dvd.sh | 88 echo "Error: Failed to find cdrom.inf for ${_img}." 118 (cd "${_mnt}" && find . ${_exclude} | cpio -p -d -m -V --quiet "${_dst}") || exit 1
|
/freebsd-9.3-release/tools/tools/tinybsd/ |
H A D | tinybsd | 200 echo "${TS} Error: Could not find config (${CONF})" 351 find "${WORKDIR}" -type f |while read file; do 408 for custom in `find ${CURRENTDIR}/conf/${CONF}/ -type d -depth 1 \! -name CVS`; do 454 cd ${WORKDIR} && find . -print | sed '/kernel/ d' | cpio -dump ${IMGMNT} || true 474 ( cd ${WORKDIR} && find . -print | cpio -dump ${IMGMNT} ) || true
|
/freebsd-9.3-release/contrib/ntp/sntp/unity/auto/ |
H A D | unity_test_summary.rb | 111 if summary.find { |v| v =~ /(\d+) Tests (\d+) Failures (\d+) Ignored/ }
|
/freebsd-9.3-release/contrib/bind9/lib/dns/ |
H A D | resolver.c | 236 dns_adbfind_t * find; member in struct:fetchctx 807 dns_adbfind_t *find; local 890 for (find = ISC_LIST_HEAD(fctx->finds); 891 find != NULL; 892 find = ISC_LIST_NEXT(find, publink)) 893 for (addrinfo = ISC_LIST_HEAD(find->list); 907 for (find = ISC_LIST_HEAD(fctx->altfinds); 908 find != NULL; 909 find 987 dns_adbfind_t *find, *next_find; local 1003 dns_adbfind_t *find, *next_find; local 2178 dns_adbfind_t *find; local 2407 sort_adbfind(dns_adbfind_t *find) argument 2470 dns_adbfind_t *find; local 2901 dns_adbfind_t *find, *start; local [all...] |
/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-ssa-structalias.c | 333 /* Lookup a heap var for FROM, and return it if we find one. */ 495 find (unsigned int node) function 499 return graph->rep[node] = find (graph->rep[node]); 597 find and collapse cycles in the constraint graph (updating 805 gcc_assert (find (from) == to); 856 unsigned int tonode = find (graph->indirect_cycles[to]); 857 unsigned int fromnode = find (graph->indirect_cycles[from]); 1060 lhsvar = find (get_varinfo_fc (lhs.var)->id); 1061 rhsvar = find (get_varinfo_fc (rhs.var)->id); 1076 gcc_assert (find (get_varinfo_f [all...] |
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | ScheduleDAGInstrs.cpp | 68 // If we find a ptrtoint, we can transfer control back to the 72 // If we find an add of a constant, a multiplied value, or a phi, it's 254 for (Reg2SUnitsMap::iterator I = Uses.find(*Alias); I != Uses.end(); ++I) { 301 for (Reg2SUnitsMap::iterator I = Defs.find(*Alias); I != Defs.end(); ++I) { 382 VReg2SUnitMap::iterator DefI = VRegDefs.find(Reg); 408 VReg2UseMap::iterator UI = VRegUses.find(Reg); 444 VReg2SUnitMap::iterator DefI = VRegDefs.find(Reg); 766 assert(RPTracker->getPos() == prior(MII) && "RPTracker can't find MI"); 891 ((ThisMayAlias) ? AliasMemDefs.find(V) : NonAliasMemDefs.find( [all...] |
H A D | SlotIndexes.cpp | 194 } else if (MI && mi2iMap.find(MI) == mi2iMap.end()) { 211 if (!MI->isDebugValue() && mi2iMap.find(MI) == mi2iMap.end())
|
/freebsd-9.3-release/contrib/bmake/mk/ |
H A D | sys.dependfile.mk | 28 # The order of preference: we will use the first one of these we find.
|
/freebsd-9.3-release/contrib/ipfilter/ipsend/ |
H A D | Makefile | 182 find . -type d -name CVS -print | xargs /bin/rm -rf 183 find . -type f -name .cvsignore -print | xargs /bin/rm -f
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | lu_map_.hpp | 238 find(const_key_reference r_key) function in class:pb_ds::detail::PB_DS_CLASS_NAME 246 find(const_key_reference r_key) const function in class:pb_ds::detail::PB_DS_CLASS_NAME
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | find_fn_imps.hpp | 50 find(const_key_reference r_key) function in class:PB_DS_CLASS_C_DEC 74 find(const_key_reference r_key) const function in class:PB_DS_CLASS_C_DEC
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | splay_tree_.hpp | 216 find(const_key_reference); 219 find(const_key_reference) const;
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | EquivalenceClasses.h | 11 // efficient union-find algorithm. 26 /// own, union two classes, and find the class for a given element. In 159 return TheMapping.find(V); 193 /// insert - Insert a new value into the union/find set, ignoring the request 201 /// makes union-find "union findy". This returns an end iterator if the value 209 return findLeader(TheMapping.find(V));
|
H A D | ScopedHashTable.h | 180 typename DenseMap<K, ValTy*, KInfo>::iterator I = TopLevelMap.find(Key); 197 TopLevelMap.find(Key);
|
/freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/ |
H A D | CallGraph.h | 122 const_iterator I = FunctionMap.find(F); 127 const_iterator I = FunctionMap.find(F);
|
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 242 iterator find(SUnit *SU) { function in class:llvm::ReadyQueue 243 return std::find(Queue.begin(), Queue.end(), SU);
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 117 if (Attrs.find("shape=") == std::string::npos) 191 NodeGraphAttrs.find(N);
|
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/RuntimeDyld/ |
H A D | RuntimeDyldImpl.h | 324 SymbolTableMap::const_iterator pos = GlobalSymbolTable.find(Name); 334 SymbolTableMap::const_iterator pos = GlobalSymbolTable.find(Name);
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | InlineAsm.cpp | 150 StringRef::iterator ConstraintEnd = std::find(I+1, E, '}'); 222 StringRef::iterator ConstraintEnd = std::find(I, E, ',');
|
/freebsd-9.3-release/contrib/llvm/lib/Support/Windows/ |
H A D | DynamicLibrary.inc | 128 StringMap<void *>::iterator i = ExplicitSymbols->find(symbolName);
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | BypassSlowDivision.cpp | 194 DivCacheTy::iterator CacheI = PerBBDivCache.find(Key); 250 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | DeclContextInternals.h | 118 DeclsTy::iterator I = std::find(Vec.begin(), Vec.end(), D); 122 assert(std::find(Vec.begin(), Vec.end(), D)
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | ObjCUnusedIVarsChecker.cpp | 39 IvarUsageMap::iterator I = M.find(D); 73 IvarUsageMap::iterator I = M.find(ID);
|
/freebsd-9.3-release/contrib/llvm/utils/TableGen/ |
H A D | CodeGenDAGPatterns.h | 391 if (std::find(PredicateFns.begin(), PredicateFns.end(), Fn) == 711 return SDNodes.find(R)->second; 718 return SDNodeXForms.find(R)->second; 729 return ComplexPatterns.find(R)->second; 758 return DefaultOperands.find(R)->second; 764 return PatternFragments.find(R)->second; 768 return PatternFragments.find(R)->second; 789 return Instructions.find(R)->second;
|
/freebsd-9.3-release/contrib/ncurses/ |
H A D | convert_configure.pl | 117 99/11 : find sendmail
|