From 39fdcb0c57bfeba598f00d77f190e731f26b25a1 Mon Sep 17 00:00:00 2001
From: sola.lu <sola.lu@greentest.com.cn>
Date: 周四, 24 4月 2025 18:25:01 +0800
Subject: [PATCH] 1.修改一下,把当前库改为刚从origin仓库拉去下来,然后添加了cmake构建文件的状态。

---
 libscpi/src/utils.c |  399 +++++++++++++++++++++++++++++++-------------------------
 1 files changed, 221 insertions(+), 178 deletions(-)

diff --git a/libscpi/src/utils.c b/libscpi/src/utils.c
index b2b9e03..328f8be 100644
--- a/libscpi/src/utils.c
+++ b/libscpi/src/utils.c
@@ -1,30 +1,29 @@
 /*-
- * Copyright (c) 2013 Jan Breuer
- *                    Richard.hmm
- * Copyright (c) 2012 Jan Breuer
+ * BSD 2-Clause License
  *
- * All Rights Reserved
+ * Copyright (c) 2012-2018, Jan Breuer, Richard.hmm
+ * All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- * 1. Redistributions of source code must retain the above copyright notice,
- *    this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
+ * modification, are permitted provided that the following conditions are met:
  *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
- * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
- * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
- * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
- * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ * * Redistributions of source code must retain the above copyright notice, this
+ *   list of conditions and the following disclaimer.
+ *
+ * * Redistributions in binary form must reproduce the above copyright notice,
+ *   this list of conditions and the following disclaimer in the documentation
+ *   and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 /**
@@ -108,13 +107,13 @@
                 break;
         }
 
-        // add sign for numbers in base 10
+        /* add sign for numbers in base 10 */
         if (sign && ((int32_t) val < 0) && (base == 10)) {
             uval = -val;
             ADD_CHAR('-');
         }
 
-        // remove leading zeros
+        /* remove leading zeros */
         while ((uval / x) == 0) {
             x /= base;
         }
@@ -184,7 +183,7 @@
             case 8:
                 x = 0x8000000000000000ULL;
                 break;
-	    default:
+            default:
             case 10:
                 x = 10000000000000000000ULL;
                 base = 10;
@@ -194,13 +193,13 @@
                 break;
         }
 
-        // add sign for numbers in base 10
+        /* add sign for numbers in base 10 */
         if (sign && ((int64_t) val < 0) && (base == 10)) {
             uval = -val;
             ADD_CHAR('-');
         }
 
-        // remove leading zeros
+        /* remove leading zeros */
         while ((uval / x) == 0) {
             x /= base;
         }
@@ -249,7 +248,8 @@
  * @return number of bytes written to str (without '\0')
  */
 size_t SCPI_FloatToStr(float val, char * str, size_t len) {
-    return SCPIDEFINE_floatToStr(val, str, len);
+    SCPIDEFINE_floatToStr(val, str, len);
+    return strlen(str);
 }
 
 /**
@@ -260,7 +260,8 @@
  * @return number of bytes written to str (without '\0')
  */
 size_t SCPI_DoubleToStr(double val, char * str, size_t len) {
-    return SCPIDEFINE_doubleToStr(val, str, len);
+    SCPIDEFINE_doubleToStr(val, str, len);
+    return strlen(str);
 }
 
 /**
@@ -295,7 +296,7 @@
  */
 size_t strBaseToInt64(const char * str, int64_t * val, int8_t base) {
     char * endptr;
-    *val = strtoll(str, &endptr, base);
+    *val = SCPIDEFINE_strtoll(str, &endptr, base);
     return endptr - str;
 }
 
@@ -307,7 +308,7 @@
  */
 size_t strBaseToUInt64(const char * str, uint64_t * val, int8_t base) {
     char * endptr;
-    *val = strtoull(str, &endptr, base);
+    *val = SCPIDEFINE_strtoull(str, &endptr, base);
     return endptr - str;
 }
 
@@ -319,7 +320,7 @@
  */
 size_t strToFloat(const char * str, float * val) {
     char * endptr;
-    *val = strtof(str, &endptr);
+    *val = SCPIDEFINE_strtof(str, &endptr);
     return endptr - str;
 }
 
@@ -376,7 +377,7 @@
 
         if (num) {
             if (len1 == len2) {
-                //*num = 1;
+                /* *num = 1; */
             } else {
                 int32_t tmpNum;
                 i = len1 + strBaseToInt32(str2 + len1, &tmpNum, 10);
@@ -528,11 +529,11 @@
     }
 
     /* now support optional keywords in pattern style, e.g. [:MEASure]:VOLTage:DC? */
-    if (pattern_ptr[0] == '[') { // skip first '['
+    if (pattern_ptr[0] == '[') { /* skip first '[' */
         SKIP_PATTERN(1);
         brackets++;
     }
-    if (pattern_ptr[0] == ':') { // skip first ':'
+    if (pattern_ptr[0] == ':') { /* skip first ':' */
         SKIP_PATTERN(1);
     }
 
@@ -555,7 +556,7 @@
         if ((pattern_sep_pos > 0) && pattern_ptr[pattern_sep_pos - 1] == '#') {
             if (numbers && (numbers_idx < numbers_len)) {
                 number_ptr = numbers + numbers_idx;
-                *number_ptr = default_value; // default value
+                *number_ptr = default_value; /* default value */
             } else {
                 number_ptr = NULL;
             }
@@ -582,7 +583,7 @@
 
             /* command complete, but pattern not */
             if (cmd_len == 0) {
-                // verify all subsequent pattern parts are also optional
+                /* verify all subsequent pattern parts are also optional */
                 while (pattern_len) {
                     pattern_sep_pos = patternSeparatorPos(pattern_ptr, pattern_len);
                     switch (pattern_ptr[pattern_sep_pos]) {
@@ -620,14 +621,14 @@
                     && (pattern_ptr[1] == cmd_ptr[0])
                     && (pattern_ptr[0] == '[')
                     && (pattern_ptr[1] == ':')) {
-                SKIP_PATTERN(2); // for skip '[' in "[:"
+                SKIP_PATTERN(2); /* for skip '[' in "[:" */
                 SKIP_CMD(1);
                 brackets++;
             } else if ((pattern_len > 1)
                     && (pattern_ptr[1] == cmd_ptr[0])
                     && (pattern_ptr[0] == ']')
                     && (pattern_ptr[1] == ':')) {
-                SKIP_PATTERN(2); // for skip ']' in "]:"
+                SKIP_PATTERN(2); /* for skip ']' in "]:" */
                 SKIP_CMD(1);
                 brackets--;
             } else if ((pattern_len > 2)
@@ -635,10 +636,10 @@
                     && (pattern_ptr[0] == ']')
                     && (pattern_ptr[1] == '[')
                     && (pattern_ptr[2] == ':')) {
-                SKIP_PATTERN(3); // for skip '][' in "][:"
+                SKIP_PATTERN(3); /* for skip '][' in "][:" */
                 SKIP_CMD(1);
-                //brackets++;
-                //brackets--;
+                /* brackets++; */
+                /* brackets--; */
             } else {
                 result = FALSE;
                 break;
@@ -646,14 +647,14 @@
         } else {
             SKIP_PATTERN(pattern_sep_pos);
             if ((pattern_ptr[0] == ']') && (pattern_ptr[1] == ':')) {
-                SKIP_PATTERN(2); // for skip ']' in "]:" , pattern_ptr continue, while cmd_ptr remain unchanged
+                SKIP_PATTERN(2); /* for skip ']' in "]:" , pattern_ptr continue, while cmd_ptr remain unchanged */
                 brackets--;
             } else if ((pattern_len > 2) && (pattern_ptr[0] == ']')
                     && (pattern_ptr[1] == '[')
                     && (pattern_ptr[2] == ':')) {
-                SKIP_PATTERN(3); // for skip ']' in "][:" , pattern_ptr continue, while cmd_ptr remain unchanged
-                //brackets++;
-                //brackets--;
+                SKIP_PATTERN(3); /* for skip ']' in "][:" , pattern_ptr continue, while cmd_ptr remain unchanged */
+                /* brackets++; */
+                /* brackets--; */
             } else {
                 result = FALSE;
                 break;
@@ -750,7 +751,36 @@
 }
 #endif
 
+#if USE_MEMORY_ALLOCATION_FREE && !HAVE_STRNDUP
+char *OUR_strndup(const char *s, size_t n) {
+    size_t len = SCPIDEFINE_strnlen(s, n);
+    char * result = malloc(len + 1);
+    if (!result) {
+        return NULL;
+    }
+    memcpy(result, s, len);
+    result[len] = '\0';
+    return result;
+}
+#endif
+
 #if USE_DEVICE_DEPENDENT_ERROR_INFORMATION && !USE_MEMORY_ALLOCATION_FREE
+
+/**
+ * Initialize heap structure
+ * @param heap - pointer to manual allocated heap buffer
+ * @param error_info_heap - buffer for the heap
+ * @param error_info_heap_length - length of the heap
+ */
+void scpiheap_init(scpi_error_info_heap_t * heap, char * error_info_heap, size_t error_info_heap_length)
+{
+    heap->data = error_info_heap;
+    heap->wr = 0;
+    heap->size = error_info_heap_length;
+    heap->count = heap->size;
+    memset(heap->data, 0, heap->size);
+}
+
 /**
  * Duplicate string if "strdup" ("malloc/free") not supported on system.
  * Allocate space in heap if it possible
@@ -759,38 +789,46 @@
  * @param s - current pointer of duplication string
  * @return - pointer of duplicated string or NULL, if duplicate is not possible.
  */
-char * OUR_strdup(scpi_error_info_heap_t * heap, const char *s) {
-	if(!s || !heap) {
-		return NULL;
-	}
+char * scpiheap_strndup(scpi_error_info_heap_t * heap, const char *s, size_t n) {
+    if (!s || !heap || !heap->size) {
+        return NULL;
+    }
 
-	if(heap->data[heap->wr]!='\0'){
-		return NULL;
-	}
-	
-	size_t len=strlen(s);
-	if( ( len == 0 ) || ( len > heap->count ) ){
-		return NULL;
-	}
-	len++;	// additional '\0' at end
-	char * ptrs = s;
-	char * head = &heap->data[heap->wr];
-	size_t rem = heap->size - (&heap->data[heap->wr]-heap->data);
-	size_t sstp = 0;
-	
-	if(len >= rem){
-		memcpy(&heap->data[heap->wr],s,rem);
-		len = len - rem;
-		ptrs += rem;
-		heap->wr = 0;
-		heap->count -= rem;
-	}
-	
-	memcpy(&heap->data[heap->wr],ptrs,len);
-	heap->wr += len;
-	heap->count -= len;
-	
-	return head;
+    if (heap->data[heap->wr] != '\0') {
+        return NULL;
+    }
+
+    if (*s == '\0') {
+        return NULL;
+    }
+
+    size_t len = SCPIDEFINE_strnlen(s, n) + 1; /* additional '\0' at end */
+    if (len > heap->count) {
+        return NULL;
+    }
+    const char * ptrs = s;
+    char * head = &heap->data[heap->wr];
+    size_t rem = heap->size - (&heap->data[heap->wr] - heap->data);
+
+    if (len >= rem) {
+        memcpy(&heap->data[heap->wr], s, rem);
+        len = len - rem;
+        ptrs += rem;
+        heap->wr = 0;
+        heap->count -= rem;
+    }
+
+    memcpy(&heap->data[heap->wr], ptrs, len);
+    heap->wr += len;
+    heap->count -= len;
+
+    /* ensure '\0' a the end */
+    if (heap->wr > 0) {
+        heap->data[heap->wr - 1] = '\0';
+    } else {
+        heap->data[heap->size - 1] = '\0';
+    }
+    return head;
 }
 
 /**
@@ -802,27 +840,27 @@
  * @return s2 - pointer of second part of string, if string splited .
  * @return len2 - lenght of second part of string.
  */
-scpi_bool_t OUR_get_parts(scpi_error_info_heap_t * heap, const char * s, size_t * len1, const char ** s2, size_t * len2) {
-	if(!heap || !s || !len1 || !s2 || !len2) {
-		return FALSE;
-	}
-	
-	if(*s == '\0') {
-		return FALSE;
-	}
-	
-	*len1 = 0;
-	size_t rem = heap->size - (s - heap->data);
-	*len1 = strnlen(s, rem);
+scpi_bool_t scpiheap_get_parts(scpi_error_info_heap_t * heap, const char * s, size_t * len1, const char ** s2, size_t * len2) {
+    if (!heap || !s || !len1 || !s2 || !len2) {
+        return FALSE;
+    }
 
-	if(&s[*len1-1] == &heap->data[heap->size-1]){
-		*s2 = heap->data;
-		*len2 = strnlen(*s2, heap->size);
-	}else{
-		*s2 = NULL;
-		*len2 = 0;	
-	}
-	return TRUE;
+    if (*s == '\0') {
+        return FALSE;
+    }
+
+    *len1 = 0;
+    size_t rem = heap->size - (s - heap->data);
+    *len1 = strnlen(s, rem);
+
+    if (&s[*len1 - 1] == &heap->data[heap->size - 1]) {
+        *s2 = heap->data;
+        *len2 = strnlen(*s2, heap->size);
+    } else {
+        *s2 = NULL;
+        *len2 = 0;
+    }
+    return TRUE;
 }
 
 /**
@@ -832,67 +870,69 @@
  * @param s - pointer of duplicate string
  * @param rollback - backward write pointer in heap
  */
-void OUR_free(scpi_error_info_heap_t * heap, const char * s, scpi_bool_t rollback) {
-	
-	if(!s) return;
-	
-	char * data_add;
-	size_t len[2];
-		
-	if( !OUR_get_parts( heap, s, &len[0], &data_add, &len[1] ) ) return;
-	
-	if(data_add) {
-		len[1]++;
-		memset(data_add,0,len[1]);
-		heap->count += len[1];
-	} else {
-		len[0]++;
-	}
-	memset(s,0,len[0]);
-	heap->count += len[0];
-	if( heap->count == heap->size){
-		heap->wr = 0;
-		return;
-	}
-	if(rollback){
-		size_t rb = len[0] + len[1];
-		if( rb > heap->wr){
-			heap->wr += heap->size; 
-		}
-		heap->wr -= rb;
-	}
+void scpiheap_free(scpi_error_info_heap_t * heap, char * s, scpi_bool_t rollback) {
+
+    if (!s) return;
+
+    char * data_add;
+    size_t len[2];
+
+    if (!scpiheap_get_parts(heap, s, &len[0], (const char **)&data_add, &len[1])) return;
+
+    if (data_add) {
+        len[1]++;
+        memset(data_add, 0, len[1]);
+        heap->count += len[1];
+    } else {
+        len[0]++;
+    }
+    memset(s, 0, len[0]);
+    heap->count += len[0];
+    if (heap->count == heap->size) {
+        heap->wr = 0;
+        return;
+    }
+    if (rollback) {
+        size_t rb = len[0] + len[1];
+        if (rb > heap->wr) {
+            heap->wr += heap->size;
+        }
+        heap->wr -= rb;
+    }
 }
 
 #endif
 
-// Floating point to string conversion routines
-//
-// Copyright (C) 2002 Michael Ringgaard. All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions
-// are met:
-//
-// 1. Redistributions of source code must retain the above copyright
-//    notice, this list of conditions and the following disclaimer.
-// 2. Redistributions in binary form must reproduce the above copyright
-//    notice, this list of conditions and the following disclaimer in the
-//    documentation and/or other materials provided with the distribution.
-// 3. Neither the name of the project nor the names of its contributors
-//    may be used to endorse or promote products derived from this software
-//    without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-// ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
-// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-// OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-// SUCH DAMAGE.
+/*
+ * Floating point to string conversion routines
+ *
+ * Copyright (C) 2002 Michael Ringgaard. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the project nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
 
 static char *scpi_ecvt(double arg, int ndigits, int *decpt, int *sign, char *buf, size_t bufsize) {
     int r1, r2;
@@ -925,7 +965,7 @@
             buf[--w2] = (int) ((fj + .03) * 10) + '0';
             r2++;
         }
-        while (w2 < (int)bufsize) buf[w1++] = buf[w2++];
+        while (w2 < (int) bufsize) buf[w1++] = buf[w2++];
     } else if (arg > 0) {
         while ((fj = arg * 10) < 1) {
             arg = fj;
@@ -938,12 +978,12 @@
         buf[0] = '\0';
         return buf;
     }
-    while (w1 <= w2 && w1 < (int)bufsize) {
+    while (w1 <= w2 && w1 < (int) bufsize) {
         arg *= 10;
         arg = modf(arg, &fj);
         buf[w1++] = (int) fj + '0';
     }
-    if (w2 >= (int)bufsize) {
+    if (w2 >= (int) bufsize) {
         buf[bufsize - 1] = '\0';
         return buf;
     }
@@ -967,14 +1007,14 @@
 char * SCPI_dtostre(double __val, char * __s, size_t __ssize, unsigned char __prec, unsigned char __flags) {
     char buffer[SCPI_DTOSTRE_BUFFER_SIZE];
 
-    int sign = signbit(__val);
+    int sign = SCPIDEFINE_signbit(__val);
     char * s = buffer;
     int decpt;
     if (sign) {
         __val = -__val;
         s[0] = '-';
         s++;
-    } else if (!isnan(__val)) {
+    } else if (!SCPIDEFINE_isnan(__val)) {
         if (SCPI_DTOSTRE_PLUS_SIGN & __flags) {
             s[0] = '+';
             s++;
@@ -984,13 +1024,14 @@
         }
     }
 
-    if (!isfinite(__val)) {
-        if (isnan(__val)) {
+    if (!SCPIDEFINE_isfinite(__val)) {
+        if (SCPIDEFINE_isnan(__val)) {
             strcpy(s, (__flags & SCPI_DTOSTRE_UPPERCASE) ? "NAN" : "nan");
         } else {
             strcpy(s, (__flags & SCPI_DTOSTRE_UPPERCASE) ? "INF" : "inf");
         }
         strncpy(__s, buffer, __ssize);
+        __s[__ssize - 1] = '\0';
         return __s;
     }
 
@@ -1044,14 +1085,16 @@
     }
 
     strncpy(__s, buffer, __ssize);
+    __s[__ssize - 1] = '\0';
     return __s;
 }
 
 /**
  * Get native CPU endiannes
- * @return 
+ * @return
  */
 scpi_array_format_t SCPI_GetNativeFormat(void) {
+
     union {
         uint32_t i;
         char c[4];
@@ -1063,37 +1106,37 @@
 /**
  * Swap 16bit number
  * @param val
- * @return 
+ * @return
  */
 uint16_t SCPI_Swap16(uint16_t val) {
-    return ((val & 0x00FF) << 8) | 
+    return ((val & 0x00FF) << 8) |
             ((val & 0xFF00) >> 8);
 }
 
 /**
  * Swap 32bit number
  * @param val
- * @return 
+ * @return
  */
 uint32_t SCPI_Swap32(uint32_t val) {
-    return ((val & 0x000000FF) << 24) |
-            ((val & 0x0000FF00) << 8) |
-            ((val & 0x00FF0000) >> 8) |
-            ((val & 0xFF000000) >> 24);
+    return ((val & 0x000000FFul) << 24) |
+            ((val & 0x0000FF00ul) << 8) |
+            ((val & 0x00FF0000ul) >> 8) |
+            ((val & 0xFF000000ul) >> 24);
 }
 
 /**
  * Swap 64bit number
  * @param val
- * @return 
+ * @return
  */
 uint64_t SCPI_Swap64(uint64_t val) {
-    return ((val & 0x00000000000000FFul) << 56) |
-            ((val & 0x000000000000FF00ul) << 40) |
-            ((val & 0x0000000000FF0000ul) << 24) |
-            ((val & 0x00000000FF000000ul) << 8) |
-            ((val & 0x000000FF00000000ul) >> 8) |
-            ((val & 0x0000FF0000000000ul) >> 24) |
-            ((val & 0x00FF000000000000ul) >> 40) |
-            ((val & 0xFF00000000000000ul) >> 56);
+    return ((val & 0x00000000000000FFull) << 56) |
+            ((val & 0x000000000000FF00ull) << 40) |
+            ((val & 0x0000000000FF0000ull) << 24) |
+            ((val & 0x00000000FF000000ull) << 8) |
+            ((val & 0x000000FF00000000ull) >> 8) |
+            ((val & 0x0000FF0000000000ull) >> 24) |
+            ((val & 0x00FF000000000000ull) >> 40) |
+            ((val & 0xFF00000000000000ull) >> 56);
 }

--
Gitblit v1.9.1