Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 25 of 35) sorted by relevance

12

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/sysdeps/linux/sparc/sparcv7/
A Dudiv.S146 ! depth 1, accumulated bits 0
151 ! depth 2, accumulated bits 1
156 ! depth 3, accumulated bits 3
161 ! depth 4, accumulated bits 7
179 ! depth 4, accumulated bits 5
198 ! depth 3, accumulated bits 1
203 ! depth 4, accumulated bits 3
221 ! depth 4, accumulated bits 1
241 ! depth 2, accumulated bits -1
246 ! depth 3, accumulated bits -1
[all …]
A Durem.S146 ! depth 1, accumulated bits 0
151 ! depth 2, accumulated bits 1
156 ! depth 3, accumulated bits 3
161 ! depth 4, accumulated bits 7
179 ! depth 4, accumulated bits 5
198 ! depth 3, accumulated bits 1
203 ! depth 4, accumulated bits 3
221 ! depth 4, accumulated bits 1
241 ! depth 2, accumulated bits -1
246 ! depth 3, accumulated bits -1
[all …]
A Drem.S159 ! depth 1, accumulated bits 0
164 ! depth 2, accumulated bits 1
169 ! depth 3, accumulated bits 3
174 ! depth 4, accumulated bits 7
192 ! depth 4, accumulated bits 5
211 ! depth 3, accumulated bits 1
216 ! depth 4, accumulated bits 3
234 ! depth 4, accumulated bits 1
254 ! depth 2, accumulated bits -1
259 ! depth 3, accumulated bits -1
[all …]
A Dsdiv.S159 ! depth 1, accumulated bits 0
164 ! depth 2, accumulated bits 1
169 ! depth 3, accumulated bits 3
174 ! depth 4, accumulated bits 7
192 ! depth 4, accumulated bits 5
211 ! depth 3, accumulated bits 1
216 ! depth 4, accumulated bits 3
234 ! depth 4, accumulated bits 1
254 ! depth 2, accumulated bits -1
259 ! depth 3, accumulated bits -1
[all …]
/l4re-core-master/uclibc/lib/contrib/uclibc/extra/scripts/
A Dunifdef.c631 if (depth == 0) in ignoreoff()
633 ignoring[depth] = ignoring[depth-1]; in ignoreoff()
638 ignoring[depth] = true; in ignoreon()
651 if (depth > MAXDEPTH-1) in nest()
655 depth += 1; in nest()
661 if (depth == 0) in unnest()
663 depth -= 1; in unnest()
668 ifstate[depth] = is; in state()
766 ifstate_name[ifstate[depth]], depth); in process()
1571 if (depth == 0) in error()
[all …]
/l4re-core-master/cxx/lib/tl/include/
A Davl_tree177 bool rec_dump(Avl_tree_node *n, int depth, int *dp, bool print, char pfx);
370 bool Avl_tree<Node, Get_key, Compare>::rec_dump(Avl_tree_node *n, int depth, int *dp, bool print, c…
377 int dpx[2] = {depth,depth};
380 res = rec_dump(n->next<A>(Dir::R), depth + 1, dpx + 1, print, '/');
384 fprintf(stderr, "%2d: [%8p] b=%1d: ", depth, n, (int)n->balance().d);
386 for (int i = 0; i < depth; ++i)
392 res = res & rec_dump(n->next<A>(Dir::L), depth + 1, dpx, print, '\\');
408 fprintf(stderr, "%2d: [%8p] b=%1d: balance error %d\n", depth, n, (int)n->balance().d, b);
/l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/
A Dsem_close.c33 walker (const void *inodep, const VISIT which, const int depth) in walker() argument
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/wordexp/
A Dwordexp.c1151 int depth = 0; in parse_param() local
1255 ++depth; in parse_param()
1260 if (depth == 0) in parse_param()
1262 --depth; in parse_param()
1908 int depth = 0; in parse_dollars() local
1910 while (words[i] && !(depth == 0 && words[i] == ')')) { in parse_dollars()
1912 ++depth; in parse_dollars()
1914 --depth; in parse_dollars()
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/glob/
A Dglob.c212 unsigned int depth = 0; in __next_brace_sub() local
222 if ((*cp == '}' && depth-- == 0) || (*cp == ',' && depth == 0)) in __next_brace_sub()
226 depth++; in __next_brace_sub()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/src/filesystem/
A Dstd-dir.cc222 fs::recursive_directory_iterator::depth() const in depth() function in fs::recursive_directory_iterator
A Ddir.cc219 fs::recursive_directory_iterator::depth() const in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/src/filesystem/
A Ddir.cc225 fs::recursive_directory_iterator::depth() const in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/src/filesystem/
A Ddir.cc225 fs::recursive_directory_iterator::depth() const in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/src/filesystem/
A Ddir.cc225 fs::recursive_directory_iterator::depth() const in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/src/c++17/
A Dfs_dir.cc236 fs::recursive_directory_iterator::depth() const noexcept in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/src/c++17/
A Dfs_dir.cc236 fs::recursive_directory_iterator::depth() const noexcept in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/src/c++17/
A Dfs_dir.cc236 fs::recursive_directory_iterator::depth() const noexcept in depth() function in fs::recursive_directory_iterator
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/experimental/bits/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/experimental/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/experimental/bits/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/experimental/bits/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/experimental/bits/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/experimental/bits/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/experimental/bits/
A Dfs_dir.h291 int depth() const; in _GLIBCXX_VISIBILITY()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/src/filesystem/
A Ddir.cc272 fs::recursive_directory_iterator::depth() const in depth() function in fs::recursive_directory_iterator

Completed in 34 milliseconds

12