| /external/ipsec-tools/src/racoon/ |
| H A D | throttle.h | 38 int penalty; member in struct:throttle_entry
|
| H A D | throttle.c | 85 te->penalty = time(NULL) + isakmp_cfg_config.auth_throttle;
111 if (te->penalty < now) {
125 * give no penalty even on error: this is the first time
140 * We had a match and auth failed, increase penalty.
146 remaining = te->penalty - now;
152 te->penalty = now + new;
156 return te->penalty;
|
| /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
| H A D | vp8_partition_aggregator.cc | 51 int PartitionTreeNode::Cost(int penalty) { argument
52 assert(penalty >= 0);
61 return cost + NumPackets() * penalty;
114 int penalty) {
123 return right->GetOptimalNode(max_size, penalty);
126 return left->GetOptimalNode(max_size, penalty);
130 if (left->Cost(penalty) <= right->Cost(penalty)) {
137 first = first->GetOptimalNode(max_size, penalty);
138 if (second->Cost(penalty) <
113 GetOptimalNode(int max_size, int penalty) argument
182 FindOptimalConfiguration(int max_size, int penalty) argument
225 CalcNumberOfFragments(int large_partition_size, int max_payload_size, int penalty, int min_size, int max_size) argument
[all...] |
| H A D | vp8_partition_aggregator.h | 41 int Cost(int penalty);
50 // penalty. The method will be recursively called while the solver is
52 PartitionTreeNode* GetOptimalNode(int max_size, int penalty);
106 ConfigVec FindOptimalConfiguration(int max_size, int penalty);
117 // of penalty bytes. If the size of the fragments fall outside the range
121 int penalty,
|
| /external/libvorbis/lib/ |
| H A D | envelope.c | 110 float penalty=gi->stretch_penalty-(ve->stretch/2-VE_MINSTRETCH); local
111 if(penalty<0.f)penalty=0.f;
112 if(penalty>gi->stretch_penalty)penalty=gi->stretch_penalty;
201 if(valmax>gi->preecho_thresh[j]+penalty){
205 if(valmin<gi->postecho_thresh[j]-penalty)ret|=2;
|
| /external/libnl/include/linux/ |
| H A D | pkt_sched.h | 364 __u32 penalty; member in struct:tc_cbq_ovl
|
| /external/libnl/lib/route/sch/ |
| H A D | cbq.c | 213 nl_dump_line(p, " penalty %uus strategy %s ",
214 nl_ticks2us(cbq->cbq_ovl.penalty),
|
| /external/iproute2/include/linux/ |
| H A D | pkt_sched.h | 437 __u32 penalty; member in struct:tc_cbq_ovl
|
| /external/kernel-headers/original/uapi/linux/ |
| H A D | pkt_sched.h | 452 __u32 penalty; member in struct:tc_cbq_ovl
|
| /external/chromium_org/third_party/cython/src/Cython/Includes/cpython/ |
| H A D | array.pxd | 39 Suitable as lightweight arrays intra Cython without speed penalty.
|
| /external/bison/build-aux/ |
| H A D | texinfo.tex | 244 \removelastskip\penalty-50\smallskip\fi\fi}
246 \removelastskip\penalty-100\medskip\fi\fi}
248 \removelastskip\penalty-200\bigskip\fi\fi}
509 % expansion of \tie (\leavevmode \penalty \@M \ ).
583 % at the beginning of a line will start with \penalty -- and
584 % since \penalty is valid in vertical mode, we'd end up putting the
585 % penalty on the vertical list instead of in the new paragraph.
590 \gdef\tie{\leavevmode\penalty\tiepenalty\ }
720 % TeX does not even consider page breaks if a penalty added to the
724 % page after the empty box. So we use a penalty o
[all...] |
| /external/oprofile/events/x86-64/family10/ |
| H A D | unit_masks | 240 0x04 Cycles in non-speculative phase (including cache miss penalty)
241 0x08 Cache miss penalty in cycles
|
| /external/oprofile/events/x86-64/family11h/ |
| H A D | unit_masks | 187 0x04 The number of cycles spent in non-speculative phase (including cache miss penalty)
|
| /external/oprofile/events/x86-64/hammer/ |
| H A D | unit_masks | 180 0x04 The number of cycles spent in non-speculative phase (including cache miss penalty)
|
| /external/linux-tools-perf/perf-3.12.0/arch/sh/lib/ |
| H A D | memcpy-sh4.S | 201 ! However the penalty for getting it 'wrong' is much higher for long word
|
| /external/zxing/core/ |
| H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
| /external/blktrace/btreplay/doc/ |
| H A D | btreplay.tex | 136 turnaround time penalty (user-space to kernel and back). Note that in a
|
| /external/libunwind/doc/ |
| H A D | libunwind-dynamic.tex | 319 naturally, the performance penalty is limited to a simple O(N) check.
|