代码搜索:mult
找到约 6,230 项符合「mult」的源代码
代码结果 6,230
www.eeworm.com/read/221024/14778570
html http:^^multimedia.csc.ncsu.edu^new^main.html
Server: Netscape-Communications/1.1
Date: Tuesday, 14-Jan-97 21:44:54 GMT
Last-modified: Thursday, 12-Dec-96 15:44:26 GMT
Content-length: 2498
Content-type: text/html
Mult
www.eeworm.com/read/17586/740457
tdf fpga_yuv2rgb.tdf
INCLUDE "lpm_and.inc";
INCLUDE "lpm_add_sub.inc";
INCLUDE "lpm_counter.inc";
INCLUDE "lpm_mult.inc";
INCLUDE "altdpram.inc";
INCLUDE "lpm_ff.inc";
INCLUDE "lpm_ram_dp.inc";
SUBDESIGN cgl400e_
www.eeworm.com/read/479931/1325746
s hilo-hazard-2.s
# Test for architectures without mf{hi,lo} -> mult/div/mt{hi,lo} hazards.
#
# mach: vr5500 mips32 mips64
# as: -mabi=eabi
# ld: -N -Ttext=0x80010000
# output: pass\\n
.include "hilo-hazard.inc"
www.eeworm.com/read/479931/1326201
cgs csmul.cgs
# frv testcase for csmul $GRi,$GRj,$GRk,$CCi,$cond
# mach: all
.include "testutils.inc"
start
.global csmul
csmul:
set_spr_immed 0x1b1b,cccr
; Positive operands
set_gr_immed 3,gr7 ; mult
www.eeworm.com/read/239567/4597751
py testbinop.py
# Add, Sub, Mult, Div, Mod
X + Y
X - Y
X * Y
X / Y
X % Y
# Pow
X ** Y
# Left and right shift
X > Y
X >> Y
# BinOr
X | Y
# BinAnd
X & Y
# XOR
X ^ Y
# Floo
www.eeworm.com/read/343627/3218089
prj proj.prj
#-- Synplicity, Inc.
#-- Version 7.0.3
#-- Project file G:\XROADS\INFERENCE_STATUS\SPRO_703\VERILOG\MULT18X18\proj.prj
#-- Written on Thu Feb 14 16:00:20 2002
#add_file options
add_file -v
www.eeworm.com/read/343627/3218092
prj proj.prj
#-- Synplicity, Inc.
#-- Version 7.1 Alpha
#-- Project file G:\XROADS\INFERENCE_STATUS\SPRO_703\VERILOG\MULT18X18S\proj.prj
#-- Written on Thu Feb 14 17:37:07 2002
#add_file options
add_
www.eeworm.com/read/343627/3218151
prj proj.prj
#-- Synplicity, Inc.
#-- Version 7.0.3
#-- Project file G:\XROADS\INFERENCE_STATUS\SPRO_703\VHDL\MULT18X18\proj.prj
#-- Written on Thu Feb 14 16:34:55 2002
#add_file options
add_file -vhdl
www.eeworm.com/read/424146/2018201
cpp 10_13.cpp
//10_13.cpp
#include
#include //包含数值算法头文件
using namespace std;
int mult(int x, int y) { return x*y; }; //定义一个普通函数
int main()
{
int A[] = {1, 2, 3, 4, 5};
const in
www.eeworm.com/read/410728/2202402
s hilo-hazard-2.s
# Test for architectures without mf{hi,lo} -> mult/div/mt{hi,lo} hazards.
#
# mach: vr5500 mips32 mips64
# as: -mabi=eabi
# ld: -N -Ttext=0x80010000
# output: pass\\n
.include "hilo-hazard.inc"