| /freebsd/contrib/bmake/ |
| H A D | str.h | 43 typedef struct Substring { struct
46 } Substring; argument
68 Substring *words;
110 MAKE_STATIC Substring
113 Substring sub; in Substring_Init()
120 MAKE_INLINE Substring
127 Substring_Length(Substring sub) in Substring_Length()
133 Substring_IsEmpty(Substring sub) in Substring_IsEmpty()
139 Substring_Equals(Substring sub, const char *str) in Substring_Equals()
147 Substring_Eq(Substring sub, Substring str) in Substring_Eq()
[all …]
|
| H A D | var.c | 452 static Substring
453 CanonicalVarname(Substring name) in CanonicalVarname()
483 GNode_FindVar(GNode *scope, Substring varname, unsigned hash) in GNode_FindVar()
502 VarFindSubstring(Substring name, GNode *scope, bool elsewhere) in VarFindSubstring()
970 UnexportVar(Substring varname, UnexportWhat what) in UnexportVar()
1427 SepBuf_AddSubstring(SepBuf *buf, Substring sub) in SepBuf_AddSubstring()
1448 * null-terminated substring, which is currently guaranteed but may change in
1451 typedef void (*ModifyWordProc)(Substring word, SepBuf *buf, void *data);
1455 ModifyWord_Head(Substring word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED) in ModifyWord_Head()
1461 ModifyWord_Tail(Substring word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED) in ModifyWord_Tail()
[all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_lzw.h | 24 using Substring = in LzwEncode() local
29 Min(DenseMapInfo<Substring>::getEmptyKey().first, in LzwEncode()
30 DenseMapInfo<Substring>::getTombstoneKey().first) - in LzwEncode()
32 DenseMap<Substring, LzwCodeType> prefix_to_code; in LzwEncode()
34 // Add all substring of len 1 as initial dictionary. in LzwEncode()
67 // This is a new substring, but emit the code for the current match in LzwEncode()
121 // Returns lens of the substring with the given code. in LzwDecode()
138 // possible only when the new substring is the same as previous one plus in LzwDecode()
139 // the first item of the previous substring. We can emit that in two in LzwDecode()
149 // including the first item of the just emmited substring. Do the same here. in LzwDecode()
|
| /freebsd/contrib/pam_modules/pam_passwdqc/ |
| H A D | README | 72 The length of common substring required to conclude that a password is
74 or 0 to disable the substring search. Note that the password will not
75 be rejected once a weak substring is found. Instead, the password
77 substring removed.
79 The substring search is case-insensitive and is able to detect and
80 remove a common substring spelled backwards.
86 long common substring and the new password with the substring removed
|
| /freebsd/lib/libpam/modules/pam_passwdqc/ |
| H A D | pam_passwdqc.8 | 147 The length of common substring required to conclude that a password is
149 or 0 to disable the substring search.
150 Note that the password will not be rejected once a weak substring is
152 with the weak substring removed.
154 The substring search is case-insensitive and is able to detect and
155 remove a common substring spelled backwards.
164 long common substring and the new password with the substring removed
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | SuffixTree.h | 8 // A data structure for fast substring queries.
12 // represents an entire substring rather than a single character. Each leaf
16 // substring of the full string. The tree is structured so that, for a string
48 /// A repeated substring in the tree.
78 /// The index of the first character in the substring currently being added.
81 /// The length of the substring we have to add at the current step.
164 /// The repeated substring associated with this node.
170 /// The minimum length of a repeated substring to find.
182 /// Move the iterator to the next repeated substring.
186 /// Return the current repeated substring.
|
| H A D | SuffixTreeNode.h | 18 // substring of the full mapping rather than a single character state.
32 /// A node in a suffix tree which represents a substring or suffix.
42 /// The start index of this node's substring in the main string.
64 /// \return the start index of this node's substring in the entire string.
99 /// The end index of this node's substring in the main string.
136 /// \returns the end index of this node's substring in the entire string.
166 /// The end index of this node's substring in the main string.
180 /// \returns the end index of this node's substring in the entire string.
|
| /freebsd/sys/contrib/dev/acpica/common/ |
| H A D | adfile.c | 391 char *Substring; in FlSplitInputPathname() local
420 Substring = strrchr (DirectoryPath, '/'); in FlSplitInputPathname()
421 if (!Substring) in FlSplitInputPathname()
423 Substring = strrchr (DirectoryPath, ':'); in FlSplitInputPathname()
428 if (!Substring) in FlSplitInputPathname()
435 Filename = FlStrdup (Substring + 1); in FlSplitInputPathname()
436 *(Substring+1) = 0; in FlSplitInputPathname()
480 char *Substring; in FlGetFileBasename() local
485 Substring = strrchr (FilePathname, '/'); in FlGetFileBasename()
486 if (!Substring) in FlGetFileBasename()
[all …]
|
| /freebsd/contrib/llvm-project/lld/MachO/ |
| H A D | ExportTrie.cpp | 53 Edge(StringRef s, TrieNode *node) : substring(s), child(node) {} in Edge()
55 StringRef substring; member
153 nodeSize += edge.substring.size() + 1 // String length. in updateOffset()
183 // Append each child edge substring and node offset. in writeTo()
185 memcpy(buf, edge.substring.data(), edge.substring.size()); in writeTo()
186 buf += edge.substring.size(); in writeTo()
331 StringRef substring = StringRef(cbuf, strnlen(cbuf, end - buf)); in parse() local
332 buf += substring.size() + 1; in parse()
335 parse(start + offset, cumulativeString + substring); in parse()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SmallString.h | 220 /// @name Substring Operations
223 /// Return a reference to the substring from [Start, Start + N).
225 /// \param Start The index of the starting character in the substring; if
227 /// empty substring will be returned.
229 /// \param N The number of characters to included in the substring. If \p N
237 /// Return a reference to the substring from [Start, End).
239 /// \param Start The index of the starting character in the substring; if
241 /// empty substring will be returned.
244 /// substring. If this is npos, or less than \p Start, or exceeds the
|
| H A D | StringRef.h | 407 /// Return true if the given string is a substring of *this, and false
419 /// Return true if the given string is a substring of *this, and false
544 /// @name Substring Operations
547 /// Return a reference to the substring from [Start, Start + N).
549 /// \param Start The index of the starting character in the substring; if
551 /// empty substring will be returned.
553 /// \param N The number of characters to included in the substring. If N
658 /// Return a reference to the substring from [Start, End).
660 /// \param Start The index of the starting character in the substring; if
662 /// empty substring will be returned.
[all …]
|
| /freebsd/share/man/man7/ |
| H A D | d.7 | 205 Return a substring of
243 Return a substring of
252 Return a substring of
260 is not a substring of
292 substring of string
296 The substring will be at most
|
| /freebsd/contrib/sendmail/src/ |
| H A D | mailq.1 | 68 as a substring of the queue id or not when
75 as a substring of the quarantine reason or not when
82 as a substring of one of the recipients or not when
89 as a substring of the sender or not when
|
| /freebsd/usr.sbin/gssd/ |
| H A D | gssd.8 | 38 .Op Fl c Ar file-substring
79 .It Fl c Ar file-substring
80 Set a file-substring for the credential cache file names.
81 Only files with this substring embedded in their names will be
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_destroy/ |
| H A D | zfs_clone_livelist_condense_and_disable.ksh | 49 substring="$1"
51 if test "${string#*$substring}" != "$string"; then
52 return 0 # $substring is in $string
55 log_fail "$msg" # $substring is not in $string
|
| /freebsd/contrib/nvi/regex/ |
| H A D | regex.3 | 263 containing respectively the offset of the first character of a substring
264 and the offset of the first character after the end of the substring.
269 An empty substring is denoted by equal offsets,
270 both indicating the character following the empty substring.
274 array is filled in to indicate what substring of
277 Remaining members report what substring was matched by parenthesized
293 the reported substring is the last one it matched.
297 so the reported substring is one of the empties.)
|
| /freebsd/lib/libc/regex/ |
| H A D | regex.3 | 360 containing respectively the offset of the first character of a substring
361 and the offset of the first character after the end of the substring.
366 An empty substring is denoted by equal offsets,
367 both indicating the character following the empty substring.
371 array is filled in to indicate what substring of
374 Remaining members report what substring was matched by parenthesized
394 the reported substring is the last one it matched.
404 so the reported substring is one of the empties.)
|
| /freebsd/contrib/libarchive/cat/test/ |
| H A D | test_help.c | 15 in_first_line(const char *p, const char *substring) in in_first_line() argument
17 size_t l = strlen(substring); in in_first_line()
20 if (memcmp(p, substring, l) == 0) in in_first_line()
|
| /freebsd/contrib/libarchive/tar/test/ |
| H A D | test_help.c | 15 in_first_line(const char *p, const char *substring) in in_first_line() argument
17 size_t l = strlen(substring); in in_first_line()
20 if (memcmp(p, substring, l) == 0) in in_first_line()
|
| /freebsd/contrib/libarchive/cpio/test/ |
| H A D | test_option_help.c | 15 in_first_line(const char *p, const char *substring) in in_first_line() argument
17 size_t l = strlen(substring); in in_first_line()
20 if (memcmp(p, substring, l) == 0) in in_first_line()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 20 /// \returns the number of elements in the substring associated with \p N.
192 // The first character in the current substring we're looking at. in extend()
230 // Is the string we're trying to insert a substring of the next node? in extend()
244 // The string we're trying to insert isn't a substring of the next node, in extend()
262 // Insert the new node representing the new substring into the tree as in extend()
323 // If length of repeated substring is below threshold, then skip it. in advance()
327 // The root never represents a repeated substring. If we're looking at in advance()
|
| /freebsd/crypto/heimdal/lib/wind/ |
| H A D | rfc4518.txt | 324 For input strings that are attribute values or non-substring
343 For input strings that are substring assertion values: If the string
348 - If the input string is an initial substring, it is modified to
351 - If the input string is an initial or an any substring that ends in
355 - If the input string is an any or a final substring that starts in
359 - If the input string is a final substring, it is modified to end
363 an initial substring, the output would be
364 "<SPACE>foo<SPACE><SPACE>bar<SPACE>". As an any or final substring,
639 substring matches a partition of the attribute value, then an
640 assertion constructed by subdividing that substring into multiple
|
| /freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/ |
| H A D | JDTrace.java | 138 buf.append(req.s.substring(prev_i, i)); in applyProbespec()
151 buf.append(req.s.substring(i)); in applyProbespec()
379 out.printf("|%s%s %-9d\n", ATS.substring(len - depth), in printDistributionLine()
380 SPACES.substring(depth), val); in printDistributionLine()
388 out.printf("%s%s| %-9d\n", SPACES.substring(depth), in printDistributionLine()
389 ATS.substring(len - depth), val); in printDistributionLine()
401 String ats = ATS.substring(len); in printDistributionLine()
402 String spaces = SPACES.substring(len); in printDistributionLine()
408 out.printf("%s%s|%s %-9d\n", spaces.substring(depth), in printDistributionLine()
409 ats.substring(len - depth), repeat(" ", len), val); in printDistributionLine()
[all …]
|
| /freebsd/usr.bin/procstat/ |
| H A D | procstat.1 | 165 Substring commands are accepted.
173 Substring commands are accepted.
177 Substring commands are accepted.
183 Substring commands are accepted.
270 Substring commands are accepted.
281 Substring commands are accepted.
|
| /freebsd/contrib/netbsd-tests/lib/libc/regex/ |
| H A D | README | 9 expected to fail. If there is a fourth field, it is the substring that
33 For REG_STARTEND, the start/end offsets are those of the substring
|