| /src/external/gpl3/gcc/dist/gcc/ |
| sparseset.h | 50 This makes it a competitive choice for iterating over relatively sparse
80 Accessing the sparse vector is not very cache-friendly, but iterating
96 bool iterating; member in struct:sparseset_def
116 s->iterating = false;
187 s->iterating = true;
193 if (s->iterating && s->iter < s->members)
196 return s->iterating = false;
|
| sparseset.cc | 71 /* If we are iterating over this set and we want to delete a
76 if (s->iterating && idx <= iter)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sparseset.h | 50 This makes it a competitive choice for iterating over relatively sparse
80 Accessing the sparse vector is not very cache-friendly, but iterating
96 bool iterating; member in struct:sparseset_def
116 s->iterating = false;
187 s->iterating = true;
193 if (s->iterating && s->iter < s->members)
196 return s->iterating = false;
|
| sparseset.cc | 71 /* If we are iterating over this set and we want to delete a
76 if (s->iterating && idx <= iter)
|
| /src/external/mit/libuv/dist/src/unix/ |
| linux-inotify.c | 39 int iterating; member in struct:watcher_list
107 * list until we're done iterating. c.f. uv__inotify_read.
111 watcher_list->iterating = 1;
129 watcher_list->iterating = 0;
159 if ((!w->iterating) && QUEUE_EMPTY(&w->watchers)) {
218 * And we don't free the watcher_list until we're done iterating.
224 w->iterating = 1;
235 /* done iterating, time to (maybe) free empty watcher_list */
236 w->iterating = 0;
291 w->iterating = 0
[all...] |
| linux.c | 260 int iterating; member in struct:watcher_list
2537 * list until we're done iterating. c.f. uv__inotify_read.
2541 watcher_list->iterating = 1;
2559 watcher_list->iterating = 0;
2589 if ((!w->iterating) && uv__queue_empty(&w->watchers)) {
2649 * And we don't free the watcher_list until we're done iterating.
2655 w->iterating = 1;
2666 /* done iterating, time to (maybe) free empty watcher_list */
2667 w->iterating = 0;
2725 w->iterating = 0
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/Windows/ |
| DynamicLibrary.inc | 139 // symbols from ucrt.dll first, but iterating NOT in reverse here would
|
| /src/external/lgpl3/gmp/dist/mpn/s390_32/esame/ |
| sqr_basecase.asm | 42 C * Stop iterating addmul_1 loop at latest for n = 2, implement longer tail.
|
| /src/external/lgpl3/gmp/dist/mpn/s390_64/ |
| sqr_basecase.asm | 42 C * Stop iterating addmul_1 loop at latest for n = 2, implement longer tail.
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/k8/ |
| mullo_basecase.asm | 42 C * Stop iterating addmul_2 earlier, falling into straight-line triangle code
|
| /src/external/lgpl3/gmp/dist/mpn/x86/atom/sse2/ |
| mul_basecase.asm | 40 C * Write combined addmul_1 feed-in a wind-down code, and use when iterating
|
| sqr_basecase.asm | 39 C * Write combined addmul_1 feed-in a wind-down code, and use when iterating
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/datetime/ |
| interval.d | 81 generated successive Easters (i.e. you're iterating over all of the Easters
85 next one generated by the function (which when iterating forward would be
86 the Easter following the original `front`, while when iterating backward,
91 desired - e.g. if iterating over every day starting at the beginning of the
1407 auto func = delegate (scope const Date date) // For iterating over even-numbered days.
1501 auto func = delegate (scope const Date date) // For iterating over even-numbered days.
4094 auto func = delegate (scope const Date date) //For iterating over even-numbered days.
6319 auto func = delegate (scope const Date date) //For iterating over even-numbered days.
7709 Since it wouldn't really make sense to be iterating over a specific month
7929 Note that if iterating forward, `add!"years"()` is called on the give
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/range/ |
| package.d | 5593 Iterating over `Lockstep` in reverse and with an index is only possible
5595 indexes. If an attempt is made at iterating in reverse when `s` ==
5680 /// Lockstep also supports iterating with an index variable:
6262 // Iterating upward
6270 // Iterating downward
8022 input: iterating over `front` will shrink the chunk such that subsequent
8318 assert(chunked.front.empty); // Iterating the chunk has consumed it
12885 pipeOnPop = If `Yes.pipeOnPop`, simply iterating the range without ever
|
