File: ELF_relax_call_boundary.s

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (78 lines) | stat: -rw-r--r-- 2,520 bytes parent folder | download | duplicates (7)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
## Test R_RISCV_CALL relaxation for some boundary situations that need multiple
## iterations before symbols fit in a c.j immediate.

# RUN: llvm-mc -filetype=obj -triple=riscv32 -mattr=+relax,+c %s -o %t.rv32
# RUN: llvm-jitlink -noexec \
# RUN:     -slab-allocate 100Kb -slab-address 0x1000 -slab-page-size 4096 \
# RUN:     -check %s %t.rv32

# RUN: llvm-mc -filetype=obj -triple=riscv64 -mattr=+relax,+c %s -o %t.rv64
# RUN: llvm-jitlink -noexec \
# RUN:     -slab-allocate 100Kb -slab-address 0x1000 -slab-page-size 4096 \
# RUN:     -check %s %t.rv64

# RUN: llvm-mc -filetype=obj -triple=riscv32 -mattr=+relax,+zca %s -o %t.rv32zca
# RUN: llvm-jitlink -noexec \
# RUN:     -slab-allocate 100Kb -slab-address 0x1000 -slab-page-size 4096 \
# RUN:     -check %s %t.rv32zca

# RUN: llvm-mc -filetype=obj -triple=riscv64 -mattr=+relax,+zca %s -o %t.rv64zca
# RUN: llvm-jitlink -noexec \
# RUN:     -slab-allocate 100Kb -slab-address 0x1000 -slab-page-size 4096 \
# RUN:     -check %s %t.rv64zca

        .globl main
        .type main,@function
main:
## Relaxed to c.j. This needs 2 iterations: c.j only fits after first relaxing
## to jal
        tail f
        .space 2042
        .size main, .-main

        .globl f
        .type f,@function
f:
## Relaxed to c.j in the same way as above.
        tail main
        .size f, .-f

        .globl g
        .type g,@function
g:
## Relaxed to c.j. This needs 3 iterations: c.j only fits after first relaxing
## both itself and the call to g to jal, and then relaxing the call to g to c.j
        tail h
        tail g
        .space 2040
        .size g, .-g

        .globl h
        .type h,@function
h:
## Relaxed to c.j in the same way as above.
        tail g
        .size h, .-h

## main: c.j f
# jitlink-check: (*{2}(main))[1:0] = 0x1
# jitlink-check: (*{2}(main))[15:13] = 0x5
# jitlink-check: decode_operand(main, 0)[11:0] = (f - main)[11:0]

## f: c.j main
# jitlink-check: (*{2}(f))[1:0] = 0x1
# jitlink-check: (*{2}(f))[15:13] = 0x5
# jitlink-check: decode_operand(f, 0)[11:0] = (main - f)[11:0]

## g: c.j h; c.j g
# jitlink-check: (*{2}(g))[1:0] = 0x1
# jitlink-check: (*{2}(g))[15:13] = 0x5
# jitlink-check: decode_operand(g, 0)[11:0] = (h - g)[11:0]
# jitlink-check: (*{2}(g+2))[1:0] = 0x1
# jitlink-check: (*{2}(g+2))[15:13] = 0x5
# jitlink-check: decode_operand(g+2, 0)[11:0] = (g - (g + 2))[11:0]

## h: c.j g
# jitlink-check: (*{2}(h))[1:0] = 0x1
# jitlink-check: (*{2}(h))[15:13] = 0x5
# jitlink-check: decode_operand(h, 0)[11:0] = (g - h)[11:0]