代码搜索：Optimization
找到约 10,000 项符合「Optimization」的源代码
代码结果 10,000
www.eeworm.com/read/168845/5429890
jamfile
# Copyright (c) 2003 Institute of Transport,
# Railway Construction and Operation,
# University of Hanover, Germany
#
# Permission to copy, use, modify, sell and distrib
www.eeworm.com/read/164348/5491516
pcf win.pcf
# Enable FPO (Frame Pointer Omission) optimization for 5-15% improved
# performance.
paramList = string.split(platform.cc.args['release'])
# see if it is in the list
if '/Oy-' in paramList:
www.eeworm.com/read/164348/5497241
pcf win.pcf
# Enable FPO (Frame Pointer Omission) optimization for 5-15% improved
# performance.
paramList = string.split(platform.cc.args['release'])
# see if it is in the list
if '/Oy-' in paramList:
www.eeworm.com/read/164348/5497248
pcf win.pcf
# Enable FPO (Frame Pointer Omission) optimization for 5-15% improved
# performance.
paramList = string.split(platform.cc.args['release'])
# see if it is in the list
if '/Oy-' in paramList:
www.eeworm.com/read/162614/5517062
c mmx-1.c
/* { dg-do compile { target i?86-*-* x86_64-*-* } } */
/* { dg-options "-O2 -mmmx" } */
/* Test that the intrinsics compile with optimization. All of them are
defined as inline functions in mmint
www.eeworm.com/read/162614/5517090
c mmx-2.c
/* { dg-do compile { target i?86-*-* x86_64-*-* } } */
/* { dg-options "-O0 -mmmx" } */
/* Test that the intrinsics compile without optimization. All of them are
defined as inline functions in mm
www.eeworm.com/read/162614/5527636
c 20021204-1.c
/* This test was miscompiled when using sibling call optimization,
because X ? Y : Y - 1 optimization changed X into !X in place
and haven't reverted it if do_store_flag was successful, so
wh
www.eeworm.com/read/162614/5528019
c 20040726-1.c
/* PR rtl-optimization/16643 */
void foo (int a, int b, int c, int d, int e, int *f)
{
if (a == 0)
if (b == 0)
if (c == 0)
if (d == 0)
{
*f = e;
return;
}
*f = e;
retu
www.eeworm.com/read/162614/5528432
c 20021212-1.c
/* PR optimization/8334 */
/* Verify that GCC produces valid operands
after simplifying an addition. */
void foo(int m, int n, double *f)
{
int i, j, k = 1;
for (j = 0; j < n; j++) {
for
www.eeworm.com/read/162614/5528618
c pr12517.c
/* PR tree-optimization/12517 */
int f(void);
void g(int);
void h(int a, int b, int c)
{
int i = f();
if (b && (i & 4))
g(i & 8 ? 0 : 1);
if (a) {
do {
if (i & 8)
g(0);
i