mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-28 12:50:10 +01:00
Jon Ross-Perkins
129f31710d
Just replacing AUTOUPDATE with NOAUTOUPDATE, and removing the autoupdate script. Tests will still run, but autoupdate may need to be fixed if significant changes are made. I noticed this while trying to autoupdate for #4007 (because we verify that tests have been autoupdated). Autoupdate was likely broken by #3449. Trying to run with no changes gives: ``` CHECK failure at testing/file_test/file_test_base.cpp:801: !absl::GetFlag(FLAGS_test_targets_file).empty(): Missing --test_targets_file. ``` This is because the `file_test` rule creates a file with test inputs that it runs with, which the prebuilt binary doesn't provide. A local kludge to create a `file_test` target not using prebuilt_binary showed another error: ``` : CommandLine Error: Option ': CommandLine Error: Option 'parser_debug' registered more than once! LLVM ERROR: inconsistency in registered CommandLine options trace_phase' registered more than once! LLVM ERROR: inconsistency in registered CommandLine options ``` I'm thinking here that the explorer code hasn't been in enough use, and we're seeing some rot as a consequence. Rather than trying to maintain it, I'm suggesting to go with NOAUTOUPDATE.
94 lines
2.2 KiB
Plaintext
94 lines
2.2 KiB
Plaintext
// Part of the Carbon Language project, under the Apache License v2.0 with LLVM
|
|
// Exceptions. See /LICENSE for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
// NOAUTOUPDATE
|
|
|
|
package ExplorerTest api;
|
|
|
|
class ListElement{
|
|
fn Create(value: i32)->ListElement{
|
|
return {
|
|
.element = Optional(i32).Create(value),
|
|
.next = Optional(ListElement*).CreateEmpty()
|
|
};
|
|
}
|
|
|
|
fn set[addr self: Self*] (value: Optional(ListElement*)){
|
|
(*self).next = value;
|
|
}
|
|
|
|
var element: Optional(i32);
|
|
var next: Optional(ListElement*);
|
|
}
|
|
|
|
class List{
|
|
fn Create() -> List{
|
|
return {.next = Optional(ListElement*).CreateEmpty() };
|
|
}
|
|
fn insert[addr self: Self*] (value: i32){
|
|
if( not (*self).next.HasValue() ){
|
|
(*self).next = Optional(ListElement*).Create( heap.New(ListElement.Create(value)) );
|
|
return;
|
|
}
|
|
var iter: Optional(ListElement*) = (*self).next;
|
|
var node: auto = (iter.Get());
|
|
while((*node).next.HasValue()){
|
|
iter = (*node).next;
|
|
node = (iter.Get());
|
|
}
|
|
var v : ListElement* = iter.Get();
|
|
var x: Optional(ListElement*) = Optional(ListElement*).Create( heap.New(ListElement.Create(value) ));
|
|
(*v).set(x);
|
|
}
|
|
|
|
fn print[self: Self] (){
|
|
var iter: Optional(ListElement*) = self.next;
|
|
while(iter.HasValue()){
|
|
var node: auto = *(iter.Get());
|
|
Print("{0}",node.element.Get());
|
|
var node_ptr: auto = iter.Get();
|
|
iter = node.next;
|
|
}
|
|
}
|
|
|
|
fn clean[addr self: Self*] (){
|
|
var head: auto = (*self).next;
|
|
while(head.HasValue()){
|
|
var tmp: auto = head;
|
|
head = (*head.Get()).next;
|
|
heap.Delete(tmp.Get());
|
|
}
|
|
(*self).next= Optional(ListElement*).CreateEmpty();
|
|
}
|
|
|
|
var next: Optional(ListElement*);
|
|
}
|
|
|
|
fn Main() -> i32{
|
|
var list: List = List.Create();
|
|
list.insert(1);
|
|
list.insert(2);
|
|
list.insert(3);
|
|
list.insert(4);
|
|
list.print();
|
|
list.clean();
|
|
list.print();
|
|
list.insert(1);
|
|
list.insert(2);
|
|
list.insert(3);
|
|
list.insert(4);
|
|
list.print();
|
|
return 0;
|
|
}
|
|
|
|
// CHECK:STDOUT: 1
|
|
// CHECK:STDOUT: 2
|
|
// CHECK:STDOUT: 3
|
|
// CHECK:STDOUT: 4
|
|
// CHECK:STDOUT: 1
|
|
// CHECK:STDOUT: 2
|
|
// CHECK:STDOUT: 3
|
|
// CHECK:STDOUT: 4
|
|
// CHECK:STDOUT: result: 0
|