/freebsd-9.3-release/contrib/llvm/lib/Support/Windows/ |
H A D | Program.inc | 32 // This function just uses the PATH environment variable to find the program. 39 if (progName.find('\\') != std::string::npos || 40 progName.find('/') != std::string::npos)
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 166 typename BlockDataMapTy::iterator I = M.find(B); 242 M.find(ItrTraits::PrevEdge(B, PrevBlk)); 256 typename BlockDataMapTy::iterator BI = D.getBlockDataMap().find(B); 323 typename EdgeDataMapTy::iterator I = M.find(E);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Frontend/ |
H A D | TextDiagnosticBuffer.cpp | 48 size_t Pos = Str.find('%');
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Rewrite/Core/ |
H A D | TokenRewriter.cpp | 61 TokenAtLoc.find(I->getLocation());
|
/freebsd-9.3-release/crypto/openssl/demos/easy_tls/ |
H A D | Makefile | 81 tar cfv - `find . -type f -a ! -name '*.tgz' -a ! -name '*.tar.gz'` | \
|
/freebsd-9.3-release/share/zoneinfo/ |
H A D | Makefile | 82 find . -type f -print -exec ${INSTALL} \
|
/freebsd-9.3-release/tools/regression/usr.bin/lastcomm/ |
H A D | values.sh | 35 run find /usr/src -name xyzzy
|
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/IntelJITEvents/ |
H A D | IntelJITEventListener.cpp | 183 MethodIDMap::iterator I = MethodIDs.find(FnStart); 265 ObjectMap::iterator OI = LoadedObjectMap.find(ObjData); 276 MethodIDMap::iterator MI = MethodIDs.find(FnStart);
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | PassManager.cpp | 109 ModuleAnalysisPasses.find(PassID); 131 FunctionAnalysisPasses.find(PassID); 152 FunctionAnalysisResults.find(std::make_pair(PassID, F));
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | SpecialCaseList.cpp | 127 for (size_t pos = 0; (pos = Regexp.find("*", pos)) != std::string::npos; 214 StringMap<StringMap<Entry> >::const_iterator I = Entries.find(Section); 216 StringMap<Entry>::const_iterator II = I->second.find(Category);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DirectIvarAssignment.cpp | 47 M->getSelector().getNameForSlot(0).find("init") != StringRef::npos || 48 M->getSelector().getNameForSlot(0).find("Init") != StringRef::npos) 184 IvarToPropertyMapTy::const_iterator I = IvarToPropMap.find(D);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 103 if (Tree.find(R) != Tree.end()) { 211 if (DeclContexts.find(B) != DeclContexts.end()) { 223 if (DeclContexts.find(*i) != DeclContexts.end())
|
/freebsd-9.3-release/usr.sbin/adduser/ |
H A D | rmuser.sh | 68 filecount=`find 2>/dev/null "$_dir" -user "$login" -delete -print | 123 atjoblist=`find 2>/dev/null ${ATJOBDIR} -maxdepth 1 -user $login -print` 270 _insecure=`find $ffile ! -user 0 -or -perm +0022`
|
/freebsd-9.3-release/contrib/libstdc++/include/bits/ |
H A D | stl_map.h | 541 find(const key_type& __x) function in class:map 542 { return _M_t.find(__x); } 556 find(const key_type& __x) const function in class:map 557 { return _M_t.find(__x); } 569 { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
|
/freebsd-9.3-release/contrib/libstdc++/include/debug/ |
H A D | map.h | 189 iterator __victim = find(__x); 227 find(const key_type& __x) function in class:std::__debug::map 228 { return iterator(_Base::find(__x), this); } 231 find(const key_type& __x) const function in class:std::__debug::map 232 { return const_iterator(_Base::find(__x), this); }
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | StringMap.h | 291 iterator find(StringRef Key) { function in class:llvm::StringMap 297 const_iterator find(StringRef Key) const { function in class:llvm::StringMap 306 const_iterator it = find(Key); 317 return find(Key) == end() ? 0 : 1; 400 iterator I = find(Key);
|
/freebsd-9.3-release/contrib/llvm/lib/Target/R600/ |
H A D | R600OptimizeVectorRegisters.cpp | 150 Untouched->RegToChan.find((*It).first); 201 std::find(UpdatedUndef.begin(), UpdatedUndef.end(), Chan); 204 assert(std::find(UpdatedUndef.begin(), UpdatedUndef.end(), Chan) == 236 MIs.erase(std::find(MIs.begin(), MIs.end(), MI), MIs.end()); 241 MIs.erase(std::find(MIs.begin(), MIs.end(), MI), MIs.end());
|
/freebsd-9.3-release/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder.c | 89 // (which I find cleanest), but we need size_t here when filling 252 mf->find = &lzma_mf_hc3_find; 258 mf->find = &lzma_mf_hc4_find; 264 mf->find = &lzma_mf_bt2_find; 270 mf->find = &lzma_mf_bt3_find; 276 mf->find = &lzma_mf_bt4_find;
|
/freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
H A D | RegionInfo.cpp | 259 if (*SI != exit && visited->find(*SI) == visited->end()) 316 BBNodeMapT::const_iterator at = BBNodeMap.find(BB); 344 assert(std::find(begin(), end(), SubRegion) == children.end() 380 RegionSet::iterator I = std::find(children.begin(), children.end(), Child); 495 DST *entrySuccs = &DF->find(entry)->second; 508 DST *exitSuccs = &DF->find(exit)->second; 515 if (exitSuccs->find(*SI) == exitSuccs->end()) 535 BBtoBBMap::iterator e = ShortCut->find(exit); 551 BBtoBBMap::iterator e = ShortCut->find(N->getBlock()); 664 BBtoRegionMap::iterator it = BBtoRegion.find(B [all...] |
/freebsd-9.3-release/contrib/dialog/ |
H A D | inputstr.c | 112 CACHE find; local 114 memset(&find, 0, sizeof(find)); 115 find.cache_at = cache; 116 find.string_at = string; 118 if ((pp = tfind(&find, &sorted_cache, compare_cache)) != 0) { 370 * Given the character-offset to find in the list, return the corresponding
|
/freebsd-9.3-release/contrib/libstdc++/src/ |
H A D | istream.cc | 65 const char_type* __p = traits_type::find(__sb->gptr(), 140 const char_type* __p = traits_type::find(__sb->gptr(), 374 const __char_type* __p = __traits_type::find(__sb->gptr(), 445 const char_type* __p = traits_type::find(__sb->gptr(), 520 const char_type* __p = traits_type::find(__sb->gptr(), 603 const __char_type* __p = __traits_type::find(__sb->gptr(),
|
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | SlotIndexes.h | 416 Mi2IndexMap::const_iterator itr = mi2iMap.find(getBundleStart(MI)); 450 Mi2IndexMap::const_iterator MapItr = mi2iMap.find(I); 467 Mi2IndexMap::const_iterator MapItr = mi2iMap.find(I); 572 assert(mi2iMap.find(mi) == mi2iMap.end() && "Instr already indexed."); 613 Mi2IndexMap::iterator mi2iItr = mi2iMap.find(mi); 626 Mi2IndexMap::iterator mi2iItr = mi2iMap.find(mi);
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | StackColoring.cpp | 155 /// Scan the machine function and find all of the lifetime markers. 210 LivenessMap::const_iterator BI = BlockLiveness.find(*FI); 239 // Scan the function to find all lifetime markers. 321 LivenessMap::iterator BI = BlockLiveness.find(BB); 331 LivenessMap::const_iterator I = BlockLiveness.find(*PI); 341 LivenessMap::const_iterator I = BlockLiveness.find(*SI); 395 // For each block, find which slots are active within this block 533 // Climb up and find the original alloca. 535 // If we did not find one, or if the one that we found is not in our 581 assert(Interval->find(Inde [all...] |
/freebsd-9.3-release/contrib/llvm/lib/MC/ |
H A D | MCModuleYAML.cpp | 67 EnumValByNameTy::const_iterator It = RegEnumValueByName.find(Name); 74 EnumValByNameTy::const_iterator It = InstEnumValueByName.find(Name); 407 AddrToTextAtomTy::const_iterator It = TAByAddr.find(BBI->Address); 414 MCBasicBlock *MCBB = MCFN->find(BBI->Address); 416 return "Couldn't find matching basic block in function."; 419 MCBasicBlock *Pred = MCFN->find(*PI); 421 return "Couldn't find predecessor basic block."; 426 MCBasicBlock *Succ = MCFN->find(*SI); 428 return "Couldn't find predecessor basic block.";
|