/dports/math/fplll/fplll-5.4.1/fplll/pruner/ |
H A D | pruner_optimize_tp.cpp | 14 vec b(dn), old_b(dn), old_b2(dn); in optimize_coefficients_incr_prob() local 53 old_b[i] = b[i]; in optimize_coefficients_incr_prob() 64 if (b[i] != old_b[i]) in optimize_coefficients_incr_prob() 80 vec b(dn), old_b(dn), old_b2(dn); in optimize_coefficients_decr_prob() local 120 old_b[i] = b[i]; in optimize_coefficients_decr_prob() 131 if (b[i] != old_b[i]) in optimize_coefficients_decr_prob() 148 vec b(dn), old_b(dn), old_b2(dn); in optimize_coefficients_local_adjust_prob() local 173 old_b[i] = b[i]; in optimize_coefficients_local_adjust_prob() 183 old_b[i] = b[i]; in optimize_coefficients_local_adjust_prob() 195 if (b[i] != old_b[i]) in optimize_coefficients_local_adjust_prob()
|
/dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libast/hash/ |
H A D | hashsize.c | 42 register Hash_bucket_t* old_b; in hashsize() local 64 old_b = *old_s++; in hashsize() 65 while (old_b) in hashsize() 67 new_b = old_b; in hashsize() 68 old_b = old_b->next; in hashsize()
|
/dports/shells/ksh93/ast-93u/src/lib/libast/hash/ |
H A D | hashsize.c | 42 register Hash_bucket_t* old_b; in hashsize() local 64 old_b = *old_s++; in hashsize() 65 while (old_b) in hashsize() 67 new_b = old_b; in hashsize() 68 old_b = old_b->next; in hashsize()
|
/dports/shells/ast-ksh/ast-ksh93v/src/lib/libast/hash/ |
H A D | hashsize.c | 42 register Hash_bucket_t* old_b; in hashsize() local 64 old_b = *old_s++; in hashsize() 65 while (old_b) in hashsize() 67 new_b = old_b; in hashsize() 68 old_b = old_b->next; in hashsize()
|
/dports/www/firefox-esr/firefox-91.8.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/multimedia/svt-vp9/SVT-VP9-0.3.0/Source/Lib/VPX/ |
H A D | vp9_subexp.c | 121 const int old_b = cost_branch256(ct, oldp); in eb_vp9_prob_diff_update_savings_search() local 128 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in eb_vp9_prob_diff_update_savings_search() 132 const int savings = old_b - new_b - update_b; in eb_vp9_prob_diff_update_savings_search() 147 int i, old_b, new_b, update_b, savings, bestsavings; in eb_vp9_prob_diff_update_savings_search_model() local 156 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in eb_vp9_prob_diff_update_savings_search_model() 158 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in eb_vp9_prob_diff_update_savings_search_model() 165 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in eb_vp9_prob_diff_update_savings_search_model() 173 savings = old_b - new_b - update_b; in eb_vp9_prob_diff_update_savings_search_model()
|
/dports/net-im/tg_owt/tg_owt-d578c76/src/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/multimedia/libvpx/libvpx-1.11.0/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/lang/spidermonkey60/firefox-60.9.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 118 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 124 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 128 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 143 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 151 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 153 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 160 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 168 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/www/firefox/firefox-99.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/mail/thunderbird/thunderbird-91.8.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/lang/spidermonkey78/firefox-78.9.0/media/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 125 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search() 129 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 144 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local 152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model() 154 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model() 161 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model() 169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/multimedia/gstreamer1-plugins-svt-vp9/SVT-VP9-0.3.0/Source/Lib/VPX/ |
H A D | vp9_subexp.c | 121 const int old_b = cost_branch256(ct, oldp); in eb_vp9_prob_diff_update_savings_search() local 128 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in eb_vp9_prob_diff_update_savings_search() 132 const int savings = old_b - new_b - update_b; in eb_vp9_prob_diff_update_savings_search() 147 int i, old_b, new_b, update_b, savings, bestsavings; in eb_vp9_prob_diff_update_savings_search_model() local 156 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in eb_vp9_prob_diff_update_savings_search_model() 158 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in eb_vp9_prob_diff_update_savings_search_model() 165 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in eb_vp9_prob_diff_update_savings_search_model() 173 savings = old_b - new_b - update_b; in eb_vp9_prob_diff_update_savings_search_model()
|
/dports/www/firefox-legacy/firefox-52.8.0esr/media/libvpx/vp9/encoder/ |
H A D | vp9_subexp.c | 123 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local 131 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search() 146 int i, old_b, new_b, update_b, savings, bestsavings, step; in vp9_prob_diff_update_savings_search_model() local 151 for (i = UNCONSTRAINED_NODES, old_b = 0; i < ENTROPY_NODES; ++i) in vp9_prob_diff_update_savings_search_model() 152 old_b += cost_branch256(ct + 2 * i, oldplist[i]); in vp9_prob_diff_update_savings_search_model() 153 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]); in vp9_prob_diff_update_savings_search_model() 170 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model() 188 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
/dports/devel/aws-c-common/aws-c-common-0.6.15/verification/cbmc/proofs/aws_linked_list_swap_contents/ |
H A D | aws_linked_list_swap_contents_harness.c | 23 struct aws_linked_list old_b = b; in aws_linked_list_swap_contents_harness() local 33 assert(old_b.tail.prev == old_b_head); in aws_linked_list_swap_contents_harness() 35 assert(a.head.next == old_b.head.next); in aws_linked_list_swap_contents_harness() 36 assert(a.tail.prev == old_b.tail.prev); in aws_linked_list_swap_contents_harness()
|
/dports/graphics/aseprite/aseprite-1.2.9/src/she/alleg4/ |
H A D | mouse_poller.cpp | 111 void generate_mouse_event_for_button(Event::MouseButton button, int old_b, int new_b) in generate_mouse_event_for_button() argument 113 if (old_b == new_b) // No changes in this mouse button in generate_mouse_event_for_button() 279 int old_b = she_mouse_b; in mouse_poller_generate_events() local 303 if (she_mouse_b != old_b) { in mouse_poller_generate_events() 304 generate_mouse_event_for_button(Event::LeftButton, old_b & 1, she_mouse_b & 1); in mouse_poller_generate_events() 305 generate_mouse_event_for_button(Event::RightButton, old_b & 2, she_mouse_b & 2); in mouse_poller_generate_events() 306 generate_mouse_event_for_button(Event::MiddleButton, old_b & 4, she_mouse_b & 4); in mouse_poller_generate_events()
|
/dports/math/mpsolve/mpsolve-3.2.1/src/libmps/secsolve/ |
H A D | standard-regeneration-driver.c | 20 cplx_t * old_a = NULL, * old_b = NULL; in mps_standard_regeneration_driver_update_fsecular_equation() local 33 old_b = cplx_valloc (s->n); in mps_standard_regeneration_driver_update_fsecular_equation() 41 cplx_set (old_b[i], sec->bfpc[i]); in mps_standard_regeneration_driver_update_fsecular_equation() 42 cdpe_set_x (old_db[i], old_b[i]); in mps_standard_regeneration_driver_update_fsecular_equation() 43 mpc_set_cplx (old_mb[i], old_b[i]); in mps_standard_regeneration_driver_update_fsecular_equation() 54 cplx_set (sec->bfpc[i], old_b[i]); in mps_standard_regeneration_driver_update_fsecular_equation() 76 cplx_set (sec->bfpc[i], old_b[i]); in mps_standard_regeneration_driver_update_fsecular_equation() 92 cplx_vfree (old_b); in mps_standard_regeneration_driver_update_fsecular_equation()
|
/dports/finance/gnucash/gnucash-4.9/libgnucash/engine/ |
H A D | gnc-budget.c | 316 const GncBudget* old_b; member 329 if ( gnc_budget_is_account_period_value_set(data->old_b, a, i) ) in clone_budget_values_cb() 338 gnc_budget_clone(const GncBudget* old_b) in gnc_budget_clone() argument 344 g_return_val_if_fail(old_b != NULL, NULL); in gnc_budget_clone() 348 new_b = gnc_budget_new(qof_instance_get_book(old_b)); in gnc_budget_clone() 350 gnc_budget_set_name(new_b, gnc_budget_get_name(old_b)); in gnc_budget_clone() 351 gnc_budget_set_description(new_b, gnc_budget_get_description(old_b)); in gnc_budget_clone() 352 gnc_budget_set_recurrence(new_b, gnc_budget_get_recurrence(old_b)); in gnc_budget_clone() 353 gnc_budget_set_num_periods(new_b, gnc_budget_get_num_periods(old_b)); in gnc_budget_clone() 355 root = gnc_book_get_root_account(qof_instance_get_book(old_b)); in gnc_budget_clone() [all …]
|
/dports/devel/boost-docs/boost_1_72_0/libs/contract/test/public_function/ |
H A D | old_virtual.cpp | 51 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 63 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 85 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 98 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 121 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 134 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/contract/test/public_function/ |
H A D | old_virtual.cpp | 51 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 63 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 85 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 98 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 121 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 134 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f()
|
/dports/devel/boost-libs/boost_1_72_0/libs/contract/test/public_function/ |
H A D | old_virtual.cpp | 51 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 63 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 85 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 98 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 121 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 134 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f()
|
/dports/devel/hyperscan/boost_1_75_0/libs/contract/test/public_function/ |
H A D | old_virtual.cpp | 51 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 63 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 85 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 98 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f() 121 boost::contract::old_ptr<num> old_b = BOOST_CONTRACT_OLDOF(v, n + 2); in f() local 134 BOOST_CONTRACT_ASSERT(old_b->value() == i + 2); in f()
|