Changeset 1b20da0 in mainline for uspace/lib/c/include


Ignore:
Timestamp:
2018-02-28T17:52:03Z (8 years ago)
Author:
Jiří Zárevúcky <zarevucky.jiri@…>
Branches:
lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
Children:
3061bc1
Parents:
df6ded8
git-author:
Jiří Zárevúcky <zarevucky.jiri@…> (2018-02-28 17:26:03)
git-committer:
Jiří Zárevúcky <zarevucky.jiri@…> (2018-02-28 17:52:03)
Message:

style: Remove trailing whitespace on non-empty lines, in certain file types.

Command used: tools/srepl '\([^[:space:]]\)\s\+$' '\1' -- *.c *.h *.py *.sh *.s *.S *.ag

Location:
uspace/lib/c/include
Files:
15 edited

Legend:

Unmodified
Added
Removed

  • uspace/lib/c/include/adt/fifo.h

    rdf6ded8 r1b20da0  
    7878 *
    7979 * FIFO is allocated dynamically.
    80  * This macro is suitable for creating larger FIFOs. 
     80 * This macro is suitable for creating larger FIFOs.
    8181 *
    8282 * @param name Name of FIFO.
    … …  
    113113 */
    114114#define fifo_push(name, value) \
    115         name.fifo[name.tail = (name.tail + 1) < name.items ? (name.tail + 1) : 0] = (value) 
     115        name.fifo[name.tail = (name.tail + 1) < name.items ? (name.tail + 1) : 0] = (value)
    116116
    117117/** Allocate memory for dynamic FIFO.

  • uspace/lib/c/include/adt/hash.h

    rdf6ded8 r1b20da0  
    4646         * Public domain.
    4747         */
    48         hash = ~hash + (hash << 15); 
     48        hash = ~hash + (hash << 15);
    4949        hash = hash ^ (hash >> 12);
    5050        hash = hash + (hash << 2);
    5151        hash = hash ^ (hash >> 4);
    52         hash = hash * 2057; 
     52        hash = hash * 2057;
    5353        hash = hash ^ (hash >> 16);
    54         return hash;   
     54        return hash;
    5555}
    5656
    … …  
    6666        hash = hash ^ (hash >> 4);
    6767        hash = hash * 0x27d4eb2d;
    68         hash = hash ^ (hash >> 15);     
    69         /* 
     68        hash = hash ^ (hash >> 15);
     69        /*
    7070         * Lower order bits are mixed more thoroughly. Swap them with
    7171         * the higher order bits and make the resulting higher order bits
    … …  
    7676
    7777/** Produces a uniform hash affecting all output bits from the skewed input. */
    78 static inline size_t hash_mix(size_t hash) 
     78static inline size_t hash_mix(size_t hash)
    7979{
    8080#ifdef __32_BITS__
    … …  
    8888
    8989/** Use to create a hash from multiple values.
    90  * 
     90 *
    9191 * Typical usage:
    9292 * @code
    … …  
    102102static inline size_t hash_combine(size_t seed, size_t hash)
    103103{
    104         /* 
     104        /*
    105105         * todo: use Bob Jenkin's proper mixing hash pass:
    106106         * http://burtleburtle.net/bob/c/lookup3.c
    107107         */
    108         seed ^= hash + 0x9e3779b9 
     108        seed ^= hash + 0x9e3779b9
    109109                + ((seed << 5) | (seed >> (sizeof(size_t) * 8 - 5)));
    110         return seed;   
     110        return seed;
    111111}
    112112

  • uspace/lib/c/include/adt/hash_table.h

    rdf6ded8 r1b20da0  
    22 * Copyright (c) 2006 Jakub Jermar
    33 * Copyright (c) 2012 Adam Hraska
    4  * 
     4 *
    55 * All rights reserved.
    66 *
    … …  
    6262
    6363        /** Hash table item removal callback.
    64          * 
     64         *
    6565         * Must not invoke any mutating functions of the hash table.
    6666         *

  • uspace/lib/c/include/adt/list.h

    rdf6ded8 r1b20da0  
    6666
    6767/** Initializer for statically allocated list.
    68  * 
     68 *
    6969 * @code
    7070 * struct named_list {
    7171 *     const char *name;
    7272 *     list_t list;
    73  * } var = { 
    74  *     .name = "default name", 
    75  *     .list = LIST_INITIALIZER(name_list.list) 
     73 * } var = {
     74 *     .name = "default name",
     75 *     .list = LIST_INITIALIZER(name_list.list)
    7676 * };
    7777 * @endcode
    … …  
    111111 *     link_t item_link;
    112112 * } item_t;
    113  * 
     113 *
    114114 * //..
    115  * 
     115 *
    116116 * // Print each list element's value and remove the element from the list.
    117117 * list_foreach_safe(mylist, cur_link, next_link) {
    … …  
    121121 * }
    122122 * @endcode
    123  * 
     123 *
    124124 * @param list List to traverse.
    125125 * @param iterator Iterator to the current element of the list.

  • uspace/lib/c/include/device/hw_res_parsed.h

    rdf6ded8 r1b20da0  
    5454
    5555typedef struct address64 {
    56         /** Aboslute address. */ 
     56        /** Aboslute address. */
    5757        uint64_t absolute;
    5858        /** PIO window base relative address. */
    59         uint64_t relative; 
     59        uint64_t relative;
    6060} address64_t;
    6161

  • uspace/lib/c/include/device/pio_window.h

    rdf6ded8 r1b20da0  
    11/*
    2  * Copyright (c) 2013 Jakub Jermar 
     2 * Copyright (c) 2013 Jakub Jermar
    33 * All rights reserved.
    44 *

  • uspace/lib/c/include/devman.h

    rdf6ded8 r1b20da0  
    11/*
    22 * Copyright (c) 2009 Jiri Svoboda
    3  * Copyright (c) 2010 Lenka Trochtova 
     3 * Copyright (c) 2010 Lenka Trochtova
    44 * All rights reserved.
    55 *

  • uspace/lib/c/include/double_to_str.h

    rdf6ded8 r1b20da0  
    3232#include <stddef.h>
    3333
    34 /** Maximum number of digits double_to_*_str conversion functions produce. 
     34/** Maximum number of digits double_to_*_str conversion functions produce.
    3535 *
    3636 * Both double_to_short_str and double_to_fixed_str generate digits out
    37  * of a 64bit unsigned int number representation. The max number of 
     37 * of a 64bit unsigned int number representation. The max number of
    3838 * of digits is therefore 20. Add 1 to help users who forget to reserve
    3939 * space for a null terminator.
    … …  
    4141#define MAX_DOUBLE_STR_LEN (20 + 1)
    4242
    43 /** Maximum buffer size needed to store the output of double_to_*_str 
    44  *  functions. 
     43/** Maximum buffer size needed to store the output of double_to_*_str
     44 *  functions.
    4545 */
    4646#define MAX_DOUBLE_STR_BUF_SIZE  21
    … …  
    5353    size_t, int *);
    5454
    55 #endif 
     55#endif

  • uspace/lib/c/include/fibril.h

    rdf6ded8 r1b20da0  
    4848        } while (0)
    4949
    50 #define FIBRIL_WRITER   1 
     50#define FIBRIL_WRITER   1
    5151
    5252struct fibril;

  • uspace/lib/c/include/fibril_synch.h

    rdf6ded8 r1b20da0  
    11/*
    2  * Copyright (c) 2009 Jakub Jermar 
     2 * Copyright (c) 2009 Jakub Jermar
    33 * All rights reserved.
    44 *
    … …  
    6363       
    6464#define FIBRIL_MUTEX_INITIALIZE(name) \
    65         fibril_mutex_t name = FIBRIL_MUTEX_INITIALIZER(name) 
     65        fibril_mutex_t name = FIBRIL_MUTEX_INITIALIZER(name)
    6666
    6767typedef struct {

  • uspace/lib/c/include/ieee_double.h

    rdf6ded8 r1b20da0  
    5353        bool is_denormal;
    5454        /**
    55          * The predecessor double is closer than the successor. This happens 
     55         * The predecessor double is closer than the successor. This happens
    5656         * if a normal number is of the form 2^k and it is not the smallest
    57          * normal number. 
     57         * normal number.
    5858         */
    5959        bool is_accuracy_step;
    60         /** 
     60        /**
    6161         * If !is_special the double's value is:
    6262         *   pos_val.significand * 2^pos_val.exponent

  • uspace/lib/c/include/offset.h

    rdf6ded8 r1b20da0  
    11/*
    2  * Copyright (c) 2017 Jakub Jermar 
     2 * Copyright (c) 2017 Jakub Jermar
    33 * All rights reserved.
    44 *

  • uspace/lib/c/include/rcu.h

    rdf6ded8 r1b20da0  
    4141#include <stdbool.h>
    4242
    43 /** Use to assign a pointer to newly initialized data to a rcu reader 
     43/** Use to assign a pointer to newly initialized data to a rcu reader
    4444 * accessible pointer.
    45  * 
     45 *
    4646 * Example:
    4747 * @code
    … …  
    5050 *     int grade;
    5151 * } exam_t;
    52  * 
     52 *
    5353 * exam_t *exam_list;
    5454 * // ..
    55  * 
     55 *
    5656 * // Insert at the beginning of the list.
    5757 * exam_t *my_exam = malloc(sizeof(exam_t), 0);
    … …  
    5959 * my_exam->next = exam_list;
    6060 * rcu_assign(exam_list, my_exam);
    61  * 
     61 *
    6262 * // Changes properly propagate. Every reader either sees
    6363 * // the old version of exam_list or the new version with
    … …  
    6565 * rcu_synchronize();
    6666 * // Now we can be sure every reader sees my_exam.
    67  * 
     67 *
    6868 * @endcode
    6969 */
    … …  
    7575
    7676/** Use to access RCU protected data in a reader section.
    77  * 
     77 *
    7878 * Example:
    7979 * @code
    8080 * exam_t *exam_list;
    8181 * // ...
    82  * 
     82 *
    8383 * rcu_read_lock();
    8484 * exam_t *first_exam = rcu_access(exam_list);
    85  * // We can now safely use first_exam, it won't change 
     85 * // We can now safely use first_exam, it won't change
    8686 * // under us while we're using it.
    8787 *

  • uspace/lib/c/include/vfs/canonify.h

    rdf6ded8 r1b20da0  
    11/*
    2  * Copyright (c) 2008 Jakub Jermar 
     2 * Copyright (c) 2008 Jakub Jermar
    33 * All rights reserved.
    44 *

  • uspace/lib/c/include/vfs/inbox.h

    rdf6ded8 r1b20da0  
    2727 */
    2828
    29 /** @addtogroup libc 
     29/** @addtogroup libc
    3030 * @{
    3131 */
Note: See TracChangeset for help on using the changeset viewer.