|
|
@@ -0,0 +1,130 @@
|
|
|
+/*
|
|
|
+ * $Id$
|
|
|
+ *
|
|
|
+ * Copyright (C) 2005-2006 iptelorg GmbH
|
|
|
+ *
|
|
|
+ * This file is part of ser, a free SIP server.
|
|
|
+ *
|
|
|
+ * ser 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 2 of the License, or
|
|
|
+ * (at your option) any later version
|
|
|
+ *
|
|
|
+ * For a license to use the ser software under conditions
|
|
|
+ * other than those described here, or to purchase support for this
|
|
|
+ * software, please contact iptel.org by e-mail at the following addresses:
|
|
|
+ * [email protected]
|
|
|
+ *
|
|
|
+ * ser 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
|
|
|
+ *
|
|
|
+ * History:
|
|
|
+ * --------
|
|
|
+ * 2006-06-16 static buffer for select results (mma)
|
|
|
+ * each process owns a separate space
|
|
|
+ * each request starts using the buffer from the start
|
|
|
+ *
|
|
|
+ */
|
|
|
+
|
|
|
+#include <stdio.h>
|
|
|
+#include <stdlib.h>
|
|
|
+#include <string.h>
|
|
|
+#include <unistd.h>
|
|
|
+#include <ctype.h>
|
|
|
+
|
|
|
+#include "dprint.h"
|
|
|
+#include "mem/mem.h"
|
|
|
+
|
|
|
+/*
|
|
|
+ * Placeholder for the buffer
|
|
|
+ *
|
|
|
+ * two buffers are actually used to cover the different size requests
|
|
|
+ * assuming that resize can move the result to newly allocated space
|
|
|
+ * and comparing two selects from the script could require two static buffers
|
|
|
+ *
|
|
|
+ * if more static buffers need to be valid at the same time change
|
|
|
+ * the following constant
|
|
|
+ */
|
|
|
+
|
|
|
+#define MAX_BUFFERS 2
|
|
|
+#define BUFFER_GRANULARITY 256
|
|
|
+
|
|
|
+typedef struct stat_buffer_ {
|
|
|
+ char *b;
|
|
|
+ int size;
|
|
|
+ int offset;
|
|
|
+} stat_buffer_t;
|
|
|
+
|
|
|
+static stat_buffer_t buffer[MAX_BUFFERS];
|
|
|
+static int active_buffer=-1;
|
|
|
+
|
|
|
+#define ALLOC_SIZE(req_size) (((req_size/BUFFER_GRANULARITY)+1)*BUFFER_GRANULARITY)
|
|
|
+
|
|
|
+int allocate_buffer(int req_size) {
|
|
|
+ int size=ALLOC_SIZE(req_size);
|
|
|
+
|
|
|
+ if (buffer[active_buffer].b == NULL) {
|
|
|
+ if ((buffer[active_buffer].b=pkg_malloc(size))==NULL)
|
|
|
+ return 0;
|
|
|
+ buffer[active_buffer].size=size;
|
|
|
+ buffer[active_buffer].offset=0;
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ active_buffer = (active_buffer?active_buffer:MAX_BUFFERS)-1;
|
|
|
+ if (buffer[active_buffer].size >= req_size) {
|
|
|
+ buffer[active_buffer].offset = 0;
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ if (pkg_realloc(buffer[active_buffer].b,size)) {
|
|
|
+ buffer[active_buffer].size=size;
|
|
|
+ buffer[active_buffer].offset=0;
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+/*
|
|
|
+ * Request for space from buffer
|
|
|
+ *
|
|
|
+ * Returns: NULL memory allocation failure (no more space)
|
|
|
+ * pointer to the space on success
|
|
|
+ */
|
|
|
+
|
|
|
+char* get_static_buffer(int req_size) {
|
|
|
+ char *p = NULL;
|
|
|
+ if ((buffer[active_buffer].size >= buffer[active_buffer].offset + req_size)
|
|
|
+ || (allocate_buffer(req_size))) {
|
|
|
+ /* enough space in current buffer or allocation successful */
|
|
|
+ p = buffer[active_buffer].b+buffer[active_buffer].offset;
|
|
|
+ buffer[active_buffer].offset += req_size;
|
|
|
+ return p;
|
|
|
+ }
|
|
|
+ return NULL;
|
|
|
+}
|
|
|
+
|
|
|
+/* Internal function - called before request is going to be processed
|
|
|
+ *
|
|
|
+ * Reset offset to unused space
|
|
|
+ */
|
|
|
+
|
|
|
+int reset_static_buffer() {
|
|
|
+ int i;
|
|
|
+
|
|
|
+ if (active_buffer == -1) {
|
|
|
+ memset(buffer, 0, sizeof(buffer));
|
|
|
+ } else {
|
|
|
+ for (i=0; i<MAX_BUFFERS; i++)
|
|
|
+ buffer[i].offset=0;
|
|
|
+ }
|
|
|
+ active_buffer=0;
|
|
|
+ return 0;
|
|
|
+}
|
Michal Matyska