Searched refs:longest (Results 1 - 25 of 28) sorted by relevance

12

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/tools/perf/util/
H A Dhelp.c73 static void pretty_print_string_list(struct cmdnames *cmds, int longest) argument
76 int space = longest + 1; /* min 1 SP between words */
195 unsigned int i, longest = 0; local
198 if (longest < main_cmds->names[i]->len)
199 longest = main_cmds->names[i]->len;
201 if (longest < other_cmds->names[i]->len)
202 longest = other_cmds->names[i]->len;
210 pretty_print_string_list(main_cmds, longest);
219 pretty_print_string_list(other_cmds, longest);
H A Dparse-events.c331 int n, longest = -1; local
336 if (n > longest && !strncasecmp(*str, names[i][j], n))
337 longest = n;
339 if (longest > 0) {
340 *str += longest;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/bftpd-1.6.6/
H A Doptions.c208 struct directory *longest = NULL; local
218 if (longest) {
219 if ((strlen(bar) > strlen(longest->path) + 1)
221 longest = dir;
224 longest = dir;
229 if (longest)
230 return getoption(longest->options, name);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/netkit-ftp-0.18-pre1/ftp/
H A Dmain.c371 int nmatches, longest; local
373 longest = 0;
381 if (q - name > longest) {
382 longest = q - name;
385 } else if (q - name == longest)
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/env/
H A Denv_alloc.c68 u_int32_t longest; /* Longest chain walked */ member in struct:__alloc_layout
295 if (head->longest < st_search)
296 head->longest = st_search;
483 "Region allocations: %lu allocations, %lu failures, %lu frees, %lu longest",
485 (u_long)head->longest);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/tools/perf/
H A Dbuiltin-help.c280 unsigned int i, longest = 0; local
283 if (longest < strlen(common_cmds[i].name))
284 longest = strlen(common_cmds[i].name);
289 printf(" %-*s ", longest, common_cmds[i].name);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/regex/
H A Dregexec.c142 static chr *longest _ANSI_ARGS_((struct vars *, struct dfa *, chr *, chr *, int *));
311 end = longest(v, d, begin, v->stop, &hitend);
426 end = longest(v, d, begin, estop,
609 mid = longest(v, d, begin, end, (int *)NULL);
618 while (longest(v, d2, mid, end, (int *)NULL) != end) {
631 mid = longest(v, d, begin, mid-1, (int *)NULL);
675 if (longest(v, d, begin, end, (int *)NULL) == end) {
771 mid = longest(v, d, begin, end, (int *)NULL);
789 longest(v, d2, mid, end, (int *)NULL) == end &&
807 mid = longest(
[all...]
H A Drege_dfa.c34 - longest - longest-preferred matching engine
35 ^ static chr *longest(struct vars *, struct dfa *, chr *, chr *, int *);
38 longest(v, d, start, stop, hitstopp) function
547 end = longest(v, d, cp, v->stop, (int *)NULL);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/l7filter/regexp/
H A Dregexp.c227 register char *longest; local
281 * longest literal string that must appear and make it the
288 longest = NULL;
292 longest = OPERAND(scan);
295 r->regmust = longest;
/netgear-R7000-V1.0.7.12_1.2.5/project/gpl/l7filter/regexp/
H A Dregexp.c227 register char *longest; local
281 * longest literal string that must appear and make it the
288 longest = NULL;
292 longest = OPERAND(scan);
295 r->regmust = longest;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/xfs/
H A Dxfs_filestream.c217 xfs_extlen_t longest, free, minfree, maxfree = 0; local
264 longest = xfs_alloc_longest_free_extent(mp, pag);
265 if (((minlen && longest >= minlen) ||
H A Dxfs_alloc.c1732 * Find the length of the longest extent in an AG.
1765 xfs_extlen_t longest;/* longest extent in allocation group */ local
1807 longest = xfs_alloc_longest_free_extent(mp, pag);
1809 longest ||
1845 longest = be32_to_cpu(agf->agf_longest);
1846 longest = (longest > delta) ? (longest - delta) :
1847 (be32_to_cpu(agf->agf_flcount) > 0 || longest >
[all...]
H A Dxfs_dir2_node.c929 int longest; /* longest data free entry */ local
963 * Make the data entry free. Keep track of the longest freespace
969 longest = be16_to_cpu(data->hdr.bestfree[0].length);
983 * If the longest data block freespace changes, need to update
986 if (longest < be16_to_cpu(data->hdr.bestfree[0].length)) {
1012 longest = be16_to_cpu(data->hdr.bestfree[0].length);
1017 if (longest == mp->m_dirblksize - (uint)sizeof(data->hdr)) {
1092 free->bests[findex] = cpu_to_be16(longest);
H A Dxfs_ialloc.c449 xfs_extlen_t longest = 0; /* longest extent available */ local
508 if (ineed && !(longest = pag->pagf_longest))
509 longest = pag->pagf_flcount > 0;
512 longest >= ineed &&
H A Dxfs_bmap.c2444 xfs_extlen_t longest; local
2445 longest = xfs_alloc_longest_free_extent(mp, pag);
2446 if (*blen < longest)
2447 *blen = longest;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ocfs2/dlm/
H A Ddlmdebug.c496 unsigned long total = 0, longest = 0, bktcnt; local
513 longest = max(longest, bktcnt);
519 "Total: %ld, Longest: %ld\n", total, longest);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/human68k/
H A Dmatch.s10 * match.s -- optional optimized asm version of longest match in deflate.c
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/qdos/
H A Dmatch.s9 ; match.a -- optional optimized asm version of longest match in deflate.c
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/win32/
H A Dlm32_lcc.asm58 ; * Set match_start to the longest match starting at the given string and
H A Dmatch32.asm88 ; Set match_start to the longest match starting at the given string and
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/
H A Dre_syntax.tex421 that point, its choice is determined by its {\it preference}: either the longest
428 (including {\bf \{m,n\}} with {\it m} equal to {\it n}) prefers longest match. A quantified
432 more branches connected by the {\bf $|$} operator prefers longest match.
435 also match the longest or shortest possible substrings, based on their
441 {\bf \{1,1\}?} can be used to force longest and shortest preference, respectively,
498 constraints, and the longest/shortest-match (rather than first-match) matching
527 \item AREs report the longest/shortest match for the RE, rather
533 order was exploited to deliberately find a match which was {\it not} the longest/shortest
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/
H A Dvsprintf.c775 int longest = 1; local
794 /* find position of longest 0 run */
803 if (zerolength[i] > longest) {
804 longest = zerolength[i];
816 i += longest - 1;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/os2/
H A Dmatch32.asm67 ; Set match_start to the longest match starting at the given string and
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/xfs/linux-2.6/
H A Dxfs_trace.h1275 __field(__u32, longest)
1293 __entry->longest = be32_to_cpu(agf->agf_longest);
1298 "freeblks %u longest %u caller %pf",
1311 __entry->longest,
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/msdos/
H A Dmatch.asm339 ; Set match_start to the longest match starting at the given string and

Completed in 402 milliseconds

12