Searched refs:Null_Node (Results 1 – 25 of 50) sorted by path
12
56 while N /= Null_Node loop112 if N /= Null_Node then119 if N = Null_Node then134 while El /= Null_Node loop192 if Contents /= Null_Node then
117 Free_Nodes : Node := Null_Node;372 pragma Assert (N /= Null_Node);380 pragma Assert (N /= Null_Node);388 pragma Assert (N /= Null_Node);396 pragma Assert (N /= Null_Node);404 pragma Assert (N /= Null_Node);412 pragma Assert (N /= Null_Node);420 pragma Assert (N /= Null_Node);428 pragma Assert (N /= Null_Node);436 pragma Assert (N /= Null_Node);[all …]
119 Free_Nodes : Node := Null_Node;161 pragma Assert (N /= Null_Node, "get_kind: null node");294 if Free_Nodes /= Null_Node then
60 Null_Node : constant Node := 0; constant
20 Constr := (Null_Node, Null_Node);25 if Constr.First = Null_Node then
63 Set_CDR (Last, Null_Node);149 return Null_Node;617 Res := Null_Node;
331 if Top = Null_Node then
184 if Expr /= Null_Node then205 if Expr /= Null_Node then399 if Seq = Null_Node then443 while Formal /= Null_Node loop444 if Actual = Null_Node then456 if Actual /= Null_Node then468 while Formal /= Null_Node loop469 Set_Actual (Formal, Null_Node);530 if Actual = Null_Node then761 if Expr = Null_Node then[all …]
32 Hash_Table : Hash_Table_Type := (others => Null_Node);59 while N /= Null_Node loop69 while N /= Null_Node loop119 while H /= Null_Node loop163 while H /= Null_Node loop202 while H /= Null_Node loop
128 if N = Null_Node then152 while El /= Null_Node loop163 if Depth <= 1 or else N = Null_Node then
25 if L = Null_Node then
42 Cells.Table (I) := (Res => Null_Node, Next => No_Index);54 if Res = Null_Node then
116 Free_Nodes : Node := Null_Node;279 if Free_Nodes /= Null_Node then492 pragma Assert (N /= Null_Node);500 pragma Assert (N /= Null_Node);508 pragma Assert (N /= Null_Node);516 pragma Assert (N /= Null_Node);524 pragma Assert (N /= Null_Node);532 pragma Assert (N /= Null_Node);540 pragma Assert (N /= Null_Node);548 pragma Assert (N /= Null_Node);[all …]
32 -- Null_Node.118 Free_Nodes : Node := Null_Node;281 if Free_Nodes /= Null_Node then
452 Null_Node : constant Node := 0; constant
137 if N = Null_Node then196 if B = Null_Node then201 if B = Null_Node then220 if S /= Null_Node then456 while Item /= Null_Node loop
31 Term_Assoc := (others => Null_Node);304 Res : Node := Null_Node;319 if Res = Null_Node then
34 Term_Assoc : Term_Assoc_Type := (others => Null_Node);
164 if Lo = Null_Node then170 if Hi = Null_Node then183 if Lo = Null_Node then198 if Lo = Null_Node then252 while Assoc /= Null_Node loop276 if S = Null_Node then285 if S = Null_Node then362 (Rewrite_Goto_Repeat_Seq (B, Null_Node, Null_Node));404 if Num = Null_Node then416 if Num = Null_Node then[all …]
100 while Item /= Null_Node loop137 if N2 /= Null_Node then
42 if B = Null_Node then47 if B = Null_Node then98 if S /= Null_Node then257 while Item /= Null_Node loop
58 Source_Scope => Null_Node,
1164 if Current_Loc /= Null_Node then1239 Exec_Statement := Null_Node;
484 return Null_Node;494 return Null_Node;513 if Atype = Null_Node then533 if Deferred_Decl = Null_Node544 if Deferred_Decl = Null_Node then557 if Decl_Type = Null_Node then688 while Inter /= Null_Node loop838 if Bod /= Null_Node then849 if Uninst_Bod /= Null_Node then964 if Atype /= Null_Node then[all …]
493 while Port /= Null_Node loop501 while Port /= Null_Node loop