Ignore:
Timestamp:
Dec 9, 2025, 5:23:33 PM (6 days ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
master
Children:
fe6047c
Parents:
79ec8c3
Message:

proofread background chapter

Location:
doc/theses/mike_brooks_MMath/programs
Files:
4 edited

Legend:

Unmodified
Added
Removed

  • doc/theses/mike_brooks_MMath/programs/bkgd-c-tyerr.c

    r79ec8c3 rf2b74e3  
    1616
    1717        float pi = 3.14;
    18         void f( void (*g)(void) ) { g(); }
     18        void f( void (*g)(void) );
    1919        @f( &pi );@                     $\C{// wrong}$
    2020}

  • doc/theses/mike_brooks_MMath/programs/bkgd-carray-decay.c

    r79ec8c3 rf2b74e3  
    1010        assert( sizeof(pa0x) != sizeof(ar) );
    1111
    12         void f( float x[10], float * y ) {
     12        void f( @float x[10]@, @float * y@ ) {
    1313                static_assert( sizeof(x) == sizeof(void *) );
    1414                static_assert( sizeof(y) == sizeof(void *) );
    … …  
    1616        f( 0, 0 );
    1717
    18         // reusing local var `float a[10];`}
     18        // reusing local variable float ar[10]
    1919        float v;
    2020        f( ar, ar );                            $\C{// ok: two decays, one into an array spelling}$

  • doc/theses/mike_brooks_MMath/programs/bkgd-carray-mdim.c

    r79ec8c3 rf2b74e3  
    3838//      float (*b[3])[10];
    3939        float * b[3];
    40         for (int i = 0; i < 3; i ++) {
    41                 b[i] = malloc(sizeof(float[10]));
     40        for ( int i = 0; i < 3; i ++ ) {
     41                b[i] = malloc( sizeof( float[10] ) );
    4242        }
    4343        mx[2][3];

  • doc/theses/mike_brooks_MMath/programs/lst-issues-multi-static.run.c

    r79ec8c3 rf2b74e3  
    2020struct req {
    2121        int pri, rqr;
    22         LIST_ENTRY(req) by_pri;
    23         LIST_ENTRY(req) by_rqr;
     22        LIST_ENTRY( req ) by_pri;
     23        LIST_ENTRY( req ) by_rqr;
    2424};
    2525
    26 LIST_HEAD(reql, req);
     26LIST_HEAD( reql, req );
    2727
    2828struct reql reqs_pri;
    … …  
    3131struct reql reqs_rqr_99;
    3232
    33 LIST_INIT(&reqs_pri);
    34 LIST_INIT(&reqs_rqr_42);
    35 LIST_INIT(&reqs_rqr_17);
    36 LIST_INIT(&reqs_rqr_99);
     33LIST_INIT( &reqs_pri );
     34LIST_INIT( &reqs_rqr_42 );
     35LIST_INIT( &reqs_rqr_17 );
     36LIST_INIT( &reqs_rqr_99 );
    3737
    3838struct req
    … …  
    4444        r99a = {3, 99};
    4545
    46 LIST_INSERT_HEAD(&reqs_pri, &r17c, by_pri);
    47 LIST_INSERT_HEAD(&reqs_pri, &r99a, by_pri);
    48 LIST_INSERT_HEAD(&reqs_pri, &r17b, by_pri);
    49 LIST_INSERT_HEAD(&reqs_pri, &r42b, by_pri);
    50 LIST_INSERT_HEAD(&reqs_pri, &r17a, by_pri);
    51 LIST_INSERT_HEAD(&reqs_pri, &r42a, by_pri);
     46LIST_INSERT_HEAD( &reqs_pri, &r17c, by_pri );
     47LIST_INSERT_HEAD( &reqs_pri, &r99a, by_pri );
     48LIST_INSERT_HEAD( &reqs_pri, &r17b, by_pri );
     49LIST_INSERT_HEAD( &reqs_pri, &r42b, by_pri );
     50LIST_INSERT_HEAD( &reqs_pri, &r17a, by_pri );
     51LIST_INSERT_HEAD( &reqs_pri, &r42a, by_pri );
    5252
    53 LIST_INSERT_HEAD(&reqs_rqr_42, &r42b, by_rqr);
    54 LIST_INSERT_HEAD(&reqs_rqr_42, &r42a, by_rqr);
     53LIST_INSERT_HEAD( &reqs_rqr_42, &r42b, by_rqr );
     54LIST_INSERT_HEAD( &reqs_rqr_42, &r42a, by_rqr );
    5555
    56 LIST_INSERT_HEAD(&reqs_rqr_17, &r17c, by_rqr);
    57 LIST_INSERT_HEAD(&reqs_rqr_17, &r17b, by_rqr);
    58 LIST_INSERT_HEAD(&reqs_rqr_17, &r17a, by_rqr);
     56LIST_INSERT_HEAD( &reqs_rqr_17, &r17c, by_rqr );
     57LIST_INSERT_HEAD( &reqs_rqr_17, &r17b, by_rqr );
     58LIST_INSERT_HEAD( &reqs_rqr_17, &r17a, by_rqr );
    5959
    60 LIST_INSERT_HEAD(&reqs_rqr_99, &r99a, by_rqr);
     60LIST_INSERT_HEAD( &reqs_rqr_99, &r99a, by_rqr );
    6161
    6262
    … …  
    6767
    6868struct req *cur;
    69 LIST_FOREACH(cur, &reqs_pri, by_pri)
    70         printf("{%d %d} ", cur->pri, cur->rqr);
    71 printf("| ");
    72 LIST_FOREACH(cur, &reqs_rqr_42, by_rqr)
    73         printf("{%d %d} ", cur->pri, cur->rqr);
    74 printf("| ");
    75 LIST_FOREACH(cur, &reqs_rqr_17, by_rqr)
    76         printf("{%d %d} ", cur->pri, cur->rqr);
    77 printf("| ");
    78 LIST_FOREACH(cur, &reqs_rqr_99, by_rqr)
    79         printf("{%d %d} ", cur->pri, cur->rqr);
    80 printf("\n");
     69LIST_FOREACH( cur, &reqs_pri, by_pri )
     70        printf( "{%d %d} ", cur->pri, cur->rqr );
     71printf( "| " );
     72LIST_FOREACH( cur, &reqs_rqr_42, by_rqr )
     73        printf( "{%d %d} ", cur->pri, cur->rqr );
     74printf( "| " );
     75LIST_FOREACH( cur, &reqs_rqr_17, by_rqr )
     76        printf( "{%d %d} ", cur->pri, cur->rqr );
     77printf( "| " );
     78LIST_FOREACH( cur, &reqs_rqr_99, by_rqr )
     79        printf( "{%d %d} ", cur->pri, cur->rqr );
     80printf( "\n" );
    8181
    8282}
Note: See TracChangeset for help on using the changeset viewer.