-- c99f979ad34f155fbeeea69b88bdc7458d89a21c by Derek Mauro <dmauro@google.com>: Remove a floating point division by zero test. This isn't testing behavior related to the library, and MSVC warns about it in opt mode. PiperOrigin-RevId: 285220804 -- 68b015491f0dbf1ab547994673281abd1f34cd4b by Gennadiy Rozental <rogeeff@google.com>: This CL introduces following changes to the class FlagImpl: * We eliminate the CommandLineFlagLocks struct. Instead callback guard and callback function are combined into a single CallbackData struct, while primary data lock is stored separately. * CallbackData member of class FlagImpl is initially set to be nullptr and is only allocated and initialized when a flag's callback is being set. For most flags we do not pay for the extra space and extra absl::Mutex now. * Primary data guard is stored in data_guard_ data member. This is a properly aligned character buffer of necessary size. During initialization of the flag we construct absl::Mutex in this space using placement new call. * We now avoid extra value copy after successful attempt to parse value out of string. Instead we swap flag's current value with tentative value we just produced. PiperOrigin-RevId: 285132636 -- ed45d118fb818969eb13094cf7827c885dfc562c by Tom Manshreck <shreck@google.com>: Change null-term* (and nul-term*) to NUL-term* in comments PiperOrigin-RevId: 285036610 -- 729619017944db895ce8d6d29c1995aa2e5628a5 by Derek Mauro <dmauro@google.com>: Use the Posix implementation of thread identity on MinGW. Some versions of MinGW suffer from thread_local bugs. PiperOrigin-RevId: 285022920 -- 39a25493503c76885bc3254c28f66a251c5b5bb0 by Greg Falcon <gfalcon@google.com>: Implementation detail change. Add further ABSL_NAMESPACE_BEGIN and _END annotation macros to files in Abseil. PiperOrigin-RevId: 285012012 GitOrigin-RevId: c99f979ad34f155fbeeea69b88bdc7458d89a21c Change-Id: I4c85d3704e45d11a9ac50d562f39640a6adbedc1
		
			
				
	
	
		
			112 lines
		
	
	
	
		
			3.2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			112 lines
		
	
	
	
		
			3.2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| // Copyright 2017 The Abseil Authors.
 | |
| //
 | |
| // Licensed under the Apache License, Version 2.0 (the "License");
 | |
| // you may not use this file except in compliance with the License.
 | |
| // You may obtain a copy of the License at
 | |
| //
 | |
| //      https://www.apache.org/licenses/LICENSE-2.0
 | |
| //
 | |
| // Unless required by applicable law or agreed to in writing, software
 | |
| // distributed under the License is distributed on an "AS IS" BASIS,
 | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 | |
| // See the License for the specific language governing permissions and
 | |
| // limitations under the License.
 | |
| 
 | |
| #include "absl/strings/internal/memutil.h"
 | |
| 
 | |
| #include <cstdlib>
 | |
| 
 | |
| namespace absl {
 | |
| ABSL_NAMESPACE_BEGIN
 | |
| namespace strings_internal {
 | |
| 
 | |
| int memcasecmp(const char* s1, const char* s2, size_t len) {
 | |
|   const unsigned char* us1 = reinterpret_cast<const unsigned char*>(s1);
 | |
|   const unsigned char* us2 = reinterpret_cast<const unsigned char*>(s2);
 | |
| 
 | |
|   for (size_t i = 0; i < len; i++) {
 | |
|     const int diff =
 | |
|         int{static_cast<unsigned char>(absl::ascii_tolower(us1[i]))} -
 | |
|         int{static_cast<unsigned char>(absl::ascii_tolower(us2[i]))};
 | |
|     if (diff != 0) return diff;
 | |
|   }
 | |
|   return 0;
 | |
| }
 | |
| 
 | |
| char* memdup(const char* s, size_t slen) {
 | |
|   void* copy;
 | |
|   if ((copy = malloc(slen)) == nullptr) return nullptr;
 | |
|   memcpy(copy, s, slen);
 | |
|   return reinterpret_cast<char*>(copy);
 | |
| }
 | |
| 
 | |
| char* memrchr(const char* s, int c, size_t slen) {
 | |
|   for (const char* e = s + slen - 1; e >= s; e--) {
 | |
|     if (*e == c) return const_cast<char*>(e);
 | |
|   }
 | |
|   return nullptr;
 | |
| }
 | |
| 
 | |
| size_t memspn(const char* s, size_t slen, const char* accept) {
 | |
|   const char* p = s;
 | |
|   const char* spanp;
 | |
|   char c, sc;
 | |
| 
 | |
| cont:
 | |
|   c = *p++;
 | |
|   if (slen-- == 0) return p - 1 - s;
 | |
|   for (spanp = accept; (sc = *spanp++) != '\0';)
 | |
|     if (sc == c) goto cont;
 | |
|   return p - 1 - s;
 | |
| }
 | |
| 
 | |
| size_t memcspn(const char* s, size_t slen, const char* reject) {
 | |
|   const char* p = s;
 | |
|   const char* spanp;
 | |
|   char c, sc;
 | |
| 
 | |
|   while (slen-- != 0) {
 | |
|     c = *p++;
 | |
|     for (spanp = reject; (sc = *spanp++) != '\0';)
 | |
|       if (sc == c) return p - 1 - s;
 | |
|   }
 | |
|   return p - s;
 | |
| }
 | |
| 
 | |
| char* mempbrk(const char* s, size_t slen, const char* accept) {
 | |
|   const char* scanp;
 | |
|   int sc;
 | |
| 
 | |
|   for (; slen; ++s, --slen) {
 | |
|     for (scanp = accept; (sc = *scanp++) != '\0';)
 | |
|       if (sc == *s) return const_cast<char*>(s);
 | |
|   }
 | |
|   return nullptr;
 | |
| }
 | |
| 
 | |
| // This is significantly faster for case-sensitive matches with very
 | |
| // few possible matches.  See unit test for benchmarks.
 | |
| const char* memmatch(const char* phaystack, size_t haylen, const char* pneedle,
 | |
|                      size_t neelen) {
 | |
|   if (0 == neelen) {
 | |
|     return phaystack;  // even if haylen is 0
 | |
|   }
 | |
|   if (haylen < neelen) return nullptr;
 | |
| 
 | |
|   const char* match;
 | |
|   const char* hayend = phaystack + haylen - neelen + 1;
 | |
|   // A static cast is used here to work around the fact that memchr returns
 | |
|   // a void* on Posix-compliant systems and const void* on Windows.
 | |
|   while ((match = static_cast<const char*>(
 | |
|               memchr(phaystack, pneedle[0], hayend - phaystack)))) {
 | |
|     if (memcmp(match, pneedle, neelen) == 0)
 | |
|       return match;
 | |
|     else
 | |
|       phaystack = match + 1;
 | |
|   }
 | |
|   return nullptr;
 | |
| }
 | |
| 
 | |
| }  // namespace strings_internal
 | |
| ABSL_NAMESPACE_END
 | |
| }  // namespace absl
 |