野山羊隨手記錄

Rust: triangles from smallest/largest to largest/smallest

2025-11-30T23:38:00.000-08:00

fn main() {

   println!("triangles from smallest to largest");

    let mut count0 = 0;

    let mut count1 = 1;

    loop {

        loop {

            if count0 >= count1 {

                break;     // exit loop

}

            print!("*");

            count0 += 1;

}

        if count1 >= 5 {

            break;     // exit loop

}

        println!("");

        count1 += 1;

        count0 = 0;

}

}

triangles from smallest to largest * ** *** **** *****

fn main() {

    println!("triangles from largest to smallest");

    let mut count0 = 5;

    let mut count1 = 5;

    loop {

        loop {

            if count0 <= 0 {

                break;     // exitloop

}

            print!("*");

            count0 -= 1;

}

        if count1 <= 0 {

            break;     // exit loop

}

        println!("");

        count1 -= 1;

        count0 = count1;

}

}

triangles from largest to smallest ***** **** *** ** *

找右邊算來第一個1的bit位置

2025-11-09T20:35:00.000-08:00

#include <stdio.h>

int calculate_first_one_in_left(unsigned int n)

{

int start = 0, shift_r_num = 0;

while(1)

{

if (n == 0) {

shift_r_num = (start == 0) ? -1 : (shift_r_num - 1) ;

break;

}

start = 1;

n >>= 1;

shift_r_num ++;

}

return shift_r_num;

}

int main()

{

unsigned int n=0x1100;

printf ("n=0x%x, %d\n", n, calculate_first_one_in_left(n));

n=0x100;

printf ("n=0x%x, %d\n", n, calculate_first_one_in_left(n));

n=0x10;

printf ("n=0x%x, %d\n", n, calculate_first_one_in_left(n));

n=0x1;

printf ("n=0x%x, %d\n", n, calculate_first_one_in_left(n));

return 0;

}

[Output]

n=0x1100, 12

n=0x100, 8

n=0x10, 4

n=0x1, 0

有2、3、4、5、6個數字，能組成多少種互不相等且並無重複這幾個數字的四位數數字，共有多少個?

2024-07-01T07:48:00.000-07:00

#include <stdio.h>

int main()
{
    int i, total;

    total = 0;
    for (i = 0; i < 10000; i++)
    {
        if (
            (((i / 1000) >= 2) && ((i / 1000) <= 6)) &&
            (((i % 1000 / 100) >= 2) && ((i % 1000 / 100) <= 6)) &&
            (((i % 100 / 10) >= 2) && ((i % 100 / 10) <= 6)) &&
            (((i % 10) >= 2) && ((i % 10) <= 6)) &&
            (
                ((i / 1000) != (i % 1000 / 100)) &&
                ((i / 1000) != (i % 100 / 10)) &&
                ((i / 1000) != (i % 10)) &&
                ((i % 1000 / 100) != (i % 100 / 10)) &&
                ((i % 1000 / 100) != (i % 10)) &&
                ((i % 100 / 10) != (i % 10)) &&
                (1)
            )
        )
        {
            // printf("i=%d\n", i);
            total++;
        }
    }
    printf("total=%d\n", total);

    return 0;
}

[output] : total = 120

將字串反向列印, 並做位置對調

2024-07-01T03:18:00.000-07:00

#include <stdio.h>

char *swap_str(char *str)
{
    int i, tmp, max;

    i = 0;
    while (str[i] != '\0')
        i++;
    max = i;

    for (i = 0; i < (max >> 1); i++)
    {
        tmp = str[i];
        str[i] = str[max - i - 1];
        str[max - i - 1] = tmp;
    }
    return str;
}

int main()
{
    char str1[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    char str2[] = "9876543210";

    printf(">>%s\n", str1);
    printf("=>%s\n", swap_str(str1));
    printf(">>%s\n", str2);
    printf("=>%s\n", swap_str(str2));
    return 0;
}

[output]:
>>ABCDEFGHIJKLMNOPQRSTUVWXYZ
=>ZYXWVUTSRQPONMLKJIHGFEDCBA
>>9876543210
=>0123456789

簡單的將字串反向列印, 不做位置對調

2024-07-01T02:59:00.000-07:00

#include <stdio.h>

int main()
{
    char *str = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    // char *str = "9876543210";
    int i, max;

    i = 0;
    while (str[i] != '\0')
        i++;
    max = i;

    printf(">>%s\n", str);

    printf("=>");
    for (i = max - 1; i > 0; i--)
    {
        if (str[i] != '\0')
            printf("%c", str[i]);
    }
    if ((i == 0) && (str[i] != '\0'))
        printf("%c", str[i]);

    return 0;
}

[output]:
>>ABCDEFGHIJKLMNOPQRSTUVWXYZ
=>ZYXWVUTSRQPONMLKJIHGFEDCBA

[output]:
>>9876543210
=>0123456789

Function pointer and type define

2024-07-01T01:09:00.000-07:00

#include <stdio.h>

void test_fun1(int input, int tmp)
{
    printf("%s(%d)...%d\n", __FUNCTION__, input, tmp);
}

void test_fun2(int input, int tmp)
{
    printf("%s(%d)***%d\n", __FUNCTION__, input, tmp);
}

typedef void (*function_ptr)(int, int);

int main()
{
    function_ptr op_fun;
    void (*fun_ptr)(int, int);

    fun_ptr = test_fun1;
    fun_ptr(2, 3);

    fun_ptr = test_fun2;
    fun_ptr(7, 6);

    printf("-------\n");
    op_fun = test_fun1;
    op_fun(77, 11);
    printf("-------\n");

    return 0;
}

[Output]:
test_fun1(2)...3
test_fun2(7)***6
-------
test_fun1(77)...11
-------

用數字劃出菱形由小（邊）至大（中心）

2024-07-01T00:42:00.000-07:00

#include <stdio.h>

void draw_triangle_fun(unsigned int length, unsigned int width)

{

    unsigned int t_w, t_l;

    char space = ' ', ch;

    for (t_w = 0; t_w <= width; t_w++)

{

        for (t_l = 0; t_l < length - t_w; t_l++)

{

            printf("%c", space);

}

        for (t_l = 0; t_l <= t_w; t_l++)

{

            ch = t_l + '0';

            printf("%c", ch);

}

        // for (t_l = 0; t_l <= t_w; t_l++)

        for (t_l = length - t_w; t_l <= length; t_l++)

{

            if (t_l > (length - t_w))

{

                ch = length - t_l + '0';

                printf("%c", ch);

}

}

        printf("\n");

}

    for (t_w = 0; t_w < width; t_w++)

{

        for (t_l = 0; t_l <= t_w; t_l++)

{

            printf("%c", space);

}

        for (t_l = 0; t_l < (length - t_w); t_l++)

{

            ch = t_l + '0';

            printf("%c", ch);

}

        // for (t_l = 0; t_l < (length - t_w); t_l++)

        for (t_l = (length - t_w); t_l > 0; t_l--)

{

            // ch = (length - t_l) + '0';

            if (((length - t_w) > t_l) && (t_l > 0))

{

                ch = t_l - 1 + '0';

                printf("%c", ch);

}

}

        printf("\n");

}

}

int main()

{

    unsigned int length, width;

    printf("\nPlease enter length/width(1 ~ 9):");

    scanf("%d", &width);

    if (width > 9)

        width = 9;

    length = width;

    printf("\n=============================================\n");

    draw_triangle_fun(length, width);

    printf("\n=============================================\n");

    return 0;

}

Please enter length/width(1 ~ 9):9 ============================================= 0 010 01210 0123210 012343210 01234543210 0123456543210 012345676543210 01234567876543210 0123456789876543210 01234567876543210 012345676543210 0123456543210 01234543210 012343210 0123210 01210 010 0 =============================================

用數字劃出三角形

2024-06-30T23:51:00.000-07:00

#include <stdio.h>

void draw_triangle_fun(unsigned int length, unsigned int width)

{

    unsigned int t_w, t_l;

    char space = ' ', ch;

    for (t_w = 0; t_w <= width; t_w++)

{

        for (t_l = 0; t_l <= (length - t_w); t_l++)

{

            ch = t_l + '0';

            printf("%c", ch);

}

        printf("\n");

}

    for (t_w = 0; t_w <= width; t_w++)

{

        for (t_l = 0; t_l <= t_w; t_l++)

{

            ch = t_l + '0';

            printf("%c", ch);

}

        printf("\n");

}

    for (t_w = 0; t_w <= width; t_w++)

{

        for (t_l = 0; t_l <= length - t_w; t_l++)

{

            printf("%c", space);

}

        for (t_l = 0; t_l <= t_w; t_l++)

{

            ch = t_l + '0';

            printf("%c", ch);

}

        printf("\n");

}

    for (t_w = 0; t_w <= width; t_w++)

{

        for (t_l = 0; t_l <= t_w; t_l++)

{

            printf("%c", space);

}

        for (t_l = 0; t_l <= length - t_w; t_l++)

{

            ch = t_l + '0';

            printf("%c", ch);

}

        printf("\n");

}

}

int main()

{

    unsigned int length, width;

    printf("\nPlease enter length/width(1 ~ 9):");

    scanf("%d", &width);

    if (width > 9)

        width = 9;

    length = width;

    printf("\n=============================================\n");

    draw_triangle_fun(length, width);

    printf("\n=============================================\n");

    return 0;

}

Please enter length/width(1 ~ 9):9 ============================================= 0123456789 012345678 01234567 0123456 012345 01234 0123 012 01 0 0 01 012 0123 01234 012345 0123456 01234567 012345678 0123456789 0 01 012 0123 01234 012345 0123456 01234567 012345678 0123456789 0123456789 012345678 01234567 0123456 012345 01234 0123 012 01 0 =============================================

數字排序由大到小與由小到大排列

2024-06-30T19:54:00.000-07:00

#include <stdio.h>

#define MAX_NUM 10

int main()
{
    int i, j, tmp;
    int *members;
    int test_case0[MAX_NUM] = {13, -5, 0, 7, 79, 213, 5, 132, -53, 71};
    int test_case1[MAX_NUM] = {91, 65, -12, 78, -9, -312, 5, 132, -121, -9};
    printf("\n==================Original===================\n");
    members = test_case0;
    for (i = 0; i < MAX_NUM; i++)
    {
        printf("%d ", members[i]);
    }

    printf("\n========Arrange from large to small=========\n");
    //-------------------------------------
    members = test_case0;
    for (i = 0; i < MAX_NUM; i++)
    {
        for (j = i + 1; j < MAX_NUM; j++)
        {
            if (members[i] < members[j])
            {
                tmp = members[i];
                members[i] = members[j];
                members[j] = tmp;
            }
        }
    }
    //-------------------------------------

    for (i = 0; i < MAX_NUM; i++)
    {
        printf("%d", members[i]);
        if ((i + 1) < MAX_NUM)
            printf(" > ");
    }
    printf("\n==================Original===================\n");
    members = test_case1;
    for (i = 0; i < MAX_NUM; i++)
    {
        printf("%d ", members[i]);
    }
    printf("\n========Arrange from small to large=========\n");
    //-------------------------------------
    members = test_case1;
    for (i = 0; i < MAX_NUM; i++)
    {
        for (j = i + 1; j < MAX_NUM; j++)
        {
            if (members[i] > members[j])
            {
                tmp = members[i];
                members[i] = members[j];
                members[j] = tmp;
            }
        }
    }
    //-------------------------------------

    for (i = 0; i < MAX_NUM; i++)
    {
        printf("%d", members[i]);
        if ((i + 1) < MAX_NUM)
            printf(" < ");
    }
    printf("\n=============================================\n");

    return 0;
}

==================Original=================== 13 -5 0 7 79 213 5 132 -53 71 ========Arrange from large to small========= 213 > 132 > 79 > 71 > 13 > 7 > 5 > 0 > -5 > -53 ==================Original=================== 91 65 -12 78 -9 -312 5 132 -121 -9 ========Arrange from small to large========= -312 < -121 < -12 < -9 < -9 < 5 < 65 < 78 < 91 < 132 =============================================

開根號小數點後精度兩位數

2024-06-30T05:47:00.000-07:00

#include <stdio.h>
unsigned int square_root_fun(unsigned int value, unsigned int *after_dec_point_ptr)
{
    unsigned int max_num, i, root;

    if (value <= 1)
    {
        if (after_dec_point_ptr != NULL)
            *after_dec_point_ptr = 0;
        return value;
    }

    value *= 10000; // Magnification 10000 times

    for (max_num = 31; max_num > 0; max_num--)
    {
        if (value & (1 << max_num))
            break;
    }

    root = 0;
    for (i = (max_num >> 1); i > 0; i--)
    {
        if (value >= ((root | (1 << i)) * (root | (1 << i))))
            root |= (1 << i);
    }
    if (i == 0)
    {
        if (value >= ((root | (1 << i)) * (root | (1 << i))))
            root |= (1 << i);
    }
    if (after_dec_point_ptr != NULL)
    {
        *after_dec_point_ptr = root % 100; // Restore magnification and Storage position after decimal point
    }
    root /= 100; // Restore magnification

    return root;
}
int main()
{
    unsigned int var_a, root, after_dec_point_ptr;
    printf("\nPlease input a value:");
    scanf("%d", &var_a);
    printf("\n=============================================\n");
    root = square_root_fun(var_a, &after_dec_point_ptr);
    printf("%d square root is %d.%d", var_a, root, after_dec_point_ptr);
    printf("\n=============================================\n");
    return 0;
}



Please input a value:123456
=============================================
123456 square root is 351.36
=============================================


Please input a value:2345
=============================================
2345 square root is 48.42
=============================================


Please input a value:1
=============================================
1 square root is 1.0
=============================================


Please input a value:0
=============================================
0 square root is 0.0
=============================================

用減法與位移做除法並取餘數

2024-06-29T02:08:00.000-07:00

#include <stdio.h>

unsigned int division_fun(unsigned int dividend, unsigned int divisor, unsigned int *remainder_ptr)

{

    unsigned int max_num, i, quotient;

    if ((dividend == 0) || (divisor == 0) || (dividend < divisor) || (remainder_ptr == NULL))

{

        if ((dividend < divisor) && (remainder_ptr))

{

            *remainder_ptr = dividend;

}

        return 0;

}

    for (max_num = 31; max_num > 0; max_num--)

{

        if (dividend & (1 << max_num))

            break;

}

    *remainder_ptr = dividend;

    quotient = 0;

    for (i = max_num; i > 0; i--)

{

        if (*remainder_ptr >= (divisor << i))

{

            *remainder_ptr -= (divisor << i);

            quotient |= (1 << i);

}

}

    if ((i == 0) && (*remainder_ptr >= (divisor << i)))

{

        *remainder_ptr -= (divisor << i);

        quotient |= (1 << i);

}

    return quotient;

}

int main()

{

    unsigned int var_a, var_b, quotient, remainder;

    printf("\nPlease input a and b values:");

    scanf("%d %d", &var_a, &var_b);

    printf("\n=============================================\n");

    quotient = division_fun(var_a, var_b, &remainder);

    printf("%d / %d = %d...%d", var_a, var_b, quotient, remainder);

    printf("\n=============================================\n");

    return 0;

}

Please input a and b values:123 3 ============================================= 123 / 3 = 41...0 =============================================

Please input a and b values:12345

132

=============================================

12345 / 132 = 93...69

=============================================

只用加法與位移做出乘法

2024-06-29T01:05:00.000-07:00

#include <stdio.h>

unsigned int multiplier_fun(unsigned int mulcand, unsigned int mul)

{

    unsigned int max_num, i, total;

    if ((mulcand == 0) || (mul == 0))

        return 0;

    for (max_num = 31; max_num > 0; max_num--)

{

        if (mul & (1 << max_num))

            break;

}

    total = 0;

    for (i = 0; i <= max_num; i++)

{

        if (mul & (1 << i))

{

            total += (mulcand << i);

}

}

    return total;

}

int main()

{

    unsigned int var_a, var_b;

    printf("\nPlease input a and b values:");

    scanf("%d %d", &var_a, &var_b);

    printf("\n=============================================\n");

    printf("%d x %d = %d", var_a, var_b, multiplier_fun(var_a, var_b));

    printf("\n=============================================\n");

    return 0;

}

Please input a and b values:9 19 ============================================= 9 x 19 = 171 =============================================

Please input a and b values:3 133

=============================================

3 x 133 = 399

=============================================

用*號字元劃出三角形

2024-06-29T00:13:00.000-07:00

#include <stdio.h>

void draw_triangle_fun(unsigned int length, unsigned int width)

{

    unsigned int t_w, t_l;

    char space = ' ', ch = '*';

    for (t_w = 0; t_w < width; t_w++)

{

        for (t_l = t_w; t_l < length; t_l++)

{

            printf("%c", ch);

}

        printf("\n");

}

    for (t_w = 0; t_w < width; t_w++)

{

        for (t_l = length - t_w; t_l <= length; t_l++)

{

            printf("%c", ch);

}

        printf("\n");

}

    for (t_w = 0; t_w < width; t_w++)

{

        for (t_l = 0; t_l < length - t_w - 1; t_l++)

{

            printf("%c", space);

}

        for (t_l = length - t_w - 1; t_l < length; t_l++)

{

            printf("%c", ch);

}

        printf("\n");

}

    for (t_w = 0; t_w < width; t_w++)

{

        for (t_l = 0; t_l < t_w; t_l++)

{

            printf("%c", space);

}

        for (t_l = 0; t_l < length - t_w; t_l++)

{

            printf("%c", ch);

}

        printf("\n");

}

}

int main()

{

    unsigned int length, width;

    printf("\nPlease enter length and width:");

    scanf("%d %d", &length, &width);

    printf("\n=============================================\n");

    draw_triangle_fun(length, width);

    printf("\n=============================================\n");

    return 0;

}

Please enter length and width:7 7 ============================================= ******* ****** ***** **** *** ** * * ** *** **** ***** ****** ******* * ** *** **** ***** ****** ******* ******* ****** ***** **** *** ** * =============================================

Please enter length and width:20 20

=============================================

********************

*******************

******************

*****************

****************

***************

**************

*************

************

***********

**********

*********

********

*******

******

*****

****

***

****

*****

******

*******

********

*********

**********

***********

************

*************

**************

***************

****************

*****************

******************

*******************

********************

***

****

*****

******

*******

********

*********

**********

***********

************

*************

**************

***************

****************

*****************

******************

*******************

********************

*******************

******************

*****************

****************

***************

**************

*************

************

***********

**********

*********

********

*******

******

*****

****

***

=============================================

最小公因數函式遞迴方式

2024-06-28T22:28:00.000-07:00

#include <stdio.h>

unsigned int least_common_factor(unsigned int var_a, unsigned int var_b)

{

    unsigned int i, total;

    total = 1;

    if ((var_a > 1) && (var_b > 1))

{

        for (i = 2; i <= ((var_a < var_b) ? var_a : var_b); i++)

{

            if (((var_a % i) == 0) && ((var_b % i) == 0))

{

                total *= least_common_factor(var_a / i, var_b / i) * i;

                break;

}

}

}

    return total; // least common factor

}

int main()

{

    unsigned int var_a;

    unsigned int var_b;

    printf("\nPlease input two value:");

    scanf("%d %d", &var_a, &var_b);

    printf("\n=============================================\n");

    printf("a = %d, b = %d, and least_common_factor is %d", var_a, var_b, least_common_factor(var_a, var_b));

    printf(", and greatest common multiple is %d", var_a * var_b / least_common_factor(var_a, var_b));

    printf("\n=============================================\n");

    return 0;

}

Please input two value:25 35 ============================================= a = 25, b = 35, and least_common_factor is 5, and greatest common multiple is 175 =============================================

Please input two value:34 68

=============================================

a = 34, b = 68, and least_common_factor is 34, and greatest common multiple is 68

=============================================

最大公因數與最小公倍數的函式

2024-06-28T21:57:00.000-07:00

#include <stdio.h>

unsigned int least_common_factor(unsigned int var_a, unsigned int var_b)

{

    unsigned int i, total;

    total = 1;

    while ((var_a > 1) && (var_b > 1))

{

        for (i = 2; i <= ((var_a < var_b) ? var_a : var_b); i++)

{

            if (((var_a % i) == 0) && ((var_b % i) == 0))

{

                total *= i;

                var_a /= i;

                var_b /= i;

                break;

}

}

        if (i >= ((var_a < var_b) ? var_a : var_b))

            break;

}

    // return total * var_a * var_b; //greatest common multiple

    return total; // least common factor

}

int main()

{

    unsigned int var_a;

    unsigned int var_b;

    printf("\nPlease input two value:");

    scanf("%d %d", &var_a, &var_b);

    printf("\n=============================================\n");

    printf("a = %d, b = %d, and least_common_factor is %d", var_a, var_b, least_common_factor(var_a, var_b));

    printf(", and greatest common multiple is %d", var_a * var_b / least_common_factor(var_a, var_b));

    printf("\n=============================================\n");

    return 0;

}

Please input two value:15 18 ============================================= a = 15, b = 18, and least_common_factor is 3, and greatest common multiple is 90 =============================================

Please input two value:15 18

=============================================

a = 15, b = 18, and least_common_factor is 3, and greatest common multiple is 90

=============================================

質數搜尋

2024-06-28T20:22:00.000-07:00

輸入一個值, 列印此範圍的質數

#include <stdio.h>

int main()

{

    unsigned int i, j, sum;

    unsigned int input_max;

    printf("\nPlease input a value:");

    scanf("%d", &input_max);

    printf("\n===============Fnd prime numbers============\n");

    for (i = 1; i <= input_max; i ++)

{

        sum = 0;

        for (j = 1; j <= i; j ++)

{

            if((i % j) == 0)

{

                sum ++;

}

}

        if (sum == 2)

            printf("[%d],", i);

}

    printf("\n=============================================\n");

    return 0;

}

Please input a value:50 ===============Fnd prime numbers============ [2],[3],[5],[7],[11],[13],[17],[19],[23],[29],[31],[37],[41],[43],[47], =============================================

Please input a value:100

===============Fnd prime numbers============

[2],[3],[5],[7],[11],[13],[17],[19],[23],[29],[31],[37],[41],[43],[47],[53],[59],[61],[67],[71],[73],[79],[83],[89],[97],

=============================================

Developer's UEFI Emulation (DUET) on Edk2 for Boot Disk

2019-04-10T18:27:00.001-07:00

Developer's UEFI Emulation (DUET) on Edk2

From: https://github.com/tianocore/edk2/raw/master/DuetPkg/ReadMe.txt

A. Build DUET image on Windows Platform
========================================
1. Tools preparation

To build DUET image, Visual Studio is required:
1). Base on below link to create Visual Studio build environment.
https://github.com/tianocore/tianocore.github.io/wiki/Windows-systems

2. Build Duet Platform module

1). run cmd.exe to open command line window.
2). enter workspace root directory such as c:\edk2_tree
3). set the environment variable EDK_TOOLS_BIN to point at the BaseTools binaries directory
i.e., "set EDK_TOOLS_BIN=c:\edk2-BaseTools-win32"
4). run "edksetup.bat"
5). run "build -p DuetPkg\DuetPkgIa32.dsc -a IA32 -t VS2015x86" for IA32 architecture platform (using 64-bit VS2015 for example) or
"build -p DuetPkg\DuetPkgX64.dsc -a X64 -t VS2015x86" for X64 architecture platform.

NOTE: The post build script 'PostBuild.sh' will be automatically called after the build command.

Create bootable disk
======================

3. Create boot disk
The following steps are same for IA32 architecture platform or X64 architecture platform.

3.1 Create floppy boot disk
1). enter \DuetPkg directory.
2). Insert a floppy disk to drive
3). run "CreateBootDisk.bat floppy a: FAT12 IA32" if floppy drive is a: disk and Arch to boot is IA32.
or
run "CreateBootDisk.bat floppy a: FAT12 X64" if floppy drive is a: disk and Arch to boot is X64.
3.2 Create usb boot disk
1). enter \DuetPkg directory.
2). Plugin usb disk
3). run "CreateBootDisk.bat usb e: FAT16 IA32" if usb drive is e: and FAT format is FAT16 and Arch to boot is IA32.
or "CreateBootDisk.bat usb e: FAT16 X64" if usb drive is e: and FAT format is FAT16 and Arch to boot is X64.
or "CreateBootDisk.bat usb e: FAT32 IA32" if usb drive is e: and FAT format is FAT32 and Arch to boot is IA32.
or "CreateBootDisk.bat usb e: FAT32 X64" if usb drive is e: and FAT format is FAT32 and Arch to boot is X64.
4). UnPlug usb disk and plugin it again.
5). run "CreateBootDisk.bat usb e: FAT16 IA32 step2" if usb drive is e: and FAT format is FAT16 and Arch to boot is IA32.
or "CreateBootDisk.bat usb e: FAT16 X64 step2" if usb drive is e: and FAT format is FAT16 and Arch to boot is X64.
or "CreateBootDisk.bat usb e: FAT32 IA32 step2" if usb drive is e: and FAT format is FAT32 and Arch to boot is IA32.
or "CreateBootDisk.bat usb e: FAT32 X64 step2" if usb drive is e: and FAT format is FAT32 and Arch to boot is X64.

B. Build DUET image on Linux Platform
======================================
1. Tools preparation

To build DUET image, GCC installation (4.4+) is required:
1). Base on below link to create GCC build environment.
https://github.com/tianocore/tianocore.github.io/wiki/Using-EDK-II-with-Native-GCC

2. Build Duet Platform module

1). Open the terminal.
2). enter workspace root directory such as /edk2_tree
3). run ". edksetup.sh BaseTools"
4). run "build -p DuetPkg/DuetPkgIa32.dsc -a IA32 -t GCC49" for IA32 architecture platform (using GCC 4.9 for example) or
"build -p DuetPkg/DuetPkgX64.dsc -a X64 -t GCC49" for X64 architecture platform.

NOTE: The post build script 'PostBuild.sh' will be automatically called after the build command.
After post build action, you should check the size of EfiLdr at $WORKSPACE/Build/DuetPkgIA32(DuetPkgX64)/DEBUG_GCC49 directory, it must less than 470k.
If not, you should manually remove some unnecessary drivers at DuetPkg.fdf file.

3. Create bootable disk
The following steps are same for IA32 architecture platform or X64 architecture platform.

3.1 Create floppy boot disk
1). enter /edk2_tree/DuetPkg directory.
2). Insert a floppy disk to drive
3). run "CreateBootDisk.sh" to build floppy drive
such as "./CreateBootDisk.sh floppy /media/floppy0 /dev/fd0 FAT12 IA32"

3.2 Create usb boot disk
1). enter /edk2_tree/DuetPkg directory.
2). Plugin usb disk
3). run "CreateBootDisk.sh" to build usb drive
such as "./CreateBootDisk.sh usb /media/usb0 /dev/sdb0 FAT16 IA32"
4). UnPlug usb disk and plugin it again.
5). run "./CreateBootDisk.sh usb /media/usb0 /dev/sdb0 FAT16 IA32 step2"

UDK2017 How to Build

2017-12-18T19:09:00.001-08:00

From: https://github.com/tianocore/tianocore.github.io/wiki/UDK2017-How-to-Build

HOW TO BUILD (WINDOWS SYSTEM)
The steps below are verified on Microsoft Windows 10 Enterprise*:

1. Setup Build Environment

Install Microsoft Visual Studio 2015* in the build machine and make sure that AMD64 complier was selected when installing.

Download NASM 2.0.7 or later from http://www.nasm.us/ and install it to C:\Nasm. Make sure C:\Nasm is added to system environment variable 'PATH'

Set up for using GitHub for Windows. See: https://github.com/tianocore/tianocore.github.io/wiki/Getting-Started-with-EDK-II#github-help

Download and install Python2.7.x https://www.python.org/ for building the BaseTools Default install directory is: C:/Python27

2. Create the full Source Code directory for the UDK2017 release
(1). Create a working space directory in the build machine, for example, C:\MyWorkspace
(2). Download the official UDK2017 release .zip file from the UDK2017 Release Page
a. Download - UDK2017 edk-vUDK2017 Workspace Source code (zip file)
b. Extract files in [edk2-vUDK2017] to the working space directory C:\MyWorkspace.
(3). OR Checkout the vUDK2017 Tag from GitHub with the following "git" command run git clone https://github.com/tianocore/edk2.git vUDK2017 Move all files and folders under "vUDK2017" to "C:\MyWorkspace" Optional (See Compile the BaseTools below) Checkout BaseTools binaries and copy them to BaseTools binary folder. Warning the Windows* Binary tools are only valid for the tip of the https://github.com/tianocore/edk2 repository.
a. Cd C:\MyWorkspace
b. Run git clone https://github.com/tianocore/edk2-BaseTools-win32.git
c. Enter folder edk2-BaseTools-win32
d. Run the command git checkout 0e088c19ab31fccd1d2f55d9e4fe0314b57c0097
e. Cd C:\MyWorkSpace
f. Rename this folder from edk2-BaseTools-win32 to win32, then copy the win32 directory into the BaseTools/Bin directory under the workspace. (e.g. "C:\MyWorkspace\BaseTools\Bin")

3. Generate OpenSSL* Crypto Library
(1). Open file "C:\MyWorkspace\CryptoPkg\Library\OpensslLib\OpenSSL-HOWTO.txt" and follow the instruction to install OpenSSL* for UEFI building. For this release, please use OpenSSL-1.1.0e.

4. Compile the BaseTools (Skip if Optional Step 2.iv was done above) See: https://github.com/tianocore/tianocore.github.io/wiki/Windows-systems#compile-tools
(1). Open a Microsoft Visual Studio* command prompt, type cd C:\MyWorkspace to enter the workspace directory
(2). Compile the BaseTools C source tools
set PYTHON_HOME=C:\Python27
set EDK_TOOLS_PATH=%CD%\BaseTools
BaseTools\toolssetup.bat Rebuild

5. Build Steps *** NT32 ***
(1). Open a Microsoft Visual Studio* command prompt, type cd C:\MyWorkspace to enter the workspace directory
(2). Use edksetup.bat command to initialize the working environment. edksetup --nt32
(3). Type following command to build Nt32 platform build -t VS2015x86
(4). Upon the build completing successfully there should be the UEFI Application "HelloWorld.efi" in the C:\MyWorkspace\Build\MdeModule\DEBUG_VS2015x86\IA32 directory

Check Legacy BIOS Image from UEFi Shell

2017-03-08T21:18:00.002-08:00

//The program is for searching and dumping Legacy BIOS Image between 0 to 1M system Memory.
EFI_STATUS
EFIAPI
InitializeUIApplication (
IN EFI_HANDLE ImageHandle,
IN EFI_SYSTEM_TABLE *SystemTable
) {
EFI_STATUS Status = EFI_SUCCESS;
EFI_SHELL_APP_INIT (ImageHandle, SystemTable);
{
UINT64 addr, offset;
UINT16 count = 0, i;
Print(L"Detecting....\n");
//for (addr = 0xC0000; addr < 0xE0000; addr += 0x200)
for (addr = 0x0000; addr < 0x100000; addr += 0x200)
{
//Print(L"address=0x%x\n", addr);
if (
((*(UINT16 *)(addr + 0x00)) == 0xAA55) &&
((*(UINT16 *)(addr + 0x20)) == 0x8086) && //Vendor ID
//((*(UINT16 *)(addr + 0x22)) == 0x27D8) && //Device ID
(1)) {
Print(L"Legacy BIOS is at:0x%08x\n", (UINT32)(UINT64)addr);
for (offset = 0; offset < 4; offset ++){
Print(L"%08x: ", (UINT32)(addr + offset * 0x10));
for (i = 0; i < 16; i ++) {
Print(L"%02x ", (UINT8)*((UINT8 *)addr + offset * 0x10 + i));
}
for (i = 0; i < 16; i ++) {
if (((UINT8)*((UINT8 *)(addr + offset * 0x10 + i)) >= 0x20)
&& ((UINT8)*((UINT8 *)(addr + offset * 0x10 + i)) < 0x80))
Print(L"%c", (UINT8)*((UINT8 *)addr + offset * 0x10 + i));
else
Print(L".");
}
Print(L"\n");
}
count ++;
}
}
if (count == 0)
Print(L"No found any BIOS image.\n");
}
{
Print(L"System BIOS remaining memory[0040h:0013h]=0x%x(%d KBytes)\n", *(UINT16 *)0x413, *(UINT16 *)0x413);
Print(L"Length of EBDA[0040h:000Eh]=%xh:0000h=%dk\n", *(UINT16 *)0x40e, *(UINT8 *)((UINT32)*(UINT16 *)0x40e << 4));
}
return Status;
}

How to use FILE, DATE, TIME, LINE, FUNCTION, FILE to debug in C?

2016-08-05T06:06:00.000-07:00

================================================
__FILE__ current file nume.
__FUNCTION__ current functionnume.
__LINE__ current line number.
__DATE__ built date.

__TIME__ built time.
================================================

#include
#include
void call_test_fun(void);

#define DBG_PRINT(msg, arg...) printf("%s:%s(%d): " msg, __FILE__, __FUNCTION__, __LINE__, ##arg)

int main(void)
{
    printf( "The file is: %s\n", __FILE__ );
    printf( "This function is: %s\n", __FUNCTION__ );
printf( "This is line: %d\n", __LINE__ );
printf( "The date is: %s\n", __DATE__ );
    printf( "The time is: %s\n", __TIME__ );
    call_test_fun();
    return 0;
}

void call_test_fun(void)
{
    printf( "This function is: %s\n", __func__ );
    printf( "The file is: %s\n", __FILE__ );
    printf( "This is line: %d\n", __LINE__ );
printf( "STDC: %d \n", __STDC__);
printf( "STDC_HOSTED: %d \n", __STDC_HOSTED__);
printf( "VERSION: %s \n", __VERSION__);
printf( "TIMESTAMP: %s \n", __TIMESTAMP__);
  DBG_PRINT("number = %d, str = %s\n", index, str);
}

Create a Pop Up box in Hii(Human Interface Infrstructure)

2016-08-05T05:17:00.003-07:00

u16 i;

EFI_INPUT_KEY Key;

DEBUG_PRINT (("Key scan.........\n"));

do {

CreatePopUp (

EFI_LIGHTGRAY | EFI_BACKGROUND_RED,

&Key,

L"",

L"Would you like to create this virtual disk?",

L" [Yes] [No] ",

L"",

NULL

);

DEBUG_PRINT (("Unicode=0x%x, ScanCode=0x%x <%c>\n", Key.UnicodeChar, Key.ScanCode, Key.UnicodeChar));

} while ((Key.ScanCode != SCAN_ESC) && (Key.UnicodeChar != CHAR_CARRIAGE_RETURN));

Print Messages:

Unicode=0x79, ScanCode=0x0

Unicode=0x59, ScanCode=0x0

Unicode=0x6E, ScanCode=0x0

Unicode=0x4E, ScanCode=0x0

ScanCode=0x0(SCAN_NULL)

// EFI Console Colours

#define EFI_BLACK 0x00

#define EFI_BLUE 0x01

#define EFI_GREEN 0x02

#define EFI_CYAN (EFI_BLUE | EFI_GREEN)

#define EFI_RED 0x04

#define EFI_MAGENTA (EFI_BLUE | EFI_RED)

#define EFI_BROWN (EFI_GREEN | EFI_RED)

#define EFI_LIGHTGRAY (EFI_BLUE | EFI_GREEN | EFI_RED)

#define EFI_BRIGHT 0x08

#define EFI_DARKGRAY (EFI_BRIGHT)

#define EFI_LIGHTBLUE (EFI_BLUE | EFI_BRIGHT)

#define EFI_LIGHTGREEN (EFI_GREEN | EFI_BRIGHT)

#define EFI_LIGHTCYAN (EFI_CYAN | EFI_BRIGHT)

#define EFI_LIGHTRED (EFI_RED | EFI_BRIGHT)

#define EFI_LIGHTMAGENTA (EFI_MAGENTA | EFI_BRIGHT)

#define EFI_YELLOW (EFI_BROWN | EFI_BRIGHT)

#define EFI_WHITE (EFI_BLUE | EFI_GREEN | EFI_RED | EFI_BRIGHT)

#define EFI_TEXT_ATTR(f, b) ((f) | ((b) << 4))

#define EFI_BACKGROUND_BLACK 0x00

#define EFI_BACKGROUND_BLUE 0x10

#define EFI_BACKGROUND_GREEN 0x20

#define EFI_BACKGROUND_CYAN (EFI_BACKGROUND_BLUE | EFI_BACKGROUND_GREEN)

#define EFI_BACKGROUND_RED 0x40

#define EFI_BACKGROUND_MAGENTA (EFI_BACKGROUND_BLUE | EFI_BACKGROUND_RED)

#define EFI_BACKGROUND_BROWN (EFI_BACKGROUND_GREEN | EFI_BACKGROUND_RED)

#define EFI_BACKGROUND_LIGHTGRAY (EFI_BACKGROUND_BLUE | EFI_BACKGROUND_GREEN | EFI_BACKGROUND_RED)

// EFI Scan codes

#define SCAN_NULL 0x0000

#define SCAN_UP 0x0001

#define SCAN_DOWN 0x0002

#define SCAN_RIGHT 0x0003

#define SCAN_LEFT 0x0004

#define SCAN_HOME 0x0005

#define SCAN_END 0x0006

#define SCAN_INSERT 0x0007

#define SCAN_DELETE 0x0008

#define SCAN_PAGE_UP 0x0009

#define SCAN_PAGE_DOWN 0x000A

#define SCAN_F1 0x000B

#define SCAN_F2 0x000C

#define SCAN_F3 0x000D

#define SCAN_F4 0x000E

#define SCAN_F5 0x000F

#define SCAN_F6 0x0010

#define SCAN_F7 0x0011

#define SCAN_F8 0x0012

#define SCAN_F9 0x0013

#define SCAN_F10 0x0014

#define SCAN_F11 0x0015

#define SCAN_F12 0x0016

#define SCAN_ESC 0x0017

Convert DATE to unsigned int

2016-06-24T02:45:00.000-07:00

January => Jan.

February => Feb.

March => Mar.

April => Apr.

May => May.

June => Jun.

July => Jul.

August => Aug.

September => Sep.

October => Oct.

November => Nov.

December => Dec.

#include 〈stdio.h〉

#define YEAR ((((__DATE__ [7] - '0') * 10 + (__DATE__ [8] - '0')) * 10 \
+ (__DATE__ [9] - '0')) * 10 + (__DATE__ [10] - '0'))

#if 0 //fail when input "Jun"

#define MONTH (__DATE__ [2] == 'n' ? 0 \
: __DATE__ [2] == 'b' ? 1 \
: __DATE__ [2] == 'r' ? (__DATE__ [0] == 'M' ? 2 : 3) \
: __DATE__ [2] == 'y' ? 4 \
: __DATE__ [2] == 'n' ? 5 \
: __DATE__ [2] == 'l' ? 6 \
: __DATE__ [2] == 'g' ? 7 \
: __DATE__ [2] == 'p' ? 8 \
: __DATE__ [2] == 't' ? 9 \
: __DATE__ [2] == 'v' ? 10 : 11)

#endif

//fixed

#define MONTH (__DATE__ [2] == 'n' ? (__DATE__ [1] == 'a' ? 0 : 5) \

: __DATE__ [2] == 'b' ? 1 \

: __DATE__ [2] == 'r' ? (__DATE__ [0] == 'M' ? 2 : 3) \

: __DATE__ [2] == 'y' ? 4 \

: __DATE__ [2] == 'l' ? 6 \

: __DATE__ [2] == 'g' ? 7 \

: __DATE__ [2] == 'p' ? 8 \

: __DATE__ [2] == 't' ? 9 \

: __DATE__ [2] == 'v' ? 10 : 11)

#define DAY ((__DATE__ [4] == ' ' ? 0 : __DATE__ [4] - '0') * 10 \
+ (__DATE__ [5] - '0'))

#define DATE_AS_INT (((YEAR - 2000) * 12 + MONTH) * 31 + DAY)

int main (void)
{
printf ("%d-%02d-%02d = %d\n", YEAR, MONTH + 1, DAY, DATE_AS_INT);
return 0;

}

UDK2014 How to Build

2016-01-18T00:50:00.000-08:00

UDK2014 - How to build instructions

Download the UDK2014 Release with expanded workspace directories DownLoad

UDK2014 Release Files / Directories

What is included in the Downloaded zip file

UDK2014.MyWorkSpace.zip
BaseTools(Windows).zip
BaseTools(Unix).tar
Documents
Notes

Windows System Configuration

Microsoft Windows 7 Ultimate 64-bit*

1. Setup Build Environment

1) Install Microsoft Visual Studio 2008* SP1 in the build machine and make sure that AMD64 complier was selected when installing.

2. Extract Common Source Code

1) Extract files in [UDK2014.MyWorkSpace.zip] to the working space directory (e.g C:). Note the Directory "MyWorkSpace" will be created as a result. In this case, it is C:\MyWorkspace.
2) There are two BaseTools package one is for Windows system and another is for UNIX-Like system. Please make sure BaseTools(Windows).zip is used here. Expand the appropriate BaseTools to C:\MyWorkSpace

3. Generate OpenSSL* Crypto Library Note: this does not need to be done for Nt32

Open file "C:\MyWorkspace\CryptoPkg\Library\OpensslLib\Patch-HOWTO.txt" and follow the instruction to install OpenSSL* for UEFI building.

http://ftp.vim.org/security/openssl/

=====================================================================

OpenSSL-Version

=====================================================================

Current supported OpenSSL version for UEFI Crypto Library is 1.0.2d.

http://www.openssl.org/source/openssl-1.0.2d.tar.gz

=====================================================================

HOW to Install Openssl for UEFI Building

=====================================================================

1. Download OpenSSL 1.0.2d from official website:

http://www.openssl.org/source/openssl-1.0.2d.tar.gz

NOTE: Some web browsers may rename the downloaded TAR file to openssl-1.0.2d.tar.tar.

When you do the download, rename the "openssl-1.0.2d.tar.tar" to

"openssl-1.0.2d.tar.gz" or rename the local downloaded file with ".tar.tar"

extension to ".tar.gz".

2. Extract TAR into CryptoPkg/Library/OpenSslLib/openssl-1.0.2d

NOTE: If you use WinZip to unpack the openssl source in Windows, please

uncheck the WinZip smart CR/LF conversion option (WINZIP: Options -->

Configuration --> Miscellaneous --> "TAR file smart CR/LF conversion").

3. Apply this patch: EDKII_openssl-1.0.2d.patch, and make installation

For Windows Environment:

------------------------

1) Make sure the patch utility has been installed in your machine.

Install Cygwin or get the patch utility binary from

http://gnuwin32.sourceforge.net/packages/patch.htm

2) cd $(WORKSPACE)\CryptoPkg\Library\OpensslLib\openssl-1.0.2d

3) patch -p0 -i ..\EDKII_openssl-1.0.2d.patch

4) cd ..

5) Install.cmd

For Linux* Environment:

-----------------------

1) Make sure the patch utility has been installed in your machine.

Patch utility is available from http://directory.fsf.org/project/patch/

2) cd $(WORKSPACE)/CryptoPkg/Library/OpensslLib/openssl-1.0.2d

3) patch -p0 -i ../EDKII_openssl-1.0.2d.patch

4) cd ..

5) ./Install.sh

=====================================================================

4. Build Steps *** NT32 ***

1) Open a command prompt, type command "cd C:\MyWorkspace" to enter the workspace directory, and then type command

> edksetup --nt32

to initialize the working environment. See also: Windows_systems_ToolChain_Matrix for how to change the TOOL_CHAIN_TAG for supported compiler combinations.

2) Type below commands to build platforms (below assumes Microsoft Visual Studio 2008)

> build -t VS2008x86

Note: There are two methods to select the tool chain (Use Microsoft Visual Studio 2008* as sample):

1. Update TOOL_CHAIN_TAG in file Conf/target.txt: TOOL_CHAIN_TAG = VS2008
2. Add -t build option in command line: "build -t VS2008 ... "

For 32-bit VS2008 on 64-bit WINDOWS OS, VS2008x86 should be selected instead of VS2008. Please refer to tools_def.txt for all supported tool chains and detailed descriptions. (tools_def.txt will be generated at Conf directory after running "edksetup".)

3. Note Microsoft Visual Studio* 2010 is supported with -t VS2010 or -t VS2010x86

Unix-Like System Configuration

Ubuntu

DistributorID: Ubuntu*

Description: Ubuntu 10*

Release: Ubuntu 10.10*

Codename: Karmic*

1. Extract Common Source Code

1) Create a working space directory in the build machine, for example, ~/src/
2) Extract files in [UDK2014.MyWorkSpace.zip] the working space directory. In this case, it is ~/src/MyWorkSpace where /MyWorkSpace is created.
3) There are two BaseTools packages, one is for Windows system and another is for UNIX-Like system. Please make sure BaseTools(Unix).tar is used here.

2. Generate OpenSSL* Crypto Library Note: This does not need to be done for Nt32 Open file "~/src/MyWorkspace/CryptoPkg/Library/OpensslLib/Patch-HOWTO.txt" and follow the instruction to install OpenSSL* for UEFI building.

3. See How to Set up Build environment Using EDK II with Native GCC for newer versions of Linux

a) Please note that here the root is "~/src/MyWorkSpace" instead of "~/src/edk2"
b) Make sure BaseTools is built and required software like iASL compiler is installed well.
c) Some operations need switch to user "root" to execute.

4. Build Steps *** Nt32 ***

1) Open a terminal and type "cd ~/src/MyWorkSpace" to enter the workspace directory.
2) Initialize the build environment by typing

>. edksetup.sh BaseTools

3) Type below commands to build platforms

> build -t GCC44

NVM Express SCSI Command Mappings

2015-11-10T03:02:00.002-08:00

http://www.nvmexpress.org/wp-content/uploads/NVM-Express-SCSI-Translation-Reference-1_1-Gold.pdf

如果你的無線鍵盤與滑鼠不能連接上你的iMac時，該如何處理？

2015-02-10T19:26:00.001-08:00

當你的iMac已經過保固，你又不想資付龐大維修費(6000~7000塊)去送修。你可以去買一支Bluetooth USB裝置(400塊左右)接上iMac，這樣你的無線鍵盤與滑鼠右可以使用了。

MacBook Air與MacBook Pro可以偵測的到Bluetooth USB裝置，但無線鍵盤與滑鼠還是連不上。但iMac可以使用此裝置，並可以偵測的到無線鍵盤與滑鼠。
試試看吧! 省省荷包。

野山羊隨手記錄

Rust: triangles from smallest/largest to largest/smallest

找右邊算來第一個1的bit位置

有2、3、4、5、6個數字，能組成多少種互不相等且並無重複這幾個數字的四位數數字，共有多少個?

將字串反向列印, 並做位置對調

簡單的將字串反向列印, 不做位置對調

Function pointer and type define

用數字劃出菱形由小（邊）至大（中心）

用數字劃出三角形

數字排序 由大到小與由小到大 排列

開根號小數點後精度兩位數

用減法與位移做除法並取餘數

只用加法與位移做出乘法

用*號字元劃出三角形

最小公因數函式遞迴方式

最大公因數與最小公倍數的函式

質數搜尋

Developer's UEFI Emulation (DUET) on Edk2 for Boot Disk

UDK2017 How to Build

Check Legacy BIOS Image from UEFi Shell

How to use __FILE__, __DATE__, __TIME__, __LINE__, __FUNCTION__, __FILE__ to debug in C?

Create a Pop Up box in Hii(Human Interface Infrstructure)

Convert __DATE__ to unsigned int

UDK2014 How to Build

UDK2014 Release Files / Directories

Windows System Configuration

Unix-Like System Configuration

NVM Express SCSI Command Mappings

如果你的無線鍵盤與滑鼠不能連接上你的iMac時，該如何處理？

數字排序由大到小與由小到大排列

How to use FILE, DATE, TIME, LINE, FUNCTION, FILE to debug in C?

Convert DATE to unsigned int