Searched refs:cyclic (Results 1 - 5 of 5) sorted by relevance
| /third_party/lwip/src/core/ |
| H A D | timeouts.c | 77 /** This array contains all stack-internal cyclic timers. To get the number of
226 * Timer callback function that calls cyclic->handler() and reschedules itself.
238 const struct lwip_cyclic_timer *cyclic = (const struct lwip_cyclic_timer *)arg; in lwip_cyclic_timer() local
241 LWIP_DEBUGF(TIMERS_DEBUG, ("tcpip: %s()\n", cyclic->handler_name)); in lwip_cyclic_timer()
243 cyclic->handler(); in lwip_cyclic_timer()
246 next_timeout_time = (u32_t)(current_timeout_due_time + cyclic->interval_ms); /* overflow handled by TIME_LESS_THAN macro */ in lwip_cyclic_timer()
250 sys_timeout_abs((u32_t)(now + cyclic->interval_ms), lwip_cyclic_timer, arg, cyclic->handler_name); in lwip_cyclic_timer()
252 sys_timeout_abs((u32_t)(now + cyclic->interval_ms), lwip_cyclic_timer, arg); in lwip_cyclic_timer()
256 /* correct cyclic interva in lwip_cyclic_timer()
[all...] |
| /third_party/python/Lib/idlelib/ |
| H A D | history.py | 21 .cyclic - wrap around history list (or not).
27 self.cyclic = idleConf.GetOption("main", "History", "cyclic", 1, "bool")
32 "Fetch later statement; start with earliest if cyclic."
47 because cyclic is False.
62 if self.cyclic:
72 if not self.cyclic and pointer < 0: # abort history_prev
|
| /third_party/python/Lib/idlelib/idle_test/ |
| H A D | test_history.py | 33 self.assertEqual(self.history.cyclic,
34 idleConf.GetOption("main", "History", "cyclic", 1, "bool"))
135 self.history.cyclic = False
143 self.history.cyclic = False
|
| /third_party/protobuf/src/google/protobuf/util/internal/ |
| H A D | protostream_objectsource_test.cc | 576 Cyclic cyclic; in TEST_P() local
577 cyclic.set_m_int(123); in TEST_P()
579 Book* book = cyclic.mutable_m_book(); in TEST_P()
581 Cyclic* current = cyclic.mutable_m_cyclic(); in TEST_P()
582 Author* current_author = cyclic.add_m_author(); in TEST_P()
598 Status status = ExecuteTest(cyclic, Cyclic::descriptor()); in TEST_P()
|
| /third_party/ffmpeg/libavcodec/x86/ |
| H A D | lossless_audiodsp.asm | 154 ; linear is faster than branch tree or jump table, because the branches taken are cyclic (i.e. predictable)
|
Completed in 3 milliseconds