File: 2002-10-08-LargeArrayPerformance.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (9 lines) | stat: -rw-r--r-- 295 bytes parent folder | download | duplicates (22) 
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()