| /third_party/lwip/src/core/ |
| D | timeouts.c | 236 const struct lwip_cyclic_timer *cyclic = (const struct lwip_cyclic_timer *)arg; in lwip_cyclic_timer() local
239 LWIP_DEBUGF(TIMERS_DEBUG, ("tcpip: %s()\n", cyclic->handler_name)); in lwip_cyclic_timer()
241 cyclic->handler(); in lwip_cyclic_timer()
244 …next_timeout_time = (u32_t)(current_timeout_due_time + cyclic->interval_ms); /* overflow handled … in lwip_cyclic_timer()
248 … sys_timeout_abs((u32_t)(now + cyclic->interval_ms), lwip_cyclic_timer, arg, cyclic->handler_name); in lwip_cyclic_timer()
250 sys_timeout_abs((u32_t)(now + cyclic->interval_ms), lwip_cyclic_timer, arg); in lwip_cyclic_timer()
256 sys_timeout_abs(next_timeout_time, lwip_cyclic_timer, arg, cyclic->handler_name); in lwip_cyclic_timer()
|
| /third_party/python/Modules/ |
| D | gc_weakref.txt | 5 for that matter) during cyclic gc:
40 The primary thing it missed is that when a weakref to a piece of cyclic
43 possibly resurrect an insane object (one for which cyclic gc has called-- or
59 Clearing cyclic trash can call Python code. If there are weakrefs to
60 any of the cyclic trash, then those weakrefs can be used to resurrect
61 the objects. Therefore, *before* clearing cyclic trash, we need to
77 Before 2.3.3, Python's cyclic gc didn't pay any attention to weakrefs.
87 becomes part of a clump of cyclic trash. When enough cycles are broken by
88 cyclic gc that the object is reclaimed, the callback is invoked. If it's
105 the current collection, and nothing reachable from it would be in cyclic
[all …]
|
| /third_party/python/Lib/idlelib/ |
| D | history.py | 27 self.cyclic = idleConf.GetOption("main", "History", "cyclic", 1, "bool")
62 if self.cyclic:
72 if not self.cyclic and pointer < 0: # abort history_prev
|
| D | config-main.def | 91 cyclic=1
|
| /third_party/typescript/tests/baselines/reference/ |
| D | arrayFakeFlatNoCrashInferenceDeclarations.errors.txt | 1 …3,10): error TS5088: The inferred type of 'foo' references a type with a cyclic structure which ca…
19 !!! error TS5088: The inferred type of 'foo' references a type with a cyclic structure which cannot…
|
| D | cyclicTypeInstantiation.types | 48 // Relating types of a and b produces instantiations of the cyclic anonymous types in foo and bar
|
| D | cyclicTypeInstantiation.symbols | 50 // Relating types of a and b produces instantiations of the cyclic anonymous types in foo and bar
|
| /third_party/node/deps/npm/node_modules/cyclist/ |
| D | README.md | 3 Cyclist is an efficient [cyclic list](http://en.wikipedia.org/wiki/Circular_buffer) implemention fo…
10 Cyclist allows you to create a list of fixed size that is cyclic.
|
| /third_party/python/Lib/idlelib/idle_test/ |
| D | test_history.py | 33 self.assertEqual(self.history.cyclic,
135 self.history.cyclic = False
143 self.history.cyclic = False
|
| /third_party/node/test/es-module/ |
| D | test-esm-cyclic-dynamic-import.mjs | 2 import('./test-esm-cyclic-dynamic-import.mjs');
|
| /third_party/boost/libs/math/doc/sf/ |
| D | bessel_spherical.qbk | 40 The j[sub v] function is cyclic like J[sub v] but differs in its behaviour at the origin:
44 Likewise y[sub v] is also cyclic for large x, but tends to -[infin]
|
| D | airy.qbk | 43 the function is cyclic, while for positive /x/ the value tends to zero:
97 the function is cyclic, while for positive /x/ the value tends to infinity:
151 the function is cyclic, while for positive /x/ the value tends to zero:
205 the function is cyclic, while for positive /x/ the value tends to infinity:
|
| D | bessel_jy.qbk | 46 The following graph illustrates the cyclic nature of J[sub v]:
51 cyclic for large /x/, but tends to -[infin] for small /x/:
67 libraries. Note that the cyclic nature of these
|
| /third_party/protobuf/src/google/protobuf/util/internal/ |
| 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/node/deps/npm/node_modules/npm-install-checks/ |
| D | README.md | 20 Check for cyclic dependencies.
|
| /third_party/python/Lib/test/leakers/ |
| D | README.txt | 8 Note: be careful to check for cyclic garbage. Sometimes it may be helpful
|
| /third_party/boost/libs/xpressive/doc/ |
| D | grammars.qbk | 110 Let's take a closer look at this regular expression grammar. Notice that it is cyclic: `expression`…
113 a cyclic grammar is to forward-declare the regex objects and embed by reference those regular expre…
181 … of you who have dealt with reference counting are probably familiar with its Achilles Heel: cyclic
184 reference tracking code that ensures that even cyclic regex grammars are cleaned up when the last e…
185 reference goes away. So don't worry about it. Create cyclic grammars, pass your regex objects aroun…
|
| /third_party/python/Doc/c-api/ |
| D | allocation.rst | 19 object participates in the cyclic garbage detector, it is added to the
|
| /third_party/quickjs/ |
| D | TODO | 2 - modules: better error handling with cyclic module references
|
| /third_party/boost/libs/phoenix/doc/ |
| D | organisation.qbk | 24 The modules are orthogonal, with no cyclic dependencies.
|
| /third_party/python/Doc/extending/ |
| D | newtypes_tutorial.rst | 433 handler on a type which doesn't support cyclic garbage collection [#]_.
658 Supporting cyclic garbage collection
661 Python has a :term:`cyclic garbage collector (GC) <garbage collection>` that
673 Fortunately, Python's cyclic garbage collector will eventually figure out that
691 be properly detected and collected by the cyclic GC, our :class:`Custom` type
697 First, the traversal method lets the cyclic GC know about subobjects that could
789 :c:member:`~PyTypeObject.tp_free` handlers, we'd need to modify them for cyclic
|
| /third_party/ffmpeg/libavcodec/x86/ |
| D | lossless_audiodsp.asm | 164 …; linear is faster than branch tree or jump table, because the branches taken are cyclic (i.e. pre…
|
| /third_party/python/Doc/library/ |
| D | xml.dom.minidom.rst | 121 versions of Python without cyclic GC. Even when cyclic GC is available, using
|
| D | graphlib.rst | 210 the first and the last node will be the same, to make it clear that it is cyclic.
|
| /third_party/boost/libs/outcome/doc/src/content/motivation/ |
| D | narrow_contract.md | 120 Allowing for some input values to be invalid works similarly to cyclic redundancy
|