/external/iproute2/tc/ |
H A D | q_tbf.c | 30 fprintf(stderr, "[ overhead BYTES ] [ linklayer TYPE ]\n"); 47 unsigned short overhead=0; local 134 } else if (matches(*argv, "overhead") == 0) { 136 if (overhead) { 137 fprintf(stderr, "Double \"overhead\" spec\n"); 140 if (get_u16(&overhead, *argv, 10)) { 141 explain1("overhead"); return -1; 191 opt.rate.overhead = overhead; 200 opt.peakrate.overhead [all...] |
H A D | tc_stab.c | 34 " [ overhead BYTES ] [ linklayer TYPE ] ...\n" 38 " overhead : per-packet size overhead used in rate computations\n" 40 "Example: ... stab overhead 20 linklayer atm\n"); 48 s->overhead != 0; 81 } else if (matches(*argv, "overhead") == 0) { 83 if (s.overhead) 84 duparg("overhead", *argv); 85 if (get_integer(&s.overhead, *argv, 10)) { 86 invarg("overhead", "invali [all...] |
H A D | m_police.c | 38 fprintf(stderr, " [ peakrate BPS ] [ avrate BPS ] [ overhead BYTES ]\n"); 137 unsigned short overhead=0; local 240 } else if (matches(*argv, "overhead") == 0) { 242 if (get_u16(&overhead, *argv, 10)) { 243 explain1("overhead"); return -1; 279 p.rate.overhead = overhead; 289 p.peakrate.overhead = overhead; 362 fprintf(f, "overhead [all...] |
H A D | q_htb.c | 37 "... class add ... htb rate R1 [burst B1] [mpu B] [overhead O]\n" 43 " overhead per-packet size overhead used in rate computations\n" 110 unsigned short overhead = 0; local 133 } else if (matches(*argv, "overhead") == 0) { 135 if (get_u16(&overhead, *argv, 10)) { 136 explain1("overhead"); return -1; 214 opt.ceil.overhead = overhead; 215 opt.rate.overhead [all...] |
H A D | q_cbq.c | 35 fprintf(stderr, " [ overhead BYTES ] [ linklayer TYPE ]\n"); 56 unsigned short overhead=0; local 118 } else if (matches(*argv, "overhead") == 0) { 120 if (get_u16(&overhead, *argv, 10)) { 121 explain1("overhead"); return -1; 153 r.overhead = overhead; 195 unsigned short overhead=0; local 335 } else if (matches(*argv, "overhead") == 0) { 337 if (get_u16(&overhead, *arg [all...] |
/external/strace/ |
H A D | count.c | 131 static struct timeval overhead = { -1, -1 }; variable in typeref:struct:timeval 153 overhead.tv_sec = n / 1000000; 154 overhead.tv_usec = n % 1000000; 175 if (overhead.tv_sec == -1) 177 tv_mul(&overhead, &shortest, 8); 178 tv_div(&overhead, &overhead, 10); 185 tv_mul(&dtv, &overhead, counts[i].calls);
|
/external/e2fsprogs/resize/ |
H A D | online.c | 34 int fd, overhead; local 128 overhead = (int) (2 + new_fs->inode_blocks_per_group); 131 overhead += 1 + new_fs->desc_blocks +
|
H A D | resize2fs.c | 298 int overhead = 0; local 326 overhead = (int) (2 + fs->inode_blocks_per_group); 329 overhead += 1 + fs->desc_blocks + 339 if ((fs->group_desc_count == 1) && rem && (rem < overhead)) 341 if (rem && (rem < overhead+50)) { 1910 int overhead = 0, num_of_superblocks = 0; local 1959 overhead = META_OVERHEAD(fs); 1962 overhead += SUPER_OVERHEAD(fs); 1971 overhead; 1973 data_blocks -= overhead; [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | initialize.c | 101 unsigned int overhead = 0; local 322 overhead = (int) (3 + fs->inode_blocks_per_group + 326 if (overhead > super->s_blocks_per_group) { 334 * it. We need to recalculate the overhead for the last block 338 overhead = (int) (2 + fs->inode_blocks_per_group); 340 overhead += 1 + fs->desc_blocks + super->s_reserved_gdt_blocks; 343 if ((fs->group_desc_count == 1) && rem && (rem < overhead)) { 347 if (rem && (rem < overhead+50)) {
|
/external/iproute2/include/linux/ |
H A D | pkt_sched.h | 79 unsigned short overhead; member in struct:tc_ratespec 91 int overhead; member in struct:tc_sizespec
|
/external/kernel-headers/original/linux/ |
H A D | pkt_sched.h | 82 unsigned short overhead; member in struct:tc_ratespec 94 int overhead; member in struct:tc_sizespec
|
/external/llvm/bindings/ocaml/executionengine/ |
H A D | llvm_executionengine.ml | 55 overhead on top of the two stubs that are already invoked for each
|
/external/icu4c/test/perf/collationperf/ |
H A D | CollPerf.pl | 202 comparison, and the overhead of memory usage and retrieval time for sort
|
/external/libvpx/examples/includes/geshi/contrib/ |
H A D | example.php | 53 // thus producing much larger overhead. You can set the tab width though.
|
/external/iproute2/doc/ |
H A D | api-ip6-flowlabels.tex | 98 puts additional overhead to all the services, despite of only
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | BaseRecognizer.as | 442 * at run-time upon error to avoid overhead during parsing.
|
/external/blktrace/btreplay/doc/ |
H A D | btreplay.tex | 308 However, after a certain point the amount of overhead per bunch may result
|
/external/dropbear/libtommath/ |
H A D | bn.tex | 1237 So why not always use Karatsuba or Toom-Cook? The simple answer is that they have so much overhead that they're not 1242 Toom-Cook has incredible overhead and is probably only useful for very large inputs. So far no known cutoff points
|
/external/libvpx/examples/includes/geshi/ |
H A D | geshi.php | 889 * span over multiple lines or not. Defaults to true to reduce overhead.
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.apache.commons.httpclient_3.1.0.v201005080502.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.pas | 2234 * at run-time upon error to avoid overhead during parsing.
|
/external/dropbear/libtomcrypt/ |
H A D | crypt.tex | 5249 cutting down the overhead of the respective functions.
|