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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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 2
* 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
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
/* String and parser handling */
#include "sci/resource.h"
#include "sci/engine/features.h"
#include "sci/engine/state.h"
#include "sci/engine/message.h"
#include "sci/engine/selector.h"
#include "sci/engine/kernel.h"
namespace Sci {
reg_t kStrEnd(EngineState *s, int argc, reg_t *argv) {
reg_t address = argv[0];
address.incOffset(s->_segMan->strlen(address));
return address;
}
reg_t kStrCat(EngineState *s, int argc, reg_t *argv) {
Common::String s1 = s->_segMan->getString(argv[0]);
Common::String s2 = s->_segMan->getString(argv[1]);
// Japanese PC-9801 interpreter splits strings here
// see bug #5834
// Verified for Police Quest 2 + Quest For Glory 1
// However Space Quest 4 PC-9801 doesn't
if ((g_sci->getLanguage() == Common::JA_JPN)
&& (getSciVersion() <= SCI_VERSION_01)) {
s1 = g_sci->strSplit(s1.c_str(), NULL);
s2 = g_sci->strSplit(s2.c_str(), NULL);
}
s1 += s2;
s->_segMan->strcpy(argv[0], s1.c_str());
return argv[0];
}
reg_t kStrCmp(EngineState *s, int argc, reg_t *argv) {
Common::String s1 = s->_segMan->getString(argv[0]);
Common::String s2 = s->_segMan->getString(argv[1]);
if (argc > 2)
return make_reg(0, strncmp(s1.c_str(), s2.c_str(), argv[2].toUint16()));
else
return make_reg(0, strcmp(s1.c_str(), s2.c_str()));
}
reg_t kStrCpy(EngineState *s, int argc, reg_t *argv) {
if (argc > 2) {
int length = argv[2].toSint16();
if (length >= 0)
s->_segMan->strncpy(argv[0], argv[1], length);
else
s->_segMan->memcpy(argv[0], argv[1], -length);
} else {
s->_segMan->strcpy(argv[0], argv[1]);
}
return argv[0];
}
reg_t kStrAt(EngineState *s, int argc, reg_t *argv) {
if (argv[0] == SIGNAL_REG) {
warning("Attempt to perform kStrAt() on a signal reg");
return NULL_REG;
}
SegmentRef dest_r = s->_segMan->dereference(argv[0]);
if (!dest_r.isValid()) {
warning("Attempt to StrAt at invalid pointer %04x:%04x", PRINT_REG(argv[0]));
return NULL_REG;
}
byte value;
byte newvalue = 0;
uint16 offset = argv[1].toUint16();
if (argc > 2)
newvalue = argv[2].toSint16();
// in kq5 this here gets called with offset 0xFFFF
// (in the desert wheng getting the staff)
if ((int)offset >= dest_r.maxSize) {
warning("kStrAt offset %X exceeds maxSize", offset);
return s->r_acc;
}
// FIXME: Move this to segman
if (dest_r.isRaw) {
value = dest_r.raw[offset];
if (argc > 2) /* Request to modify this char */
dest_r.raw[offset] = newvalue;
} else {
if (dest_r.skipByte)
offset++;
reg_t &tmp = dest_r.reg[offset / 2];
bool oddOffset = offset & 1;
if (g_sci->isBE())
oddOffset = !oddOffset;
if (!oddOffset) {
value = tmp.getOffset() & 0x00ff;
if (argc > 2) { /* Request to modify this char */
uint16 tmpOffset = tmp.toUint16();
tmpOffset &= 0xff00;
tmpOffset |= newvalue;
tmp.setOffset(tmpOffset);
tmp.setSegment(0);
}
} else {
value = tmp.getOffset() >> 8;
if (argc > 2) { /* Request to modify this char */
uint16 tmpOffset = tmp.toUint16();
tmpOffset &= 0x00ff;
tmpOffset |= newvalue << 8;
tmp.setOffset(tmpOffset);
tmp.setSegment(0);
}
}
}
return make_reg(0, value);
}
reg_t kReadNumber(EngineState *s, int argc, reg_t *argv) {
Common::String source_str = s->_segMan->getString(argv[0]);
const char *source = source_str.c_str();
while (Common::isSpace(*source))
source++; /* Skip whitespace */
int16 result = 0;
int16 sign = 1;
if (*source == '-') {
sign = -1;
source++;
}
if (*source == '$') {
// Hexadecimal input
source++;
char c;
while ((c = *source++) != 0) {
int16 x = 0;
if ((c >= '0') && (c <= '9'))
x = c - '0';
else if ((c >= 'a') && (c <= 'f'))
x = c - 'a' + 10;
else if ((c >= 'A') && (c <= 'F'))
x = c - 'A' + 10;
else
// Stop if we encounter anything other than a digit (like atoi)
break;
result *= 16;
result += x;
}
} else {
// Decimal input. We can not use strtol/atoi in here, because while
// Sierra used atoi, it was a non standard compliant atoi, that didn't
// do clipping. In SQ4 we get the door code in here and that's even
// larger than uint32!
char c;
while ((c = *source++) != 0) {
if ((c < '0') || (c > '9'))
// Stop if we encounter anything other than a digit (like atoi)
break;
result *= 10;
result += c - '0';
}
}
result *= sign;
return make_reg(0, result);
}
#define ALIGN_NONE 0
#define ALIGN_RIGHT 1
#define ALIGN_LEFT -1
#define ALIGN_CENTER 2
/* Format(targ_address, textresnr, index_inside_res, ...)
** or
** Format(targ_address, heap_text_addr, ...)
** Formats the text from text.textresnr (offset index_inside_res) or heap_text_addr according to
** the supplied parameters and writes it to the targ_address.
*/
reg_t kFormat(EngineState *s, int argc, reg_t *argv) {
uint16 *arguments;
reg_t dest = argv[0];
int maxsize = 4096; /* Arbitrary... */
char targetbuf[4096];
char *target = targetbuf;
reg_t position = argv[1]; /* source */
int mode = 0;
int paramindex = 0; /* Next parameter to evaluate */
char xfer;
int i;
int startarg;
int strLength = 0; /* Used for stuff like "%13s" */
bool unsignedVar = false;
if (position.getSegment())
startarg = 2;
else {
// WORKAROUND: QFG1 VGA Mac calls this without the first parameter (dest). It then
// treats the source as the dest and overwrites the source string with an empty string.
if (argc < 3)
return NULL_REG;
startarg = 3; /* First parameter to use for formatting */
}
int index = (startarg == 3) ? argv[2].toUint16() : 0;
Common::String source_str = g_sci->getKernel()->lookupText(position, index);
const char* source = source_str.c_str();
debugC(kDebugLevelStrings, "Formatting \"%s\"", source);
arguments = (uint16 *)malloc(sizeof(uint16) * argc);
memset(arguments, 0, sizeof(uint16) * argc);
for (i = startarg; i < argc; i++)
arguments[i-startarg] = argv[i].toUint16(); /* Parameters are copied to prevent overwriting */
while ((xfer = *source++)) {
if (xfer == '%') {
if (mode == 1) {
assert((target - targetbuf) + 2 <= maxsize);
*target++ = '%'; /* Literal % by using "%%" */
mode = 0;
} else {
mode = 1;
strLength = 0;
}
} else if (mode == 1) { /* xfer != '%' */
char fillchar = ' ';
int align = ALIGN_NONE;
char *writestart = target; /* Start of the written string, used after the switch */
/* int writelength; -- unused atm */
if (xfer && (Common::isDigit(xfer) || xfer == '-' || xfer == '=')) {
char *destp;
if (xfer == '0')
fillchar = '0';
else if (xfer == '=')
align = ALIGN_CENTER;
else if (Common::isDigit(xfer) || (xfer == '-'))
source--; // Go to start of length argument
strLength = strtol(source, &destp, 10);
if (destp > source)
source = destp;
if (strLength < 0) {
align = ALIGN_LEFT;
strLength = -strLength;
} else if (align != ALIGN_CENTER)
align = ALIGN_RIGHT;
xfer = *source++;
} else
strLength = 0;
assert((target - targetbuf) + strLength + 1 <= maxsize);
switch (xfer) {
case 's': { /* Copy string */
reg_t reg = argv[startarg + paramindex];
#ifdef ENABLE_SCI32
// If the string is a string object, get to the actual string in the data selector
if (s->_segMan->isObject(reg))
reg = readSelector(s->_segMan, reg, SELECTOR(data));
#endif
Common::String tempsource = g_sci->getKernel()->lookupText(reg,
arguments[paramindex + 1]);
int slen = strlen(tempsource.c_str());
int extralen = strLength - slen;
assert((target - targetbuf) + extralen <= maxsize);
if (extralen < 0)
extralen = 0;
if (reg.getSegment()) /* Heap address? */
paramindex++;
else
paramindex += 2; /* No, text resource address */
switch (align) {
case ALIGN_NONE:
case ALIGN_RIGHT:
while (extralen-- > 0)
*target++ = ' '; /* Format into the text */
break;
case ALIGN_CENTER: {
int half_extralen = extralen >> 1;
while (half_extralen-- > 0)
*target++ = ' '; /* Format into the text */
break;
}
default:
break;
}
strcpy(target, tempsource.c_str());
target += slen;
switch (align) {
case ALIGN_CENTER: {
int half_extralen;
align = 0;
half_extralen = extralen - (extralen >> 1);
while (half_extralen-- > 0)
*target++ = ' '; /* Format into the text */
break;
}
default:
break;
}
mode = 0;
}
break;
case 'c': { /* insert character */
assert((target - targetbuf) + 2 <= maxsize);
if (align >= 0)
while (strLength-- > 1)
*target++ = ' '; /* Format into the text */
char argchar = arguments[paramindex++];
if (argchar)
*target++ = argchar;
mode = 0;
}
break;
case 'x':
case 'u':
unsignedVar = true;
case 'd': { /* Copy decimal */
// In the new SCI2 kString function, %d is used for unsigned
// integers. An example is script 962 in Shivers - it uses %d
// to create file names.
if (getSciVersion() >= SCI_VERSION_2)
unsignedVar = true;
/* int templen; -- unused atm */
const char *format_string = "%d";
if (xfer == 'x')
format_string = "%x";
int val = arguments[paramindex];
if (!unsignedVar)
val = (int16)arguments[paramindex];
target += sprintf(target, format_string, val);
paramindex++;
assert((target - targetbuf) <= maxsize);
unsignedVar = false;
mode = 0;
}
break;
default:
*target = '%';
target++;
*target = xfer;
target++;
mode = 0;
}
if (align) {
int written = target - writestart;
int padding = strLength - written;
if (padding > 0) {
if (align > 0) {
memmove(writestart + padding,
writestart, written);
memset(writestart, fillchar, padding);
} else {
memset(target, ' ', padding);
}
target += padding;
}
}
} else { /* mode != 1 */
*target = xfer;
target++;
}
}
free(arguments);
*target = 0; /* Terminate string */
#ifdef ENABLE_SCI32
// Resize SCI32 strings if necessary
if (getSciVersion() >= SCI_VERSION_2) {
SciString *string = s->_segMan->lookupString(dest);
string->setSize(strlen(targetbuf) + 1);
}
#endif
s->_segMan->strcpy(dest, targetbuf);
return dest; /* Return target addr */
}
reg_t kStrLen(EngineState *s, int argc, reg_t *argv) {
return make_reg(0, s->_segMan->strlen(argv[0]));
}
reg_t kGetFarText(EngineState *s, int argc, reg_t *argv) {
Resource *textres = g_sci->getResMan()->findResource(ResourceId(kResourceTypeText, argv[0].toUint16()), 0);
char *seeker;
int counter = argv[1].toUint16();
if (!textres) {
error("text.%d does not exist", argv[0].toUint16());
return NULL_REG;
}
seeker = (char *)textres->data;
// The second parameter (counter) determines the number of the string
// inside the text resource.
while (counter--) {
while (*seeker++)
;
}
// If the third argument is NULL, allocate memory for the destination. This
// occurs in SCI1 Mac games. The memory will later be freed by the game's
// scripts.
if (argv[2] == NULL_REG)
s->_segMan->allocDynmem(strlen(seeker) + 1, "Mac FarText", &argv[2]);
s->_segMan->strcpy(argv[2], seeker); // Copy the string and get return value
return argv[2];
}
#define DUMMY_MESSAGE "Message not found!"
enum kMessageFunc {
K_MESSAGE_GET,
K_MESSAGE_NEXT,
K_MESSAGE_SIZE,
K_MESSAGE_REFNOUN,
K_MESSAGE_REFVERB,
K_MESSAGE_REFCOND,
K_MESSAGE_PUSH,
K_MESSAGE_POP,
K_MESSAGE_LASTMESSAGE
};
reg_t kGetMessage(EngineState *s, int argc, reg_t *argv) {
MessageTuple tuple = MessageTuple(argv[0].toUint16(), argv[2].toUint16());
s->_msgState->getMessage(argv[1].toUint16(), tuple, argv[3]);
return argv[3];
}
reg_t kMessage(EngineState *s, int argc, reg_t *argv) {
uint func = argv[0].toUint16();
uint16 module = (argc >= 2) ? argv[1].toUint16() : 0;
#ifdef ENABLE_SCI32
if (getSciVersion() >= SCI_VERSION_2) {
// In complete weirdness, SCI32 bumps up subops 3-8 to 4-9 and stubs off subop 3.
if (func == 3)
error("SCI32 kMessage(3)");
else if (func > 3)
func--;
}
#endif
// TODO: Perhaps fix this check, currently doesn't work with PUSH and POP subfunctions
// Pepper uses them to to handle the glossary
// if ((func != K_MESSAGE_NEXT) && (argc < 2)) {
// warning("Message: not enough arguments passed to subfunction %d", func);
// return NULL_REG;
// }
MessageTuple tuple;
if (argc >= 6)
tuple = MessageTuple(argv[2].toUint16(), argv[3].toUint16(), argv[4].toUint16(), argv[5].toUint16());
// WORKAROUND for a script bug in Pepper. When using objects together,
// there is code inside script 894 that shows appropriate messages.
// In the case of the jar of cabbage (noun 26), the relevant message
// shown when using any object with it is missing. This leads to the
// script code being triggered, which modifies the jar's noun and
// message selectors, and renders it useless. Thus, when using any
// object with the jar of cabbage, it's effectively corrupted, and
// can't be used on the goat to empty it, therefore the game reaches
// an unsolvable state. It's almost impossible to patch the offending
// script, as it is used in many cases. But we can prevent the
// corruption of the jar here: if the message is found, the offending
// code is never reached and the jar is never corrupted. To do this,
// we substitute all verbs on the cabbage jar with the default verb,
// which shows the "Cannot use this object with the jar" message, and
// never triggers the offending script code that corrupts the object.
// This only affects the jar of cabbage - any other object, including
// the empty jar has a different noun, thus it's unaffected.
// Fixes bug #3601090.
// NOTE: To fix a corrupted jar object, type "send Glass_Jar message 52"
// in the debugger.
if (g_sci->getGameId() == GID_PEPPER && func == 0 && argc >= 6 && module == 894 &&
tuple.noun == 26 && tuple.cond == 0 && tuple.seq == 1 &&
!s->_msgState->getMessage(module, tuple, NULL_REG))
tuple.verb = 0;
switch (func) {
case K_MESSAGE_GET:
return make_reg(0, s->_msgState->getMessage(module, tuple, (argc == 7 ? argv[6] : NULL_REG)));
case K_MESSAGE_NEXT:
return make_reg(0, s->_msgState->nextMessage((argc == 2 ? argv[1] : NULL_REG)));
case K_MESSAGE_SIZE:
return make_reg(0, s->_msgState->messageSize(module, tuple));
case K_MESSAGE_REFCOND:
case K_MESSAGE_REFVERB:
case K_MESSAGE_REFNOUN: {
MessageTuple t;
if (s->_msgState->messageRef(module, tuple, t)) {
switch (func) {
case K_MESSAGE_REFCOND:
return make_reg(0, t.cond);
case K_MESSAGE_REFVERB:
return make_reg(0, t.verb);
case K_MESSAGE_REFNOUN:
return make_reg(0, t.noun);
}
}
return SIGNAL_REG;
}
case K_MESSAGE_LASTMESSAGE: {
MessageTuple msg;
int lastModule;
s->_msgState->lastQuery(lastModule, msg);
bool ok = false;
if (s->_segMan->dereference(argv[1]).isRaw) {
byte *buffer = s->_segMan->derefBulkPtr(argv[1], 10);
if (buffer) {
ok = true;
WRITE_LE_UINT16(buffer, lastModule);
WRITE_LE_UINT16(buffer + 2, msg.noun);
WRITE_LE_UINT16(buffer + 4, msg.verb);
WRITE_LE_UINT16(buffer + 6, msg.cond);
WRITE_LE_UINT16(buffer + 8, msg.seq);
}
} else {
reg_t *buffer = s->_segMan->derefRegPtr(argv[1], 5);
if (buffer) {
ok = true;
buffer[0] = make_reg(0, lastModule);
buffer[1] = make_reg(0, msg.noun);
buffer[2] = make_reg(0, msg.verb);
buffer[3] = make_reg(0, msg.cond);
buffer[4] = make_reg(0, msg.seq);
}
}
if (!ok)
warning("Message: buffer %04x:%04x invalid or too small to hold the tuple", PRINT_REG(argv[1]));
return NULL_REG;
}
case K_MESSAGE_PUSH:
s->_msgState->pushCursorStack();
break;
case K_MESSAGE_POP:
s->_msgState->popCursorStack();
break;
default:
warning("Message: subfunction %i invoked (not implemented)", func);
}
return NULL_REG;
}
reg_t kSetQuitStr(EngineState *s, int argc, reg_t *argv) {
//Common::String quitStr = s->_segMan->getString(argv[0]);
//debug("Setting quit string to '%s'", quitStr.c_str());
return s->r_acc;
}
reg_t kStrSplit(EngineState *s, int argc, reg_t *argv) {
Common::String format = s->_segMan->getString(argv[1]);
Common::String sep_str;
const char *sep = NULL;
if (!argv[2].isNull()) {
sep_str = s->_segMan->getString(argv[2]);
sep = sep_str.c_str();
}
Common::String str = g_sci->strSplit(format.c_str(), sep);
// Make sure target buffer is large enough
SegmentRef buf_r = s->_segMan->dereference(argv[0]);
if (!buf_r.isValid() || buf_r.maxSize < (int)str.size() + 1) {
warning("StrSplit: buffer %04x:%04x invalid or too small to hold the following text of %i bytes: '%s'",
PRINT_REG(argv[0]), str.size() + 1, str.c_str());
return NULL_REG;
}
s->_segMan->strcpy(argv[0], str.c_str());
return argv[0];
}
#ifdef ENABLE_SCI32
// TODO: there is an unused second argument, happens at least in LSL6 right during the intro
reg_t kStringNew(EngineState *s, int argc, reg_t *argv) {
reg_t stringHandle;
SciString *string = s->_segMan->allocateString(&stringHandle);
string->setSize(argv[0].toUint16());
// Make sure the first character is a null character
if (string->getSize() > 0)
string->setValue(0, 0);
return stringHandle;
}
reg_t kStringSize(EngineState *s, int argc, reg_t *argv) {
return make_reg(0, s->_segMan->getString(argv[0]).size());
}
// At (return value at an index)
reg_t kStringAt(EngineState *s, int argc, reg_t *argv) {
// Note that values are put in bytes to avoid sign extension
if (argv[0].getSegment() == s->_segMan->getStringSegmentId()) {
SciString *string = s->_segMan->lookupString(argv[0]);
byte val = string->getRawData()[argv[1].toUint16()];
return make_reg(0, val);
} else {
Common::String string = s->_segMan->getString(argv[0]);
byte val = string[argv[1].toUint16()];
return make_reg(0, val);
}
}
// Atput (put value at an index)
reg_t kStringPutAt(EngineState *s, int argc, reg_t *argv) {
SciString *string = s->_segMan->lookupString(argv[0]);
uint32 index = argv[1].toUint16();
uint32 count = argc - 2;
if (index + count > 65535)
return NULL_REG;
if (string->getSize() < index + count)
string->setSize(index + count);
for (uint16 i = 0; i < count; i++)
string->setValue(i + index, argv[i + 2].toUint16());
return argv[0]; // We also have to return the handle
}
reg_t kStringFree(EngineState *s, int argc, reg_t *argv) {
// Freeing of strings is handled by the garbage collector
return s->r_acc;
}
reg_t kStringFill(EngineState *s, int argc, reg_t *argv) {
SciString *string = s->_segMan->lookupString(argv[0]);
uint16 index = argv[1].toUint16();
// A count of -1 means fill the rest of the array
uint16 count = argv[2].toSint16() == -1 ? string->getSize() - index : argv[2].toUint16();
uint16 stringSize = string->getSize();
if (stringSize < index + count)
string->setSize(index + count);
for (uint16 i = 0; i < count; i++)
string->setValue(i + index, argv[3].toUint16());
return argv[0];
}
reg_t kStringCopy(EngineState *s, int argc, reg_t *argv) {
const char *string2 = 0;
uint32 string2Size = 0;
Common::String string;
if (argv[2].getSegment() == s->_segMan->getStringSegmentId()) {
SciString *sstr;
sstr = s->_segMan->lookupString(argv[2]);
string2 = sstr->getRawData();
string2Size = sstr->getSize();
} else {
string = s->_segMan->getString(argv[2]);
string2 = string.c_str();
string2Size = string.size() + 1;
}
uint32 index1 = argv[1].toUint16();
uint32 index2 = argv[3].toUint16();
if (argv[0] == argv[2]) {
// source and destination string are one and the same
if (index1 == index2) {
// even same index? ignore this call
// Happens in KQ7, when starting a chapter
return argv[0];
}
// TODO: this will crash, when setSize() is triggered later
// we need to exactly replicate original interpreter behavior
warning("kString(Copy): source is the same as destination string");
}
// The original engine ignores bad copies too
if (index2 > string2Size)
return NULL_REG;
// A count of -1 means fill the rest of the array
uint32 count = argv[4].toSint16() == -1 ? string2Size - index2 + 1 : argv[4].toUint16();
// reg_t strAddress = argv[0];
SciString *string1 = s->_segMan->lookupString(argv[0]);
//SciString *string1 = !argv[1].isNull() ? s->_segMan->lookupString(argv[1]) : s->_segMan->allocateString(&strAddress);
if (string1->getSize() < index1 + count)
string1->setSize(index1 + count);
// Note: We're accessing from c_str() here because the
// string's size ignores the trailing 0 and therefore
// triggers an assert when doing string2[i + index2].
for (uint16 i = 0; i < count; i++)
string1->setValue(i + index1, string2[i + index2]);
return argv[0];
}
reg_t kStringCompare(EngineState *s, int argc, reg_t *argv) {
Common::String string1 = argv[0].isNull() ? "" : s->_segMan->getString(argv[0]);
Common::String string2 = argv[1].isNull() ? "" : s->_segMan->getString(argv[1]);
if (argc == 3) // Strncmp
return make_reg(0, strncmp(string1.c_str(), string2.c_str(), argv[2].toUint16()));
else // Strcmp
return make_reg(0, strcmp(string1.c_str(), string2.c_str()));
}
// was removed for SCI2.1 Late+
reg_t kStringDup(EngineState *s, int argc, reg_t *argv) {
reg_t stringHandle;
SciString *dupString = s->_segMan->allocateString(&stringHandle);
if (argv[0].getSegment() == s->_segMan->getStringSegmentId()) {
*dupString = *s->_segMan->lookupString(argv[0]);
} else {
dupString->fromString(s->_segMan->getString(argv[0]));
}
return stringHandle;
}
// was removed for SCI2.1 Late+
reg_t kStringGetData(EngineState *s, int argc, reg_t *argv) {
if (!s->_segMan->isHeapObject(argv[0]))
return argv[0];
return readSelector(s->_segMan, argv[0], SELECTOR(data));
}
reg_t kStringLen(EngineState *s, int argc, reg_t *argv) {
return make_reg(0, s->_segMan->strlen(argv[0]));
}
reg_t kStringPrintf(EngineState *s, int argc, reg_t *argv) {
reg_t stringHandle;
s->_segMan->allocateString(&stringHandle);
reg_t *adjustedArgs = new reg_t[argc + 1];
adjustedArgs[0] = stringHandle;
memcpy(&adjustedArgs[1], argv, argc * sizeof(reg_t));
kFormat(s, argc + 1, adjustedArgs);
delete[] adjustedArgs;
return stringHandle;
}
reg_t kStringPrintfBuf(EngineState *s, int argc, reg_t *argv) {
return kFormat(s, argc, argv);
}
reg_t kStringAtoi(EngineState *s, int argc, reg_t *argv) {
Common::String string = s->_segMan->getString(argv[0]);
return make_reg(0, (uint16)atoi(string.c_str()));
}
reg_t kStringTrim(EngineState *s, int argc, reg_t *argv) {
Common::String string = s->_segMan->getString(argv[0]);
string.trim();
// TODO: Second parameter (bitfield, trim from left, right, center)
warning("kStringTrim (%d)", argv[1].getOffset());
s->_segMan->strcpy(argv[0], string.c_str());
return NULL_REG;
}
reg_t kStringUpper(EngineState *s, int argc, reg_t *argv) {
Common::String string = s->_segMan->getString(argv[0]);
string.toUppercase();
s->_segMan->strcpy(argv[0], string.c_str());
return NULL_REG;
}
reg_t kStringLower(EngineState *s, int argc, reg_t *argv) {
Common::String string = s->_segMan->getString(argv[0]);
string.toLowercase();
s->_segMan->strcpy(argv[0], string.c_str());
return NULL_REG;
}
// Possibly kStringTranslate?
reg_t kStringTrn(EngineState *s, int argc, reg_t *argv) {
warning("kStringTrn (argc = %d)", argc);
return NULL_REG;
}
// Possibly kStringTranslateExclude?
reg_t kStringTrnExclude(EngineState *s, int argc, reg_t *argv) {
warning("kStringTrnExclude (argc = %d)", argc);
return NULL_REG;
}
reg_t kString(EngineState *s, int argc, reg_t *argv) {
if (!s)
return make_reg(0, getSciVersion());
error("not supposed to call this");
}
#endif
} // End of namespace Sci
|