Skip to content

Instantly share code, notes, and snippets.

View Icenowy's full-sized avatar
🐣
Chirpping

Icenowy Zheng Icenowy

🐣
Chirpping
View GitHub Profile
# Allwinner D1
```
0x0910090D
0x11002000
0x260C0001
0x30030066
0x42180000
0x50000000
0x60000853
```
tinymembench v0.4.9 (simple benchmark for memory throughput and latency)
==========================================================================
== Memory bandwidth tests ==
== ==
== Note 1: 1MB = 1000000 bytes ==
== Note 2: Results for 'copy' tests show how many bytes can be ==
== copied per second (adding together read and writen ==
== bytes would have provided twice higher numbers) ==
== Note 3: 2-pass copy means that we are using a small temporary buffer ==
<?xml version="1.0" standalone="yes"?>
<?program_dtd version="1"?>
<!DOCTYPE PROGRAM [
<!ELEMENT PROGRAM (DESCRIPTION?,
INFO_SOURCE?,
PROCESSOR?,
COMPILER?,
#!/bin/bash
# Put this file into userpatches/
# arguments: $RELEASE $LINUXFAMILY $BOARD $BUILD_DESKTOP
#
# This is the image customization script
# NOTE: It is copied to /tmp directory inside the image
# and executed there inside chroot environment
attribute vec3 aVertexPosition;
attribute vec3 aVertexNormal;
attribute vec3 aVertexColor;
attribute vec3 aTextureCoord;
uniform mat4 uWorld;
uniform mat4 uWorldViewProj;
uniform mat4 uWorldInvTranspose;
uniform vec3 uLightPos;
uniform float uLightRadius;
tinymembench v0.4.9 (simple benchmark for memory throughput and latency)
==========================================================================
== Memory bandwidth tests ==
== ==
== Note 1: 1MB = 1000000 bytes ==
== Note 2: Results for 'copy' tests show how many bytes can be ==
== copied per second (adding together read and writen ==
== bytes would have provided twice higher numbers) ==
== Note 3: 2-pass copy means that we are using a small temporary buffer ==
tinymembench v0.4.9 (simple benchmark for memory throughput and latency)
==========================================================================
== Memory bandwidth tests ==
== ==
== Note 1: 1MB = 1000000 bytes ==
== Note 2: Results for 'copy' tests show how many bytes can be ==
== copied per second (adding together read and writen ==
== bytes would have provided twice higher numbers) ==
== Note 3: 2-pass copy means that we are using a small temporary buffer ==
=> md 0x04002000
04002000: 80431984 000009f4 0e400f00 0000018f ..C.......@.....
04002010: 00000010 00103040 00000000 00000000 ....@0..........
04002020: ffffffff 000007ff 0000ffff 00000000 ................
04002030: 00000000 00000000 00000000 00000000 ................
04002040: 00000000 00000000 00000000 00000000 ................
04002050: 00000000 00000000 00000000 00000000 ................
04002060: 00000000 00000000 00000000 00000000 ................
04002070: 00000000 00000000 00000000 00000000 ................
04002080: 00000000 00000000 00000000 00000000 ................
=> md 07010000
07010000: 00000000 00000000 00000000 00000000 ................
07010010: 00000000 00000000 00000000 00000000 ................
07010020: 00000000 00000000 00000000 00000000 ................
07010030: 00000000 00000000 00000000 00000000 ................
07010040: 00000000 00000000 00000000 00000000 ................
07010050: 00000000 00000000 00000000 00000000 ................
07010060: 00000000 00000000 00000000 00000000 ................
07010070: 00000000 00000000 00000000 00000000 ................
07010080: 00000000 00000000 00000000 00000000 ................
[85]HELLO! BOOT0 is starting!
[89]boot0 commit : 62ee2c78daf826c2a0bfd1f818e301853b94f5cd
[107]PMU: AXP806
[111]set pll start
[114]set pll end
[116]rtc[0] value = 0x00000000
[119]rtc[1] value = 0x00000000
[122]rtc[2] value = 0x00000000
[125]rtc[3] value = 0x0000b00f