This file is indexed.

/usr/include/ibdm/Regexp.h is in libibdm-dev 1.5.7-1ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/*
 * Copyright (c) 2004-2010 Mellanox Technologies LTD. All rights reserved.
 *
 * This software is available to you under a choice of one of two
 * licenses.  You may choose to be licensed under the terms of the GNU
 * General Public License (GPL) Version 2, available from the file
 * COPYING in the main directory of this source tree, or the
 * OpenIB.org BSD license below:
 *
 *     Redistribution and use in source and binary forms, with or
 *     without modification, are permitted provided that the following
 *     conditions are met:
 *
 *      - 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.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 *
 */

#ifndef IBDM_REXIFC_H
#define IBDM_REXIFC_H

// this file holds simplified object oriented interface for
// reguar expressions
#include <string.h>
#include <sys/types.h>
#include <regex.h>
#include <stdio.h>
#include <iostream>
#include <string>

using namespace std;

class rexMatch {
  const char *str;
  int  nMatches;
  regmatch_t *matches;

 public:
  // no default constructor
  rexMatch();

  // construct:
  rexMatch(const char *s, int numMatches) {
	 str = s;
	 nMatches = numMatches;
	 matches = new regmatch_t[nMatches + 1];
  };

  // destrutor:
  ~rexMatch() {
	 delete [] matches;
  };

  // usefull:
  int field(int num, char *buf) {
	 // check for non match:
	 if (num > nMatches || matches[num].rm_so < 0) {
		buf[0] = '\0';
		return 0;
	 }
	 strncpy(buf, str + matches[num].rm_so, matches[num].rm_eo - matches[num].rm_so + 1);
	 buf[matches[num].rm_eo - matches[num].rm_so] = '\0';
	 return 0;
  };

  // string returning the field
  int field(int num, string &res) {
	 string tmp = string(str);
	 // check for non match:
	 if (num > nMatches || matches[num].rm_so < 0) {
		res = "";
		return 0;
	 }
	 res = tmp.substr(matches[num].rm_so, matches[num].rm_eo - matches[num].rm_so);
	 return 0;
  };

  string field(int num) {
	 string tmp = string(str);
	 // check for non match:
	 if (num > nMatches || matches[num].rm_so < 0) {
		return string("");
	 }
	 return tmp.substr(matches[num].rm_so, matches[num].rm_eo - matches[num].rm_so);
  };

  inline int numFields() {return nMatches;};

  friend class regExp;
};

// this will basically hold the compiled regular expression
class regExp {
  regex_t re;
  char *expr;
  int status;
 public:
  // prevent default constructor
  regExp();

  // construct
  regExp(const char *pattern, int flags = REG_EXTENDED) {
	 expr = new char[strlen(pattern) + 1];
	 strcpy(expr, pattern);
	 status = regcomp(&re, expr, flags);
	 if (status) {
		cout << "-E- Fail to compile regular expression:%s\n" << pattern << endl;
	 }
  }

  // destructor
  ~regExp() {
	 regfree(&re);
	 delete [] expr;
  }

  // access:
  inline const char *getExpr() const {return expr;};
  inline int valid() const {return (status == 0);};

  // usefullnss:
  class rexMatch * apply(const char *str, int flags = 0) {
	 class rexMatch *res = new rexMatch(str, re.re_nsub);
	 if (regexec(&re, str, re.re_nsub + 1, res->matches, flags)) {
		delete res;
		return 0;
	 }
	 return res;
  }

  friend class rexMatch;
};

// holds specifc compares

#endif /* IBDM_REXIFC_H */