HomeSort by: relevance | last modified time | path
    Searched defs:p_l (Results 1 - 22 of 22) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp 57 entry_pointer p_l = m_p_l; local
58 while (p_l->m_p_next != 0)
60 entry_pointer p_next = p_l->m_p_next;
65 p_l->m_p_next = p_next->m_p_next;
73 p_l = p_next;
84 apply_update(entry_pointer p_l, type_to_type<Metadata>)
85 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp 51 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local
53 if (p_l != 0)
56 return std::make_pair(point_iterator(&p_l->m_value), false);
61 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator);
62 p_l->m_p_next = m_p_l;
63 m_p_l = p_l;
65 return std::make_pair(point_iterator(&p_l->m_value), true);
73 entry_pointer p_l = s_entry_allocator.allocate(1); local
74 cond_dealtor_t cond(p_l);
75 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value))
89 entry_pointer p_l = s_entry_allocator.allocate(1); local
    [all...]
trace_fn_imps.hpp 51 const_entry_pointer p_l = m_p_l; local
52 while (p_l != 0)
54 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl;
55 p_l = p_l->m_p_next;
erase_fn_imps.hpp 60 entry_pointer p_l = m_p_l; local
61 while (p_l->m_p_next != 0)
62 if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value)))
64 erase_next(p_l);
68 p_l = p_l->m_p_next;
99 entry_pointer p_l = m_p_l;
100 while (p_l->m_p_next != 0)
102 if (pred(p_l->m_p_next->m_value))
105 erase_next(p_l);
    [all...]
constructor_destructor_fn_imps.hpp 92 entry_pointer p_l = allocate_new_entry(*it, local
95 p_l->m_p_next = m_p_l;
96 m_p_l = p_l;
125 entry_pointer p_l = m_p_l; local
126 while (p_l != 0)
128 entry_pointer p_next_l = p_l->m_p_next;
129 actual_erase_entry(p_l);
130 p_l = p_next_l;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp 57 entry_pointer p_l = m_p_l; local
58 while (p_l->m_p_next != 0)
60 entry_pointer p_next = p_l->m_p_next;
65 p_l->m_p_next = p_next->m_p_next;
73 p_l = p_next;
84 apply_update(entry_pointer p_l, type_to_type<Metadata>)
85 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp 51 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local
53 if (p_l != 0)
56 return std::make_pair(point_iterator(&p_l->m_value), false);
61 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator);
62 p_l->m_p_next = m_p_l;
63 m_p_l = p_l;
65 return std::make_pair(point_iterator(&p_l->m_value), true);
73 entry_pointer p_l = s_entry_allocator.allocate(1); local
74 cond_dealtor_t cond(p_l);
75 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value))
89 entry_pointer p_l = s_entry_allocator.allocate(1); local
    [all...]
trace_fn_imps.hpp 51 const_entry_pointer p_l = m_p_l; local
52 while (p_l != 0)
54 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl;
55 p_l = p_l->m_p_next;
erase_fn_imps.hpp 60 entry_pointer p_l = m_p_l; local
61 while (p_l->m_p_next != 0)
62 if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value)))
64 erase_next(p_l);
68 p_l = p_l->m_p_next;
99 entry_pointer p_l = m_p_l;
100 while (p_l->m_p_next != 0)
102 if (pred(p_l->m_p_next->m_value))
105 erase_next(p_l);
    [all...]
constructor_destructor_fn_imps.hpp 92 entry_pointer p_l = allocate_new_entry(*it, local
95 p_l->m_p_next = m_p_l;
96 m_p_l = p_l;
125 entry_pointer p_l = m_p_l; local
126 while (p_l != 0)
128 entry_pointer p_next_l = p_l->m_p_next;
129 actual_erase_entry(p_l);
130 p_l = p_next_l;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp 119 node_pointer p_l = p_nd->m_p_left; local
126 base_type::m_p_head->m_p_parent = p_l;
127 if (p_l != 0)
128 p_l->m_p_parent = base_type::m_p_head;
143 p_target_r->m_p_left = p_l;
144 if (p_l != 0)
145 p_l->m_p_parent = p_target_r;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp 119 node_pointer p_l = p_nd->m_p_left; local
126 base_type::m_p_head->m_p_parent = p_l;
127 if (p_l != 0)
128 p_l->m_p_parent = base_type::m_p_head;
143 p_target_r->m_p_left = p_l;
144 if (p_l != 0)
145 p_l->m_p_parent = p_target_r;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
split_join_fn_imps.hpp 151 find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r)
161 if (p_l->m_red == false)
167 p_l_parent = p_l;
168 p_l = p_l->m_p_right;
171 if (!is_effectively_black(p_l))
173 p_l_parent = p_l;
174 p_l = p_l->m_p_right;
177 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_l));
275 node_pointer p_l = p_nd->m_p_left; local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
split_join_fn_imps.hpp 151 find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r)
161 if (p_l->m_red == false)
167 p_l_parent = p_l;
168 p_l = p_l->m_p_right;
171 if (!is_effectively_black(p_l))
173 p_l_parent = p_l;
174 p_l = p_l->m_p_right;
177 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_l));
275 node_pointer p_l = p_nd->m_p_left; local
    [all...]
  /src/crypto/external/apache2/openssl/dist/apps/
testdsa.h 1416 int p_l; member in struct:testdsa_st
1430 st.p_l = sizeof(dsa##bits##_p); \
1463 p = BN_bin2bn(dsa_t.p, dsa_t.p_l, NULL);
  /src/crypto/external/bsd/openssl/dist/apps/
testdsa.h 197 int p_l; member in struct:testdsa_st
211 st.p_l = sizeof(dsa##bits##_p); \
244 p = BN_bin2bn(dsa_t.p, dsa_t.p_l, NULL);
  /src/crypto/external/bsd/openssl.old/dist/apps/
testdsa.h 195 int p_l; member in struct:testdsa_st
209 st.p_l = sizeof(dsa##bits##_p); \
238 p = BN_bin2bn(dsa_t.p, dsa_t.p_l, NULL);
  /src/lib/libm/ld128/
e_powl.c 148 long double z, ax, z_h, z_l, p_h, p_l; local
351 p_l = v - (p_h - u);
353 z_l = cp_l * p_h + p_l * cp + dp_l[k];
374 p_l = (y - yy1) * t1 + y * t2;
376 z = p_l + p_h;
387 if (p_l + ovt > z - p_h)
400 if (p_l <= z - p_h)
404 /* compute 2**(p_h+p_l) */
414 t = p_l + p_h;
420 v = (p_l - (t - p_h)) * lg2 + t * lg2_l
    [all...]
  /src/lib/libm/src/
e_pow.c 102 double z,ax,z_h,z_l,p_h,p_l; local
249 p_l = v-(p_h-u);
251 z_l = cp_l*p_h+p_l*cp+dp_l[k];
262 p_l = (y-yy1)*t1+y*t2;
264 z = p_l+p_h;
270 if(p_l+ovt>z-p_h) return s*huge*huge; /* overflow */
276 if(p_l<=z-p_h) return s*tiny*tiny; /* underflow */
280 * compute 2**(p_h+p_l)
294 t = p_l+p_h;
297 v = (p_l-(t-p_h))*lg2+t*lg2_l
    [all...]
e_powf.c 61 float z,ax,z_h,z_l,p_h,p_l; local
194 p_l = v-(p_h-u);
196 z_l = cp_l*p_h+p_l*cp+dp_l[k];
208 p_l = (y-yy1)*t1+y*t2;
210 z = p_l+p_h;
215 if(p_l+ovt>z-p_h) return sn*huge*huge; /* overflow */
220 if(p_l<=z-p_h) return sn*tiny*tiny; /* underflow */
223 * compute 2**(p_h+p_l)
236 t = p_l+p_h;
240 v = (p_l-(t-p_h))*lg2+t*lg2_l
    [all...]
  /src/external/gpl3/gcc/dist/libquadmath/math/
powq.c 149 __float128 z, ax, z_h, z_l, p_h, p_l; local
362 p_l = v - (p_h - u);
364 z_l = cp_l * p_h + p_l * cp + dp_l[k];
380 p_l = (y - y1) * t1 + y * t2;
382 z = p_l + p_h;
392 if (p_l + ovt > z - p_h)
404 if (p_l <= z - p_h)
408 /* compute 2**(p_h+p_l) */
418 t = p_l + p_h;
424 v = (p_l - (t - p_h)) * lg2 + t * lg2_l
    [all...]
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
powq.c 149 __float128 z, ax, z_h, z_l, p_h, p_l; local
362 p_l = v - (p_h - u);
364 z_l = cp_l * p_h + p_l * cp + dp_l[k];
380 p_l = (y - y1) * t1 + y * t2;
382 z = p_l + p_h;
392 if (p_l + ovt > z - p_h)
404 if (p_l <= z - p_h)
408 /* compute 2**(p_h+p_l) */
418 t = p_l + p_h;
424 v = (p_l - (t - p_h)) * lg2 + t * lg2_l
    [all...]

Completed in 40 milliseconds