代码搜索：optimized
找到约 6,562 项符合「optimized」的源代码
代码结果 6,562
www.eeworm.com/read/188651/8521420
c gvmat32c.c
/* gvmat32.c -- C portion of the optimized longest_match for 32 bits x86
* Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant.
* File written by Gilles Vollant, by modifiying the longest_
www.eeworm.com/read/188340/8548625
tdf 74161.tdf
TITLE "Top-level file for the 74161 macrofunction. Chooses a device-family optimized implementation.";
FUNCTION p74161 (clk, ldn, clrn, enp, ent, d, c, b, a)
RETURNS (qd, qc, qb, qa, rco);
FU
www.eeworm.com/read/284410/8935450
c gvmat32c.c
/* gvmat32.c -- C portion of the optimized longest_match for 32 bits x86
* Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant.
* File written by Gilles Vollant, by modifiying the longest_
www.eeworm.com/read/179813/9335875
sun5 makefile.sun5
# -*- makefile -*-
# Makefile for Solaris/SunOS with Sun C++ 5.1 compiler (Forte6 patch 109490-01)
CC=CC
# Debug version
#CFLAGS = -c -w -g -DDEBUG_LEVEL=DEBUG_TRACE -D__sun__
# Optimized
www.eeworm.com/read/359831/10121447
h kiss_fftr.h
#ifndef KISS_FTR_H
#define KISS_FTR_H
#include "kiss_fft.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
Real optimized version can save about 45% cpu time vs. complex fft of a real
www.eeworm.com/read/352960/10487599
c qpel.c
/*
this is optimized for sh, which have post increment addressing (*p++)
some cpu may be index (p[n]) faster than post increment (*p++)
*/
#define LD(adr) *(uint32_t*)(adr)
#define PIXOP2(OPNAME,
www.eeworm.com/read/416426/11029487
c gvmat32c.c
/* gvmat32.c -- C portion of the optimized longest_match for 32 bits x86
* Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant.
* File written by Gilles Vollant, by modifiying the longest_
www.eeworm.com/read/443803/7623115
h kiss_fftr.h
#ifndef KISS_FTR_H
#define KISS_FTR_H
#include "kiss_fft.h"
#ifdef __cplusplus
extern "C" {
#endif
/*
Real optimized version can save about 45% cpu time vs. complex fft of a real