summaryrefslogtreecommitdiff
path: root/strings/r_strinstr.c
diff options
context:
space:
mode:
authorDavi Arnaut <davi.arnaut@oracle.com>2010-07-23 17:17:14 -0300
committerDavi Arnaut <davi.arnaut@oracle.com>2010-07-23 17:17:14 -0300
commit507ca08ff6a731c811a82869f85ba5166e8a9df1 (patch)
treed634717d00e7631767edfde544c80bee53197f21 /strings/r_strinstr.c
parent75e22123972f3404cd384839695c9e7b0165565f (diff)
downloadmariadb-git-507ca08ff6a731c811a82869f85ba5166e8a9df1.tar.gz
WL#5498: Remove dead and unused source code
Remove unused string functions. include/m_string.h: Remove prototypes for unused string functions and for functions that do not exist anymore.
Diffstat (limited to 'strings/r_strinstr.c')
-rw-r--r--strings/r_strinstr.c50
1 files changed, 0 insertions, 50 deletions
diff --git a/strings/r_strinstr.c b/strings/r_strinstr.c
deleted file mode 100644
index fb1e0c5a090..00000000000
--- a/strings/r_strinstr.c
+++ /dev/null
@@ -1,50 +0,0 @@
-/* Copyright (C) 2000 MySQL AB
-
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; version 2 of the License.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
-
-/*
- Author : David
- strintstr(src, from, pat) looks for an instance of pat in src
- backwards from pos from. pat is not a regex(3) pattern, it is a literal
- string which must be matched exactly.
- The result 0 if the pattern was not found else it is the start char of
- the pattern counted from the begining of the string.
-*/
-
-#include <my_global.h>
-#include "m_string.h"
-
-size_t r_strinstr(reg1 const char * str, size_t from, reg4 const char * search)
-{
- reg2 const char *i, *j;
- size_t len = strlen(search);
- /* pointer to the last char of buff */
- const char * start = str + from - 1;
- /* pointer to the last char of search */
- const char * search_end = search + len - 1;
-
- skip:
- while (start >= str) /* Cant be != because the first char */
- {
- if (*start-- == *search_end)
- {
- i = start; j = search_end - 1;
- while (j >= search && start > str)
- if (*i-- != *j--)
- goto skip;
- return (size_t) ((start - len) - str + 3);
- }
- }
- return (0);
-}