head 1.1; access; symbols netbsd-11-0-RC7:1.1 netbsd-11-0-RC6:1.1 netbsd-11-0-RC5:1.1 netbsd-11-0-RC4:1.1 netbsd-11-0-RC3:1.1 netbsd-11-0-RC2:1.1 netbsd-11-0-RC1:1.1 perseant-exfatfs-base-20250801:1.1 netbsd-11:1.1.0.50 netbsd-11-base:1.1 netbsd-10-1-RELEASE:1.1 perseant-exfatfs-base-20240630:1.1 perseant-exfatfs:1.1.0.48 perseant-exfatfs-base:1.1 netbsd-8-3-RELEASE:1.1 netbsd-9-4-RELEASE:1.1 netbsd-10-0-RELEASE:1.1 netbsd-10-0-RC6:1.1 netbsd-10-0-RC5:1.1 netbsd-10-0-RC4:1.1 netbsd-10-0-RC3:1.1 netbsd-10-0-RC2:1.1 netbsd-10-0-RC1:1.1 netbsd-10:1.1.0.46 netbsd-10-base:1.1 netbsd-9-3-RELEASE:1.1 cjep_sun2x-base1:1.1 cjep_sun2x:1.1.0.44 cjep_sun2x-base:1.1 cjep_staticlib_x-base1:1.1 netbsd-9-2-RELEASE:1.1 cjep_staticlib_x:1.1.0.42 cjep_staticlib_x-base:1.1 netbsd-9-1-RELEASE:1.1 phil-wifi-20200421:1.1 phil-wifi-20200411:1.1 is-mlppp:1.1.0.40 is-mlppp-base:1.1 phil-wifi-20200406:1.1 netbsd-8-2-RELEASE:1.1 netbsd-9-0-RELEASE:1.1 netbsd-9-0-RC2:1.1 netbsd-9-0-RC1:1.1 phil-wifi-20191119:1.1 netbsd-9:1.1.0.38 netbsd-9-base:1.1 phil-wifi-20190609:1.1 netbsd-8-1-RELEASE:1.1 netbsd-8-1-RC1:1.1 pgoyette-compat-merge-20190127:1.1 pgoyette-compat-20190127:1.1 pgoyette-compat-20190118:1.1 pgoyette-compat-1226:1.1 pgoyette-compat-1126:1.1 pgoyette-compat-1020:1.1 pgoyette-compat-0930:1.1 pgoyette-compat-0906:1.1 netbsd-7-2-RELEASE:1.1 pgoyette-compat-0728:1.1 netbsd-8-0-RELEASE:1.1 phil-wifi:1.1.0.36 phil-wifi-base:1.1 pgoyette-compat-0625:1.1 netbsd-8-0-RC2:1.1 pgoyette-compat-0521:1.1 pgoyette-compat-0502:1.1 pgoyette-compat-0422:1.1 netbsd-8-0-RC1:1.1 pgoyette-compat-0415:1.1 pgoyette-compat-0407:1.1 pgoyette-compat-0330:1.1 pgoyette-compat-0322:1.1 pgoyette-compat-0315:1.1 netbsd-7-1-2-RELEASE:1.1 pgoyette-compat:1.1.0.34 pgoyette-compat-base:1.1 netbsd-7-1-1-RELEASE:1.1 matt-nb8-mediatek:1.1.0.32 matt-nb8-mediatek-base:1.1 perseant-stdc-iso10646:1.1.0.30 perseant-stdc-iso10646-base:1.1 netbsd-8:1.1.0.28 netbsd-8-base:1.1 prg-localcount2-base3:1.1 prg-localcount2-base2:1.1 prg-localcount2-base1:1.1 prg-localcount2:1.1.0.26 prg-localcount2-base:1.1 pgoyette-localcount-20170426:1.1 bouyer-socketcan-base1:1.1 pgoyette-localcount-20170320:1.1 netbsd-7-1:1.1.0.24 netbsd-7-1-RELEASE:1.1 netbsd-7-1-RC2:1.1 netbsd-7-nhusb-base-20170116:1.1 bouyer-socketcan:1.1.0.22 bouyer-socketcan-base:1.1 pgoyette-localcount-20170107:1.1 netbsd-7-1-RC1:1.1 pgoyette-localcount-20161104:1.1 netbsd-7-0-2-RELEASE:1.1 localcount-20160914:1.1 netbsd-7-nhusb:1.1.0.20 netbsd-7-nhusb-base:1.1 pgoyette-localcount-20160806:1.1 pgoyette-localcount-20160726:1.1 pgoyette-localcount:1.1.0.18 pgoyette-localcount-base:1.1 netbsd-7-0-1-RELEASE:1.1 netbsd-7-0:1.1.0.16 netbsd-7-0-RELEASE:1.1 netbsd-7-0-RC3:1.1 netbsd-7-0-RC2:1.1 netbsd-7-0-RC1:1.1 netbsd-7:1.1.0.14 netbsd-7-base:1.1 yamt-pagecache-base9:1.1 yamt-pagecache-tag8:1.1.4.2 tls-earlyentropy:1.1.0.12 tls-earlyentropy-base:1.1 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1 riastradh-drm2-base3:1.1 riastradh-drm2-base2:1.1 riastradh-drm2-base1:1.1 riastradh-drm2:1.1.0.6 riastradh-drm2-base:1.1 khorben-n900:1.1.0.10 agc-symver:1.1.0.8 agc-symver-base:1.1 yamt-pagecache-base8:1.1 yamt-pagecache:1.1.0.4 yamt-pagecache-base7:1.1 tls-maxphys-base:1.1 tls-maxphys:1.1.0.2; locks; strict; comment @// @; 1.1 date 2012.11.15.19.49.13; author jkunz; state Exp; branches 1.1.2.1 1.1.4.1; next ; 1.1.2.1 date 2012.11.15.19.49.13; author jkunz; state dead; branches; next 1.1.2.2; 1.1.2.2 date 2012.11.15.19.49.14; author jkunz; state Exp; branches; next ; 1.1.4.1 date 2012.11.15.19.49.13; author yamt; state dead; branches; next 1.1.4.2; 1.1.4.2 date 2013.01.16.05.27.45; author yamt; state Exp; branches; next ; desc @@ 1.1 log @Add elftosb tools to evbarm userland and toolchain. Elftosb is used to create a digitaly signed "secure boot" file. This sb file can be booted by the first stage boot loader found in Freescale i.MX23 and i.MX28 application processors. Copyright (c) 2004-2010 Freescale Semiconductor, Inc. @ text @/* * File: GlobMatcher.cpp * * Copyright (c) Freescale Semiconductor, Inc. All rights reserved. * See included license file for license details. */ #include "GlobMatcher.h" #ifndef NEGATE #define NEGATE '^' // std cset negation char #endif using namespace elftosb; //! The glob pattern must match the \e entire test value argument in order //! for the match to be considered successful. Thus, even if, for example, //! the pattern matches all but the last character the result will be false. //! //! \retval true The test value does match the glob pattern. //! \retval false The test value does not match the glob pattern. bool GlobMatcher::match(const std::string & testValue) { return globMatch(testValue.c_str(), m_pattern.c_str()); } //! \note This glob implementation was originally written by ozan s. yigit in //! December 1994. This is public domain source code. bool GlobMatcher::globMatch(const char *str, const char *p) { int negate; int match; int c; while (*p) { if (!*str && *p != '*') return false; switch (c = *p++) { case '*': while (*p == '*') p++; if (!*p) return true; if (*p != '?' && *p != '[' && *p != '\\') while (*str && *p != *str) str++; while (*str) { if (globMatch(str, p)) return true; str++; } return false; case '?': if (*str) break; return false; // set specification is inclusive, that is [a-z] is a, z and // everything in between. this means [z-a] may be interpreted // as a set that contains z, a and nothing in between. case '[': if (*p != NEGATE) negate = false; else { negate = true; p++; } match = false; while (!match && (c = *p++)) { if (!*p) return false; if (*p == '-') { // c-c if (!*++p) return false; if (*p != ']') { if (*str == c || *str == *p || (*str > c && *str < *p)) match = true; } else { // c-] if (*str >= c) match = true; break; } } else { // cc or c] if (c == *str) match = true; if (*p != ']') { if (*p == *str) match = true; } else break; } } if (negate == match) return false; // if there is a match, skip past the cset and continue on while (*p && *p != ']') p++; if (!*p++) // oops! return false; break; case '\\': if (*p) c = *p++; default: if (c != *str) return false; break; } str++; } return !*str; } @ 1.1.4.1 log @file GlobMatcher.cpp was added on branch yamt-pagecache on 2013-01-16 05:27:45 +0000 @ text @d1 129 @ 1.1.4.2 log @sync with (a bit old) head @ text @a0 129 /* * File: GlobMatcher.cpp * * Copyright (c) Freescale Semiconductor, Inc. All rights reserved. * See included license file for license details. */ #include "GlobMatcher.h" #ifndef NEGATE #define NEGATE '^' // std cset negation char #endif using namespace elftosb; //! The glob pattern must match the \e entire test value argument in order //! for the match to be considered successful. Thus, even if, for example, //! the pattern matches all but the last character the result will be false. //! //! \retval true The test value does match the glob pattern. //! \retval false The test value does not match the glob pattern. bool GlobMatcher::match(const std::string & testValue) { return globMatch(testValue.c_str(), m_pattern.c_str()); } //! \note This glob implementation was originally written by ozan s. yigit in //! December 1994. This is public domain source code. bool GlobMatcher::globMatch(const char *str, const char *p) { int negate; int match; int c; while (*p) { if (!*str && *p != '*') return false; switch (c = *p++) { case '*': while (*p == '*') p++; if (!*p) return true; if (*p != '?' && *p != '[' && *p != '\\') while (*str && *p != *str) str++; while (*str) { if (globMatch(str, p)) return true; str++; } return false; case '?': if (*str) break; return false; // set specification is inclusive, that is [a-z] is a, z and // everything in between. this means [z-a] may be interpreted // as a set that contains z, a and nothing in between. case '[': if (*p != NEGATE) negate = false; else { negate = true; p++; } match = false; while (!match && (c = *p++)) { if (!*p) return false; if (*p == '-') { // c-c if (!*++p) return false; if (*p != ']') { if (*str == c || *str == *p || (*str > c && *str < *p)) match = true; } else { // c-] if (*str >= c) match = true; break; } } else { // cc or c] if (c == *str) match = true; if (*p != ']') { if (*p == *str) match = true; } else break; } } if (negate == match) return false; // if there is a match, skip past the cset and continue on while (*p && *p != ']') p++; if (!*p++) // oops! return false; break; case '\\': if (*p) c = *p++; default: if (c != *str) return false; break; } str++; } return !*str; } @ 1.1.2.1 log @file GlobMatcher.cpp was added on branch tls-maxphys on 2012-11-15 19:49:14 +0000 @ text @d1 129 @ 1.1.2.2 log @Add elftosb tools to evbarm userland and toolchain. Elftosb is used to create a digitaly signed "secure boot" file. This sb file can be booted by the first stage boot loader found in Freescale i.MX23 and i.MX28 application processors. Copyright (c) 2004-2010 Freescale Semiconductor, Inc. @ text @a0 129 /* * File: GlobMatcher.cpp * * Copyright (c) Freescale Semiconductor, Inc. All rights reserved. * See included license file for license details. */ #include "GlobMatcher.h" #ifndef NEGATE #define NEGATE '^' // std cset negation char #endif using namespace elftosb; //! The glob pattern must match the \e entire test value argument in order //! for the match to be considered successful. Thus, even if, for example, //! the pattern matches all but the last character the result will be false. //! //! \retval true The test value does match the glob pattern. //! \retval false The test value does not match the glob pattern. bool GlobMatcher::match(const std::string & testValue) { return globMatch(testValue.c_str(), m_pattern.c_str()); } //! \note This glob implementation was originally written by ozan s. yigit in //! December 1994. This is public domain source code. bool GlobMatcher::globMatch(const char *str, const char *p) { int negate; int match; int c; while (*p) { if (!*str && *p != '*') return false; switch (c = *p++) { case '*': while (*p == '*') p++; if (!*p) return true; if (*p != '?' && *p != '[' && *p != '\\') while (*str && *p != *str) str++; while (*str) { if (globMatch(str, p)) return true; str++; } return false; case '?': if (*str) break; return false; // set specification is inclusive, that is [a-z] is a, z and // everything in between. this means [z-a] may be interpreted // as a set that contains z, a and nothing in between. case '[': if (*p != NEGATE) negate = false; else { negate = true; p++; } match = false; while (!match && (c = *p++)) { if (!*p) return false; if (*p == '-') { // c-c if (!*++p) return false; if (*p != ']') { if (*str == c || *str == *p || (*str > c && *str < *p)) match = true; } else { // c-] if (*str >= c) match = true; break; } } else { // cc or c] if (c == *str) match = true; if (*p != ']') { if (*p == *str) match = true; } else break; } } if (negate == match) return false; // if there is a match, skip past the cset and continue on while (*p && *p != ']') p++; if (!*p++) // oops! return false; break; case '\\': if (*p) c = *p++; default: if (c != *str) return false; break; } str++; } return !*str; } @