initial commit
This commit is contained in:
@@ -0,0 +1,4 @@
|
||||
# IDE (clangd) segédkonfig: az Oscar64 vendorolt headerjeit így találja
|
||||
# meg a nyelvi szerver; a tényleges fordítást az oscar64 végzi (Makefile).
|
||||
CompileFlags:
|
||||
Add: [-Ioscar64/include, -I../oscar64/include, -Wno-unknown-pragmas]
|
||||
@@ -0,0 +1,2 @@
|
||||
# Auto detect text files and perform LF normalization
|
||||
* text=auto
|
||||
@@ -0,0 +1,61 @@
|
||||
name: Run checks
|
||||
|
||||
on:
|
||||
push:
|
||||
branches:
|
||||
- main
|
||||
pull_request:
|
||||
branches:
|
||||
- main
|
||||
|
||||
jobs:
|
||||
check:
|
||||
strategy:
|
||||
fail-fast: false
|
||||
matrix:
|
||||
os:
|
||||
- macos-latest
|
||||
- ubuntu-24.04-arm
|
||||
- ubuntu-latest
|
||||
- windows-latest
|
||||
|
||||
runs-on: "${{ matrix.os }}"
|
||||
|
||||
defaults:
|
||||
run:
|
||||
shell: bash
|
||||
|
||||
env:
|
||||
SCCACHE_GHA_ENABLED: "true"
|
||||
|
||||
steps:
|
||||
- uses: actions/checkout@v5
|
||||
|
||||
- name: Start sccache
|
||||
uses: mozilla-actions/sccache-action@v0.0.9
|
||||
|
||||
- name: Set CXX var
|
||||
run: |
|
||||
case "$RUNNER_OS" in
|
||||
"Linux") echo "CXX=g++" >> "$GITHUB_ENV" ;;
|
||||
"macOS") echo "CXX=clang++" >> "$GITHUB_ENV" ;;
|
||||
"Windows") echo "CXX=g++" >> "$GITHUB_ENV" ;;
|
||||
esac
|
||||
|
||||
- name: Determine number of cores
|
||||
run: |
|
||||
CORES=2
|
||||
case "$RUNNER_OS" in
|
||||
"Linux") CORES="$(nproc)" ;;
|
||||
"macOS") CORES="$(sysctl -n hw.ncpu)" ;;
|
||||
"Windows") CORES="$NUMBER_OF_PROCESSORS" ;;
|
||||
*) echo "Unknown OS, using default." ;;
|
||||
esac
|
||||
echo "NUMBER_OF_CORES=$CORES" >> "$GITHUB_ENV"
|
||||
echo "Using $CORES cores"
|
||||
|
||||
- name: make compiler
|
||||
run: make -C make -j "$NUMBER_OF_CORES" compiler CXX="sccache ${CXX}"
|
||||
|
||||
- name: make check
|
||||
run: make -C make -j "$NUMBER_OF_CORES" check
|
||||
+11
@@ -0,0 +1,11 @@
|
||||
# a demo fordítási kimenete (demo.prg + generált .asm/.map/.lbl/.int)
|
||||
build/
|
||||
|
||||
# a vendorolt Oscar64 lokálisan épített binárisa és köztes objektumai
|
||||
# (a Makefile első futáskor újraépíti: make -C oscar64/make compiler)
|
||||
oscar64/bin/
|
||||
oscar64/build/
|
||||
|
||||
# szerkesztő / OS szemét
|
||||
.DS_Store
|
||||
*.swp
|
||||
Vendored
+3
@@ -0,0 +1,3 @@
|
||||
{
|
||||
"cmake.ignoreCMakeListsMissing": true
|
||||
}
|
||||
Vendored
+45
@@ -0,0 +1,45 @@
|
||||
{
|
||||
"version": "2.0.0",
|
||||
"tasks": [
|
||||
{
|
||||
"label": "deps",
|
||||
"type": "shell",
|
||||
"command": "make deps",
|
||||
"problemMatcher": []
|
||||
},
|
||||
{
|
||||
"label": "build",
|
||||
"type": "shell",
|
||||
"command": "make build",
|
||||
"group": {
|
||||
"kind": "build",
|
||||
"isDefault": true
|
||||
},
|
||||
"problemMatcher": []
|
||||
},
|
||||
{
|
||||
"label": "run",
|
||||
"type": "shell",
|
||||
"command": "make run",
|
||||
"problemMatcher": []
|
||||
},
|
||||
{
|
||||
"label": "clean",
|
||||
"type": "shell",
|
||||
"command": "make clean",
|
||||
"problemMatcher": []
|
||||
},
|
||||
{
|
||||
"label": "rebuild",
|
||||
"type": "shell",
|
||||
"command": "make rebuild",
|
||||
"problemMatcher": []
|
||||
},
|
||||
{
|
||||
"label": "rebuildrun",
|
||||
"type": "shell",
|
||||
"command": "make rebuildrun",
|
||||
"problemMatcher": []
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,41 @@
|
||||
NAME := demo
|
||||
OSCAR64 := oscar64/bin/oscar64
|
||||
SRC := src/main.c
|
||||
SRCS := $(wildcard src/*.c src/*.h)
|
||||
PRG := build/$(NAME).prg
|
||||
EMU := x64sc
|
||||
|
||||
UNAME_S := $(shell uname -s)
|
||||
|
||||
all: build
|
||||
|
||||
deps:
|
||||
ifeq ($(UNAME_S),Darwin)
|
||||
@command -v brew >/dev/null 2>&1 || { echo "Homebrew kell ehhez. Telepitsd: https://brew.sh"; exit 1; }
|
||||
brew install vice
|
||||
else
|
||||
@echo "A 'deps' target csak macOS-en (Darwin) automatikus. Detektalt OS: $(UNAME_S)"
|
||||
@echo "Telepitsd kezzel a VICE emulatort (x64sc). Az Oscar64 vendorolt, magatol epul."
|
||||
@exit 1
|
||||
endif
|
||||
|
||||
$(OSCAR64):
|
||||
$(MAKE) -C oscar64/make compiler
|
||||
|
||||
build: $(PRG)
|
||||
|
||||
$(PRG): $(SRCS) $(OSCAR64)
|
||||
@mkdir -p build
|
||||
$(OSCAR64) -n -O2 -o=$(PRG) $(SRC)
|
||||
|
||||
run: $(PRG)
|
||||
$(EMU) $(PRG)
|
||||
|
||||
clean:
|
||||
rm -rf build
|
||||
|
||||
rebuild: clean build
|
||||
|
||||
rebuildrun: clean build run
|
||||
|
||||
.PHONY: all deps build run clean rebuild rebuildrun
|
||||
@@ -0,0 +1,138 @@
|
||||
# C64 Demo — Teletype Games slide show (Oscar64)
|
||||
|
||||
A Commodore 64 slide show, C-ben, az [Oscar64](https://github.com/drmortalwombat/oscar64)
|
||||
fordítóval. Az eredetileg 6502 assemblyben (ACME) írt [c64-demo](../c64-demo)
|
||||
portja: öt slide váltakozik automatikusan, slide-onkénti átmenetekkel feketén
|
||||
keresztül, és a show billentyűzetről is vezérelhető.
|
||||
|
||||
## A slide-ok
|
||||
|
||||
1. **TTG logó + credits scroller** — óriás TTG betűk 8×8-as bitmapekből, arany
|
||||
színfutással, pulzáló **TELETYPE GAMES** felirat, sima pixel-scroller a
|
||||
stáblistával.
|
||||
2. **Az első játékunk** — *DEFINITELY NOT AN IMPOSTOR* nagy 3×5-ös
|
||||
blokkbetűkkel, arany wash-sal, „introduced on TIC-80".
|
||||
3. **A második játékunk** — *IS COMING* nagybetűkkel, vetett árnyékkal;
|
||||
a raszterbárok csak a kereten futnak, így a szöveg olvasható marad.
|
||||
4. **Kapcsolat** — pulzáló *CONTACT* cím, web / BBS / IRC sorok, 12 cellás
|
||||
háromrétegű parallax csillagmező és hat hardveres sprite (négyágú csillagok)
|
||||
szinusz-pályán a szöveg mögött.
|
||||
5. **Az assembly vallomás** — sorkizárt szöveg arról, hogy ez a slide show egy
|
||||
kis AI-segítséggel készült; a törzs élőben gépelődik be (karakterenként egy
|
||||
frame, fehér blokk-kurzorral), a záró sor a gépelés végén jelenik meg és pulzál.
|
||||
|
||||
Minden slide 8 másodpercig látszik (`SLIDE_TIME` a `src/defs.h`-ban, PAL
|
||||
frame-ekben); az 5-ös slide 9 másodpercet kap (`S5_TIME`), hogy az írógép végezzen.
|
||||
|
||||
## Vezérlés
|
||||
|
||||
| Billentyű | Funkció |
|
||||
|-----------|---------|
|
||||
| `SPACE` | következő slide azonnal |
|
||||
| `INST/DEL` (backspace) | előző slide |
|
||||
| `P` | pause — a visszaszámlálás megáll, fehér `P` jelző a jobb felső sarokban; az effektek futnak tovább, SPACE/DEL működik |
|
||||
| `M` | némítás — a SID zene ki/be |
|
||||
|
||||
A billentyűket közvetlenül a CIA1 mátrixból olvassuk (a KERNAL IRQ le van tiltva).
|
||||
|
||||
## Fordítás és futtatás
|
||||
|
||||
```sh
|
||||
make build # fordítás -> build/demo.prg (első futáskor a fordítót is megépíti)
|
||||
make run # futtatás VICE emulátorban (x64sc kell hozzá)
|
||||
make rebuildrun # tiszta újrafordítás + futtatás
|
||||
make clean # build mappa törlése
|
||||
make deps # macOS-en: VICE telepítése Homebrew-val
|
||||
```
|
||||
|
||||
Ugyanezek a `.vscode/tasks.json`-ból VS Code taskként is futtathatók
|
||||
(a `build` az alapértelmezett build task).
|
||||
|
||||
Betöltés igazi vagy emulált C64-en:
|
||||
|
||||
```
|
||||
LOAD"*",8,1
|
||||
RUN
|
||||
```
|
||||
|
||||
## Forrás-elrendezés
|
||||
|
||||
| Fájl | Tartalom |
|
||||
|------|----------|
|
||||
| `src/main.c` | főciklus, slide-szekvenszer, billentyűolvasás (SPACE / DEL / P / M), slide-táblák |
|
||||
| `src/defs.h` | hardvermutatók, színek, elrendezés/időzítés konstansok, screen code charmap |
|
||||
| `src/transitions.c` | átmenet-motor: show/hide, három átmenettípus (fade, dissolve, wipe), `wait_frame` raszter-szinkron, színsnapshot |
|
||||
| `src/common.c` | közös rutinok (`clear_screen`, `print_text`, `draw_big`), közös táblák (sor×40, 3×5 blokkfont, wash/pulse/fade rámpák) |
|
||||
| `src/music.c` | SID zenemotor: háromszólamú pattern-lejátszó (basszus, dob, echo lead) az *Impostor* dallam adataival |
|
||||
| `src/slide1.c` … `slide5.c` | slide-onként egy fájl: `sN_init` (képernyőrajzolás), `sN_update` (frame-enként egyszer fut) + slide-lokális adatok |
|
||||
|
||||
A fordítási egységeket az Oscar64 `#pragma compile("file.c")` mechanizmusa fűzi
|
||||
össze: minden header behúzza a hozzá tartozó `.c`-t, ezért a `make`-nek elég a
|
||||
`src/main.c`-t átadni.
|
||||
|
||||
## Hogyan működik
|
||||
|
||||
### Slide-keretrendszer
|
||||
|
||||
Minden slide egy **init** rutinból (megrajzolja a teljes képernyőt), egy
|
||||
**update** rutinból (frame-enként egyszer hívódik, pontosan egy frame-et fut)
|
||||
és egy frame-ben mért időtartamból áll. A `main.c` főciklusa hívja az aktuális
|
||||
update-et, számolja vissza a frame-eket, és lejáratkor — vagy SPACE/DEL-re
|
||||
azonnal — a következő slide-ra lép.
|
||||
|
||||
### Időzítés
|
||||
|
||||
Nincs megszakítás: a kód a raszterregisztert (`$D012`, `vic.raster`) pollozza,
|
||||
és minden képernyőfrissítést az alsó keretben végez (`RAS_BOTTOM`). Az 1-es
|
||||
slide ezen felül képközépen megbontja a frame-et, hogy csak a scroller sorára
|
||||
kapcsolja be a vízszintes finomscrollt (`vic.ctrl2`); a 3-as slide a sugarat
|
||||
üldözve 4 soronként átszínezi a keretet a raszterbárokhoz.
|
||||
|
||||
### Átmenetek
|
||||
|
||||
Minden slide-nak saját be- és kilépő átmenete van (`tin_tbl` / `tout_tbl` a
|
||||
`main.c`-ben), három típusból:
|
||||
|
||||
- **Fade** — minden color RAM cellát a `fadetbl` rámpán léptet (minden szín →
|
||||
egy árnyalattal sötétebb; minden lánc legfeljebb 4 lépésben fekete). Az új
|
||||
slide kikapcsolt képernyővel rajzolódik, színei a `$C000`-es bufferbe
|
||||
mentődnek és feketére váltanak, majd a fade-in cellánként visszasétál a
|
||||
mentett színre.
|
||||
- **Dissolve** — egy 10 bites Galois LFSR (periódus 1023) minden cellát pontosan
|
||||
egyszer, álvéletlen sorrendben jár be. 25 cella/frame = 40 frame (~0,8 s).
|
||||
- **Wipe** — oszloponkénti söprés balról jobbra, oszloponként egy frame.
|
||||
|
||||
Minden átmenet rövid fehér-szürke keretvillanással indul.
|
||||
|
||||
### Zene
|
||||
|
||||
A `src/music.c` háromszólamú SID pattern-lejátszó; a dallam az *Impostor*
|
||||
TIC-80 cart 0-s trackje („room work"), kézzel konvertálva 128 soros
|
||||
pattern-ráccsá (basszus: 50% pulzus, dob: zaj, echo-kánon: háromszög pluck
|
||||
3 oktávval feljebb, 2 sorral késleltetve). Egy sor egy bájt szólamonként:
|
||||
`$00` = semmi, `$01` = key off, `$80|n` = n. hang. A `music_play` frame-enként
|
||||
egyszer tickel: a főciklusból és a `wait_frame`-ből is, így az átmenetek alatt
|
||||
sem áll meg.
|
||||
|
||||
## Memóriatérkép
|
||||
|
||||
```
|
||||
$0801 .. ... BASIC stub + gépi kód (Oscar64 alapértelmezés)
|
||||
$0340 .. $037E sprite-alakzat (kazettabuffer, 64-re igazított)
|
||||
$0400 .. $07E7 képernyő RAM (közvetlen írás)
|
||||
$C000 .. $C3E7 color RAM snapshot buffer az átmenetekhez
|
||||
$D000 .. $D02E VIC-II regiszterek (kép, sprite-ok, raszter)
|
||||
$D400 .. $D418 SID regiszterek (zene)
|
||||
$D800 .. color RAM
|
||||
$DC00 / $DC01 CIA1 billentyűmátrix
|
||||
```
|
||||
|
||||
## Az eredetihez képest
|
||||
|
||||
- A szövegek a `#pragma charmap(97, 1, 26)` révén fordítási időben
|
||||
screen code-dá alakulnak, így a C string literálok közvetlenül a képernyőre
|
||||
írhatók.
|
||||
- Az önmódosító vektorok és zeropage-mutatók helyett függvénypointerek és
|
||||
normál C tömbindexelés; a viselkedés (időzítés, effektek, zene) megegyezik.
|
||||
- A fordítás `-n -O2`-vel történik (teljes natív 6502 kód), hogy a
|
||||
raszter-pollozó részek elég gyorsak legyenek.
|
||||
@@ -0,0 +1,89 @@
|
||||
cmake_minimum_required(VERSION 3.15)
|
||||
|
||||
# Project name and version
|
||||
project(oscar64 VERSION 1.0 LANGUAGES CXX)
|
||||
|
||||
include(GNUInstallDirs)
|
||||
|
||||
# Define the executable
|
||||
add_executable(oscar64)
|
||||
|
||||
|
||||
# Glob all source files in the oscar64/ directory
|
||||
file(GLOB OSCAR64_SOURCES "${CMAKE_CURRENT_SOURCE_DIR}/oscar64/*.cpp" "${CMAKE_CURRENT_SOURCE_DIR}/oscar64/*.h")
|
||||
|
||||
# Add the sources to the target
|
||||
target_sources(${PROJECT_NAME} PRIVATE ${OSCAR64_SOURCES})
|
||||
|
||||
|
||||
# Add header files
|
||||
target_include_directories(oscar64 PRIVATE
|
||||
${CMAKE_CURRENT_SOURCE_DIR}
|
||||
)
|
||||
|
||||
# Compiler settings based on configuration
|
||||
set_target_properties(oscar64 PROPERTIES
|
||||
CXX_STANDARD 17
|
||||
CXX_STANDARD_REQUIRED YES
|
||||
CXX_EXTENSIONS NO
|
||||
)
|
||||
|
||||
# Set debug and release configurations
|
||||
target_compile_definitions(oscar64 PRIVATE $<$<CONFIG:Debug>:_DEBUG;_CONSOLE> $<$<CONFIG:Release>:NDEBUG;_CONSOLE>)
|
||||
|
||||
if (WIN32)
|
||||
target_compile_options(oscar64 PRIVATE $<$<CONFIG:Debug>:/W3 /WX> $<$<CONFIG:Release>:/O2 /W3>)
|
||||
else ()
|
||||
target_compile_options(oscar64 PRIVATE -Wall)
|
||||
endif ()
|
||||
|
||||
# Post-build steps (only for Release builds)
|
||||
if(CMAKE_BUILD_TYPE STREQUAL "Release")
|
||||
add_custom_command(TARGET oscar64 POST_BUILD
|
||||
COMMAND ${CMAKE_COMMAND} -E copy $<TARGET_FILE:oscar64> ${CMAKE_BINARY_DIR}/bin
|
||||
)
|
||||
endif()
|
||||
|
||||
if (WIN32)
|
||||
target_link_libraries(oscar64 PRIVATE kernel32 user32 gdi32 winspool comdlg32 advapi32 shell32 ole32 oleaut32 uuid odbc32 odbccp32 version)
|
||||
elseif (APPLE)
|
||||
# Add macOS-specific frameworks to replace Windows libraries
|
||||
target_link_libraries(${PROJECT_NAME}
|
||||
"-framework Cocoa" # For GUI and application support
|
||||
"-framework CoreFoundation" # For Core Foundation utilities (similar to advapi32 or shell32)
|
||||
"-framework CoreGraphics" # For graphics and rendering (similar to gdi32)
|
||||
"-framework IOKit" # For hardware interaction
|
||||
"-framework AppKit" # For GUI (equivalent to user32)
|
||||
)
|
||||
elseif (UNIX)
|
||||
# Add Linux-specific libraries for equivalent functionality
|
||||
target_link_libraries(${PROJECT_NAME}
|
||||
pthread # For threading (similar to kernel32)
|
||||
dl # For dynamic library loading (similar to LoadLibrary)
|
||||
m # For math library (optional but common on Linux)
|
||||
X11 # For X Window System (similar to user32 for GUI support)
|
||||
)
|
||||
endif()
|
||||
|
||||
|
||||
# Output directories
|
||||
set_target_properties(oscar64 PROPERTIES
|
||||
RUNTIME_OUTPUT_DIRECTORY_DEBUG ${CMAKE_BINARY_DIR}/Debug
|
||||
RUNTIME_OUTPUT_DIRECTORY_RELEASE ${CMAKE_BINARY_DIR}/Release
|
||||
)
|
||||
|
||||
install(TARGETS oscar64 RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR})
|
||||
|
||||
# Install oscar64 runtime include files to <prefix>/include/oscar64/
|
||||
# The compiler resolves this at runtime via fallback: basePath + "include/oscar64/crt.h"
|
||||
install(DIRECTORY include/
|
||||
DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/oscar64
|
||||
FILES_MATCHING
|
||||
PATTERN "*.h"
|
||||
PATTERN "*.c"
|
||||
PATTERN "*.cpp"
|
||||
)
|
||||
|
||||
install(FILES oscar64.1
|
||||
DESTINATION ${CMAKE_INSTALL_MANDIR}/man1
|
||||
)
|
||||
+674
@@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
@@ -0,0 +1,49 @@
|
||||
# oscar64
|
||||
|
||||
Oscar64 is a C/C++ cross compiler running on a modern system (such as a Windows PC, Mac or Linux machine) and targets the classic 6502 family of processors. It is mainly focused on Commodore systems such as the C64, PET or VIC20. The compiler supports C99 and many C++ features up to variadic templates and lambda functions.
|
||||
|
||||
The purpose of this compiler is to eliminate the need to write 6502 assembler code to achieve high code density and fast execution speed. It continues to improve with all the games, demos and tools written by it. It supports disk overlays and banked cartridges for larger projects.
|
||||
|
||||
The C64 executes 442 dhrystone V2.2 iteration per second, when compiled with Oscar64 and -O3 (which shows that the ancient dhrystone benchmark is no match to an optimizing compiler).
|
||||
|
||||
[Full reference manual](oscar64.md)
|
||||
[Additional samples and tutorials](https://github.com/drmortalwombat/OscarTutorials)
|
||||
|
||||
# References
|
||||
|
||||
This is a list of the games written with Oscar64, have a look if you are not convinced that fast paced action games can be written in C/C++ on a C64 (they are all free).
|
||||
|
||||
[Ball and Chain](https://drmortalwombat.itch.io/ball-and-chain)
|
||||
|
||||
[Balls like a Frog](https://drmortalwombat.itch.io/balls-like-a-frog)
|
||||
|
||||
|
||||
[Corescape](https://drmortalwombat.itch.io/corescape)
|
||||
|
||||
[MetalMayhem](https://drmortalwombat.itch.io/metal-mayhem)
|
||||
|
||||
[Mineshaft Gap](https://drmortalwombat.itch.io/mineshaft-gap)
|
||||
|
||||
[Minotrace](https://drmortalwombat.itch.io/minotrace)
|
||||
|
||||
[Missile Defence](https://drmortalwombat.itch.io/missile-defence)
|
||||
|
||||
|
||||
[Portal Buster](https://drmortalwombat.itch.io/portal-buster)
|
||||
|
||||
[Roguebot](https://drmortalwombat.itch.io/roguebot)
|
||||
|
||||
[Shallow Domains](https://drmortalwombat.itch.io/shallow-domains)
|
||||
|
||||
[Soiled Iron](https://drmortalwombat.itch.io/soiled-iron)
|
||||
|
||||
[Terminal Walker](https://drmortalwombat.itch.io/terminal-walker)
|
||||
|
||||
[Veggies vs Undead](https://drmortalwombat.itch.io/veggies-vs-undead)
|
||||
|
||||
|
||||
# Third Party Projects
|
||||
|
||||
This is a link to third party projects using Oscar64 or providing libraries to use. These links are being provided as a convenience and for informational purposes only.
|
||||
|
||||
[]()
|
||||
@@ -0,0 +1,22 @@
|
||||
#include "ambiguousoverload.h"
|
||||
|
||||
/**
|
||||
* Regression test for function pointers in aggregate initialisers.
|
||||
*
|
||||
* This setup function must be in a different translation unit from clearView's definition and
|
||||
* direct call (ambiguousoverload_trigger.c). The bug reused clearView's function declaration as an
|
||||
* aggregate-initialiser list node and corrupted its overload chain. Parsing the definition in the
|
||||
* other translation unit then made the otherwise unambiguous direct call fail.
|
||||
*
|
||||
* Holder reproduces the original ambiguous-overload diagnostic. The single-member CallbackHolder
|
||||
* also covers the related initialiser-builder assertion. Both callbacks are invoked to verify that
|
||||
* their aggregate initialisers contain the correct function address. The pragma in
|
||||
* ambiguousoverload.h schedules the companion translation unit so this remains one autotest target.
|
||||
*/
|
||||
void setup(void)
|
||||
{
|
||||
struct Holder holder = { .value = 1, .callback = clearView };
|
||||
struct CallbackHolder callbackHolder = { .callback = clearView };
|
||||
holder.callback();
|
||||
callbackHolder.callback();
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
#pragma once
|
||||
|
||||
typedef void (*Callback)(void);
|
||||
|
||||
struct Holder
|
||||
{
|
||||
int value;
|
||||
Callback callback;
|
||||
};
|
||||
|
||||
struct CallbackHolder
|
||||
{
|
||||
Callback callback;
|
||||
};
|
||||
|
||||
void clearView(void);
|
||||
|
||||
extern int clearViewCalls;
|
||||
|
||||
#pragma compile("ambiguousoverload_trigger.c")
|
||||
@@ -0,0 +1,24 @@
|
||||
#include "ambiguousoverload.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
void setup(void);
|
||||
|
||||
int clearViewCalls = 0;
|
||||
|
||||
// Kept in this companion translation unit to exercise cross-unit merging.
|
||||
void clearView(void)
|
||||
{
|
||||
clearViewCalls++;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
setup();
|
||||
assert(clearViewCalls == 2);
|
||||
// This direct call was incorrectly diagnosed as an ambiguous overload.
|
||||
clearView();
|
||||
assert(clearViewCalls == 3);
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
#include <assert.h>
|
||||
|
||||
template<int n, int m>
|
||||
void checkmul(void)
|
||||
{
|
||||
__striped static const unsigned r[256] = {
|
||||
#for(i, 256) i * n,
|
||||
};
|
||||
|
||||
for(unsigned i=0; i<m; i++)
|
||||
{
|
||||
assert((i & ~0) * n == r[i]);
|
||||
assert((i & ~1) * n == r[i >> 1] << 1);
|
||||
assert((i & ~3) * n == r[i >> 2] << 2);
|
||||
assert((i & ~7) * n == r[i >> 3] << 3);
|
||||
assert((i & ~15) * n == r[i >> 4] << 4);
|
||||
}
|
||||
for(unsigned i=0; i<256; i++)
|
||||
{
|
||||
assert((i & ~0) * n == r[i]);
|
||||
assert((i & ~1) * n == r[i >> 1] << 1);
|
||||
assert((i & ~3) * n == r[i >> 2] << 2);
|
||||
assert((i & ~7) * n == r[i >> 3] << 3);
|
||||
assert((i & ~15) * n == r[i >> 4] << 4);
|
||||
}
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
checkmul<3, 170>();
|
||||
checkmul<4, 128>();
|
||||
checkmul<5, 204>();
|
||||
checkmul<6, 170>();
|
||||
checkmul<7, 128>();
|
||||
checkmul<8, 64>();
|
||||
checkmul<9, 170>();
|
||||
}
|
||||
@@ -0,0 +1,74 @@
|
||||
#include <assert.h>
|
||||
|
||||
char a2[20][10] = {
|
||||
#for(i, 200) i,
|
||||
};
|
||||
|
||||
int sumrow(char y)
|
||||
{
|
||||
int s = 0;
|
||||
for(char i=0; i<10; i++)
|
||||
s += a2[y][i];
|
||||
return s;
|
||||
}
|
||||
|
||||
int sumrowp5(char y)
|
||||
{
|
||||
int s = 0;
|
||||
for(char i=0; i<10; i++)
|
||||
s += a2[y + 5][i];
|
||||
return s;
|
||||
}
|
||||
|
||||
int sumrowm5(char y)
|
||||
{
|
||||
int s = 0;
|
||||
for(char i=0; i<10; i++)
|
||||
s += a2[y - 5][i];
|
||||
return s;
|
||||
}
|
||||
|
||||
char pick(char y, char x)
|
||||
{
|
||||
return a2[y][x];
|
||||
}
|
||||
|
||||
char pickp5(char y, char x)
|
||||
{
|
||||
return a2[y + 5][x];
|
||||
}
|
||||
|
||||
char pickm5(char y, char x)
|
||||
{
|
||||
return a2[y - 5][x];
|
||||
}
|
||||
|
||||
char pickm50(char y, char x)
|
||||
{
|
||||
return a2[y - 50][x];
|
||||
}
|
||||
|
||||
char pickp50(signed char y, char x)
|
||||
{
|
||||
return a2[y + 50][x];
|
||||
}
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(char i=0; i<15; i++)
|
||||
{
|
||||
assert(sumrow(i) == sumrowm5(i + 5));
|
||||
assert(sumrow(i + 5) == sumrowp5(i));
|
||||
|
||||
for(char j=0; j<10; j++)
|
||||
{
|
||||
assert(pick(i, j) == pickm5(i + 5, j));
|
||||
assert(pick(i + 5, j) == pickp5(i, j));
|
||||
assert(pick(i, j) == pickm50(i + 50, j));
|
||||
assert(pick(i, j) == pickp50(i - 50, j));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -0,0 +1,48 @@
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
|
||||
char s[25][41] = {"Q QQ QQQQQ QQQQQQQQQQQQQ",
|
||||
" QQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQ",
|
||||
" QQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
" QQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ",
|
||||
"QQQQQQQQQ",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
"",
|
||||
" QQQQQQQQQQQQQQ"};
|
||||
|
||||
int main()
|
||||
{
|
||||
int i=0, sum = 0;
|
||||
for (unsigned char i = 0; i < 25; i++)
|
||||
{
|
||||
int j = 0;
|
||||
while (s[i][j])
|
||||
{
|
||||
sum += s[i][j] & 3;
|
||||
j++;
|
||||
}
|
||||
}
|
||||
|
||||
assert(sum == 391);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,152 @@
|
||||
#include <assert.h>
|
||||
|
||||
int t, n, m, k;
|
||||
|
||||
struct C1
|
||||
{
|
||||
int a;
|
||||
|
||||
C1(void);
|
||||
~C1(void);
|
||||
C1(const C1 & c);
|
||||
C1 & operator=(const C1 & c);
|
||||
};
|
||||
|
||||
struct C2
|
||||
{
|
||||
C1 nc[10], mc[20];
|
||||
};
|
||||
|
||||
C1::C1(void)
|
||||
{
|
||||
a = 1;
|
||||
n++;
|
||||
t++;
|
||||
}
|
||||
|
||||
C1::C1(const C1 & c)
|
||||
{
|
||||
a = c.a;
|
||||
k++;
|
||||
t++;
|
||||
}
|
||||
|
||||
C1 & C1::operator=(const C1 & c)
|
||||
{
|
||||
a = c.a;
|
||||
m++;
|
||||
return *this;
|
||||
}
|
||||
|
||||
C1::~C1(void)
|
||||
{
|
||||
t--;
|
||||
}
|
||||
|
||||
void test_local_init(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C1 c[10];
|
||||
}
|
||||
|
||||
assert(n == 10 && t == 0);
|
||||
}
|
||||
|
||||
void test_member_init(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 d;
|
||||
}
|
||||
|
||||
assert(n == 30 && t == 0);
|
||||
}
|
||||
|
||||
void test_member_array_init(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 d[5];
|
||||
}
|
||||
|
||||
assert(n == 150 && t == 0);
|
||||
}
|
||||
|
||||
void test_local_copy(void)
|
||||
{
|
||||
n = 0;
|
||||
k = 0;
|
||||
|
||||
{
|
||||
C1 c[10];
|
||||
C1 d(c[4]);
|
||||
}
|
||||
|
||||
assert(n == 10 && k == 1 && t == 0);
|
||||
}
|
||||
|
||||
void test_member_copy(void)
|
||||
{
|
||||
n = 0;
|
||||
k = 0;
|
||||
|
||||
{
|
||||
C2 d;
|
||||
C2 e(d);
|
||||
}
|
||||
|
||||
assert(n == 30 && k == 30 && t == 0);
|
||||
}
|
||||
|
||||
void test_local_assign(void)
|
||||
{
|
||||
n = 0;
|
||||
k = 0;
|
||||
m = 0;
|
||||
|
||||
{
|
||||
C1 c[10];
|
||||
C1 d[5];
|
||||
|
||||
d[4] = c[2];
|
||||
}
|
||||
|
||||
assert(n == 15 && k == 0 && m == 1 && t == 0);
|
||||
}
|
||||
|
||||
void test_member_assign(void)
|
||||
{
|
||||
n = 0;
|
||||
k = 0;
|
||||
m = 0;
|
||||
|
||||
{
|
||||
C2 d;
|
||||
C2 e;
|
||||
e = d;
|
||||
}
|
||||
|
||||
assert(n == 60 && k == 0 && m == 30 && t == 0);
|
||||
}
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test_local_init();
|
||||
test_member_init();
|
||||
|
||||
test_member_array_init();
|
||||
|
||||
test_local_copy();
|
||||
test_member_copy();
|
||||
|
||||
test_local_assign();
|
||||
test_member_assign();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,22 @@
|
||||
int a[10];
|
||||
|
||||
int get(int i)
|
||||
{
|
||||
return a[i];
|
||||
}
|
||||
|
||||
void put(int i, int x)
|
||||
{
|
||||
a[i] = x;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int j=0; j<10; j++)
|
||||
put(j, j);
|
||||
int s = -45;
|
||||
for(int j=0; j<10; j++)
|
||||
s += get(j);
|
||||
return s;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,23 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
int fg[15] = {1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610};
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int fl[15] = {1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610};
|
||||
|
||||
int sg = 0, sl = 0;
|
||||
|
||||
for(int i=0; i<15; i++)
|
||||
{
|
||||
sl += fl[i];
|
||||
sg += fg[i];
|
||||
}
|
||||
|
||||
assert(sl == 1596);
|
||||
assert(sg == 1596);
|
||||
|
||||
printf("%d %d\n", sl, sg);
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
|
||||
|
||||
int a(int * p, int x)
|
||||
{
|
||||
int y = x + 3;
|
||||
|
||||
p[y] = 1;
|
||||
p[y + 1] = 2;
|
||||
p[y + 2] = 3;
|
||||
p[y + 3] = 4;
|
||||
|
||||
return p[y] + p[y + 1] + p[y + 2] + p[y + 3];
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int t[16];
|
||||
|
||||
return a(t, 4) - 10;
|
||||
}
|
||||
@@ -0,0 +1,103 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int sum(int * a, int s)
|
||||
{
|
||||
int sum = 0;
|
||||
for(int i=0; i<s; i++)
|
||||
{
|
||||
sum += a[i];
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
void copy(int * d, const int * s, int n)
|
||||
{
|
||||
for(int i=0; i<n ; i++)
|
||||
d[i] = s[i];
|
||||
}
|
||||
|
||||
void reverse(int * d, const int * s, int n)
|
||||
{
|
||||
for(int i=0; i<n ; i++)
|
||||
d[i] = s[n - i - 1];
|
||||
}
|
||||
|
||||
int sumb(int * a, char s)
|
||||
{
|
||||
int sum = 0;
|
||||
for(char i=0; i<s; i++)
|
||||
{
|
||||
sum += a[i];
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
void copyb(int * d, const int * s, char n)
|
||||
{
|
||||
for(char i=0; i<n ; i++)
|
||||
d[i] = s[i];
|
||||
}
|
||||
|
||||
void reverseb(int * d, const int * s, char n)
|
||||
{
|
||||
for(char i=0; i<n ; i++)
|
||||
d[i] = s[n - i - 1];
|
||||
}
|
||||
|
||||
long suml(long * a, char s)
|
||||
{
|
||||
long sum = 0;
|
||||
for(char i=0; i<s; i++)
|
||||
{
|
||||
sum += a[i];
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
void copyl(long * d, const long * s, char n)
|
||||
{
|
||||
for(char i=0; i<n ; i++)
|
||||
d[i] = s[i];
|
||||
}
|
||||
|
||||
void reversel(long * d, const long * s, char n)
|
||||
{
|
||||
for(char i=0; i<n ; i++)
|
||||
d[i] = s[n - i - 1];
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int a[100], b[100], c[100];
|
||||
long al[100], bl[100], cl[100];
|
||||
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
a[i] = i % 10;
|
||||
al[i] = i % 10;
|
||||
}
|
||||
|
||||
assert(sum(a, 100) == 450);
|
||||
|
||||
copy(b, a, 100);
|
||||
assert(sum(b, 100) == 450);
|
||||
reverse(c, a, 100);
|
||||
assert(sum(c, 100) == 450);
|
||||
assert(sumb(a, 100) == 450);
|
||||
copyb(b, a, 100);
|
||||
assert(sumb(b, 100) == 450);
|
||||
|
||||
reverseb(c, a, 100);
|
||||
assert(sumb(c, 100) == 450);
|
||||
|
||||
assert(suml(al, 100) == 450);
|
||||
|
||||
copyl(bl, al, 100);
|
||||
assert(suml(bl, 100) == 450);
|
||||
|
||||
reversel(cl, al, 100);
|
||||
assert(suml(cl, 100) == 450);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
float sum(float * a, int s)
|
||||
{
|
||||
float sum = 0;
|
||||
for(int i=0; i<s; i++)
|
||||
{
|
||||
sum += a[i];
|
||||
}
|
||||
|
||||
return sum;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
float a[100];
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
a[i] = i % 10;
|
||||
}
|
||||
|
||||
assert(sum(a, 100) == 450);
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
|
||||
int a(char p[100])
|
||||
{
|
||||
int s = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
s += p[i];
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
char c[100];
|
||||
for(int i=0; i<100; i++)
|
||||
c[i] = i;
|
||||
return a(c) - 4950;
|
||||
}
|
||||
@@ -0,0 +1,108 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
int asum(int a, int b)
|
||||
{
|
||||
return __asm
|
||||
{
|
||||
clc
|
||||
lda a
|
||||
adc b
|
||||
sta accu
|
||||
lda a + 1
|
||||
adc b + 1
|
||||
sta accu + 1
|
||||
};
|
||||
}
|
||||
|
||||
int bsum(int a, int b)
|
||||
{
|
||||
puts("Hello\n");
|
||||
|
||||
return __asm
|
||||
{
|
||||
clc
|
||||
lda a
|
||||
adc b
|
||||
sta accu
|
||||
lda a + 1
|
||||
adc b + 1
|
||||
sta accu + 1
|
||||
};
|
||||
}
|
||||
|
||||
int b, t[10];
|
||||
|
||||
int bsome(int x)
|
||||
{
|
||||
return x;
|
||||
}
|
||||
|
||||
|
||||
int qsum(int a, int (* c)(int))
|
||||
{
|
||||
char n = 0;
|
||||
b = 0;
|
||||
for(int i=0; i<a; i++)
|
||||
{
|
||||
int j = c((char)i);
|
||||
__asm
|
||||
{
|
||||
clc
|
||||
lda j
|
||||
adc b
|
||||
sta b
|
||||
lda j + 1
|
||||
adc b + 1
|
||||
sta b + 1
|
||||
}
|
||||
t[n] += i;
|
||||
n = (n + 1) & 7;
|
||||
}
|
||||
return b;
|
||||
}
|
||||
|
||||
#define ASMTEST_ZP (0x00 | 0xf0)
|
||||
#define ASMTEST_TARGET (0x1000 * 0x0c)
|
||||
|
||||
int opPrecedenceAndParenthesis() {
|
||||
return __asm volatile {
|
||||
lda #(1 + 2 * (1 + 2)) // = #7
|
||||
sta [ASMTEST_TARGET + 1] // = $c001
|
||||
|
||||
lda #<ASMTEST_TARGET // = #$c0
|
||||
sta [ASMTEST_ZP] + 2 // = $f2
|
||||
|
||||
lda #>ASMTEST_TARGET + 1 // = #$01
|
||||
sta [ASMTEST_ZP + 1] // = $f1
|
||||
ldx #1
|
||||
lda (ASMTEST_ZP, x) // = (0xf0, 1)
|
||||
pha
|
||||
|
||||
lda #<ASMTEST_TARGET // = #$00
|
||||
sta [ASMTEST_ZP + 1] // = $f1
|
||||
ldy #1
|
||||
pla
|
||||
sta ASMTEST_ZP, y // = ($f1), 1
|
||||
|
||||
lda [([ASMTEST_TARGET])] + 1 // = $c001
|
||||
sta accu
|
||||
lda #(1 & 2) // = 0
|
||||
sta accu + 1
|
||||
};
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int x = asum(7007, 8008);
|
||||
int y = bsum(4004, 9009);
|
||||
|
||||
assert(x == 7007 + 8008 && y == 4004 + 9009);
|
||||
assert(qsum(10, bsome) == 45);
|
||||
assert(qsum(200, bsome) == 19900);
|
||||
|
||||
assert(opPrecedenceAndParenthesis() == 7);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,77 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
struct X
|
||||
{
|
||||
char t;
|
||||
long l;
|
||||
};
|
||||
|
||||
__striped X xs[16];
|
||||
X xf[16];
|
||||
char xp;
|
||||
|
||||
__noinline long tt(long n)
|
||||
{
|
||||
return n;
|
||||
}
|
||||
|
||||
inline auto & tas(void)
|
||||
{
|
||||
return xs[xp].l;
|
||||
}
|
||||
|
||||
inline auto & taf(void)
|
||||
{
|
||||
return xf[xp].l;
|
||||
}
|
||||
|
||||
long ts(char n)
|
||||
{
|
||||
return tt(tas());
|
||||
}
|
||||
|
||||
long tf(char n)
|
||||
{
|
||||
return tt(taf());
|
||||
}
|
||||
|
||||
inline auto bas(void)
|
||||
{
|
||||
return xs[xp].l;
|
||||
}
|
||||
|
||||
inline auto baf(void)
|
||||
{
|
||||
return xs[xp].l;
|
||||
}
|
||||
|
||||
long bs(char n)
|
||||
{
|
||||
return tt(bas());
|
||||
}
|
||||
|
||||
long bf(char n)
|
||||
{
|
||||
return tt(baf());
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(char i=0; i<16; i++)
|
||||
{
|
||||
xs[i].l = i * i;
|
||||
xf[i].l = i * i;
|
||||
}
|
||||
|
||||
for(char i=0; i<16; i++)
|
||||
{
|
||||
xp = i;
|
||||
assert(ts(0) == i * i);
|
||||
assert(tf(0) == i * i);
|
||||
assert(bs(0) == i * i);
|
||||
assert(bf(0) == i * i);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,476 @@
|
||||
rem @echo off
|
||||
|
||||
@call :test ambiguousoverload.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test array2dtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test strparsetest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test shiftbyteaddconst.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test loopunrolltest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test rolrortest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test maskcheck.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test bitfields.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn autorefreturn.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_string.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_hashmap.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_array.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_vector.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_static_vector.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_vector_string.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_string_init.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_optional.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_numeric.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_span.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_streamtest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_pairtest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_parts.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh opp_list.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn opp_functional.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh operatoroverload.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh virtualdestruct.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh vcalltest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh vcalltree.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh constructortest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn copyconstructor.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh copyassign.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh arrayconstruct.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testh stdlibtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test mathtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testint16.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testint32.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testint16mul.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testsigned16mul.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testsigned16div.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test recursiontest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test copyinitmove.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test fastcalltest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test strlen.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test strcmptest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test strcmptest2.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test memmovetest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test arraytest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test arraytestfloat.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test optiontest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test floatcmptest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test floatmultest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test floatinttest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test staticconsttest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test arrayinittest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test arrayindexintrangecheck.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test array2stringinittest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testint16cmp.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testint8cmp.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testint32cmp.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test mixsigncmptest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test testinterval.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test cmprangeshortcuttest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test floatstringtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test sprintftest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test qsorttest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn plasma.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test loopdomtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test loopboundtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test byteindextest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test asmtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testb bitshifttest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test arrparam.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test bsstest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test copyintvec.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test divmodtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test divmod32test.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test fixmathtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn andmultest.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test enumswitch.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test incvector.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test structoffsettest2.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test structsplittest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test funcvartest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test variadic_macros.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test funcarraycall.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test structassigntest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test structmembertest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test structarraycopy.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test randsumtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test longcodetest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test scrolltest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test charwintest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test linetest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test ptrinittest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test ptrarraycmptest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test cplxstructtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn stripedarraytest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn stripedstructtest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testn mmultest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test tileexpand.cpp
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :testi volatiletest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test constlocaltest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@call :test structconditionaltest.c
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@exit /b 0
|
||||
|
||||
:error
|
||||
echo Failed with error #%errorlevel%.
|
||||
exit /b %errorlevel%
|
||||
|
||||
:testh
|
||||
..\bin\oscar64 -ea -g -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -n -dHEAPCHECK %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -xz -Oz -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -Oo -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -Ox -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O0 -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O0 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -Os -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -Os -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O3 -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O3 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O3 -n -dHEAPCHECK %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@exit /b 0
|
||||
|
||||
:test
|
||||
..\bin\oscar64 -ea -g -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O0 -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O0 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -Os -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -Os -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O3 -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O3 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -xz -Oz -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -Oo -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -Ox -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@exit /b 0
|
||||
|
||||
:testb
|
||||
..\bin\oscar64 -ea -g -bc %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -bc -O2 %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -bc -O0 %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -bc -Os %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -bc -O3 %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@exit /b 0
|
||||
|
||||
:testn
|
||||
..\bin\oscar64 -ea -g -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O0 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -Os -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O3 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -xz -Oz -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -Oo -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -ea -g -O2 -Ox -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
:testi
|
||||
..\bin\oscar64 -eai -g -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -O2 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -O0 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -Os -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -O3 -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -O2 -xz -Oz -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -O2 -Oo -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
..\bin\oscar64 -eai -g -O2 -Ox -n %~1
|
||||
@if %errorlevel% neq 0 goto :error
|
||||
|
||||
@exit /b 0
|
||||
@@ -0,0 +1,17 @@
|
||||
#ifndef AUTOTEST_H
|
||||
#define AUTOTEST_H
|
||||
|
||||
struct TestIO
|
||||
{
|
||||
volatile char cnt0, cnt1;
|
||||
volatile unsigned dmaddr;
|
||||
volatile char dmdata;
|
||||
volatile char mirror0, mirror1, mirror2;
|
||||
volatile long cycles;
|
||||
volatile char scratch[4];
|
||||
};
|
||||
|
||||
#define testio (*((struct TestIO *)0xdd80))
|
||||
#define testio2 (*((struct TestIO *)0xdd90))
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,354 @@
|
||||
#include <assert.h>
|
||||
|
||||
struct A
|
||||
{
|
||||
char x : 4;
|
||||
char y : 1;
|
||||
char z : 3;
|
||||
};
|
||||
|
||||
A a = {7, 1, 2};
|
||||
|
||||
void test_char_fit(void)
|
||||
{
|
||||
assert(a.x == 7);
|
||||
assert(a.y == 1);
|
||||
assert(a.z == 2);
|
||||
assert(sizeof(A) == 1);
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
a.x = i;
|
||||
a.y = 0;
|
||||
a.z = 3;
|
||||
assert(a.x == i);
|
||||
assert(a.y == 0);
|
||||
assert(a.z == 3);
|
||||
}
|
||||
}
|
||||
|
||||
struct B
|
||||
{
|
||||
char x : 6;
|
||||
char y : 6;
|
||||
char z : 6;
|
||||
char w : 6;
|
||||
};
|
||||
|
||||
B b = {11, 22, 33, 44};
|
||||
|
||||
void test_char_cross(void)
|
||||
{
|
||||
assert(b.x == 11);
|
||||
assert(b.y == 22);
|
||||
assert(b.z == 33);
|
||||
assert(b.w == 44);
|
||||
assert(sizeof(B) == 3);
|
||||
|
||||
for(int i=0; i<64; i++)
|
||||
{
|
||||
b.x = i * 1;
|
||||
b.y = i * 3;
|
||||
b.z = i * 5;
|
||||
b.w = i * 7;
|
||||
assert(b.x == ((i * 1) & 0x3f));
|
||||
assert(b.y == ((i * 3) & 0x3f));
|
||||
assert(b.z == ((i * 5) & 0x3f));
|
||||
assert(b.w == ((i * 7) & 0x3f));
|
||||
}
|
||||
}
|
||||
|
||||
struct C
|
||||
{
|
||||
unsigned x : 4;
|
||||
unsigned y : 1;
|
||||
unsigned z : 3;
|
||||
};
|
||||
|
||||
C c = {7, 1, 2};
|
||||
|
||||
void test_word_fit(void)
|
||||
{
|
||||
assert(c.x == 7);
|
||||
assert(c.y == 1);
|
||||
assert(c.z == 2);
|
||||
assert(sizeof(C) == 1);
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
c.x = i;
|
||||
c.y = 0;
|
||||
c.z = 3;
|
||||
assert(c.x == i);
|
||||
assert(c.y == 0);
|
||||
assert(c.z == 3);
|
||||
}
|
||||
}
|
||||
|
||||
struct D
|
||||
{
|
||||
unsigned x : 10;
|
||||
unsigned y : 10;
|
||||
unsigned z : 10;
|
||||
unsigned w : 10;
|
||||
};
|
||||
|
||||
D d = {111, 222, 333, 444};
|
||||
|
||||
void test_word_cross(void)
|
||||
{
|
||||
assert(d.x == 111);
|
||||
assert(d.y == 222);
|
||||
assert(d.z == 333);
|
||||
assert(d.w == 444);
|
||||
assert(sizeof(D) == 5);
|
||||
|
||||
for(int i=0; i<1024; i++)
|
||||
{
|
||||
d.x = i * 1;
|
||||
d.y = i * 3;
|
||||
d.z = i * 5;
|
||||
d.w = i * 7;
|
||||
assert(d.x == ((i * 1) & 0x3ff));
|
||||
assert(d.y == ((i * 3) & 0x3ff));
|
||||
assert(d.z == ((i * 5) & 0x3ff));
|
||||
assert(d.w == ((i * 7) & 0x3ff));
|
||||
}
|
||||
}
|
||||
|
||||
struct E
|
||||
{
|
||||
unsigned long x : 4;
|
||||
unsigned long y : 1;
|
||||
unsigned long z : 3;
|
||||
};
|
||||
|
||||
E e = {7, 1, 2};
|
||||
|
||||
void test_dword_fit(void)
|
||||
{
|
||||
assert(e.x == 7);
|
||||
assert(e.y == 1);
|
||||
assert(e.z == 2);
|
||||
assert(sizeof(E) == 1);
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
e.x = i;
|
||||
e.y = 0;
|
||||
e.z = 3;
|
||||
assert(e.x == i);
|
||||
assert(e.y == 0);
|
||||
assert(e.z == 3);
|
||||
}
|
||||
}
|
||||
|
||||
struct F
|
||||
{
|
||||
unsigned long x : 20;
|
||||
unsigned long y : 20;
|
||||
unsigned long z : 20;
|
||||
unsigned long w : 20;
|
||||
};
|
||||
|
||||
F f = {111111UL, 222222UL, 333333UL, 444444UL};
|
||||
|
||||
void test_dword_cross(void)
|
||||
{
|
||||
assert(f.x == 111111UL);
|
||||
assert(f.y == 222222UL);
|
||||
assert(f.z == 333333UL);
|
||||
assert(f.w == 444444UL);
|
||||
assert(sizeof(F) == 10);
|
||||
|
||||
for(int i=0; i<1024; i++)
|
||||
{
|
||||
f.x = i * 11UL;
|
||||
f.y = i * 33UL;
|
||||
f.z = i * 55UL;
|
||||
f.w = i * 77UL;
|
||||
assert(f.x == ((i * 11UL) & 0xfffffUL));
|
||||
assert(f.y == ((i * 33UL) & 0xfffffUL));
|
||||
assert(f.z == ((i * 55UL) & 0xfffffUL));
|
||||
assert(f.w == ((i * 77UL) & 0xfffffUL));
|
||||
}
|
||||
}
|
||||
|
||||
struct G
|
||||
{
|
||||
signed char x : 1;
|
||||
signed char y : 5;
|
||||
signed char z : 2;
|
||||
};
|
||||
|
||||
G g = {0, -1, -2};
|
||||
|
||||
void test_char_signed(void)
|
||||
{
|
||||
assert(g.x == 0);
|
||||
assert(g.y == -1);
|
||||
assert(g.z == -2);
|
||||
assert(sizeof(G) == 1);
|
||||
|
||||
for(int i=-16; i<16; i++)
|
||||
{
|
||||
g.x = -1;
|
||||
g.y = i;
|
||||
g.z = 1;
|
||||
assert(g.x == -1);
|
||||
assert(g.y == i);
|
||||
assert(g.z == 1);
|
||||
}
|
||||
}
|
||||
|
||||
struct H
|
||||
{
|
||||
int x : 10;
|
||||
int y : 10;
|
||||
int z : 10;
|
||||
int w : 10;
|
||||
};
|
||||
|
||||
H h = {111, -222, -333, 444};
|
||||
|
||||
void test_word_signed(void)
|
||||
{
|
||||
assert(h.x == 111);
|
||||
assert(h.y == -222);
|
||||
assert(h.z == -333);
|
||||
assert(h.w == 444);
|
||||
assert(sizeof(H) == 5);
|
||||
|
||||
for(int i=-32; i<32; i++)
|
||||
{
|
||||
h.x = i * 1;
|
||||
h.y = i * 3;
|
||||
h.z = i * 5;
|
||||
h.w = i * 7;
|
||||
assert(h.x == i * 1);
|
||||
assert(h.y == i * 3);
|
||||
assert(h.z == i * 5);
|
||||
assert(h.w == i * 7);
|
||||
}
|
||||
}
|
||||
|
||||
void test_inc_char_fit(void)
|
||||
{
|
||||
A ai;
|
||||
ai.x = 7;
|
||||
ai.y = 1;
|
||||
ai.z = 2;
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ai.x == ((7 + i) & 15));
|
||||
assert(ai.y == ((1 + i) & 1));
|
||||
assert(ai.z == ((2 + i) & 7));
|
||||
ai.x++;
|
||||
ai.y++;
|
||||
ai.z++;
|
||||
}
|
||||
}
|
||||
|
||||
void test_inc_char_cross(void)
|
||||
{
|
||||
B bi;
|
||||
bi.x = 11;
|
||||
bi.y = 22;
|
||||
bi.z = 33;
|
||||
bi.w = 44;
|
||||
|
||||
for(int i=0; i<64; i++)
|
||||
{
|
||||
assert(bi.x == ((11 + i) & 0x3f));
|
||||
assert(bi.y == ((22 + i) & 0x3f));
|
||||
assert(bi.z == ((33 + i) & 0x3f));
|
||||
assert(bi.w == ((44 + i) & 0x3f));
|
||||
bi.x++;
|
||||
bi.y++;
|
||||
bi.z++;
|
||||
bi.w++;
|
||||
}
|
||||
}
|
||||
|
||||
void test_add_char_cross(void)
|
||||
{
|
||||
B bi= {0};
|
||||
bi.x = 11;
|
||||
bi.y = 22;
|
||||
bi.z = 33;
|
||||
bi.w = 44;
|
||||
|
||||
for(int i=0; i<64; i++)
|
||||
{
|
||||
assert(bi.x == ((11 + 5 * i) & 0x3f));
|
||||
assert(bi.y == ((22 + 21 * i) & 0x3f));
|
||||
assert(bi.z == ((33 - 4 * i) & 0x3f));
|
||||
assert(bi.w == ((44 - 11 * i) & 0x3f));
|
||||
bi.x += 5;
|
||||
bi.y += 21;
|
||||
bi.z -= 4;
|
||||
bi.w -= 11;
|
||||
}
|
||||
}
|
||||
|
||||
void test_add_word_fit(void)
|
||||
{
|
||||
C ci = {0};
|
||||
|
||||
ci.x = 7;
|
||||
ci.y = 1;
|
||||
ci.z = 2;
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ci.x == ((7 + 5 * i) & 15));
|
||||
assert(ci.y == ((1 + 21 * i) & 1));
|
||||
assert(ci.z == ((2 - 4 * i) & 7));
|
||||
ci.x += 5;
|
||||
ci.y += 21;
|
||||
ci.z -= 4;
|
||||
}
|
||||
}
|
||||
|
||||
void test_add_word_cross(void)
|
||||
{
|
||||
D di = {0};
|
||||
|
||||
di.x = 111;
|
||||
di.y = 222;
|
||||
di.z = 333;
|
||||
di.w = 444;
|
||||
|
||||
for(int i=0; i<1024; i++)
|
||||
{
|
||||
assert(di.x == ((111 + 5 * i) & 0x3ff));
|
||||
assert(di.y == ((222 + 21 * i) & 0x3ff));
|
||||
assert(di.z == ((333 - 4 * i) & 0x3ff));
|
||||
assert(di.w == ((444 - 11 * i) & 0x3ff));
|
||||
di.x += 5;
|
||||
di.y += 21;
|
||||
di.z -= 4;
|
||||
di.w -= 11;
|
||||
}
|
||||
}
|
||||
int main(void)
|
||||
{
|
||||
test_char_fit();
|
||||
test_char_cross();
|
||||
test_word_fit();
|
||||
test_word_cross();
|
||||
test_dword_fit();
|
||||
test_dword_cross();
|
||||
test_char_signed();
|
||||
test_word_signed();
|
||||
|
||||
test_inc_char_fit();
|
||||
test_inc_char_cross();
|
||||
test_add_char_cross();
|
||||
|
||||
test_add_word_fit();
|
||||
test_add_word_cross();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,414 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
#pragma region( main, 0x0a00, 0xd000, , , {code, data, bss, heap, stack} )
|
||||
|
||||
unsigned shl1b(int n)
|
||||
{
|
||||
return 1 << n;
|
||||
}
|
||||
|
||||
unsigned shl1n(int n)
|
||||
{
|
||||
return 1 << n;
|
||||
}
|
||||
|
||||
#pragma native(shl1n)
|
||||
|
||||
unsigned shr1b(int n)
|
||||
{
|
||||
return 0x8000 >> n;
|
||||
}
|
||||
|
||||
unsigned shr1n(int n)
|
||||
{
|
||||
return 0x8000 >> n;
|
||||
}
|
||||
|
||||
#pragma native(shr1n)
|
||||
|
||||
unsigned shl4b(int n)
|
||||
{
|
||||
return 0x0010 << n;
|
||||
}
|
||||
|
||||
unsigned shl4n(int n)
|
||||
{
|
||||
return 0x0010 << n;
|
||||
}
|
||||
|
||||
#pragma native(shl4n)
|
||||
|
||||
unsigned shr4b(int n)
|
||||
{
|
||||
return 0x0800 >> n;
|
||||
}
|
||||
|
||||
unsigned shr4n(int n)
|
||||
{
|
||||
return 0x0800 >> n;
|
||||
}
|
||||
|
||||
#pragma native(shr4n)
|
||||
|
||||
|
||||
unsigned shl8b(int n)
|
||||
{
|
||||
return 0x0100 << n;
|
||||
}
|
||||
|
||||
unsigned shl8n(int n)
|
||||
{
|
||||
return 0x0100 << n;
|
||||
}
|
||||
|
||||
#pragma native(shl8n)
|
||||
|
||||
unsigned shr8b(int n)
|
||||
{
|
||||
return 0x0080 >> n;
|
||||
}
|
||||
|
||||
unsigned shr8n(int n)
|
||||
{
|
||||
return 0x0080 >> n;
|
||||
}
|
||||
|
||||
#pragma native(shr8n)
|
||||
|
||||
|
||||
void shl8xb(unsigned char xu, signed char xi)
|
||||
{
|
||||
unsigned char ua[16];
|
||||
signed char ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu << s;
|
||||
ia[s] = xi << s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == (unsigned char)(xu << i));
|
||||
assert(ia[i] == (signed char)(xi << i));
|
||||
}
|
||||
}
|
||||
|
||||
void shr8xb(unsigned char xu, signed char xi)
|
||||
{
|
||||
unsigned char ua[16];
|
||||
signed char ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu >> s;
|
||||
ia[s] = xi >> s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == (unsigned char)(xu >> i));
|
||||
assert(ia[i] == (signed char)(xi >> i));
|
||||
}
|
||||
}
|
||||
|
||||
void shl8xn(unsigned char xu, signed char xi)
|
||||
{
|
||||
unsigned char ua[16];
|
||||
signed char ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu << s;
|
||||
ia[s] = xi << s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == (unsigned char)(xu << i));
|
||||
assert(ia[i] == (signed char)(xi << i));
|
||||
}
|
||||
}
|
||||
|
||||
void shr8xn(unsigned char xu, signed char xi)
|
||||
{
|
||||
unsigned char ua[16];
|
||||
signed char ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu >> s;
|
||||
ia[s] = xi >> s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == (unsigned char)(xu >> i));
|
||||
assert(ia[i] == (signed char)(xi >> i));
|
||||
}
|
||||
}
|
||||
|
||||
#pragma native(shl8xn)
|
||||
#pragma native(shr8xn)
|
||||
|
||||
|
||||
|
||||
|
||||
void shl16b(unsigned xu, int xi)
|
||||
{
|
||||
unsigned ua[16];
|
||||
int ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu << s;
|
||||
ia[s] = xi << s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == xu << i);
|
||||
assert(ia[i] == xi << i);
|
||||
}
|
||||
}
|
||||
|
||||
void shr16b(unsigned xu, int xi)
|
||||
{
|
||||
unsigned ua[16];
|
||||
int ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu >> s;
|
||||
ia[s] = xi >> s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == xu >> i);
|
||||
assert(ia[i] == xi >> i);
|
||||
}
|
||||
}
|
||||
|
||||
void shl16n(unsigned xu, int xi)
|
||||
{
|
||||
unsigned ua[16];
|
||||
int ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu << s;
|
||||
ia[s] = xi << s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == xu << i);
|
||||
assert(ia[i] == xi << i);
|
||||
}
|
||||
}
|
||||
|
||||
void shr16n(unsigned xu, int xi)
|
||||
{
|
||||
unsigned ua[16];
|
||||
int ia[16];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu >> s;
|
||||
ia[s] = xi >> s;
|
||||
#assign s s + 1
|
||||
#until s == 16
|
||||
|
||||
for(int i=0; i<16; i++)
|
||||
{
|
||||
assert(ua[i] == xu >> i);
|
||||
assert(ia[i] == xi >> i);
|
||||
}
|
||||
}
|
||||
|
||||
#pragma native(shl16n)
|
||||
#pragma native(shr16n)
|
||||
|
||||
|
||||
void shl32b(unsigned long xu, long xi)
|
||||
{
|
||||
unsigned long ua[32];
|
||||
long ia[32];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu << s;
|
||||
ia[s] = xi << s;
|
||||
#assign s s + 1
|
||||
#until s == 32
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
assert(ua[i] == xu << i);
|
||||
assert(ia[i] == xi << i);
|
||||
}
|
||||
}
|
||||
|
||||
void shr32b(unsigned long xu, long xi)
|
||||
{
|
||||
unsigned long ua[32];
|
||||
long ia[32];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu >> s;
|
||||
ia[s] = xi >> s;
|
||||
#assign s s + 1
|
||||
#until s == 32
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
assert(ua[i] == xu >> i);
|
||||
assert(ia[i] == xi >> i);
|
||||
}
|
||||
}
|
||||
|
||||
void shl32n(unsigned long xu, long xi)
|
||||
{
|
||||
unsigned long ua[32];
|
||||
long ia[32];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu << s;
|
||||
ia[s] = xi << s;
|
||||
#assign s s + 1
|
||||
#until s == 32
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
assert(ua[i] == xu << i);
|
||||
assert(ia[i] == xi << i);
|
||||
}
|
||||
}
|
||||
|
||||
void shr32n(unsigned long xu, long xi)
|
||||
{
|
||||
unsigned long ua[32];
|
||||
long ia[32];
|
||||
#assign s 0
|
||||
#repeat
|
||||
ua[s] = xu >> s;
|
||||
ia[s] = xi >> s;
|
||||
#assign s s + 1
|
||||
#until s == 32
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
assert(ua[i] == xu >> i);
|
||||
assert(ia[i] == xi >> i);
|
||||
}
|
||||
}
|
||||
|
||||
void shl1_32n(void)
|
||||
{
|
||||
static const unsigned long m[] = {
|
||||
#for(i, 32) 1ul << i,
|
||||
};
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
assert(1ul << i == m[i]);
|
||||
}
|
||||
}
|
||||
|
||||
#pragma native(shl32n)
|
||||
#pragma native(shr32n)
|
||||
|
||||
int main(void)
|
||||
{
|
||||
*(volatile char *)0x01 = 0x36;
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
printf("1: %.4x : %.4x | %.4x : %.4x\n", shl1b(i), shl1n(i), shr1b(i), shr1n(i));
|
||||
assert(shl1b(i) == shl1n(i));
|
||||
assert(shr1b(i) == shr1n(i));
|
||||
}
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
printf("4: %.4x : %.4x | %.4x : %.4x\n", shl4b(i), shl4n(i), shr4b(i), shr4n(i));
|
||||
assert(shl4b(i) == shl4n(i));
|
||||
assert(shr4b(i) == shr4n(i));
|
||||
}
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
{
|
||||
printf("8: %.4x : %.4x | %.4x : %.4x\n", shl8b(i), shl8n(i), shr8b(i), shr8n(i));
|
||||
assert(shl8b(i) == shl8n(i));
|
||||
assert(shr8b(i) == shr8n(i));
|
||||
}
|
||||
|
||||
shl8xb(0x00, 0x00);
|
||||
shl8xb(0xff, 0xff);
|
||||
shl8xb(0x34, 0x34);
|
||||
shl8xb(0xdc, 0xdc);
|
||||
|
||||
shr8xb(0x00, 0x00);
|
||||
shr8xb(0xff, 0xff);
|
||||
shr8xb(0x34, 0x34);
|
||||
shr8xb(0xdc, 0xdc);
|
||||
|
||||
shl8xn(0x00, 0x00);
|
||||
shl8xn(0xff, 0xff);
|
||||
shl8xn(0x34, 0x34);
|
||||
shl8xn(0xdc, 0xdc);
|
||||
|
||||
shr8xn(0x00, 0x00);
|
||||
shr8xn(0xff, 0xff);
|
||||
shr8xn(0x34, 0x34);
|
||||
shr8xn(0xdc, 0xdc);
|
||||
|
||||
shl16b(0x0000, 0x0000);
|
||||
shl16b(0xffff, 0xffff);
|
||||
shl16b(0x1234, 0x1234);
|
||||
shl16b(0xfedc, 0xfedc);
|
||||
|
||||
shr16b(0x0000, 0x0000);
|
||||
shr16b(0xffff, 0xffff);
|
||||
shr16b(0x1234, 0x1234);
|
||||
shr16b(0xfedc, 0xfedc);
|
||||
|
||||
shl16n(0x0000, 0x0000);
|
||||
|
||||
shl16n(0xffff, 0xffff);
|
||||
shl16n(0x1234, 0x1234);
|
||||
shl16n(0xfedc, 0xfedc);
|
||||
|
||||
shr16n(0x0000, 0x0000);
|
||||
shr16n(0xffff, 0xffff);
|
||||
shr16n(0x1234, 0x1234);
|
||||
shr16n(0xfedc, 0xfedc);
|
||||
|
||||
shl32b(0x00000000UL, 0x00000000L);
|
||||
shl32b(0x00000001UL, 0x00000001L);
|
||||
shl32b(0xffffffffUL, 0xffffffffL);
|
||||
shl32b(0x12345678UL, 0x12345678L);
|
||||
shl32b(0xfedcba98UL, 0xfedcba98L);
|
||||
|
||||
shr32b(0x00000000UL, 0x00000000L);
|
||||
shr32b(0x00000001UL, 0x00000001L);
|
||||
shr32b(0xffffffffUL, 0xffffffffL);
|
||||
shr32b(0x12345678UL, 0x12345678L);
|
||||
shr32b(0xfedcba98UL, 0xfedcba98L);
|
||||
|
||||
shl32n(0x00000000UL, 0x00000000L);
|
||||
shl32n(0x00000001UL, 0x00000001L);
|
||||
shl32n(0xffffffffUL, 0xffffffffL);
|
||||
shl32n(0x12345678UL, 0x12345678L);
|
||||
shl32n(0xfedcba98UL, 0xfedcba98L);
|
||||
|
||||
shr32n(0x00000000UL, 0x00000000L);
|
||||
shr32n(0x00000001UL, 0x00000001L);
|
||||
shr32n(0xffffffffUL, 0xffffffffL);
|
||||
shr32n(0x12345678UL, 0x12345678L);
|
||||
shr32n(0xfedcba98UL, 0xfedcba98L);
|
||||
|
||||
shl1_32n();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
|
||||
#include <string.h>
|
||||
|
||||
char ch[100];
|
||||
char p[] = "HELLO";
|
||||
int v[10];
|
||||
int w[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
|
||||
|
||||
int sum(int * k)
|
||||
{
|
||||
int s = 0;
|
||||
for(int i=0; i<10; i++)
|
||||
s += k[i];
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
strcpy(ch, p);
|
||||
strcat(ch, " WORLD");
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
v[i] = w[i];
|
||||
|
||||
return strcmp(ch, "HELLO WORLD") + sum(v) - 55;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,18 @@
|
||||
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
char a[20];
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(char i=0; i<20; i++)
|
||||
a[i] = i;
|
||||
char x = 0;
|
||||
for(char i=0; i<20; i++)
|
||||
x += a[i];
|
||||
|
||||
assert(x == 190);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,64 @@
|
||||
#include <c64/charwin.h>
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
CharWin cw;
|
||||
|
||||
cwin_init(&cw, (char *)0x0400, 2, 2, 32, 20);
|
||||
|
||||
cwin_clear(&cw);
|
||||
|
||||
for(int y=0; y<20; y++)
|
||||
{
|
||||
for(int x=0; x<32; x++)
|
||||
{
|
||||
assert(cwin_getat_char_raw(&cw, x, y) == ' ');
|
||||
}
|
||||
}
|
||||
|
||||
for(int y=0; y<20; y++)
|
||||
{
|
||||
for(int x=0; x<32; x++)
|
||||
{
|
||||
cwin_putat_char(&cw, x, y, p'a' - 1 + x, 7);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
for(int y=0; y<20; y++)
|
||||
{
|
||||
for(int x=0; x<32; x++)
|
||||
{
|
||||
assert(cwin_getat_char(&cw, x, y) == p'a' -1 + x);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
for(int y=0; y<20; y++)
|
||||
{
|
||||
for(int x=0; x<32; x++)
|
||||
{
|
||||
cwin_putat_char(&cw, x, y, p'A' - 1 + x, 8);
|
||||
}
|
||||
}
|
||||
|
||||
for(int y=0; y<20; y++)
|
||||
{
|
||||
for(int x=0; x<32; x++)
|
||||
{
|
||||
cwin_putat_char_raw(&cw, x, y, x + 32 * y, 8);
|
||||
}
|
||||
}
|
||||
|
||||
for(int y=0; y<8; y++)
|
||||
{
|
||||
for(int x=0; x<32; x++)
|
||||
{
|
||||
assert(cwin_getat_char_raw(&cw, x, y) == x + 32 * y);
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,298 @@
|
||||
#include <assert.h>
|
||||
|
||||
void check_s_lt(void)
|
||||
{
|
||||
int a5 = 0, a10 = 0, a15 = 0;
|
||||
|
||||
for(int i=5; i<15; i++)
|
||||
{
|
||||
if (i < 5)
|
||||
a5++;
|
||||
if (i < 10)
|
||||
a10++;
|
||||
if (i < 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a5 == 0);
|
||||
assert(a10 == 5);
|
||||
assert(a15 == 10);
|
||||
}
|
||||
|
||||
void check_s_le(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(int i=5; i<15; i++)
|
||||
{
|
||||
if (i <= 4)
|
||||
a4++;
|
||||
if (i <= 5)
|
||||
a5++;
|
||||
if (i <= 10)
|
||||
a10++;
|
||||
if (i <= 14)
|
||||
a14++;
|
||||
if (i <= 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 0);
|
||||
assert(a5 == 1);
|
||||
assert(a10 == 6);
|
||||
assert(a14 == 10);
|
||||
assert(a15 == 10);
|
||||
}
|
||||
|
||||
void check_s_ge(void)
|
||||
{
|
||||
int a5 = 0, a10 = 0, a15 = 0;
|
||||
|
||||
for(int i=5; i<15; i++)
|
||||
{
|
||||
if (i >= 5)
|
||||
a5++;
|
||||
if (i >= 10)
|
||||
a10++;
|
||||
if (i >= 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a5 == 10);
|
||||
assert(a10 == 5);
|
||||
assert(a15 == 0);
|
||||
}
|
||||
|
||||
void check_s_gt(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(int i=5; i<15; i++)
|
||||
{
|
||||
if (i > 4)
|
||||
a4++;
|
||||
if (i > 5)
|
||||
a5++;
|
||||
if (i > 10)
|
||||
a10++;
|
||||
if (i > 14)
|
||||
a14++;
|
||||
if (i > 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 10);
|
||||
assert(a5 == 9);
|
||||
assert(a10 == 4);
|
||||
assert(a14 == 0);
|
||||
assert(a15 == 0);
|
||||
}
|
||||
|
||||
void check_s_eq(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(int i=5; i<15; i++)
|
||||
{
|
||||
if (i == 4)
|
||||
a4++;
|
||||
if (i == 5)
|
||||
a5++;
|
||||
if (i == 10)
|
||||
a10++;
|
||||
if (i == 14)
|
||||
a14++;
|
||||
if (i == 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 0);
|
||||
assert(a5 == 1);
|
||||
assert(a10 == 1);
|
||||
assert(a14 == 1);
|
||||
assert(a15 == 0);
|
||||
}
|
||||
|
||||
void check_s_ne(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(int i=5; i<15; i++)
|
||||
{
|
||||
if (i != 4)
|
||||
a4++;
|
||||
if (i != 5)
|
||||
a5++;
|
||||
if (i != 10)
|
||||
a10++;
|
||||
if (i != 14)
|
||||
a14++;
|
||||
if (i != 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 10);
|
||||
assert(a5 == 9);
|
||||
assert(a10 == 9);
|
||||
assert(a14 == 9);
|
||||
assert(a15 == 10);
|
||||
}
|
||||
|
||||
void check_u_lt(void)
|
||||
{
|
||||
int a5 = 0, a10 = 0, a15 = 0;
|
||||
|
||||
for(unsigned i=5; i<15; i++)
|
||||
{
|
||||
if (i < 5)
|
||||
a5++;
|
||||
if (i < 10)
|
||||
a10++;
|
||||
if (i < 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a5 == 0);
|
||||
assert(a10 == 5);
|
||||
assert(a15 == 10);
|
||||
}
|
||||
|
||||
void check_u_le(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(unsigned i=5; i<15; i++)
|
||||
{
|
||||
if (i <= 4)
|
||||
a4++;
|
||||
if (i <= 5)
|
||||
a5++;
|
||||
if (i <= 10)
|
||||
a10++;
|
||||
if (i <= 14)
|
||||
a14++;
|
||||
if (i <= 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 0);
|
||||
assert(a5 == 1);
|
||||
assert(a10 == 6);
|
||||
assert(a14 == 10);
|
||||
assert(a15 == 10);
|
||||
}
|
||||
|
||||
void check_u_ge(void)
|
||||
{
|
||||
int a5 = 0, a10 = 0, a15 = 0;
|
||||
|
||||
for(unsigned i=5; i<15; i++)
|
||||
{
|
||||
if (i >= 5)
|
||||
a5++;
|
||||
if (i >= 10)
|
||||
a10++;
|
||||
if (i >= 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a5 == 10);
|
||||
assert(a10 == 5);
|
||||
assert(a15 == 0);
|
||||
}
|
||||
|
||||
void check_u_gt(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(unsigned i=5; i<15; i++)
|
||||
{
|
||||
if (i > 4)
|
||||
a4++;
|
||||
if (i > 5)
|
||||
a5++;
|
||||
if (i > 10)
|
||||
a10++;
|
||||
if (i > 14)
|
||||
a14++;
|
||||
if (i > 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 10);
|
||||
assert(a5 == 9);
|
||||
assert(a10 == 4);
|
||||
assert(a14 == 0);
|
||||
assert(a15 == 0);
|
||||
}
|
||||
|
||||
void check_u_eq(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(unsigned i=5; i<15; i++)
|
||||
{
|
||||
if (i == 4)
|
||||
a4++;
|
||||
if (i == 5)
|
||||
a5++;
|
||||
if (i == 10)
|
||||
a10++;
|
||||
if (i == 14)
|
||||
a14++;
|
||||
if (i == 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 0);
|
||||
assert(a5 == 1);
|
||||
assert(a10 == 1);
|
||||
assert(a14 == 1);
|
||||
assert(a15 == 0);
|
||||
}
|
||||
|
||||
void check_u_ne(void)
|
||||
{
|
||||
int a4 = 0, a5 = 0, a10 = 0, a14 = 0, a15 = 0;
|
||||
|
||||
for(unsigned i=5; i<15; i++)
|
||||
{
|
||||
if (i != 4)
|
||||
a4++;
|
||||
if (i != 5)
|
||||
a5++;
|
||||
if (i != 10)
|
||||
a10++;
|
||||
if (i != 14)
|
||||
a14++;
|
||||
if (i != 15)
|
||||
a15++;
|
||||
}
|
||||
|
||||
assert(a4 == 10);
|
||||
assert(a5 == 9);
|
||||
assert(a10 == 9);
|
||||
assert(a14 == 9);
|
||||
assert(a15 == 10);
|
||||
}
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
check_s_ne();
|
||||
check_s_eq();
|
||||
check_s_lt();
|
||||
check_s_le();
|
||||
check_s_gt();
|
||||
check_s_ge();
|
||||
|
||||
check_u_ne();
|
||||
check_u_eq();
|
||||
check_u_lt();
|
||||
check_u_le();
|
||||
check_u_gt();
|
||||
check_u_ge();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,32 @@
|
||||
#include <assert.h>
|
||||
#include <stdbool.h>
|
||||
|
||||
static int counter;
|
||||
|
||||
static int read_const_local_twice(void)
|
||||
{
|
||||
const int value = ++counter;
|
||||
return value + value;
|
||||
}
|
||||
|
||||
static bool update(unsigned char* value)
|
||||
{
|
||||
const unsigned char before = *value;
|
||||
const unsigned char after = before + 2;
|
||||
const bool changed = after != before;
|
||||
|
||||
*value = after;
|
||||
return changed;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
assert(read_const_local_twice() == 2);
|
||||
assert(counter == 1);
|
||||
|
||||
unsigned char value = 7;
|
||||
assert(update(&value));
|
||||
assert(value == 9);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,165 @@
|
||||
#include <assert.h>
|
||||
|
||||
int t, n;
|
||||
|
||||
struct C1
|
||||
{
|
||||
int a;
|
||||
|
||||
C1(int x);
|
||||
~C1(void);
|
||||
};
|
||||
|
||||
C1::C1(int x) : a(x)
|
||||
{
|
||||
t += a;
|
||||
n++;
|
||||
}
|
||||
|
||||
C1::~C1(void)
|
||||
{
|
||||
t -= a;
|
||||
}
|
||||
|
||||
void test_base(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C1 x(2);
|
||||
C1 y(1);
|
||||
}
|
||||
|
||||
assert(t == 0 && n == 2);
|
||||
}
|
||||
|
||||
void test_base_loop(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
C1 x(2);
|
||||
C1 y(1);
|
||||
}
|
||||
|
||||
assert(t == 0 && n == 20);
|
||||
}
|
||||
|
||||
struct C2
|
||||
{
|
||||
C1 c, d;
|
||||
|
||||
C2(void);
|
||||
};
|
||||
|
||||
C2::C2(void)
|
||||
: c(7), d(11)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
void test_member(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 x();
|
||||
C2 y();
|
||||
}
|
||||
|
||||
assert(t == 0 && n == 4);
|
||||
}
|
||||
|
||||
void test_member_loop(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
C2 x();
|
||||
C2 y();
|
||||
}
|
||||
|
||||
assert(t == 0 && n == 40);
|
||||
}
|
||||
|
||||
struct C3
|
||||
{
|
||||
C2 x, y;
|
||||
};
|
||||
|
||||
void test_default(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C3 x();
|
||||
C3 y();
|
||||
}
|
||||
|
||||
assert(t == 0 && n == 8);
|
||||
}
|
||||
|
||||
void test_default_loop(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
C3 x();
|
||||
C3 y();
|
||||
}
|
||||
|
||||
assert(t == 0 && n == 80);
|
||||
}
|
||||
|
||||
inline void test_inline_x(void)
|
||||
{
|
||||
C1 x(1), y(2);
|
||||
}
|
||||
|
||||
void test_inline(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
test_inline_x();
|
||||
|
||||
assert(t == 0 && n == 2);
|
||||
}
|
||||
|
||||
inline void test_inline_xr(void)
|
||||
{
|
||||
C1 x(1), y(2);
|
||||
|
||||
{
|
||||
C1 x(3);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
void test_inline_return(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
test_inline_xr();
|
||||
|
||||
assert(t == 0 && n == 3);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test_base();
|
||||
test_base_loop();
|
||||
|
||||
test_member();
|
||||
test_member_loop();
|
||||
|
||||
test_default();
|
||||
test_default_loop();
|
||||
|
||||
test_inline();
|
||||
test_inline_return();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,126 @@
|
||||
#include <assert.h>
|
||||
|
||||
int t, n;
|
||||
|
||||
struct C0
|
||||
{
|
||||
int u;
|
||||
|
||||
C0(int a);
|
||||
~C0(void);
|
||||
};
|
||||
|
||||
C0::C0(int a) : u(a)
|
||||
{
|
||||
t += u;
|
||||
n++;
|
||||
}
|
||||
|
||||
C0::~C0(void)
|
||||
{
|
||||
t -= u;
|
||||
}
|
||||
|
||||
struct C1
|
||||
{
|
||||
int u;
|
||||
|
||||
C1(int a);
|
||||
~C1(void);
|
||||
C1(const C1 & c);
|
||||
C1 & operator=(const C1 & c);
|
||||
};
|
||||
|
||||
C1::C1(int a) : u(a)
|
||||
{
|
||||
t += u;
|
||||
n++;
|
||||
}
|
||||
|
||||
C1::~C1(void)
|
||||
{
|
||||
t -= u;
|
||||
}
|
||||
|
||||
C1::C1(const C1 & c) : u(c.u)
|
||||
{
|
||||
t += u;
|
||||
n++;
|
||||
}
|
||||
|
||||
C1 & C1::operator=(const C1 & c)
|
||||
{
|
||||
t -= u;
|
||||
u = c.u;
|
||||
t += u;
|
||||
return *this;
|
||||
}
|
||||
|
||||
void test_assign(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C1 c(4);
|
||||
C1 d(5);
|
||||
c = d;
|
||||
}
|
||||
|
||||
assert(n == 2 && t == 0);
|
||||
}
|
||||
|
||||
struct C2
|
||||
{
|
||||
C1 a, b;
|
||||
|
||||
C2(int x, int y) : a(x), b(y)
|
||||
{}
|
||||
};
|
||||
|
||||
void test_assign_deflt(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 c(2, 3);
|
||||
C2 d(5, 10);
|
||||
c = d;
|
||||
}
|
||||
|
||||
assert(n == 4 && t == 0);
|
||||
}
|
||||
|
||||
int k;
|
||||
|
||||
C2 test_ret_v(void)
|
||||
{
|
||||
C2 c(5, 10);
|
||||
return c;
|
||||
}
|
||||
|
||||
C2 & test_ret_r(C2 & r)
|
||||
{
|
||||
return r;
|
||||
}
|
||||
|
||||
void test_assign_return_value(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 c(2, 3);
|
||||
c = test_ret_v();
|
||||
}
|
||||
|
||||
assert(n == 6 && t == 0);
|
||||
}
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test_assign();
|
||||
test_assign_deflt();
|
||||
test_assign_return_value();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,215 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int t, n;
|
||||
|
||||
struct C0
|
||||
{
|
||||
int u;
|
||||
|
||||
C0(int a);
|
||||
~C0(void);
|
||||
};
|
||||
|
||||
C0::C0(int a) : u(a)
|
||||
{
|
||||
t += u;
|
||||
n++;
|
||||
}
|
||||
|
||||
C0::~C0(void)
|
||||
{
|
||||
t -= u;
|
||||
}
|
||||
|
||||
struct C1
|
||||
{
|
||||
int u;
|
||||
|
||||
C1(int a);
|
||||
~C1(void);
|
||||
C1(const C1 & c);
|
||||
};
|
||||
|
||||
C1::C1(int a) : u(a)
|
||||
{
|
||||
t += u;
|
||||
n++;
|
||||
}
|
||||
|
||||
C1::~C1(void)
|
||||
{
|
||||
t -= u;
|
||||
}
|
||||
|
||||
C1::C1(const C1 & c) : u(c.u)
|
||||
{
|
||||
t += u;
|
||||
n++;
|
||||
}
|
||||
|
||||
void test_dcopy_init(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C0 x(4);
|
||||
C0 y(x);
|
||||
}
|
||||
|
||||
assert(n == 1 && t == -4);
|
||||
|
||||
t = 0;
|
||||
}
|
||||
|
||||
void test_copy_init(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C1 x(4);
|
||||
C1 y(x);
|
||||
}
|
||||
|
||||
assert(n == 2 && t == 0);
|
||||
}
|
||||
|
||||
struct C2
|
||||
{
|
||||
C1 a, b;
|
||||
|
||||
C2(void);
|
||||
};
|
||||
|
||||
C2::C2(void) : a(1), b(3)
|
||||
{}
|
||||
|
||||
void test_minit(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 x;
|
||||
}
|
||||
|
||||
assert(n == 2 && t == 0);
|
||||
}
|
||||
|
||||
void test_minit_copy(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 x;
|
||||
C2 y(x);
|
||||
}
|
||||
|
||||
assert(n == 4 && t == 0);
|
||||
}
|
||||
|
||||
int k;
|
||||
|
||||
void test_param_fv(C2 c)
|
||||
{
|
||||
k += c.a.u;
|
||||
}
|
||||
|
||||
void test_param_fr(C2 & c)
|
||||
{
|
||||
k += c.a.u;
|
||||
}
|
||||
|
||||
void test_param_value(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 x;
|
||||
test_param_fv(x);
|
||||
}
|
||||
|
||||
assert(n == 4 && t == 0);
|
||||
}
|
||||
|
||||
void test_param_ref(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 x;
|
||||
test_param_fr(x);
|
||||
}
|
||||
|
||||
assert(n == 2 && t == 0);
|
||||
}
|
||||
|
||||
C2 test_ret_v(void)
|
||||
{
|
||||
C2 c;
|
||||
return c;
|
||||
}
|
||||
|
||||
C2 & test_ret_r(C2 & r)
|
||||
{
|
||||
return r;
|
||||
}
|
||||
|
||||
void test_return_value(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 c(test_ret_v());
|
||||
}
|
||||
|
||||
assert(n == 6 && t == 0);
|
||||
}
|
||||
|
||||
void test_return_reference(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
C2 d;
|
||||
C2 c(test_ret_r(d));
|
||||
}
|
||||
|
||||
assert(n == 2 && t == 0);
|
||||
}
|
||||
|
||||
void test_retparam_value(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
test_param_fv(test_ret_v());
|
||||
}
|
||||
|
||||
assert(n == 6 && t == 0);
|
||||
}
|
||||
|
||||
void test_retparam_reference(void)
|
||||
{
|
||||
n = 0;
|
||||
|
||||
{
|
||||
test_param_fr(test_ret_v());
|
||||
}
|
||||
|
||||
assert(n == 4 && t == 0);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test_dcopy_init();
|
||||
test_copy_init();
|
||||
test_minit();
|
||||
test_minit_copy();
|
||||
test_param_value();
|
||||
test_param_ref();
|
||||
test_return_value();
|
||||
test_retparam_value();
|
||||
test_retparam_reference();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
|
||||
int val(char * c)
|
||||
{
|
||||
return c[0];
|
||||
}
|
||||
|
||||
void set(char * c, int a)
|
||||
{
|
||||
c[0] = a;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
char t[10] = {1};
|
||||
sum0 += val(t);
|
||||
sum2 += t[0];
|
||||
set(t, i);
|
||||
sum1 += val(t);
|
||||
sum3 += t[0];
|
||||
}
|
||||
|
||||
return (sum1 - 45) | (sum0 - 10) | (sum3 - 45) | (sum2 - 10);
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
|
||||
|
||||
void copyi(int * a, int * b, int n)
|
||||
{
|
||||
for(int i=0; i<n; i++)
|
||||
b[i] = a[i];
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int t[100], s[100];
|
||||
for(int i=0; i<100; i++)
|
||||
s[i] = i;
|
||||
copyi(s, t, 100);
|
||||
int sum = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
sum += t[i];
|
||||
|
||||
return sum - 4950;
|
||||
}
|
||||
@@ -0,0 +1,97 @@
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
#include <assert.h>
|
||||
|
||||
struct cplx
|
||||
{
|
||||
float r, i;
|
||||
};
|
||||
|
||||
cplx cplx_add(cplx a, cplx b)
|
||||
{
|
||||
cplx c;
|
||||
c.r = a.r + b.r;
|
||||
c.i = a.i + b.i;
|
||||
return c;
|
||||
}
|
||||
|
||||
cplx cplx_sub(cplx a, cplx b)
|
||||
{
|
||||
cplx c;
|
||||
c.r = a.r - b.r;
|
||||
c.i = a.i - b.i;
|
||||
return c;
|
||||
}
|
||||
|
||||
cplx cplx_mul(cplx a, cplx b)
|
||||
{
|
||||
cplx c;
|
||||
c.r = a.r * b.r - a.i * b.i;
|
||||
c.i = a.i * b.r + a.r * b.i;
|
||||
return c;
|
||||
}
|
||||
|
||||
float cplx_abs(cplx a)
|
||||
{
|
||||
return sqrt(a.r * a.r + a.i * a.i);
|
||||
}
|
||||
|
||||
cplx cplx_sum(cplx p, const cplx * a, int n)
|
||||
{
|
||||
cplx s = {0.0, 0.0};
|
||||
cplx c = {1.0, 0.0};
|
||||
|
||||
for(int i=0; i<n; i++)
|
||||
{
|
||||
s = cplx_add(s, cplx_mul(a[i], c));
|
||||
c = cplx_mul(c, p);
|
||||
}
|
||||
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
cplx sig[100];
|
||||
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
sig[i].r = cos(i * 1.3);
|
||||
sig[i].i = sin(i * 1.3);
|
||||
}
|
||||
|
||||
cplx c = {1.0, 0.0};
|
||||
float phi = 0.1 * PI;
|
||||
cplx t;
|
||||
t.r = cos(phi); t.i = sin(phi);
|
||||
|
||||
float p[20], q[20];
|
||||
|
||||
for(int i=0; i<20; i++)
|
||||
{
|
||||
p[i] = cplx_abs(cplx_sum(c, sig, 100));
|
||||
c = cplx_mul(c, t);
|
||||
}
|
||||
|
||||
for(int i=0; i<20; i++)
|
||||
{
|
||||
float sumr = 0.0, sumi = 0.0;
|
||||
for(int j=0; j<100; j++)
|
||||
{
|
||||
float co = cos(i * j * 0.1 * PI), si = sin(i * j * 0.1 * PI);
|
||||
sumr += co * sig[j].r - si * sig[j].i;
|
||||
sumi += si * sig[j].r + co * sig[j].i;
|
||||
}
|
||||
q[i] = sqrt(sumr * sumr + sumi * sumi);
|
||||
}
|
||||
#if 1
|
||||
for(int i=0; i<20; i++)
|
||||
{
|
||||
printf("%d, %f - %f\n", i, p[i], q[i]);
|
||||
}
|
||||
#endif
|
||||
for(int i=0; i<20; i++)
|
||||
assert(fabs(p[i] - q[i]) < 1.0);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,36 @@
|
||||
#include <assert.h>
|
||||
|
||||
void check(unsigned long l, unsigned long r)
|
||||
{
|
||||
unsigned long d = l / r, m = l % r;
|
||||
|
||||
assert(d * r + m == l);
|
||||
assert(m < r);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(char i=0; i<28; i++)
|
||||
{
|
||||
for(char j=0; j<28; j++)
|
||||
{
|
||||
check(0xb3ul << i, 0x2bul << j);
|
||||
check(0xb3ul << i, 0x01ul << j);
|
||||
check(0x01ul << i, 0xc2ul << j);
|
||||
check(0xb31ful << i, 0x2bul << j);
|
||||
check(0xb354ul << i, 0x01ul << j);
|
||||
check(0xb3ul << i, 0x2b1cul << j);
|
||||
check(0xb3ul << i, 0x013ful << j);
|
||||
check(0xb31ful << i, 0x2b23ul << j);
|
||||
check(0xb354ul << i, 0x0145ul << j);
|
||||
check(0xb31f24ul << i, 0x2bul << j);
|
||||
check(0xb35421ul << i, 0x01ul << j);
|
||||
check(0xb31f24ul << i, 0x2b23ul << j);
|
||||
check(0xb35421ul << i, 0x0145ul << j);
|
||||
check(0xb31f24ul << i, 0x2b2356ul << j);
|
||||
check(0xb35421ul << i, 0x0145a7ul << j);
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,39 @@
|
||||
#include <assert.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(unsigned i=0; i<256; i+=11)
|
||||
{
|
||||
for(unsigned j=1; j<256; j++)
|
||||
{
|
||||
unsigned q = i / j, r = i % j;
|
||||
|
||||
assert(q * j + r == i);
|
||||
assert(r >= 0 && r < j);
|
||||
}
|
||||
}
|
||||
|
||||
for(unsigned i=0; i<7000; i+=11)
|
||||
{
|
||||
for(unsigned j=1; j<i; j*=3)
|
||||
{
|
||||
unsigned q = i / j, r = i % j;
|
||||
|
||||
assert(q * j + r == i);
|
||||
assert(r >= 0 && r < j);
|
||||
}
|
||||
}
|
||||
|
||||
for(unsigned i=0; i<64000; i+=121)
|
||||
{
|
||||
for(unsigned j=1; j<i; j*=3)
|
||||
{
|
||||
unsigned q = i / j, r = i % j;
|
||||
|
||||
assert(q * j + r == i);
|
||||
assert(r >= 0 && r < j);
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
enum E {
|
||||
e1, e2, e3, e4
|
||||
};
|
||||
|
||||
int check(E e)
|
||||
{
|
||||
switch(e)
|
||||
{
|
||||
case e1:
|
||||
return 10;
|
||||
case e2:
|
||||
return 20;
|
||||
case e3:
|
||||
return 30;
|
||||
default:
|
||||
return 100;
|
||||
}
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
return check(e1) + check(e2) + check(e3) + check(e4) - 160;
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int p1(int a, int b)
|
||||
{
|
||||
return a + b;
|
||||
}
|
||||
|
||||
int p2(int a, int b)
|
||||
{
|
||||
return a * b;
|
||||
}
|
||||
|
||||
int c1(int x)
|
||||
{
|
||||
return x;
|
||||
}
|
||||
|
||||
int c2(int x)
|
||||
{
|
||||
return c1(x);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
return p1(5, p2(c2(2), c2(4))) - 13;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,90 @@
|
||||
#include <fixmath.h>
|
||||
#include <assert.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
unsigned tval[] = {
|
||||
1, 2, 16, 128, 255, 256, 4096, 32768, 65535
|
||||
};
|
||||
|
||||
void testmuldiv16u(void)
|
||||
{
|
||||
for (char i=0; i<9; i++)
|
||||
{
|
||||
assert(lmuldiv16u(tval[i], 0, tval[i]) == 0);
|
||||
assert(lmuldiv16u(0, tval[i], tval[i]) == 0);
|
||||
for(char j=0; j<9; j++)
|
||||
{
|
||||
assert(lmuldiv16u(tval[i], tval[j], tval[i]) == tval[j]);
|
||||
assert(lmuldiv16u(tval[j], tval[i], tval[i]) == tval[j]);
|
||||
}
|
||||
}
|
||||
|
||||
for(int i=0; i<10000; i++)
|
||||
{
|
||||
unsigned a = rand();
|
||||
unsigned b = rand();
|
||||
unsigned c = rand();
|
||||
if (c > 0)
|
||||
{
|
||||
unsigned long d = (unsigned long)a * (unsigned long) b / c;
|
||||
if (d < 0x10000l)
|
||||
assert(lmuldiv16u(a, b, c) == d);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
unsigned ival[] = {
|
||||
1, 2, 16, 128, 255, 256, 4096, 32767,
|
||||
-1, -2, -16, -128, -255, -256, -4096, -32767
|
||||
};
|
||||
|
||||
void testmuldiv16s(void)
|
||||
{
|
||||
for (char i=0; i<16; i++)
|
||||
{
|
||||
assert(lmuldiv16s(ival[i], 0, ival[i]) == 0);
|
||||
assert(lmuldiv16s(0, ival[i], ival[i]) == 0);
|
||||
for(char j=0; j<16; j++)
|
||||
{
|
||||
assert(lmuldiv16s(ival[i], ival[j], ival[i]) == ival[j]);
|
||||
assert(lmuldiv16s(ival[j], ival[i], ival[i]) == ival[j]);
|
||||
}
|
||||
}
|
||||
|
||||
for(int i=0; i<10000; i++)
|
||||
{
|
||||
int a = rand();
|
||||
int b = rand();
|
||||
int c = rand();
|
||||
|
||||
if (c > 0)
|
||||
{
|
||||
long d = (long)a * (long)b / c;
|
||||
if (d >= -32768 && d <= 32767)
|
||||
assert(lmuldiv16s(a, b, c) == d);
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
void testlmul4f12s(void)
|
||||
{
|
||||
for(int i=0; i<20000; i++)
|
||||
{
|
||||
int a = rand();
|
||||
int b = rand();
|
||||
|
||||
long d = ((long)a * (long)b) >> 12;
|
||||
if (d >= -32768 && d <= 32767)
|
||||
assert(lmul4f12s(a, b) == d);
|
||||
}
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
testlmul4f12s();
|
||||
testmuldiv16u();
|
||||
testmuldiv16s();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,135 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
bool feq(float a, float b)
|
||||
{
|
||||
return a == b;
|
||||
}
|
||||
|
||||
bool flt(float a, float b)
|
||||
{
|
||||
return a < b;
|
||||
}
|
||||
|
||||
bool fle(float a, float b)
|
||||
{
|
||||
return a <= b;
|
||||
}
|
||||
|
||||
bool fgt(float a, float b)
|
||||
{
|
||||
return a > b;
|
||||
}
|
||||
|
||||
bool fge(float a, float b)
|
||||
{
|
||||
return a >= b;
|
||||
}
|
||||
|
||||
|
||||
volatile float f;
|
||||
|
||||
inline void cmpflt(float a, float b, bool eq, bool lt, bool gt)
|
||||
{
|
||||
bool le = eq || lt;
|
||||
bool ge = eq || gt;
|
||||
|
||||
assert(feq(a, b) == eq);
|
||||
assert(flt(a, b) == lt);
|
||||
assert(fgt(a, b) == gt);
|
||||
assert(fle(a, b) == le);
|
||||
assert(fge(a, b) == ge);
|
||||
|
||||
f = a;
|
||||
|
||||
assert(feq(f, b) == eq);
|
||||
assert(flt(f, b) == lt);
|
||||
assert(fgt(f, b) == gt);
|
||||
assert(fle(f, b) == le);
|
||||
assert(fge(f, b) == ge);
|
||||
|
||||
f = b;
|
||||
|
||||
assert(feq(a, f) == eq);
|
||||
assert(flt(a, f) == lt);
|
||||
assert(fgt(a, f) == gt);
|
||||
assert(fle(a, f) == le);
|
||||
assert(fge(a, f) == ge);
|
||||
}
|
||||
|
||||
__noinline void test1(void)
|
||||
{
|
||||
cmpflt( 0.0, 1.0, false, true, false);
|
||||
cmpflt( 0.0, -1.0, false, false, true);
|
||||
cmpflt( 1.0, 0.0, false, false, true);
|
||||
cmpflt(-1.0, 0.0, false, true, false);
|
||||
}
|
||||
|
||||
__noinline void test2(void)
|
||||
{
|
||||
cmpflt( 1.0, 1.0, true, false, false);
|
||||
cmpflt( 1.0, 2.0, false, true, false);
|
||||
cmpflt( 2.0, 1.0, false, false, true);
|
||||
}
|
||||
|
||||
__noinline void test3(void)
|
||||
{
|
||||
|
||||
cmpflt(-1.0, -1.0, true, false, false);
|
||||
cmpflt(-1.0, -2.0, false, false, true);
|
||||
cmpflt(-2.0, -1.0, false, true, false);
|
||||
}
|
||||
|
||||
__noinline void test4(void)
|
||||
{
|
||||
|
||||
cmpflt( 1.0, -1.0, false, false, true);
|
||||
cmpflt( 1.0, -2.0, false, false, true);
|
||||
cmpflt( 2.0, -1.0, false, false, true);
|
||||
}
|
||||
|
||||
__noinline void test5(void)
|
||||
{
|
||||
|
||||
cmpflt(-1.0, 1.0, false, true, false);
|
||||
cmpflt(-1.0, 2.0, false, true, false);
|
||||
cmpflt(-2.0, 1.0, false, true, false);
|
||||
}
|
||||
|
||||
__noinline void test6(void)
|
||||
{
|
||||
cmpflt( 0.0, 0.0, true, false, false);
|
||||
cmpflt(-0.0, 0.0, true, false, false);
|
||||
cmpflt( 0.0, -0.0, true, false, false);
|
||||
cmpflt(-0.0, -0.0, true, false, false);
|
||||
}
|
||||
|
||||
__noinline void test7(void)
|
||||
{
|
||||
cmpflt( 1.0, 1.000001, false, true, false);
|
||||
cmpflt( 1.000001, 1.0, false, false, true);
|
||||
cmpflt( 1.000001, 1.000001, true, false, false);
|
||||
}
|
||||
|
||||
__noinline void test8(void)
|
||||
{
|
||||
|
||||
cmpflt( -1.0, -1.000001, false, false, true);
|
||||
cmpflt( -1.000001, -1.0, false, true, false);
|
||||
cmpflt( -1.000001, -1.000001, true, false, false);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test1();
|
||||
test2();
|
||||
test3();
|
||||
test4();
|
||||
test5();
|
||||
test6();
|
||||
test7();
|
||||
test8();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,100 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
float a;
|
||||
int i;
|
||||
long li;
|
||||
unsigned u;
|
||||
unsigned long lu;
|
||||
|
||||
a = 1.0;
|
||||
i = 1;
|
||||
for(int j=0; j<15; j++)
|
||||
{
|
||||
assert(i == (int)a);
|
||||
assert(a == (float)i);
|
||||
a *= 2.0;
|
||||
i <<= 1;
|
||||
}
|
||||
|
||||
a = -1.0;
|
||||
i = -1;
|
||||
for(int j=0; j<15; j++)
|
||||
{
|
||||
assert(i == (int)a);
|
||||
assert(a == (float)i);
|
||||
a *= 2.0;
|
||||
i <<= 1;
|
||||
}
|
||||
|
||||
a = 1.0;
|
||||
i = 1;
|
||||
for(int j=0; j<15; j++)
|
||||
{
|
||||
assert(i == (int)a);
|
||||
assert(a == (float)i);
|
||||
a *= 2.0;
|
||||
a += 1.0;
|
||||
i <<= 1;
|
||||
i += 1;
|
||||
}
|
||||
|
||||
|
||||
a = 1.0;
|
||||
u = 1;
|
||||
for(int j=0; j<16; j++)
|
||||
{
|
||||
assert(u == (unsigned)a);
|
||||
assert(a == (float)u);
|
||||
a *= 2.0;
|
||||
u <<= 1;
|
||||
}
|
||||
|
||||
a = 1.0;
|
||||
u = 1;
|
||||
for(int j=0; j<16; j++)
|
||||
{
|
||||
assert(u == (unsigned)a);
|
||||
assert(a == (float)u);
|
||||
a *= 2.0;
|
||||
a += 1;
|
||||
u <<= 1;
|
||||
u += 1;
|
||||
}
|
||||
|
||||
a = 1.0;
|
||||
li = 1;
|
||||
for(int j=0; j<31; j++)
|
||||
{
|
||||
assert(li == (long)a);
|
||||
assert(a == (float)li);
|
||||
a *= 2.0;
|
||||
li <<= 1;
|
||||
}
|
||||
|
||||
a = -1.0;
|
||||
li = -1;
|
||||
for(int j=0; j<31; j++)
|
||||
{
|
||||
assert(li == (long)a);
|
||||
assert(a == (float)li);
|
||||
a *= 2.0;
|
||||
li <<= 1;
|
||||
}
|
||||
|
||||
a = 1.0;
|
||||
lu = 1;
|
||||
for(int j=0; j<32; j++)
|
||||
{
|
||||
assert(lu == (unsigned long)a);
|
||||
assert(a == (float)lu);
|
||||
a *= 2.0;
|
||||
lu <<= 1;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
|
||||
float c = 1.25;
|
||||
float d = 1.0001;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int i;
|
||||
float a = 0.0;
|
||||
|
||||
for(i=0; i<50; i++)
|
||||
{
|
||||
printf("%d %f %f %f\n", i, i * c, a, i * c - a);
|
||||
assert(i * c == a);
|
||||
a += c;
|
||||
}
|
||||
|
||||
a = d;
|
||||
|
||||
for(i=1; i<50; i++)
|
||||
{
|
||||
printf("%d %f %f %f\n", i, i * d, a, fabs(i * d - a) / i);
|
||||
assert(fabs(i * d - a) < i * 1.0e-6);
|
||||
a += d;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,32 @@
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
printf("%f\n", 0.0);
|
||||
|
||||
|
||||
float x = 1.0, y = 1.0;
|
||||
|
||||
char xb[20], yb[20];
|
||||
for(int i=0; i<40; i++)
|
||||
{
|
||||
ftoa(x, xb); float xr = atof(xb);
|
||||
ftoa(y, yb); float yr = atof(yb);
|
||||
|
||||
printf("%20g (%s) %20g : %20g (%s) %20g : %10f %10f \n", x, xb, xr, y, yb, yr, fabs(x - xr) / x, fabs(y - yr) / y);
|
||||
|
||||
if (fabs(x - xr) / x > 0.00001 || fabs(y - yr) / y > 0.00001)
|
||||
return -1;
|
||||
|
||||
x *= 2.5;
|
||||
y *= 0.8;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
@@ -0,0 +1,13 @@
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int y=1; y<100; y++)
|
||||
{
|
||||
float fz = 100.0 / (float)y;
|
||||
printf("%d %f %f\n", y, floor(fz * 100.0), fz * 100.0);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
|
||||
int (*funcs[10])(int);
|
||||
|
||||
#assign x 0
|
||||
#repeat
|
||||
int f##x(int i)
|
||||
{
|
||||
return i + x;
|
||||
}
|
||||
#assign x x + 1
|
||||
#until x == 10
|
||||
|
||||
int test(int k)
|
||||
{
|
||||
for(char i=0; i<10; i++)
|
||||
k = funcs[i](k);
|
||||
return k;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
#assign x 0
|
||||
#repeat
|
||||
funcs[x] = f##x;
|
||||
#assign x x + 1
|
||||
#until x == 10
|
||||
|
||||
int k = test(-45);
|
||||
return k;
|
||||
}
|
||||
@@ -0,0 +1,72 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
typedef float (*fop)(float a, float b);
|
||||
|
||||
float fadd(float a, float b)
|
||||
{
|
||||
return a + b;
|
||||
}
|
||||
|
||||
float fmul(float a, float b)
|
||||
{
|
||||
return a * b;
|
||||
}
|
||||
|
||||
|
||||
struct FNode
|
||||
{
|
||||
FNode * left, * right;
|
||||
float value;
|
||||
fop call;
|
||||
};
|
||||
|
||||
FNode * root;
|
||||
|
||||
float fevalB(FNode * f)
|
||||
{
|
||||
if (f->call)
|
||||
return f->call(fevalB(f->left), fevalB(f->right));
|
||||
else
|
||||
return f->value;
|
||||
}
|
||||
|
||||
float fevalN(FNode * f)
|
||||
{
|
||||
if (f->call)
|
||||
return f->call(fevalN(f->left), fevalN(f->right));
|
||||
else
|
||||
return f->value;
|
||||
}
|
||||
|
||||
#pragma native(fevalN)
|
||||
|
||||
FNode * bop(fop call, FNode * left, FNode * right)
|
||||
{
|
||||
FNode * f = (FNode *)malloc(sizeof(FNode));
|
||||
f->call = call;
|
||||
f->left = left;
|
||||
f->right = right;
|
||||
return f;
|
||||
}
|
||||
|
||||
FNode * bc(float value)
|
||||
{
|
||||
FNode * f = (FNode *)malloc(sizeof(FNode));
|
||||
f->value = value;
|
||||
return f;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
FNode * tree = bop(fadd, bop(fmul, bc(3), bc(5)), bc(6));
|
||||
|
||||
printf("Eval %f, %d\n", fevalB(tree), fevalN(tree));
|
||||
|
||||
assert(fevalB(tree) == 3 * 5 + 6);
|
||||
assert(fevalN(tree) == 3 * 5 + 6);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
|
||||
|
||||
void incv(int * a, int n)
|
||||
{
|
||||
for(int i=0; i<n; i++)
|
||||
a[i] ++;
|
||||
}
|
||||
|
||||
int t[100];
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int i=0; i<100; i++)
|
||||
t[i] = i;
|
||||
incv(t, 100);
|
||||
int s = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
s += t[i];
|
||||
|
||||
return s - 5050;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,25 @@
|
||||
#include <gfx/bitmap.h>
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
char * const Hires = (char *)0x4000;
|
||||
Bitmap Screen;
|
||||
ClipRect cr = {0, 0, 320, 200};
|
||||
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
bm_init(&Screen, Hires, 40, 25);
|
||||
|
||||
bmu_rect_clear(&Screen, 0, 0, 320, 200);
|
||||
|
||||
bm_line(&Screen, &cr, 0, 0, 199, 199, 0xff, LINOP_SET);
|
||||
|
||||
for(int i=0; i<200; i++)
|
||||
{
|
||||
assert(Hires[(i & 7) + 320 * (i >> 3) + (i & ~7)] == 0x80 >> (i & 7));
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
#include <assert.h>
|
||||
|
||||
char a[200], b[200];
|
||||
bool ok = true;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
#assign ni 0
|
||||
#repeat
|
||||
a[ni] = ni & 255;
|
||||
#assign ni ni + 1
|
||||
#until ni == 200
|
||||
|
||||
#assign ni 0
|
||||
#repeat
|
||||
if (ok)
|
||||
b[ni] = ni & 255;
|
||||
#assign ni ni + 1
|
||||
#until ni == 200
|
||||
|
||||
int asum = 0, bsum = 0, csum = 0;
|
||||
for(int i=0; i<200; i++)
|
||||
{
|
||||
asum += a[i];
|
||||
bsum += b[i];
|
||||
csum += i & 255;
|
||||
}
|
||||
|
||||
return asum + bsum - 2 * csum;
|
||||
}
|
||||
@@ -0,0 +1,94 @@
|
||||
#include <assert.h>
|
||||
|
||||
struct S
|
||||
{
|
||||
int a[100];
|
||||
};
|
||||
|
||||
int lts(S * s)
|
||||
{
|
||||
int x = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
x += s->a[i];
|
||||
return x;
|
||||
}
|
||||
|
||||
int les(S * s)
|
||||
{
|
||||
int x = 0;
|
||||
for(int i=0; i<=99; i++)
|
||||
x += s->a[i];
|
||||
return x;
|
||||
}
|
||||
|
||||
int gts(S * s)
|
||||
{
|
||||
int x = 0;
|
||||
for(int i=100; i>0; i--)
|
||||
x += s->a[i-1];
|
||||
return x;
|
||||
}
|
||||
|
||||
int ges(S * s)
|
||||
{
|
||||
int x = 0;
|
||||
for(int i=99; i>=0; i--)
|
||||
x += s->a[i];
|
||||
return x;
|
||||
}
|
||||
|
||||
int ltu(S * s)
|
||||
{
|
||||
unsigned x = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
x += s->a[i];
|
||||
return x;
|
||||
}
|
||||
|
||||
int leu(S * s)
|
||||
{
|
||||
unsigned x = 0;
|
||||
for(int i=0; i<=99; i++)
|
||||
x += s->a[i];
|
||||
return x;
|
||||
}
|
||||
|
||||
int gtu(S * s)
|
||||
{
|
||||
unsigned x = 0;
|
||||
for(int i=100; i>0; i--)
|
||||
x += s->a[i-1];
|
||||
return x;
|
||||
}
|
||||
|
||||
int geu(S * s)
|
||||
{
|
||||
unsigned x = 0;
|
||||
for(int i=100; i>=1; i--)
|
||||
x += s->a[i-1];
|
||||
return x;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
S s;
|
||||
|
||||
int k = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
int t = (i & 15) + 3;
|
||||
s.a[i] = t;
|
||||
k += t;
|
||||
}
|
||||
|
||||
assert(lts(&s) == k);
|
||||
assert(les(&s) == k);
|
||||
assert(gts(&s) == k);
|
||||
assert(ges(&s) == k);
|
||||
assert(ltu(&s) == k);
|
||||
assert(leu(&s) == k);
|
||||
assert(gtu(&s) == k);
|
||||
assert(geu(&s) == k);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int a[10][10];
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
for(int j=0; j<10; j++)
|
||||
{
|
||||
a[i][j] = i + j;
|
||||
}
|
||||
}
|
||||
|
||||
int s = 0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
s += a[i][i];
|
||||
}
|
||||
|
||||
|
||||
assert(s == 90);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,390 @@
|
||||
#include <assert.h>
|
||||
|
||||
void unroll1(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=0; i<100; i++)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=0; i<100; i++)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=0; i<100; i++)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=0; i<100; i++)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=0; i<100; i++)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unroll2(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=0; i<100; i+=2)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=0; i<100; i+=2)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=0; i<100; i+=2)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=0; i<100; i+=2)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=0; i<100; i+=2)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unroll3(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=0; i<100; i+=3)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=0; i<100; i+=3)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=0; i<100; i+=3)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=0; i<100; i+=3)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=0; i<100; i+=3)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unroll50(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=0; i<100; i+=50)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=0; i<100; i+=50)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=0; i<100; i+=50)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=0; i<100; i+=50)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=0; i<100; i+=50)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unroll50e(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=0; i<=100; i+=50)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=0; i<=100; i+=50)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=0; i<=100; i+=50)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=0; i<=100; i+=50)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=0; i<=100; i+=50)
|
||||
sumfull += i;
|
||||
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unroll100(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=0; i<100; i+=100)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=0; i<100; i+=100)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=0; i<100; i+=100)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=0; i<100; i+=100)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=0; i<100; i+=100)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
|
||||
void unrolld1(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=100; i>0; i--)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=100; i>0; i--)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=100; i>0; i--)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=100; i>0; i--)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=100; i>0; i--)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unrolld2(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=100; i>0; i-=2)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=100; i>0; i-=2)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=100; i>0; i-=2)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=100; i>0; i-=2)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=100; i>0; i-=2)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unrolld3(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=100; i>0; i-=3)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=100; i>0; i-=3)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=100; i>0; i-=3)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=100; i>0; i-=3)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=100; i>0; i-=3)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unrolld50(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=100; i>0; i-=50)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=100; i>0; i-=50)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=100; i>0; i-=50)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=100; i>0; i-=50)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=100; i>0; i-=50)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unrolld50e(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=100; i>=0; i-=50)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=100; i>=0; i-=50)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=100; i>=0; i-=50)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=100; i>=0; i-=50)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=100; i>=0; i-=50)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
void unrolld100(void)
|
||||
{
|
||||
int sum0 = 0;
|
||||
int sum2 = 0;
|
||||
int sum3 = 0;
|
||||
int sum10 = 0;
|
||||
int sumfull = 0;
|
||||
|
||||
for(int i=100; i>0; i-=100)
|
||||
sum0 += i;
|
||||
#pragma unroll(2)
|
||||
for(int i=100; i>0; i-=100)
|
||||
sum2 += i;
|
||||
#pragma unroll(3)
|
||||
for(int i=100; i>0; i-=100)
|
||||
sum3 += i;
|
||||
#pragma unroll(10)
|
||||
for(int i=100; i>0; i-=100)
|
||||
sum10 += i;
|
||||
#pragma unroll(full)
|
||||
for(int i=100; i>0; i-=100)
|
||||
sumfull += i;
|
||||
assert(sum2 == sum0);
|
||||
assert(sum3 == sum0);
|
||||
assert(sum10 == sum0);
|
||||
assert(sumfull == sum0);
|
||||
}
|
||||
|
||||
|
||||
char glob[20];
|
||||
|
||||
void autounroll(void)
|
||||
{
|
||||
char sum0 = 0;
|
||||
char sum1 = 0;
|
||||
char sum2 = 0;
|
||||
char sum3 = 0;
|
||||
char sum4 = 0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
sum0 += glob[i];
|
||||
// for(int i=10; i<20; i++)
|
||||
// sum1 += glob[i - 10];
|
||||
for(int i=10; i>0; i--)
|
||||
sum2 += glob[i - 1];
|
||||
for(int i=9; i>=0; i--)
|
||||
sum3 += glob[i];
|
||||
// for(int i=0; i<=9; i++)
|
||||
// sum4 += glob[i];
|
||||
|
||||
// assert(sum1 == sum0);
|
||||
assert(sum2 == sum0);
|
||||
#if 0
|
||||
assert(sum3 == sum0);
|
||||
assert(sum4 == sum0);
|
||||
#endif
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int i=0; i<20; i++)
|
||||
glob[i] = i;
|
||||
#if 0
|
||||
unroll1();
|
||||
unroll2();
|
||||
unroll3();
|
||||
unroll50();
|
||||
unroll50e();
|
||||
unroll100();
|
||||
unrolld1();
|
||||
unrolld2();
|
||||
unrolld3();
|
||||
unrolld50();
|
||||
unrolld50e();
|
||||
unrolld100();
|
||||
#endif
|
||||
autounroll();
|
||||
}
|
||||
@@ -0,0 +1,92 @@
|
||||
SRCS=$(filter-out ambiguousoverload_trigger.c opp_part1.cpp opp_part2.cpp, $(wildcard *.c *.cpp))
|
||||
EXES=$(patsubst %.c,%,$(SRCS))
|
||||
EXES:=$(patsubst %.cpp,%,$(EXES))
|
||||
|
||||
all: $(EXES)
|
||||
|
||||
%: %.c
|
||||
$(OSCAR64_CC) -ea -g -bc $<
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -bc $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -bc $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CC) -ea -g -Os -bc $<
|
||||
$(OSCAR64_CC) -ea -g -Os -n $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -bc $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -n $<
|
||||
|
||||
%: %.cpp
|
||||
$(OSCAR64_CXX) -ea -g -bc $<
|
||||
$(OSCAR64_CXX) -ea -g -n $<
|
||||
$(OSCAR64_CXX) -ea -g -O2 -bc $<
|
||||
$(OSCAR64_CXX) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CXX) -ea -g -O0 -bc $<
|
||||
$(OSCAR64_CXX) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CXX) -ea -g -Os -bc $<
|
||||
$(OSCAR64_CXX) -ea -g -Os -n $<
|
||||
$(OSCAR64_CXX) -ea -g -O3 -bc $<
|
||||
$(OSCAR64_CXX) -ea -g -O3 -n $<
|
||||
|
||||
# testb
|
||||
bitshifttest: bitshifttest.c
|
||||
$(OSCAR64_CC) -ea -g -bc $<
|
||||
$(OSCAR64_CC) -ea -g -bc -O2 $<
|
||||
$(OSCAR64_CC) -ea -g -bc -O0 $<
|
||||
$(OSCAR64_CC) -ea -g -bc -Os $<
|
||||
$(OSCAR64_CC) -ea -g -bc -O3 $<
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
|
||||
# testn
|
||||
stripedarraytest: stripedarraytest.c
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CC) -ea -g -Os -n $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -n $<
|
||||
|
||||
stripedstructtest: stripedstructtest.c
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CC) -ea -g -Os -n $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -n $<
|
||||
|
||||
autorefreturn: autorefreturn.cpp
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CC) -ea -g -Os -n $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -n $<
|
||||
|
||||
copyconstructor: copyconstructor.cpp
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CC) -ea -g -Os -n $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -n $<
|
||||
|
||||
andmultest: andmultest.cpp
|
||||
$(OSCAR64_CC) -ea -g -n $<
|
||||
$(OSCAR64_CC) -ea -g -O2 -n $<
|
||||
$(OSCAR64_CC) -ea -g -O0 -n $<
|
||||
$(OSCAR64_CC) -ea -g -Os -n $<
|
||||
$(OSCAR64_CC) -ea -g -O3 -n $<
|
||||
|
||||
# testi
|
||||
volatiletest: volatiletest.c
|
||||
$(OSCAR64_CC) -eai -g -n $<
|
||||
$(OSCAR64_CC) -eai -g -O2 -n $<
|
||||
$(OSCAR64_CC) -eai -g -O0 -n $<
|
||||
$(OSCAR64_CC) -eai -g -Os -n $<
|
||||
$(OSCAR64_CC) -eai -g -O3 -n $<
|
||||
|
||||
variadic-macros: variadic_macros.c
|
||||
$(OSCAR64_CC) -eai -g -n $<
|
||||
$(OSCAR64_CC) -eai -g -O2 -n $<
|
||||
$(OSCAR64_CC) -eai -g -O0 -n $<
|
||||
$(OSCAR64_CC) -eai -g -Os -n $<
|
||||
$(OSCAR64_CC) -eai -g -O3 -n $<
|
||||
|
||||
clean:
|
||||
@$(RM) *.asm *.bcs *.int *.lbl *.map *.prg
|
||||
@@ -0,0 +1,25 @@
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
|
||||
void check_byte(char a)
|
||||
{
|
||||
char b1[8] = {0}, n1[8] = {0}, b0[8] = {0}, n0[8] = {0};
|
||||
|
||||
#for(i, 8) if ((a & (1 << i)) == (1 << i)) b1[i]++;
|
||||
#for(i, 8) if ((a & (1 << i)) != (1 << i)) n1[i]++;
|
||||
#for(i, 8) if ((a & (1 << i)) == 0) b0[i]++;
|
||||
#for(i, 8) if ((a & (1 << i)) != 0) n0[i]++;
|
||||
|
||||
for(char i=0; i<8; i++)
|
||||
{
|
||||
assert(b0[i] == n1[i]);
|
||||
assert(b1[i] == n0[i]);
|
||||
}
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int i=0; i<256; i++)
|
||||
check_byte(i);
|
||||
}
|
||||
@@ -0,0 +1,32 @@
|
||||
#include <math.h>
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int i=0; i<1000; i++)
|
||||
{
|
||||
float w = 0.0123 * i;
|
||||
float co = cos(w), si = sin(w);
|
||||
|
||||
float r = co * co + si * si;
|
||||
|
||||
assert(fabs(r - 1) < 0.001);
|
||||
|
||||
assert(fabs(sqrt(w * w) - w) < 0.001);
|
||||
|
||||
float aw = atan2(si, co);
|
||||
|
||||
float co2 = cos(aw), si2 = sin(aw);
|
||||
|
||||
assert(fabs(co2 - co) < 0.001);
|
||||
assert(fabs(si2 - si) < 0.001);
|
||||
|
||||
float ex = exp(w), em = exp(-w);
|
||||
|
||||
assert(fabs(log(ex) - w) < 0.001);
|
||||
assert(fabs(log(em) + w) < 0.001);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,103 @@
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
|
||||
char testmem[2000];
|
||||
|
||||
int main(void)
|
||||
{
|
||||
// Test memchr with basic functionality
|
||||
assert(memcmp(memchr("hello", 'h', 5), "hello", 5) == 0);
|
||||
assert(memcmp(memchr("hello", 'e', 5), "ello", 4) == 0);
|
||||
assert(memcmp(memchr("hello", 'l', 5), "llo", 3) == 0); // finds first 'l'
|
||||
assert(memcmp(memchr("hello", 'o', 5), "o", 1) == 0);
|
||||
assert(memchr("hello", 'x', 5) == 0);
|
||||
|
||||
// Test memchr with size limits
|
||||
assert(memchr("hello", 'o', 4) == 0); // 'o' is at position 4, but size is 4 (0-3)
|
||||
assert(memcmp(memchr("hello", 'l', 3), "llo", 3) == 0); // finds 'l' at position 2 within size 3
|
||||
assert(memchr("hello", 'e', 1) == 0); // 'e' is at position 1, but size is 1 (0 only)
|
||||
|
||||
// Test memchr with zero size
|
||||
assert(memchr("hello", 'h', 0) == 0);
|
||||
assert(memchr("hello", 'x', 0) == 0);
|
||||
|
||||
// Test memchr with null character
|
||||
assert(*((char*)memchr("hello", '\0', 6)) == '\0'); // finds null terminator
|
||||
assert(memchr("hello", '\0', 5) == 0); // null is at position 5, size is 5 (0-4)
|
||||
|
||||
// Test memchr with single byte
|
||||
assert(memcmp(memchr("a", 'a', 1), "a", 1) == 0);
|
||||
assert(memchr("a", 'b', 1) == 0);
|
||||
|
||||
// Test memchr with repeated characters
|
||||
assert(memcmp(memchr("aaaaaa", 'a', 6), "aaaaaa", 6) == 0); // finds first occurrence
|
||||
assert(memcmp(memchr("abcabc", 'a', 6), "abcabc", 6) == 0); // finds first 'a'
|
||||
assert(memcmp(memchr("abcabc", 'b', 6), "bcabc", 5) == 0); // finds first 'b'
|
||||
assert(memcmp(memchr("abcabc", 'c', 6), "cabc", 4) == 0); // finds first 'c'
|
||||
|
||||
// Test memchr with special characters and binary data
|
||||
assert(memcmp(memchr("hello world", ' ', 11), " world", 6) == 0);
|
||||
assert(memcmp(memchr("a.b,c;d", '.', 7), ".b,c;d", 6) == 0);
|
||||
assert(memcmp(memchr("a.b,c;d", ',', 7), ",c;d", 4) == 0);
|
||||
assert(memcmp(memchr("a.b,c;d", ';', 7), ";d", 2) == 0);
|
||||
|
||||
// Test memchr with binary data (including zeros)
|
||||
testmem[0] = 'a';
|
||||
testmem[1] = '\0';
|
||||
testmem[2] = 'b';
|
||||
testmem[3] = '\0';
|
||||
testmem[4] = 'c';
|
||||
|
||||
assert(memchr(testmem, 'a', 5) == testmem);
|
||||
assert(memchr(testmem, '\0', 5) == testmem + 1); // finds first null
|
||||
assert(memchr(testmem, 'b', 5) == testmem + 2);
|
||||
assert(memchr(testmem, 'c', 5) == testmem + 4);
|
||||
assert(memchr(testmem, 'd', 5) == 0);
|
||||
|
||||
// Test memchr with different byte values
|
||||
for(int i = 0; i < 256; i++)
|
||||
{
|
||||
testmem[i] = (unsigned char)i;
|
||||
}
|
||||
|
||||
// Test finding various byte values
|
||||
assert(memchr(testmem, 0, 256) == testmem); // byte 0 at position 0
|
||||
assert(memchr(testmem, 1, 256) == testmem + 1); // byte 1 at position 1
|
||||
assert(memchr(testmem, 127, 256) == testmem + 127); // byte 127 at position 127
|
||||
assert(memchr(testmem, 255, 256) == testmem + 255); // byte 255 at position 255
|
||||
|
||||
// Test memchr with size smaller than target position
|
||||
assert(memchr(testmem, 100, 50) == 0); // byte 100 is at position 100, but size is 50
|
||||
assert(memchr(testmem, 100, 101) == testmem + 100); // finds it with adequate size
|
||||
|
||||
// Test memchr with longer memory region
|
||||
for(int i = 0; i < 1000; i++)
|
||||
{
|
||||
testmem[i] = 'a' + (i & 7);
|
||||
}
|
||||
|
||||
// Test memchr with pattern
|
||||
assert(memchr(testmem, 'a', 1000) == testmem); // first 'a' at start
|
||||
assert(memchr(testmem, 'b', 1000) == testmem + 1); // first 'b' at position 1
|
||||
assert(memchr(testmem, 'h', 1000) == testmem + 7); // first 'h' at position 7
|
||||
assert(memchr(testmem, 'z', 1000) == 0); // 'z' not in pattern
|
||||
|
||||
// Test memchr starting from middle of buffer
|
||||
assert(memchr(testmem + 100, 'a', 900) == testmem + 104); // next 'a' after position 100
|
||||
assert(memchr(testmem + 100, 'c', 900) == testmem + 106); // next 'c' after position 100
|
||||
|
||||
// Test memchr with exact size to find character
|
||||
assert(memchr(testmem, 'h', 8) == testmem + 7); // 'h' at position 7, size exactly 8
|
||||
assert(memchr(testmem, 'h', 7) == 0); // 'h' at position 7, size only 7 (0-6)
|
||||
|
||||
// Test memchr character not found in range
|
||||
for(int i = 0; i < 100; i++)
|
||||
{
|
||||
testmem[i] = 'x'; // fill with 'x'
|
||||
}
|
||||
assert(memchr(testmem, 'y', 100) == 0); // 'y' not found
|
||||
assert(memchr(testmem, 'x', 100) == testmem); // 'x' found at start
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,49 @@
|
||||
#include <string.h>
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
unsigned b[4096];
|
||||
|
||||
void testfwd(unsigned sz)
|
||||
{
|
||||
for(unsigned i=0; i<4096; i++)
|
||||
b[i] = i;
|
||||
|
||||
memmove(b + 100, b + 101, 2 * sz);
|
||||
|
||||
for(unsigned i=0; i<100; i++)
|
||||
assert(b[i] == i);
|
||||
for(unsigned i=100; i<100 + sz; i++)
|
||||
assert(b[i] == i + 1);
|
||||
for(unsigned i=100 + sz; i<4096; i++)
|
||||
assert(b[i] == i);
|
||||
}
|
||||
|
||||
void testback(unsigned sz)
|
||||
{
|
||||
for(unsigned i=0; i<4096; i++)
|
||||
b[i] = i;
|
||||
|
||||
memmove(b + 101, b + 100, 2 * sz);
|
||||
|
||||
for(unsigned i=0; i<101; i++)
|
||||
assert(b[i] == i);
|
||||
for(unsigned i=101; i<101 + sz; i++)
|
||||
assert(b[i] == i - 1);
|
||||
for(unsigned i=101 + sz; i<4096; i++)
|
||||
assert(b[i] == i);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(unsigned i=1; i<2048; i *= 2)
|
||||
{
|
||||
testfwd(i - 1);
|
||||
testfwd(i);
|
||||
testback(i);
|
||||
testback(i - 1);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,64 @@
|
||||
#include <assert.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
unsigned n1, n0;
|
||||
|
||||
n1 = 0; n0 = 0;
|
||||
for(int i=-1000; i<2000; i+=37)
|
||||
{
|
||||
for(char j=0; j<255; j++)
|
||||
{
|
||||
if (i < j)
|
||||
n1++;
|
||||
else
|
||||
n0++;
|
||||
}
|
||||
}
|
||||
|
||||
assert(n1 == 7893 && n0 == 13017);
|
||||
|
||||
n1 = 0; n0 = 0;
|
||||
for(int i=-1000; i<2000; i+=37)
|
||||
{
|
||||
for(char j=0; j<255; j++)
|
||||
{
|
||||
if (i <= j)
|
||||
n1++;
|
||||
else
|
||||
n0++;
|
||||
}
|
||||
}
|
||||
|
||||
assert(n1 == 7899 && n0 == 13011);
|
||||
|
||||
n1 = 0; n0 = 0;
|
||||
for(int i=-1000; i<2000; i+=37)
|
||||
{
|
||||
for(char j=0; j<255; j++)
|
||||
{
|
||||
if (i >= j)
|
||||
n1++;
|
||||
else
|
||||
n0++;
|
||||
}
|
||||
}
|
||||
|
||||
assert(n0 == 7893 && n1 == 13017);
|
||||
|
||||
n1 = 0; n0 = 0;
|
||||
for(int i=-1000; i<2000; i+=37)
|
||||
{
|
||||
for(char j=0; j<255; j++)
|
||||
{
|
||||
if (i > j)
|
||||
n1++;
|
||||
else
|
||||
n0++;
|
||||
}
|
||||
}
|
||||
|
||||
assert(n0 == 7899 && n1 == 13011);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,43 @@
|
||||
#include <gfx/vector3d.h>
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
Matrix4 ml, mr;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(char i=0; i<16; i++)
|
||||
{
|
||||
for(char j=0; j<16; j++)
|
||||
{
|
||||
for(char k=0; k<16; k++)
|
||||
{
|
||||
ml.m[k] = (i == k) ? 1.0 : 0.0;
|
||||
mr.m[k] = (j == k) ? 1.0 : 0.0;
|
||||
}
|
||||
|
||||
mat4_mmul(&ml, &mr);
|
||||
|
||||
#if 0
|
||||
printf("%d, %d\n", i, j);
|
||||
for(char k=0; k<16; k++)
|
||||
printf("%f ", ml.m[k]);
|
||||
printf("\n");
|
||||
#endif
|
||||
|
||||
for(char k=0; k<16; k++)
|
||||
{
|
||||
char ix = i & 3, iy = i >> 2;
|
||||
char jx = j & 3, jy = j >> 2;
|
||||
char kx = k & 3, ky = k >> 2;
|
||||
|
||||
if (ky == jy && kx == ix && jx == iy)
|
||||
assert(ml.m[k] == 1.0);
|
||||
else
|
||||
assert(ml.m[k] == 0.0);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,90 @@
|
||||
#include <assert.h>
|
||||
|
||||
struct A
|
||||
{
|
||||
int n;
|
||||
|
||||
A(int n_)
|
||||
: n(n_) {}
|
||||
|
||||
A(const A & a)
|
||||
: n(a.n) {}
|
||||
|
||||
A operator+(const A & a) const
|
||||
{
|
||||
return A(n + a.n);
|
||||
}
|
||||
|
||||
A operator-(const A & a) const
|
||||
{
|
||||
return A(n - a.n);
|
||||
}
|
||||
|
||||
A & operator+=(const A & a)
|
||||
{
|
||||
n += a.n;
|
||||
return *this;
|
||||
}
|
||||
|
||||
A & operator-=(const A & a)
|
||||
{
|
||||
n -= a.n;
|
||||
return *this;
|
||||
}
|
||||
|
||||
A operator-(void) const
|
||||
{
|
||||
return A(-n);
|
||||
}
|
||||
|
||||
A & operator++(void)
|
||||
{
|
||||
n++;
|
||||
return *this;
|
||||
}
|
||||
|
||||
A & operator--(void)
|
||||
{
|
||||
n--;
|
||||
return *this;
|
||||
}
|
||||
|
||||
A operator++(int);
|
||||
|
||||
A operator--(int);
|
||||
|
||||
};
|
||||
|
||||
A A::operator++(int)
|
||||
{
|
||||
A a(*this);
|
||||
n++;
|
||||
return a;
|
||||
}
|
||||
|
||||
A A::operator--(int)
|
||||
{
|
||||
A a(*this);
|
||||
n--;
|
||||
return a;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
A a(7), b(8), c(9);
|
||||
|
||||
assert((++a).n == 8);
|
||||
assert(a.n == 8);
|
||||
|
||||
assert((--a).n == 7);
|
||||
assert(a.n == 7);
|
||||
|
||||
assert((a++).n == 7);
|
||||
assert(a.n == 8);
|
||||
assert((a--).n == 8);
|
||||
assert(a.n == 7);
|
||||
|
||||
assert((a + b - c + -a + -b - -c).n == 0);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
#include <opp/array.h>
|
||||
#include <assert.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
opp::array<int, 10> a10;
|
||||
opp::array<int, 20> a20;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
a10[i] = i;
|
||||
for(int i=0; i<20; i++)
|
||||
a20[i] = i;
|
||||
|
||||
int s = 0;
|
||||
for(int i=0; i<10; i++)
|
||||
s += a10[i];
|
||||
for(int i=10; i<20; i++)
|
||||
s -= a20[i];
|
||||
|
||||
assert(s == -100);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,46 @@
|
||||
#include <opp/functional.h>
|
||||
|
||||
class Node
|
||||
{
|
||||
public:
|
||||
virtual int eval(void) const = 0;
|
||||
};
|
||||
|
||||
class ConstNode : public Node
|
||||
{
|
||||
private:
|
||||
int v;
|
||||
public:
|
||||
ConstNode(int v_) : v(v_) {}
|
||||
virtual int eval(void) const
|
||||
{
|
||||
return v;
|
||||
}
|
||||
};
|
||||
|
||||
class BinaryNode : public Node
|
||||
{
|
||||
private:
|
||||
opp::function<int(int, int)> op;
|
||||
Node * left, * right;
|
||||
public:
|
||||
BinaryNode(opp::function<int(int, int)> op_, Node * left_, Node * right_);
|
||||
|
||||
virtual int eval(void) const
|
||||
{
|
||||
return op(left->eval(), right->eval());
|
||||
}
|
||||
};
|
||||
|
||||
inline BinaryNode::BinaryNode(opp::function<int(int, int)> op_, Node * left_, Node * right_)
|
||||
: op(op_), left(left_), right(right_) {}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
Node * s1 =
|
||||
new BinaryNode([=](int a, int b){return a + b;},
|
||||
new ConstNode(7), new ConstNode(11)
|
||||
);
|
||||
|
||||
return s1->eval() - 18;
|
||||
}
|
||||
@@ -0,0 +1,153 @@
|
||||
#include <opp/string.h>
|
||||
#include <opp/hashmap.h>
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
|
||||
void test_int_int(void)
|
||||
{
|
||||
opp::hashmap<int, long> hm;
|
||||
for(int i=0; i<100; i++)
|
||||
hm.at(i) = (long)i * (long)i;
|
||||
|
||||
int sum = 0;
|
||||
for(auto [k, v] : hm)
|
||||
{
|
||||
sum += k;
|
||||
assert(v == (long)k * (long)k);
|
||||
}
|
||||
assert(sum == 4950);
|
||||
|
||||
auto it = hm.begin();
|
||||
while (it != hm.end())
|
||||
{
|
||||
if (it->key & 1)
|
||||
it = hm.erase(it);
|
||||
else
|
||||
it++;
|
||||
}
|
||||
|
||||
sum = 0;
|
||||
for(auto [k, v] : hm)
|
||||
{
|
||||
sum += k;
|
||||
assert(v == (long)k * (long)k);
|
||||
}
|
||||
assert(sum == 2450);
|
||||
|
||||
sum = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
auto it = hm.find(i);
|
||||
if (it != hm.end())
|
||||
{
|
||||
assert(it->value == (long)it->key * (long)it->key);
|
||||
sum += it->key;
|
||||
}
|
||||
}
|
||||
assert(sum == 2450);
|
||||
}
|
||||
|
||||
void test_string_string(void)
|
||||
{
|
||||
opp::hashmap<opp::string, opp::string> hm;
|
||||
for(int i=0; i<100; i++)
|
||||
hm.at(opp::to_string(i)) = opp::to_string((long)i * (long)i);
|
||||
|
||||
int sum = 0;
|
||||
for(auto [k, v] : hm)
|
||||
{
|
||||
long l = v.to_long();
|
||||
int i = k.to_int();
|
||||
sum += i;
|
||||
assert(l == (long)i * (long)i);
|
||||
}
|
||||
assert(sum == 4950);
|
||||
|
||||
auto it = hm.begin();
|
||||
while (it != hm.end())
|
||||
{
|
||||
long i = it->key.to_int();
|
||||
if (i & 1)
|
||||
it = hm.erase(it);
|
||||
else
|
||||
it++;
|
||||
}
|
||||
|
||||
sum = 0;
|
||||
for(auto [k, v] : hm)
|
||||
{
|
||||
long l = v.to_long();
|
||||
long i = k.to_int();
|
||||
sum += i;
|
||||
assert(l == (long)i * (long)i);
|
||||
}
|
||||
assert(sum == 2450);
|
||||
|
||||
sum = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
auto it = hm.find(opp::to_string(i));
|
||||
if (it != hm.end())
|
||||
{
|
||||
long l = it->value.to_long();
|
||||
long k = it->key.to_int();
|
||||
assert(l == (long)k * (long)k);
|
||||
sum += k;
|
||||
}
|
||||
}
|
||||
assert(sum == 2450);
|
||||
}
|
||||
|
||||
void test_int_string(void)
|
||||
{
|
||||
opp::hashmap<int, opp::string> hm;
|
||||
for(int i=0; i<100; i++)
|
||||
hm.at(i) = opp::to_string((long)i * (long)i);
|
||||
|
||||
int sum = 0;
|
||||
for(auto [k, v] : hm)
|
||||
{
|
||||
sum += k;
|
||||
long l = v.to_long();
|
||||
assert(l == (long)k * (long)k);
|
||||
}
|
||||
assert(sum == 4950);
|
||||
|
||||
auto it = hm.begin();
|
||||
while (it != hm.end())
|
||||
{
|
||||
if (it->key & 1)
|
||||
it = hm.erase(it);
|
||||
else
|
||||
it++;
|
||||
}
|
||||
|
||||
sum = 0;
|
||||
for(auto [k, v] : hm)
|
||||
{
|
||||
sum += k;
|
||||
long l = v.to_long();
|
||||
assert(l == (long)k * (long)k);
|
||||
}
|
||||
assert(sum == 2450);
|
||||
|
||||
sum = 0;
|
||||
for(int i=0; i<100; i++)
|
||||
{
|
||||
auto it = hm.find(i);
|
||||
if (it != hm.end())
|
||||
{
|
||||
long l = it->value.to_long();
|
||||
assert(l == (long)it->key * (long)it->key);
|
||||
sum += it->key;
|
||||
}
|
||||
}
|
||||
assert(sum == 2450);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test_int_int();
|
||||
test_int_string();
|
||||
test_string_string();
|
||||
}
|
||||
@@ -0,0 +1,57 @@
|
||||
#include <opp/list.h>
|
||||
#include <opp/algorithm.h>
|
||||
#include <assert.h>
|
||||
#include <opp/iostream.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
opp::list<int> a;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
a.push_back(i);
|
||||
|
||||
int s = 0;
|
||||
for(auto i : a)
|
||||
s += i;
|
||||
|
||||
assert(s == 45);
|
||||
|
||||
auto li = a.begin();
|
||||
for(int i=0; i<5; i++)
|
||||
{
|
||||
li = a.erase(li);
|
||||
li++;
|
||||
}
|
||||
|
||||
s = 0;
|
||||
for(auto i : a)
|
||||
s += i;
|
||||
|
||||
assert(s == 1 + 3 + 5 + 7 + 9);
|
||||
|
||||
opp::list<int> b;
|
||||
|
||||
b = a;
|
||||
|
||||
s = 0;
|
||||
for(auto i : b)
|
||||
s += i;
|
||||
|
||||
assert(s == 1 + 3 + 5 + 7 + 9);
|
||||
|
||||
opp::list<int> c = opp::list<int>(b);
|
||||
|
||||
s = 0;
|
||||
for(auto i : c)
|
||||
s += i;
|
||||
|
||||
assert(s == 1 + 3 + 5 + 7 + 9);
|
||||
|
||||
s = 0;
|
||||
for(auto i : b)
|
||||
s += i;
|
||||
|
||||
assert(s == 1 + 3 + 5 + 7 + 9);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,36 @@
|
||||
#include <assert.h>
|
||||
#include <opp/numeric.h>
|
||||
#include <opp/string.h>
|
||||
#include <opp/iterator.h>
|
||||
#include <opp/array.h>
|
||||
#include <opp/sstream.h>
|
||||
#include <opp/utility.h>
|
||||
|
||||
using opp::string, opp::cout;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
opp::array<int, 10> v;
|
||||
|
||||
opp::iota(v.begin(), v.end(), 10);
|
||||
|
||||
string s = opp::accumulate(
|
||||
opp::next(v.begin()), v.end(), opp::to_string(v[0]),
|
||||
[](const opp::string & ws, int k) {return ws + "-" + opp::to_string(k);});
|
||||
|
||||
assert(s == "10-11-12-13-14-15-16-17-18-19");
|
||||
|
||||
opp::ostringstream osstr;
|
||||
opp::inclusive_scan(v.begin(), v.end(), opp::ostream_iterator<int>(osstr, ", "));
|
||||
assert(osstr.str() == "10, 21, 33, 46, 60, 75, 91, 108, 126, 145, ");
|
||||
|
||||
osstr.str("");
|
||||
opp::exclusive_scan(v.begin(), v.end(), opp::ostream_iterator<int>(osstr, ", "), 0);
|
||||
assert(osstr.str() == "0, 10, 21, 33, 46, 60, 75, 91, 108, 126, ");
|
||||
|
||||
opp::array<int, 10> w;
|
||||
|
||||
opp::iota(w.begin(), w.end(), 1);
|
||||
|
||||
assert(opp::inner_product(v.begin(), v.end(), w.begin(), 0) == 880);
|
||||
}
|
||||
@@ -0,0 +1,63 @@
|
||||
#include <opp/optional.h>
|
||||
#include <opp/string.h>
|
||||
|
||||
#include <assert.h>
|
||||
#include <opp/optional.h>
|
||||
#include <opp/string.h>
|
||||
|
||||
using opp::optional;
|
||||
using opp::string;
|
||||
|
||||
optional<int> isqrt(int i)
|
||||
{
|
||||
if (i < 0)
|
||||
return optional<int>();
|
||||
else
|
||||
return i;
|
||||
}
|
||||
|
||||
optional<string> ssqrt(int i)
|
||||
{
|
||||
if (i < 0)
|
||||
return optional<string>();
|
||||
else
|
||||
return opp::to_string(i);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int sum = 0;
|
||||
for(int i=-10; i<=10; i++)
|
||||
{
|
||||
for (auto s : isqrt(i))
|
||||
sum += s;
|
||||
}
|
||||
assert(sum == 55);
|
||||
|
||||
sum = 0;
|
||||
for(int i=-10; i<=10; i++)
|
||||
{
|
||||
if (auto s = ssqrt(i))
|
||||
sum += s->to_int();
|
||||
}
|
||||
assert(sum == 55);
|
||||
|
||||
sum = 0;
|
||||
for(int i=-10; i<=10; i++)
|
||||
{
|
||||
for (auto s : ssqrt(i))
|
||||
sum += s.to_int();
|
||||
}
|
||||
assert(sum == 55);
|
||||
|
||||
sum = 0;
|
||||
for(int i=-10; i<=10; i++)
|
||||
{
|
||||
auto s = ssqrt(i);
|
||||
auto t = s;
|
||||
|
||||
if (t)
|
||||
sum += t->to_int();
|
||||
}
|
||||
assert(sum == 55);
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
#include <assert.h>
|
||||
#include <opp/vector.h>
|
||||
#include <opp/utility.h>
|
||||
#include <opp/iostream.h>
|
||||
|
||||
using namespace opp;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
vector<pair<int, int> > vii;
|
||||
|
||||
for(int i=0; i<100; i++)
|
||||
vii.push_back(make_pair(i, i * i));
|
||||
|
||||
int sum1 = 0;
|
||||
long sum2 = 0;
|
||||
for(const auto & v : vii)
|
||||
{
|
||||
sum1 += v.first;
|
||||
sum2 += v.second;
|
||||
}
|
||||
|
||||
|
||||
assert(sum1 == 4950);
|
||||
assert(sum2 == 328350l);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,2 @@
|
||||
#include "opp_part1.h"
|
||||
|
||||
@@ -0,0 +1,40 @@
|
||||
#pragma once
|
||||
|
||||
#include <opp/vector.h>
|
||||
|
||||
class A
|
||||
{
|
||||
protected:
|
||||
int a, b;
|
||||
|
||||
public:
|
||||
A(int a_, int b_)
|
||||
: a(a_), b(b_)
|
||||
{}
|
||||
|
||||
int sum(void) const
|
||||
{
|
||||
return a * b;
|
||||
}
|
||||
};
|
||||
|
||||
class AS
|
||||
{
|
||||
protected:
|
||||
opp::vector<A> va;
|
||||
public:
|
||||
AS(const opp::vector<A> & v)
|
||||
: va(v)
|
||||
{}
|
||||
|
||||
int sum(void)
|
||||
{
|
||||
int s = 0;
|
||||
for(const auto & a : va)
|
||||
s += a.sum();
|
||||
return s;
|
||||
}
|
||||
};
|
||||
|
||||
#pragma compile("opp_part1.cpp")
|
||||
|
||||
@@ -0,0 +1,13 @@
|
||||
#include "opp_part2.h"
|
||||
|
||||
BS::BS(const opp::vector<A> & v)
|
||||
: va(v)
|
||||
{}
|
||||
|
||||
int BS::sum(void)
|
||||
{
|
||||
int s = 0;
|
||||
for(const auto & a : va)
|
||||
s += a.sum();
|
||||
return s;
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
#pragma once
|
||||
|
||||
#include "opp_part1.h"
|
||||
|
||||
class BS
|
||||
{
|
||||
protected:
|
||||
opp::vector<A> va;
|
||||
public:
|
||||
BS(const opp::vector<A> & v);
|
||||
int sum(void);
|
||||
};
|
||||
|
||||
|
||||
|
||||
#pragma compile("opp_part2.cpp")
|
||||
@@ -0,0 +1,25 @@
|
||||
#include <assert.h>
|
||||
|
||||
#include "opp_part1.h"
|
||||
#include "opp_part2.h"
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
opp::vector<A> va;
|
||||
va.push_back(A(1, 2));
|
||||
va.push_back(A(3, 4));
|
||||
va.push_back(A(6, 4));
|
||||
va.push_back(A(0, 9));
|
||||
|
||||
AS as(va);
|
||||
|
||||
va.push_back(A(7, 1));
|
||||
|
||||
BS bs(va);
|
||||
|
||||
assert(bs.sum() == 2 + 12 + 24 + 7);
|
||||
assert(as.sum() == 2 + 12 + 24);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,49 @@
|
||||
#include <opp/span.h>
|
||||
#include <opp/iostream.h>
|
||||
#include <opp/iterator.h>
|
||||
#include <opp/vector.h>
|
||||
#include <opp/array.h>
|
||||
#include <opp/numeric.h>
|
||||
#include <opp/algorithm.h>
|
||||
#include <assert.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
static const int test[] = {7, 6, 5, 4, 3, 2, 1};
|
||||
|
||||
opp::span<const int, 7> st(test);
|
||||
opp::span<const int> sd(test, 7);
|
||||
|
||||
auto st1 = st.subspan<1>();
|
||||
auto sd1 = sd.subspan<1>();
|
||||
|
||||
auto st2 = st.subspan(2);
|
||||
auto sd2 = sd.subspan(2);
|
||||
|
||||
auto st3 = st.subspan<1, 4>();
|
||||
auto sd3 = sd.subspan<1, 4>();
|
||||
|
||||
auto st4 = st.subspan(2, 5);
|
||||
auto sd4 = sd.subspan(2, 5);
|
||||
|
||||
auto st5 = st.last(5);
|
||||
auto sd5 = sd.last(5);
|
||||
|
||||
assert(opp::accumulate(st.begin(), st.end(), 0) == 28);
|
||||
assert(opp::accumulate(sd.begin(), sd.end(), 0) == 28);
|
||||
|
||||
assert(opp::accumulate(st1.begin(), st1.end(), 0) == 21);
|
||||
assert(opp::accumulate(sd1.begin(), sd1.end(), 0) == 21);
|
||||
|
||||
assert(opp::accumulate(st2.begin(), st2.end(), 0) == 15);
|
||||
assert(opp::accumulate(sd2.begin(), sd2.end(), 0) == 15);
|
||||
|
||||
assert(opp::accumulate(st3.begin(), st3.end(), 0) == 18);
|
||||
assert(opp::accumulate(sd3.begin(), sd3.end(), 0) == 18);
|
||||
|
||||
assert(opp::accumulate(st4.begin(), st4.end(), 0) == 15);
|
||||
assert(opp::accumulate(sd4.begin(), sd4.end(), 0) == 15);
|
||||
|
||||
assert(opp::accumulate(st5.begin(), st5.end(), 0) == 15);
|
||||
assert(opp::accumulate(sd5.begin(), sd5.end(), 0) == 15);
|
||||
}
|
||||
@@ -0,0 +1,78 @@
|
||||
#include <opp/static_vector.h>
|
||||
#include <opp/algorithm.h>
|
||||
#include <assert.h>
|
||||
#include <opp/iostream.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
opp::static_vector<int, 20> a;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
a.push_back(i);
|
||||
|
||||
int s = 0;
|
||||
for(int i=0; i<a.size(); i++)
|
||||
s += a[i];
|
||||
|
||||
assert(s == 45);
|
||||
|
||||
for(int i=0; i<5; i++)
|
||||
a.erase(i);
|
||||
|
||||
s = 0;
|
||||
for(int i=0; i<a.size(); i++)
|
||||
s += a[i];
|
||||
|
||||
assert(s == 1 + 3 + 5 + 7 + 9);
|
||||
|
||||
opp::static_vector<int, 100> v;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
v.push_back(i);
|
||||
|
||||
assert(v.size() == 10);
|
||||
v.insert(0, 20);
|
||||
assert(v.size() == 11);
|
||||
v.insert(6, 21);
|
||||
assert(v.size() == 12);
|
||||
v.insert(12, 22);
|
||||
|
||||
int * fi = opp::find(v.begin(), v.end(), 21);
|
||||
|
||||
fi = v.insert(fi, 30);
|
||||
fi = v.insert(fi, 31);
|
||||
fi = v.insert(fi, 32);
|
||||
|
||||
assert(v.size() == 16);
|
||||
assert(v[0] == 20);
|
||||
assert(v[15] == 22);
|
||||
assert(v[8] == 32);
|
||||
|
||||
fi = opp::find(v.begin(), v.end(), 32);
|
||||
|
||||
for(int i=0; i<30; i++)
|
||||
{
|
||||
fi = v.insert(fi, i + 40);
|
||||
}
|
||||
|
||||
assert(v.size() == 46);
|
||||
assert(v[28] == 60);
|
||||
|
||||
v.erase(10, 10);
|
||||
|
||||
for(int i : v)
|
||||
opp::cout << i << ", ";
|
||||
opp::cout << "\n";
|
||||
|
||||
assert(v.size() == 36);
|
||||
assert(v[18] == 60);
|
||||
|
||||
v.assign(42, 11);
|
||||
|
||||
assert(v.size() == 42);
|
||||
assert(v[0] == 11);
|
||||
assert(v[15] == 11);
|
||||
assert(v[41] == 11);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,83 @@
|
||||
#include <opp/string.h>
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
#include <opp/sstream.h>
|
||||
#include <math.h>
|
||||
|
||||
using opp::ostringstream;
|
||||
using opp::istringstream;
|
||||
using opp::endl;
|
||||
|
||||
float fdist(float a, float b)
|
||||
{
|
||||
float d = fabs(a - b);
|
||||
a = fabs(a);
|
||||
b = fabs(b);
|
||||
return d / (a > b ? a : b);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
ostringstream os;
|
||||
|
||||
for(int i=0; i<40; i++)
|
||||
{
|
||||
os << i << endl;
|
||||
}
|
||||
|
||||
istringstream is(os.str());
|
||||
|
||||
int j = 0, k = 47;
|
||||
#if 1
|
||||
|
||||
while (is >> k)
|
||||
{
|
||||
assert(k == j++);
|
||||
}
|
||||
|
||||
assert(j == 40);
|
||||
#endif
|
||||
os.str(opp::string());
|
||||
|
||||
#if 0
|
||||
cout << "[" << os.str() << "]" << endl;
|
||||
os << "HELLO";
|
||||
cout << "[" << os.str() << "]" << endl;
|
||||
#endif
|
||||
#if 1
|
||||
|
||||
float f = 1.0, g = 1.0;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
os << f << " " << g << endl;
|
||||
// cout << os.str();
|
||||
|
||||
f *= 5.1;
|
||||
g *= 0.12;
|
||||
}
|
||||
|
||||
|
||||
is.str(os.str());
|
||||
|
||||
f = 1.0, g = 1.0;
|
||||
|
||||
float fr, gr;
|
||||
|
||||
j = 0;
|
||||
while (is >> fr >> gr)
|
||||
{
|
||||
// cout << f << " " << fr << ", " << g << " " << gr << ", " << fdist(fr, f) << endl;
|
||||
|
||||
assert(fdist(fr, f) < 1.0e-5);
|
||||
assert(fdist(gr, g) < 1.0e-5);
|
||||
|
||||
f *= 5.1;
|
||||
g *= 0.12;
|
||||
j++;
|
||||
}
|
||||
|
||||
assert(j == 10);
|
||||
#endif
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,103 @@
|
||||
#include <opp/string.h>
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
#include <string.h>
|
||||
|
||||
using opp::string;
|
||||
|
||||
static const char HelloWorld[] = "Hello World";
|
||||
static const char AndBeyond[] = "And Beyond";
|
||||
static const char And[] = "And";
|
||||
static const char HelloWorldAndBeyond[] = "Hello World And Beyond";
|
||||
|
||||
__noinline void test_create(void)
|
||||
{
|
||||
string s1();
|
||||
string s2(HelloWorld);
|
||||
string s3(s2);
|
||||
string s4('a');
|
||||
|
||||
assert(!strcmp(s2.tocstr(), HelloWorld));
|
||||
assert(!strcmp(s3.tocstr(), HelloWorld));
|
||||
assert(s4.size() == 1 && s4[0] == 'a');
|
||||
}
|
||||
|
||||
__noinline void test_concat(void)
|
||||
{
|
||||
string s1();
|
||||
string s2(HelloWorld);
|
||||
string s3(AndBeyond);
|
||||
|
||||
string s4 = s1 + s2;
|
||||
string s5 = s2 + " " + s3;
|
||||
string s6 = s2 + " " + AndBeyond;
|
||||
|
||||
assert(!strcmp(s4.tocstr(), HelloWorld));
|
||||
assert(!strcmp(s5.tocstr(), HelloWorldAndBeyond));
|
||||
assert(!strcmp(s6.tocstr(), HelloWorldAndBeyond));
|
||||
}
|
||||
|
||||
__noinline void test_find(void)
|
||||
{
|
||||
string s1(HelloWorldAndBeyond);
|
||||
string s2(And);
|
||||
|
||||
assert(s1.find(HelloWorld) == 0);
|
||||
assert(s1.find(AndBeyond) == 12);
|
||||
assert(s1.find(And) == 12);
|
||||
assert(s1.find(s2) == 12);
|
||||
|
||||
assert(s1.find(' ') == 5);
|
||||
assert(s1.find(' ', 6) == 11);
|
||||
}
|
||||
|
||||
__noinline void test_assign(void)
|
||||
{
|
||||
string s1(HelloWorld);
|
||||
string s2(AndBeyond);
|
||||
string s3;
|
||||
s3 = s1;
|
||||
s3 = s2;
|
||||
s3 = s1;
|
||||
s3 += " ";
|
||||
s3 += s2;
|
||||
|
||||
assert(!strcmp(s3.tocstr(), HelloWorldAndBeyond));
|
||||
|
||||
s3 <<= 12;
|
||||
|
||||
assert(!strcmp(s3.tocstr(), AndBeyond));
|
||||
|
||||
s3 = HelloWorldAndBeyond;
|
||||
|
||||
assert(!strcmp(s3.tocstr(), HelloWorldAndBeyond));
|
||||
|
||||
s3 >>= 11;
|
||||
|
||||
assert(!strcmp(s3.tocstr(), HelloWorld));
|
||||
}
|
||||
|
||||
static char * test;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test = new char;
|
||||
|
||||
unsigned avail = heapfree();
|
||||
|
||||
test_create();
|
||||
assert(avail == heapfree());
|
||||
|
||||
test_concat();
|
||||
assert(avail == heapfree());
|
||||
|
||||
test_find();
|
||||
assert(avail == heapfree());
|
||||
|
||||
test_assign();
|
||||
assert(avail == heapfree());
|
||||
|
||||
delete test;
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,193 @@
|
||||
#include <opp/string.h>
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
#include <string.h>
|
||||
|
||||
using opp::string;
|
||||
|
||||
|
||||
const string s1;
|
||||
const string s2 = "Hello";
|
||||
const string s3{"World"};
|
||||
|
||||
const string a1[2];
|
||||
const string a2[2] = {"Hello", "World"};
|
||||
const string a3[2] = {opp::string("Hello"), opp::string("World")};
|
||||
|
||||
|
||||
const string d1[3][2];
|
||||
const string d2[3][2] = {{"Hello", "World"}, {"aaa", "bbb"}, {"ccc", "ddd"}};
|
||||
const string d3[3][2] =
|
||||
{{opp::string("Hello"), opp::string("World")},
|
||||
{opp::string("aaa"), opp::string("bbb")},
|
||||
{opp::string("ccc"), opp::string("ddd")}};
|
||||
|
||||
void test_global_init(void)
|
||||
{
|
||||
assert(!strcmp(s1.tocstr(), ""));
|
||||
assert(!strcmp(s2.tocstr(), "Hello"));
|
||||
assert(!strcmp(s3.tocstr(), "World"));
|
||||
}
|
||||
|
||||
|
||||
void test_global_ainit(void)
|
||||
{
|
||||
assert(!strcmp(a1[0].tocstr(), ""));
|
||||
assert(!strcmp(a1[1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(a2[0].tocstr(), "Hello"));
|
||||
assert(!strcmp(a2[1].tocstr(), "World"));
|
||||
|
||||
assert(!strcmp(a3[0].tocstr(), "Hello"));
|
||||
assert(!strcmp(a3[1].tocstr(), "World"));
|
||||
}
|
||||
|
||||
void test_global_dinit(void)
|
||||
{
|
||||
assert(!strcmp(d1[0][0].tocstr(), ""));
|
||||
assert(!strcmp(d1[2][1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(d2[0][0].tocstr(), "Hello"));
|
||||
assert(!strcmp(d2[2][1].tocstr(), "ddd"));
|
||||
|
||||
assert(!strcmp(d3[0][0].tocstr(), "Hello"));
|
||||
assert(!strcmp(d3[2][1].tocstr(), "ddd"));
|
||||
}
|
||||
|
||||
|
||||
void test_local_init(void)
|
||||
{
|
||||
const string s1;
|
||||
const string s2 = "Hello";
|
||||
const string s3{"World"};
|
||||
|
||||
assert(!strcmp(s1.tocstr(), ""));
|
||||
assert(!strcmp(s2.tocstr(), "Hello"));
|
||||
assert(!strcmp(s3.tocstr(), "World"));
|
||||
}
|
||||
|
||||
|
||||
void test_local_ainit(void)
|
||||
{
|
||||
const string a1[2];
|
||||
const string a2[2] = {"Hello", "World"};
|
||||
const string a3[2] = {opp::string("Hello"), opp::string("World")};
|
||||
|
||||
assert(!strcmp(a1[0].tocstr(), ""));
|
||||
assert(!strcmp(a1[1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(a2[0].tocstr(), "Hello"));
|
||||
assert(!strcmp(a2[1].tocstr(), "World"));
|
||||
|
||||
assert(!strcmp(a3[0].tocstr(), "Hello"));
|
||||
assert(!strcmp(a3[1].tocstr(), "World"));
|
||||
}
|
||||
|
||||
void test_local_dinit(void)
|
||||
{
|
||||
const string d1[3][2];
|
||||
const string d2[3][2] = {{"Hello", "World"}, {"aaa", "bbb"}, {"ccc", "ddd"}};
|
||||
const string d3[3][2] =
|
||||
{{opp::string("Hello"), opp::string("World")},
|
||||
{opp::string("aaa"), opp::string("bbb")},
|
||||
{opp::string("ccc"), opp::string("ddd")}};
|
||||
|
||||
assert(!strcmp(d1[0][0].tocstr(), ""));
|
||||
assert(!strcmp(d1[2][1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(d2[0][0].tocstr(), "Hello"));
|
||||
assert(!strcmp(d2[2][1].tocstr(), "ddd"));
|
||||
|
||||
assert(!strcmp(d3[0][0].tocstr(), "Hello"));
|
||||
assert(!strcmp(d3[2][1].tocstr(), "ddd"));
|
||||
}
|
||||
|
||||
class X
|
||||
{
|
||||
public:
|
||||
const string s1;
|
||||
const string s2 = "Hello";
|
||||
const string s3;
|
||||
|
||||
const string a1[2];
|
||||
const string a2[2] = {"Hello", "World"};
|
||||
|
||||
const string d1[3][2];
|
||||
const string d2[3][2] = {{"Hello", "World"}, {"aaa", "bbb"}, {"ccc", "ddd"}};
|
||||
|
||||
X() : s3("World") {}
|
||||
};
|
||||
|
||||
void test_member_init(void)
|
||||
{
|
||||
X x;
|
||||
|
||||
assert(!strcmp(x.s1.tocstr(), ""));
|
||||
assert(!strcmp(x.s2.tocstr(), "Hello"));
|
||||
assert(!strcmp(x.s3.tocstr(), "World"));
|
||||
}
|
||||
|
||||
void test_member_ainit(void)
|
||||
{
|
||||
X x;
|
||||
|
||||
assert(!strcmp(x.a1[0].tocstr(), ""));
|
||||
assert(!strcmp(x.a1[1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(x.a2[0].tocstr(), "Hello"));
|
||||
assert(!strcmp(x.a2[1].tocstr(), "World"));
|
||||
}
|
||||
|
||||
void test_member_dinit(void)
|
||||
{
|
||||
X x;
|
||||
|
||||
assert(!strcmp(x.d1[0][0].tocstr(), ""));
|
||||
assert(!strcmp(x.d1[2][1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(x.d2[0][0].tocstr(), "Hello"));
|
||||
assert(!strcmp(x.d2[2][1].tocstr(), "ddd"));
|
||||
}
|
||||
|
||||
void test_copy_init(void)
|
||||
{
|
||||
X x;
|
||||
X y(x);
|
||||
|
||||
assert(!strcmp(y.s1.tocstr(), ""));
|
||||
assert(!strcmp(y.s2.tocstr(), "Hello"));
|
||||
assert(!strcmp(y.s3.tocstr(), "World"));
|
||||
}
|
||||
|
||||
void test_copy_ainit(void)
|
||||
{
|
||||
X x;
|
||||
X y(x);
|
||||
|
||||
assert(!strcmp(y.a1[0].tocstr(), ""));
|
||||
assert(!strcmp(y.a1[1].tocstr(), ""));
|
||||
|
||||
assert(!strcmp(y.a2[0].tocstr(), "Hello"));
|
||||
assert(!strcmp(y.a2[1].tocstr(), "World"));
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
test_global_init();
|
||||
test_global_ainit();
|
||||
test_global_dinit();
|
||||
|
||||
for(int i=0; i<10000; i++)
|
||||
{
|
||||
test_local_init();
|
||||
test_local_ainit();
|
||||
}
|
||||
|
||||
test_member_init();
|
||||
test_member_ainit();
|
||||
|
||||
test_copy_init();
|
||||
test_copy_ainit();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,78 @@
|
||||
#include <opp/vector.h>
|
||||
#include <opp/algorithm.h>
|
||||
#include <assert.h>
|
||||
#include <opp/iostream.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
opp::vector<int> a;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
a.push_back(i);
|
||||
|
||||
int s = 0;
|
||||
for(int i=0; i<a.size(); i++)
|
||||
s += a[i];
|
||||
|
||||
assert(s == 45);
|
||||
|
||||
for(int i=0; i<5; i++)
|
||||
a.erase(i);
|
||||
|
||||
s = 0;
|
||||
for(int i=0; i<a.size(); i++)
|
||||
s += a[i];
|
||||
|
||||
assert(s == 1 + 3 + 5 + 7 + 9);
|
||||
|
||||
opp::vector<int> v;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
v.push_back(i);
|
||||
|
||||
assert(v.size() == 10);
|
||||
v.insert(0, 20);
|
||||
assert(v.size() == 11);
|
||||
v.insert(6, 21);
|
||||
assert(v.size() == 12);
|
||||
v.insert(12, 22);
|
||||
|
||||
int * fi = opp::find(v.begin(), v.end(), 21);
|
||||
|
||||
fi = v.insert(fi, 30);
|
||||
fi = v.insert(fi, 31);
|
||||
fi = v.insert(fi, 32);
|
||||
|
||||
assert(v.size() == 16);
|
||||
assert(v[0] == 20);
|
||||
assert(v[15] == 22);
|
||||
assert(v[8] == 32);
|
||||
|
||||
fi = opp::find(v.begin(), v.end(), 32);
|
||||
|
||||
for(int i=0; i<30; i++)
|
||||
{
|
||||
fi = v.insert(fi, i + 40);
|
||||
}
|
||||
|
||||
assert(v.size() == 46);
|
||||
assert(v[28] == 60);
|
||||
|
||||
v.erase(10, 10);
|
||||
|
||||
for(int i : v)
|
||||
opp::cout << i << ", ";
|
||||
opp::cout << "\n";
|
||||
|
||||
assert(v.size() == 36);
|
||||
assert(v[18] == 60);
|
||||
|
||||
v.assign(42, 11);
|
||||
|
||||
assert(v.size() == 42);
|
||||
assert(v[0] == 11);
|
||||
assert(v[15] == 11);
|
||||
assert(v[41] == 11);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,38 @@
|
||||
#include <opp/vector.h>
|
||||
#include <opp/string.h>
|
||||
#include <assert.h>
|
||||
#include <stdlib.h>
|
||||
#include <opp/iostream.h>
|
||||
|
||||
using opp::string;
|
||||
using opp::vector;
|
||||
|
||||
string join(const vector<string> & vs)
|
||||
{
|
||||
string sj;
|
||||
for(int i=0; i<vs.size(); i++)
|
||||
sj += vs[i];
|
||||
return sj;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
vector<string> vs;
|
||||
string a;
|
||||
|
||||
for(int i=0; i<10; i++)
|
||||
{
|
||||
vs.push_back(a);
|
||||
a += "x";
|
||||
}
|
||||
|
||||
int s = 0;
|
||||
for(int i=0; i<10; i++)
|
||||
s += vs[i].size();
|
||||
|
||||
assert(s == 45);
|
||||
|
||||
assert(join(vs).size() == 45);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,15 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
int option(bool a, int b, int c)
|
||||
{
|
||||
return a ? b : c;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
assert(option(true, 1, 2) == 1);
|
||||
assert(option(false, 1, 2) == 2);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,145 @@
|
||||
#include <stdlib.h>
|
||||
|
||||
static const char sintab[] = {
|
||||
128, 131, 134, 137, 140, 144, 147, 150, 153, 156, 159, 162, 165, 168, 171, 174, 177, 179, 182, 185, 188, 191, 193, 196, 199, 201, 204, 206, 209, 211, 213, 216, 218, 220, 222, 224, 226, 228, 230, 232, 234, 235, 237, 239, 240, 241, 243, 244, 245, 246, 248, 249, 250, 250, 251, 252, 253, 253, 254, 254, 254, 255, 255, 255,
|
||||
255, 255, 255, 255, 254, 254, 254, 253, 253, 252, 251, 250, 250, 249, 248, 246, 245, 244, 243, 241, 240, 239, 237, 235, 234, 232, 230, 228, 226, 224, 222, 220, 218, 216, 213, 211, 209, 206, 204, 201, 199, 196, 193, 191, 188, 185, 182, 179, 177, 174, 171, 168, 165, 162, 159, 156, 153, 150, 147, 144, 140, 137, 134, 131,
|
||||
128, 125, 122, 119, 116, 112, 109, 106, 103, 100, 97, 94, 91, 88, 85, 82, 79, 77, 74, 71, 68, 65, 63, 60, 57, 55, 52, 50, 47, 45, 43, 40, 38, 36, 34, 32, 30, 28, 26, 24, 22, 21, 19, 17, 16, 15, 13, 12, 11, 10, 8, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1,
|
||||
1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 5, 6, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 19, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 43, 45, 47, 50, 52, 55, 57, 60, 63, 65, 68, 71, 74, 77, 79, 82, 85, 88, 91, 94, 97, 100, 103, 106, 109, 112, 116, 119, 122, 125
|
||||
};
|
||||
|
||||
char Screen0[1024], Screen1[1024];
|
||||
|
||||
char colormap0[256], colormap1[256];
|
||||
|
||||
|
||||
char colors0[] = {0, 6, 14, 1, 13, 5, 0};
|
||||
char colors1[] = {0, 9, 7, 1, 15, 12, 0};
|
||||
|
||||
unsigned c1A, c1B, c2A, c2B, c3A, c3B;
|
||||
int d1A, d1B, d2A, d2B, d3A, d3B;
|
||||
|
||||
void inithires(void)
|
||||
{
|
||||
for(int i=0; i<256; i++)
|
||||
{
|
||||
colormap0[i] = colors0[i / 37];
|
||||
colormap1[i] = colors1[i / 37] << 4;
|
||||
}
|
||||
}
|
||||
|
||||
inline void doplasma(char * scrn)
|
||||
{
|
||||
char xbuf0[40], xbuf1[40];
|
||||
char ybuf0[25], ybuf1[25];
|
||||
|
||||
char c2a = c2A >> 8;
|
||||
char c2b = c2B >> 8;
|
||||
char c1a = c1A >> 8;
|
||||
char c1b = c1B >> 8;
|
||||
|
||||
for (char i = 0; i < 25; i++) {
|
||||
ybuf0[i] = sintab[(c1a + c2a) & 0xff] + sintab[c1b];
|
||||
c1a += 13;
|
||||
c1b -= 5;
|
||||
}
|
||||
|
||||
for (char i = 0; i < 40; i++) {
|
||||
xbuf0[i] = sintab[(c2a + c1b) & 0xff] + sintab[c2b];
|
||||
c2a += 11;
|
||||
c2b -= 7;
|
||||
}
|
||||
|
||||
c2a = c2B >> 8;
|
||||
c2b = c3A >> 8;
|
||||
c1a = c1B >> 8;
|
||||
c1b = c3B >> 8;
|
||||
|
||||
for (char i = 0; i < 25; i++) {
|
||||
ybuf1[i] = sintab[(c1b + c2a) & 0xff] + sintab[c1a];
|
||||
c1a += 4;
|
||||
c1b -= 6;
|
||||
}
|
||||
|
||||
for (char i = 0; i < 40; i++) {
|
||||
xbuf1[i] = sintab[(c2b + c1a) & 0xff] + sintab[c2a];
|
||||
c2a += 7;
|
||||
c2b -= 9;
|
||||
}
|
||||
|
||||
#pragma unroll(full)
|
||||
for (char k=0; k<5; k++)
|
||||
{
|
||||
char tbuf0[5], tbuf1[5];
|
||||
#pragma unroll(full)
|
||||
for (char i = 0; i < 4; i++)
|
||||
{
|
||||
tbuf0[i] = ybuf0[5 * k + i + 1] - ybuf0[5 * k + i];
|
||||
tbuf1[i] = ybuf1[5 * k + i + 1] - ybuf1[5 * k + i];
|
||||
}
|
||||
|
||||
for (signed char i = 39; i >= 0; i--)
|
||||
{
|
||||
char t = xbuf0[i] + ybuf0[5 * k];
|
||||
char u = xbuf1[i] + ybuf1[5 * k];
|
||||
|
||||
#pragma unroll(full)
|
||||
for (char j = 0; j < 5; j++)
|
||||
{
|
||||
scrn[40 * j + 200 * k + i] = colormap0[u] | colormap1[u];
|
||||
t += tbuf0[j];
|
||||
u += tbuf1[j];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
c1A += 8 * ((int)sintab[d1A] - 128);
|
||||
c1B += 16 * ((int)sintab[d1B] - 128);
|
||||
c2A += 8 * ((int)sintab[d2A] - 128);
|
||||
c2B += 16 * ((int)sintab[d2B] - 128);
|
||||
c3A += 6 * ((int)sintab[d3A] - 128);
|
||||
c3B += 12 * ((int)sintab[d3B] - 128);
|
||||
|
||||
d1A += 3;
|
||||
d1B += rand() & 3;
|
||||
d2A += 5;
|
||||
d2B += rand() & 3;
|
||||
d3A += 2;
|
||||
d3B += rand() & 3;
|
||||
}
|
||||
|
||||
void doplasma0(void)
|
||||
{
|
||||
doplasma(Screen0);
|
||||
}
|
||||
|
||||
void doplasma1(void)
|
||||
{
|
||||
doplasma(Screen1);
|
||||
}
|
||||
|
||||
unsigned checksum(const char * scr)
|
||||
{
|
||||
unsigned s = 0x1234;
|
||||
for(int i=0; i<1024; i++)
|
||||
{
|
||||
unsigned m = s & 1;
|
||||
s >>= 1;
|
||||
if (m)
|
||||
s ^= 0x2152;
|
||||
s ^= scr[i];
|
||||
}
|
||||
return s;
|
||||
}
|
||||
int main(void)
|
||||
{
|
||||
inithires();
|
||||
|
||||
doplasma0();
|
||||
doplasma1();
|
||||
doplasma0();
|
||||
doplasma1();
|
||||
doplasma0();
|
||||
doplasma1();
|
||||
|
||||
return checksum(Screen0) + checksum(Screen1) - 16337;
|
||||
}
|
||||
@@ -0,0 +1,39 @@
|
||||
#include <assert.h>
|
||||
|
||||
struct X
|
||||
{
|
||||
int a;
|
||||
};
|
||||
|
||||
X x[5] = {
|
||||
{1}, {2}, {3}, {4}, {5}
|
||||
};
|
||||
|
||||
X * y;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
y = x;
|
||||
assert(y == x);
|
||||
y = x + 1;
|
||||
assert(y == x + 1);
|
||||
y = &(x[2]);
|
||||
assert(y == x + 2);
|
||||
y = x + 3;
|
||||
assert(y == &(x[3]));
|
||||
y = x ;
|
||||
assert(y == (struct X*)x);
|
||||
|
||||
y = x;
|
||||
assert(x == y);
|
||||
y = x + 1;
|
||||
assert(x + 1 == y);
|
||||
y = &(x[2]);
|
||||
assert(x + 2 == y);
|
||||
y = x + 3;
|
||||
assert(&(x[3]) == y);
|
||||
y = x ;
|
||||
assert((struct X*)x == y);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
#if 1
|
||||
|
||||
const struct A {
|
||||
char w;
|
||||
int b[5];
|
||||
struct {
|
||||
int c[5];
|
||||
} o;
|
||||
} a = {22,
|
||||
{4, 5, 6, 7, 8},
|
||||
{
|
||||
{4, 5, 6, 7, 8}
|
||||
}
|
||||
};
|
||||
|
||||
const int * t[4] = {
|
||||
a.b + 1 + 1
|
||||
};
|
||||
|
||||
const int * v[4] = {
|
||||
a.o.c + 1 + 1
|
||||
};
|
||||
|
||||
int q[5] = {4, 5, 6, 7, 8};
|
||||
|
||||
const int * u[4] = {
|
||||
q + 2
|
||||
};
|
||||
|
||||
int main(void)
|
||||
{
|
||||
return
|
||||
u[0][0] + (q + 2)[2] - 6 - 8 +
|
||||
v[0][0] + (a.o.c + 2)[2] - 6 - 8 +
|
||||
t[0][0] + (a.b + 2)[2] - 6 - 8;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,83 @@
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
struct Node
|
||||
{
|
||||
int a;
|
||||
char s[10];
|
||||
};
|
||||
|
||||
void qsort(Node * n, int s)
|
||||
{
|
||||
if (s > 1)
|
||||
{
|
||||
Node pn = n[0];
|
||||
int pi = 0;
|
||||
for(int i=1; i<s; i++)
|
||||
{
|
||||
if (strcmp(n[i].s, pn.s) < 0)
|
||||
{
|
||||
n[pi] = n[i];
|
||||
pi++;
|
||||
n[i] = n[pi];
|
||||
}
|
||||
}
|
||||
n[pi] = pn;
|
||||
|
||||
qsort(n, pi);
|
||||
qsort(n + pi + 1, s - pi - 1);
|
||||
}
|
||||
}
|
||||
|
||||
void shuffle(Node * n, int s)
|
||||
{
|
||||
for(int i=0; i<s; i++)
|
||||
{
|
||||
int t = rand() % s;
|
||||
Node nt = n[i]; n[i] = n[t]; n[t] = nt;
|
||||
}
|
||||
}
|
||||
|
||||
void init(Node * n, int s)
|
||||
{
|
||||
for(int i=0; i<s; i++)
|
||||
{
|
||||
n[i].a = i;
|
||||
sprintf(n[i].s, "%.5d", i);
|
||||
}
|
||||
}
|
||||
|
||||
static const int size = 1000;
|
||||
|
||||
Node field[size];
|
||||
|
||||
void show(Node * n, int s)
|
||||
{
|
||||
for(int i=0; i<s; i++)
|
||||
{
|
||||
printf("%3d : %3d, %s\n", i, n[i].a, n[i].s);
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
void check(Node * n, int s)
|
||||
{
|
||||
for(int i=0; i<s; i++)
|
||||
{
|
||||
assert(n[i].a == i);
|
||||
}
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
init(field, size);
|
||||
// show(field, size);
|
||||
shuffle(field, size);
|
||||
// show(field, size);
|
||||
qsort(field, size);
|
||||
// show(field, size);
|
||||
check(field, size);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,16 @@
|
||||
// randsumtest
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
|
||||
int main(void)
|
||||
{
|
||||
long lsum = 0;
|
||||
for(unsigned i=0; i<1000; i++)
|
||||
lsum += rand();
|
||||
|
||||
assert(lsum == 32157742L);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,90 @@
|
||||
#include <assert.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int fib(int a)
|
||||
{
|
||||
if (a < 2)
|
||||
return a;
|
||||
else
|
||||
return fib(a - 1) + fib(a - 2);
|
||||
}
|
||||
|
||||
struct Node
|
||||
{
|
||||
char value;
|
||||
Node * left, * right;
|
||||
};
|
||||
|
||||
typedef Node * NodePtr;
|
||||
|
||||
|
||||
NodePtr newnode(void)
|
||||
{
|
||||
return (NodePtr)malloc(sizeof(Node));
|
||||
}
|
||||
|
||||
Node * insert(Node * tree, char v)
|
||||
{
|
||||
if (tree)
|
||||
{
|
||||
if (v < tree->value)
|
||||
{
|
||||
tree->left = insert(tree->left, v);
|
||||
}
|
||||
else
|
||||
{
|
||||
tree->right = insert(tree->right, v);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
tree = newnode();
|
||||
tree->value = v;
|
||||
tree->left = nullptr;
|
||||
tree->right = nullptr;
|
||||
}
|
||||
|
||||
return tree;
|
||||
}
|
||||
|
||||
char * collect(Node * tree, char * p)
|
||||
{
|
||||
if (tree)
|
||||
{
|
||||
p = collect(tree->left, p);
|
||||
*p++= tree->value;
|
||||
p = collect(tree->right, p);
|
||||
}
|
||||
|
||||
return p;
|
||||
}
|
||||
|
||||
void btest(void)
|
||||
{
|
||||
const char * str = "HELLO WORLD";
|
||||
char buff[20];
|
||||
|
||||
int i = 0;
|
||||
Node * tree = nullptr;
|
||||
|
||||
while (str[i])
|
||||
{
|
||||
tree = insert(tree, str[i]);
|
||||
i++;
|
||||
}
|
||||
|
||||
collect(tree, buff)[0] = 0;
|
||||
|
||||
assert(strcmp(buff, " DEHLLLOORW") == 0);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
assert(fib(23) == 28657);
|
||||
|
||||
btest();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,76 @@
|
||||
#include <assert.h>
|
||||
|
||||
__noinline unsigned long rollright32(unsigned long a) {
|
||||
unsigned long tmp = a & 1;
|
||||
return ( a >> 1) + (tmp << 31);
|
||||
}
|
||||
|
||||
__noinline unsigned rollright16(unsigned a) {
|
||||
unsigned tmp = a & 1;
|
||||
return ( a >> 1) + (tmp << 15);
|
||||
}
|
||||
|
||||
__noinline char rollright8(char a) {
|
||||
char tmp = a & 1;
|
||||
return ( a >> 1) + (tmp << 7);
|
||||
}
|
||||
|
||||
__noinline unsigned long rollleft32(unsigned long a) {
|
||||
unsigned long tmp = (a >> 31) & 1;
|
||||
return ( a << 1) + tmp;
|
||||
}
|
||||
|
||||
__noinline unsigned rollleft16(unsigned a) {
|
||||
unsigned tmp = (a >> 15) & 1;
|
||||
return ( a << 1) + tmp;
|
||||
}
|
||||
|
||||
__noinline char rollleft8(char a) {
|
||||
char tmp = (a >> 7) & 1;
|
||||
return ( a << 1) + tmp;
|
||||
}
|
||||
|
||||
int main() {
|
||||
unsigned long lv = 0x12345678ul;
|
||||
unsigned val = 0x1234;
|
||||
char c=0x12;
|
||||
|
||||
unsigned long lvt[33];
|
||||
unsigned valt[17];
|
||||
char ct[9];
|
||||
|
||||
lvt[0] = lv;
|
||||
valt[0] = val;
|
||||
ct[0] = c;
|
||||
|
||||
assert(rollleft8(rollright8(c)) == c);
|
||||
assert(rollleft16(rollright16(val)) == val);
|
||||
assert(rollleft32(rollright32(lv)) == lv);
|
||||
|
||||
for(int i=0; i<32; i++)
|
||||
lvt[i + 1] = rollright32(lvt[i]);
|
||||
for(int i=0; i<16; i++)
|
||||
valt[i + 1] = rollright16(valt[i]);
|
||||
for(int i=0; i<8; i++)
|
||||
ct[i + 1] = rollright8(ct[i]);
|
||||
|
||||
for(int i=0; i<=32; i++)
|
||||
{
|
||||
assert(lvt[32 - i] == lv);
|
||||
lv = rollleft32(lv);
|
||||
}
|
||||
|
||||
for(int i=0; i<=16; i++)
|
||||
{
|
||||
assert(valt[16 - i] == val);
|
||||
val = rollleft16(val);
|
||||
}
|
||||
|
||||
for(int i=0; i<=8; i++)
|
||||
{
|
||||
assert(ct[8 - i] == c);
|
||||
c = rollleft8(c);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,107 @@
|
||||
#include <assert.h>
|
||||
|
||||
#define Screen ((char *)0x0400)
|
||||
|
||||
void scroll_left(void)
|
||||
{
|
||||
char * dp = Screen;
|
||||
for(char y=0; y<25; y++)
|
||||
{
|
||||
for(char x=0; x<39; x++)
|
||||
{
|
||||
dp[x] = dp[x + 1];
|
||||
}
|
||||
dp += 40;
|
||||
}
|
||||
}
|
||||
|
||||
void scroll_right(void)
|
||||
{
|
||||
char * dp = Screen;
|
||||
for(char y=0; y<25; y++)
|
||||
{
|
||||
for(char x=39; x>0; x--)
|
||||
{
|
||||
dp[x] = dp[x - 1];
|
||||
}
|
||||
dp += 40;
|
||||
}
|
||||
}
|
||||
|
||||
void scroll_up(void)
|
||||
{
|
||||
char * dp = Screen, * sp = dp + 40;
|
||||
for(char y=0; y<24; y++)
|
||||
{
|
||||
for(char x=0; x<40; x++)
|
||||
{
|
||||
dp[x] = sp[x];
|
||||
}
|
||||
dp = sp;
|
||||
sp += 40;
|
||||
}
|
||||
}
|
||||
|
||||
void scroll_down(void)
|
||||
{
|
||||
char * dp = Screen + 24 * 40, * sp = dp - 40;
|
||||
for(char y=0; y<24; y++)
|
||||
{
|
||||
for(char x=0; x<40; x++)
|
||||
{
|
||||
dp[x] = sp[x];
|
||||
}
|
||||
dp = sp;
|
||||
sp -= 40;
|
||||
}
|
||||
}
|
||||
|
||||
void fill_screen(void)
|
||||
{
|
||||
for(char y=0; y<25; y++)
|
||||
{
|
||||
for(char x=0; x<40; x++)
|
||||
{
|
||||
Screen[40 * y + x] = 7 * y + x;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void check_screen(int dy, int dx)
|
||||
{
|
||||
for(int y=0; y<25; y++)
|
||||
{
|
||||
for(int x=0; x<40; x++)
|
||||
{
|
||||
int sy = y + dy;
|
||||
int sx = x + dx;
|
||||
|
||||
char c = 7 * y + x;
|
||||
if (sy >= 0 && sy < 25 && sx >= 0 && sx < 40)
|
||||
c = 7 * sy + sx;
|
||||
|
||||
assert(Screen[40 * y + x] == c);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
fill_screen();
|
||||
scroll_left();
|
||||
check_screen(0, 1);
|
||||
|
||||
fill_screen();
|
||||
scroll_right();
|
||||
check_screen(0, -1);
|
||||
|
||||
fill_screen();
|
||||
scroll_up();
|
||||
check_screen(1, 0);
|
||||
|
||||
fill_screen();
|
||||
scroll_down();
|
||||
check_screen(-1, 0);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,57 @@
|
||||
#include <assert.h>
|
||||
|
||||
__noinline int base_add(int add, int shl, char a)
|
||||
{
|
||||
return (a << shl) + add;
|
||||
}
|
||||
|
||||
template<int add, int shl>
|
||||
void test_add(char a)
|
||||
{
|
||||
assert((a << shl) + add == base_add(add, shl, a));
|
||||
}
|
||||
|
||||
template<int add>
|
||||
void test_adds(char a)
|
||||
{
|
||||
#for(i, 16) test_add<add, i>(a);
|
||||
}
|
||||
|
||||
__noinline int base_sub(int sub, int shl, char a)
|
||||
{
|
||||
return (a << shl) - sub;
|
||||
}
|
||||
|
||||
template<int sub, int shl>
|
||||
void test_sub(char a)
|
||||
{
|
||||
assert(int(a << shl) - sub == base_sub(sub, shl, a));
|
||||
}
|
||||
|
||||
template<int sub>
|
||||
void test_subs(char a)
|
||||
{
|
||||
#for(i, 16) test_sub<sub, i>(a);
|
||||
}
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
for(int i=0; i<256; i++)
|
||||
test_adds<15>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_adds<16>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_adds<111>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_adds<4096>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_adds<13421>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_subs<15>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_subs<16>(i);
|
||||
for(int i=0; i<256; i++)
|
||||
test_subs<4096>(i);
|
||||
}
|
||||
|
||||
@@ -0,0 +1,335 @@
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <assert.h>
|
||||
|
||||
void testi(const char * fmt, int val, const char * tst)
|
||||
{
|
||||
char buffer[32];
|
||||
|
||||
sprintf(buffer, fmt, val);
|
||||
printf("%s:%s\n", buffer, tst);
|
||||
assert(!strcmp(buffer, tst));
|
||||
}
|
||||
|
||||
void testu(const char * fmt, unsigned val, const char * tst)
|
||||
{
|
||||
char buffer[32];
|
||||
|
||||
sprintf(buffer, fmt, val);
|
||||
printf("%s:%s\n", buffer, tst);
|
||||
assert(!strcmp(buffer, tst));
|
||||
}
|
||||
|
||||
void testil(const char * fmt, long val, const char * tst)
|
||||
{
|
||||
char buffer[32];
|
||||
|
||||
sprintf(buffer, fmt, val);
|
||||
printf("%s:%s\n", buffer, tst);
|
||||
assert(!strcmp(buffer, tst));
|
||||
}
|
||||
|
||||
void testul(const char * fmt, unsigned long val, const char * tst)
|
||||
{
|
||||
char buffer[32];
|
||||
|
||||
sprintf(buffer, fmt, val);
|
||||
printf("%s:%s\n", buffer, tst);
|
||||
assert(!strcmp(buffer, tst));
|
||||
}
|
||||
|
||||
void testf(const char * fmt, float val, const char * tst)
|
||||
{
|
||||
char buffer[32];
|
||||
|
||||
sprintf(buffer, fmt, val);
|
||||
printf("%s:%s\n", buffer, tst);
|
||||
assert(!strcmp(buffer, tst));
|
||||
}
|
||||
|
||||
|
||||
int main(void)
|
||||
{
|
||||
testi("%d", 0, "0");
|
||||
testi("%d", 1, "1");
|
||||
testi("%d", -1, "-1");
|
||||
testi("%d", 12, "12");
|
||||
testi("%d", 123, "123");
|
||||
testi("%d", 1234, "1234");
|
||||
testi("%d", 12345, "12345");
|
||||
testi("%d", -12345, "-12345");
|
||||
testi("%d", 32767, "32767");
|
||||
testi("%d", -32768, "-32768");
|
||||
|
||||
testi("%3d", 0, " 0");
|
||||
testi("%3d", 1, " 1");
|
||||
testi("%3d", -1, " -1");
|
||||
testi("%3d", 12, " 12");
|
||||
testi("%3d", 123, "123");
|
||||
testi("%3d", 1234, "1234");
|
||||
testi("%3d", 12345, "12345");
|
||||
testi("%3d", -12345, "-12345");
|
||||
testi("%3d", 32767, "32767");
|
||||
testi("%3d", -32768, "-32768");
|
||||
|
||||
testi("%03d", 0, "000");
|
||||
testi("%03d", 1, "001");
|
||||
// testi("%03d", -1, "-01");
|
||||
testi("%03d", 12, "012");
|
||||
testi("%03d", 123, "123");
|
||||
testi("%03d", 1234, "1234");
|
||||
testi("%03d", 12345, "12345");
|
||||
testi("%03d", -12345, "-12345");
|
||||
testi("%03d", 32767, "32767");
|
||||
testi("%03d", -32768, "-32768");
|
||||
|
||||
testi("%-4d", 0, "0 ");
|
||||
testi("%-4d", 1, "1 ");
|
||||
testi("%-4d", -1, "-1 ");
|
||||
testi("%-4d", 12, "12 ");
|
||||
testi("%-4d", 123, "123 ");
|
||||
testi("%-4d", 1234, "1234");
|
||||
testi("%-4d", 12345, "12345");
|
||||
testi("%-4d", -12345, "-12345");
|
||||
testi("%-4d", 32767, "32767");
|
||||
testi("%-4d", -32768, "-32768");
|
||||
|
||||
testi("%+d", 0, "+0");
|
||||
testi("%+d", 1, "+1");
|
||||
testi("%+d", -1, "-1");
|
||||
testi("%+d", 12, "+12");
|
||||
testi("%+d", 123, "+123");
|
||||
testi("%+d", 1234, "+1234");
|
||||
testi("%+d", 12345, "+12345");
|
||||
testi("%+d", -12345, "-12345");
|
||||
testi("%+d", 32767, "+32767");
|
||||
testi("%+d", -32768, "-32768");
|
||||
|
||||
|
||||
|
||||
testil("%ld", 0l, "0");
|
||||
testil("%ld", 1l, "1");
|
||||
testil("%ld", -1l, "-1");
|
||||
testil("%ld", 12l, "12");
|
||||
testil("%ld", 123l, "123");
|
||||
testil("%ld", 1234l, "1234");
|
||||
testil("%ld", 12345l, "12345");
|
||||
testil("%ld", -12345l, "-12345");
|
||||
testil("%ld", 32767l, "32767");
|
||||
testil("%ld", -32768l, "-32768");
|
||||
testil("%ld", 2147483647l, "2147483647");
|
||||
testil("%ld", -2147483648l, "-2147483648");
|
||||
|
||||
testil("%3ld", 0l, " 0");
|
||||
testil("%3ld", 1l, " 1");
|
||||
testil("%3ld", -1l, " -1");
|
||||
testil("%3ld", 12l, " 12");
|
||||
testil("%3ld", 123l, "123");
|
||||
testil("%3ld", 1234l, "1234");
|
||||
testil("%3ld", 12345l, "12345");
|
||||
testil("%3ld", -12345l, "-12345");
|
||||
testil("%3ld", 32767l, "32767");
|
||||
testil("%3ld", -32768l, "-32768");
|
||||
testil("%3ld", 2147483647l, "2147483647");
|
||||
testil("%3ld", -2147483648l, "-2147483648");
|
||||
|
||||
testil("%03ld", 0l, "000");
|
||||
testil("%03ld", 1l, "001");
|
||||
// testil("%03ld", -1l, "-01");
|
||||
testil("%03ld", 12l, "012");
|
||||
testil("%03ld", 123l, "123");
|
||||
testil("%03ld", 1234l, "1234");
|
||||
testil("%03ld", 12345l, "12345");
|
||||
testil("%03ld", -12345l, "-12345");
|
||||
testil("%03ld", 32767l, "32767");
|
||||
testil("%03ld", -32768l, "-32768");
|
||||
testil("%03ld", 2147483647l, "2147483647");
|
||||
testil("%03ld", -2147483648l, "-2147483648");
|
||||
|
||||
testil("%-4ld", 0l, "0 ");
|
||||
testil("%-4ld", 1l, "1 ");
|
||||
testil("%-4ld", -1l, "-1 ");
|
||||
testil("%-4ld", 12l, "12 ");
|
||||
testil("%-4ld", 123l, "123 ");
|
||||
testil("%-4ld", 1234l, "1234");
|
||||
testil("%-4ld", 12345l, "12345");
|
||||
testil("%-4ld", -12345l, "-12345");
|
||||
testil("%-4ld", 32767l, "32767");
|
||||
testil("%-4ld", -32768l, "-32768");
|
||||
testil("%-4ld", 2147483647l, "2147483647");
|
||||
testil("%-4ld", -2147483648l, "-2147483648");
|
||||
|
||||
testil("%+ld", 0l, "+0");
|
||||
testil("%+ld", 1l, "+1");
|
||||
testil("%+ld", -1l, "-1");
|
||||
testil("%+ld", 12l, "+12");
|
||||
testil("%+ld", 123l, "+123");
|
||||
testil("%+ld", 1234l, "+1234");
|
||||
testil("%+ld", 12345l, "+12345");
|
||||
testil("%+ld", -12345l, "-12345");
|
||||
testil("%+ld", 32767l, "+32767");
|
||||
testil("%+ld", -32768l, "-32768");
|
||||
testil("%+ld", 2147483647l, "+2147483647");
|
||||
testil("%+ld", -2147483648l, "-2147483648");
|
||||
|
||||
testu("%u", 0, "0");
|
||||
testu("%u", 1, "1");
|
||||
testu("%u", 12, "12");
|
||||
testu("%u", 123, "123");
|
||||
testu("%u", 1234, "1234");
|
||||
testu("%u", 12345, "12345");
|
||||
testu("%u", 32767, "32767");
|
||||
testu("%u", 32768, "32768");
|
||||
testu("%u", 65535, "65535");
|
||||
testu("%x", 0, "0");
|
||||
testu("%x", 0x49bf, "49bf");
|
||||
testu("%x", 0xffff, "ffff");
|
||||
testu("%X", 0x49bf, "49BF");
|
||||
testu("%X", 0xffff, "FFFF");
|
||||
|
||||
testu("%3u", 0, " 0");
|
||||
testu("%3u", 1, " 1");
|
||||
testu("%3u", 12, " 12");
|
||||
testu("%3u", 123, "123");
|
||||
testu("%3u", 1234, "1234");
|
||||
testu("%3u", 12345, "12345");
|
||||
testu("%3u", 32767, "32767");
|
||||
testu("%3u", 32768, "32768");
|
||||
testu("%3u", 65535, "65535");
|
||||
testu("%3x", 0, " 0");
|
||||
testu("%3x", 0x49bf, "49bf");
|
||||
testu("%3x", 0xffff, "ffff");
|
||||
testu("%3X", 0x49bf, "49BF");
|
||||
testu("%3X", 0xffff, "FFFF");
|
||||
|
||||
testu("%03u", 0, "000");
|
||||
testu("%03u", 1, "001");
|
||||
testu("%03u", 12, "012");
|
||||
testu("%03u", 123, "123");
|
||||
testu("%03u", 1234, "1234");
|
||||
testu("%03u", 12345, "12345");
|
||||
testu("%03u", 32767, "32767");
|
||||
testu("%03u", 32768, "32768");
|
||||
testu("%03u", 65535, "65535");
|
||||
testu("%03x", 0, "000");
|
||||
testu("%03x", 0x49bf, "49bf");
|
||||
testu("%03x", 0xffff, "ffff");
|
||||
testu("%03X", 0x49bf, "49BF");
|
||||
testu("%03X", 0xffff, "FFFF");
|
||||
|
||||
testu("%-4u", 0, "0 ");
|
||||
testu("%-4u", 1, "1 ");
|
||||
testu("%-4u", 12, "12 ");
|
||||
testu("%-4u", 123, "123 ");
|
||||
testu("%-4u", 1234, "1234");
|
||||
testu("%-4u", 12345, "12345");
|
||||
testu("%-4u", 32767, "32767");
|
||||
testu("%-4u", 32768, "32768");
|
||||
testu("%-4u", 65535, "65535");
|
||||
testu("%-4x", 0, "0 ");
|
||||
testu("%-4x", 0x49bf, "49bf");
|
||||
testu("%-4x", 0xffff, "ffff");
|
||||
testu("%-4X", 0x49bf, "49BF");
|
||||
testu("%-4X", 0xffff, "FFFF");
|
||||
|
||||
testul("%3lu", 0l, " 0");
|
||||
testul("%3lu", 1l, " 1");
|
||||
testul("%3lu", 12l, " 12");
|
||||
testul("%3lu", 123l, "123");
|
||||
testul("%3lu", 1234l, "1234");
|
||||
testul("%3lu", 12345l, "12345");
|
||||
testul("%3lu", 32767l, "32767");
|
||||
testul("%3lu", 2147483647l, "2147483647");
|
||||
testul("%3lu", 4294967295l, "4294967295");
|
||||
testul("%3lx", 0, " 0");
|
||||
testul("%3lx", 0x3576fbcdl, "3576fbcd");
|
||||
testul("%3lx", 0xffffffffl, "ffffffff");
|
||||
testul("%3lX", 0x3576fbcdl, "3576FBCD");
|
||||
testul("%3lX", 0xffffffffl, "FFFFFFFF");
|
||||
|
||||
testul("%03lu", 0l, "000");
|
||||
testul("%03lu", 1l, "001");
|
||||
testul("%03lu", 12l, "012");
|
||||
testul("%03lu", 123l, "123");
|
||||
testul("%03lu", 1234l, "1234");
|
||||
testul("%03lu", 12345l, "12345");
|
||||
testul("%03lu", 32767l, "32767");
|
||||
testul("%03lu", 2147483647l, "2147483647");
|
||||
testul("%03lu", 4294967295l, "4294967295");
|
||||
testul("%03lx", 0, "000");
|
||||
testul("%03lx", 0x3576fbcdl, "3576fbcd");
|
||||
testul("%03lx", 0xffffffffl, "ffffffff");
|
||||
testul("%03lX", 0x3576fbcdl, "3576FBCD");
|
||||
testul("%03lX", 0xffffffffl, "FFFFFFFF");
|
||||
|
||||
testul("%-4lu", 0l, "0 ");
|
||||
testul("%-4lu", 1l, "1 ");
|
||||
testul("%-4lu", 12l, "12 ");
|
||||
testul("%-4lu", 123l, "123 ");
|
||||
testul("%-4lu", 1234l, "1234");
|
||||
testul("%-4lu", 12345l, "12345");
|
||||
testul("%-4lu", 32767l, "32767");
|
||||
testul("%-4lu", 2147483647l, "2147483647");
|
||||
testul("%-4lu", 4294967295l, "4294967295");
|
||||
testul("%-4lx", 0, "0 ");
|
||||
testul("%-4lx", 0x3576fbcdl, "3576fbcd");
|
||||
testul("%-4lx", 0xffffffffl, "ffffffff");
|
||||
testul("%-4lX", 0x3576fbcdl, "3576FBCD");
|
||||
testul("%-4lX", 0xffffffffl, "FFFFFFFF");
|
||||
|
||||
testul("%+lu", 0l, "+0");
|
||||
testul("%+lu", 1l, "+1");
|
||||
testul("%+lu", 12l, "+12");
|
||||
testul("%+lu", 123l, "+123");
|
||||
testul("%+lu", 1234l, "+1234");
|
||||
testul("%+lu", 12345l, "+12345");
|
||||
testul("%+lu", 32767l, "+32767");
|
||||
testul("%+lu", 2147483647l, "+2147483647");
|
||||
testul("%+lu", 4294967295l, "+4294967295");
|
||||
|
||||
testf("%f", 0., "0.000000");
|
||||
testf("%f", 1., "1.000000");
|
||||
testf("%f", -1., "-1.000000");
|
||||
testf("%f", 12., "12.000000");
|
||||
testf("%f", 123., "123.000000");
|
||||
testf("%f", 1234., "1234.000000");
|
||||
testf("%f", 12345., "12345.000000");
|
||||
testf("%f", 123456., "123456.000000");
|
||||
testf("%f", 1234567., "1234567.000000");
|
||||
testf("%f", 0.1, "0.100000");
|
||||
testf("%f", 0.01, "0.010000");
|
||||
testf("%f", 0.001, "0.001000");
|
||||
testf("%f", 0.0001, "0.000100");
|
||||
testf("%f", 0.00001, "0.000010");
|
||||
testf("%f", 0.000001, "0.000001");
|
||||
|
||||
testf("%5.1f", 0, " 0.0");
|
||||
testf("%5.1f", 1, " 1.0");
|
||||
testf("%5.1f", -1, " -1.0");
|
||||
testf("%5.1f", 10, " 10.0");
|
||||
testf("%5.1f", -10, "-10.0");
|
||||
testf("%5.1f", 100, "100.0");
|
||||
testf("%5.1f", -100, "-100.0");
|
||||
testf("%5.1f", 0.1, " 0.1");
|
||||
testf("%5.1f", -0.1, " -0.1");
|
||||
testf("%5.1f", 0.04, " 0.0");
|
||||
testf("%5.1f", -0.04, " -0.0");
|
||||
testf("%5.1f", 0.051, " 0.1");
|
||||
testf("%5.1f", -0.051, " -0.1");
|
||||
|
||||
testf("%+5.1f", 0, " +0.0");
|
||||
testf("%+5.1f", 1, " +1.0");
|
||||
testf("%+5.1f", -1, " -1.0");
|
||||
testf("%+5.1f", 10, "+10.0");
|
||||
testf("%+5.1f", -10, "-10.0");
|
||||
testf("%+5.1f", 100, "+100.0");
|
||||
testf("%+5.1f", -100, "-100.0");
|
||||
testf("%+5.1f", 0.1, " +0.1");
|
||||
testf("%+5.1f", -0.1, " -0.1");
|
||||
testf("%+5.1f", 0.04, " +0.0");
|
||||
testf("%+5.1f", -0.04, " -0.0");
|
||||
testf("%+5.1f", 0.051, " +0.1");
|
||||
testf("%+5.1f", -0.051, " -0.1");
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,134 @@
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <assert.h>
|
||||
#include <math.h>
|
||||
|
||||
#define EPSILON 0.0001
|
||||
|
||||
int scan_i(const char * fmt, const char * tst) {
|
||||
int val;
|
||||
|
||||
sscanf(tst, fmt, &val);
|
||||
printf(fmt, val);
|
||||
puts("\n");
|
||||
|
||||
return val;
|
||||
}
|
||||
|
||||
long scan_l(const char * fmt, const char * tst) {
|
||||
long val;
|
||||
|
||||
sscanf(tst, fmt, &val);
|
||||
printf(fmt, val);
|
||||
puts("\n");
|
||||
|
||||
return val;
|
||||
}
|
||||
|
||||
unsigned int scan_ui(const char * fmt, const char * tst) {
|
||||
unsigned int val;
|
||||
|
||||
sscanf(tst, fmt, &val);
|
||||
printf(fmt, val);
|
||||
puts("\n");
|
||||
|
||||
return val;
|
||||
}
|
||||
|
||||
unsigned long scan_ul(const char * fmt, const char * tst) {
|
||||
unsigned long val;
|
||||
|
||||
sscanf(tst, fmt, &val);
|
||||
printf(fmt, val);
|
||||
puts("\n");
|
||||
|
||||
return val;
|
||||
}
|
||||
|
||||
float scan_f(const char * fmt, const char * tst) {
|
||||
float val;
|
||||
|
||||
sscanf(tst, fmt, &val);
|
||||
printf(fmt, val);
|
||||
puts("\n");
|
||||
|
||||
return val;
|
||||
}
|
||||
|
||||
bool closeTo(float a, float b) {
|
||||
while (a < -1.0 || a > 1.0) a /= 10.0;
|
||||
while (b < -1.0 || b > 1.0) b /= 10.0;
|
||||
|
||||
return fabs(a - b) < EPSILON;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
assert(scan_i("%d", "0") == 0);
|
||||
assert(scan_i("%d", "1") == 1);
|
||||
assert(scan_i("%d", "-1") == -1);
|
||||
assert(scan_i("%d", "12") == 12);
|
||||
assert(scan_i("%d", "123") == 123);
|
||||
assert(scan_i("%d", "1234") == 1234);
|
||||
assert(scan_i("%d", "12345") == 12345);
|
||||
assert(scan_i("%d", "-12345") == -12345);
|
||||
assert(scan_i("%d", "32767") == 32767);
|
||||
assert(scan_i("%d", "-32768") == -32768);
|
||||
|
||||
assert(scan_l("%ld", "0") == 0l);
|
||||
assert(scan_l("%ld", "1") == 1l);
|
||||
assert(scan_l("%ld", "-1") == -1l);
|
||||
assert(scan_l("%ld", "12") == 12l);
|
||||
assert(scan_l("%ld", "123") == 123l);
|
||||
assert(scan_l("%ld", "1234") == 1234l);
|
||||
assert(scan_l("%ld", "12345") == 12345l);
|
||||
assert(scan_l("%ld", "-12345") == -12345l);
|
||||
assert(scan_l("%ld", "32767") == 32767l);
|
||||
assert(scan_l("%ld", "-32768") == -32768l);
|
||||
assert(scan_l("%ld", "2147483647") == 2147483647l);
|
||||
assert(scan_l("%ld", "-2147483648") == -2147483648l);
|
||||
|
||||
assert(scan_ui("%u", "0") == 0);
|
||||
assert(scan_ui("%u", "1") == 1);
|
||||
assert(scan_ui("%u", "12") == 12);
|
||||
assert(scan_ui("%u", "123") == 123);
|
||||
assert(scan_ui("%u", "1234") == 1234);
|
||||
assert(scan_ui("%u", "12345") == 12345);
|
||||
assert(scan_ui("%u", "32767") == 32767);
|
||||
assert(scan_ui("%u", "32768") == 32768);
|
||||
assert(scan_ui("%u", "65535") == 65535);
|
||||
assert(scan_ui("%x", "0") == 0);
|
||||
assert(scan_ui("%x", "49BF") == 0x49bf);
|
||||
assert(scan_ui("%x", "FFFF") == 0xffff);
|
||||
|
||||
assert(scan_ul("%lu", "000") == 0l);
|
||||
assert(scan_ul("%lu", "001") == 1l);
|
||||
assert(scan_ul("%lu", "012") == 12l);
|
||||
assert(scan_ul("%lu", "123") == 123l);
|
||||
assert(scan_ul("%lu", "1234") == 1234l);
|
||||
assert(scan_ul("%lu", "12345") == 12345l);
|
||||
assert(scan_ul("%lu", "32767") == 32767l);
|
||||
assert(scan_ul("%lu", "2147483647") == 2147483647l);
|
||||
assert(scan_ul("%lu", "4294967295") == 4294967295l);
|
||||
assert(scan_ul("%lx", "000") == 0);
|
||||
assert(scan_ul("%lx", "3576FBCD") == 0x3576fbcdl);
|
||||
assert(scan_ul("%lx", "FFFFFFFF") == 0xffffffffl);
|
||||
|
||||
assert(closeTo(scan_f("%f", "0.000000"), 0.));
|
||||
assert(closeTo(scan_f("%f", "1.000000"), 1.));
|
||||
assert(closeTo(scan_f("%f", "-1.000000"), -1.));
|
||||
assert(closeTo(scan_f("%f", "12.000000"), 12.));
|
||||
assert(closeTo(scan_f("%f", "123.000000"), 123.));
|
||||
assert(closeTo(scan_f("%f", "1234.000000"), 1234.));
|
||||
assert(closeTo(scan_f("%f", "12345.000000"), 12345.));
|
||||
assert(closeTo(scan_f("%f", "123456.000000"), 123456.));
|
||||
assert(closeTo(scan_f("%f", "1234567.000000"), 1234567.));
|
||||
assert(closeTo(scan_f("%f", "0.100000"), 0.1));
|
||||
assert(closeTo(scan_f("%f", "0.010000"), 0.01));
|
||||
assert(closeTo(scan_f("%f", "0.001000"), 0.001));
|
||||
assert(closeTo(scan_f("%f", "0.000100"), 0.0001));
|
||||
assert(closeTo(scan_f("%f", "0.000010"), 0.00001));
|
||||
assert(closeTo(scan_f("%f", "0.000001"), 0.000001));
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
|
||||
static const int size = 100;
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int a[size];
|
||||
|
||||
for(int i=0; i<size; i++)
|
||||
a[i] = i;
|
||||
|
||||
int s = 0;
|
||||
for(int i=0; i<size; i++)
|
||||
s += a[i];
|
||||
|
||||
assert(s == 4950);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,131 @@
|
||||
// stdlibtest
|
||||
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
#include <limits.h>
|
||||
|
||||
void numcheck(int n)
|
||||
{
|
||||
char buffer[10];
|
||||
itoa(n, buffer, 10);
|
||||
int m = atoi(buffer);
|
||||
|
||||
printf("%d : %s -> %d\n", n, buffer, m);
|
||||
|
||||
if (m != n)
|
||||
exit(-1);
|
||||
}
|
||||
|
||||
void numchecks(void)
|
||||
{
|
||||
numcheck(0);
|
||||
numcheck(-1);
|
||||
numcheck(1);
|
||||
numcheck(12345);
|
||||
numcheck(-12345);
|
||||
numcheck(INT_MIN);
|
||||
numcheck(INT_MAX);
|
||||
}
|
||||
|
||||
void heapcheck(void)
|
||||
{
|
||||
void * memp[100];
|
||||
int mems[100];
|
||||
int n, k, s, i;
|
||||
|
||||
for(n=0; n<100; n++)
|
||||
{
|
||||
s = rand() % 100 + 3;
|
||||
mems[n] = s;
|
||||
memp[n] = malloc(s);
|
||||
memset(memp[n], n, s);
|
||||
}
|
||||
|
||||
for(k=0; k<1000; k++)
|
||||
{
|
||||
n = rand() % 100;
|
||||
int s = mems[n];
|
||||
char * p = memp[n];
|
||||
for(i=0; i<s; i++)
|
||||
{
|
||||
if (p[i] != n)
|
||||
exit(-2);
|
||||
}
|
||||
free(memp[n]);
|
||||
|
||||
s = rand() % 100 + 3;
|
||||
mems[n] = s;
|
||||
memp[n] = malloc(s);
|
||||
if (!memp[n])
|
||||
exit(-3);
|
||||
memset(memp[n], n, s);
|
||||
}
|
||||
}
|
||||
|
||||
void callocckeck(void) {
|
||||
static const int ALLOC_COUNT = 4;
|
||||
static const int MAX_SIZE = 8;
|
||||
|
||||
int i, j;
|
||||
int sizes[ALLOC_COUNT];
|
||||
char str[ALLOC_COUNT][2 * MAX_SIZE];
|
||||
void *ptr[ALLOC_COUNT];
|
||||
|
||||
for (i = 0; i < ALLOC_COUNT; i++)
|
||||
{
|
||||
sizes[i] = (rand() % MAX_SIZE + 1) * 2;
|
||||
|
||||
for (j=0; j < sizes[i]-1; j++) {
|
||||
str[i][j] = 'a' + rand() % 26;
|
||||
}
|
||||
|
||||
str[i][sizes[i]-1] = '\0';
|
||||
}
|
||||
|
||||
for (i = 0; i < ALLOC_COUNT; i++)
|
||||
{
|
||||
ptr[i] = calloc(sizes[i] / 2, 2);
|
||||
|
||||
if (ptr[i] == NULL)
|
||||
{
|
||||
exit(-4);
|
||||
}
|
||||
|
||||
strcpy(ptr[i], str[i]);
|
||||
}
|
||||
|
||||
for (i = 0; i < ALLOC_COUNT; i++)
|
||||
{
|
||||
if (strcmp(ptr[i], str[i]) != 0)
|
||||
{
|
||||
exit(-5);
|
||||
}
|
||||
}
|
||||
|
||||
for (i = 0; i < ALLOC_COUNT; i++)
|
||||
{
|
||||
free(ptr[i]);
|
||||
}
|
||||
}
|
||||
|
||||
void divcheck(void) {
|
||||
div_t d = div(10, 3);
|
||||
if (d.quot != 3 || d.rem != 1)
|
||||
exit(-6);
|
||||
|
||||
ldiv_t ld = ldiv(10, 3);
|
||||
if (ld.quot != 3 || ld.rem != 1)
|
||||
exit(-7);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
numchecks();
|
||||
heapcheck();
|
||||
callocckeck();
|
||||
divcheck();
|
||||
|
||||
return 0;
|
||||
}
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user