Mercurial > projects > ldc
view tests/mini/funcptr.d @ 1275:bedf0bfb8fdb
Implement first D-specific optimization pass: -simplify-drtcalls.
It uses the machinery of the standard -simplify-libcalls pass, but optimizes
calls to the D runtime instead of calls to C libraries.
At the moment, these optimizations are implemented by this pass:
- Avoid the runtime call for `arr.length = newlen` if it can determine that
the new length isn't longer than the old one.
- Ditto for `cast(T[]) arr` if it will clearly always succeed.
(e.g. if the length of the original array is zero, or if the old element
size is a multiple of the new element size)
author | Frits van Bommel <fvbommel wxs.nl> |
---|---|
date | Tue, 28 Apr 2009 21:58:06 +0200 |
parents | 1bb99290e03a |
children |
line wrap: on
line source
extern(C) int printf(char*, ...); int return_six() { return 6; } int add_int(int a, int b) { return a+b; } int sub_int(int a, int b) { return a-b; } alias int function(int,int) binfn_t; int binop_int(binfn_t op, int a, int b) { return op(a,b); } binfn_t get_binop_int(char op) { binfn_t fn; if (op == '+') fn = &add_int; else if (op == '-') fn = &sub_int; return fn; } extern(C) float mul_float(float a, float b) { return a * b; } void function_pointers() { int function() fn = &return_six; assert(fn() == 6); binfn_t binfn = &add_int; assert(binfn(4,1045) == 1049); assert(binop_int(binfn, 10,656) == 666); binfn = get_binop_int('+'); assert(binop_int(binfn, 10,100) == 110); binfn = get_binop_int('-'); assert(binop_int(binfn, 10,100) == -90); { auto ffn = &mul_float; float ftmp = mul_float(2.5,5); assert(ftmp == 12.5); assert(ftmp > 12.49 && ftmp < 12.51); } } void main() { printf("Function pointer test\n"); function_pointers(); printf(" SUCCESS\n"); }