Home	Sort by: relevance | last modified time | path

Full Search in project(s): src xsrc Definition Symbol File Path History   | | Help

    Searched defs:iterating (Results 1 - 8 of 8) sorted by relevancy

/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.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;
/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.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;
/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-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...]
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...]

Completed in 30 milliseconds

Indexes created Sun May 17 00:24:36 UTC 2026