#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */
struct string {
  int dummy;
};
struct list_item {
  int dummy;
};
struct graph_node {
  int dummy;
};
struct dict {
  int dummy;
};

/* Variables and functions */
int /*<<< orphan*/ graph_node_get_dependencies(struct graph_node *);
struct string *graph_node_get_name(struct graph_node *);
int /*<<< orphan*/ graph_node_get_repeated_dependencies(struct graph_node *);
scalar_t__ graph_node_is_newer(struct graph_node *, struct graph_node *);
struct graph_node *list_get_data(struct list_item *);
struct list_item *list_head(int /*<<< orphan*/);
struct list_item *list_next(struct list_item *);
int /*<<< orphan*/ set(struct dict *, char *, char *);
int /*<<< orphan*/ sets(struct dict *, char *, struct string *);
int /*<<< orphan*/ string_append(struct string *, struct string const *);
int /*<<< orphan*/ string_append_char(struct string *, char);
int /*<<< orphan*/ string_clear(struct string *);
int /*<<< orphan*/ string_destroy(struct string *);
scalar_t__ string_get_size(struct string *);
struct string *string_init(char *);
void populate_automatic_macros(struct graph_node *node, struct dict *macros) {
  struct list_item *item;
  struct string *all;
  struct string *newer;
  sets(macros, "@", graph_node_get_name(node));
  item = list_head(graph_node_get_dependencies(node));
  if (item == NULL) {
    set(macros, "<", "");
  } else {
    struct graph_node *dependency = list_get_data(item);
    sets(macros, "<", graph_node_get_name(dependency));
  }
  all = string_init("");
  newer = string_init("");
  item = list_head(graph_node_get_dependencies(node));
  while (item != NULL) {
    struct graph_node *dependency = list_get_data(item);
    const struct string *dependency_name;
    dependency_name = graph_node_get_name(dependency);
    if (string_get_size(all) != 0) {
      string_append_char(all, ' ');
    }
    string_append(all, dependency_name);
    if (graph_node_is_newer(dependency, node)) {
      if (string_get_size(newer) != 0) {
        string_append_char(newer, ' ');
      }
      string_append(newer, dependency_name);
    }
    item = list_next(item);
  }
  sets(macros, "^", all);
  sets(macros, "?", newer);
  string_destroy(newer);
  string_clear(all);
  item = list_head(graph_node_get_repeated_dependencies(node));
  while (item != NULL) {
    struct graph_node *dependency = list_get_data(item);
    const struct string *dependency_name;
    dependency_name = graph_node_get_name(dependency);
    if (string_get_size(all) != 0) {
      string_append_char(all, ' ');
    }
    string_append(all, dependency_name);
    item = list_next(item);
  }
  sets(macros, "+", all);
  string_destroy(all);
}


x86 assembly (clang, -O0):
<populate_automatic_macros>:
push   %rbp
mov    %rsp,%rbp
sub    $0x60,%rsp
mov    %rdi,-0x8(%rbp)
mov    %rsi,-0x10(%rbp)
mov    -0x10(%rbp),%rax
mov    %rax,-0x58(%rbp)
mov    -0x8(%rbp),%rdi
call   10e0 <graph_node_get_name@plt>
mov    -0x58(%rbp),%rdi
mov    %rax,%rdx
lea    0xde1(%rip),%rsi
call   1060 <sets@plt>
mov    -0x8(%rbp),%rdi
call   1030 <graph_node_get_dependencies@plt>
mov    %eax,%edi
call   10f0 <list_head@plt>
mov    %rax,-0x18(%rbp)
cmpq   $0x0,-0x18(%rbp)
jne    125f <populate_automatic_macros+0x6f>
mov    -0x10(%rbp),%rdi
lea    0xdb4(%rip),%rsi
lea    0xdb4(%rip),%rdx
call   1100 <set@plt>
jmp    1290 <populate_automatic_macros+0xa0>
mov    -0x18(%rbp),%rdi
call   1080 <list_get_data@plt>
mov    %rax,-0x30(%rbp)
mov    -0x10(%rbp),%rax
mov    %rax,-0x60(%rbp)
mov    -0x30(%rbp),%rdi
call   10e0 <graph_node_get_name@plt>
mov    -0x60(%rbp),%rdi
mov    %rax,%rdx
lea    0xd77(%rip),%rsi
call   1060 <sets@plt>
lea    0xd72(%rip),%rdi
call   1040 <string_init@plt>
mov    %rax,-0x20(%rbp)
lea    0xd62(%rip),%rdi
call   1040 <string_init@plt>
mov    %rax,-0x28(%rbp)
mov    -0x8(%rbp),%rdi
call   1030 <graph_node_get_dependencies@plt>
mov    %eax,%edi
call   10f0 <list_head@plt>
mov    %rax,-0x18(%rbp)
cmpq   $0x0,-0x18(%rbp)
je     136e <populate_automatic_macros+0x17e>
mov    -0x18(%rbp),%rdi
call   1080 <list_get_data@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rdi
call   10e0 <graph_node_get_name@plt>
mov    %rax,-0x40(%rbp)
mov    -0x20(%rbp),%rdi
call   10c0 <string_get_size@plt>
cmp    $0x0,%rax
je     130a <populate_automatic_macros+0x11a>
mov    -0x20(%rbp),%rdi
mov    $0x20,%esi
call   1050 <string_append_char@plt>
mov    -0x20(%rbp),%rdi
mov    -0x40(%rbp),%rsi
call   10b0 <string_append@plt>
mov    -0x38(%rbp),%rdi
mov    -0x8(%rbp),%rsi
call   10d0 <graph_node_is_newer@plt>
cmp    $0x0,%rax
je     135c <populate_automatic_macros+0x16c>
mov    -0x28(%rbp),%rdi
call   10c0 <string_get_size@plt>
cmp    $0x0,%rax
je     134f <populate_automatic_macros+0x15f>
mov    -0x28(%rbp),%rdi
mov    $0x20,%esi
call   1050 <string_append_char@plt>
mov    -0x28(%rbp),%rdi
mov    -0x40(%rbp),%rsi
call   10b0 <string_append@plt>
mov    -0x18(%rbp),%rdi
call   1090 <list_next@plt>
mov    %rax,-0x18(%rbp)
jmp    12c4 <populate_automatic_macros+0xd4>
mov    -0x10(%rbp),%rdi
mov    -0x20(%rbp),%rdx
lea    0xc87(%rip),%rsi
call   1060 <sets@plt>
mov    -0x10(%rbp),%rdi
mov    -0x28(%rbp),%rdx
lea    0xc75(%rip),%rsi
call   1060 <sets@plt>
mov    -0x28(%rbp),%rdi
call   1070 <string_destroy@plt>
mov    -0x20(%rbp),%rdi
call   1110 <string_clear@plt>
mov    -0x8(%rbp),%rdi
call   10a0 <graph_node_get_repeated_dependencies@plt>
mov    %eax,%edi
call   10f0 <list_head@plt>
mov    %rax,-0x18(%rbp)
cmpq   $0x0,-0x18(%rbp)
je     1421 <populate_automatic_macros+0x231>
mov    -0x18(%rbp),%rdi
call   1080 <list_get_data@plt>
mov    %rax,-0x48(%rbp)
mov    -0x48(%rbp),%rdi
call   10e0 <graph_node_get_name@plt>
mov    %rax,-0x50(%rbp)
mov    -0x20(%rbp),%rdi
call   10c0 <string_get_size@plt>
cmp    $0x0,%rax
je     1402 <populate_automatic_macros+0x212>
mov    -0x20(%rbp),%rdi
mov    $0x20,%esi
call   1050 <string_append_char@plt>
mov    -0x20(%rbp),%rdi
mov    -0x50(%rbp),%rsi
call   10b0 <string_append@plt>
mov    -0x18(%rbp),%rdi
call   1090 <list_next@plt>
mov    %rax,-0x18(%rbp)
jmp    13bc <populate_automatic_macros+0x1cc>
mov    -0x10(%rbp),%rdi
mov    -0x20(%rbp),%rdx
lea    0xbd8(%rip),%rsi
call   1060 <sets@plt>
mov    -0x20(%rbp),%rdi
call   1070 <string_destroy@plt>
add    $0x60,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<populate_automatic_macros>:
push   %rbp
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
push   %rax
mov    %rsi,%rbx
mov    %rdi,%r15
call   10e0 <graph_node_get_name@plt>
lea    0xdf3(%rip),%rsi
mov    %rbx,%rdi
mov    %rax,%rdx
call   1060 <sets@plt>
mov    %r15,%rdi
call   1030 <graph_node_get_dependencies@plt>
mov    %eax,%edi
call   10f0 <list_head@plt>
test   %rax,%rax
mov    %rbx,(%rsp)
je     1254 <populate_automatic_macros+0x64>
mov    %rax,%rdi
call   1080 <list_get_data@plt>
mov    %rax,%rdi
call   10e0 <graph_node_get_name@plt>
lea    0xdbb(%rip),%rsi
mov    %rbx,%rdi
mov    %rax,%rdx
call   1060 <sets@plt>
jmp    126a <populate_automatic_macros+0x7a>
lea    0xda7(%rip),%rsi
lea    0xda7(%rip),%rdx
mov    %rbx,%rdi
call   1100 <set@plt>
lea    0xd98(%rip),%rbx
mov    %rbx,%rdi
call   1040 <string_init@plt>
mov    %rax,%r13
mov    %rbx,%rdi
call   1040 <string_init@plt>
mov    %rax,%r12
mov    %r15,%rdi
call   1030 <graph_node_get_dependencies@plt>
mov    %eax,%edi
call   10f0 <list_head@plt>
test   %rax,%rax
je     1335 <populate_automatic_macros+0x145>
mov    %rax,%rbx
jmp    12cb <populate_automatic_macros+0xdb>
cs nopw 0x0(%rax,%rax,1)
xchg   %ax,%ax
mov    %r12,%rdi
mov    %rbp,%rsi
call   10b0 <string_append@plt>
mov    %rbx,%rdi
call   1090 <list_next@plt>
mov    %rax,%rbx
test   %rax,%rax
je     1335 <populate_automatic_macros+0x145>
mov    %rbx,%rdi
call   1080 <list_get_data@plt>
mov    %rax,%r14
mov    %rax,%rdi
call   10e0 <graph_node_get_name@plt>
mov    %rax,%rbp
mov    %r13,%rdi
call   10c0 <string_get_size@plt>
test   %rax,%rax
je     12fb <populate_automatic_macros+0x10b>
mov    %r13,%rdi
mov    $0x20,%esi
call   1050 <string_append_char@plt>
mov    %r13,%rdi
mov    %rbp,%rsi
call   10b0 <string_append@plt>
mov    %r14,%rdi
mov    %r15,%rsi
call   10d0 <graph_node_is_newer@plt>
test   %rax,%rax
je     12bb <populate_automatic_macros+0xcb>
mov    %r12,%rdi
call   10c0 <string_get_size@plt>
test   %rax,%rax
je     12b0 <populate_automatic_macros+0xc0>
mov    %r12,%rdi
mov    $0x20,%esi
call   1050 <string_append_char@plt>
jmp    12b0 <populate_automatic_macros+0xc0>
lea    0xcc8(%rip),%rsi
mov    (%rsp),%rbx
mov    %rbx,%rdi
mov    %r13,%rdx
call   1060 <sets@plt>
lea    0xcb4(%rip),%rsi
mov    %rbx,%rdi
mov    %r12,%rdx
call   1060 <sets@plt>
mov    %r12,%rdi
call   1070 <string_destroy@plt>
mov    %r13,%rdi
call   1110 <string_clear@plt>
mov    %r15,%rdi
call   10a0 <graph_node_get_repeated_dependencies@plt>
mov    %eax,%edi
call   10f0 <list_head@plt>
test   %rax,%rax
je     13da <populate_automatic_macros+0x1ea>
mov    %rax,%rbx
jmp    13ab <populate_automatic_macros+0x1bb>
cs nopw 0x0(%rax,%rax,1)
mov    %r13,%rdi
mov    %rbp,%rsi
call   10b0 <string_append@plt>
mov    %rbx,%rdi
call   1090 <list_next@plt>
mov    %rax,%rbx
test   %rax,%rax
je     13da <populate_automatic_macros+0x1ea>
mov    %rbx,%rdi
call   1080 <list_get_data@plt>
mov    %rax,%rdi
call   10e0 <graph_node_get_name@plt>
mov    %rax,%rbp
mov    %r13,%rdi
call   10c0 <string_get_size@plt>
test   %rax,%rax
je     1390 <populate_automatic_macros+0x1a0>
mov    %r13,%rdi
mov    $0x20,%esi
call   1050 <string_append_char@plt>
jmp    1390 <populate_automatic_macros+0x1a0>
lea    0xc27(%rip),%rsi
mov    (%rsp),%rdi
mov    %r13,%rdx
call   1060 <sets@plt>
mov    %r13,%rdi
add    $0x8,%rsp
pop    %rbx
pop    %r12
pop    %r13
pop    %r14
pop    %r15
pop    %rbp
jmp    1070 <string_destroy@plt>

LLVM IR (-O0):
%struct.graph_node = type { i32 }
%struct.dict = type { i32 }
%struct.list_item = type { i32 }
%struct.string = type { i32 }
@.str = [2 x i8] c"@\00"
@.str.1 = [2 x i8] c"<\00"
@.str.2 = [1 x i8] zeroinitializer
@.str.3 = [2 x i8] c"^\00"
@.str.4 = [2 x i8] c"?\00"
@.str.5 = [2 x i8] c"+\00"
define void @populate_automatic_macros(%struct.graph_node* %0, %struct.dict* %1) {
%3 = alloca %struct.graph_node*
%4 = alloca %struct.dict*
%5 = alloca %struct.list_item*
%6 = alloca %struct.string*
%7 = alloca %struct.string*
%8 = alloca %struct.graph_node*
%9 = alloca %struct.graph_node*
%10 = alloca %struct.string*
%11 = alloca %struct.graph_node*
%12 = alloca %struct.string*
store %struct.graph_node* %0, %struct.graph_node** %3
store %struct.dict* %1, %struct.dict** %4
%13 = load %struct.dict*, %struct.dict** %4
%14 = load %struct.graph_node*, %struct.graph_node** %3
%15 = call %struct.string* @graph_node_get_name(%struct.graph_node* %14)
%16 = call i32 @sets(%struct.dict* %13, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0), %struct.string* %15)
%17 = load %struct.graph_node*, %struct.graph_node** %3
%18 = call i32 @graph_node_get_dependencies(%struct.graph_node* %17)
%19 = call %struct.list_item* @list_head(i32 %18)
store %struct.list_item* %19, %struct.list_item** %5
%20 = load %struct.list_item*, %struct.list_item** %5
%21 = icmp eq %struct.list_item* %20, null
br i1 %21, label %22, label %25
22: ; preds = %2
%23 = load %struct.dict*, %struct.dict** %4
%24 = call i32 @set(%struct.dict* %23, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0), i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.2, i64 0, i64 0))
br label %32
25: ; preds = %2
%26 = load %struct.list_item*, %struct.list_item** %5
%27 = call %struct.graph_node* @list_get_data(%struct.list_item* %26)
store %struct.graph_node* %27, %struct.graph_node** %8
%28 = load %struct.dict*, %struct.dict** %4
%29 = load %struct.graph_node*, %struct.graph_node** %8
%30 = call %struct.string* @graph_node_get_name(%struct.graph_node* %29)
%31 = call i32 @sets(%struct.dict* %28, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0), %struct.string* %30)
br label %32
32: ; preds = %25, %22
%33 = call %struct.string* @string_init(i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.2, i64 0, i64 0))
store %struct.string* %33, %struct.string** %6
%34 = call %struct.string* @string_init(i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.2, i64 0, i64 0))
store %struct.string* %34, %struct.string** %7
%35 = load %struct.graph_node*, %struct.graph_node** %3
%36 = call i32 @graph_node_get_dependencies(%struct.graph_node* %35)
%37 = call %struct.list_item* @list_head(i32 %36)
store %struct.list_item* %37, %struct.list_item** %5
br label %38
38: ; preds = %71, %32
%39 = load %struct.list_item*, %struct.list_item** %5
%40 = icmp ne %struct.list_item* %39, null
br i1 %40, label %41, label %74
41: ; preds = %38
%42 = load %struct.list_item*, %struct.list_item** %5
%43 = call %struct.graph_node* @list_get_data(%struct.list_item* %42)
store %struct.graph_node* %43, %struct.graph_node** %9
%44 = load %struct.graph_node*, %struct.graph_node** %9
%45 = call %struct.string* @graph_node_get_name(%struct.graph_node* %44)
store %struct.string* %45, %struct.string** %10
%46 = load %struct.string*, %struct.string** %6
%47 = call i64 @string_get_size(%struct.string* %46)
%48 = icmp ne i64 %47, 0
br i1 %48, label %49, label %52
49: ; preds = %41
%50 = load %struct.string*, %struct.string** %6
%51 = call i32 @string_append_char(%struct.string* %50, i8 signext 32)
br label %52
52: ; preds = %49, %41
%53 = load %struct.string*, %struct.string** %6
%54 = load %struct.string*, %struct.string** %10
%55 = call i32 @string_append(%struct.string* %53, %struct.string* %54)
%56 = load %struct.graph_node*, %struct.graph_node** %9
%57 = load %struct.graph_node*, %struct.graph_node** %3
%58 = call i64 @graph_node_is_newer(%struct.graph_node* %56, %struct.graph_node* %57)
%59 = icmp ne i64 %58, 0
br i1 %59, label %60, label %71
60: ; preds = %52
%61 = load %struct.string*, %struct.string** %7
%62 = call i64 @string_get_size(%struct.string* %61)
%63 = icmp ne i64 %62, 0
br i1 %63, label %64, label %67
64: ; preds = %60
%65 = load %struct.string*, %struct.string** %7
%66 = call i32 @string_append_char(%struct.string* %65, i8 signext 32)
br label %67
67: ; preds = %64, %60
%68 = load %struct.string*, %struct.string** %7
%69 = load %struct.string*, %struct.string** %10
%70 = call i32 @string_append(%struct.string* %68, %struct.string* %69)
br label %71
71: ; preds = %67, %52
%72 = load %struct.list_item*, %struct.list_item** %5
%73 = call %struct.list_item* @list_next(%struct.list_item* %72)
store %struct.list_item* %73, %struct.list_item** %5
br label %38
74: ; preds = %38
%75 = load %struct.dict*, %struct.dict** %4
%76 = load %struct.string*, %struct.string** %6
%77 = call i32 @sets(%struct.dict* %75, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0), %struct.string* %76)
%78 = load %struct.dict*, %struct.dict** %4
%79 = load %struct.string*, %struct.string** %7
%80 = call i32 @sets(%struct.dict* %78, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.4, i64 0, i64 0), %struct.string* %79)
%81 = load %struct.string*, %struct.string** %7
%82 = call i32 @string_destroy(%struct.string* %81)
%83 = load %struct.string*, %struct.string** %6
%84 = call i32 @string_clear(%struct.string* %83)
%85 = load %struct.graph_node*, %struct.graph_node** %3
%86 = call i32 @graph_node_get_repeated_dependencies(%struct.graph_node* %85)
%87 = call %struct.list_item* @list_head(i32 %86)
store %struct.list_item* %87, %struct.list_item** %5
br label %88
88: ; preds = %102, %74
%89 = load %struct.list_item*, %struct.list_item** %5
%90 = icmp ne %struct.list_item* %89, null
br i1 %90, label %91, label %108
91: ; preds = %88
%92 = load %struct.list_item*, %struct.list_item** %5
%93 = call %struct.graph_node* @list_get_data(%struct.list_item* %92)
store %struct.graph_node* %93, %struct.graph_node** %11
%94 = load %struct.graph_node*, %struct.graph_node** %11
%95 = call %struct.string* @graph_node_get_name(%struct.graph_node* %94)
store %struct.string* %95, %struct.string** %12
%96 = load %struct.string*, %struct.string** %6
%97 = call i64 @string_get_size(%struct.string* %96)
%98 = icmp ne i64 %97, 0
br i1 %98, label %99, label %102
99: ; preds = %91
%100 = load %struct.string*, %struct.string** %6
%101 = call i32 @string_append_char(%struct.string* %100, i8 signext 32)
br label %102
102: ; preds = %99, %91
%103 = load %struct.string*, %struct.string** %6
%104 = load %struct.string*, %struct.string** %12
%105 = call i32 @string_append(%struct.string* %103, %struct.string* %104)
%106 = load %struct.list_item*, %struct.list_item** %5
%107 = call %struct.list_item* @list_next(%struct.list_item* %106)
store %struct.list_item* %107, %struct.list_item** %5
br label %88
108: ; preds = %88
%109 = load %struct.dict*, %struct.dict** %4
%110 = load %struct.string*, %struct.string** %6
%111 = call i32 @sets(%struct.dict* %109, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.5, i64 0, i64 0), %struct.string* %110)
%112 = load %struct.string*, %struct.string** %6
%113 = call i32 @string_destroy(%struct.string* %112)
ret void
}

LLVM IR (-O2):
%struct.graph_node = type { i32 }
%struct.dict = type { i32 }
%struct.string = type { i32 }
%struct.list_item = type { i32 }
@.str = [2 x i8] c"@\00"
@.str.1 = [2 x i8] c"<\00"
@.str.2 = [1 x i8] zeroinitializer
@.str.3 = [2 x i8] c"^\00"
@.str.4 = [2 x i8] c"?\00"
@.str.5 = [2 x i8] c"+\00"
define void @populate_automatic_macros(%struct.graph_node* %0, %struct.dict* %1) {
%3 = tail call %struct.string* @graph_node_get_name(%struct.graph_node* %0)
%4 = tail call i32 @sets(%struct.dict* %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0), %struct.string* %3)
%5 = tail call i32 @graph_node_get_dependencies(%struct.graph_node* %0)
%6 = tail call %struct.list_item* @list_head(i32 %5)
%7 = icmp eq %struct.list_item* %6, null
br i1 %7, label %8, label %10
8: ; preds = %2
%9 = tail call i32 @set(%struct.dict* %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0), i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.2, i64 0, i64 0))
br label %14
10: ; preds = %2
%11 = tail call %struct.graph_node* @list_get_data(%struct.list_item* %6)
%12 = tail call %struct.string* @graph_node_get_name(%struct.graph_node* %11)
%13 = tail call i32 @sets(%struct.dict* %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0), %struct.string* %12)
br label %14
14: ; preds = %10, %8
%15 = tail call %struct.string* @string_init(i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.2, i64 0, i64 0))
%16 = tail call %struct.string* @string_init(i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str.2, i64 0, i64 0))
%17 = tail call i32 @graph_node_get_dependencies(%struct.graph_node* %0)
%18 = tail call %struct.list_item* @list_head(i32 %17)
%19 = icmp eq %struct.list_item* %18, null
br i1 %19, label %42, label %20
20: ; preds = %14, %39
%21 = phi %struct.list_item* [ %40, %39 ], [ %18, %14 ]
%22 = tail call %struct.graph_node* @list_get_data(%struct.list_item* %21)
%23 = tail call %struct.string* @graph_node_get_name(%struct.graph_node* %22)
%24 = tail call i64 @string_get_size(%struct.string* %15)
%25 = icmp eq i64 %24, 0
br i1 %25, label %28, label %26
26: ; preds = %20
%27 = tail call i32 @string_append_char(%struct.string* %15, i8 signext 32)
br label %28
28: ; preds = %26, %20
%29 = tail call i32 @string_append(%struct.string* %15, %struct.string* %23)
%30 = tail call i64 @graph_node_is_newer(%struct.graph_node* %22, %struct.graph_node* %0)
%31 = icmp eq i64 %30, 0
br i1 %31, label %39, label %32
32: ; preds = %28
%33 = tail call i64 @string_get_size(%struct.string* %16)
%34 = icmp eq i64 %33, 0
br i1 %34, label %37, label %35
35: ; preds = %32
%36 = tail call i32 @string_append_char(%struct.string* %16, i8 signext 32)
br label %37
37: ; preds = %35, %32
%38 = tail call i32 @string_append(%struct.string* %16, %struct.string* %23)
br label %39
39: ; preds = %37, %28
%40 = tail call %struct.list_item* @list_next(%struct.list_item* %21)
%41 = icmp eq %struct.list_item* %40, null
br i1 %41, label %42, label %20
42: ; preds = %39, %14
%43 = tail call i32 @sets(%struct.dict* %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0), %struct.string* %15)
%44 = tail call i32 @sets(%struct.dict* %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.4, i64 0, i64 0), %struct.string* %16)
%45 = tail call i32 @string_destroy(%struct.string* %16)
%46 = tail call i32 @string_clear(%struct.string* %15)
%47 = tail call i32 @graph_node_get_repeated_dependencies(%struct.graph_node* %0)
%48 = tail call %struct.list_item* @list_head(i32 %47)
%49 = icmp eq %struct.list_item* %48, null
br i1 %49, label %62, label %50
50: ; preds = %42, %58
%51 = phi %struct.list_item* [ %60, %58 ], [ %48, %42 ]
%52 = tail call %struct.graph_node* @list_get_data(%struct.list_item* %51)
%53 = tail call %struct.string* @graph_node_get_name(%struct.graph_node* %52)
%54 = tail call i64 @string_get_size(%struct.string* %15)
%55 = icmp eq i64 %54, 0
br i1 %55, label %58, label %56
56: ; preds = %50
%57 = tail call i32 @string_append_char(%struct.string* %15, i8 signext 32)
br label %58
58: ; preds = %56, %50
%59 = tail call i32 @string_append(%struct.string* %15, %struct.string* %53)
%60 = tail call %struct.list_item* @list_next(%struct.list_item* %51)
%61 = icmp eq %struct.list_item* %60, null
br i1 %61, label %62, label %50
62: ; preds = %58, %42
%63 = tail call i32 @sets(%struct.dict* %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.5, i64 0, i64 0), %struct.string* %15)
%64 = tail call i32 @string_destroy(%struct.string* %15)
ret void
}