File: 2002-10-08-LargeArrayPerformance.ll

package info (click to toggle)
llvm-toolchain-6.0 1%3A6.0.1-10
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 598,080 kB
  • sloc: cpp: 3,046,253; ansic: 595,057; asm: 271,965; python: 128,926; objc: 106,554; sh: 21,906; lisp: 10,191; pascal: 6,094; ml: 5,544; perl: 5,265; makefile: 2,227; cs: 2,027; xml: 686; php: 212; csh: 117
file content (9 lines) | stat: -rw-r--r-- 295 bytes parent folder | download | duplicates (21) 
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		; <[30000 x i32]*> [#uses=0]

declare void @__main()