#include <stdio.h>

int foo(int a, int b) {

return (a-b);

}

int main() {

int y;

asm(“movl $10, %eax”);

asm(“push %eax”);

asm(“movl $7, %eax”);

asm(“push %eax”);

asm(“call _foo” : “=r” (y));

//printf(“%d\n”, y);

//getchar();

return 0;

}

So this writing is sort of documentation of my study through this topic. The codes here are tested under Dev C compiler and produce result as expected.

Without any further ado, the following codes demonstrate the way of acquiring value produced by a C function.

#include <stdio.h>>

int foo() {

return 2;

}

int main() {

int ivar; //to retrieve value of foo function

asm(“call _foo” : “=r” (ivar)); //return value of foo is stored in ivar variable

//printf(“%d\n”, ivar); //uncomment this line to print ivar to stdout

//getchar(); //uncomment this line to freeze the text console; otherwise it will disappear immediately

return 0;

}

The above code can be expanded by modifying foo function. This time, foo function returns value which is defined inside main function.

#include <stdio.h>

int foo(int fooParam) {

return fooParam;

}

int main() {

int ivar; //to retrieve value of foo function

asm(“movl $10, %eax”); //to copy constant 10 into eax register

asm(“push %eax”); //to push the value to the top of memory stack

asm(“call _foo” : “=r” (ivar)); //return value of foo is stored in ivar variable

//printf(“%d\n”, ivar); //uncomment this line to print ivar to stdout

//getchar(); //uncomment this line to freeze the text console; otherwise it will disappear immediately

return 0;

}

This is the end of my first writing related to inline assembly. I will add more writing on this topic in my future spare time.

Enjoying the weather which had been really nice for a several days, my wife and me spent some time traveling to Utrecht and Nijmegen. During the relaxing visit, I took many memorable photos whereas my wife was the model for almost all photo shots. After doing a quick scanning to all the photos, my favorite photos is the one displayed above because it is very unique and has distinguishing theme with the rest. I intentionally added old style effect to the picture, to enable the classical composition viewed more explicitly and perceivably.

/* the declaration of global variable, target_array */
int destination[size];
void sorting(int *src_array, int size) {
        /* do sorting here */
        /* store the result of data sorting
        into a global variable (target_array) */
}

int main() {
        /* declare and initialize source before using it */

        sorting(source, size);
        /* user-defined function to print all array elements */
        print_array(destination);
        return 0;
}

Aside above technique, we also can use additional function argument as a way for caller and callee function to exchange their data. The implementation of this techinique is as follows:

void sorting(int *dest_array, int *src_array, int size) {
        /* do sorting here */
        /* store the result of data sorting into which
        array is accessible at caller function (e.g. dest_array) */
}

int main() {
        /* declare source and destination before using it */
        /* initial source as sorting input */
        sorting(destination, source, size);
        /* user-defined function to print all array elements */
        print_array(destination);
        return 0;
}

Both techniques described above require a variable which has wider scope (in the first case, the variable is known by all functions while in the later case, the scope of variable is at the same level of the caller function). The next technique is to declare an array inside a callee function and use the characteristic of dynamic memory allocation to preserve memory allocation although the lifetime of the callee function is over. Below is the implementation of this technique:

int *sorting(int *src_array, int size) {
        /* declaration of dynamic array */
        int *p_inside_sorting;

        /* memory allocation of dynamic array */
        p_inside_sorting = (int *)malloc(sizeof(int)*size));

        /* do sorting here */
        /* store the result of data sorting into p_inside_sorting */

        return p_inside_sorting;
}

int main() {
        /* declare and initialize source before using it */
        /* declare a pointer variable as a means for pointing
        address reference returned by sorting function */
        int *p;

        p = sorting(source, size);
        /* user-defined function to print all array elements */
        print_array(p);
        return 0;
}

Since we are allocating lot of memories designated to our dynamic array, we need to free (or de-allocate) the memories if we are going not to use it anymore (e.g. after the termination of the program).

It was about divisioning number. Assume that you would like to calculate the result of 5 divided by 7. Of course it’s very easy to solve, by either calculating by hand or using calculator. OK, let’s take the most practical one, with the help of calculator. I did the calculation using Windows calculator, and the result is 0.71428571428571428571428571428571. I discovered that the total number printed behind the dot sign is 32. For most of mathematical purpose, it’s probably more than enough. But then I questioned myselft, is it possible to extend the calculation of decimal number to more than 32 digits?

It didn’t take to much time to conclude that it’s possible to extend the digit number, but it obviously couldn’t be done with the existing calculator. I had to make a small program and it’s not a complicated one. Here I put the snapshot of the code I made in C language:

#include <stdio.h>
#include <string.h>

#define STRING_SIZE 1024

char *udivide(int numerator, int denominator, int counter);

int main ()
{
int inumber, modnumber, counter=0;

printf(“%s”, udivide(17,116,300));

printf(“\n”);
return 0;
}

char *udivide(numerator, denominator, counter)
int numerator;
int denominator;
int counter;
{
static char sresult[STRING_SIZE]=”";
char temp_str[STRING_SIZE]=”";
int local_counter=0, modnumber=numerator;
while (local_counter<counter)
{
numerator = (int) numerator/denominator;
sprintf(temp_str, “%d”, numerator);
if (local_counter==0)
strcat(temp_str, “.”);
if ((numerator = modnumber%denominator)==0)
{
strcat(sresult, temp_str);
break;
}
if (numerator<denominator)
numerator*=10;
modnumber = numerator;
local_counter++;
strcat(sresult, temp_str);
}
return sresult;
}

Depending on the value of counter variable, now I’m able to find the division of any number in longer digit resolution (note: if the digit resolution exceeds the size declared in above code, increase the size of string to a corresponding value). Then I observed that the division of fraction number eventually will produce a periodic number. Below are some examples of the periodic division result:

1 : 116 = 0.0086206896551724137931034482758620689655172413793103448275
86206896551724137931034482758620689655172413793103448275
86206896551724137931034482758620689655172413793103448275
86206896551724137931034482758620689655172413793103448275
86206896551724137931034482758620689655172413793103448275
86206896551724137

22 : 7 = 3.142857142857142857142857142857142857142857142857142857142857142857142857142857
142857142857142857142857142857142857142857142857142857142857142857142857142857
142857142857142857142857142857142857142857142857142857142857142857142857142857
14285714285714285714285714285714285714285714285714285714285714285

I think it’s enough playing with numerator and denominator for today. Maybe if I have another spare time, I will make the function to be recursive, so it will be more elegant than it’s now. I also welcome you to share your recursive version at comment section. Cheers.

I realized that the consequence of switching academic track to a new area was to face many new things which I never learnt before. Undoubtfully the consequence is becoming true. At the 6th month following master program at TU Delft, the burden to walk into unknown study area becomes larger. Everyday, when attending a class, the lecturer talked about terminologies and principles which are really new to me and I became more suffered because the lecturer assumed that all those required and supported knowledge have been studied in bachelor (or, if the assumption was considered to be wrong, the lecturer just give students the instruction to read a bunch of prerequisite reading material). Following are few terminologies I must understand in order to pass the courses: carry look ahead, parallel prefix network, parse tree, LALR, finite state automaton, victim cache, cover of cube, etc. (if you’re interested to know what it is, type the keyword on google).

But it doesn’t mean I will quit the fight and walk out the arena. I will do my best to complete the courses and get the degree at the end. Right now, I’m trying to change my mindset to see difficulties as challenges. When I succeed to do so, the remaining journey probably will be more insteresting and I don’t feel tortured, .

I also felt a different feeling when I came to my room this afternoon. My room seems to be a lot less empty now. I don’t hear anymore romantic words that she usually says when I get in to the room. Not only that, I couldn’t see her very beautiful smile when I was entering the room, and the question about whether I felt hungry or not and when I said I was starved, she woke up from the bed and started to prepare the food for us. After she finished cooking the food, the best moment came when we ate together and in the same time having a little chat about anything we want to talk.

Now I have to be used to be “being alone”. Buying stuff to the market, enjoying light walk, spending spare time, etc. must be gone through without her. I have a very simple pray in my heart that I hope the time will tick faster, so I can meet her sooner and the empty space inhabiting my heart will disappear immediately.

usaha (work) = gaya (force) x jarak (distance)

Dari rumus di atas, ada empat permutasi untuk menghitung besarnya usaha yang dihasilkan, yaitu:

• tidak ada gaya yang bekerja pada benda, namun benda mengalami perpindahan posisi (gaya = 0, jarak <> 0)
• tidak ada gaya yang bekerja dan tidak ada perpindahan jarak (gaya = jarak = 0)
• ada gaya yang bekerja pada benda, mengakibatkan adanya perpindahan posisi (gaya <> 0, jarak <> 0)
• ada gaya yang bekerja pada benda, namun benda tidak mengalami perpindahan posisi (gaya <> 0, jarak = 0)

Mari kita ulas satu-satu keempat permutasi di atas. Pada permutasi yang pertama, menurut kesimpulan pribadi saya, sangat tidak mungkin terjadi. Bayangkan jika sebuah buku atau mobil yang berada di sebuah permukaan yang datar, tiba-tiba dapat bergerak dengan sendirinya, berpindah ke posisi yang lain. Kalau seandainya suatu masa kita kebetulan melihat fenomena ini, kemungkinan besar kita akan terlari terbirit-birit dan bulu kuduk sudah berdiri semua, he..he…

Permutasi yang kedua, ketiga, dan keempat merupakan fenomena yang sering terjadi di sekitar kita. Namun untuk permutasi keempat, ada hal yang menarik yang bisa diamati dan bila kita mencoba untuk melihatnya dari sisi yang berbeda, akan menghasilkan hal yang lebih menarik lagi. Perhatikan bahwa di permutasi keempat, besarnya usaha yang dihasilkan adalah nol karena tidak ada perpindahana jarak yang terjadi walaupun gaya diberikan pada benda tersebut. Dengan menggunakan istilah saya sendiri, hal ini saya sebut  sebagai “tidak melakukan usaha“. Contoh konkrit mengenai hal ini adalah ketika seseorang berusaha mendorong tembok rumah. Gaya yang diberikan ke tembok rumah tersebut sudah sedemikian besarnya sampai-sampai tenaga orang yang mendorong sudah habis dan banjir keringat, namun tetap saja tembok tidak bergerak sedikit pun. Lebih naas lagi, berdasarkan formula fisika di atas, kita dapat mengatakan bahwa orang tersebut tidak melakukan usaha (dengan istilah lain, tidak berusaha) ketika mendorong tembok tersebut.

Nah sekarang mari kita lihat peristiwa di atas melalui sudut pandang lain, yang lebih bersifat sosial-managerial. Misalkan seseorang berposisi sebagai atasan di suatu institusi, yang memiliki wewenang untuk mengambil keputusan strategis. Pada masa tertentu, dicanangkan program untuk membuat institusi tersebut menjadi lebih baik. Sekian puluh skenario dan program dirumuskan dan dengan memberdayakan potensi insani yang bekerja di perusahaan tersebut, ekspektasi bahwa kualitas institusi dapat lebih meningkat dapat tercapai. Segenap tenaga dan pikiran serta dedikasi dicurahkan demi tercapainya peningkatan kualitas. Namun tanpa disadari, dalam rangkaian kerja yang merupakan bagian dari program peningkatan kualitas institusi, tidak ada satu pun perubahan yang berhasil meningkatkan kualitas institusi. Singkat cerita,  di akhir masa pelaksanaan program, setelah melakukan  evaluasi tentunya, disimpulkan bahwa kualitas institusi tidak lebih buruk dan sekaligus juga tidak lebih baik dibandingkan kondisi sebelum program peningkatan kualitas dilaksanakan. Dengan kata lain, kualitas institusi tidak mengalami perubahan sama sekali.

Dengan mengandaikan bahwa besarnya gaya adalah total dari peluh keringat, tenaga, pikiran, waktu, dan dedikasi yang disumbangkan oleh orang per orang yang bekerja di dalam perusahaan tersebut dan jarak adalah besarnya peningkatan kualitas institusi (dalam kasus di atas, jarak sama dengan nol), maka dengan meminjam istilah yang telah disebutkan di atas, orang per orang di dalam institusi tersebut tidak melakukan usaha.

Inti dari ilustrasi di atas adalah sebesar apapun tenaga yang kita dedikasikan untuk suatu hal tertentu, tapi pada akhirnya tidak ada hasil yang dicapai, maka di akhir dapat dikatakan bahwa selama ini orang tersebut tidak melakukan usaha. Jadi berhati-hati dan cermatlah untuk menentukan pencapaian, sehingga segala jerih payah yang kita berikan (tenaga, waktu, dedikasi, pikiran) tidak berakhir dengan kesimpulan bahwa kita tidak melakukan usaha sama sekali.

Be rationale, don’t over confidence.

Although OS installation consume quite a lot effort and time to spend to, I decided to replace the OS become XP again. I did the OS installation yesterday. At the beginning installation, firstly I put Windows XP installer into CD Rom and boot the laptop through CD. Then, I followed all instructions given along installation as usual, until I realized that something wrong happens during the installation, it didn’t show the list of hard disk partition at all. I tried to do some troubleshooting actions, but nothing can enable me to read the partition. I gathered helpful information from internet to overcome the problem, but still it didn’t work at all. With more less idea remained in my mind, I did a preliminary guess that the problem might have relation with partition manager stored in MBR. By this guessing, I focused the troubleshooting to the way of cleaning MBR from hard disk. On the first try, I used FDISK command provided by XP installer, but it seems to be failed. Then I seek another tool to do such job. From the forum I visited, they suggest to use MbrFix tool that it’s claimed to be more powerful than FDISK. Immediately I downloaded the tool and run it to clean the MBR information. And you know what? The beginning of disaster came. Without criticizing the tool feature, I executed the command as being instructed on the website. It seemed nothing wrong happened then. I repeated the installation process but still it couldn’t read the partition. Hmm, while thinking this weird situation, I decided to put another XP installer into CDRom. And guess what, it could read the partition, but only one. Ups sorry, I forgot to tell you that my hard disk had three partitions on it. Realizing what had happened, I was still in a few minutes, to give enough time for me to think over the stupid thing I had did. I lost all data I have collected since 7 months ago, movies, application, course deliverable, and many useful and important files.

But of course, the show must go on. Instead of tearing this sad story, I continued the installation and listed the remained information inside my mind which is useful to get all files I had lost.

Lesson learnt from this experience is to be aware for everything you will do, even though you are used to do it everyday.

Pondering the lost I got on that day, I categorized yesterday as my unpleasant day, .