Platform Group: sun4u
Current Status, Debian on SPARC platform
Supported are Sun4m and Sun4u machines (with a 32-bit userland).
UltraLinux
2007-08-11
SunFire 15K (Solaris & Debian)
HCL for Solaris OS
Current Status, Debian on SPARC platform
Supported are Sun4m and Sun4u machines (with a 32-bit userland).
UltraLinux
Current Status, Debian on SPARC platform
Supported are Sun4m and Sun4u machines (with a 32-bit userland).
UltraLinux
gprof
Linux/Alpha or How to Make Your Applications Fly
Linux Performance Analysis Tools
[Author], David Mosberger
---
Useful Tools tutorial
gprof TIPS:
* Don't optimize before profiling
* Be careful not to optimize before profiling!
* Profile before you optimize.
hahaha~~~ :D I compiled it with -O3 options of icc and gcc. :D
Linux Performance Analysis Tools
[Author], David Mosberger
---
Useful Tools tutorial
gprof TIPS:
* Don't optimize before profiling
* Be careful not to optimize before profiling!
* Profile before you optimize.
hahaha~~~ :D I compiled it with -O3 options of icc and gcc. :D
2007-08-07
Linux to Power Google GPhone
HTC
Sent to you by Alan via Google Reader:
via OSNews by donotreply@osnews.com (Eugenia Loli-Queru) on Aug 04, 2007
"Google's first mobile phone reportedly will run a Linux operating system on a Texas Instruments "Edge" chipset, and will likely ship to T-Mobile and Orange customers in the Spring of 2008. "GPhone" call minutes and text messages will apparently be funded by mobile advertising, according to reports." The report found at the popular embedded systems Linux news site LinuxDevices.Things you can do from here:
- on OSNews
- Subscribe to OSNews using Google Reader
- Get started using Google Reader to easily keep up with all your favorite sites
2007-08-06
Matrix Transpose
I did ten thousand times multiplication with 800x800 matrix, each element is raged from one to five, integer type.
yrchen tole me a hint yesterday afternoon, that, the matrices should be tramsposed before did a huge compute. In today's experiment, I wrote two version codes, one doesn't has any transpose loop (called m1), the other does (called m1_t). Both them compiled with gcc, with -O3 optimization. The result is:
m1_t:
real 5m31.300s
user 5m31.245s
sys 0m0.020s
m1:
real 5m30.802s
user 5m30.265s
sys 0m0.008s
It looks like that -O3 did the transpose before has the huge matrices multiplication.
yrchen tole me a hint yesterday afternoon, that, the matrices should be tramsposed before did a huge compute. In today's experiment, I wrote two version codes, one doesn't has any transpose loop (called m1), the other does (called m1_t). Both them compiled with gcc, with -O3 optimization. The result is:
m1_t:
real 5m31.300s
user 5m31.245s
sys 0m0.020s
m1:
real 5m30.802s
user 5m30.265s
sys 0m0.008s
It looks like that -O3 did the transpose before has the huge matrices multiplication.
#include
#include
#define DIE 800
void gen( int a[][DIE]);
void mul( int a[][DIE], int b[][DIE]);
int main(int argc, char *argv[])
{
int a[DIE][DIE];
int b[DIE][DIE];
int i;
for (i = 0; i < 10000; i++) {
srand(0);
gen(a);
srand(1);
gen(b);
mul(a, b);
}
return 0;
}
void gen( int a[][DIE] )
{
int i, j;
for (i = 0; i < DIE; i++)
for (j = 0; j < DIE; j++)
a[i][j] = random() % 5 + 1;
}
void mul( int a[][DIE], int b[][DIE])
{
int i, j, k;
int c[DIE][DIE];
//Transpose
for (i = 0; i < DIE; i++)
for (j = 0; j < DIE; j++)
mul[i][j] = b[j][i];
for (i = 0; i < DIE; i++) {
for (j = 0;j < DIE; j++) {
c[i][j] = 0;
for (k = 0; k < DIE; k++)
c[i][j] += a[i][k] * mul[i][k];
//printf("%d\t", c[i][j]);
}
//printf("\n");
}
}
2007-08-04
Matrix Mutiplication Hint
先做轉置 (det)。
因為 CPU 會一次 fetch 1byte in each row, 而 matrix mul 是 col * row，所以可以直接把做一次 det(row) -> col，就能直接 fetch det(row) -> col。速度較快！
不要使用 recursive，因為 OS 要 handle 很多 stacks is a heavy-loading job。直接改用多個 whilie 把 huge-matrix 展開，開 threads 去分割成 strsen algo smaller-matrix.
這是 yrchen 給的 common hint.
因為 CPU 會一次 fetch 1byte in each row, 而 matrix mul 是 col * row，所以可以直接把做一次 det(row) -> col，就能直接 fetch det(row) -> col。速度較快！
不要使用 recursive，因為 OS 要 handle 很多 stacks is a heavy-loading job。直接改用多個 whilie 把 huge-matrix 展開，開 threads 去分割成 strsen algo smaller-matrix.
這是 yrchen 給的 common hint.
2007-08-03
2007-08-02
2007-07-31
Parallel Programming
Reference
Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers
Barry Wilkinson
Parallel Computers
Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers
Barry Wilkinson
Parallel Computers
Concurrency vs. Parallelism
They are not the same! Parallelism is a subset of Concurrency. Parallelism implies simultaneous running of code (which is impossible on uniprocessor machines) while Concurrency implies that many tasks can run in any order and possibly in parallel.
2007-07-27
Linux: The 0.01 Release
Sent to you by Alan via Google Reader:
via KernelTrap - Linux news, FreeBSD news, OpenBSD news, NetBSD news, GNU/Hurd news, BeOS news, MacOS news, Tools, Windows news, Other news by Jeremy on Jul 26, 2007
"This is a free minix-like kernel for i386(+) based AT-machines," began the Linux version 0.01 release notes in September of 1991 for the first release of the Linux kernel. "As the version number (0.01) suggests this is not a mature product. Currently only a subset of AT-hardware is supported (hard-disk, screen, keyboard and serial lines), and some of the system calls are not yet fully implemented (notably mount/umount aren't even implemented)." Booting the original 0.01 Linux kernel required bootstrapping it with minix, and the keyboard driver was written in assembly and hard-wired for a Finnish keyboard. The listed features were mostly presented as a comparison to minix and included, efficiently using the 386 chip rather than the older 8088, use of system calls rather than message passing, a fully multithreaded FS, minimal task switching, and visible interrupts. Linus Torvalds noted, "the guiding line when implementing linux was: get it working fast. I wanted the kernel simple, yet powerful enough to run most unix software." In a section titled "Apologies :-)" he noted:
"This isn't yet the 'mother of all operating systems', and anyone who hoped for that will have to wait for the first real release (1.0), and even then you might not want to change from minix. This is a source release for those that are interested in seeing what linux looks like, and it's not really supported yet."
Things you can do from here:
- on KernelTrap - Linux news, FreeBSD news, OpenBSD news, NetBSD news, GNU/Hurd news, BeOS news, MacOS news, Tools, Windows news, Other news
- Subscribe to KernelTrap - Linux news, FreeBSD news, OpenBSD news, NetBSD news, GNU/Hurd news, BeOS news, MacOS news, Tools, Windows news, Other news using Google Reader
- Get started using Google Reader to easily keep up with all your favorite sites
2007-07-26
pthread
POSIX Threads
Native POSIX Thread Library (NPTL), getconf GNU_LIBPTHREAD_VERSION, NPTL 2.3.6
NPTL Trace Tool
IBM Linux Technology Library, Linux threading models compared: LinuxThreads and NPTL
Native POSIX Thread Library (NPTL), getconf GNU_LIBPTHREAD_VERSION, NPTL 2.3.6
NPTL Trace Tool
IBM Linux Technology Library, Linux threading models compared: LinuxThreads and NPTL
2007-07-14
2007-07-13
2007-07-06
HPC Links
Gluster is a GNU cluster distribution aimed at commoditizing Supercomputing and Superstorage. Core of the Gluster provides a platform for developing clustering applications tailored for a specific tasks such as HPC Clustering, Storage Clustering, Enterprise Provisioning, Database Clustering etc.
Z RESEARCH enables System Integrators, with little or no experience in clustering, to build Clustered File Storage, HPC Clusters and Supercomputers from Commodity off the Shelf Components (COTS) using Clustered architecture and Z RESEARCH'S software stack 'Gluster'.
amar, 可愛的網域。 :) 是一位印裔工程師。
白爛的圖片
Computer cluster
Z RESEARCH enables System Integrators, with little or no experience in clustering, to build Clustered File Storage, HPC Clusters and Supercomputers from Commodity off the Shelf Components (COTS) using Clustered architecture and Z RESEARCH'S software stack 'Gluster'.
amar, 可愛的網域。 :) 是一位印裔工程師。
白爛的圖片Computer cluster
2007-07-05
e1000_request_irq: Unable to allocate MSI interrupt Error: -22
結論是，暫時不要用 linux-image-2.6.20-15-generic 或 Feist 的版本。 衝 gutsy!!
Links:
google://
wired ethernet interface missing
e1000 high latency problem, msi error on boot.
Links:
google://
dmesg eth0 e1000_request_irq Unable to allocate MSI interrupt Error: 22
wired ethernet interface missing
e1000 high latency problem, msi error on boot.
2007-06-22
OpenMP
HPC Research
HPCxTR0411 "OpenMP Microbenchmarks Version 2.0", Fiona Reid, Mark Bull
OpenMP Microbenchmarks page
Zahir, IBM eServer p690, p690+ et p655 (Regatta Power4)
HPCxTR0411 "OpenMP Microbenchmarks Version 2.0", Fiona Reid, Mark Bull
OpenMP Microbenchmarks page
Zahir, IBM eServer p690, p690+ et p655 (Regatta Power4)
Sparc 64 cross compiler
SunFire dmesg
Jun 20 13:59:59 stutb genunix: [ID 540533 kern.notice] ^MSunOS Release 5.9 Version Generic_112233-08 64-bit
Jun 20 13:59:59 stutb genunix: [ID 943905 kern.notice] Copyright 1983-2003 Sun Microsystems, Inc. All rights reserved.
Crosstool build results
So that all failed!
Jun 20 13:59:59 stutb genunix: [ID 540533 kern.notice] ^MSunOS Release 5.9 Version Generic_112233-08 64-bit
Jun 20 13:59:59 stutb genunix: [ID 943905 kern.notice] Copyright 1983-2003 Sun Microsystems, Inc. All rights reserved.
Crosstool build results
So that all failed!
2007-06-21
人家只是轉圖檔而已...
竟然造成 kernel panic!! 因為 Out of memory!
for i in `ls -1 *.jpg`;do (convert -quality 48 -crop +0-1000 "$i" tmp/"$i" &); done
如此而已就 :(
寫信來去論壇問看看
for i in `ls -1 *.jpg`;do (convert -quality 48 -crop +0-1000 "$i" tmp/"$i" &); done
如此而已就 :(
寫信來去論壇問看看
2007-06-20
Perldoc, Day 1
perlintro.html
Using my in combination with a use strict; at the top of your Perl scripts means that the interpreter will pick up certain common programming errors. For instance, in the example above, the final print $b would cause a compile-time error and prevent you from running the program. Using strict is highly recommended.
類似 gcc -Wall
Note that the braces are required in Perl, even if you've only got one line in the block.
Too bad
Cool!!
A list of them is given at the start of perlfunc and you can easily read about any given function by using perldoc -f functionname .
You can read from an open filehandle using the <> operator. In scalar context it reads a single line from the filehandle, and in list context it reads the whole file in, assigning each line to an element of the list:
Reading in the whole file at one time is called slurping. It can be useful but it may be a memory hog.
寫的真傳神！ hog *grin* :P
When you're done with your filehandles, you should close() them (though to be honest, Perl will clean up after you if you forget):
哈！ 好笑！ though to e honest. :P
The // matching operator is documented in perlop. It operates on $_ by default, or can be bound to another variable using the =~ binding operator (also documented in perlop).
In [perlop.html],
Binary "=~" binds a scalar expression to a pattern match. Certain operations search or modify the string $_ by default. This operator makes that kind of operation work on some other string. The right argument is a search pattern, substitution, or transliteration. The left argument is what is supposed to be searched, substituted, or transliterated instead of the default $_. When used in scalar context, the return value generally indicates the success of the operation. Behavior in list context depends on the particular operator. See "Regexp Quote-Like Operators" for details and perlretut for examples using these operators.
If the right argument is an expression rather than a search pattern, substitution, or transliteration, it is interpreted as a search pattern at run time.
Binary "!~" is just like "=~" except the return value is negated in the logical sense.
These are documented at great length in perlre, but for the meantime, here's a quick cheat sheet:
XDDD 快速騙人小抄 (quick cheat sheet)
我覺得寫的很美！
http://cpan.stu.edu.tw/
第一次嘗試 CPAN install Bundle::CPAN 跑出一大堆鬼東西，看起來這個系統寫的很完整，也很大！
Using my in combination with a use strict; at the top of your Perl scripts means that the interpreter will pick up certain common programming errors. For instance, in the example above, the final print $b would cause a compile-time error and prevent you from running the program. Using strict is highly recommended.
類似 gcc -Wall
unless ( condition )
if (!condition)
Note that the braces are required in Perl, even if you've only got one line in the block.
Too bad
print "LA LA LA\n" while 1; # loops forever
Cool!!
A list of them is given at the start of perlfunc and you can easily read about any given function by using perldoc -f functionname .
You can read from an open filehandle using the <> operator. In scalar context it reads a single line from the filehandle, and in list context it reads the whole file in, assigning each line to an element of the list:
Reading in the whole file at one time is called slurping. It can be useful but it may be a memory hog.
寫的真傳神！ hog *grin* :P
When you're done with your filehandles, you should close() them (though to be honest, Perl will clean up after you if you forget):
哈！ 好笑！ though to e honest. :P
if ($a =~ /foo/) { ... } # true if $a contains "foo"The // matching operator is documented in perlop. It operates on $_ by default, or can be bound to another variable using the =~ binding operator (also documented in perlop).
In [perlop.html],
Binary "=~" binds a scalar expression to a pattern match. Certain operations search or modify the string $_ by default. This operator makes that kind of operation work on some other string. The right argument is a search pattern, substitution, or transliteration. The left argument is what is supposed to be searched, substituted, or transliterated instead of the default $_. When used in scalar context, the return value generally indicates the success of the operation. Behavior in list context depends on the particular operator. See "Regexp Quote-Like Operators" for details and perlretut for examples using these operators.
If the right argument is an expression rather than a search pattern, substitution, or transliteration, it is interpreted as a search pattern at run time.
Binary "!~" is just like "=~" except the return value is negated in the logical sense.
These are documented at great length in perlre, but for the meantime, here's a quick cheat sheet:
XDDD 快速騙人小抄 (quick cheat sheet)
while (<>) {
next if /^$/;
print;
}
我覺得寫的很美！
while ((c = get()) != NULL) {
printf ("%s\n", c);
}
http://cpan.stu.edu.tw/
第一次嘗試 CPAN install Bundle::CPAN 跑出一大堆鬼東西，看起來這個系統寫的很完整，也很大！
2007-06-19
PCMan, Day 1
Demystifying Subclassing
Advice from the creator of C++
A Tour of C++
Procedural Programming
Decide which procedures you want; use the best algorithms you can find.
Modular Programming
Decide which modules you want; partition the program so that data is hidden within modules.
IBM Blade Center
Bjarne Stroustrup's homepage
Separate compilation is an issue in all real programs. It is not simply a concern in programs that present facilities, such as a Stack, as modules. Strictly speaking, using separate compilation isn't a language issue; it is an issue of how best to take advantage of a particular language implementation. However, it is of great practical importance. The best approach is to maximize modularity, represent that modularity logically through language features, and then exploit the modularity physically through files for effective separate compilation.
Advice from the creator of C++
A Tour of C++
Procedural Programming
Decide which procedures you want; use the best algorithms you can find.
Modular Programming
Decide which modules you want; partition the program so that data is hidden within modules.
IBM Blade Center
Bjarne Stroustrup's homepage
Separate compilation is an issue in all real programs. It is not simply a concern in programs that present facilities, such as a Stack, as modules. Strictly speaking, using separate compilation isn't a language issue; it is an issue of how best to take advantage of a particular language implementation. However, it is of great practical importance. The best approach is to maximize modularity, represent that modularity logically through language features, and then exploit the modularity physically through files for effective separate compilation.
2007-05-29
2007-05-23
2007-05-17
2007-05-16
How can I get input without having the user hit [Enter]?
Using standard C/C++, you cannot. However, if you're lucky your compiler may have the non-standard conio.h header (which might include getch()), if you're on *nix (UNIX, Linux, etc.) you can try the ncurses library or switching the terminal mode. On Windows, try the different API input routines (such as those included in the Win32 API).
Got this answer from, password input.
Got this answer from, password input.
2007-05-10
2007-05-08
Linus said st in Linux kernel coding style
開宗明義說
10 First off, I'd suggest printing out a copy of the GNU coding standards,
11 and NOT read it. Burn them, it's a great symbolic gesture.
怎麼會這樣啦～
這變成 Humorous Quotes Seen on UseNet 的收藏。
這個東西酷斃了，排版好漂亮！
整篇 Linux Kernel coding style 都是很搞笑，而且文筆寫的很直接，帥氣！！ XDDDDD
很好，因為我這次的 Ch5-1 就是寫在 type name。 :P 因為我覺得滿美觀的呀，尤其是要同時宣告很多這種變數的時候，就一個 * 套用到宣告出來的多個變數。
What is unary
Meaning one; a single entity or operation, or an expression that requires only one operand.
我以為看到 三百兄貴
XDDDDDDDD
brain damaged 翻譯成「頭殼壞掉」是最適合不過了！！整段寫的超搞笑，笑死我了啦～～～～～
我之前學過 Hungarian notation in VB，覺得 btn 代表 Button 這個元件很合適，也很容易閱讀，可是他為甚麼說只要 compiler 知道類型就好了，不考慮人的問題呢？強記？還是看宣告就行了！？
看到 function-growth-hormone-imbalance syndrome 還以為什麼專業的單字，害我猛起勁來查 stardict，結果得到 「生長功能荷爾蒙失調併發症」！！幹～～～～ 寫這篇的人到底在寫什麼啦？這篇根本是笑話集！
我承認 Ch5-1 裡面有用到
這種他說的錯誤。而且還犯了兩種錯誤。
所以寫 comment 是為了解釋「工作內容」，而非「如何工作」。
盡量避免一個 function or class 做太多功能，這樣才能節省 comment 的長度，和讀者了解的「墾掘深度」。
一個資料描述一行，逗號後面換行。
這未免也太人身攻擊了吧，p 老師就是 emacs 愛用者，該不會 emacs 的使用者都跑去 non-Linux dist 吧！？ :P 難怪 Linux kernel loading balancing 沒有比某個 BSD 來的好！
哈！我看到這裡，實在是... 想要知道當初是什麼條件讓 Linus Torvalds 願意將 Linux Kernel 以 GPL 釋出！？出櫃？ XDDDD
@_@!? 出櫃不是 screw-up... : 出櫃（英文“come out of the closet”的直譯，指暴露同志身份）
RTL : http://www.answers.com/topic/rtl
Register Transfer Level
GNU Manuals Online
JTC1/SC22/WG14 - C
WG14 is the international standardization working group for the programming language C
10 First off, I'd suggest printing out a copy of the GNU coding standards,
11 and NOT read it. Burn them, it's a great symbolic gesture.
怎麼會這樣啦～
這變成 Humorous Quotes Seen on UseNet 的收藏。
這個東西酷斃了，排版好漂亮！
整篇 Linux Kernel coding style 都是很搞笑，而且文筆寫的很直接，帥氣！！ XDDDDD
131 Heretic people all over the world have claimed that this inconsistency
132 is ... well ... inconsistent, but all right-thinking people know that
133 (a) K&R are _right_ and (b) K&R are right. Besides, functions are
134 special anyway (you can't nest them in C).
182 When declaring pointer data or a function that returns a pointer type, the
183 preferred use of '*' is adjacent to the data name or function name and not
184 adjacent to the type name. Examples:
185
186 char *linux_banner;
187 unsigned long long memparse(char *ptr, char **retptr);
188 char *match_strdup(substring_t *s);
很好，因為我這次的 Ch5-1 就是寫在 type name。 :P 因為我覺得滿美觀的呀，尤其是要同時宣告很多這種變數的時候，就一個 * 套用到宣告出來的多個變數。
What is unary
Meaning one; a single entity or operation, or an expression that requires only one operand.
209 C is a Spartan language
我以為看到 三百兄貴
209 C is a Spartan language, and so should your naming be. Unlike Modula-2
210 and Pascal programmers, C programmers do not use cute names like
211 ThisVariableIsATemporaryCounter.
XDDDDDDDD
224 Encoding the type of a function into the name (so-called Hungarian
225 notation) is brain damaged - the compiler knows the types anyway and can
226 check those, and it only confuses the programmer. No wonder MicroSoft
227 makes buggy programs.
brain damaged 翻譯成「頭殼壞掉」是最適合不過了！！整段寫的超搞笑，笑死我了啦～～～～～
我之前學過 Hungarian notation in VB，覺得 btn 代表 Button 這個元件很合適，也很容易閱讀，可是他為甚麼說只要 compiler 知道類型就好了，不考慮人的問題呢？強記？還是看宣告就行了！？
235 If you are afraid to mix up your local variable names, you have another
236 problem, which is called the function-growth-hormone-imbalance syndrome.
237 See chapter 6 (Functions).
看到 function-growth-hormone-imbalance syndrome 還以為什麼專業的單字，害我猛起勁來查 stardict，結果得到 「生長功能荷爾蒙失調併發症」！！幹～～～～ 寫這篇的人到底在寫什麼啦？這篇根本是笑話集！
244 It's a _mistake_ to use typedef for structures and pointers.
我承認 Ch5-1 裡面有用到
typedef struct {...} student;
student* stu;
這種他說的錯誤。而且還犯了兩種錯誤。
397 Comments are good, but there is also a danger of over-commenting. NEVER
398 try to explain HOW your code works in a comment: it's much better to
399 write the code so that the _working_ is obvious, and it's a waste of
400 time to explain badly written code.
所以寫 comment 是為了解釋「工作內容」，而非「如何工作」。
402 Generally, you want your comments to tell WHAT your code does, not HOW.
403 Also, try to avoid putting comments inside a function body: if the
404 function is so complex that you need to separately comment parts of it,
405 you should probably go back to chapter 6 for a while. You can make
406 small comments to note or warn about something particularly clever (or
407 ugly), but try to avoid excess. Instead, put the comments at the head
408 of the function, telling people what it does, and possibly WHY it does
409 it.
盡量避免一個 function or class 做太多功能，這樣才能節省 comment 的長度，和讀者了解的「墾掘深度」。
420 /*
421 * This is the preferred style for multi-line
422 * comments in the Linux kernel source code.
423 * Please use it consistently.
424 *
425 * Description: A column of asterisks on the left side,
426 * with beginning and ending almost-blank lines.
427 */
428
429 It's also important to comment data, whether they are basic types or derived
430 types. To this end, use just one data declaration per line (no commas for
431 multiple data declarations). This leaves you room for a small comment on each
432 item, explaining its use.
一個資料描述一行，逗號後面換行。
437 That's OK, we all do. You've probably been told by your long-time Unix
438 user helper that "GNU emacs" automatically formats the C sources for
439 you, and you've noticed that yes, it does do that, but the defaults it
440 uses are less than desirable (in fact, they are worse than random
441 typing - an infinite number of monkeys typing into GNU emacs would never
442 make a good program).
這未免也太人身攻擊了吧，p 老師就是 emacs 愛用者，該不會 emacs 的使用者都跑去 non-Linux dist 吧！？ :P 難怪 Linux kernel loading balancing 沒有比某個 BSD 來的好！
473 recognize the authority of K&R (the GNU people aren't evil, they are
474 just severely misguided in this matter),
哈！我看到這裡，實在是... 想要知道當初是什麼條件讓 Linus Torvalds 願意將 Linux Kernel 以 GPL 釋出！？出櫃？ XDDDD
@_@!? 出櫃不是 screw-up... : 出櫃（英文“come out of the closet”的直譯，指暴露同志身份）
RTL : http://www.answers.com/topic/rtl
Register Transfer Level
GNU Manuals Online
JTC1/SC22/WG14 - C
WG14 is the international standardization working group for the programming language C
2007-04-29
Char's pointer's pointer
This is a good example to know how to pass char's pointer to the function.
char *name[3];
name[0] = "a2n";
name[1] = "c9s";
name[2] = "ccn";
Known name at 0x1, and its content is:
{0x100, 0x101, 0x102}
Meaning indicates to "a2n", "c9s" and "ccn", respectively.
The array "name" saves the three string's address in its array space, hence, pass the array "name" to other function might via the address, and access the content of array "name" via address again. In the other word, I shall using "Pointer into Pointer" in the parameters field of array "name". :-)
char *name[3];
name[0] = "a2n";
name[1] = "c9s";
name[2] = "ccn";
Known name at 0x1, and its content is:
{0x100, 0x101, 0x102}
Meaning indicates to "a2n", "c9s" and "ccn", respectively.
The array "name" saves the three string's address in its array space, hence, pass the array "name" to other function might via the address, and access the content of array "name" via address again. In the other word, I shall using "Pointer into Pointer" in the parameters field of array "name". :-)
Example:
void show(char **name)
{
for (int i = 0; i < 3; i++) cout << *name[i] << endl;
}
char *name[3];
name[0] = "a2n";
name[1] = "c9s";
name[2] = "ccn";
show(name);
2007-04-11
How can I create a program alias?
How can I create a program alias?
A. It is possible to create an alias for a program, for example to define johnword.exe to actually run winword.exe. To do this perform the following:
If you now select Run from the start menu and type johnword.exe it would start Microsoft Word, cool!
If you type your alias from the command prompt it will not find it, however if you type
C:\> start
it will work fine.
The actual program name does not have to be an .exe program -- it can be any file that has an association (such as "C:\temp\ntfaq.url"). The alias itself can remain as an .exe.
If the alias is an .exe, then the "run" or "start" command does not need to include the extension. If the alias is NOT an .exe, then you need to use the full name but then you are not limited to any extensions (but it must have some extension). Your alias can be John.Savill which you have aliased to "C:\ProgramYadaYadaYada\Winword.exe" and Word will start up just fine.
A. It is possible to create an alias for a program, for example to define johnword.exe to actually run winword.exe. To do this perform the following:
*Start the registry editor (regedit.exe)
*Move to HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\App Paths
*From the Edit menu select New - Key
*Enter the name of the alias, e.g. johnword.exe and press Enter
*Move to the new key and double click on the (Default) value (it is blank by default)
*Set to the fully qualified file name it should run, e.g. C:\Program *Files\Microsoft Office\Office\winword.exe. Click OK
*Optionally you can create a new String called Path which is where the program will first start running (Edit - New - String Value - Path, double click and set to the starting path)
*Close the registry editor
If you now select Run from the start menu and type johnword.exe it would start Microsoft Word, cool!
If you type your alias from the command prompt it will not find it, however if you type
C:\> start
it will work fine.
The actual program name does not have to be an .exe program -- it can be any file that has an association (such as "C:\temp\ntfaq.url"). The alias itself can remain as an .exe.
If the alias is an .exe, then the "run" or "start" command does not need to include the extension. If the alias is NOT an .exe, then you need to use the full name but then you are not limited to any extensions (but it must have some extension). Your alias can be John.Savill which you have aliased to "C:\ProgramYadaYadaYada\Winword.exe" and Word will start up just fine.
2007-03-30
Pointer Discrepancy between vc++ & g++
1 #include
2
3 using namespace std;
4
5 int main()
6 {
7 int a = 1, b = 2;
8 int *x;
9
10 cout << "x: " << x << '\t';
11 cout << "*x: " << *x << '\t';
12 cout << "&x: " << &x << '\t';
13
14 cout << endl;
15
16 x = &a;
17 cout << "x = &a" << '\t';
18 cout << "x: " << x << '\t';
19 cout << "*x: " << *x << '\t';
20 cout << "&x: " << &x << '\t';
21
22 cout << endl;
23
24 x = &a - 1;
25 cout << "x = &b" << '\t';
26 cout << "x: " << x << '\t';
27 cout << "*x: " << *x << '\t';
28 cout << "&x: " << &x << '\t';
29
30 cout << endl;
31 return 0;
32 }
Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8804 for 80x86 (VC6++)
modified code...
x = &a x: 0012FF7C *x: 1 &x: 0012FF74
x = &a-1 x: 0012FF78 *x: 2 &x: 0012FF74
g++ (GCC) 4.1.2 20060928 (prerelease) (Ubuntu 4.1.1-13ubuntu5)
x: 0xb7f518dc *x: -1 &x: 0xbf97f214
x = &a x: 0xbf97f218 *x: 1 &x: 0xbf97f214
x = &a-1 x: 0xbf97f214 *x: -1080561132 &x: 0xbf97f214
g++ 讓我驚訝！！ 結果 VC++ 2005 Expression 也讓我受精。 XD
Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 14.00.50727.762 for 80x86
x = &a x: 0012FF60 *x: 1 &x: 0012FF48
x = &a-1 x: 0012FF5C *x: -858993460 &x: 0012FF48
Pointer sequence #2
1 #include
2
3 using namespace std;
4
5 int main()
6 {
7 int a = 1, b = 2;
8 int *x;
9
10 cout << "x: " << x << '\t';
11 cout << "*x: " << *x << '\t';
12 cout << "&x: " << &x << '\t';
13
14 cout << endl;
15
16 x = &a;
17 cout << "x = &a" << '\t';
18 cout << "x: " << x << '\t';
19 cout << "*x: " << *x << '\t';
20 cout << "&x: " << &x << '\t';
21
22 cout << endl;
23
24 x = &b;
25 cout << "x = &b" << '\t';
26 cout << "x: " << x << '\t';
27 cout << "*x: " << *x << '\t';
28 cout << "&x: " << &x << '\t';
29
30 cout << endl;
31 return 0;
32 }
g++ (GCC) 4.1.2 20060928 (prerelease) (Ubuntu 4.1.1-13ubuntu5)
x: 0xb7f078dc *x: -1 &x: 0xbff350c4
x = &a x: 0xbff350cc *x: 1 &x: 0xbff350c4
x = &b x: 0xbff350c8 *x: 2 &x: 0xbff350c4
Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8804 for 80x86 (VC6++)
跑到 line 10 就結束！
then modified code.
x = &a x: 0012FF7C *x: 1 &x: 0012FF74
x = &b x: 0012FF78 *x: 2 &x: 0012FF74
Pointer sequence #1
#include
using namespace std;
int main()
{
int a, b, c, d, e;
int i;
cout << "Input five numbers: \n";
cin >> a >> b >> c >> d >> e;
cout << "A: " << &a << "\nB: " << &b
<< "\nC: " << &c << "\nD: " << &d << "\nE: " << &e;
cout << endl;
return 0;
}
Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8804 for 80x86 (VC6++)
1
2
3
4
5
A: 0012FF7C
B: 0012FF78
C: 0012FF74
D: 0012FF70
E: 0012FF6C
g++ (GCC) 4.1.2 20060928 (prerelease) (Ubuntu 4.1.1-13ubuntu5)
1
2
3
4
5
A: 0xbfdc2cec
B: 0xbfdc2ce8
C: 0xbfdc2ce4
D: 0xbfdc2ce0
E: 0xbfdc2cdc
#include
using namespace std;
int main()
{
cout << "Input five numbers: \n";
cin >> a >> b >> c >> d >> e;
for (i = 0; i < 5; i++)
cout << "Var" << i << ":\t"
<< &a - i << " : "
<< *(&a - i) << '\n';
cout << endl;
return 0;
}
Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8804 for 80x86 (VC6++)
1
2
3
4
5
Var0: 0012FF7C : 1
Var1: 0012FF78 : 2
Var2: 0012FF74 : 3
Var3: 0012FF70 : 4
Var4: 0012FF6C : 5
g++ (GCC) 4.1.2 20060928 (prerelease) (Ubuntu 4.1.1-13ubuntu5)
1
2
3
4
5
Var0: 0xbfdea9e0 : 1
Var1: 0xbfdea9dc : 2
Var2: 0xbfdea9d8 : 3
Var3: 0xbfdea9d4 : 4
Var4: 0xbfdea9d0 : 5
2007-03-08
All mail -> Gmail
看到 Yi-Feng Tzeng’s Blog 的 用 Gmail 收取外部郵件後，開始動手設定我的幾個信箱都納入 Gmail 管理。
兩個學術單位信箱，Y! 需要付費才有 POP3 收信功能，加上最近的 spam 都直接進入 inbox，所以想要放棄 Y! 了，目前它的功能只剩下 tw.clubs 和網拍的認證而已。
Gmail 方便至極，不用我多說。哈哈，但是我還是覺得有些改進的空間，找個時間去寫 feedback 給他們。
兩個學術單位信箱，Y! 需要付費才有 POP3 收信功能，加上最近的 spam 都直接進入 inbox，所以想要放棄 Y! 了，目前它的功能只剩下 tw.clubs 和網拍的認證而已。
Gmail 方便至極，不用我多說。哈哈，但是我還是覺得有些改進的空間，找個時間去寫 feedback 給他們。
2007-02-18
MITOCW grabber
NAME
SYNOPSIS
DESCRIPTION
KNOWN BUGS
AUTHOR
有行數程式碼放在 http://163.26.225.215/~a2n/src/grabber_nu.sh.txt
無行數的程式碼放在 http://163.26.225.215/~a2n/src/grabber.sh.txt
RegExp 小記：
- grabber.sh - Grabbing the MIT OCW course data.
SYNOPSIS
- sh grabber.sh
DESCRIPTION
- 今天清晨睡不著起來寫的一支小程式，專門用來抓 MIT OCW 的課程資料。獲益就是複習和增進 Regular Expression 的用法，並且搭配很多 Unix pipe (|)，小小的心得而已，跟大家分享我的程式。
KNOWN BUGS
1. Welcome.htm 拉到 index.htm 有瑕疵
2. URL.txt 裡面有重複的列，因為課程名稱一樣
AUTHOR
- Alan Lu. (alan0098/a/gmail/d/com)
有行數程式碼放在 http://163.26.225.215/~a2n/src/grabber_nu.sh.txt
無行數的程式碼放在 http://163.26.225.215/~a2n/src/grabber.sh.txt
RegExp 小記：
1. http://www.regular-expressions.info/
2. 有機會的話，用 PHP 實做一次吧。
3. 橋個時間來比賽 RegExp race. :D
2007-01-13
Remote backup
SSH:
dd if=/dev/foo | ssh foo@foo dd of=foo
FTP:
ftp foo
ftp> bin
ftp> put "| dd if=/dev/foo" foo
ftp> get foo "| dd of=/dev/foo"
ftp> get foo.tar.bz2 "| tar -xj -"
ref: 1. http://www.wsp.krakow.pl/~bar/DOC/ssh_backup.html
2. http://0rz.net/741kp
http://publib.boulder.ibm.com/infocenter/pseries/v5r3/index.jsp?
topic=/com.ibm.aix.doc/infocenter/howto/HT_prftungd_slowTSMbkupperf.htm
google: backup dd if= ftp -ssh
dd if=/dev/foo | ssh foo@foo dd of=foo
FTP:
ftp foo
ftp> bin
ftp> put "| dd if=/dev/foo" foo
ftp> get foo "| dd of=/dev/foo"
ftp> get foo.tar.bz2 "| tar -xj -"
ref: 1. http://www.wsp.krakow.pl/~bar/DOC/ssh_backup.html
2. http://0rz.net/741kp
http://publib.boulder.ibm.com/infocenter/pseries/v5r3/index.jsp?
topic=/com.ibm.aix.doc/infocenter/howto/HT_prftungd_slowTSMbkupperf.htm
google: backup dd if= ftp -ssh
2007-01-11
GNU GLOBAL
GNU GLOBAL is a source code tag system that works the same way across diverse environments.
目前轉好兩個專案，分別是 7-zip 和 FileZilla，放在 野人 。提供這種原始碼線上瀏覽的網站，有大名鼎鼎的 Cross-Referencing Linux ，使用 LXR 系統轉換的。
Update: Notepad++ 399 已新增。
17:02:46 :: linux-2.6.19.1 $ time gtags
real 25m56.492s
user 1m44.167s
sys 1m47.283s
17:28:48 :: linux-2.6.19.1 $ time htags
real 43m1.615s
user 3m19.044s
sys 21m41.105s
19:09:04 :: linux-2.6.19.1 $ du -sh HTML/
2.1G HTML/
目前轉好兩個專案，分別是 7-zip 和 FileZilla，放在 野人 。提供這種原始碼線上瀏覽的網站，有大名鼎鼎的 Cross-Referencing Linux ，使用 LXR 系統轉換的。
Update: Notepad++ 399 已新增。
2007-01-05
2006-12-25
2006-12-18
youtube-dl
youtube-dl is a small command-line program to download videos from YouTube.com. It requires the Python interpreter, version 2.4 or later, and it's not platform specific. It should work in your Unix box, in Windows or in Mac OS X. The latest version is 2006.12.07. It's licensed under the MIT License, which means you can modify it, redistribute it or use it however you like complying with a few simple conditions.
http://www.arrakis.es/~rggi3/youtube-dl/
http://www.arrakis.es/~rggi3/youtube-dl/
2006-12-08
agup daily
I've been execute "apup" to "sodu apt-get upgrade" daily, it's more than edgy distribution, so it's a experiment one. I am afraid of that there're many holes in my box, that if I haven't update one.
2006-11-30
2006-11-24
Info: /cygdrive/c/EmbestIDE/Build/xgcc-arm-elf/bin/arm-elf-ld: cannot find -lc
是 FAQ
Please set the searching path of c library and gcc library correctly. Select the menu Project> Settings, open project configuration box, select the linked page and the option to add library searching path in drop-down box:
..\..\..\build\xgcc-arm-elf\arm-elf\lib\arm-inter
..\..\..\build\xgcc-arm-elf\lib\gcc-lib\arm-elf\3.0.2\arm-inter
The above path is the relative path of Embest IDE, users can also set absolute path.
Please set the searching path of c library and gcc library correctly. Select the menu Project> Settings, open project configuration box, select the linked page and the option to add library searching path in drop-down box:
..\..\..\build\xgcc-arm-elf\arm-elf\lib\arm-inter
..\..\..\build\xgcc-arm-elf\lib\gcc-lib\arm-elf\3.0.2\arm-inter
The above path is the relative path of Embest IDE, users can also set absolute path.
2006-11-20
jmsort2.c
#include
//#include "algo.h"
void msort2(int lo, int hi, int S[]);
void mg2(int lo, int mid, int hi, int S[]);
void msort2(int lo, int hi, int S[])
{
int mid;
if ((lo < hi) && ((hi - lo) > 1))
{
mid = (lo + hi) / 2;
//printf(".S[%d]: %d, S[%d]: %d\n", lo, S[lo], mid, S[mid]);
msort2(lo, mid, S);
//printf("..S[%d]: %d, S[%d]: %d\n", mid + 1, S[mid + 1], hi, S[ hi]);
msort2(mid + 1, hi, S);
// Upper is OK
printf("\nlo: %d, mid: %d, hi: %d\n", lo, mid, hi);
mg2(lo, mid, hi, S);
}
}
void mg2(int lo, int mid, int hi, int S[])
{
int i = lo;
int j = mid + 1;
int k = lo;
int U[16];
while ((i <= mid) && (j <= hi))
{
if (S[i] < S[j]) U[k] = S[i++];
else U[k] = S[j++];
k++;
}
int a;
if (i < mid)
for (a = i; a <= mid; a++)
U[a+k] = S[i+a];
else
for (a = j; a <= hi; a++)
U[k+a] = S[j+a];
for (a = lo; a <= hi; a++)
{
S[a] = U[a];
printf("S[%d]: %d, ", a, S[a]);
}
printf("\n");
}
int main(void)
{
int S[] = { 27, 10, 12, 20, 25, 13, 15, 22 };
int sz = sizeof(S) / 4;
int lo = 0;
int hi = sz - 1;
msort2(lo, hi, S);
printf("\nFinally: ");
int a;
for (a = 0; a < 8; a++)
printf("%d, ", S[a]);
printf("\n");
return 0;
}
2006-11-19
HTML <> 的特殊用法
http://www.w3.org/TR/html4/charset.html
"<" represents the < sign.
">" represents the > sign.
"&" represents the & sign.
"" represents the " mark.
"<" represents the < sign.
">" represents the > sign.
"&" represents the & sign.
"" represents the " mark.
見鬼了，指標無敵啦！
說什麼 in-place 可以節省記憶體空間。只要餵 pointer 過去就無敵了，可是怎麼偵測正確的 sizeof() 呢？ o_O? 頭大！
Code:
Output:
Code:
#include <stdio.h>
int foo(int *pA);
int foo2(int A[]);
int main(void)
{
int A[] = { 5, 7 };
int *pA = A;
printf("%d\n", sizeof(A));
printf("%d\n", sizeof(*pA)); // 其實我是第一個元素的大小
printf("%d\n", sizeof(*(pA + 1))); // 我是第二個元素的大小
printf("%d\n", foo(pA));
printf("%d\n", foo2(A)); // 其實我也是傳第一個指標過去而已
return 0;
}
int foo(int *pA)
{ return sizeof(*pA); }
int foo2(int A[])
{ return *(A + 1); }
Output:
8
4
4
4
7
2006-11-18
[有進步] Once I've used freopen, how can I get the original stdout (or stdin) back?
今天遇到的，有進步。
http://c-faq.com/stdio/undofreopen.html
#Output
Hello, World2
And the "Hello, World" is write into *fp points to, "foo.txt".
Mistake example
#Output
(nothing)
Because the "Hello, World" was be redirect to "foo.txt", althought it was already excused fclose(fp), but we got nothing from stdout. So the better way is to using fprintf().
http://c-faq.com/stdio/undofreopen.html
FILE *fp;
freopen("foo.txt", "w", stdout);
fprintf(fp, "Hello, World\n");
fclose(fp);
printf("Hello, World2\n");
#Output
Hello, World2
And the "Hello, World" is write into *fp points to, "foo.txt".
Mistake example
FILE *fp = freopen("foo.txt", "w", stdout);
printf("Hello, World\n");
fclose(fp);
printf("Hello, World2\n");
#Output
(nothing)
Because the "Hello, World" was be redirect to "foo.txt", althought it was already excused fclose(fp), but we got nothing from stdout. So the better way is to using fprintf().
2006-11-17
Err Log
pushd: not found
Makefile:40: WARNING: No kernel PCMCIA support found and PCMCIA_PATH is not defined
Makefile:47: WARNING: Linux wireless extensions, CONFIG_NET_RADIO, not enabled in the kernel
make[2]: *** [include/bits/getopt.h] Error 1
configure: error: `LDFLAGS' was not set in the previous run
configure: error: `CFLAGS' was not set in the previous run
configure: error: `CC' was not set in the previous run
configure: error: changes in the environment can compromise the build
configure: error: run `make distclean' and/or `rm config.cache' and start over
make[2]: *** [config.status] Error 1
make[2]: [_mopup] Error 1 (ignored)
make[2]: [_mopup] Error 1 (ignored)
make[3]: *** No rule to make target `clean'. Stop.
make[2]: [_tidy] Error 2 (ignored)
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
make[2]: [_tidy] Error 2 (ignored)
make[2]: *** No rule to make target `clean'. Stop.
awk: build-config.awk:16: fatal: cannot open file `Config.h' for reading (No such file or directory)
make[2]: *** [config.h] Error 2
configure: error: C compiler cannot create executables
See `config.log' for more details.
make[2]: *** [config.status] Error 77
Makefile:40: WARNING: No kernel PCMCIA support found and PCMCIA_PATH is not defined
Makefile:47: WARNING: Linux wireless extensions, CONFIG_NET_RADIO, not enabled in the kernel
make[2]: *** [include/bits/getopt.h] Error 1
configure: error: `LDFLAGS' was not set in the previous run
configure: error: `CFLAGS' was not set in the previous run
configure: error: `CC' was not set in the previous run
configure: error: changes in the environment can compromise the build
configure: error: run `make distclean' and/or `rm config.cache' and start over
make[2]: *** [config.status] Error 1
make[2]: [_mopup] Error 1 (ignored)
make[2]: [_mopup] Error 1 (ignored)
make[3]: *** No rule to make target `clean'. Stop.
make[2]: [_tidy] Error 2 (ignored)
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
../../miniperl: not found
make[3]: *** No rule to make target `clean'. Stop.
make[2]: [_tidy] Error 2 (ignored)
make[2]: *** No rule to make target `clean'. Stop.
awk: build-config.awk:16: fatal: cannot open file `Config.h' for reading (No such file or directory)
make[2]: *** [config.h] Error 2
configure: error: C compiler cannot create executables
See `config.log' for more details.
make[2]: *** [config.status] Error 77
2006-11-09
[Windows script] backup.bat
:: Author: Alan Lu
:: Date: 2006-11-09
:: Purpose: Backing up one directory by 7-zip compressor.
:: Ref: http://www.microsoft.com/technet/abouttn/flash/tips/tips_053106_2.mspx
:: Usage:
:: $> backup.bat
:: or
:: $> at 03:00 /every:Sunday backup.bat
@echo off
cls
::
:: %workspace% is a directory name where you want backup.
:: Don't forgot modify the %workspace%'s default value.
set workspace=foo
:: Setting environment variables with todoy's date values
for /f "tokens=1-4 delims=/" %%i IN ('date /t') DO (
set year=%%i
set month=%%j
set day=%%k
)
for /f "tokens=1-3 delims=:" %%i IN ('time /t') DO (
set hour=%%i
set minute=%%j
)
7z a -mx=9 "%year%-%month%-%day%-%hour%-%minute%.7z" %workspace%
2006-10-31
2006-10-21
2006-10-20
[Windows Batch] Getting MAC by ping
$ for /l %i IN (1, 1, 254) DO ping -f -n 1 -w 1 -s 1 -r 1 -i 1 -l 1 zz.xx.cc.%i
$for /l %j IN (1, 1, 220) DO
for /l %i IN (1, 1, 254) DO ping -f -n 1 -w 1 -s 1 -r 1 -i 1 -l 1 zz.xx.cc.%i
$for /l %j IN (1, 1, 220) DO
for /l %i IN (1, 1, 254) DO ping -f -n 1 -w 1 -s 1 -r 1 -i 1 -l 1 zz.xx.cc.%i
2006-10-13
[Windows Batch] for
因為幫辦公室妹妹轉 JPG into PDF，想到 ImageMagick 的 convert。但是 cygwin 無法處理中文檔名，所以就翻 Windows Help 找 "for" 的用法，以下是一行解。
for /R %i IN (*.jpg) DO convert "%i" "%~dpni".pdf
for /R %i IN (*.jpg) DO convert "%i" "%~dpni".pdf
2006-10-08
Memory Management
http://www.memorymanagement.org/bib/f.html
http://www.memorymanagement.org/
http://en.wikipedia.org/wiki/Memory_debugger
好站！繼續衝，今天看到 Ch.8 的 "Pointer & Dynamic memory"，遇到 malloc() & free() 就軟掉了，因為我沒有 ANSI C 的手冊可以查，所以 code 看的很暈，其實自己也對 codes 有恐懼跟軟掉感，哈哈，加油啊！
想買 C++ Primer 的衝動，先借來看看吧。
Michael C. Daconta
http://www.memorymanagement.org/
http://en.wikipedia.org/wiki/Memory_debugger
好站！繼續衝，今天看到 Ch.8 的 "Pointer & Dynamic memory"，遇到 malloc() & free() 就軟掉了，因為我沒有 ANSI C 的手冊可以查，所以 code 看的很暈，其實自己也對 codes 有恐懼跟軟掉感，哈哈，加油啊！
想買 C++ Primer 的衝動，先借來看看吧。
Michael C. Daconta
2006-10-07
C的指標和動態記憶體管理
某個週末和佑安去探訪二手書坊，買了一本〝 C的指標和動態記憶體管理 (C pointers and dynamic memory management)〞，這本書讓我比較了解指標的用法，目前我看到 Ch5. Array & Pointer。
我只花了 NT$ 70 買，應該是處超超超所值啦，後~~ ^_________^
以下是延伸的資源：
- C, 資料結構, 進階程式設計技巧參考書目簡介 (1/3)
是 ghost 長輩寫的，哈哈，他最喜歡挖書了。
2006-10-06
NAND Flash
NAND memories
NAND flash memories cannot provide execute-in-place due to their different construction principles. These memories are accessed much like block devices such as hard disks or memory cards. The blocks are typically 512 or 2048 bytes in size. Associated with each block are a few bytes (typically 12–16 bytes) that should be used for storage of an error detection and correction block checksum.
NAND devices typically have software-based bad block management. This means that when a logical block is accessed it is mapped to a physical block, and the device has a number of blocks set aside for compensating bad blocks and for storing primary and secondary mapping tables.
The error-correcting and detecting checksum will typically correct an error where one bit in the block is incorrect. When this happens, the block is marked bad in a logical block allocation table, and its (still undamaged) contents are copied to a new block and the logical block allocation table is altered accordingly. If more than one bit in the memory is corrupted, the contents are partly lost, i.e. it is no longer possible to reconstruct the original contents. Some devices may even come with a pre-programmed bad block table from the manufacturer, since it is sometimes impossible to manufacture error-free NAND memories.
The first error-free physical block (block 0) is always guaranteed to be readable and free from errors. Hence, all vital pointers for partitioning and bad block management for the device must be located inside this block (typically a pointer to the bad block tables etc). If the device is used for booting a system, this block must contain the master boot record.
When executing software from NAND memories, virtual memory strategies are used: memory contents must first be paged or copied into memory-mapped RAM and executed there. A memory management unit (MMU) in the system is helpful, but this can also be accomplished with overlays.
For this reason, some systems will use a combination of NOR and NAND memories, where a smaller NOR memory is used as software ROM and a larger NAND memory is partitioned with a file system for use as a random access storage area.
NAND flash memories cannot provide execute-in-place due to their different construction principles. These memories are accessed much like block devices such as hard disks or memory cards. The blocks are typically 512 or 2048 bytes in size. Associated with each block are a few bytes (typically 12–16 bytes) that should be used for storage of an error detection and correction block checksum.
NAND devices typically have software-based bad block management. This means that when a logical block is accessed it is mapped to a physical block, and the device has a number of blocks set aside for compensating bad blocks and for storing primary and secondary mapping tables.
The error-correcting and detecting checksum will typically correct an error where one bit in the block is incorrect. When this happens, the block is marked bad in a logical block allocation table, and its (still undamaged) contents are copied to a new block and the logical block allocation table is altered accordingly. If more than one bit in the memory is corrupted, the contents are partly lost, i.e. it is no longer possible to reconstruct the original contents. Some devices may even come with a pre-programmed bad block table from the manufacturer, since it is sometimes impossible to manufacture error-free NAND memories.
The first error-free physical block (block 0) is always guaranteed to be readable and free from errors. Hence, all vital pointers for partitioning and bad block management for the device must be located inside this block (typically a pointer to the bad block tables etc). If the device is used for booting a system, this block must contain the master boot record.
When executing software from NAND memories, virtual memory strategies are used: memory contents must first be paged or copied into memory-mapped RAM and executed there. A memory management unit (MMU) in the system is helpful, but this can also be accomplished with overlays.
For this reason, some systems will use a combination of NOR and NAND memories, where a smaller NOR memory is used as software ROM and a larger NAND memory is partitioned with a file system for use as a random access storage area.
NOR Flash
http://en.wikipedia.org/wiki/NOR_flash
NOR memories
The read-only mode of NOR memories is similar to reading from a common memory, provided address and data bus is mapped correctly, so NOR flash memory is much like any address-mapped memory. NOR flash memories can be used as execute-in-place memory (XIP), meaning it behaves as a ROM memory mapped to a certain address. NOR flash memories have no intrinsic bad block management, so when a flash block is worn out, either the software using it has to handle this, or the device breaks.
When unlocking, erasing or writing NOR memories, special commands are written to the first page of the mapped memory. These commands are defined as the Common Flash memory Interface (defined by Intel) and the flash circuit will provide a list of all available commands to the physical driver.
Apart from being used as a ROM, the NOR memories can, of course, also be partitioned with a file system and used as any storage device.
NOR memories
The read-only mode of NOR memories is similar to reading from a common memory, provided address and data bus is mapped correctly, so NOR flash memory is much like any address-mapped memory. NOR flash memories can be used as execute-in-place memory (XIP), meaning it behaves as a ROM memory mapped to a certain address. NOR flash memories have no intrinsic bad block management, so when a flash block is worn out, either the software using it has to handle this, or the device breaks.
When unlocking, erasing or writing NOR memories, special commands are written to the first page of the mapped memory. These commands are defined as the Common Flash memory Interface (defined by Intel) and the flash circuit will provide a list of all available commands to the physical driver.
Apart from being used as a ROM, the NOR memories can, of course, also be partitioned with a file system and used as any storage device.
2006-10-04
How do I uninstall all of Cygwin?
http://www.cygwin.com/faq/faq_2.html#SEC20
Setup has no automatic uninstall facility. The recommended method to
remove all of Cygwin is as follows:
Remove all Cygwin services. If a service is currently running, it must first be stopped with `cygrunsrv -E name', where `name' is the name of the service. Then use `cygrunsrv -R name' to uninstall the service from the registry. Repeat this for all services that you installed. Common services that might have been installed are sshd, cron, cygserver, inetd, apache, and so on.
Stop the X11 server if it is running, and terminate any Cygwin programs that might be running in the background. Remove all mount information by typing `umount -A' and then exit the command prompt and ensure that no Cygwin processes remain. Note: If you want to save your mount points for a later reinstall, first save the output of `mount -m' as described at http://cygwin.com/cygwin-ug-net/using-utils.html#mount.
Delete the Cygwin root folder and all subfolders. If you get an error that an object is in use, then ensure that you've stopped all services and closed all Cygwin programs. If you get a 'Permission Denied' error then you will need to modify the permissions and/or ownership of the files or folders that are causing the error. For example, sometimes files used by system services end up owned by the SYSTEM account and not writable by regular users. The quickest way to delete the entire tree if you run into this problem is to change the ownership of all files and folders to your account. To do this in Windows Explorer, right click on the root Cygwin folder, choose Properties, then the Security tab. Select Advanced, then go to the Owner tab and make sure your account is listed as the owner. Select the 'Replace owner on subcontainers and objects' checkbox and press Ok. After Explorer applies the changes you should be able to delete the entire tree in one operation. Note that you can also achieve this in Cygwin by typing `chown -R user /' or by using other tools such as CACLS.EXE.
Delete the Cygwin shortcuts on the Desktop and Start Menu, and anything left by setup.exe in the download directory. However, if you plan to reinstall Cygwin it's a good idea to keep your setup.exe download directory since you can reinstall the packages left in its cache without redownloading them.
If you added Cygwin to your system path, you should remove it unless you plan to reinstall Cygwin to the same location. Similarly, if you set your CYGWIN environment variable system-wide and don't plan to reinstall, you should remove it.
Finally, if you want to be thorough you can delete the registry tree `Software\Cygnus Solutions' under HKEY_LOCAL_MACHINE and/or HKEY_CURRENT_USER. However, if you followed the directions above you will have already removed all the mount information which is typically
the only thing stored in the registry.
--
Alan Lu, a man, enjoy programming & UNIX.
My website: http://alan0098.googlepages.com/
2006-10-02
[Bash] .
Generating a script named "start.sh" file like below,
#!/bin/sh
export PATH=/foo/foo:$PATH
Then, we need excute ". start.sh".
$ man 1 bash
BASH_ARGC
An array variable whose values are the number of parameters in each
frame of the current bash execution call stack. The number of
parameters to the current subroutine (shell function or script
executed with . or source) is at the top of the stack. When a
subroutine is executed, the number of parameters passed is pushed onto
BASH_ARGC. The shell sets BASH_ARGC only when in extended debugging
mode (see the description of the extdebug option to the shopt builtin
below)
--
Alan Lu, a man, enjoy programming & UNIX.
My website: http://alan0098.googlepages.com/
2006-09-29
ANSI C, lvalue
Value (computer science)
In C: L-value and r-value
Some languages use the idea of l-value and r-value. L-values are values that have addresses, meaning they are variables or dereferenced references to a certain place. R-value is either l-value or non-l-value — a term only used to distinguish from l-value. In C, the term l-value originally meant something that could be assigned (coming from left-value, indicating it was on the left side of the = operator), but since 'const' was added to the language, this now is termed a 'modifiable l-value'.
An l-value is an expression that designates (refers to) an object. A non-modifiable l-value is addressable, but not assignable. A modifiable l-value allows the designated object to be changed as well as examined. An r-value is any expression that is not an l-value, it refers to a data value that is stored at some address in memory.
In C: L-value and r-value
Some languages use the idea of l-value and r-value. L-values are values that have addresses, meaning they are variables or dereferenced references to a certain place. R-value is either l-value or non-l-value — a term only used to distinguish from l-value. In C, the term l-value originally meant something that could be assigned (coming from left-value, indicating it was on the left side of the = operator), but since 'const' was added to the language, this now is termed a 'modifiable l-value'.
An l-value is an expression that designates (refers to) an object. A non-modifiable l-value is addressable, but not assignable. A modifiable l-value allows the designated object to be changed as well as examined. An r-value is any expression that is not an l-value, it refers to a data value that is stored at some address in memory.
2006-09-28
NTFS sucks!
In cygwin with NTFS of WindowsXP sp2 environment, I''d input:
mv uClinux-dist /usr/local/src
take me about 30minutes, it's really sucks!!
In Linux box, the inode will help it shorter. But why? Let me study in the Ch.11 FileSystem.
mv uClinux-dist /usr/local/src
take me about 30minutes, it's really sucks!!
In Linux box, the inode will help it shorter. But why? Let me study in the Ch.11 FileSystem.
patch -p0
-pnum or --strip=num
Strip the smallest prefix containing num leading slashes from each file name found in the patch file. A sequence of one or more adjacent slashes is counted as a single slash. This controls how file names found in the patch file are treated, in case you keep your files in a different directory than the person who sent out the patch. For example, supposing the file name in the patch file was
/u/howard/src/blurfl/blurfl.c
setting -p0 gives the entire file name unmodified, -p1 gives
u/howard/src/blurfl/blurfl.c
without the leading slash, -p4 gives
blurfl/blurfl.c
and not specifying -p at all just gives you blurfl.c. Whatever you end up with is looked for either in the current directory, or the directory specified by the -d option.
Strip the smallest prefix containing num leading slashes from each file name found in the patch file. A sequence of one or more adjacent slashes is counted as a single slash. This controls how file names found in the patch file are treated, in case you keep your files in a different directory than the person who sent out the patch. For example, supposing the file name in the patch file was
/u/howard/src/blurfl/blurfl.c
setting -p0 gives the entire file name unmodified, -p1 gives
u/howard/src/blurfl/blurfl.c
without the leading slash, -p4 gives
blurfl/blurfl.c
and not specifying -p at all just gives you blurfl.c. Whatever you end up with is looked for either in the current directory, or the directory specified by the -d option.
2006-09-14
Google Reader -> Bloglines
Ya, I did it in today, 'cuz the AJAX operation is such slowly in Opera 9.00, and some error often occured in operation. So that, I exported all of feed to bloglines.
My buddy, Howl suggests me some useful RSS reader, I've never tried it yet, 'cuz now I prefer the on-line service (a.k.a API application). Maybe next time, I'll try these good tool. :-)
2006-08-26
for
To untar all tarballs
$ for i in `ls -1 --color=never`;do tar -xjf "$i";done
Zipping all directory to echo directory which with prefix as $i
$ for i in `ls -1d --color=never */`;do 7z a -mx=9 "$i".7z "$i";done
Zipping all directory to current direcotry with directory name as its prefix
$ for i in $(ls -1d --color=never *`;do 7z a -mx=9 $i.7z $i;done
$ for i in `ls -1 --color=never`;do tar -xjf "$i";done
Zipping all directory to echo directory which with prefix as $i
$ for i in `ls -1d --color=never */`;do 7z a -mx=9 "$i".7z "$i";done
Zipping all directory to current direcotry with directory name as its prefix
$ for i in $(ls -1d --color=never *`;do 7z a -mx=9 $i.7z $i;done
2006-08-22
2006-08-20
Realtek 8139
One day, we've a network curriculum in FEC, Ralph told us that the Realtek 8139 ethernet chip is good than others, 'cuz it can be program and control as we hope.
Util today, I's visited the Realtek 8139 spec webpage, the last one is 75 pages, well~ well~ well~ it's more better than the D-Link 530Tx+ for me.
Extend:
*RTL8139C(L)+
*RTL8139C(L)
*Network Interface Controllers (list all)
2006-08-16
Embedded Linux Graphics Quick Reference Guide
PicoGUI
FBUI
FBUI is currently written for 16,24, and 32-bit RGB displays, particularly VESA. I may add 4-bit VGA later.
PicoGUI
FBUI
FBUI is currently written for 16,24, and 32-bit RGB displays, particularly VESA. I may add 4-bit VGA later.
2006-08-04
New House LAN
Getway: 192.168.0.1
**
HTTP/1.0 400 Bad Request
Content-type: text/html
Pragma: no-cache
Date: Fri, 04 Aug 2006 14:06:10 GMT
Last-modified: Fri, 04 Aug 2006 14:06:10 GMT
Accept-Ranges: bytes
Connection: close
**
Starting Nmap 4.11 ( http://www.insecure.org/nmap ) at 2006-08-04 22:02 台北標準時間
Interesting ports on 192.168.0.1:
Not shown: 1678 closed ports
PORT STATE SERVICE
80/tcp open http
8080/tcp open http-proxy
MAC Address: 00:0E:A0:00:08:84 (NetKlass Technology)
Device type: general purpose
Running: Linux 2.4.X|2.5.X
OS details: Linux 2.4.0 - 2.5.20
Uptime 0.492 days (since Fri Aug 04 10:14:05 2006)
Nmap finished: 1 IP address (1 host up) scanned in 8.734 seconds
**
Tracing route to w3.cc.ntu.edu.tw [140.112.8.130]
over a maximum of 30 hops:
1 2 ms 2 ms 2 ms 192.168.0.1
2 35 ms 45 ms 34 ms 218-175-144-254.dynamic.hinet.net [218.175.144.2
54]
3 44 ms 42 ms 32 ms tn-st-c6r1.router.hinet.net [168.95.54.18]
4 33 ms 43 ms 42 ms tn-st-c12r12.router.hinet.net [220.128.27.118]
5 38 ms 44 ms 32 ms kh-c12r12.router.hinet.net [220.128.25.30]
6 39 ms 50 ms 39 ms tp-s2-c12r12.router.hinet.net [220.128.2.14]
7 55 ms 40 ms 51 ms tp-s2-c12r2.router.hinet.net [220.128.2.113]
8 45 ms 50 ms 38 ms tp-s2-c76r2.router.hinet.net [211.22.35.213]
9 40 ms 52 ms 64 ms 211.22.35.177
10 52 ms 41 ms 54 ms 211.20.43.121
11 52 ms 40 ms 54 ms w3.cc.ntu.edu.tw [140.112.8.130]
Trace complete.
**
$telnet 192.168.0.1 80HTTP/1.0 400 Bad Request
Content-type: text/html
Pragma: no-cache
Date: Fri, 04 Aug 2006 14:06:10 GMT
Last-modified: Fri, 04 Aug 2006 14:06:10 GMT
Accept-Ranges: bytes
Connection: close
**
$nmap -O 192.168.0.1Starting Nmap 4.11 ( http://www.insecure.org/nmap ) at 2006-08-04 22:02 台北標準時間
Interesting ports on 192.168.0.1:
Not shown: 1678 closed ports
PORT STATE SERVICE
80/tcp open http
8080/tcp open http-proxy
MAC Address: 00:0E:A0:00:08:84 (NetKlass Technology)
Device type: general purpose
Running: Linux 2.4.X|2.5.X
OS details: Linux 2.4.0 - 2.5.20
Uptime 0.492 days (since Fri Aug 04 10:14:05 2006)
Nmap finished: 1 IP address (1 host up) scanned in 8.734 seconds
**
$tracert www.ntu.edu.twTracing route to w3.cc.ntu.edu.tw [140.112.8.130]
over a maximum of 30 hops:
1 2 ms 2 ms 2 ms 192.168.0.1
2 35 ms 45 ms 34 ms 218-175-144-254.dynamic.hinet.net [218.175.144.2
54]
3 44 ms 42 ms 32 ms tn-st-c6r1.router.hinet.net [168.95.54.18]
4 33 ms 43 ms 42 ms tn-st-c12r12.router.hinet.net [220.128.27.118]
5 38 ms 44 ms 32 ms kh-c12r12.router.hinet.net [220.128.25.30]
6 39 ms 50 ms 39 ms tp-s2-c12r12.router.hinet.net [220.128.2.14]
7 55 ms 40 ms 51 ms tp-s2-c12r2.router.hinet.net [220.128.2.113]
8 45 ms 50 ms 38 ms tp-s2-c76r2.router.hinet.net [211.22.35.213]
9 40 ms 52 ms 64 ms 211.22.35.177
10 52 ms 41 ms 54 ms 211.20.43.121
11 52 ms 40 ms 54 ms w3.cc.ntu.edu.tw [140.112.8.130]
Trace complete.
2006-07-13
Burning Tools
Because I re-partition my disc and re-install my Windows box, so I was stay in Win32 environment for setting.
Some neat utilities I prefer, like the burning CD tools. Today, I found the CDBurn.exe by Google, it's made in M$, project named "Windows Server 2003 Resource Kit Tools", and found this information in "How can I write ISO files to CD?".
So that now, I using it to burn out the Ubuntu Linux 6.06 CD for installing my Linux box later. ;)
An other tool as I found, "CreateCD"
2006-07-12
ISO Tools
Today, I bough a joy stick to play game, include "Silent Hill" and "MapleStory" or Hafe Life".
The Silent Hill 3 that I download ISO file, thus I need to mount it then install and play it. First, I try to install the "Alcohol 50%", it's a simple version with "Alcohol 120%", without the burn CD/DVD function, and it has non-registry. Both 50% and 120% are can generate ISO file.
Second, I installed the "WinISO", but it seems older than "IsoBuster", and WinISO cannot edit files which more than 2GB, but IsoBuster can satisfied.
Finally, I tried the "DAEMON tools", it seems as the same principle like Alcohol, 'cuz durning the install procedure, it prompts a warning dialog, said something like, "If u install this program, maybe ur debugger, like ICE... cannot run well.". Ya... u know, in Unix-Like OSes, we can mount ISO file as a file node, for genernal at /mnt. Maybe these tools also did like Unix-Like.
"Daemon tools" doesn't need to registry and has no prompt dialog, haha, it's good for me, 'cuz the dialog is really really bother me... even everyone except the Darmon tool TEAM. :P
Thus... I pick and choose the "Daemon Tools" for mount ISO files. Maybe after this moment, I need to programs which support burn out a ISO files and NO REGISTRY DIALOG.
:D :D
The Silent Hill 3 that I download ISO file, thus I need to mount it then install and play it. First, I try to install the "Alcohol 50%", it's a simple version with "Alcohol 120%", without the burn CD/DVD function, and it has non-registry. Both 50% and 120% are can generate ISO file.
Second, I installed the "WinISO", but it seems older than "IsoBuster", and WinISO cannot edit files which more than 2GB, but IsoBuster can satisfied.
Finally, I tried the "DAEMON tools", it seems as the same principle like Alcohol, 'cuz durning the install procedure, it prompts a warning dialog, said something like, "If u install this program, maybe ur debugger, like ICE... cannot run well.". Ya... u know, in Unix-Like OSes, we can mount ISO file as a file node, for genernal at /mnt. Maybe these tools also did like Unix-Like.
"Daemon tools" doesn't need to registry and has no prompt dialog, haha, it's good for me, 'cuz the dialog is really really bother me... even everyone except the Darmon tool TEAM. :P
Thus... I pick and choose the "Daemon Tools" for mount ISO files. Maybe after this moment, I need to programs which support burn out a ISO files and NO REGISTRY DIALOG.
:D :D
2006-07-11
Meeting Log
Mine
The seven times of add action, it brings PC out to INTERRUPT AREA, avoid to excute the interrupt vector.
Our next step is getting to Linux-based tutorial. It's so happy to meet these nonOS tutorial, and we consider that these advance sections should be study later, except advisor indicated LED section.
NOTE: The UNet ICE can use in Embest 2005 Pro.
.equ WTCON, 0x01d30000
.equ WTCON, 0x01d30000
.equ PCONE, 0x01d20028
.equ LOCKTIME, 0x1d8000c
.equ PLLCON, 0x01d80000
.equ CLKCON, 0x01d80004
.globl start
start:
b reset
add pc, pc, #0x0c000000
add pc, pc, #0x0c000000
add pc, pc, #0x0c000000
add pc, pc, #0x0c000000
add pc, pc, #0x0c000000
add pc, pc, #0x0c000000
add pc, pc, #0x0c000000
The seven times of add action, it brings PC out to INTERRUPT AREA, avoid to excute the interrupt vector.
Our next step is getting to Linux-based tutorial. It's so happy to meet these nonOS tutorial, and we consider that these advance sections should be study later, except advisor indicated LED section.
NOTE: The UNet ICE can use in Embest 2005 Pro.
2006-07-05
__divsi3
When we hacking C code, found that c code in the disassembly window, the for() loop was be translated to __divsi3. Thus, we hacking the "__divsi3" in the cygwin.
After I hacked the gcc-core source code, at gcc-4.1.1/gcc/config/ia64/lib1funcs.asm, as below:
---
---
Inside of the "config" sub-directory, there has more plaform implement the __divsi3 function. Thus, many platform need the function, but used different their assembly instruction.
--
a2n@ubuntu-en:config$ grep -r "__divsi3" *
alpha/alpha.c: /* Prevent gcc from generating calls to __divsi3. */
arc/lib1funcs.asm: .global ___divsi3
arc/lib1funcs.asm:___divsi3:
arm/lib1funcs.asm: bl SYM(__divsi3)
arm/lib1funcs.asm: bl SYM(__divsi3)
bfin/lib1funcs.asm:.global ___divsi3;
bfin/lib1funcs.asm:.type ___divsi3, STT_FUNC;
bfin/lib1funcs.asm:___divsi3:
bfin/lib1funcs.asm: CALL ___divsi3;
divmod.c:__divsi3 (long a, long b)
h8300/lib1funcs.asm: .global ___divsi3
h8300/lib1funcs.asm:___divsi3:
h8300/h8300.c: "__divsi3",
ia64/lib1funcs.asm:#ifdef L__divsi3
ia64/lib1funcs.asm: .global __divsi3
ia64/lib1funcs.asm: .proc __divsi3
ia64/lib1funcs.asm:__divsi3:
ia64/lib1funcs.asm: .endp __divsi3
ia64/ia64.c: set_optab_libfunc (sdiv_optab, SImode, "__divsi3");
ia64/t-ia64: __divsi3 __modsi3 __udivsi3 __umodsi3 __save_stack_nonlocal m32c/m32c-lib2.c:SItype __divsi3 (SItype a, SItype b);
m32c/m32c-lib2.c:__divsi3 (SItype a, SItype b)
m68k/lb1sf68.asm: .globl SYM (__divsi3)
m68k/lb1sf68.asm:SYM (__divsi3):
m68k/lb1sf68.asm: PICCALL SYM (__divsi3)
mt/lib2extra-funcs.c:__divsi3 (SItype a, SItype b)
stormy16/stormy16-lib2.c:extern SItype __divsi3 (SItype, SItype);
stormy16/stormy16-lib2.c:__divsi3 (SItype a, SItype b)
v850/lib1funcs.asm: .globl ___divsi3
v850/lib1funcs.asm: .type ___divsi3,@function
v850/lib1funcs.asm:___divsi3:
v850/lib1funcs.asm: .size ___divsi3,.-___divsi3
v850/lib1funcs.asm: jarl ___divsi3,r31
xtensa/lib1funcs.asm: .global __divsi3
xtensa/lib1funcs.asm: .type __divsi3,@function
xtensa/lib1funcs.asm:__divsi3:
xtensa/lib1funcs.asm: .size __divsi3,.-__divsi3
--
After I hacked the gcc-core source code, at gcc-4.1.1/gcc/config/ia64/lib1funcs.asm, as below:
---
#ifdef L__divsi3
// Compute a 32-bit integer quotient.
//
// From the Intel IA-64 Optimization Guide, choose the minimum latency
// alternative.
//
// in0 holds the dividend. in1 holds the divisor.
.text
.align 16
.global __divsi3
.proc __divsi3
__divsi3:
.regstk 2,0,0,0
// Check divide by zero.
cmp.ne.unc p0,p7=0,in1
sxt4 in0 = in0
sxt4 in1 = in1
;;
setf.sig f8 = in0
setf.sig f9 = in1
(p7) break 1
;;
mov r2 = 0x0ffdd
fcvt.xf f8 = f8
fcvt.xf f9 = f9
;;
setf.exp f11 = r2
frcpa.s1 f10, p6 = f8, f9
;;
(p6) fmpy.s1 f8 = f8, f10
(p6) fnma.s1 f9 = f9, f10, f1
;;
(p6) fma.s1 f8 = f9, f8, f8
(p6) fma.s1 f9 = f9, f9, f11
;;
(p6) fma.s1 f10 = f9, f8, f8
;;
fcvt.fx.trunc.s1 f10 = f10
;;
getf.sig ret0 = f10
br.ret.sptk rp
;;
.endp __divsi3
#endif---
Inside of the "config" sub-directory, there has more plaform implement the __divsi3 function. Thus, many platform need the function, but used different their assembly instruction.
--
a2n@ubuntu-en:config$ grep -r "__divsi3" *
alpha/alpha.c: /* Prevent gcc from generating calls to __divsi3. */
arc/lib1funcs.asm: .global ___divsi3
arc/lib1funcs.asm:___divsi3:
arm/lib1funcs.asm: bl SYM(__divsi3)
arm/lib1funcs.asm: bl SYM(__divsi3)
bfin/lib1funcs.asm:.global ___divsi3;
bfin/lib1funcs.asm:.type ___divsi3, STT_FUNC;
bfin/lib1funcs.asm:___divsi3:
bfin/lib1funcs.asm: CALL ___divsi3;
divmod.c:__divsi3 (long a, long b)
h8300/lib1funcs.asm: .global ___divsi3
h8300/lib1funcs.asm:___divsi3:
h8300/h8300.c: "__divsi3",
ia64/lib1funcs.asm:#ifdef L__divsi3
ia64/lib1funcs.asm: .global __divsi3
ia64/lib1funcs.asm: .proc __divsi3
ia64/lib1funcs.asm:__divsi3:
ia64/lib1funcs.asm: .endp __divsi3
ia64/ia64.c: set_optab_libfunc (sdiv_optab, SImode, "__divsi3");
ia64/t-ia64: __divsi3 __modsi3 __udivsi3 __umodsi3 __save_stack_nonlocal m32c/m32c-lib2.c:SItype __divsi3 (SItype a, SItype b);
m32c/m32c-lib2.c:__divsi3 (SItype a, SItype b)
m68k/lb1sf68.asm: .globl SYM (__divsi3)
m68k/lb1sf68.asm:SYM (__divsi3):
m68k/lb1sf68.asm: PICCALL SYM (__divsi3)
mt/lib2extra-funcs.c:__divsi3 (SItype a, SItype b)
stormy16/stormy16-lib2.c:extern SItype __divsi3 (SItype, SItype);
stormy16/stormy16-lib2.c:__divsi3 (SItype a, SItype b)
v850/lib1funcs.asm: .globl ___divsi3
v850/lib1funcs.asm: .type ___divsi3,@function
v850/lib1funcs.asm:___divsi3:
v850/lib1funcs.asm: .size ___divsi3,.-___divsi3
v850/lib1funcs.asm: jarl ___divsi3,r31
xtensa/lib1funcs.asm: .global __divsi3
xtensa/lib1funcs.asm: .type __divsi3,@function
xtensa/lib1funcs.asm:__divsi3:
xtensa/lib1funcs.asm: .size __divsi3,.-__divsi3
--
2006-07-03
Meeting Log
My slide
howls'
TODO for Wed.:
*Reinforcing the script section, add Memory Layout from the lecture of china.
*Replacing "CS :: Example" by more complete example, better for demo and present.
Meeting note:
*Thumb mode
--
--
16-bit data line mode {00, 01}, {10, 11}, the MSB bit is exange by "0" and "1". 32-bit is {00, 01, 10, 11}, {100, 101, 110, 111}. The default mode is .arm, thus load the instruction to memory by 3-bits.
For parting 16-bit and 32-bit mode; it's 16-bit if LSB is 1, so "Tstart +1", is plus LSB bit to 1 to tail of machine code.
Return 32-bit mode from 16-bit, we can use "mov pc, lr".
*One label of Literal can be present more different types.
howls'
TODO for Wed.:
*Reinforcing the script section, add Memory Layout from the lecture of china.
*Replacing "CS :: Example" by more complete example, better for demo and present.
Meeting note:
*Thumb mode
--
.arm
adr r0, Tstart +1
bx r0
.thumb
Tstart:
[...]
--
16-bit data line mode {00, 01}, {10, 11}, the MSB bit is exange by "0" and "1". 32-bit is {00, 01, 10, 11}, {100, 101, 110, 111}. The default mode is .arm, thus load the instruction to memory by 3-bits.
For parting 16-bit and 32-bit mode; it's 16-bit if LSB is 1, so "Tstart +1", is plus LSB bit to 1 to tail of machine code.
Return 32-bit mode from 16-bit, we can use "mov pc, lr".
*One label of Literal can be present more different types.
2006-06-29
Log
Today, we have already study in C program, before C, we're confused in Thumb section example. But after we've asked teacher then we figure out.
This afternoon, we plan the meeting note on next _Mon._, as below:
1. Instruction Set; CC, Instruct Monenic
2. Solve problem procedure;
*bl, stmfc, adr +8, thumb +1, stack_top
*little-endian, Pre-index, Post-index
3. Command Script
*Can any script to finish the set procedure?
4. R13. SP, R14. LR, R15. PC
*Memory Layout status
5. Flags
*msr, mrs, cpsr, spsr
And next _Wed._:
1. Gamil, Calendar
2. adreus
This afternoon, we plan the meeting note on next _Mon._, as below:
1. Instruction Set; CC, Instruct Monenic
2. Solve problem procedure;
*bl, stmfc, adr +8, thumb +1, stack_top
*little-endian, Pre-index, Post-index
3. Command Script
*Can any script to finish the set procedure?
4. R13. SP, R14. LR, R15. PC
*Memory Layout status
5. Flags
*msr, mrs, cpsr, spsr
And next _Wed._:
1. Gamil, Calendar
2. adreus
2006-06-27
What are linker script files?
From:What are linker script files?
Date 7/5/2005 10:42:22 AM
Question What are linker script files?
Answer
Linker script:
In the Embed system development, it needs to use linker position file. This file describes the relevant information of code linker position, including code section, data section, address section, and the linker shall use the code of this file to the whole system as correct position. This file is called as linker scripts file.
The following is an example of Linker script:
SECTIONS
{
. = 0x02000000;
.text : { *(.text) }
Image_RO_Limit = .;
Image_RW_Base = .;
.data : { *(.data) }
.rodata : { *(.rodata) }
Image_ZI_Base = .;
.bss : { *(.bss) }
Image_ZI_Limit = .;
__bss_start__ = .;
__bss_end__ = .;
end = .;
.debug_info 0 : { *(.debug_info) }
.debug_line 0 : { *(.debug_line) }
.debug_abbrev 0 : { *(.debug_abbrev)}
.debug_frame 0 : { *(.debug_frame) }
}
Date 7/5/2005 10:42:22 AM
Question What are linker script files?
Answer
Linker script:
In the Embed system development, it needs to use linker position file. This file describes the relevant information of code linker position, including code section, data section, address section, and the linker shall use the code of this file to the whole system as correct position. This file is called as linker scripts file.
The following is an example of Linker script:
SECTIONS
{
. = 0x02000000;
.text : { *(.text) }
Image_RO_Limit = .;
Image_RW_Base = .;
.data : { *(.data) }
.rodata : { *(.rodata) }
Image_ZI_Base = .;
.bss : { *(.bss) }
Image_ZI_Limit = .;
__bss_start__ = .;
__bss_end__ = .;
end = .;
.debug_info 0 : { *(.debug_info) }
.debug_line 0 : { *(.debug_line) }
.debug_abbrev 0 : { *(.debug_abbrev)}
.debug_frame 0 : { *(.debug_frame) }
}
What's is command script (*.cs) ?
From: What is a command script file *.cs? How can I make a command script file?
Haha~~ it is one of FAQs. :P I am lamer. 囧rz
Date 7/5/2005 10:47:09 AM
Question What is a command script file *.cs? How can I make a command script file?
Answer
While debugging software or after the target board resetted, sometimes users may need IDE automatically finish some special functions such as resetting target board, clearing off watchdog, shutting off interrupts, memory map, etc., these special functions can be completed through executing a group of commands. This group of commands saved as a text file and is called command script file.
You can execute the command script (*.cs) file to initialize your target board before debugging. But such a file is not necessary if some programs (such as bios,bootloader) execute well after power on. The cs file for Embest Debugger is just very useful to debug a target board without any code in boot rom.
For Embest IDE, when remotely connected to the target device, we can execute the command script (*.cs) file to initialize the system before debugging. We can do as following:
Project ->Settings ->DEBUG ->Action After connected, select the command script that you want to execute.
The following are the examples of command scripts :
; stop target CPU
stop
; configurations of the special register
memwrite 0xffe00000 0x01002535
memwrite 0xffe00004 0x02002121
memwrite 0xffe00024 0x06
; configuration for Mapping Address
memwrite 0xffe00020 0x01
refresh
download -v D:\Demo\armdemo\debug\led.elf 0x2000000
;end
Haha~~ it is one of FAQs. :P I am lamer. 囧rz
Date 7/5/2005 10:47:09 AM
Question What is a command script file *.cs? How can I make a command script file?
Answer
While debugging software or after the target board resetted, sometimes users may need IDE automatically finish some special functions such as resetting target board, clearing off watchdog, shutting off interrupts, memory map, etc., these special functions can be completed through executing a group of commands. This group of commands saved as a text file and is called command script file.
You can execute the command script (*.cs) file to initialize your target board before debugging. But such a file is not necessary if some programs (such as bios,bootloader) execute well after power on. The cs file for Embest Debugger is just very useful to debug a target board without any code in boot rom.
For Embest IDE, when remotely connected to the target device, we can execute the command script (*.cs) file to initialize the system before debugging. We can do as following:
Project ->Settings ->DEBUG ->Action After connected, select the command script that you want to execute.
The following are the examples of command scripts :
; stop target CPU
stop
; configurations of the special register
memwrite 0xffe00000 0x01002535
memwrite 0xffe00004 0x02002121
memwrite 0xffe00024 0x06
; configuration for Mapping Address
memwrite 0xffe00020 0x01
refresh
download -v D:\Demo\armdemo\debug\led.elf 0x2000000
;end
2006-06-26
Log
Today, we have the experiment on Sec.3.1-1 and Sec.3.1-2, we know the Flash address range and RAM address range.
The Embest IDE is not stable on the PC, we don't know what's going on, PCs' or Embests' problem. Clicking the "Rest(Ctrl+R)", the entry point will be offset, advisor said that, 'cuz the entry point be taked to 0x00000000, and the "Connect" will excute the initial file (*.cs), then initial some memory addressing configuration. Thus, after Reset, entry point will be offset, and different with program specified.
Be mentioned is this section, "lsr" and "lsl", a little different. :-)
The Embest IDE is not stable on the PC, we don't know what's going on, PCs' or Embests' problem. Clicking the "Rest(Ctrl+R)", the entry point will be offset, advisor said that, 'cuz the entry point be taked to 0x00000000, and the "Connect" will excute the initial file (*.cs), then initial some memory addressing configuration. Thus, after Reset, entry point will be offset, and different with program specified.
Be mentioned is this section, "lsr" and "lsl", a little different. :-)
2006-06-23
ARM[7,9] Survey log
ARM9 Family
* ARM9 has two cores, ARM920T(Dual 8K cache) & ARM922T(Dual 16K cache)
* Supports much feature(SoC, extension application).
ARM7 Family
* ARM720T has the MMU.
* ARM7 all has the AHB(Advanced High-performance Bus)
* ARM7 has four cores, ARM7TDMI, ARM7TDMI-S, ARM7EJ-S, ARM720T
* Supports Java, Jazelle, JTEK
* ARM9 has two cores, ARM920T(Dual 8K cache) & ARM922T(Dual 16K cache)
* Supports much feature(SoC, extension application).
ARM7 Family
* ARM720T has the MMU.
* ARM7 all has the AHB(Advanced High-performance Bus)
* ARM7 has four cores, ARM7TDMI, ARM7TDMI-S, ARM7EJ-S, ARM720T
* Supports Java, Jazelle, JTEK
2006-06-22
SIC/XE assembler
In this semester, one of corriculum, System Software. We need to write a SIC/XE assembler, my stuff is not be done in now, it is such buggy.
Some drawback below,
1. Generating the right objcode output.
2. The SYMTAB can be replaced by HashTab
3. Snipping some variables which doesn't used.
TODO,
1. To survey the performance with algorithm(timer) with my sutff.
2. ...
Finally, thx for somebody who has been help me for code it, especially kornelius. :)
Download my sutff
Some drawback below,
1. Generating the right objcode output.
2. The SYMTAB can be replaced by HashTab
3. Snipping some variables which doesn't used.
TODO,
1. To survey the performance with algorithm(timer) with my sutff.
2. ...
Finally, thx for somebody who has been help me for code it, especially kornelius. :)
Download my sutff
訂閱：
文章 (Atom)