/freebsd-head/crypto/openssh/openbsd-compat/ |
H A D | strcasestr.c | 46 * Find the first occurrence of find in s, ignore case. 49 strcasestr(const char *s, const char *find) argument 54 if ((c = *find++) != 0) { 56 len = strlen(find); 62 } while (strncasecmp(s, find, len) != 0);
|
/freebsd-head/lib/libc/string/ |
H A D | wcsstr.c | 46 * Find the first occurrence of find in s. 49 wcsstr(const wchar_t * __restrict s, const wchar_t * __restrict find) argument 54 if ((c = *find++) != L'\0') { 55 len = wcslen(find); 61 } while (wcsncmp(s, find, len) != 0);
|
H A D | strcasestr.c | 48 * Find the first occurrence of find in s, ignore case. 51 strcasestr_l(const char *s, const char *find, locale_t locale) argument 57 if ((c = *find++) != 0) { 59 len = strlen(find); 65 } while (strncasecmp_l(s, find, len, locale) != 0); 71 strcasestr(const char *s, const char *find) argument 73 return strcasestr_l(s, find, __get_locale());
|
H A D | strnstr.c | 45 * Find the first occurrence of find in s, where the search is limited to the 49 strnstr(const char *s, const char *find, size_t slen) argument 54 if ((c = *find++) != '\0') { 55 len = strlen(find); 63 } while (strncmp(s, find, len) != 0);
|
/freebsd-head/sys/libkern/ |
H A D | strstr.c | 42 * Find the first occurrence of find in s. 45 strstr(const char *s, const char *find) argument 50 if ((c = *find++) != 0) { 51 len = strlen(find); 57 } while (strncmp(s, find, len) != 0);
|
/freebsd-head/contrib/mandoc/ |
H A D | compat_strcasestr.c | 51 * Find the first occurrence of find in s, ignore case. 54 strcasestr(const char *s, const char *find) argument 59 if ((c = *find++) != 0) { 61 len = strlen(find); 67 } while (strncasecmp(s, find, len) != 0);
|
/freebsd-head/contrib/file/src/ |
H A D | strcasestr.c | 64 * Find the first occurrence of find in s, ignore case. 67 strcasestr(const char *s, const char *find) argument 72 if ((c = *find++) != 0) { 74 len = strlen(find); 80 } while (_strncasecmp(s, find, len) != 0);
|
/freebsd-head/contrib/elftoolchain/libpe/ |
H A D | libpe_rich.c | 37 memfind(char *s, const char *find, size_t slen, size_t flen) argument 45 if (s[i] != find[0]) 49 if (memcmp(&s[i + 1], &find[1], flen - 1) == 0)
|
/freebsd-head/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | CodeExpansions.h | 38 const_iterator find(StringRef Variable) const { function in class:llvm::CodeExpansions 39 return Expansions.find(Variable);
|
/freebsd-head/contrib/llvm-project/lld/MachO/ |
H A D | SymbolTable.cpp | 19 Symbol *SymbolTable::find(StringRef name) { function in class:SymbolTable 20 auto it = symMap.find(llvm::CachedHashStringRef(name));
|
/freebsd-head/contrib/llvm-project/clang/include/clang/Serialization/ |
H A D | ContinuousRangeMap.h | 93 iterator find(Int K) { function in class:clang::ContinuousRangeMap 102 const_iterator find(Int K) const { function in class:clang::ContinuousRangeMap 103 return const_cast<ContinuousRangeMap*>(this)->find(K);
|
/freebsd-head/tools/tools/notescheck/ |
H A D | notescheck.py | 138 def find(self, name): member in class:Options 287 option = options.find(word) 301 option = options.find(name) 315 option = options.find(words[1]) 321 option = options.find(words[1].split('=')[0])
|
/freebsd-head/lib/libfigpar/ |
H A D | string_m.c | 48 strcount(const char *source, const char *find) argument 55 if (source == NULL || find == NULL) 58 /* Cache the length of find element */ 59 flen = strlen(find); 65 if (strncmp(p, find, flen) == 0) { /* found an instance */ 76 * Replaces all occurrences of `find' in `source' with `replace'. 81 * replacement string is greater than the length of the find string, the result 93 replaceall(char *source, const char *find, const char *replace) argument 108 if (find == NULL) 113 flen = strlen(find); [all...] |
/freebsd-head/usr.bin/ar/ |
H A D | read.c | 87 char find; local 117 find = 0; 129 find = 1; 132 if (!find)
|
/freebsd-head/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineDominanceFrontier.h | 69 iterator find(MachineBasicBlock *B) { function in class:llvm::MachineDominanceFrontier 70 return Base.find(B); 73 const_iterator find(MachineBasicBlock *B) const { function in class:llvm::MachineDominanceFrontier 74 return Base.find(B);
|
/freebsd-head/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 79 iterator find(const KeyT &Key) { function in class:llvm::BlotMapVector 80 typename MapTy::iterator It = Map.find(Key); 86 const_iterator find(const KeyT &Key) const { function in class:llvm::BlotMapVector 87 typename MapTy::const_iterator It = Map.find(Key); 97 typename MapTy::iterator It = Map.find(Key);
|
/freebsd-head/contrib/llvm-project/clang/include/clang/AST/ |
H A D | AbstractBasicWriter.h | 30 // BasicWriter find(llvm::StringRef propertyName); 34 // propertyWriter.find(propertyName).write##TypeName(value) 71 // auto &&widget = W.find("widget").writeObject(); 72 // widget.find("kind").writeWidgetKind(...); 73 // widget.find("declaration").writeDeclRef(...); 107 /// This class can also act as a PropertyWriter, implementing find("...") 126 /// Implement property-find by ignoring it. We rely on properties being 128 Impl &find(const char *propertyName) { function in class:clang::serialization::DataStreamBasicWriter
|
/freebsd-head/contrib/llvm-project/libunwind/src/ |
H A D | FrameHeaderCache.hpp | 88 bool find(dl_phdr_info *PInfo, size_t, void *data) { function in class:FrameHeaderCache
|
/freebsd-head/contrib/llvm-project/lld/ELF/ |
H A D | DWARF.cpp | 132 Optional<RelocAddrEntry> LLDDwarfObj<ELFT>::find(const llvm::DWARFSection &s, function in class:LLDDwarfObj
|
/freebsd-head/contrib/apr-util/misc/ |
H A D | apr_rmm.c | 77 apr_rmm_off_t find, int includes) 84 if (find == next) 88 if (find < next) 165 /* now find it in the other list, pushing it to the head if required */ 76 find_block_by_offset(apr_rmm_t *rmm, apr_rmm_off_t next, apr_rmm_off_t find, int includes) argument
|
/freebsd-head/contrib/atf/atf-c/detail/ |
H A D | map_test.c | 117 ATF_TC(find); variable 118 ATF_TC_HEAD(find, tc) 122 ATF_TC_BODY(find, tc) 405 ATF_TP_ADD_TC(tp, find);
|
/freebsd-head/tools/tools/crypto/ |
H A D | cryptokeytest.c | 46 struct crypt_find_op find; local 48 find.crid = -1; 49 strlcpy(find.name, devname, sizeof(find.name)); 50 if (ioctl(devcrypto(), CIOCFINDDEV, &find) == -1) 52 return find.crid; 58 static struct crypt_find_op find; local 60 bzero(&find, sizeof(find)); 61 find [all...] |
/freebsd-head/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | MapVector.h | 113 typename MapType::const_iterator Pos = Map.find(Key); 143 typename MapType::const_iterator Pos = Map.find(Key); 147 iterator find(const KeyT &Key) { function in class:llvm::MapVector 148 typename MapType::const_iterator Pos = Map.find(Key); 153 const_iterator find(const KeyT &Key) const { function in class:llvm::MapVector 154 typename MapType::const_iterator Pos = Map.find(Key); 161 typename MapType::iterator Pos = Map.find(Vector.back().first); 193 auto Iterator = find(Key);
|
/freebsd-head/contrib/llvm-project/llvm/include/llvm/Demangle/ |
H A D | StringView.h | 43 size_t find(char C, size_t From = 0) const { function in class:StringView
|
/freebsd-head/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 39 static Node *find(Node *s, args_type args, u32 hash); 60 Node *StackDepotBase<Node, kReservedBits, kTabSizeLog>::find(Node *s, function in class:__sanitizer::StackDepotBase 105 // First, try to find the existing stack. 106 Node *node = find(s, args, h); 111 node = find(s2, args, h);
|