Home
last modified time | relevance | path

Searched refs:cycle (Results 1 - 25 of 117) sorted by relevance

12345

/third_party/node/test/parallel/
H A Dtest-error-serdes.js9 function cycle(err) { function
13 assert.strictEqual(cycle(0), 0);
14 assert.strictEqual(cycle(-1), -1);
15 assert.strictEqual(cycle(1.4), 1.4);
16 assert.strictEqual(cycle(null), null);
17 assert.strictEqual(cycle(undefined), undefined);
18 assert.strictEqual(cycle('foo'), 'foo');
19 assert.strictEqual(cycle(Symbol.for('foo')), Symbol.for('foo'));
20 assert.strictEqual(cycle(Symbol('foo')).toString(), Symbol('foo').toString());
32 err = cycle(er
[all...]
/third_party/ffmpeg/libavfilter/
H A Dvf_dejudder.c27 * value based on the running average of the last n=cycle frames. So
66 int cycle; member
73 {"cycle", "set the length of the cycle to use for dejuddering",
74 OFFSET(cycle), AV_OPT_TYPE_INT, {.i64 = 4}, 2, 240, .flags = FLAGS},
86 outlink->time_base = av_mul_q(inlink->time_base, av_make_q(1, 2 * s->cycle)); in config_out_props()
87 outlink->frame_rate = av_mul_q(inlink->frame_rate, av_make_q(2 * s->cycle, 1)); in config_out_props()
89 av_log(ctx, AV_LOG_VERBOSE, "cycle:%d\n", s->cycle); in config_out_props()
98 s->ringbuff = av_calloc(s->cycle in dejudder_init()
[all...]
H A Dvf_decimate.c40 struct qitem *queue; ///< window of cycle frames and the associated data diff
57 int cycle; member
71 { "cycle", "set the number of frame from which one will be dropped", OFFSET(cycle), AV_OPT_TYPE_INT, {.i64 = 5}, 2, 25, FLAGS },
181 if (++dm->fid != dm->cycle) in filter_frame()
187 /* we have a complete cycle, select the frame to drop */ in filter_frame()
189 for (i = 0; i < dm->cycle; i++) { in filter_frame()
202 av_log(ctx, AV_LOG_DEBUG, "1/%d frame drop:\n", dm->cycle); in filter_frame()
203 for (i = 0; i < dm->cycle && dm->queue[i].frame; i++) { in filter_frame()
215 for (i = 0; i < dm->cycle in filter_frame()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp37 // the scoreboard. We always make the scoreboard at least 1 cycle deep to in ScoreboardHazardRecognizer()
117 int cycle = Stalls; in getHazardType() local
130 // We must find one of the stage's units free for every cycle the in getHazardType()
134 int StageCycle = cycle + (int)i; in getHazardType()
158 LLVM_DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", "); in getHazardType()
164 // Advance the cycle to the next stage. in getHazardType()
165 cycle += IS->getNextCycles(); in getHazardType()
184 unsigned cycle = 0; in EmitInstruction() local
189 // We must reserve one of the stage's units for every cycle the in EmitInstruction()
193 assert(((cycle in EmitInstruction()
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_alu_readport_validation.cpp44 int cycle = -1; member in r600::ReserveReadport
105 visitor.cycle = cycle_vec(swz, i); in schedule_vec_src()
118 visitor.cycle = cycle_vec(swz, i); in schedule_vec_instruction()
133 visitor1.cycle = cycle_trans(swz, i); in schedule_trans_instruction()
145 visitor2.cycle = cycle_trans(swz, i); in schedule_trans_instruction()
165 bool AluReadportReservation::reserve_gpr(int sel, int chan, int cycle) in reserve_gpr() argument
167 if (m_hw_gpr[cycle][chan] == -1) { in reserve_gpr()
168 m_hw_gpr[cycle][chan] = sel; in reserve_gpr()
170 else if (m_hw_gpr[cycle][chan] != sel) { in reserve_gpr()
277 success &= reserver.reserve_gpr(sel, chan, cycle); in reserve_gpr()
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_sched_gm107.h81 void print(int cycle) in print()
84 if (rd.r[i] > cycle) in print()
86 if (wr.r[i] > cycle) in print()
90 if (rd.p[i] > cycle) in print()
92 if (wr.p[i] > cycle) in print()
95 if (rd.c > cycle) in print()
97 if (wr.c > cycle) in print()
H A Dnv50_ir_emit_nvc0.cpp3134 void print(int cycle)
3137 if (rd.r[i] > cycle)
3139 if (wr.r[i] > cycle)
3143 if (rd.p[i] > cycle)
3145 if (wr.p[i] > cycle)
3148 if (rd.c > cycle)
3150 if (wr.c > cycle)
3152 if (res.sfu > cycle)
3154 if (res.imul > cycle)
3156 if (res.tex > cycle)
[all...]
/third_party/mesa3d/.gitlab-ci/tests/lava/
H A Dhelpers.py3 from itertools import cycle namespace
75 yield from cycle(("results", "feedback", "warning", "error", "debug", "target"))
90 tick_gen = cycle(tick_fn)
92 tick_gen = cycle((tick_fn,))
112 return cycle(tick_fn)
114 return cycle((tick_fn,))
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_tnode.c52 tnode->cycle = 0; in nghttp3_tnode_init()
81 return top->cycle; in pq_get_first_cycle()
89 tnode->cycle = pq_get_first_cycle(pq) + in nghttp3_tnode_schedule()
100 tnode->cycle += nghttp3_max(1, penalty); in nghttp3_tnode_schedule()
/third_party/nghttp2/src/
H A Dshrpx_worker.h123 // cycle is used to prioritize this address. Lower value takes
125 uint32_t cycle; member
126 // penalty which is applied to the next cycle calculation.
156 uint32_t cycle; member
162 auto d = lhs.cycle - rhs.cycle; in operator ()()
176 uint32_t cycle; member
185 uint32_t cycle; member
191 auto d = lhs.cycle - rhs.cycle; in operator ()()
[all...]
H A Dshrpx_worker.cc214 uint32_t cycle; in ensure_enqueue_addr() local
217 cycle = top.cycle; in ensure_enqueue_addr()
219 cycle = 0; in ensure_enqueue_addr()
222 addr->cycle = cycle; in ensure_enqueue_addr()
224 wg->pq.push(DownstreamAddrEntry{addr, addr->seq, addr->cycle}); in ensure_enqueue_addr()
230 cycle = top.cycle; in ensure_enqueue_addr()
232 cycle in ensure_enqueue_addr()
[all...]
/third_party/littlefs/scripts/
H A Dreadtree.py16 cycle = False
23 # cycle detected
24 cycle = m.blocks
25 if cycle:
155 if cycle:
157 print("*** cycle detected {%#x, %#x}! ***" % (
158 cycle[0], cycle[1]))
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-scheduler.cc28 InstructionScheduler::CriticalPathFirstQueue::PopBestCandidate(int cycle) { in PopBestCandidate() argument
33 if (cycle >= (*iterator)->start_cycle()) { in PopBestCandidate()
49 InstructionScheduler::StressSchedulerQueue::PopBestCandidate(int cycle) { in PopBestCandidate() argument
226 int cycle = 0; in Schedule() local
228 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); in Schedule()
236 std::max(successor->start_cycle(), cycle + candidate->latency())); in Schedule()
244 cycle++; in Schedule()
/third_party/nghttp2/lib/
H A Dnghttp2_stream.c35 /* Maximum distance between any two stream's cycle in the same
36 priority queue. Imagine stream A's cycle is A, and stream B's
37 cycle is B, and A < B. The cycle is unsigned 32 bit integer, it
38 may get overflow. Because of how we calculate the next cycle
53 if (lhs->cycle == rhs->cycle) { in stream_less()
57 return rhs->cycle - lhs->cycle <= NGHTTP2_MAX_CYCLE_DISTANCE; in stream_less()
98 stream->cycle in nghttp2_stream_init()
[all...]
/third_party/node/deps/nghttp2/lib/
H A Dnghttp2_stream.c35 /* Maximum distance between any two stream's cycle in the same
36 priority queue. Imagine stream A's cycle is A, and stream B's
37 cycle is B, and A < B. The cycle is unsigned 32 bit integer, it
38 may get overflow. Because of how we calculate the next cycle
53 if (lhs->cycle == rhs->cycle) { in stream_less()
57 return rhs->cycle - lhs->cycle <= NGHTTP2_MAX_CYCLE_DISTANCE; in stream_less()
98 stream->cycle in nghttp2_stream_init()
[all...]
/third_party/python/Lib/test/
H A Dtest_threading_local.py88 # 1) Involve Local in a cycle
89 cycle = [Local()]
90 cycle.append(cycle)
91 cycle[0].foo = 'bar'
93 # 2) GC the cycle (triggers threadmodule.c::local_clear
95 del cycle
H A Dtest_itertools.py633 self.assertEqual(take(10, cycle('abc')), list('abcabcabca'))
634 self.assertEqual(list(cycle('')), [])
635 self.assertRaises(TypeError, cycle)
636 self.assertRaises(TypeError, cycle, 5)
637 self.assertEqual(list(islice(cycle(gen3()),10)), [0,1,2,0,1,2,0,1,2,0])
641 c = cycle('abc')
656 self.pickletest(proto, cycle('abc'))
661 c = cycle(it)
664 d = pickle.loads(p) # rebuild the cycle object
669 c = cycle(i
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dislamcal.cpp563 int cycle, offset, shift = 0; in gregoYearFromIslamicStart() local
565 cycle = (year - 1397) / 67; in gregoYearFromIslamicStart()
567 shift = 2*cycle + ((offset >= 33)? 1: 0); in gregoYearFromIslamicStart()
569 cycle = (year - 1396) / 67 - 1; in gregoYearFromIslamicStart()
571 shift = 2*cycle + ((offset <= 33)? 1: 0); in gregoYearFromIslamicStart()
589 int cycle, offset, shift = 0; in firstIslamicStartYearFromGrego() local
591 cycle = (year - 1977) / 65; in firstIslamicStartYearFromGrego()
593 shift = 2*cycle + ((offset >= 32)? 1: 0); in firstIslamicStartYearFromGrego()
595 cycle = (year - 1976) / 65 - 1; in firstIslamicStartYearFromGrego()
597 shift = 2*cycle in firstIslamicStartYearFromGrego()
[all...]
/third_party/python/Lib/
H A Dgraphlib.py31 and included in the exception. The detected cycle can be accessed via the second
89 If any cycle is detected, "CycleError" will be raised, but "get_ready" can
104 cycle = self._find_cycle()
105 if cycle:
106 raise CycleError(f"nodes are in a cycle", cycle)
212 # current stack we have found a cycle.
242 cycle is detected, :exc:`CycleError` will be raised.
/third_party/skia/modules/skottie/src/effects/
H A DFractalNoiseEffect.cpp393 // * cycle evolution - flag controlling whether evolution cycles in noise()
394 // * cycle revolutions - number of revolutions after which evolution cycles (period) in noise()
398 // to interpolate between the two -> in order to wrap around smoothly, the cycle/period in noise()
403 cycle = fCycleEvolution in noise() local
408 ? cycle/rev_rad in noise()
421 glsl_mod(evo_ + 0, cycle) + offset, in noise()
422 glsl_mod(evo_ + 1, cycle) + offset, in noise()
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_sched.cpp216 bool rp_gpr_tracker::try_reserve(unsigned cycle, unsigned sel, unsigned chan) { in try_reserve() argument
218 if (rp[cycle][chan] == 0) { in try_reserve()
219 rp[cycle][chan] = sel; in try_reserve()
220 ++uc[cycle][chan]; in try_reserve()
222 } else if (rp[cycle][chan] == sel) { in try_reserve()
223 ++uc[cycle][chan]; in try_reserve()
244 unsigned cycle = bs_cycle(trans, bs, i); in unreserve() local
245 unreserve(cycle, n->bc.src[i].sel, n->bc.src[i].chan); in unreserve()
250 void rp_gpr_tracker::unreserve(unsigned cycle, unsigned sel, unsigned chan) { in unreserve() argument
252 assert(rp[cycle][cha in unreserve()
278 unsigned cycle = bs_cycle(trans, bs, i); try_reserve() local
[all...]
/third_party/musl/src/stdlib/
H A Dqsort.c45 static void cycle(size_t width, unsigned char* ar[], int n) in cycle() function
116 cycle(width, ar, i); in sift()
153 cycle(width, ar, i); in trinkle()
/third_party/rust/crates/memchr/src/tests/memchr/
H A Diter.rs61 iter, take_side.iter().cycle().cloned()); in qc_memchr_double_ended_iter()
75 iter, take_side.iter().cycle().cloned()); in qc_memchr2_double_ended_iter()
90 iter, take_side.iter().cycle().cloned()); in qc_memchr3_double_ended_iter()
/third_party/ffmpeg/libavcodec/arm/
H A Dsimple_idct_arm.S102 mul r0, r8, r7 @ R0=W1*ROWr16[1]=b0 (ROWr16[1] must be the second arg, to have the possibility to save 1 cycle)
105 mul r1, r9, r7 @ R1=W3*ROWr16[1]=b1 (ROWr16[1] must be the second arg, to have the possibility to save 1 cycle)
107 mul r5, r10, r7 @ R5=W5*ROWr16[1]=b2 (ROWr16[1] must be the second arg, to have the possibility to save 1 cycle)
108 mul r7, r11, r7 @ R7=W7*ROWr16[1]=b3 (ROWr16[1] must be the second arg, to have the possibility to save 1 cycle)
111 mlane r0, r9, r2, r0 @ R0+=W3*ROWr16[3]=b0 (ROWr16[3] must be the second arg, to have the possibility to save 1 cycle)
113 mlane r1, r11, r2, r1 @ R1-=W7*ROWr16[3]=b1 (ROWr16[3] must be the second arg, to have the possibility to save 1 cycle)
114 mlane r5, r8, r2, r5 @ R5-=W1*ROWr16[3]=b2 (ROWr16[3] must be the second arg, to have the possibility to save 1 cycle)
116 mlane r7, r10, r2, r7 @ R7-=W5*ROWr16[3]=b3 (ROWr16[3] must be the second arg, to have the possibility to save 1 cycle)
312 mul r0, r8, r7 @ R0=W1*ROWr16[1]=b0 (ROWr16[1] must be the second arg, to have the possibility to save 1 cycle)
315 mul r1, r9, r7 @ R1=W3*ROWr16[1]=b1 (ROWr16[1] must be the second arg, to have the possibility to save 1 cycle)
[all...]
/third_party/ltp/testcases/kernel/hotplug/cpu_hotplug/functional/
H A Dcpuhotplug01.sh30 -l number of cycle test
33 -e time delay before start of entire new cycle

Completed in 29 milliseconds

12345