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
|
/*
*
* Copyright (c) 1994-2008 Carnegie Mellon University. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. 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.
*
* 3. The name "Carnegie Mellon University" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For permission or any legal
* details, please contact
* Carnegie Mellon University
* Center for Technology Transfer and Enterprise Creation
* 4615 Forbes Avenue
* Suite 302
* Pittsburgh, PA 15213
* (412) 268-7393, fax: (412) 268-7395
* innovation@andrew.cmu.edu
*
* 4. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by Computing Services
* at Carnegie Mellon University (http://www.cmu.edu/computing/)."
*
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/*
* Various C functions in support of the Cyrus Perl interface.
*/
#include "EXTERN.h"
#include "perl.h"
#include <imclient.h>
#define CYRPERL_INTERNAL
#include "cyrperl.h"
/* hack, since libcyrus apparently expects fatal() to exist */
void
fatal(char *s, int exit)
{
croak(s);
}
/*
* Invoke a Perl callback on behalf of a Cyrus callback. This requires some
* silliness to adapt what we're passed to Perl conventions; specifically,
* the reply struct becomes a hash (passed as a list).
*/
void imclient_xs_cb(struct imclient *client, struct xsccb *rock,
struct imclient_reply *reply)
{
dSP;
dTARG;
SV* rv;
/* push our args onto Perl's stack */
ENTER;
SAVETMPS;
PUSHMARK(SP);
XPUSHs(sv_2mortal(newSVpv("-client", 0)));
rv = newSVsv(&sv_undef);
sv_setref_pv(rv, rock->client->class, (void *) rock->client);
rock->client->cnt++;
XPUSHs(rv);
if (rock->prock != &sv_undef) {
XPUSHs(sv_2mortal(newSVpv("-rock", 0)));
XPUSHs(sv_mortalcopy(rock->prock));
}
XPUSHs(sv_2mortal(newSVpv("-keyword", 0)));
XPUSHs(sv_2mortal(newSVpv(reply->keyword, 0)));
XPUSHs(sv_2mortal(newSVpv("-text", 0)));
XPUSHs(sv_2mortal(newSVpv(reply->text, 0)));
if (reply->msgno != -1) {
XPUSHs(sv_2mortal(newSVpv("-msgno", 0)));
XPUSHi(reply->msgno);
}
PUTBACK;
/* invoke Perl */
perl_call_sv(rock->pcb, G_VOID|G_DISCARD);
FREETMPS;
LEAVE;
/* clean up */
if (rock->autofree) imclient_xs_callback_free(rock);
}
/*
* Callback used when ::_send is invoked without a callback. The "prock" is an
* AV, which is set to the contents of the imclient_reply; this is detected in
* ::_send, which is calling imclient_processoneevent() repeatedly. (This
* simulates a non-callback-based invocation, for trivial clients.)
*/
void imclient_xs_fcmdcb(struct imclient *client, struct xsccb *rock,
struct imclient_reply *reply)
{
AV *av;
SvREFCNT_dec(SvRV(rock->prock));
SvRV(rock->prock) = (SV *) av = newAV();
av_push(av, newSVpv(reply->keyword, 0));
av_push(av, newSVpv(reply->text, 0));
if (reply->msgno != -1) av_push(av, newSViv(reply->msgno));
/* clean up */
if (rock->autofree) imclient_xs_callback_free(rock);
}
/*
* Decrement the refcounts of the Perl SV's in the passed rock, then free the
* rock. This cleans up a callback.
*/
void imclient_xs_callback_free(struct xsccb *rock)
{
struct xscb *xcb;
if (rock) {
/* find the destructor-cleanup version and nuke its record */
for (xcb = rock->client->cb; xcb; xcb = xcb->next) {
if (xcb->rock == rock) break;
}
if (xcb) {
if (xcb->prev)
xcb->prev->next = xcb->next;
else
rock->client->cb = xcb->next;
if (xcb->next) xcb->next->prev = xcb->prev;
if (xcb->name) safefree(xcb->name);
safefree(xcb);
}
if (rock->pcb) SvREFCNT_dec(rock->pcb);
if (rock->prock) SvREFCNT_dec(rock->prock);
safefree(rock);
}
}
|
