/external/selinux/libsemanage/src/ |
D | booleans_activedb.c | 96 unsigned int bcount = 0; in bool_commit_list() local 114 blist[bcount].name = strdup(name); in bool_commit_list() 115 if (blist[bcount].name == NULL) in bool_commit_list() 117 blist[bcount].value = newvalue; in bool_commit_list() 118 bcount++; in bool_commit_list() 122 if (security_set_boolean_list(bcount, blist, 0) < 0) { in bool_commit_list() 127 for (i = 0; i < bcount; i++) in bool_commit_list() 137 for (i = 0; i < bcount; i++) in bool_commit_list()
|
/external/ltp/testcases/kernel/fs/ext4-new-features/ext4-online-defrag/ |
D | ext4_online_defrag_test.sh | 80 bcount=`dumpe2fs -h $EXT4_DEV | grep 'Free blocks'` 81 bcount=`echo $bcount | awk '{ print $NF }'` 82 bcount=$(( $bcount / 2 - 100 )) 83 dd if=/dev/zero of=$dest bs=$bsize count=$bcount
|
/external/e2fsprogs/lib/ext2fs/ |
D | block.c | 26 e2_blkcnt_t bcount, 30 e2_blkcnt_t bcount; member 79 ctx->bcount += limit; in block_iterate_ind() 98 for (i = 0; i < limit; i++, ctx->bcount++, block_nr++) { in block_iterate_ind() 100 flags = (*ctx->func)(ctx->fs, &blk64, ctx->bcount, in block_iterate_ind() 112 for (i = 0; i < limit; i++, ctx->bcount++, block_nr++) { in block_iterate_ind() 116 flags = (*ctx->func)(ctx->fs, &blk64, ctx->bcount, in block_iterate_ind() 168 ctx->bcount += limit*limit; in block_iterate_dind() 201 ctx->bcount += limit; in block_iterate_dind() 254 ctx->bcount += ((unsigned long long) limit)*limit*limit; in block_iterate_tind() [all …]
|
/external/ltp/lib/ |
D | tst_fill_file.c | 31 int tst_fill_fd(int fd, char pattern, size_t bs, size_t bcount) in tst_fill_fd() argument 45 for (i = 0; i < bcount; i++) { in tst_fill_fd() 57 int tst_fill_file(const char *path, char pattern, size_t bs, size_t bcount) in tst_fill_file() argument 65 if (tst_fill_fd(fd, pattern, bs, bcount)) { in tst_fill_file()
|
/external/ltp/testcases/kernel/fs/ext4-new-features/ext4-uninit-groups/ |
D | ext4_uninit_groups_test.sh | 50 bcount=`dumpe2fs -h $EXT4_DEV 2> /dev/null | grep 'Free blocks'` 51 bcount=`echo $bcount | awk '{ print $3 }'` 52 dd if=/dev/zero of=mnt_point/tmp_dir bs=$bsize count=$bcount
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/PowerPC/ |
D | no-dup-of-bdnz.ll | 21 %bcount.1.us = phi i64 [ %.810.us, %BB_4 ], [ 0, %BB_12 ] 22 %0 = add i64 %arg.ssa, %bcount.1.us 32 %1 = add i64 %arg.ssa, %bcount.1.us 38 %.810.us = add nuw nsw i64 %bcount.1.us, 1
|
/external/toybox/toys/posix/ |
D | grep.c | 92 static void outline(char *line, char dash, char *name, long lcount, long bcount, in outline() argument 101 if (bcount && FLAG(b)) numdash(bcount-1, dash); in outline() 275 long bcount = 1 + offset + (start-line) + (FLAG(o) ? mm->rm_so : 0); in do_grep() local 279 outline(start+mm->rm_so, ':', name, lcount, bcount, in do_grep() 293 outline(FLAG(color) ? 0 : line, ':', name, lcount, bcount, ulen); in do_grep()
|
/external/ltp/include/ |
D | tst_fs.h | 147 int tst_fill_fd(int fd, char pattern, size_t bs, size_t bcount); 156 int tst_fill_file(const char *path, char pattern, size_t bs, size_t bcount);
|
/external/tensorflow/tensorflow/contrib/hvx/hexagon_controller/src_impl/ |
D | graph_functions_wrapper.c | 130 unsigned long long int bcount = GetCounter(*b); in CompareCycle() local 131 if (acount < bcount) { in CompareCycle() 133 } else if (acount > bcount) { in CompareCycle()
|
/external/python/cpython2/Objects/ |
D | listobject.c | 1485 Py_ssize_t bcount = 0; /* # of times B won in a row */ in merge_lo() local 1497 ++bcount; in merge_lo() 1502 if (bcount >= min_gallop) in merge_lo() 1508 bcount = 0; in merge_lo() 1551 bcount = k; in merge_lo() 1566 } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); in merge_lo() 1622 Py_ssize_t bcount = 0; /* # of times B won in a row */ in merge_hi() local 1635 bcount = 0; in merge_hi() 1644 ++bcount; in merge_hi() 1649 if (bcount >= min_gallop) in merge_hi() [all …]
|
D | listsort.txt | 594 offset equal to the previous value of acount/bcount. Doing so saves about
|
/external/python/cpython3/Objects/ |
D | listobject.c | 1585 Py_ssize_t bcount = 0; /* # of times B won in a row */ in merge_lo() local 1597 ++bcount; in merge_lo() 1602 if (bcount >= min_gallop) in merge_lo() 1608 bcount = 0; in merge_lo() 1651 bcount = k; in merge_lo() 1666 } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); in merge_lo() 1723 Py_ssize_t bcount = 0; /* # of times B won in a row */ in merge_hi() local 1736 bcount = 0; in merge_hi() 1745 ++bcount; in merge_hi() 1750 if (bcount >= min_gallop) in merge_hi() [all …]
|
D | listsort.txt | 594 offset equal to the previous value of acount/bcount. Doing so saves about
|
/external/e2fsprogs/doc/RelNotes/ |
D | v1.10.txt | 31 circumstances, file with holes would cause the bcount parameter to the
|
/external/mksh/src/ |
D | edit.c | 4611 unsigned int bcount; in domove() local 4726 bcount = 1; in domove() 4737 bcount++; in domove() 4739 bcount--; in domove() 4740 } while (bcount != 0); in domove()
|
/external/swiftshader/third_party/LLVM/test/ |
D | lit.cfg | 206 r"\| \bcount\b", r"\| \bnot\b"]:
|
/external/llvm/test/ |
D | lit.cfg | 292 r"\| \bcount\b",
|
/external/clang/test/ |
D | lit.cfg | 320 r"\| \bcount\b",
|