Home
last modified time | relevance | path

Searched refs:Set_Node (Results 1 – 25 of 63) sorted by relevance

123

/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
H A Da-btgbso.adb356 Set_Node : Count_Type; variable
359 Set_Node := Of_Set.First;
361 if Set_Node = 0 then
370 Of_Set.Nodes (Set_Node))
375 if Is_Less (Of_Set.Nodes (Set_Node),
378 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
380 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ada/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
H A Da-btgbso.adb356 Set_Node : Count_Type; variable
359 Set_Node := Of_Set.First;
361 if Set_Node = 0 then
370 Of_Set.Nodes (Set_Node))
375 if Is_Less (Of_Set.Nodes (Set_Node),
378 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
380 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gnat_util/gcc-6-20180516/gcc/ada/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ada/libgnat/
H A Da-rbtgso.adb393 Set_Node : Node_Access; variable
397 Set_Node := Of_Set.First;
399 if Set_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
412 Set_Node := Tree_Operations.Next (Set_Node);
414 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc48/gcc-4.8.5/gcc/ada/
H A Da-btgbso.adb290 Set_Node : Count_Type; variable
302 Set_Node := Of_Set.First;
304 if Set_Node = 0 then
312 if Is_Less (Subset.Nodes (Subset_Node), Of_Set.Nodes (Set_Node)) then
316 if Is_Less (Of_Set.Nodes (Set_Node), Subset.Nodes (Subset_Node)) then
317 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
319 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
H A Da-rbtgso.adb329 Set_Node : Node_Access := Of_Set.First; variable
333 if Set_Node = null then
341 if Is_Less (Subset_Node, Set_Node) then
345 if Is_Less (Set_Node, Subset_Node) then
346 Set_Node := Tree_Operations.Next (Set_Node);
348 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ada/libgnat/
H A Da-rbtgso.adb393 Set_Node : Node_Access; variable
397 Set_Node := Of_Set.First;
399 if Set_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
412 Set_Node := Tree_Operations.Next (Set_Node);
414 Set_Node := Tree_Operations.Next (Set_Node);
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ada/
H A Da-btgbso.adb290 Set_Node : Count_Type; variable
302 Set_Node := Of_Set.First;
304 if Set_Node = 0 then
312 if Is_Less (Subset.Nodes (Subset_Node), Of_Set.Nodes (Set_Node)) then
316 if Is_Less (Of_Set.Nodes (Set_Node), Subset.Nodes (Subset_Node)) then
317 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
319 Set_Node := Tree_Operations.Next (Of_Set, Set_Node);
H A Da-rbtgso.adb329 Set_Node : Node_Access := Of_Set.First; variable
333 if Set_Node = null then
341 if Is_Less (Subset_Node, Set_Node) then
345 if Is_Less (Set_Node, Subset_Node) then
346 Set_Node := Tree_Operations.Next (Set_Node);
348 Set_Node := Tree_Operations.Next (Set_Node);
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ada/libgnat/
H A Da-rbtgso.adb393 Set_Node : Node_Access; variable
397 Set_Node := Of_Set.First;
399 if Set_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
412 Set_Node := Tree_Operations.Next (Set_Node);
414 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc10/gcc-10.3.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc8/gcc-8.5.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc11/gcc-11.2.0/gcc/ada/libgnat/
H A Da-rbtgso.adb393 Set_Node : Node_Access; variable
397 Set_Node := Of_Set.First;
399 if Set_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
412 Set_Node := Tree_Operations.Next (Set_Node);
414 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc9/gcc-9.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc9-aux/bootstrap/lib/gcc/x86_64-aux-dragonfly5.5/9.1.0/adainclude/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ada/libgnat/
H A Da-rbtgso.adb395 Set_Node : Node_Access; variable
399 Set_Node := Of_Set.First;
401 if Set_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
414 Set_Node := Tree_Operations.Next (Set_Node);
416 Set_Node := Tree_Operations.Next (Set_Node);

123