HomeSort by: relevance | last modified time | path
    Searched defs:cov (Results 1 - 16 of 16) sorted by relevancy

  /src/external/bsd/ntp/dist/scripts/monitoring/
lr.pl 36 ;# cov(tag); covariance
110 sub cov() subroutine
lr.pl 36 ;# cov(tag); covariance
110 sub cov() subroutine
  /src/external/gpl2/rcs/dist/src/
rcsdiff.c 172 char const *cov[10 + !DIFF_L]; variable
304 cov[1] = CO;
305 cov[2] = "-q";
307 cov[3] = "-M";
383 pp = &cov[3 + !DIFF_L];
398 if (runv(-1, diffp[0], cov)) {
415 cov[3 + !DIFF_L] = commarg.string;
417 if (runv(-1, diffp[1], cov)) {
rcsdiff.c 172 char const *cov[10 + !DIFF_L]; variable
304 cov[1] = CO;
305 cov[2] = "-q";
307 cov[3] = "-M";
383 pp = &cov[3 + !DIFF_L];
398 if (runv(-1, diffp[0], cov)) {
415 cov[3 + !DIFF_L] = commarg.string;
417 if (runv(-1, diffp[1], cov)) {
co.c 756 char const *cov[10], *mergev[11]; local
764 cov[1] = CO;
765 /* cov[2] setup below */
766 p = &cov[3];
793 cov[2] = commarg.string;
794 if (runv(-1, rev2, cov))
799 cov[2] = commarg.string;
800 if (runv(-1, rev3, cov))
co.c 756 char const *cov[10], *mergev[11]; local
764 cov[1] = CO;
765 /* cov[2] setup below */
766 p = &cov[3];
793 cov[2] = commarg.string;
794 if (runv(-1, rev2, cov))
799 cov[2] = commarg.string;
800 if (runv(-1, rev3, cov))
  /src/external/bsd/tcpdump/dist/
print-dccp.c 197 u_int cov; local
201 cov = (GET_U_1(dh->dccph_doff) + DCCPH_CSCOV(dh) - 1) * sizeof(uint32_t);
202 return (cov > len)? len : cov;
print-dccp.c 197 u_int cov; local
201 cov = (GET_U_1(dh->dccph_doff) + DCCPH_CSCOV(dh) - 1) * sizeof(uint32_t);
202 return (cov > len)? len : cov;
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
module.h 144 Symbol *cov; // private uint[] __coverage; member in class:Module
module.h 144 Symbol *cov; // private uint[] __coverage; member in class:Module
globals.h 128 bool cov; // generate code coverage data member in struct:FeatureState::Param
globals.h 128 bool cov; // generate code coverage data member in struct:FeatureState::Param
  /src/external/gpl3/gcc/dist/gcc/
profile.cc 77 array_slice<sbitmap> cov_maps (struct condcov* cov, size_t n);
1550 struct condcov *cov = find_conditions (cfun);
1551 gcc_assert (cov);
1552 const size_t nconds = cov_length (cov);
1563 array_slice<basic_block> expr = cov_blocks (cov, i);
1564 array_slice<uint64_t> masks = cov_masks (cov, i);
1565 array_slice<sbitmap> maps = cov_maps (cov, i);
1580 cov_free (cov);
1549 struct condcov *cov = find_conditions (cfun); local
profile.cc 77 array_slice<sbitmap> cov_maps (struct condcov* cov, size_t n);
1550 struct condcov *cov = find_conditions (cfun);
1551 gcc_assert (cov);
1552 const size_t nconds = cov_length (cov);
1563 array_slice<basic_block> expr = cov_blocks (cov, i);
1564 array_slice<uint64_t> masks = cov_masks (cov, i);
1565 array_slice<sbitmap> maps = cov_maps (cov, i);
1580 cov_free (cov);
1549 struct condcov *cov = find_conditions (cfun); local
tree-profile.cc 788 cov_length (const struct condcov* cov)
790 if (cov->m_index.is_empty ())
792 return cov->m_index.length () - 1;
797 cov_blocks (struct condcov* cov, size_t n)
799 if (n >= cov->m_index.length ())
802 basic_block *begin = cov->m_blocks.begin () + cov->m_index[n];
803 basic_block *end = cov->m_blocks.begin () + cov->m_index[n + 1];
809 cov_masks (struct condcov* cov, size_t n
873 condcov *cov = new condcov (nblocks); local
    [all...]
tree-profile.cc 788 cov_length (const struct condcov* cov)
790 if (cov->m_index.is_empty ())
792 return cov->m_index.length () - 1;
797 cov_blocks (struct condcov* cov, size_t n)
799 if (n >= cov->m_index.length ())
802 basic_block *begin = cov->m_blocks.begin () + cov->m_index[n];
803 basic_block *end = cov->m_blocks.begin () + cov->m_index[n + 1];
809 cov_masks (struct condcov* cov, size_t n
873 condcov *cov = new condcov (nblocks); local
    [all...]

Completed in 44 milliseconds