/dports/multimedia/vlc/vlc-3.0.16/include/ |
H A D | vlc_mouse.h | 110 const vlc_mouse_t *p_new ) in vlc_mouse_GetMotion() argument 112 *pi_x = p_new->i_x - p_old->i_x; in vlc_mouse_GetMotion() 113 *pi_y = p_new->i_y - p_old->i_y; in vlc_mouse_GetMotion() 118 const vlc_mouse_t *p_new ) in vlc_mouse_HasChanged() argument 120 return p_old->i_x != p_new->i_x || p_old->i_y != p_new->i_y || in vlc_mouse_HasChanged() 121 p_old->i_pressed != p_new->i_pressed; in vlc_mouse_HasChanged() 124 const vlc_mouse_t *p_new ) in vlc_mouse_HasMoved() argument 126 return p_old->i_x != p_new->i_x || p_old->i_y != p_new->i_y; in vlc_mouse_HasMoved() 129 const vlc_mouse_t *p_new ) in vlc_mouse_HasButton() argument 131 return p_old->i_pressed != p_new->i_pressed; in vlc_mouse_HasButton() [all …]
|
/dports/print/ttfautohint/ttfautohint-1.8.4/lib/ |
H A D | tapost.c | 63 FT_Byte* p_new; in TA_sfnt_update_post_table() local 103 p_new = buf_new; in TA_sfnt_update_post_table() 105 memcpy(p_new, p, 32); /* header */ in TA_sfnt_update_post_table() 107 p_new += 32; in TA_sfnt_update_post_table() 109 *p_new = HIGH(num_glyphs + 1); in TA_sfnt_update_post_table() 110 *(p_new + 1) = LOW(num_glyphs + 1); in TA_sfnt_update_post_table() 112 p_new += 2; in TA_sfnt_update_post_table() 116 p_new += num_glyphs * 2; in TA_sfnt_update_post_table() 119 *(p_new + 1) = LOW(max_name_idx + 1 + 257); in TA_sfnt_update_post_table() 120 p_new += 2; in TA_sfnt_update_post_table() [all …]
|
/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/tests/ |
H A D | test_linear_cone.py | 64 p_new = ConeMatrixStuffing().apply(p) 65 sltn = solve_wrapper(solver, p_new[0]) 77 p_new = ConeMatrixStuffing().apply(p) 78 sltn = solve_wrapper(solver, p_new[0]) 94 p_new = ConeMatrixStuffing().apply(p) 95 sltn = solve_wrapper(solver, p_new[0]) 112 p_new = ConeMatrixStuffing().apply(p) 141 p_new = ConeMatrixStuffing().apply(p) 166 p_new = ConeMatrixStuffing().apply(p) 215 if not solver.accepts(p_new[0]): [all …]
|
/dports/multimedia/vlc/vlc-3.0.16/modules/video_filter/ |
H A D | magnify.c | 395 if( p_new->i_x >= 0 && p_new->i_x < i_visu_width && in Mouse() 396 p_new->i_y >= 0 && p_new->i_y < i_visu_height ) in Mouse() 412 else if( p_new->i_x >= 0 && p_new->i_x < 80 && in Mouse() 413 p_new->i_y >= i_visu_height && in Mouse() 414 p_new->i_y < i_visu_height + 9 ) in Mouse() 423 else if( p_new->i_x >= 0 && in Mouse() 424 p_new->i_x <= ( i_visu_height + 90 - p_new->i_y ) * in Mouse() 447 if( p_new->i_x >= 0 && p_new->i_x < 80 && in Mouse() 448 p_new->i_y >= 0 && p_new->i_y <= 10 ) in Mouse() 459 if( vlc_mouse_HasMoved( p_old, p_new ) ) in Mouse() [all …]
|
H A D | puzzle.c | 638 if( p_new->i_x < 0 || p_new->i_x >= (int)p_fmt_in->i_width || in puzzle_mouse() 639 p_new->i_y < 0 || p_new->i_y >= (int)p_fmt_in->i_height ) in puzzle_mouse() 643 *p_mouse = *p_new; in puzzle_mouse() 647 p_sys->i_mouse_x = p_new->i_x; in puzzle_mouse() 648 p_sys->i_mouse_y = p_new->i_y; in puzzle_mouse() 655 p_new->i_x < SHUFFLE_WIDTH && p_new->i_y < SHUFFLE_LINES ) in puzzle_mouse() 663 *p_mouse = *p_new; in puzzle_mouse() 684 …if ((p_new->i_x <= i_border_width) || (p_new->i_y <= i_border_height) || (p_new->i_x >= (int) p_f… in puzzle_mouse() 686 *p_mouse = *p_new; in puzzle_mouse() 747 *p_mouse = *p_new; in puzzle_mouse() [all …]
|
H A D | freeze.c | 226 const vlc_mouse_t *p_old, const vlc_mouse_t *p_new ) in freeze_mouse() argument 232 if( p_new->i_x < 0 || p_new->i_x >= (int)p_fmt_in->i_width || in freeze_mouse() 233 p_new->i_y < 0 || p_new->i_y >= (int)p_fmt_in->i_height ) in freeze_mouse() 238 *p_mouse = *p_new; in freeze_mouse() 243 if( vlc_mouse_HasPressed( p_old, p_new, MOUSE_BUTTON_LEFT ) ) in freeze_mouse() 245 else if( vlc_mouse_IsLeftPressed( p_new ) ) in freeze_mouse() 258 int32_t i_sq_dist = ( p_new->i_x - i_c ) in freeze_mouse() 259 * ( p_new->i_x - i_c ) in freeze_mouse() 260 + ( p_new->i_y - i_r ) in freeze_mouse() 261 * ( p_new->i_y - i_r ); in freeze_mouse()
|
/dports/math/polymake/polymake-4.5/apps/polytope/src/ |
H A D | rel_int_point.cc | 71 BigObject p_new(p.type()); in rel_int_point() local 78 p_new.take(f) << F; in rel_int_point() 81 p_new.take("EQUATIONS") << E; in rel_int_point() 82 p_new.take("INEQUALITIES") << F; in rel_int_point() 85 p_new.take("ONE_VERTEX") << v0; in rel_int_point() 87 p_new.take("BOUNDED") << true; in rel_int_point() 91 p_new.take("FEASIBLE")<<1; in rel_int_point() 93 p_new.take("LP.LINEAR_OBJECTIVE")<<(0|ort.row(i)); in rel_int_point() 94 const Coord min=p_new.give("LP.MINIMAL_VALUE"); in rel_int_point() 95 const Coord max=p_new.give("LP.MAXIMAL_VALUE"); in rel_int_point() [all …]
|
/dports/deskutils/ljclive/clive-0.4.10/src/ |
H A D | hash.c | 86 p_prev = p_next = p_new = (keypair *) NULL; in put() 89 lj_debug(3, "New keypair [%p]\n", p_new); in put() 90 p_new->key = strdup(key); in put() 91 lj_debug(3, "\tkey [%p/%s]\n", p_new->key, p_new->key); in put() 92 p_new->value = strdup(value); in put() 93 lj_debug(3, "\tvalue [%p/%s]\n", p_new->value, p_new->value); in put() 101 p_new->p_prev = p_prev; in put() 103 p_prev->p_next = p_new; in put() 105 *pp_head = p_new; in put() 108 p_new->p_next = p_next; in put() [all …]
|
/dports/devel/godot/godot-3.2.3-stable/scene/resources/ |
H A D | height_map_shape.cpp | 91 void HeightMapShape::set_map_width(int p_new) { in set_map_width() argument 92 if (p_new < 1) { in set_map_width() 94 } else if (map_width != p_new) { in set_map_width() 96 map_width = p_new; in set_map_width() 117 void HeightMapShape::set_map_depth(int p_new) { in set_map_depth() argument 118 if (p_new < 1) { in set_map_depth() 120 } else if (map_depth != p_new) { in set_map_depth() 122 map_depth = p_new; in set_map_depth() 143 void HeightMapShape::set_map_data(PoolRealArray p_new) { in set_map_data() argument 145 if (p_new.size() != size) { in set_map_data() [all …]
|
/dports/devel/godot-tools/godot-3.2.3-stable/scene/resources/ |
H A D | height_map_shape.cpp | 91 void HeightMapShape::set_map_width(int p_new) { in set_map_width() argument 92 if (p_new < 1) { in set_map_width() 94 } else if (map_width != p_new) { in set_map_width() 96 map_width = p_new; in set_map_width() 117 void HeightMapShape::set_map_depth(int p_new) { in set_map_depth() argument 118 if (p_new < 1) { in set_map_depth() 120 } else if (map_depth != p_new) { in set_map_depth() 122 map_depth = p_new; in set_map_depth() 143 void HeightMapShape::set_map_data(PoolRealArray p_new) { in set_map_data() argument 145 if (p_new.size() != size) { in set_map_data() [all …]
|
/dports/games/flightgear/flightgear-2020.3.11/src/Systems/ |
H A D | static.cxx | 76 …double p_new = _pressure_in_node->getDoubleValue(); //current static press… in update() local 101 …pt = p_new * pow(1 + 0.2 * mach*mach*proj_factor*proj_factor, 3.5 ); //total pressure perpendic… in update() 102 …qc_part = (pt - p_new) * _error_factor ; //part of impact pressure to b… in update() 103 p_new = p_new + qc_part; in update() 107 _tau > .0 ? fgGetLowPass(p, p_new, trat) : p_new in update()
|
/dports/devel/remake/remake-4.3+dbg-1.5/src/debugger/ |
H A D | break.c | 49 breakpoint_node_t *p_new = CALLOC (breakpoint_node_t, 1); in add_breakpoint() local 51 if (!p_new) return false; in add_breakpoint() 56 p_breakpoint_top = p_breakpoint_bottom = p_new; in add_breakpoint() 58 p_breakpoint_bottom->p_next = p_new; in add_breakpoint() 60 p_breakpoint_bottom = p_new; in add_breakpoint() 61 p_new->p_target = p_target; in add_breakpoint() 62 p_new->i_num = ++i_breakpoints; in add_breakpoint() 63 p_new->brkpt_mask = brkpt_mask; in add_breakpoint()
|
/dports/multimedia/vlc/vlc-3.0.16/src/playlist/ |
H A D | thread.c | 268 playlist_item_t *p_new = NULL; in NextItem() local 285 p_new = p_sys->request.p_item; in NextItem() 305 if( i_skip == 0 && ( p_new == NULL || p_new->i_children != -1 ) ) in NextItem() 308 if( p_new != NULL ) in NextItem() 310 p_new = playlist_GetNextLeaf( p_playlist, p_new, NULL, true, false ); in NextItem() 324 ResetCurrentlyPlaying( p_playlist, p_new ); in NextItem() 325 else if( p_new ) in NextItem() 326 ResyncCurrentIndex( p_playlist, p_new ); in NextItem() 349 p_new = ARRAY_VAL( p_playlist->current, in NextItem() 369 p_new = ARRAY_VAL( p_playlist->current, in NextItem() [all …]
|
/dports/sysutils/xvidcap/xvidcap-1.1.7/ffmpeg/libavcodec/ |
H A D | libdirac_libschro.c | 85 FfmpegDiracSchroQueueElement *p_new = in ff_dirac_schro_queue_push_back() local 88 if (p_new == NULL) in ff_dirac_schro_queue_push_back() 91 p_new->data = p_data; in ff_dirac_schro_queue_push_back() 94 queue->p_head = p_new; in ff_dirac_schro_queue_push_back() 96 queue->p_tail->next = p_new; in ff_dirac_schro_queue_push_back() 97 queue->p_tail = p_new; in ff_dirac_schro_queue_push_back()
|
/dports/multimedia/vlc/vlc-3.0.16/src/input/ |
H A D | stats.c | 167 counter_sample_t *p_new, *p_old; in stats_Update() local 173 p_new = (counter_sample_t*)malloc( sizeof( counter_sample_t ) ); in stats_Update() 174 if (unlikely(p_new == NULL)) in stats_Update() 177 p_new->value = val; in stats_Update() 178 p_new->date = p_counter->last_update; in stats_Update() 179 TAB_INSERT(p_counter->i_samples, p_counter->pp_samples, p_new, 0); in stats_Update() 192 counter_sample_t *p_new = (counter_sample_t*)malloc( in stats_Update() local 194 if (unlikely(p_new == NULL)) in stats_Update() 197 p_new->value = 0; in stats_Update() 199 TAB_APPEND(p_counter->i_samples, p_counter->pp_samples, p_new); in stats_Update()
|
/dports/multimedia/vlc/vlc-3.0.16/lib/ |
H A D | core.c | 45 libvlc_instance_t *p_new = malloc (sizeof (*p_new)); in libvlc_new() local 46 if (unlikely(p_new == NULL)) in libvlc_new() 65 p_new->p_libvlc_int = p_libvlc_int; in libvlc_new() 66 p_new->vlm = NULL; in libvlc_new() 67 p_new->ref_count = 1; in libvlc_new() 68 p_new->p_callback_list = NULL; in libvlc_new() 69 vlc_mutex_init(&p_new->instance_lock); in libvlc_new() 70 return p_new; in libvlc_new() 73 free (p_new); in libvlc_new()
|
/dports/devel/tinygo/tinygo-0.14.1/lib/CMSIS/CMSIS/RTOS/RTX/SRC/ |
H A D | rt_Memory.c | 67 MEMP *p, *p_search, *p_new; in rt_alloc_mem() local 96 p_new = (MEMP *)((U32)p_search + p_search->len); in rt_alloc_mem() 97 p_new->next = p_search->next; in rt_alloc_mem() 98 p_new->len = size; in rt_alloc_mem() 99 p_search->next = p_new; in rt_alloc_mem() 100 p = (MEMP *)(((U32)p_new) + sizeof(MEMP)); in rt_alloc_mem()
|
/dports/math/py-pymc3/pymc-3.11.4/pymc3/step_methods/hmc/ |
H A D | integration.py | 87 p_new = state.p.copy() 95 axpy(state.q_grad, p_new, a=dt) 97 pot.velocity(p_new, out=v_new) 105 axpy(q_new_grad, p_new, a=dt) 107 kinetic = pot.velocity_energy(p_new, v_new) 110 return State(q_new, p_new, v_new, q_new_grad, energy, logp)
|
/dports/science/ALPSCore/ALPSCore-2.2.0/params/test/ |
H A D | params_hdf5.cpp | 85 params p_new(args.argc(), args.argv()); in TEST_F() local 87 EXPECT_EQ(par_, p_new); in TEST_F() 92 EXPECT_TRUE(p_new.is_restored()); in TEST_F() 93 EXPECT_EQ(file_.name(), p_new.get_archive_name()); in TEST_F() 104 EXPECT_ANY_THROW(params p_new(args.argc(), args.argv())); in TEST_F() 115 EXPECT_ANY_THROW(params p_new(args.argc(), args.argv())); in TEST_F()
|
/dports/devel/p5-Tree-Node/Tree-Node-0.08/t/ |
H A D | 20-lowlevel.t | 10 my $n = p_new(1); 24 my $m = p_new(2); 42 $n = p_new(1); 43 $m = p_new(4);
|
/dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/drd/ |
H A D | drd_malloc_wrappers.c | 181 void* p_new; in drd_realloc() local 210 p_new = p_old; in drd_realloc() 218 p_new = p_old; in drd_realloc() 223 p_new = VG_(cli_malloc)(VG_(clo_alignment), new_size); in drd_realloc() 225 if (p_new) in drd_realloc() 228 VG_(memcpy)(p_new, p_old, mc->size); in drd_realloc() 237 mc->data = (Addr)p_new; in drd_realloc() 241 s_start_using_mem_callback((Addr)p_new, new_size, 0/*ec_uniq*/); in drd_realloc() 249 return p_new; in drd_realloc()
|
/dports/devel/valgrind/valgrind-dragonfly-dragonfly/drd/ |
H A D | drd_malloc_wrappers.c | 181 void* p_new; in drd_realloc() local 210 p_new = p_old; in drd_realloc() 218 p_new = p_old; in drd_realloc() 223 p_new = VG_(cli_malloc)(VG_(clo_alignment), new_size); in drd_realloc() 225 if (p_new) in drd_realloc() 228 VG_(memcpy)(p_new, p_old, mc->size); in drd_realloc() 237 mc->data = (Addr)p_new; in drd_realloc() 241 s_start_using_mem_callback((Addr)p_new, new_size, 0/*ec_uniq*/); in drd_realloc() 249 return p_new; in drd_realloc()
|
/dports/math/polymake/polymake-4.5/apps/polytope/include/ |
H A D | optimal_contains.h | 154 BigObject p_new(p_out.type()); in optimal_contains_primal_dual() 155 p_new.take("INEQUALITIES") << F_new/costfkt; in optimal_contains_primal_dual() 156 p_new.take("LP.LINEAR_OBJECTIVE") << costfkt; in optimal_contains_primal_dual() 246 BigObject p_new(p_out.type()); in optimal_contains_dual_dual() 247 p_new.take("INEQUALITIES") << F_new/Pos/costfkt; in optimal_contains_dual_dual() 249 p_new.take("LP.LINEAR_OBJECTIVE") << costfkt; in optimal_contains_dual_dual() 253 if(!p_new.give("FEASIBLE")){ in optimal_contains_dual_dual() 376 BigObject p_new(p_out.type()); in optimal_contains_primal_primal() 377 p_new.take("INEQUALITIES") << Pos; in optimal_contains_primal_primal() 379 p_new.take("LP.LINEAR_OBJECTIVE") << costfkt; in optimal_contains_primal_primal() [all …]
|
/dports/math/ogdf/OGDF/test/src/basic/ |
H A D | graphattributes.cpp | 479 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 496 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 513 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 532 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 534 AssertThat(p_new.m_x, Equals(p_old.m_x)); in __anon542b6e620902() 549 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 551 AssertThat(p_new.m_x, Equals(p_old.m_x)); in __anon542b6e620902() 568 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 585 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() 602 for(DPoint &p_new : attr.bends(e)) { in __anon542b6e620902() [all …]
|
/dports/emulators/vice/vice-3.5/src/lib/libffmpeg/libavcodec/ |
H A D | libschroedinger.c | 84 FFSchroQueueElement *p_new = av_mallocz(sizeof(FFSchroQueueElement)); in ff_schro_queue_push_back() local 86 if (!p_new) in ff_schro_queue_push_back() 89 p_new->data = p_data; in ff_schro_queue_push_back() 92 queue->p_head = p_new; in ff_schro_queue_push_back() 94 queue->p_tail->next = p_new; in ff_schro_queue_push_back() 95 queue->p_tail = p_new; in ff_schro_queue_push_back()
|