#include <mit-copyright.h>
#include "query.h"
-#include "sms_server.h"
+#include "mr_server.h"
extern char *whoami, *strsave();
-extern int ingres_errno, sms_errcode;
+extern int ingres_errno, mr_errcode;
/*** NOTE **************************************************************
i->prev = &cachehead;
cachehead.next->prev = i;
cachehead.next = i;
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
}
cachemisses++;
## repeat retrieve (j = strings.string_id) where strings.#string=@iname
break;
default:
- return(SMS_INTERNAL);
+ return(MR_INTERNAL);
}
## inquire_equel(rowcount = "rowcount")
- if (ingres_errno) return(sms_errcode);
+ if (ingres_errno) return(mr_errcode);
if (rowcount == 0)
- return(SMS_NO_MATCH);
+ return(MR_NO_MATCH);
if (rowcount > 1)
- return(SMS_NOT_UNIQUE);
+ return(MR_NOT_UNIQUE);
*id = j;
if (name[0] == '#' && !strcasecmp(type, "USER"))
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
if (cachesize < CACHESIZE) {
i = (struct item *) malloc(sizeof(struct item));
cachesize++;
i->prev = &cachehead;
cachehead.next->prev = i;
cachehead.next = i;
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
##}
i->prev = &cachehead;
cachehead.next->prev = i;
cachehead.next = i;
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
}
cachemisses++;
## repeat retrieve (iname = strings.string) where strings.string_id=@j
break;
default:
- return(SMS_INTERNAL);
+ return(MR_INTERNAL);
}
## inquire_equel(rowcount = "rowcount")
- if (ingres_errno) return(sms_errcode);
+ if (ingres_errno) return(mr_errcode);
if (rowcount == 0) {
free(*name);
sprintf(iname, "#%d", j);
*name = strsave(iname);
- return(SMS_NO_MATCH);
+ return(MR_NO_MATCH);
}
if (rowcount != 1)
- return(SMS_INTERNAL);
+ return(MR_INTERNAL);
free(*name);
*name = strsave(strtrim(iname));
if (**name == '#' && !strcasecmp(type, "USER"))
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
if (cachesize < CACHESIZE) {
i = (struct item *) malloc(sizeof(struct item));
cachesize++;
i->prev = &cachehead;
cachehead.next->prev = i;
cachehead.next = i;
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
##}
for (i = cachehead.next; i != &cachehead; i = i->next)
if (i->id == id && !strcmp(i->type, type))
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
if (cachesize < CACHESIZE) {
i = (struct item *) malloc(sizeof(struct item));
cachesize++;
i->prev = &cachehead;
cachehead.next->prev = i;
cachehead.next = i;
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
}
i->next->prev = i->prev;
i->prev->next = i->next;
free(i);
- return(SMS_SUCCESS);
+ return(MR_SUCCESS);
}
}
}