Home
last modified time | relevance | path

Searched refs:label_rep (Results 1 – 25 of 27) sorted by relevance

12

/dports/x11-wm/enlightenment/enlightenment-0.24.2/src/bin/
H A De_widget_config_list.c221 const char *label_rep; in _button_cb_up() local
228 label_rep = e_widget_ilist_nth_label_get(wd->gui.list, idx_sel - 1); in _button_cb_up()
231 e_widget_ilist_nth_label_set(wd->gui.list, idx_sel, label_rep); in _button_cb_up()
242 const char *label_rep; in _button_cb_down() local
249 label_rep = e_widget_ilist_nth_label_get(wd->gui.list, idx_sel + 1); in _button_cb_down()
252 e_widget_ilist_nth_label_set(wd->gui.list, idx_sel, label_rep); in _button_cb_down()
/dports/graphics/epix/epix-1.2.19/
H A Daxis.h57 axis& label_rep(std::string f(double, unsigned int, unsigned int));
H A Daxis.cc138 axis& axis::label_rep(std::string f(double, unsigned int, unsigned int)) in label_rep() function in ePiX::axis
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-ssa-structalias.c2374 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2376 if (label_rep == -1) in unite_pointer_equivalences()
2379 label_rep = find (label_rep); in unite_pointer_equivalences()
2380 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2381 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dtree-ssa-structalias.c2348 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2350 if (label_rep == -1) in unite_pointer_equivalences()
2353 label_rep = find (label_rep); in unite_pointer_equivalences()
2354 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2355 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-ssa-structalias.c2489 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2491 if (label_rep == -1) in unite_pointer_equivalences()
2494 label_rep = find (label_rep); in unite_pointer_equivalences()
2495 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2496 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dtree-ssa-structalias.c2479 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2481 if (label_rep == -1) in unite_pointer_equivalences()
2484 label_rep = find (label_rep); in unite_pointer_equivalences()
2485 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2486 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-ssa-structalias.c2489 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2491 if (label_rep == -1) in unite_pointer_equivalences()
2494 label_rep = find (label_rep); in unite_pointer_equivalences()
2495 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2496 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-ssa-structalias.c2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2492 if (label_rep == -1) in unite_pointer_equivalences()
2495 label_rep = find (label_rep); in unite_pointer_equivalences()
2496 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2497 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dtree-ssa-structalias.c2539 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2541 if (label_rep == -1) in unite_pointer_equivalences()
2544 label_rep = find (label_rep); in unite_pointer_equivalences()
2545 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2546 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2492 if (label_rep == -1) in unite_pointer_equivalences()
2495 label_rep = find (label_rep); in unite_pointer_equivalences()
2496 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2497 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-ssa-structalias.c2549 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2551 if (label_rep == -1) in unite_pointer_equivalences()
2554 label_rep = find (label_rep); in unite_pointer_equivalences()
2555 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2556 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2492 if (label_rep == -1) in unite_pointer_equivalences()
2495 label_rep = find (label_rep); in unite_pointer_equivalences()
2496 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2497 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dtree-ssa-structalias.c2539 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2541 if (label_rep == -1) in unite_pointer_equivalences()
2544 label_rep = find (label_rep); in unite_pointer_equivalences()
2545 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2546 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dtree-ssa-structalias.c2497 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2499 if (label_rep == -1) in unite_pointer_equivalences()
2502 label_rep = find (label_rep); in unite_pointer_equivalences()
2503 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2504 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2492 if (label_rep == -1) in unite_pointer_equivalences()
2495 label_rep = find (label_rep); in unite_pointer_equivalences()
2496 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2497 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2492 if (label_rep == -1) in unite_pointer_equivalences()
2495 label_rep = find (label_rep); in unite_pointer_equivalences()
2496 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2497 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-ssa-structalias.c2549 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2551 if (label_rep == -1) in unite_pointer_equivalences()
2554 label_rep = find (label_rep); in unite_pointer_equivalences()
2555 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2556 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dtree-ssa-structalias.c2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2492 if (label_rep == -1) in unite_pointer_equivalences()
2495 label_rep = find (label_rep); in unite_pointer_equivalences()
2496 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2497 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-ssa-structalias.c2549 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2551 if (label_rep == -1) in unite_pointer_equivalences()
2554 label_rep = find (label_rep); in unite_pointer_equivalences()
2555 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2556 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dtree-ssa-structalias.c2539 int label_rep = graph->pe_rep[label];
2541 if (label_rep == -1)
2544 label_rep = find (label_rep);
2545 if (label_rep >= 0 && unite (label_rep, find (i)))
2546 unify_nodes (graph, label_rep, i, false);
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dtree-ssa-structalias.c2497 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2499 if (label_rep == -1) in unite_pointer_equivalences()
2502 label_rep = find (label_rep); in unite_pointer_equivalences()
2503 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2504 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dtree-ssa-structalias.c2497 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2499 if (label_rep == -1) in unite_pointer_equivalences()
2502 label_rep = find (label_rep); in unite_pointer_equivalences()
2503 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2504 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-ssa-structalias.c2569 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences() local
2571 if (label_rep == -1) in unite_pointer_equivalences()
2574 label_rep = find (label_rep); in unite_pointer_equivalences()
2575 if (label_rep >= 0 && unite (label_rep, find (i))) in unite_pointer_equivalences()
2576 unify_nodes (graph, label_rep, i, false); in unite_pointer_equivalences()
/dports/graphics/epix/epix-1.2.19/doc/
H A Depix.info2181 Ax.label_rep(f);
4188 * axis.label_rep: Coordinate Axes and Labels.

12