Home
last modified time | relevance | path

Searched refs:Subset_Node (Results 1 – 25 of 150) sorted by relevance

123456

/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
H A Da-btgbso.adb355 Subset_Node : Count_Type; variable
358 Subset_Node := Subset.First;
362 return Subset_Node = 0;
365 if Subset_Node = 0 then
369 if Is_Less (Subset.Nodes (Subset_Node),
376 Subset.Nodes (Subset_Node))
381 Subset_Node := Tree_Operations.Next (Subset, Subset_Node);
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ada/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
H A Da-btgbso.adb355 Subset_Node : Count_Type; variable
358 Subset_Node := Subset.First;
362 return Subset_Node = 0;
365 if Subset_Node = 0 then
369 if Is_Less (Subset.Nodes (Subset_Node),
376 Subset.Nodes (Subset_Node))
381 Subset_Node := Tree_Operations.Next (Subset, Subset_Node);
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
H A Da-btgbso.adb355 Subset_Node : Count_Type; variable
358 Subset_Node := Subset.First;
362 return Subset_Node = 0;
365 if Subset_Node = 0 then
369 if Is_Less (Subset.Nodes (Subset_Node),
376 Subset.Nodes (Subset_Node))
381 Subset_Node := Tree_Operations.Next (Subset, Subset_Node);
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gnat_util/gcc-6-20180516/gcc/ada/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ada/libgnat/
H A Da-rbtgso.adb392 Subset_Node : Node_Access; variable
396 Subset_Node := Subset.First;
400 return Subset_Node = null;
403 if Subset_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
415 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc48/gcc-4.8.5/gcc/ada/
H A Da-btgbso.adb289 Subset_Node : Count_Type; variable
301 Subset_Node := Subset.First;
305 return Subset_Node = 0;
308 if Subset_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
320 Subset_Node := Tree_Operations.Next (Subset, Subset_Node);
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ada/libgnat/
H A Da-rbtgso.adb392 Subset_Node : Node_Access; variable
396 Subset_Node := Subset.First;
400 return Subset_Node = null;
403 if Subset_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
415 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ada/
H A Da-btgbso.adb289 Subset_Node : Count_Type; variable
301 Subset_Node := Subset.First;
305 return Subset_Node = 0;
308 if Subset_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
320 Subset_Node := Tree_Operations.Next (Subset, Subset_Node);
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ada/libgnat/
H A Da-rbtgso.adb392 Subset_Node : Node_Access; variable
396 Subset_Node := Subset.First;
400 return Subset_Node = null;
403 if Subset_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
415 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc10/gcc-10.3.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc8/gcc-8.5.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc11/gcc-11.2.0/gcc/ada/libgnat/
H A Da-rbtgso.adb392 Subset_Node : Node_Access; variable
396 Subset_Node := Subset.First;
400 return Subset_Node = null;
403 if Subset_Node = null then
407 if Is_Less (Subset_Node, Set_Node) then
411 if Is_Less (Set_Node, Subset_Node) then
415 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc9/gcc-9.4.0/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
H A Da-btgbso.adb355 Subset_Node : Count_Type; variable
358 Subset_Node := Subset.First;
362 return Subset_Node = 0;
365 if Subset_Node = 0 then
369 if Is_Less (Subset.Nodes (Subset_Node),
376 Subset.Nodes (Subset_Node))
381 Subset_Node := Tree_Operations.Next (Subset, Subset_Node);
/dports/lang/gcc9-aux/bootstrap/lib/gcc/x86_64-aux-dragonfly5.5/9.1.0/adainclude/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ada/libgnat/
H A Da-rbtgso.adb394 Subset_Node : Node_Access; variable
398 Subset_Node := Subset.First;
402 return Subset_Node = null;
405 if Subset_Node = null then
409 if Is_Less (Subset_Node, Set_Node) then
413 if Is_Less (Set_Node, Subset_Node) then
417 Subset_Node := Tree_Operations.Next (Subset_Node);

123456