OpenSTA/network/ParseBus.cc

202 lines
5.0 KiB
C++
Raw Normal View History

2018-09-28 17:54:21 +02:00
// OpenSTA, Static Timing Analyzer
// Copyright (c) 2023, Parallax Software, Inc.
2018-09-28 17:54:21 +02:00
//
// 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, either version 3 of the License, or
// (at your option) any later version.
//
// 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
2018-09-28 17:54:21 +02:00
// 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, see <https://www.gnu.org/licenses/>.
2018-09-28 17:54:21 +02:00
2020-04-05 23:53:44 +02:00
#include "ParseBus.hh"
2020-04-05 20:35:51 +02:00
2018-09-28 17:54:21 +02:00
#include <string.h>
#include <stdlib.h>
#include <string>
2020-04-05 20:35:51 +02:00
2020-04-05 23:53:44 +02:00
#include "StringUtil.hh"
2018-09-28 17:54:21 +02:00
namespace sta {
using std::string;
bool
isBusName(const char *name,
const char brkt_left,
2019-08-14 06:34:35 +02:00
const char brkt_right,
char escape)
2018-09-28 17:54:21 +02:00
{
2019-08-14 06:34:35 +02:00
size_t len = strlen(name);
// Shortest bus name is a[0].
if (len >= 4
// Escaped bus brackets are not buses.
&& name[len - 2] != escape
&& name[len - 1] == brkt_right) {
2018-09-28 17:54:21 +02:00
const char *left = strrchr(name, brkt_left);
2019-03-13 01:25:53 +01:00
return left != nullptr;
2018-09-28 17:54:21 +02:00
}
else
return false;
}
void
parseBusName(const char *name,
const char brkt_left,
const char brkt_right,
const char escape,
// Return values.
2018-09-28 17:54:21 +02:00
char *&bus_name,
int &index)
{
const char brkts_left[2] = {brkt_left, '\0'};
const char brkts_right[2] = {brkt_right, '\0'};
2019-08-14 06:34:35 +02:00
parseBusName(name, brkts_left, brkts_right, escape, bus_name, index);
2018-09-28 17:54:21 +02:00
}
void
parseBusName(const char *name,
const char *brkts_left,
const char *brkts_right,
2019-08-14 06:34:35 +02:00
char escape,
// Return values.
2018-09-28 17:54:21 +02:00
char *&bus_name,
int &index)
{
2019-03-13 01:25:53 +01:00
bus_name = nullptr;
2019-08-14 06:34:35 +02:00
size_t len = strlen(name);
// Shortest bus name is a[0].
if (len >= 4
// Escaped bus brackets are not buses.
&& name[len - 2] != escape) {
char last_ch = name[len - 1];
const char *brkt_right_ptr = strchr(brkts_right, last_ch);
if (brkt_right_ptr) {
size_t brkt_index = brkt_right_ptr - brkts_right;
char brkt_left = brkts_left[brkt_index];
const char *left = strrchr(name, brkt_left);
if (left) {
size_t bus_name_len = left - name;
bus_name = new char[bus_name_len + 1];
strncpy(bus_name, name, bus_name_len);
bus_name[bus_name_len] = '\0';
// Simple bus subscript.
index = atoi(left + 1);
}
2018-09-28 17:54:21 +02:00
}
}
}
void
parseBusRange(const char *name,
const char brkt_left,
const char brkt_right,
2019-08-14 06:34:35 +02:00
char escape,
// Return values.
2018-09-28 17:54:21 +02:00
char *&bus_name,
int &from,
int &to)
{
const char brkts_left[2] = {brkt_left, '\0'};
const char brkts_right[2] = {brkt_right, '\0'};
2019-08-14 06:34:35 +02:00
parseBusRange(name, brkts_left, brkts_right, escape, bus_name, from, to);
2018-09-28 17:54:21 +02:00
}
void
parseBusRange(const char *name,
const char *brkts_left,
const char *brkts_right,
2019-08-14 06:34:35 +02:00
char escape,
// Return values.
2018-09-28 17:54:21 +02:00
char *&bus_name,
int &from,
int &to)
{
2019-03-13 01:25:53 +01:00
bus_name = nullptr;
2019-08-14 06:34:35 +02:00
size_t len = strlen(name);
// Shortest bus range is a[1:0].
if (len >= 6
// Escaped bus brackets are not buses.
&& name[len - 2] != escape) {
char last_ch = name[len - 1];
const char *brkt_right_ptr = strchr(brkts_right, last_ch);
if (brkt_right_ptr) {
size_t brkt_index = brkt_right_ptr - brkts_right;
char brkt_left = brkts_left[brkt_index];
const char *left = strrchr(name, brkt_left);
if (left) {
// Check for bus range.
const char range_sep = ':';
const char *range = strchr(name, range_sep);
if (range) {
size_t bus_name_len = left - name;
bus_name = new char[bus_name_len + 1];
strncpy(bus_name, name, bus_name_len);
bus_name[bus_name_len] = '\0';
// No need to terminate bus subscript because atoi stops
// scanning at first non-digit character.
from = atoi(left + 1);
to = atoi(range + 1);
}
2018-09-28 17:54:21 +02:00
}
}
}
}
const char *
escapeChars(const char *token,
const char ch1,
const char ch2,
const char escape)
2018-09-28 17:54:21 +02:00
{
int result_length = 0;
bool need_escapes = false;
for (const char *s = token; *s; s++) {
char ch = *s;
if (ch == escape) {
char next_ch = s[1];
// Make sure we don't skip the null if escape is the last char.
if (next_ch != '\0')
result_length++;
}
else if (ch == ch1 || ch == ch2) {
result_length++;
need_escapes = true;
}
result_length++;
}
if (need_escapes) {
char *result = makeTmpString(result_length + 1);
char *r = result;
for (const char *s = token; *s; s++) {
char ch = *s;
if (ch == escape) {
char next_ch = s[1];
// Make sure we don't skip the null if escape is the last char.
if (next_ch != '\0') {
*r++ = ch;
*r++ = next_ch;
s++;
}
}
else if (ch == ch1 || ch == ch2) {
*r++ = escape;
*r++ = ch;
}
else
*r++ = ch;
}
*r++ = '\0';
return result;
}
else
return token;
}
} // namespace