File: 2002-10-08-LargeArrayPerformance.ll

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (9 lines) | stat: -rw-r--r-- 284 bytes parent folder | download | duplicates (12) 
1
2
3
4
5
6
7
8
9
 
; RUN: llvm-as %s -o /dev/null
; RUN: verify-uselistorder %s
; This testcase comes from the following really simple c file:
;; int foo[30000]
;;; We should not be soo slow for such a simple case!

@foo = global [30000 x i32] zeroinitializer		; <ptr> [#uses=0]

declare void @__main()