Home
last modified time | relevance | path

Searched refs:level (Results 1 – 25 of 135) sorted by relevance

123456

/l4re-core-master/uclibc/lib/uclibc/ARCH-sparc/include/asm/
A Dtraps.h100 #define BAD_TRAP_P(level) \ argument
101 ((level > SP_TRAP_WDOG && level < SP_TRAP_IRQ1) || \
102 (level > SP_TRAP_IACC && level < SP_TRAP_CPDIS) || \
103 (level > SP_TRAP_BADFL && level < SP_TRAP_CPEXP) || \
104 (level > SP_TRAP_DMM && level < SP_TRAP_IMM) || \
105 (level > SP_TRAP_IMM && level < SP_TRAP_SUNOS) || \
106 (level > SP_TRAP_LINUX && level < SP_TRAP_KBPT1))
109 #define HW_TRAP_P(level) ((level > 0) && (level < SP_TRAP_SUNOS)) argument
112 #define SW_TRAP_P(level) ((level >= SP_TRAP_SUNOS) && (level <= SP_TRAP_KBPT2)) argument
115 #define SCALL_TRAP_P(level) ((level == SP_TRAP_SUNOS) || \ argument
[all …]
/l4re-core-master/uclibc/lib/contrib/uclibc/test/misc/
A Dbug-glob2.c47 int level; member
75 int level; member
85 int level = 1; in find_file() local
100 while (idx < nfiles && filesystem[idx].level >= level) in find_file()
102 if (filesystem[idx].level == level in find_file()
109 if (idx == nfiles || filesystem[idx].level < level) in find_file()
120 || filesystem[idx].level >= filesystem[idx + 1].level)) in find_file()
129 ++level; in find_file()
163 dir->level = filesystem[idx].level; in my_opendir()
188 if (dir->idx == nfiles || filesystem[dir->idx].level < dir->level) in my_readdir()
[all …]
A Dtst-gnuglob.c43 int level; member
92 int level; member
102 int level = 1; in find_file() local
117 while (idx < nfiles && filesystem[idx].level >= level) in find_file()
119 if (filesystem[idx].level == level in find_file()
126 if (idx == nfiles || filesystem[idx].level < level) in find_file()
137 || filesystem[idx].level >= filesystem[idx + 1].level)) in find_file()
146 ++level; in find_file()
171 dir->level = filesystem[idx].level; in my_opendir()
196 if (dir->idx == nfiles || filesystem[dir->idx].level < dir->level) in my_readdir()
[all …]
/l4re-core-master/lua/lib/contrib/src/
A Dlfunc.c88 UpVal *luaF_findupval (lua_State *L, StkId level) { in luaF_findupval() argument
99 return newupval(L, 0, level, pp); in luaF_findupval()
145 TValue *uv = s2v(level); /* value being closed */ in prepcallclosemth()
169 void luaF_newtbcupval (lua_State *L, StkId level) { in luaF_newtbcupval() argument
170 lua_assert(level > L->tbclist); in luaF_newtbcupval()
171 if (l_isfalse(s2v(level))) in luaF_newtbcupval()
178 level->tbclist.delta = cast(unsigned short, level - L->tbclist); in luaF_newtbcupval()
179 L->tbclist = level; in luaF_newtbcupval()
194 void luaF_closeupval (lua_State *L, StkId level) { in luaF_closeupval() argument
229 ptrdiff_t levelrel = savestack(L, level); in luaF_close()
[all …]
A Dlfunc.h54 LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level);
55 LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level);
56 LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level);
57 LUAI_FUNC void luaF_close (lua_State *L, StkId level, int status, int yy);
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/search/
A D_tsearch.c159 static void trecurse(const void *vroot, __action_fn_t action, int level) in trecurse() argument
164 (*action)(root, leaf, level); in trecurse()
167 (*action)(root, preorder, level); in trecurse()
169 trecurse(root->left, action, level + 1); in trecurse()
170 (*action)(root, postorder, level); in trecurse()
172 trecurse(root->right, action, level + 1); in trecurse()
173 (*action)(root, endorder, level); in trecurse()
/l4re-core-master/uclibc/lib/contrib/uclibc/test/regex/
A Dtestregex.c1020 return skip | level; in note()
1050 skip |= level; in extract()
1132 unsigned long level; in old_main() local
1250 level = 1; in old_main()
1467 locale = level; in old_main()
1594 level <<= 1; in old_main()
1597 skip |= level; in old_main()
1602 skip &= ~level; in old_main()
1607 if (level == 1) in old_main()
1609 if ((skip & level) && !(skip & (level>>1))) in old_main()
[all …]
/l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/
A Dpthread_setconcurrency.c28 pthread_setconcurrency (int level) in pthread_setconcurrency() argument
30 if (level < 0) in pthread_setconcurrency()
33 __concurrency_level = level; in pthread_setconcurrency()
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/sysdeps/linux/arm/
A Diopl.c26 int iopl(int level) in iopl() argument
28 if (level > 3) { in iopl()
32 if (level) in iopl()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/ext/pb_ds/detail/
A Dtree_trace_base.hpp119 trace_node(node_const_iterator nd_it, size_type level) const in trace_node()
122 trace_node(nd_it.get_r_child(), level + 1); in trace_node()
124 for (size_type i = 0; i < level; ++i) in trace_node()
138 trace_node(nd_it.get_l_child(), level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
60 for (size_type i = 0; i < level; ++i) in trace_node()
70 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
60 for (size_type i = 0; i < level; ++i) in trace_node()
70 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
60 for (size_type i = 0; i < level; ++i) in trace_node()
70 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
60 for (size_type i = 0; i < level; ++i) in trace_node()
70 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
60 for (size_type i = 0; i < level; ++i) in trace_node()
70 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp58 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
62 for (size_type i = 0; i < level; ++i) in trace_node()
72 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp56 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
60 for (size_type i = 0; i < level; ++i) in trace_node()
70 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
A Dtrace_fn_imps.hpp58 trace_node(node_const_pointer p_nd, size_type level) in trace_node() argument
62 for (size_type i = 0; i < level; ++i) in trace_node()
72 trace_node(p_nd->m_p_l_child, level + 1); in trace_node()

Completed in 103 milliseconds

123456