| 1 | /*
|
|---|
| 2 | * Copyright (c) 2010 Lenka Trochtova
|
|---|
| 3 | * All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 8 | *
|
|---|
| 9 | * - Redistributions of source code must retain the above copyright
|
|---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
|---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 13 | * documentation and/or other materials provided with the distribution.
|
|---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
|---|
| 15 | * derived from this software without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | /** @addtogroup devman
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 |
|
|---|
| 33 | #include <stdlib.h>
|
|---|
| 34 | #include <str.h>
|
|---|
| 35 |
|
|---|
| 36 | #include "util.h"
|
|---|
| 37 |
|
|---|
| 38 | char *get_abs_path(const char *base_path, const char *name, const char *ext)
|
|---|
| 39 | {
|
|---|
| 40 | char *res;
|
|---|
| 41 | int base_len = str_bytes(base_path);
|
|---|
| 42 | int size = base_len + 2 * str_bytes(name) + str_bytes(ext) + 3;
|
|---|
| 43 |
|
|---|
| 44 | res = malloc(size);
|
|---|
| 45 |
|
|---|
| 46 | if (res) {
|
|---|
| 47 | str_cpy(res, size, base_path);
|
|---|
| 48 | if (base_path[base_len - 1] != '/')
|
|---|
| 49 | str_append(res, size, "/");
|
|---|
| 50 | str_append(res, size, name);
|
|---|
| 51 | str_append(res, size, "/");
|
|---|
| 52 | str_append(res, size, name);
|
|---|
| 53 | if (ext[0] != '.')
|
|---|
| 54 | str_append(res, size, ".");
|
|---|
| 55 | str_append(res, size, ext);
|
|---|
| 56 | }
|
|---|
| 57 |
|
|---|
| 58 | return res;
|
|---|
| 59 | }
|
|---|
| 60 |
|
|---|
| 61 | char *get_path_elem_end(char *path)
|
|---|
| 62 | {
|
|---|
| 63 | while (*path != '\0' && *path != '/')
|
|---|
| 64 | path++;
|
|---|
| 65 | return path;
|
|---|
| 66 | }
|
|---|
| 67 |
|
|---|
| 68 | bool skip_spaces(char **buf)
|
|---|
| 69 | {
|
|---|
| 70 | while (isspace(**buf))
|
|---|
| 71 | (*buf)++;
|
|---|
| 72 | return *buf != 0;
|
|---|
| 73 | }
|
|---|
| 74 |
|
|---|
| 75 | void skip_line(char **buf)
|
|---|
| 76 | {
|
|---|
| 77 | while (**buf && **buf != '\n')
|
|---|
| 78 | (*buf)++;
|
|---|
| 79 | }
|
|---|
| 80 |
|
|---|
| 81 | size_t get_nonspace_len(const char *str)
|
|---|
| 82 | {
|
|---|
| 83 | size_t len = 0;
|
|---|
| 84 |
|
|---|
| 85 | while (*str != '\0' && !isspace(*str)) {
|
|---|
| 86 | len++;
|
|---|
| 87 | str++;
|
|---|
| 88 | }
|
|---|
| 89 |
|
|---|
| 90 | return len;
|
|---|
| 91 | }
|
|---|
| 92 |
|
|---|
| 93 | void replace_char(char *str, char orig, char repl)
|
|---|
| 94 | {
|
|---|
| 95 | while (*str) {
|
|---|
| 96 | if (*str == orig)
|
|---|
| 97 | *str = repl;
|
|---|
| 98 | str++;
|
|---|
| 99 | }
|
|---|
| 100 | }
|
|---|
| 101 |
|
|---|
| 102 | /** @}
|
|---|
| 103 | */
|
|---|
