Files
weave-scope/client/app/scripts/utils/search-utils.js
David Kaltschmidt d5eea2549d Sanitize inputs
Try regexp, escape if invalid
2016-05-11 18:08:59 +02:00

238 lines
6.4 KiB
JavaScript

import { Map as makeMap } from 'immutable';
import _ from 'lodash';
import { slugify } from './string-utils';
// topolevel search fields
const SEARCH_FIELDS = makeMap({
label: 'label',
sublabel: 'label_minor'
});
const COMPARISONS = makeMap({
'<': 'lt',
'>': 'gt',
'=': 'eq'
});
const COMPARISONS_REGEX = new RegExp(`[${COMPARISONS.keySeq().toJS().join('')}]`);
const PREFIX_DELIMITER = ':';
function makeRegExp(expression, options = 'i') {
try {
return new RegExp(expression, options);
} catch (e) {
return new RegExp(_.escapeRegExp(expression), options);
}
}
function parseValue(value) {
let parsed = parseFloat(value);
if (_.endsWith(value, 'KB')) {
parsed *= 1024;
} else if (_.endsWith(value, 'MB')) {
parsed *= 1024 * 1024;
} else if (_.endsWith(value, 'GB')) {
parsed *= 1024 * 1024 * 1024;
} else if (_.endsWith(value, 'TB')) {
parsed *= 1024 * 1024 * 1024 * 1024;
}
return parsed;
}
function matchPrefix(label, prefix) {
if (label && prefix) {
return (makeRegExp(prefix)).test(slugify(label));
}
return false;
}
function findNodeMatch(nodeMatches, keyPath, text, query, prefix, label) {
if (!prefix || matchPrefix(label, prefix)) {
const queryRe = makeRegExp(query);
const matches = text.match(queryRe);
if (matches) {
const firstMatch = matches[0];
const index = text.search(queryRe);
nodeMatches = nodeMatches.setIn(keyPath,
{text, label, matches: [{start: index, length: firstMatch.length}]});
}
}
return nodeMatches;
}
/**
* If the metric matches the field's label and the value compares positively
* with the comp operator, a nodeMatch is added
*/
function findNodeMatchMetric(nodeMatches, keyPath, fieldValue, fieldLabel, metric, comp, value) {
if (slugify(metric) === slugify(fieldLabel)) {
let matched = false;
switch (comp) {
case 'gt': {
if (fieldValue > value) {
matched = true;
}
break;
}
case 'lt': {
if (fieldValue < value) {
matched = true;
}
break;
}
case 'eq': {
if (fieldValue === value) {
matched = true;
}
break;
}
default: {
break;
}
}
if (matched) {
nodeMatches = nodeMatches.setIn(keyPath,
{fieldLabel, metric: true});
}
}
return nodeMatches;
}
export function searchTopology(nodes, { prefix, query, metric, comp, value }) {
let nodeMatches = makeMap();
nodes.forEach((node, nodeId) => {
if (query) {
// top level fields
SEARCH_FIELDS.forEach((field, label) => {
const keyPath = [nodeId, label];
nodeMatches = findNodeMatch(nodeMatches, keyPath, node.get(field),
query, prefix, label);
});
// metadata
if (node.get('metadata')) {
node.get('metadata').forEach(field => {
const keyPath = [nodeId, 'metadata', field.get('id')];
nodeMatches = findNodeMatch(nodeMatches, keyPath, field.get('value'),
query, prefix, field.get('label'));
});
}
// tables (envvars and labels)
const tables = node.get('tables');
if (tables) {
tables.forEach((table) => {
if (table.get('rows')) {
table.get('rows').forEach(field => {
const keyPath = [nodeId, 'metadata', field.get('id')];
nodeMatches = findNodeMatch(nodeMatches, keyPath, field.get('value'),
query, prefix, field.get('label'));
});
}
});
}
} else if (metric) {
const metrics = node.get('metrics');
if (metrics) {
metrics.forEach(field => {
const keyPath = [nodeId, 'metrics', field.get('id')];
nodeMatches = findNodeMatchMetric(nodeMatches, keyPath, field.get('value'),
field.get('label'), metric, comp, value);
});
}
}
});
return nodeMatches;
}
export function parseQuery(query) {
if (query) {
const prefixQuery = query.split(PREFIX_DELIMITER);
const isPrefixQuery = prefixQuery && prefixQuery.length === 2;
if (isPrefixQuery) {
const prefix = prefixQuery[0].trim();
query = prefixQuery[1].trim();
if (prefix && query) {
return {
query,
prefix
};
}
} else if (COMPARISONS_REGEX.test(query)) {
// check for comparisons
let comparison;
COMPARISONS.forEach((comp, delim) => {
const comparisonQuery = query.split(delim);
if (comparisonQuery && comparisonQuery.length === 2) {
const value = parseValue(comparisonQuery[1]);
const metric = comparisonQuery[0].trim();
if (!isNaN(value) && metric) {
comparison = {
metric,
value,
comp
};
return false; // dont look further
}
}
return true;
});
if (comparison) {
return comparison;
}
} else {
return { query };
}
}
return null;
}
/**
* Returns {topologyId: {nodeId: matches}}
*/
export function updateNodeMatches(state) {
const parsed = parseQuery(state.get('searchQuery'));
if (parsed) {
state.get('topologyUrlsById').forEach((url, topologyId) => {
const topologyNodes = state.getIn(['nodesByTopology', topologyId]);
if (topologyNodes) {
const nodeMatches = searchTopology(topologyNodes, parsed);
state = state.setIn(['searchNodeMatches', topologyId], nodeMatches);
}
});
} else {
state = state.update('searchNodeMatches', snm => snm.clear());
}
return state;
}
/**
* Set `filtered:true` in state's nodes if a pinned search matches
*/
export function applyPinnedSearches(state) {
// clear old filter state
state = state.update('nodes',
nodes => nodes.map(node => node.set('filtered', false)));
const pinnedSearches = state.get('pinnedSearches');
if (pinnedSearches.size > 0) {
state.get('pinnedSearches').forEach(query => {
const parsed = parseQuery(query);
if (parsed) {
const nodeMatches = searchTopology(state.get('nodes'), parsed);
const filteredNodes = state.get('nodes')
.map(node => node.set('filtered',
node.get('filtered') // matched by previous pinned search
|| nodeMatches.size === 0 // no match, filter all nodes
|| !nodeMatches.has(node.get('id')))); // filter matches
state = state.set('nodes', filteredNodes);
}
});
}
return state;
}