Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 197) sorted by relevance

12345678

/l4re-core-master/uclibc/lib/contrib/uclibc/extra/config/
A Dexpr.c73 e->left = org->left; in expr_copy()
76 e->left.expr = expr_copy(org->left.expr); in expr_copy()
80 e->left.sym = org->left.sym; in expr_copy()
86 e->left.expr = expr_copy(org->left.expr); in expr_copy()
143 e1->left.sym == e2->left.sym && in __expr_eliminate_eq()
200 return e1->left.sym == e2->left.sym; in expr_eq()
210 e1->left.sym == e2->left.sym); in expr_eq()
240 if (e->left.expr->left.sym == &symbol_no) { in expr_eliminate_yn()
367 sym2 = e2->left.expr->left.sym; in expr_join_or()
431 sym2 = e2->left.expr->left.sym; in expr_join_and()
[all …]
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/search/
A D_tsearch.c42 struct node_t *left, *right; member
74 q->left = q->right = (struct node_t *)0; in tsearch()
123 &(*rootp)->left : /* follow left branch */ in libc_hidden_def()
135 r->left = q; in libc_hidden_def()
140 for (q = r->left; q->left != (struct node_t *)0; q = r->left) in libc_hidden_def()
142 r->left = q->right; in libc_hidden_def()
143 q->left = (*rootp)->left; in libc_hidden_def()
168 if (root->left != (struct node_t *)0) in trecurse()
169 trecurse(root->left, action, level + 1); in trecurse()
199 if (root->left != NULL) in tdestroy_recurse()
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp109 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
110 const size_type ersd = m_size - left; in erase_if()
111 for (size_type i = left; i < m_size; ++i) in erase_if()
128 m_size = left; in erase_if()
187 size_type left = 0; in partition() local
190 while (right + 1 != left) in partition()
194 if (!pred(m_a_entries[left])) in partition()
195 ++left; in partition()
200 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
202 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred)); in split() local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
56 const size_type ersd = m_size - left; in split()
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
94 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp109 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
110 const size_type ersd = m_size - left; in erase_if()
111 for (size_type i = left; i < m_size; ++i) in erase_if()
128 m_size = left; in erase_if()
187 size_type left = 0; in partition() local
190 while (right + 1 != left) in partition()
194 if (!pred(m_a_entries[left])) in partition()
195 ++left; in partition()
200 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
202 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred)); in split() local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
56 const size_type ersd = m_size - left; in split()
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
94 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp109 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
110 const size_type ersd = m_size - left; in erase_if()
111 for (size_type i = left; i < m_size; ++i) in erase_if()
128 m_size = left; in erase_if()
187 size_type left = 0; in partition() local
190 while (right + 1 != left) in partition()
194 if (!pred(m_a_entries[left])) in partition()
195 ++left; in partition()
200 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
202 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred)); in split() local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
56 const size_type ersd = m_size - left; in split()
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
94 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp109 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
110 const size_type ersd = m_size - left; in erase_if()
111 for (size_type i = left; i < m_size; ++i) in erase_if()
128 m_size = left; in erase_if()
187 size_type left = 0; in partition() local
190 while (right + 1 != left) in partition()
194 if (!pred(m_a_entries[left])) in partition()
195 ++left; in partition()
200 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
202 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred)); in split() local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
56 const size_type ersd = m_size - left; in split()
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
94 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp111 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
112 const size_type ersd = m_size - left; in erase_if()
113 for (size_type i = left; i < m_size; ++i) in erase_if()
130 m_size = left; in erase_if()
189 size_type left = 0; in partition() local
192 while (right + 1 != left) in partition()
196 if (!pred(m_a_entries[left])) in partition()
197 ++left; in partition()
202 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
204 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp55 const size_type left = partition(pred_t(pred)); in split() local
56 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
58 const size_type ersd = m_size - left; in split()
61 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
86 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
87 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
88 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
96 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp109 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
110 const size_type ersd = m_size - left; in erase_if()
111 for (size_type i = left; i < m_size; ++i) in erase_if()
128 m_size = left; in erase_if()
187 size_type left = 0; in partition() local
190 while (right + 1 != left) in partition()
194 if (!pred(m_a_entries[left])) in partition()
195 ++left; in partition()
200 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
202 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred)); in split() local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
56 const size_type ersd = m_size - left; in split()
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
94 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp111 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
112 const size_type ersd = m_size - left; in erase_if()
113 for (size_type i = left; i < m_size; ++i) in erase_if()
130 m_size = left; in erase_if()
189 size_type left = 0; in partition() local
192 while (right + 1 != left) in partition()
196 if (!pred(m_a_entries[left])) in partition()
197 ++left; in partition()
202 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
204 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp55 const size_type left = partition(pred_t(pred)); in split() local
56 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
58 const size_type ersd = m_size - left; in split()
61 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
86 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
87 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
88 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
96 m_size = left; in split()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/ext/pb_ds/detail/binary_heap_/
A Derase_fn_imps.hpp109 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
110 const size_type ersd = m_size - left; in erase_if()
111 for (size_type i = left; i < m_size; ++i) in erase_if()
128 m_size = left; in erase_if()
187 size_type left = 0; in partition() local
190 while (right + 1 != left) in partition()
194 if (!pred(m_a_entries[left])) in partition()
195 ++left; in partition()
200 _GLIBCXX_DEBUG_ASSERT(left < right); in partition()
202 ++left; in partition()
[all …]
A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred)); in split() local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
56 const size_type ersd = m_size - left; in split()
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left); in split()
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
94 m_size = left; in split()
/l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/sysdeps/pthread/
A Dposix-timer.h124 timespec_compare (const struct timespec *left, const struct timespec *right) in timespec_compare() argument
126 if (left->tv_sec < right->tv_sec) in timespec_compare()
128 if (left->tv_sec > right->tv_sec) in timespec_compare()
131 if (left->tv_nsec < right->tv_nsec) in timespec_compare()
133 if (left->tv_nsec > right->tv_nsec) in timespec_compare()
140 timespec_add (struct timespec *sum, const struct timespec *left, in timespec_add() argument
143 sum->tv_sec = left->tv_sec + right->tv_sec; in timespec_add()
144 sum->tv_nsec = left->tv_nsec + right->tv_nsec; in timespec_add()
154 timespec_sub (struct timespec *diff, const struct timespec *left, in timespec_sub() argument
157 diff->tv_sec = left->tv_sec - right->tv_sec; in timespec_sub()
[all …]
/l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/linuxthreads/sysdeps/pthread/
A Dposix-timer.h131 timespec_compare (const struct timespec *left, const struct timespec *right) in timespec_compare() argument
133 if (left->tv_sec < right->tv_sec) in timespec_compare()
135 if (left->tv_sec > right->tv_sec) in timespec_compare()
138 if (left->tv_nsec < right->tv_nsec) in timespec_compare()
140 if (left->tv_nsec > right->tv_nsec) in timespec_compare()
147 timespec_add (struct timespec *sum, const struct timespec *left, in timespec_add() argument
150 sum->tv_sec = left->tv_sec + right->tv_sec; in timespec_add()
151 sum->tv_nsec = left->tv_nsec + right->tv_nsec; in timespec_add()
161 timespec_sub (struct timespec *diff, const struct timespec *left, in timespec_sub() argument
164 diff->tv_sec = left->tv_sec - right->tv_sec; in timespec_sub()
[all …]
A Dtimer_routines.c496 thread_attr_compare (const pthread_attr_t *left, const pthread_attr_t *right) in thread_attr_compare() argument
498 return (left->__detachstate == right->__detachstate in thread_attr_compare()
499 && left->__schedpolicy == right->__schedpolicy in thread_attr_compare()
500 && left->__guardsize == right->__guardsize in thread_attr_compare()
501 && (left->__schedparam.sched_priority in thread_attr_compare()
503 && left->__inheritsched == right->__inheritsched in thread_attr_compare()
504 && left->__scope == right->__scope in thread_attr_compare()
505 && left->__stacksize == right->__stacksize in thread_attr_compare()
506 && left->__stackaddr_set == right->__stackaddr_set in thread_attr_compare()
507 && (left->__stackaddr_set in thread_attr_compare()
[all …]
/l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/sysdeps/unix/sysv/linux/sparc/sparc32/
A Dpthread_barrier_wait.c38 --ibarrier->b.left; in pthread_barrier_wait()
41 if (ibarrier->b.left == 0) in pthread_barrier_wait()
74 if (atomic_increment_val (&ibarrier->b.left) == init_count) in pthread_barrier_wait()
80 unsigned int left; in pthread_barrier_wait() local
85 left = ++ibarrier->b.left; in pthread_barrier_wait()
87 if (left == init_count) in pthread_barrier_wait()
/l4re-core-master/uclibc/lib/contrib/uclibc/test/nptl/
A Dtst-tsd3.c30 static int left; variable
36 if (--left > 0) in destr1()
52 if (--left > 0) in destr2()
69 left = 7; in tf()
106 if (left != 0) in do_test()
108 printf ("left == %d\n", left); in do_test()
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/signal/
A Dsigandset.c24 int sigandset (sigset_t *dest, const sigset_t *left, const sigset_t *right) in sigandset() argument
26 if (dest == NULL || left == NULL || right == NULL) in sigandset()
32 return __sigandset (dest, left, right); in sigandset()
A Dsigorset.c24 int sigorset (sigset_t *dest, const sigset_t *left, const sigset_t *right) in sigorset() argument
26 if (dest == NULL || left == NULL || right == NULL) in sigorset()
32 return __sigorset (dest, left, right); in sigorset()

Completed in 27 milliseconds

12345678