1 /* Jim - A small embeddable Tcl interpreter
\r
2 * Copyright 2005 Salvatore Sanfilippo <antirez@invece.org>
\r
3 * Copyright 2005 Clemens Hintze <c.hintze@gmx.net>
\r
5 * Licensed under the Apache License, Version 2.0 (the "License");
\r
6 * you may not use this file except in compliance with the License.
\r
7 * You may obtain a copy of the License at
\r
9 * http://www.apache.org/licenses/LICENSE-2.0
\r
11 * A copy of the license is also included in the source distribution
\r
12 * of Jim, as a TXT file name called LICENSE.
\r
14 * Unless required by applicable law or agreed to in writing, software
\r
15 * distributed under the License is distributed on an "AS IS" BASIS,
\r
16 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
\r
17 * See the License for the specific language governing permissions and
\r
18 * limitations under the License.
\r
21 #define __JIM_CORE__
\r
22 #define JIM_OPTIMIZATION /* comment to avoid optimizations and reduce size */
\r
25 #include <pkgconf/jimtcl.h>
\r
28 #define JIM_DYNLIB /* Dynamic library support for UNIX and WIN32 */
\r
29 #endif /* JIM_ANSIC */
\r
41 /* Include the platform dependent libraries for
\r
42 * dynamic loading of libraries. */
\r
44 #if defined(_WIN32) || defined(WIN32)
\r
49 #define WIN32_LEAN_AND_MEAN
\r
50 #include <windows.h>
\r
51 #if _MSC_VER >= 1000
\r
52 #pragma warning(disable:4146)
\r
53 #endif /* _MSC_VER */
\r
57 #endif /* JIM_DYNLIB */
\r
60 #include <cyg/jimtcl/jim.h>
\r
65 #ifdef HAVE_BACKTRACE
\r
66 #include <execinfo.h>
\r
69 /* -----------------------------------------------------------------------------
\r
71 * ---------------------------------------------------------------------------*/
\r
73 /* A shared empty string for the objects string representation.
\r
74 * Jim_InvalidateStringRep knows about it and don't try to free. */
\r
75 static char *JimEmptyStringRep = (char*) "";
\r
77 /* -----------------------------------------------------------------------------
\r
78 * Required prototypes of not exported functions
\r
79 * ---------------------------------------------------------------------------*/
\r
80 static void JimChangeCallFrameId(Jim_Interp *interp, Jim_CallFrame *cf);
\r
81 static void JimFreeCallFrame(Jim_Interp *interp, Jim_CallFrame *cf, int flags);
\r
82 static void JimRegisterCoreApi(Jim_Interp *interp);
\r
84 static Jim_HashTableType JimVariablesHashTableType;
\r
86 /* -----------------------------------------------------------------------------
\r
88 * ---------------------------------------------------------------------------*/
\r
91 * Convert a string to a jim_wide INTEGER.
\r
92 * This function originates from BSD.
\r
94 * Ignores `locale' stuff. Assumes that the upper and lower case
\r
95 * alphabets and digits are each contiguous.
\r
97 #ifdef HAVE_LONG_LONG
\r
98 #define JimIsAscii(c) (((c) & ~0x7f) == 0)
\r
99 static jim_wide JimStrtoll(const char *nptr, char **endptr, register int base)
\r
101 register const char *s;
\r
102 register unsigned jim_wide acc;
\r
103 register unsigned char c;
\r
104 register unsigned jim_wide qbase, cutoff;
\r
105 register int neg, any, cutlim;
\r
108 * Skip white space and pick up leading +/- sign if any.
\r
109 * If base is 0, allow 0x for hex and 0 for octal, else
\r
110 * assume decimal; if base is already 16, allow 0x.
\r
115 } while (isspace(c));
\r
124 if ((base == 0 || base == 16) &&
\r
125 c == '0' && (*s == 'x' || *s == 'X')) {
\r
131 base = c == '0' ? 8 : 10;
\r
134 * Compute the cutoff value between legal numbers and illegal
\r
135 * numbers. That is the largest legal value, divided by the
\r
136 * base. An input number that is greater than this value, if
\r
137 * followed by a legal input character, is too big. One that
\r
138 * is equal to this value may be valid or not; the limit
\r
139 * between valid and invalid numbers is then based on the last
\r
140 * digit. For instance, if the range for quads is
\r
141 * [-9223372036854775808..9223372036854775807] and the input base
\r
142 * is 10, cutoff will be set to 922337203685477580 and cutlim to
\r
143 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
\r
144 * accumulated a value > 922337203685477580, or equal but the
\r
145 * next digit is > 7 (or 8), the number is too big, and we will
\r
146 * return a range error.
\r
148 * Set any if any `digits' consumed; make it negative to indicate
\r
151 qbase = (unsigned)base;
\r
152 cutoff = neg ? (unsigned jim_wide)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX
\r
154 cutlim = (int)(cutoff % qbase);
\r
156 for (acc = 0, any = 0;; c = *s++) {
\r
157 if (!JimIsAscii(c))
\r
161 else if (isalpha(c))
\r
162 c -= isupper(c) ? 'A' - 10 : 'a' - 10;
\r
167 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
\r
176 acc = neg ? LLONG_MIN : LLONG_MAX;
\r
181 *endptr = (char *)(any ? s - 1 : nptr);
\r
186 /* Glob-style pattern matching. */
\r
187 static int JimStringMatch(const char *pattern, int patternLen,
\r
188 const char *string, int stringLen, int nocase)
\r
190 while(patternLen) {
\r
191 switch(pattern[0]) {
\r
193 while (pattern[1] == '*') {
\r
197 if (patternLen == 1)
\r
198 return 1; /* match */
\r
200 if (JimStringMatch(pattern+1, patternLen-1,
\r
201 string, stringLen, nocase))
\r
202 return 1; /* match */
\r
206 return 0; /* no match */
\r
209 if (stringLen == 0)
\r
210 return 0; /* no match */
\r
220 not = pattern[0] == '^';
\r
227 if (pattern[0] == '\\') {
\r
230 if (pattern[0] == string[0])
\r
232 } else if (pattern[0] == ']') {
\r
234 } else if (patternLen == 0) {
\r
238 } else if (pattern[1] == '-' && patternLen >= 3) {
\r
239 int start = pattern[0];
\r
240 int end = pattern[2];
\r
248 start = tolower(start);
\r
249 end = tolower(end);
\r
254 if (c >= start && c <= end)
\r
258 if (pattern[0] == string[0])
\r
261 if (tolower((int)pattern[0]) == tolower((int)string[0]))
\r
271 return 0; /* no match */
\r
277 if (patternLen >= 2) {
\r
284 if (pattern[0] != string[0])
\r
285 return 0; /* no match */
\r
287 if (tolower((int)pattern[0]) != tolower((int)string[0]))
\r
288 return 0; /* no match */
\r
296 if (stringLen == 0) {
\r
297 while(*pattern == '*') {
\r
304 if (patternLen == 0 && stringLen == 0)
\r
309 int JimStringCompare(const char *s1, int l1, const char *s2, int l2,
\r
312 unsigned char *u1 = (unsigned char*) s1, *u2 = (unsigned char*) s2;
\r
317 return (int)*u1-*u2;
\r
318 u1++; u2++; l1--; l2--;
\r
320 if (!l1 && !l2) return 0;
\r
324 if (tolower((int)*u1) != tolower((int)*u2))
\r
325 return tolower((int)*u1)-tolower((int)*u2);
\r
326 u1++; u2++; l1--; l2--;
\r
328 if (!l1 && !l2) return 0;
\r
333 /* Search 's1' inside 's2', starting to search from char 'index' of 's2'.
\r
334 * The index of the first occurrence of s1 in s2 is returned.
\r
335 * If s1 is not found inside s2, -1 is returned. */
\r
336 int JimStringFirst(const char *s1, int l1, const char *s2, int l2, int index)
\r
340 if (!l1 || !l2 || l1 > l2) return -1;
\r
341 if (index < 0) index = 0;
\r
343 for (i = index; i <= l2-l1; i++) {
\r
344 if (memcmp(s2, s1, l1) == 0)
\r
351 int Jim_WideToString(char *buf, jim_wide wideValue)
\r
353 const char *fmt = "%" JIM_WIDE_MODIFIER;
\r
354 return sprintf(buf, fmt, wideValue);
\r
357 int Jim_StringToWide(const char *str, jim_wide *widePtr, int base)
\r
361 #ifdef HAVE_LONG_LONG
\r
362 *widePtr = JimStrtoll(str, &endptr, base);
\r
364 *widePtr = strtol(str, &endptr, base);
\r
366 if (str[0] == '\0')
\r
368 if (endptr[0] != '\0') {
\r
370 if (!isspace((int)*endptr))
\r
378 int Jim_StringToIndex(const char *str, int *intPtr)
\r
382 *intPtr = strtol(str, &endptr, 10);
\r
383 if (str[0] == '\0')
\r
385 if (endptr[0] != '\0') {
\r
387 if (!isspace((int)*endptr))
\r
395 /* The string representation of references has two features in order
\r
396 * to make the GC faster. The first is that every reference starts
\r
397 * with a non common character '~', in order to make the string matching
\r
398 * fater. The second is that the reference string rep his 32 characters
\r
399 * in length, this allows to avoid to check every object with a string
\r
400 * repr < 32, and usually there are many of this objects. */
\r
402 #define JIM_REFERENCE_SPACE (35+JIM_REFERENCE_TAGLEN)
\r
404 static int JimFormatReference(char *buf, Jim_Reference *refPtr, jim_wide id)
\r
406 const char *fmt = "<reference.<%s>.%020" JIM_WIDE_MODIFIER ">";
\r
407 sprintf(buf, fmt, refPtr->tag, id);
\r
408 return JIM_REFERENCE_SPACE;
\r
411 int Jim_DoubleToString(char *buf, double doubleValue)
\r
416 len = sprintf(buf, "%.17g", doubleValue);
\r
419 if (*s == '.') return len;
\r
422 /* Add a final ".0" if it's a number. But not
\r
423 * for NaN or InF */
\r
424 if (isdigit((int)buf[0])
\r
425 || ((buf[0] == '-' || buf[0] == '+')
\r
426 && isdigit((int)buf[1]))) {
\r
435 int Jim_StringToDouble(const char *str, double *doublePtr)
\r
439 *doublePtr = strtod(str, &endptr);
\r
440 if (str[0] == '\0' || endptr[0] != '\0')
\r
445 static jim_wide JimPowWide(jim_wide b, jim_wide e)
\r
447 jim_wide i, res = 1;
\r
448 if ((b==0 && e!=0) || (e<0)) return 0;
\r
449 for(i=0; i<e; i++) {res *= b;}
\r
453 /* -----------------------------------------------------------------------------
\r
454 * Special functions
\r
455 * ---------------------------------------------------------------------------*/
\r
457 /* Note that 'interp' may be NULL if not available in the
\r
458 * context of the panic. It's only useful to get the error
\r
459 * file descriptor, it will default to stderr otherwise. */
\r
460 void Jim_Panic(Jim_Interp *interp, const char *fmt, ...)
\r
463 FILE *fp = interp ? interp->stderr_ : stderr;
\r
466 fprintf(fp, JIM_NL "JIM INTERPRETER PANIC: ");
\r
467 vfprintf(fp, fmt, ap);
\r
468 fprintf(fp, JIM_NL JIM_NL);
\r
470 #ifdef HAVE_BACKTRACE
\r
476 size = backtrace(array, 40);
\r
477 strings = backtrace_symbols(array, size);
\r
478 for (i = 0; i < size; i++)
\r
479 fprintf(fp,"[backtrace] %s" JIM_NL, strings[i]);
\r
480 fprintf(fp,"[backtrace] Include the above lines and the output" JIM_NL);
\r
481 fprintf(fp,"[backtrace] of 'nm <executable>' in the bug report." JIM_NL);
\r
487 /* -----------------------------------------------------------------------------
\r
488 * Memory allocation
\r
489 * ---------------------------------------------------------------------------*/
\r
491 /* Macro used for memory debugging.
\r
492 * In order for they to work you have to rename Jim_Alloc into _Jim_Alloc
\r
493 * and similary for Jim_Realloc and Jim_Free */
\r
495 #define Jim_Alloc(s) (printf("%s %d: Jim_Alloc(%d)\n",__FILE__,__LINE__,s),_Jim_Alloc(s))
\r
496 #define Jim_Free(p) (printf("%s %d: Jim_Free(%p)\n",__FILE__,__LINE__,p),_Jim_Free(p))
\r
497 #define Jim_Realloc(p,s) (printf("%s %d: Jim_Realloc(%p,%d)\n",__FILE__,__LINE__,p,s),_Jim_Realloc(p,s))
\r
500 void *Jim_Alloc(int size)
\r
502 /* We allocate zero length arrayes, etc. to use a single orthogonal codepath */
\r
505 void *p = malloc(size);
\r
507 Jim_Panic(NULL,"malloc: Out of memory");
\r
511 void Jim_Free(void *ptr) {
\r
515 void *Jim_Realloc(void *ptr, int size)
\r
517 /* We allocate zero length arrayes, etc. to use a single orthogonal codepath */
\r
520 void *p = realloc(ptr, size);
\r
522 Jim_Panic(NULL,"realloc: Out of memory");
\r
526 char *Jim_StrDup(const char *s)
\r
529 char *copy = Jim_Alloc(l+1);
\r
531 memcpy(copy, s, l+1);
\r
535 char *Jim_StrDupLen(const char *s, int l)
\r
537 char *copy = Jim_Alloc(l+1);
\r
539 memcpy(copy, s, l+1);
\r
540 copy[l] = 0; /* Just to be sure, original could be substring */
\r
544 /* -----------------------------------------------------------------------------
\r
545 * Time related functions
\r
546 * ---------------------------------------------------------------------------*/
\r
547 /* Returns microseconds of CPU used since start. */
\r
548 static jim_wide JimClock(void)
\r
550 #if (defined WIN32) && !(defined JIM_ANSIC)
\r
551 LARGE_INTEGER t, f;
\r
552 QueryPerformanceFrequency(&f);
\r
553 QueryPerformanceCounter(&t);
\r
554 return (long)((t.QuadPart * 1000000) / f.QuadPart);
\r
556 clock_t clocks = clock();
\r
558 return (long)(clocks*(1000000/CLOCKS_PER_SEC));
\r
562 /* -----------------------------------------------------------------------------
\r
564 * ---------------------------------------------------------------------------*/
\r
566 /* -------------------------- private prototypes ---------------------------- */
\r
567 static int JimExpandHashTableIfNeeded(Jim_HashTable *ht);
\r
568 static unsigned int JimHashTableNextPower(unsigned int size);
\r
569 static int JimInsertHashEntry(Jim_HashTable *ht, const void *key);
\r
571 /* -------------------------- hash functions -------------------------------- */
\r
573 /* Thomas Wang's 32 bit Mix Function */
\r
574 unsigned int Jim_IntHashFunction(unsigned int key)
\r
576 key += ~(key << 15);
\r
577 key ^= (key >> 10);
\r
580 key += ~(key << 11);
\r
581 key ^= (key >> 16);
\r
585 /* Identity hash function for integer keys */
\r
586 unsigned int Jim_IdentityHashFunction(unsigned int key)
\r
591 /* Generic hash function (we are using to multiply by 9 and add the byte
\r
593 unsigned int Jim_GenHashFunction(const unsigned char *buf, int len)
\r
595 unsigned int h = 0;
\r
597 h += (h<<3)+*buf++;
\r
601 /* ----------------------------- API implementation ------------------------- */
\r
602 /* reset an hashtable already initialized with ht_init().
\r
603 * NOTE: This function should only called by ht_destroy(). */
\r
604 static void JimResetHashTable(Jim_HashTable *ht)
\r
610 ht->collisions = 0;
\r
613 /* Initialize the hash table */
\r
614 int Jim_InitHashTable(Jim_HashTable *ht, Jim_HashTableType *type,
\r
617 JimResetHashTable(ht);
\r
619 ht->privdata = privDataPtr;
\r
623 /* Resize the table to the minimal size that contains all the elements,
\r
624 * but with the invariant of a USER/BUCKETS ration near to <= 1 */
\r
625 int Jim_ResizeHashTable(Jim_HashTable *ht)
\r
627 int minimal = ht->used;
\r
629 if (minimal < JIM_HT_INITIAL_SIZE)
\r
630 minimal = JIM_HT_INITIAL_SIZE;
\r
631 return Jim_ExpandHashTable(ht, minimal);
\r
634 /* Expand or create the hashtable */
\r
635 int Jim_ExpandHashTable(Jim_HashTable *ht, unsigned int size)
\r
637 Jim_HashTable n; /* the new hashtable */
\r
638 unsigned int realsize = JimHashTableNextPower(size), i;
\r
640 /* the size is invalid if it is smaller than the number of
\r
641 * elements already inside the hashtable */
\r
642 if (ht->used >= size)
\r
645 Jim_InitHashTable(&n, ht->type, ht->privdata);
\r
647 n.sizemask = realsize-1;
\r
648 n.table = Jim_Alloc(realsize*sizeof(Jim_HashEntry*));
\r
650 /* Initialize all the pointers to NULL */
\r
651 memset(n.table, 0, realsize*sizeof(Jim_HashEntry*));
\r
653 /* Copy all the elements from the old to the new table:
\r
654 * note that if the old hash table is empty ht->size is zero,
\r
655 * so Jim_ExpandHashTable just creates an hash table. */
\r
657 for (i = 0; i < ht->size && ht->used > 0; i++) {
\r
658 Jim_HashEntry *he, *nextHe;
\r
660 if (ht->table[i] == NULL) continue;
\r
662 /* For each hash entry on this slot... */
\r
668 /* Get the new element index */
\r
669 h = Jim_HashKey(ht, he->key) & n.sizemask;
\r
670 he->next = n.table[h];
\r
673 /* Pass to the next element */
\r
677 assert(ht->used == 0);
\r
678 Jim_Free(ht->table);
\r
680 /* Remap the new hashtable in the old */
\r
685 /* Add an element to the target hash table */
\r
686 int Jim_AddHashEntry(Jim_HashTable *ht, const void *key, void *val)
\r
689 Jim_HashEntry *entry;
\r
691 /* Get the index of the new element, or -1 if
\r
692 * the element already exists. */
\r
693 if ((index = JimInsertHashEntry(ht, key)) == -1)
\r
696 /* Allocates the memory and stores key */
\r
697 entry = Jim_Alloc(sizeof(*entry));
\r
698 entry->next = ht->table[index];
\r
699 ht->table[index] = entry;
\r
701 /* Set the hash entry fields. */
\r
702 Jim_SetHashKey(ht, entry, key);
\r
703 Jim_SetHashVal(ht, entry, val);
\r
708 /* Add an element, discarding the old if the key already exists */
\r
709 int Jim_ReplaceHashEntry(Jim_HashTable *ht, const void *key, void *val)
\r
711 Jim_HashEntry *entry;
\r
713 /* Try to add the element. If the key
\r
714 * does not exists Jim_AddHashEntry will suceed. */
\r
715 if (Jim_AddHashEntry(ht, key, val) == JIM_OK)
\r
717 /* It already exists, get the entry */
\r
718 entry = Jim_FindHashEntry(ht, key);
\r
719 /* Free the old value and set the new one */
\r
720 Jim_FreeEntryVal(ht, entry);
\r
721 Jim_SetHashVal(ht, entry, val);
\r
725 /* Search and remove an element */
\r
726 int Jim_DeleteHashEntry(Jim_HashTable *ht, const void *key)
\r
729 Jim_HashEntry *he, *prevHe;
\r
733 h = Jim_HashKey(ht, key) & ht->sizemask;
\r
738 if (Jim_CompareHashKeys(ht, key, he->key)) {
\r
739 /* Unlink the element from the list */
\r
741 prevHe->next = he->next;
\r
743 ht->table[h] = he->next;
\r
744 Jim_FreeEntryKey(ht, he);
\r
745 Jim_FreeEntryVal(ht, he);
\r
753 return JIM_ERR; /* not found */
\r
756 /* Destroy an entire hash table */
\r
757 int Jim_FreeHashTable(Jim_HashTable *ht)
\r
761 /* Free all the elements */
\r
762 for (i = 0; i < ht->size && ht->used > 0; i++) {
\r
763 Jim_HashEntry *he, *nextHe;
\r
765 if ((he = ht->table[i]) == NULL) continue;
\r
768 Jim_FreeEntryKey(ht, he);
\r
769 Jim_FreeEntryVal(ht, he);
\r
775 /* Free the table and the allocated cache structure */
\r
776 Jim_Free(ht->table);
\r
777 /* Re-initialize the table */
\r
778 JimResetHashTable(ht);
\r
779 return JIM_OK; /* never fails */
\r
782 Jim_HashEntry *Jim_FindHashEntry(Jim_HashTable *ht, const void *key)
\r
787 if (ht->size == 0) return NULL;
\r
788 h = Jim_HashKey(ht, key) & ht->sizemask;
\r
791 if (Jim_CompareHashKeys(ht, key, he->key))
\r
798 Jim_HashTableIterator *Jim_GetHashTableIterator(Jim_HashTable *ht)
\r
800 Jim_HashTableIterator *iter = Jim_Alloc(sizeof(*iter));
\r
804 iter->entry = NULL;
\r
805 iter->nextEntry = NULL;
\r
809 Jim_HashEntry *Jim_NextHashEntry(Jim_HashTableIterator *iter)
\r
812 if (iter->entry == NULL) {
\r
815 (signed)iter->ht->size) break;
\r
816 iter->entry = iter->ht->table[iter->index];
\r
818 iter->entry = iter->nextEntry;
\r
821 /* We need to save the 'next' here, the iterator user
\r
822 * may delete the entry we are returning. */
\r
823 iter->nextEntry = iter->entry->next;
\r
824 return iter->entry;
\r
830 /* ------------------------- private functions ------------------------------ */
\r
832 /* Expand the hash table if needed */
\r
833 static int JimExpandHashTableIfNeeded(Jim_HashTable *ht)
\r
835 /* If the hash table is empty expand it to the intial size,
\r
836 * if the table is "full" dobule its size. */
\r
838 return Jim_ExpandHashTable(ht, JIM_HT_INITIAL_SIZE);
\r
839 if (ht->size == ht->used)
\r
840 return Jim_ExpandHashTable(ht, ht->size*2);
\r
844 /* Our hash table capability is a power of two */
\r
845 static unsigned int JimHashTableNextPower(unsigned int size)
\r
847 unsigned int i = JIM_HT_INITIAL_SIZE;
\r
849 if (size >= 2147483648U)
\r
850 return 2147483648U;
\r
858 /* Returns the index of a free slot that can be populated with
\r
859 * an hash entry for the given 'key'.
\r
860 * If the key already exists, -1 is returned. */
\r
861 static int JimInsertHashEntry(Jim_HashTable *ht, const void *key)
\r
866 /* Expand the hashtable if needed */
\r
867 if (JimExpandHashTableIfNeeded(ht) == JIM_ERR)
\r
869 /* Compute the key hash value */
\r
870 h = Jim_HashKey(ht, key) & ht->sizemask;
\r
871 /* Search if this slot does not already contain the given key */
\r
874 if (Jim_CompareHashKeys(ht, key, he->key))
\r
881 /* ----------------------- StringCopy Hash Table Type ------------------------*/
\r
883 static unsigned int JimStringCopyHTHashFunction(const void *key)
\r
885 return Jim_GenHashFunction(key, strlen(key));
\r
888 static const void *JimStringCopyHTKeyDup(void *privdata, const void *key)
\r
890 int len = strlen(key);
\r
891 char *copy = Jim_Alloc(len+1);
\r
892 JIM_NOTUSED(privdata);
\r
894 memcpy(copy, key, len);
\r
899 static void *JimStringKeyValCopyHTValDup(void *privdata, const void *val)
\r
901 int len = strlen(val);
\r
902 char *copy = Jim_Alloc(len+1);
\r
903 JIM_NOTUSED(privdata);
\r
905 memcpy(copy, val, len);
\r
910 static int JimStringCopyHTKeyCompare(void *privdata, const void *key1,
\r
913 JIM_NOTUSED(privdata);
\r
915 return strcmp(key1, key2) == 0;
\r
918 static void JimStringCopyHTKeyDestructor(void *privdata, const void *key)
\r
920 JIM_NOTUSED(privdata);
\r
922 Jim_Free((void*)key); /* ATTENTION: const cast */
\r
925 static void JimStringKeyValCopyHTValDestructor(void *privdata, void *val)
\r
927 JIM_NOTUSED(privdata);
\r
929 Jim_Free((void*)val); /* ATTENTION: const cast */
\r
932 static Jim_HashTableType JimStringCopyHashTableType = {
\r
933 JimStringCopyHTHashFunction, /* hash function */
\r
934 JimStringCopyHTKeyDup, /* key dup */
\r
935 NULL, /* val dup */
\r
936 JimStringCopyHTKeyCompare, /* key compare */
\r
937 JimStringCopyHTKeyDestructor, /* key destructor */
\r
938 NULL /* val destructor */
\r
941 /* This is like StringCopy but does not auto-duplicate the key.
\r
942 * It's used for intepreter's shared strings. */
\r
943 static Jim_HashTableType JimSharedStringsHashTableType = {
\r
944 JimStringCopyHTHashFunction, /* hash function */
\r
945 NULL, /* key dup */
\r
946 NULL, /* val dup */
\r
947 JimStringCopyHTKeyCompare, /* key compare */
\r
948 JimStringCopyHTKeyDestructor, /* key destructor */
\r
949 NULL /* val destructor */
\r
952 /* This is like StringCopy but also automatically handle dynamic
\r
953 * allocated C strings as values. */
\r
954 static Jim_HashTableType JimStringKeyValCopyHashTableType = {
\r
955 JimStringCopyHTHashFunction, /* hash function */
\r
956 JimStringCopyHTKeyDup, /* key dup */
\r
957 JimStringKeyValCopyHTValDup, /* val dup */
\r
958 JimStringCopyHTKeyCompare, /* key compare */
\r
959 JimStringCopyHTKeyDestructor, /* key destructor */
\r
960 JimStringKeyValCopyHTValDestructor, /* val destructor */
\r
963 typedef struct AssocDataValue {
\r
964 Jim_InterpDeleteProc *delProc;
\r
968 static void JimAssocDataHashTableValueDestructor(void *privdata, void *data)
\r
970 AssocDataValue *assocPtr = (AssocDataValue *)data;
\r
971 if (assocPtr->delProc != NULL)
\r
972 assocPtr->delProc((Jim_Interp *)privdata, assocPtr->data);
\r
976 static Jim_HashTableType JimAssocDataHashTableType = {
\r
977 JimStringCopyHTHashFunction, /* hash function */
\r
978 JimStringCopyHTKeyDup, /* key dup */
\r
979 NULL, /* val dup */
\r
980 JimStringCopyHTKeyCompare, /* key compare */
\r
981 JimStringCopyHTKeyDestructor, /* key destructor */
\r
982 JimAssocDataHashTableValueDestructor /* val destructor */
\r
985 /* -----------------------------------------------------------------------------
\r
986 * Stack - This is a simple generic stack implementation. It is used for
\r
987 * example in the 'expr' expression compiler.
\r
988 * ---------------------------------------------------------------------------*/
\r
989 void Jim_InitStack(Jim_Stack *stack)
\r
993 stack->vector = NULL;
\r
996 void Jim_FreeStack(Jim_Stack *stack)
\r
998 Jim_Free(stack->vector);
\r
1001 int Jim_StackLen(Jim_Stack *stack)
\r
1003 return stack->len;
\r
1006 void Jim_StackPush(Jim_Stack *stack, void *element) {
\r
1007 int neededLen = stack->len+1;
\r
1008 if (neededLen > stack->maxlen) {
\r
1009 stack->maxlen = neededLen*2;
\r
1010 stack->vector = Jim_Realloc(stack->vector, sizeof(void*)*stack->maxlen);
\r
1012 stack->vector[stack->len] = element;
\r
1016 void *Jim_StackPop(Jim_Stack *stack)
\r
1018 if (stack->len == 0) return NULL;
\r
1020 return stack->vector[stack->len];
\r
1023 void *Jim_StackPeek(Jim_Stack *stack)
\r
1025 if (stack->len == 0) return NULL;
\r
1026 return stack->vector[stack->len-1];
\r
1029 void Jim_FreeStackElements(Jim_Stack *stack, void (*freeFunc)(void *ptr))
\r
1033 for (i = 0; i < stack->len; i++)
\r
1034 freeFunc(stack->vector[i]);
\r
1037 /* -----------------------------------------------------------------------------
\r
1039 * ---------------------------------------------------------------------------*/
\r
1042 #define JIM_TT_NONE -1 /* No token returned */
\r
1043 #define JIM_TT_STR 0 /* simple string */
\r
1044 #define JIM_TT_ESC 1 /* string that needs escape chars conversion */
\r
1045 #define JIM_TT_VAR 2 /* var substitution */
\r
1046 #define JIM_TT_DICTSUGAR 3 /* Syntax sugar for [dict get], $foo(bar) */
\r
1047 #define JIM_TT_CMD 4 /* command substitution */
\r
1048 #define JIM_TT_SEP 5 /* word separator */
\r
1049 #define JIM_TT_EOL 6 /* line separator */
\r
1051 /* Additional token types needed for expressions */
\r
1052 #define JIM_TT_SUBEXPR_START 7
\r
1053 #define JIM_TT_SUBEXPR_END 8
\r
1054 #define JIM_TT_EXPR_NUMBER 9
\r
1055 #define JIM_TT_EXPR_OPERATOR 10
\r
1057 /* Parser states */
\r
1058 #define JIM_PS_DEF 0 /* Default state */
\r
1059 #define JIM_PS_QUOTE 1 /* Inside "" */
\r
1061 /* Parser context structure. The same context is used both to parse
\r
1062 * Tcl scripts and lists. */
\r
1063 struct JimParserCtx {
\r
1064 const char *prg; /* Program text */
\r
1065 const char *p; /* Pointer to the point of the program we are parsing */
\r
1066 int len; /* Left length of 'prg' */
\r
1067 int linenr; /* Current line number */
\r
1068 const char *tstart;
\r
1069 const char *tend; /* Returned token is at tstart-tend in 'prg'. */
\r
1070 int tline; /* Line number of the returned token */
\r
1071 int tt; /* Token type */
\r
1072 int eof; /* Non zero if EOF condition is true. */
\r
1073 int state; /* Parser state */
\r
1074 int comment; /* Non zero if the next chars may be a comment. */
\r
1077 #define JimParserEof(c) ((c)->eof)
\r
1078 #define JimParserTstart(c) ((c)->tstart)
\r
1079 #define JimParserTend(c) ((c)->tend)
\r
1080 #define JimParserTtype(c) ((c)->tt)
\r
1081 #define JimParserTline(c) ((c)->tline)
\r
1083 static int JimParseScript(struct JimParserCtx *pc);
\r
1084 static int JimParseSep(struct JimParserCtx *pc);
\r
1085 static int JimParseEol(struct JimParserCtx *pc);
\r
1086 static int JimParseCmd(struct JimParserCtx *pc);
\r
1087 static int JimParseVar(struct JimParserCtx *pc);
\r
1088 static int JimParseBrace(struct JimParserCtx *pc);
\r
1089 static int JimParseStr(struct JimParserCtx *pc);
\r
1090 static int JimParseComment(struct JimParserCtx *pc);
\r
1091 static char *JimParserGetToken(struct JimParserCtx *pc,
\r
1092 int *lenPtr, int *typePtr, int *linePtr);
\r
1094 /* Initialize a parser context.
\r
1095 * 'prg' is a pointer to the program text, linenr is the line
\r
1096 * number of the first line contained in the program. */
\r
1097 void JimParserInit(struct JimParserCtx *pc, const char *prg,
\r
1098 int len, int linenr)
\r
1103 pc->tstart = NULL;
\r
1106 pc->tt = JIM_TT_NONE;
\r
1108 pc->state = JIM_PS_DEF;
\r
1109 pc->linenr = linenr;
\r
1113 int JimParseScript(struct JimParserCtx *pc)
\r
1115 while(1) { /* the while is used to reiterate with continue if needed */
\r
1117 pc->tstart = pc->p;
\r
1118 pc->tend = pc->p-1;
\r
1119 pc->tline = pc->linenr;
\r
1120 pc->tt = JIM_TT_EOL;
\r
1124 switch(*(pc->p)) {
\r
1126 if (*(pc->p+1) == '\n')
\r
1127 return JimParseSep(pc);
\r
1130 return JimParseStr(pc);
\r
1136 if (pc->state == JIM_PS_DEF)
\r
1137 return JimParseSep(pc);
\r
1140 return JimParseStr(pc);
\r
1146 if (pc->state == JIM_PS_DEF)
\r
1147 return JimParseEol(pc);
\r
1149 return JimParseStr(pc);
\r
1153 return JimParseCmd(pc);
\r
1157 if (JimParseVar(pc) == JIM_ERR) {
\r
1158 pc->tstart = pc->tend = pc->p++; pc->len--;
\r
1159 pc->tline = pc->linenr;
\r
1160 pc->tt = JIM_TT_STR;
\r
1166 if (pc->comment) {
\r
1167 JimParseComment(pc);
\r
1170 return JimParseStr(pc);
\r
1174 return JimParseStr(pc);
\r
1181 int JimParseSep(struct JimParserCtx *pc)
\r
1183 pc->tstart = pc->p;
\r
1184 pc->tline = pc->linenr;
\r
1185 while (*pc->p == ' ' || *pc->p == '\t' || *pc->p == '\r' ||
\r
1186 (*pc->p == '\\' && *(pc->p+1) == '\n')) {
\r
1187 if (*pc->p == '\\') {
\r
1188 pc->p++; pc->len--;
\r
1191 pc->p++; pc->len--;
\r
1193 pc->tend = pc->p-1;
\r
1194 pc->tt = JIM_TT_SEP;
\r
1198 int JimParseEol(struct JimParserCtx *pc)
\r
1200 pc->tstart = pc->p;
\r
1201 pc->tline = pc->linenr;
\r
1202 while (*pc->p == ' ' || *pc->p == '\n' ||
\r
1203 *pc->p == '\t' || *pc->p == '\r' || *pc->p == ';') {
\r
1204 if (*pc->p == '\n')
\r
1206 pc->p++; pc->len--;
\r
1208 pc->tend = pc->p-1;
\r
1209 pc->tt = JIM_TT_EOL;
\r
1213 /* Todo. Don't stop if ']' appears inside {} or quoted.
\r
1214 * Also should handle the case of puts [string length "]"] */
\r
1215 int JimParseCmd(struct JimParserCtx *pc)
\r
1220 pc->tstart = ++pc->p; pc->len--;
\r
1221 pc->tline = pc->linenr;
\r
1223 if (pc->len == 0) {
\r
1225 } else if (*pc->p == '[' && blevel == 0) {
\r
1227 } else if (*pc->p == ']' && blevel == 0) {
\r
1229 if (!level) break;
\r
1230 } else if (*pc->p == '\\') {
\r
1231 pc->p++; pc->len--;
\r
1232 } else if (*pc->p == '{') {
\r
1234 } else if (*pc->p == '}') {
\r
1237 } else if (*pc->p == '\n')
\r
1239 pc->p++; pc->len--;
\r
1241 pc->tend = pc->p-1;
\r
1242 pc->tt = JIM_TT_CMD;
\r
1243 if (*pc->p == ']') {
\r
1244 pc->p++; pc->len--;
\r
1249 int JimParseVar(struct JimParserCtx *pc)
\r
1251 int brace = 0, stop = 0, ttype = JIM_TT_VAR;
\r
1253 pc->tstart = ++pc->p; pc->len--; /* skip the $ */
\r
1254 pc->tline = pc->linenr;
\r
1255 if (*pc->p == '{') {
\r
1256 pc->tstart = ++pc->p; pc->len--;
\r
1261 if (*pc->p == '}' || pc->len == 0) {
\r
1266 else if (*pc->p == '\n')
\r
1268 pc->p++; pc->len--;
\r
1271 pc->tend = pc->p-1;
\r
1273 pc->tend = pc->p-2;
\r
1276 if (!((*pc->p >= 'a' && *pc->p <= 'z') ||
\r
1277 (*pc->p >= 'A' && *pc->p <= 'Z') ||
\r
1278 (*pc->p >= '0' && *pc->p <= '9') || *pc->p == '_'))
\r
1281 pc->p++; pc->len--;
\r
1284 /* Parse [dict get] syntax sugar. */
\r
1285 if (*pc->p == '(') {
\r
1286 while (*pc->p != ')' && pc->len) {
\r
1287 pc->p++; pc->len--;
\r
1288 if (*pc->p == '\\' && pc->len >= 2) {
\r
1289 pc->p += 2; pc->len -= 2;
\r
1292 if (*pc->p != '\0') {
\r
1293 pc->p++; pc->len--;
\r
1295 ttype = JIM_TT_DICTSUGAR;
\r
1297 pc->tend = pc->p-1;
\r
1299 /* Check if we parsed just the '$' character.
\r
1300 * That's not a variable so an error is returned
\r
1301 * to tell the state machine to consider this '$' just
\r
1303 if (pc->tstart == pc->p) {
\r
1304 pc->p--; pc->len++;
\r
1311 int JimParseBrace(struct JimParserCtx *pc)
\r
1315 pc->tstart = ++pc->p; pc->len--;
\r
1316 pc->tline = pc->linenr;
\r
1318 if (*pc->p == '\\' && pc->len >= 2) {
\r
1319 pc->p++; pc->len--;
\r
1320 if (*pc->p == '\n')
\r
1322 } else if (*pc->p == '{') {
\r
1324 } else if (pc->len == 0 || *pc->p == '}') {
\r
1326 if (pc->len == 0 || level == 0) {
\r
1327 pc->tend = pc->p-1;
\r
1328 if (pc->len != 0) {
\r
1329 pc->p++; pc->len--;
\r
1331 pc->tt = JIM_TT_STR;
\r
1334 } else if (*pc->p == '\n') {
\r
1337 pc->p++; pc->len--;
\r
1339 return JIM_OK; /* unreached */
\r
1342 int JimParseStr(struct JimParserCtx *pc)
\r
1344 int newword = (pc->tt == JIM_TT_SEP || pc->tt == JIM_TT_EOL ||
\r
1345 pc->tt == JIM_TT_NONE || pc->tt == JIM_TT_STR);
\r
1346 if (newword && *pc->p == '{') {
\r
1347 return JimParseBrace(pc);
\r
1348 } else if (newword && *pc->p == '"') {
\r
1349 pc->state = JIM_PS_QUOTE;
\r
1350 pc->p++; pc->len--;
\r
1352 pc->tstart = pc->p;
\r
1353 pc->tline = pc->linenr;
\r
1355 if (pc->len == 0) {
\r
1356 pc->tend = pc->p-1;
\r
1357 pc->tt = JIM_TT_ESC;
\r
1362 if (pc->state == JIM_PS_DEF &&
\r
1363 *(pc->p+1) == '\n') {
\r
1364 pc->tend = pc->p-1;
\r
1365 pc->tt = JIM_TT_ESC;
\r
1368 if (pc->len >= 2) {
\r
1369 pc->p++; pc->len--;
\r
1374 pc->tend = pc->p-1;
\r
1375 pc->tt = JIM_TT_ESC;
\r
1382 if (pc->state == JIM_PS_DEF) {
\r
1383 pc->tend = pc->p-1;
\r
1384 pc->tt = JIM_TT_ESC;
\r
1386 } else if (*pc->p == '\n') {
\r
1391 if (pc->state == JIM_PS_QUOTE) {
\r
1392 pc->tend = pc->p-1;
\r
1393 pc->tt = JIM_TT_ESC;
\r
1394 pc->p++; pc->len--;
\r
1395 pc->state = JIM_PS_DEF;
\r
1400 pc->p++; pc->len--;
\r
1402 return JIM_OK; /* unreached */
\r
1405 int JimParseComment(struct JimParserCtx *pc)
\r
1408 if (*pc->p == '\n') {
\r
1410 if (*(pc->p-1) != '\\') {
\r
1411 pc->p++; pc->len--;
\r
1415 pc->p++; pc->len--;
\r
1420 /* xdigitval and odigitval are helper functions for JimParserGetToken() */
\r
1421 static int xdigitval(int c)
\r
1423 if (c >= '0' && c <= '9') return c-'0';
\r
1424 if (c >= 'a' && c <= 'f') return c-'a'+10;
\r
1425 if (c >= 'A' && c <= 'F') return c-'A'+10;
\r
1429 static int odigitval(int c)
\r
1431 if (c >= '0' && c <= '7') return c-'0';
\r
1435 /* Perform Tcl escape substitution of 's', storing the result
\r
1436 * string into 'dest'. The escaped string is guaranteed to
\r
1437 * be the same length or shorted than the source string.
\r
1438 * Slen is the length of the string at 's', if it's -1 the string
\r
1439 * length will be calculated by the function.
\r
1441 * The function returns the length of the resulting string. */
\r
1442 static int JimEscape(char *dest, const char *s, int slen)
\r
1450 for (i = 0; i < slen; i++) {
\r
1454 case 'a': *p++ = 0x7; i++; break;
\r
1455 case 'b': *p++ = 0x8; i++; break;
\r
1456 case 'f': *p++ = 0xc; i++; break;
\r
1457 case 'n': *p++ = 0xa; i++; break;
\r
1458 case 'r': *p++ = 0xd; i++; break;
\r
1459 case 't': *p++ = 0x9; i++; break;
\r
1460 case 'v': *p++ = 0xb; i++; break;
\r
1461 case '\0': *p++ = '\\'; i++; break;
\r
1462 case '\n': *p++ = ' '; i++; break;
\r
1464 if (s[i+1] == 'x') {
\r
1466 int c = xdigitval(s[i+2]);
\r
1473 c = xdigitval(s[i+3]);
\r
1483 } else if (s[i+1] >= '0' && s[i+1] <= '7')
\r
1486 int c = odigitval(s[i+1]);
\r
1488 c = odigitval(s[i+2]);
\r
1495 c = odigitval(s[i+3]);
\r
1521 /* Returns a dynamically allocated copy of the current token in the
\r
1522 * parser context. The function perform conversion of escapes if
\r
1523 * the token is of type JIM_TT_ESC.
\r
1525 * Note that after the conversion, tokens that are grouped with
\r
1526 * braces in the source code, are always recognizable from the
\r
1527 * identical string obtained in a different way from the type.
\r
1529 * For exmple the string:
\r
1533 * will return as first token "expand", of type JIM_TT_STR
\r
1535 * While the string:
\r
1539 * will return as first token "expand", of type JIM_TT_ESC
\r
1541 char *JimParserGetToken(struct JimParserCtx *pc,
\r
1542 int *lenPtr, int *typePtr, int *linePtr)
\r
1544 const char *start, *end;
\r
1548 start = JimParserTstart(pc);
\r
1549 end = JimParserTend(pc);
\r
1550 if (start > end) {
\r
1551 if (lenPtr) *lenPtr = 0;
\r
1552 if (typePtr) *typePtr = JimParserTtype(pc);
\r
1553 if (linePtr) *linePtr = JimParserTline(pc);
\r
1554 token = Jim_Alloc(1);
\r
1558 len = (end-start)+1;
\r
1559 token = Jim_Alloc(len+1);
\r
1560 if (JimParserTtype(pc) != JIM_TT_ESC) {
\r
1561 /* No escape conversion needed? Just copy it. */
\r
1562 memcpy(token, start, len);
\r
1563 token[len] = '\0';
\r
1565 /* Else convert the escape chars. */
\r
1566 len = JimEscape(token, start, len);
\r
1568 if (lenPtr) *lenPtr = len;
\r
1569 if (typePtr) *typePtr = JimParserTtype(pc);
\r
1570 if (linePtr) *linePtr = JimParserTline(pc);
\r
1574 /* The following functin is not really part of the parsing engine of Jim,
\r
1575 * but it somewhat related. Given an string and its length, it tries
\r
1576 * to guess if the script is complete or there are instead " " or { }
\r
1577 * open and not completed. This is useful for interactive shells
\r
1578 * implementation and for [info complete].
\r
1580 * If 'stateCharPtr' != NULL, the function stores ' ' on complete script,
\r
1581 * '{' on scripts incomplete missing one or more '}' to be balanced.
\r
1582 * '"' on scripts incomplete missing a '"' char.
\r
1584 * If the script is complete, 1 is returned, otherwise 0. */
\r
1585 int Jim_ScriptIsComplete(const char *s, int len, char *stateCharPtr)
\r
1597 if (state == ' ') {
\r
1599 } else if (state == '"') {
\r
1604 if (state == '{') {
\r
1606 } else if (state == ' ') {
\r
1612 if (state == '{') {
\r
1623 *stateCharPtr = state;
\r
1624 return state == ' ';
\r
1627 /* -----------------------------------------------------------------------------
\r
1628 * Tcl Lists parsing
\r
1629 * ---------------------------------------------------------------------------*/
\r
1630 static int JimParseListSep(struct JimParserCtx *pc);
\r
1631 static int JimParseListStr(struct JimParserCtx *pc);
\r
1633 int JimParseList(struct JimParserCtx *pc)
\r
1635 if (pc->len == 0) {
\r
1636 pc->tstart = pc->tend = pc->p;
\r
1637 pc->tline = pc->linenr;
\r
1638 pc->tt = JIM_TT_EOL;
\r
1647 if (pc->state == JIM_PS_DEF)
\r
1648 return JimParseListSep(pc);
\r
1650 return JimParseListStr(pc);
\r
1653 return JimParseListStr(pc);
\r
1659 int JimParseListSep(struct JimParserCtx *pc)
\r
1661 pc->tstart = pc->p;
\r
1662 pc->tline = pc->linenr;
\r
1663 while (*pc->p == ' ' || *pc->p == '\t' || *pc->p == '\r' || *pc->p == '\n')
\r
1665 pc->p++; pc->len--;
\r
1667 pc->tend = pc->p-1;
\r
1668 pc->tt = JIM_TT_SEP;
\r
1672 int JimParseListStr(struct JimParserCtx *pc)
\r
1674 int newword = (pc->tt == JIM_TT_SEP || pc->tt == JIM_TT_EOL ||
\r
1675 pc->tt == JIM_TT_NONE);
\r
1676 if (newword && *pc->p == '{') {
\r
1677 return JimParseBrace(pc);
\r
1678 } else if (newword && *pc->p == '"') {
\r
1679 pc->state = JIM_PS_QUOTE;
\r
1680 pc->p++; pc->len--;
\r
1682 pc->tstart = pc->p;
\r
1683 pc->tline = pc->linenr;
\r
1685 if (pc->len == 0) {
\r
1686 pc->tend = pc->p-1;
\r
1687 pc->tt = JIM_TT_ESC;
\r
1692 pc->p++; pc->len--;
\r
1698 if (pc->state == JIM_PS_DEF) {
\r
1699 pc->tend = pc->p-1;
\r
1700 pc->tt = JIM_TT_ESC;
\r
1702 } else if (*pc->p == '\n') {
\r
1707 if (pc->state == JIM_PS_QUOTE) {
\r
1708 pc->tend = pc->p-1;
\r
1709 pc->tt = JIM_TT_ESC;
\r
1710 pc->p++; pc->len--;
\r
1711 pc->state = JIM_PS_DEF;
\r
1716 pc->p++; pc->len--;
\r
1718 return JIM_OK; /* unreached */
\r
1721 /* -----------------------------------------------------------------------------
\r
1722 * Jim_Obj related functions
\r
1723 * ---------------------------------------------------------------------------*/
\r
1725 /* Return a new initialized object. */
\r
1726 Jim_Obj *Jim_NewObj(Jim_Interp *interp)
\r
1730 /* -- Check if there are objects in the free list -- */
\r
1731 if (interp->freeList != NULL) {
\r
1732 /* -- Unlink the object from the free list -- */
\r
1733 objPtr = interp->freeList;
\r
1734 interp->freeList = objPtr->nextObjPtr;
\r
1736 /* -- No ready to use objects: allocate a new one -- */
\r
1737 objPtr = Jim_Alloc(sizeof(*objPtr));
\r
1740 /* Object is returned with refCount of 0. Every
\r
1741 * kind of GC implemented should take care to don't try
\r
1742 * to scan objects with refCount == 0. */
\r
1743 objPtr->refCount = 0;
\r
1744 /* All the other fields are left not initialized to save time.
\r
1745 * The caller will probably want set they to the right
\r
1746 * value anyway. */
\r
1748 /* -- Put the object into the live list -- */
\r
1749 objPtr->prevObjPtr = NULL;
\r
1750 objPtr->nextObjPtr = interp->liveList;
\r
1751 if (interp->liveList)
\r
1752 interp->liveList->prevObjPtr = objPtr;
\r
1753 interp->liveList = objPtr;
\r
1758 /* Free an object. Actually objects are never freed, but
\r
1759 * just moved to the free objects list, where they will be
\r
1760 * reused by Jim_NewObj(). */
\r
1761 void Jim_FreeObj(Jim_Interp *interp, Jim_Obj *objPtr)
\r
1763 /* Check if the object was already freed, panic. */
\r
1764 if (objPtr->refCount != 0) {
\r
1765 Jim_Panic(interp,"!!!Object %p freed with bad refcount %d", objPtr,
\r
1766 objPtr->refCount);
\r
1768 /* Free the internal representation */
\r
1769 Jim_FreeIntRep(interp, objPtr);
\r
1770 /* Free the string representation */
\r
1771 if (objPtr->bytes != NULL) {
\r
1772 if (objPtr->bytes != JimEmptyStringRep)
\r
1773 Jim_Free(objPtr->bytes);
\r
1775 /* Unlink the object from the live objects list */
\r
1776 if (objPtr->prevObjPtr)
\r
1777 objPtr->prevObjPtr->nextObjPtr = objPtr->nextObjPtr;
\r
1778 if (objPtr->nextObjPtr)
\r
1779 objPtr->nextObjPtr->prevObjPtr = objPtr->prevObjPtr;
\r
1780 if (interp->liveList == objPtr)
\r
1781 interp->liveList = objPtr->nextObjPtr;
\r
1782 /* Link the object into the free objects list */
\r
1783 objPtr->prevObjPtr = NULL;
\r
1784 objPtr->nextObjPtr = interp->freeList;
\r
1785 if (interp->freeList)
\r
1786 interp->freeList->prevObjPtr = objPtr;
\r
1787 interp->freeList = objPtr;
\r
1788 objPtr->refCount = -1;
\r
1791 /* Invalidate the string representation of an object. */
\r
1792 void Jim_InvalidateStringRep(Jim_Obj *objPtr)
\r
1794 if (objPtr->bytes != NULL) {
\r
1795 if (objPtr->bytes != JimEmptyStringRep)
\r
1796 Jim_Free(objPtr->bytes);
\r
1798 objPtr->bytes = NULL;
\r
1801 #define Jim_SetStringRep(o, b, l) \
\r
1802 do { (o)->bytes = b; (o)->length = l; } while (0)
\r
1804 /* Set the initial string representation for an object.
\r
1805 * Does not try to free an old one. */
\r
1806 void Jim_InitStringRep(Jim_Obj *objPtr, const char *bytes, int length)
\r
1808 if (length == 0) {
\r
1809 objPtr->bytes = JimEmptyStringRep;
\r
1810 objPtr->length = 0;
\r
1812 objPtr->bytes = Jim_Alloc(length+1);
\r
1813 objPtr->length = length;
\r
1814 memcpy(objPtr->bytes, bytes, length);
\r
1815 objPtr->bytes[length] = '\0';
\r
1819 /* Duplicate an object. The returned object has refcount = 0. */
\r
1820 Jim_Obj *Jim_DuplicateObj(Jim_Interp *interp, Jim_Obj *objPtr)
\r
1824 dupPtr = Jim_NewObj(interp);
\r
1825 if (objPtr->bytes == NULL) {
\r
1826 /* Object does not have a valid string representation. */
\r
1827 dupPtr->bytes = NULL;
\r
1829 Jim_InitStringRep(dupPtr, objPtr->bytes, objPtr->length);
\r
1831 if (objPtr->typePtr != NULL) {
\r
1832 if (objPtr->typePtr->dupIntRepProc == NULL) {
\r
1833 dupPtr->internalRep = objPtr->internalRep;
\r
1835 objPtr->typePtr->dupIntRepProc(interp, objPtr, dupPtr);
\r
1837 dupPtr->typePtr = objPtr->typePtr;
\r
1839 dupPtr->typePtr = NULL;
\r
1844 /* Return the string representation for objPtr. If the object
\r
1845 * string representation is invalid, calls the method to create
\r
1846 * a new one starting from the internal representation of the object. */
\r
1847 const char *Jim_GetString(Jim_Obj *objPtr, int *lenPtr)
\r
1849 if (objPtr->bytes == NULL) {
\r
1850 /* Invalid string repr. Generate it. */
\r
1851 if (objPtr->typePtr->updateStringProc == NULL) {
\r
1852 Jim_Panic(NULL,"UpdataStringProc called against '%s' type.",
\r
1853 objPtr->typePtr->name);
\r
1855 objPtr->typePtr->updateStringProc(objPtr);
\r
1858 *lenPtr = objPtr->length;
\r
1859 return objPtr->bytes;
\r
1862 /* Just returns the length of the object's string rep */
\r
1863 int Jim_Length(Jim_Obj *objPtr)
\r
1867 Jim_GetString(objPtr, &len);
\r
1871 /* -----------------------------------------------------------------------------
\r
1873 * ---------------------------------------------------------------------------*/
\r
1874 static void DupStringInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
1875 static int SetStringFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
1877 static Jim_ObjType stringObjType = {
\r
1880 DupStringInternalRep,
\r
1882 JIM_TYPE_REFERENCES,
\r
1885 void DupStringInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
1887 JIM_NOTUSED(interp);
\r
1889 /* This is a bit subtle: the only caller of this function
\r
1890 * should be Jim_DuplicateObj(), that will copy the
\r
1891 * string representaion. After the copy, the duplicated
\r
1892 * object will not have more room in teh buffer than
\r
1893 * srcPtr->length bytes. So we just set it to length. */
\r
1894 dupPtr->internalRep.strValue.maxLength = srcPtr->length;
\r
1897 int SetStringFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
1899 /* Get a fresh string representation. */
\r
1900 (void) Jim_GetString(objPtr, NULL);
\r
1901 /* Free any other internal representation. */
\r
1902 Jim_FreeIntRep(interp, objPtr);
\r
1903 /* Set it as string, i.e. just set the maxLength field. */
\r
1904 objPtr->typePtr = &stringObjType;
\r
1905 objPtr->internalRep.strValue.maxLength = objPtr->length;
\r
1909 Jim_Obj *Jim_NewStringObj(Jim_Interp *interp, const char *s, int len)
\r
1911 Jim_Obj *objPtr = Jim_NewObj(interp);
\r
1915 /* Alloc/Set the string rep. */
\r
1917 objPtr->bytes = JimEmptyStringRep;
\r
1918 objPtr->length = 0;
\r
1920 objPtr->bytes = Jim_Alloc(len+1);
\r
1921 objPtr->length = len;
\r
1922 memcpy(objPtr->bytes, s, len);
\r
1923 objPtr->bytes[len] = '\0';
\r
1926 /* No typePtr field for the vanilla string object. */
\r
1927 objPtr->typePtr = NULL;
\r
1931 /* This version does not try to duplicate the 's' pointer, but
\r
1932 * use it directly. */
\r
1933 Jim_Obj *Jim_NewStringObjNoAlloc(Jim_Interp *interp, char *s, int len)
\r
1935 Jim_Obj *objPtr = Jim_NewObj(interp);
\r
1939 Jim_SetStringRep(objPtr, s, len);
\r
1940 objPtr->typePtr = NULL;
\r
1944 /* Low-level string append. Use it only against objects
\r
1945 * of type "string". */
\r
1946 void StringAppendString(Jim_Obj *objPtr, const char *str, int len)
\r
1951 len = strlen(str);
\r
1952 needlen = objPtr->length + len;
\r
1953 if (objPtr->internalRep.strValue.maxLength < needlen ||
\r
1954 objPtr->internalRep.strValue.maxLength == 0) {
\r
1955 if (objPtr->bytes == JimEmptyStringRep) {
\r
1956 objPtr->bytes = Jim_Alloc((needlen*2)+1);
\r
1958 objPtr->bytes = Jim_Realloc(objPtr->bytes, (needlen*2)+1);
\r
1960 objPtr->internalRep.strValue.maxLength = needlen*2;
\r
1962 memcpy(objPtr->bytes + objPtr->length, str, len);
\r
1963 objPtr->bytes[objPtr->length+len] = '\0';
\r
1964 objPtr->length += len;
\r
1967 /* Low-level wrapper to append an object. */
\r
1968 void StringAppendObj(Jim_Obj *objPtr, Jim_Obj *appendObjPtr)
\r
1973 str = Jim_GetString(appendObjPtr, &len);
\r
1974 StringAppendString(objPtr, str, len);
\r
1977 /* Higher level API to append strings to objects. */
\r
1978 void Jim_AppendString(Jim_Interp *interp, Jim_Obj *objPtr, const char *str,
\r
1981 if (Jim_IsShared(objPtr))
\r
1982 Jim_Panic(interp,"Jim_AppendString called with shared object");
\r
1983 if (objPtr->typePtr != &stringObjType)
\r
1984 SetStringFromAny(interp, objPtr);
\r
1985 StringAppendString(objPtr, str, len);
\r
1988 void Jim_AppendObj(Jim_Interp *interp, Jim_Obj *objPtr,
\r
1989 Jim_Obj *appendObjPtr)
\r
1994 str = Jim_GetString(appendObjPtr, &len);
\r
1995 Jim_AppendString(interp, objPtr, str, len);
\r
1998 void Jim_AppendStrings(Jim_Interp *interp, Jim_Obj *objPtr, ...)
\r
2002 if (objPtr->typePtr != &stringObjType)
\r
2003 SetStringFromAny(interp, objPtr);
\r
2004 va_start(ap, objPtr);
\r
2006 char *s = va_arg(ap, char*);
\r
2008 if (s == NULL) break;
\r
2009 Jim_AppendString(interp, objPtr, s, -1);
\r
2014 int Jim_StringEqObj(Jim_Obj *aObjPtr, Jim_Obj *bObjPtr, int nocase)
\r
2016 const char *aStr, *bStr;
\r
2017 int aLen, bLen, i;
\r
2019 if (aObjPtr == bObjPtr) return 1;
\r
2020 aStr = Jim_GetString(aObjPtr, &aLen);
\r
2021 bStr = Jim_GetString(bObjPtr, &bLen);
\r
2022 if (aLen != bLen) return 0;
\r
2024 return memcmp(aStr, bStr, aLen) == 0;
\r
2025 for (i = 0; i < aLen; i++) {
\r
2026 if (tolower((int)aStr[i]) != tolower((int)bStr[i]))
\r
2032 int Jim_StringMatchObj(Jim_Obj *patternObjPtr, Jim_Obj *objPtr,
\r
2035 const char *pattern, *string;
\r
2036 int patternLen, stringLen;
\r
2038 pattern = Jim_GetString(patternObjPtr, &patternLen);
\r
2039 string = Jim_GetString(objPtr, &stringLen);
\r
2040 return JimStringMatch(pattern, patternLen, string, stringLen, nocase);
\r
2043 int Jim_StringCompareObj(Jim_Obj *firstObjPtr,
\r
2044 Jim_Obj *secondObjPtr, int nocase)
\r
2046 const char *s1, *s2;
\r
2049 s1 = Jim_GetString(firstObjPtr, &l1);
\r
2050 s2 = Jim_GetString(secondObjPtr, &l2);
\r
2051 return JimStringCompare(s1, l1, s2, l2, nocase);
\r
2054 /* Convert a range, as returned by Jim_GetRange(), into
\r
2055 * an absolute index into an object of the specified length.
\r
2056 * This function may return negative values, or values
\r
2057 * bigger or equal to the length of the list if the index
\r
2058 * is out of range. */
\r
2059 static int JimRelToAbsIndex(int len, int index)
\r
2062 return len + index;
\r
2066 /* Convert a pair of index as normalize by JimRelToAbsIndex(),
\r
2067 * into a range stored in *firstPtr, *lastPtr, *rangeLenPtr, suitable
\r
2068 * for implementation of commands like [string range] and [lrange].
\r
2070 * The resulting range is guaranteed to address valid elements of
\r
2071 * the structure. */
\r
2072 static void JimRelToAbsRange(int len, int first, int last,
\r
2073 int *firstPtr, int *lastPtr, int *rangeLenPtr)
\r
2077 if (first > last) {
\r
2080 rangeLen = last-first+1;
\r
2083 rangeLen += first;
\r
2086 if (last >= len) {
\r
2087 rangeLen -= (last-(len-1));
\r
2092 if (rangeLen < 0) rangeLen = 0;
\r
2094 *firstPtr = first;
\r
2096 *rangeLenPtr = rangeLen;
\r
2099 Jim_Obj *Jim_StringRangeObj(Jim_Interp *interp,
\r
2100 Jim_Obj *strObjPtr, Jim_Obj *firstObjPtr, Jim_Obj *lastObjPtr)
\r
2104 int len, rangeLen;
\r
2106 if (Jim_GetIndex(interp, firstObjPtr, &first) != JIM_OK ||
\r
2107 Jim_GetIndex(interp, lastObjPtr, &last) != JIM_OK)
\r
2109 str = Jim_GetString(strObjPtr, &len);
\r
2110 first = JimRelToAbsIndex(len, first);
\r
2111 last = JimRelToAbsIndex(len, last);
\r
2112 JimRelToAbsRange(len, first, last, &first, &last, &rangeLen);
\r
2113 return Jim_NewStringObj(interp, str+first, rangeLen);
\r
2116 static Jim_Obj *JimStringToLower(Jim_Interp *interp, Jim_Obj *strObjPtr)
\r
2118 char *buf = Jim_Alloc(strObjPtr->length+1);
\r
2121 memcpy(buf, strObjPtr->bytes, strObjPtr->length+1);
\r
2122 for (i = 0; i < strObjPtr->length; i++)
\r
2123 buf[i] = tolower(buf[i]);
\r
2124 return Jim_NewStringObjNoAlloc(interp, buf, strObjPtr->length);
\r
2127 static Jim_Obj *JimStringToUpper(Jim_Interp *interp, Jim_Obj *strObjPtr)
\r
2129 char *buf = Jim_Alloc(strObjPtr->length+1);
\r
2132 memcpy(buf, strObjPtr->bytes, strObjPtr->length+1);
\r
2133 for (i = 0; i < strObjPtr->length; i++)
\r
2134 buf[i] = toupper(buf[i]);
\r
2135 return Jim_NewStringObjNoAlloc(interp, buf, strObjPtr->length);
\r
2138 /* This is the core of the [format] command.
\r
2139 * TODO: Export it, make it real... for now only %s and %%
\r
2140 * specifiers supported. */
\r
2141 Jim_Obj *Jim_FormatString(Jim_Interp *interp, Jim_Obj *fmtObjPtr,
\r
2142 int objc, Jim_Obj *const *objv)
\r
2146 Jim_Obj *resObjPtr;
\r
2148 fmt = Jim_GetString(fmtObjPtr, &fmtLen);
\r
2149 resObjPtr = Jim_NewStringObj(interp, "", 0);
\r
2151 const char *p = fmt;
\r
2153 jim_wide wideValue;
\r
2155 while (*fmt != '%' && fmtLen) {
\r
2158 Jim_AppendString(interp, resObjPtr, p, fmt-p);
\r
2161 fmt++; fmtLen--; /* skip '%' */
\r
2162 if (*fmt != '%') {
\r
2164 Jim_FreeNewObj(interp, resObjPtr);
\r
2165 Jim_SetResultString(interp,
\r
2166 "not enough arguments for all format specifiers", -1);
\r
2174 Jim_AppendObj(interp, resObjPtr, objv[0]);
\r
2178 if (Jim_GetWide(interp, objv[0], &wideValue) == JIM_ERR) {
\r
2179 Jim_FreeNewObj(interp, resObjPtr);
\r
2182 c = (char) wideValue;
\r
2183 Jim_AppendString(interp, resObjPtr, &c, 1);
\r
2186 if (Jim_GetWide(interp, objv[0], &wideValue) == JIM_ERR) {
\r
2187 Jim_FreeNewObj(interp, resObjPtr);
\r
2190 Jim_AppendObj(interp, resObjPtr, objv[0]);
\r
2193 Jim_AppendString(interp, resObjPtr, "%" , 1);
\r
2196 spec[0] = *fmt; spec[1] = '\0';
\r
2197 Jim_FreeNewObj(interp, resObjPtr);
\r
2198 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
2199 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
2200 "bad field specifier \"", spec, "\"", NULL);
\r
2209 /* -----------------------------------------------------------------------------
\r
2210 * Compared String Object
\r
2211 * ---------------------------------------------------------------------------*/
\r
2213 /* This is strange object that allows to compare a C literal string
\r
2214 * with a Jim object in very short time if the same comparison is done
\r
2215 * multiple times. For example every time the [if] command is executed,
\r
2216 * Jim has to check if a given argument is "else". This comparions if
\r
2217 * the code has no errors are true most of the times, so we can cache
\r
2218 * inside the object the pointer of the string of the last matching
\r
2219 * comparison. Because most C compilers perform literal sharing,
\r
2220 * so that: char *x = "foo", char *y = "foo", will lead to x == y,
\r
2221 * this works pretty well even if comparisons are at different places
\r
2222 * inside the C code. */
\r
2224 static Jim_ObjType comparedStringObjType = {
\r
2225 "compared-string",
\r
2229 JIM_TYPE_REFERENCES,
\r
2232 /* The only way this object is exposed to the API is via the following
\r
2233 * function. Returns true if the string and the object string repr.
\r
2234 * are the same, otherwise zero is returned.
\r
2236 * Note: this isn't binary safe, but it hardly needs to be.*/
\r
2237 int Jim_CompareStringImmediate(Jim_Interp *interp, Jim_Obj *objPtr,
\r
2240 if (objPtr->typePtr == &comparedStringObjType &&
\r
2241 objPtr->internalRep.ptr == str)
\r
2244 const char *objStr = Jim_GetString(objPtr, NULL);
\r
2245 if (strcmp(str, objStr) != 0) return 0;
\r
2246 if (objPtr->typePtr != &comparedStringObjType) {
\r
2247 Jim_FreeIntRep(interp, objPtr);
\r
2248 objPtr->typePtr = &comparedStringObjType;
\r
2250 objPtr->internalRep.ptr = (char*)str; /*ATTENTION: const cast */
\r
2255 int qsortCompareStringPointers(const void *a, const void *b)
\r
2257 char * const *sa = (char * const *)a;
\r
2258 char * const *sb = (char * const *)b;
\r
2259 return strcmp(*sa, *sb);
\r
2262 int Jim_GetEnum(Jim_Interp *interp, Jim_Obj *objPtr,
\r
2263 const char **tablePtr, int *indexPtr, const char *name, int flags)
\r
2265 const char **entryPtr = NULL;
\r
2266 char **tablePtrSorted;
\r
2270 for (entryPtr = tablePtr, i = 0; *entryPtr != NULL; entryPtr++, i++) {
\r
2271 if (Jim_CompareStringImmediate(interp, objPtr, *entryPtr)) {
\r
2275 count++; /* If nothing matches, this will reach the len of tablePtr */
\r
2277 if (flags & JIM_ERRMSG) {
\r
2280 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
2281 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
2282 "bad ", name, " \"", Jim_GetString(objPtr, NULL), "\": must be one of ",
\r
2284 tablePtrSorted = Jim_Alloc(sizeof(char*)*count);
\r
2285 memcpy(tablePtrSorted, tablePtr, sizeof(char*)*count);
\r
2286 qsort(tablePtrSorted, count, sizeof(char*), qsortCompareStringPointers);
\r
2287 for (i = 0; i < count; i++) {
\r
2288 if (i+1 == count && count > 1)
\r
2289 Jim_AppendString(interp, Jim_GetResult(interp), "or ", -1);
\r
2290 Jim_AppendString(interp, Jim_GetResult(interp),
\r
2291 tablePtrSorted[i], -1);
\r
2293 Jim_AppendString(interp, Jim_GetResult(interp), ", ", -1);
\r
2295 Jim_Free(tablePtrSorted);
\r
2300 /* -----------------------------------------------------------------------------
\r
2303 * This object is just a string from the language point of view, but
\r
2304 * in the internal representation it contains the filename and line number
\r
2305 * where this given token was read. This information is used by
\r
2306 * Jim_EvalObj() if the object passed happens to be of type "source".
\r
2308 * This allows to propagate the information about line numbers and file
\r
2309 * names and give error messages with absolute line numbers.
\r
2311 * Note that this object uses shared strings for filenames, and the
\r
2312 * pointer to the filename together with the line number is taken into
\r
2313 * the space for the "inline" internal represenation of the Jim_Object,
\r
2314 * so there is almost memory zero-overhead.
\r
2316 * Also the object will be converted to something else if the given
\r
2317 * token it represents in the source file is not something to be
\r
2318 * evaluated (not a script), and will be specialized in some other way,
\r
2319 * so the time overhead is alzo null.
\r
2320 * ---------------------------------------------------------------------------*/
\r
2322 static void FreeSourceInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
2323 static void DupSourceInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
2325 static Jim_ObjType sourceObjType = {
\r
2327 FreeSourceInternalRep,
\r
2328 DupSourceInternalRep,
\r
2330 JIM_TYPE_REFERENCES,
\r
2333 void FreeSourceInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
2335 Jim_ReleaseSharedString(interp,
\r
2336 objPtr->internalRep.sourceValue.fileName);
\r
2339 void DupSourceInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
2341 dupPtr->internalRep.sourceValue.fileName =
\r
2342 Jim_GetSharedString(interp,
\r
2343 srcPtr->internalRep.sourceValue.fileName);
\r
2344 dupPtr->internalRep.sourceValue.lineNumber =
\r
2345 dupPtr->internalRep.sourceValue.lineNumber;
\r
2346 dupPtr->typePtr = &sourceObjType;
\r
2349 static void JimSetSourceInfo(Jim_Interp *interp, Jim_Obj *objPtr,
\r
2350 const char *fileName, int lineNumber)
\r
2352 if (Jim_IsShared(objPtr))
\r
2353 Jim_Panic(interp,"JimSetSourceInfo called with shared object");
\r
2354 if (objPtr->typePtr != NULL)
\r
2355 Jim_Panic(interp,"JimSetSourceInfo called with typePtr != NULL");
\r
2356 objPtr->internalRep.sourceValue.fileName =
\r
2357 Jim_GetSharedString(interp, fileName);
\r
2358 objPtr->internalRep.sourceValue.lineNumber = lineNumber;
\r
2359 objPtr->typePtr = &sourceObjType;
\r
2362 /* -----------------------------------------------------------------------------
\r
2364 * ---------------------------------------------------------------------------*/
\r
2366 #define JIM_CMDSTRUCT_EXPAND -1
\r
2368 static void FreeScriptInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
2369 static void DupScriptInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
2370 static int SetScriptFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
2372 static Jim_ObjType scriptObjType = {
\r
2374 FreeScriptInternalRep,
\r
2375 DupScriptInternalRep,
\r
2377 JIM_TYPE_REFERENCES,
\r
2380 /* The ScriptToken structure represents every token into a scriptObj.
\r
2381 * Every token contains an associated Jim_Obj that can be specialized
\r
2382 * by commands operating on it. */
\r
2383 typedef struct ScriptToken {
\r
2389 /* This is the script object internal representation. An array of
\r
2390 * ScriptToken structures, with an associated command structure array.
\r
2391 * The command structure is a pre-computed representation of the
\r
2392 * command length and arguments structure as a simple liner array
\r
2395 * For example the script:
\r
2398 * set $i $x$y [foo]BAR
\r
2400 * will produce a ScriptObj with the following Tokens:
\r
2417 * This is a description of the tokens, separators, and of lines.
\r
2418 * The command structure instead represents the number of arguments
\r
2419 * of every command, followed by the tokens of which every argument
\r
2420 * is composed. So for the example script, the cmdstruct array will
\r
2425 * Because "puts hello" has two args (2), composed of single tokens (1 1)
\r
2426 * While "set $i $x$y [foo]BAR" has four (4) args, the first two
\r
2427 * composed of single tokens (1 1) and the last two of double tokens
\r
2430 * The precomputation of the command structure makes Jim_Eval() faster,
\r
2431 * and simpler because there aren't dynamic lengths / allocations.
\r
2433 * -- {expand} handling --
\r
2435 * Expand is handled in a special way. When a command
\r
2436 * contains at least an argument with the {expand} prefix,
\r
2437 * the command structure presents a -1 before the integer
\r
2438 * describing the number of arguments. This is used in order
\r
2439 * to send the command exection to a different path in case
\r
2440 * of {expand} and guarantee a fast path for the more common
\r
2441 * case. Also, the integers describing the number of tokens
\r
2442 * are expressed with negative sign, to allow for fast check
\r
2443 * of what's an {expand}-prefixed argument and what not.
\r
2445 * For example the command:
\r
2447 * list {expand}{1 2}
\r
2449 * Will produce the following cmdstruct array:
\r
2453 * -- the substFlags field of the structure --
\r
2455 * The scriptObj structure is used to represent both "script" objects
\r
2456 * and "subst" objects. In the second case, the cmdStruct related
\r
2457 * fields are not used at all, but there is an additional field used
\r
2458 * that is 'substFlags': this represents the flags used to turn
\r
2459 * the string into the intenral representation used to perform the
\r
2460 * substitution. If this flags are not what the application requires
\r
2461 * the scriptObj is created again. For example the script:
\r
2463 * subst -nocommands $string
\r
2464 * subst -novariables $string
\r
2466 * Will recreate the internal representation of the $string object
\r
2469 typedef struct ScriptObj {
\r
2470 int len; /* Length as number of tokens. */
\r
2471 int commands; /* number of top-level commands in script. */
\r
2472 ScriptToken *token; /* Tokens array. */
\r
2473 int *cmdStruct; /* commands structure */
\r
2474 int csLen; /* length of the cmdStruct array. */
\r
2475 int substFlags; /* flags used for the compilation of "subst" objects */
\r
2476 int inUse; /* Used to share a ScriptObj. Currently
\r
2477 only used by Jim_EvalObj() as protection against
\r
2478 shimmering of the currently evaluated object. */
\r
2482 void FreeScriptInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
2485 struct ScriptObj *script = (void*) objPtr->internalRep.ptr;
\r
2488 if (script->inUse != 0) return;
\r
2489 for (i = 0; i < script->len; i++) {
\r
2490 if (script->token[i].objPtr != NULL)
\r
2491 Jim_DecrRefCount(interp, script->token[i].objPtr);
\r
2493 Jim_Free(script->token);
\r
2494 Jim_Free(script->cmdStruct);
\r
2495 Jim_Free(script->fileName);
\r
2499 void DupScriptInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
2501 JIM_NOTUSED(interp);
\r
2502 JIM_NOTUSED(srcPtr);
\r
2504 /* Just returns an simple string. */
\r
2505 dupPtr->typePtr = NULL;
\r
2508 /* Add a new token to the internal repr of a script object */
\r
2509 static void ScriptObjAddToken(Jim_Interp *interp, struct ScriptObj *script,
\r
2510 char *strtoken, int len, int type, char *filename, int linenr)
\r
2513 struct ScriptToken *token;
\r
2515 prevtype = (script->len == 0) ? JIM_TT_EOL : \
\r
2516 script->token[script->len-1].type;
\r
2517 /* Skip tokens without meaning, like words separators
\r
2518 * following a word separator or an end of command and
\r
2520 if (prevtype == JIM_TT_EOL) {
\r
2521 if (type == JIM_TT_EOL || type == JIM_TT_SEP) {
\r
2522 Jim_Free(strtoken);
\r
2525 } else if (prevtype == JIM_TT_SEP) {
\r
2526 if (type == JIM_TT_SEP) {
\r
2527 Jim_Free(strtoken);
\r
2529 } else if (type == JIM_TT_EOL) {
\r
2530 /* If an EOL is following by a SEP, drop the previous
\r
2533 Jim_DecrRefCount(interp, script->token[script->len].objPtr);
\r
2535 } else if (prevtype != JIM_TT_EOL && prevtype != JIM_TT_SEP &&
\r
2536 type == JIM_TT_ESC && len == 0)
\r
2538 /* Don't add empty tokens used in interpolation */
\r
2539 Jim_Free(strtoken);
\r
2542 /* Make space for a new istruction */
\r
2544 script->token = Jim_Realloc(script->token,
\r
2545 sizeof(ScriptToken)*script->len);
\r
2546 /* Initialize the new token */
\r
2547 token = script->token+(script->len-1);
\r
2548 token->type = type;
\r
2549 /* Every object is intially as a string, but the
\r
2550 * internal type may be specialized during execution of the
\r
2552 token->objPtr = Jim_NewStringObjNoAlloc(interp, strtoken, len);
\r
2553 /* To add source info to SEP and EOL tokens is useless because
\r
2554 * they will never by called as arguments of Jim_EvalObj(). */
\r
2555 if (filename && type != JIM_TT_SEP && type != JIM_TT_EOL)
\r
2556 JimSetSourceInfo(interp, token->objPtr, filename, linenr);
\r
2557 Jim_IncrRefCount(token->objPtr);
\r
2558 token->linenr = linenr;
\r
2561 /* Add an integer into the command structure field of the script object. */
\r
2562 static void ScriptObjAddInt(struct ScriptObj *script, int val)
\r
2565 script->cmdStruct = Jim_Realloc(script->cmdStruct,
\r
2566 sizeof(int)*script->csLen);
\r
2567 script->cmdStruct[script->csLen-1] = val;
\r
2570 /* Search a Jim_Obj contained in 'script' with the same stinrg repr.
\r
2571 * of objPtr. Search nested script objects recursively. */
\r
2572 static Jim_Obj *ScriptSearchLiteral(Jim_Interp *interp, ScriptObj *script,
\r
2573 ScriptObj *scriptBarrier, Jim_Obj *objPtr)
\r
2577 for (i = 0; i < script->len; i++) {
\r
2578 if (script->token[i].objPtr != objPtr &&
\r
2579 Jim_StringEqObj(script->token[i].objPtr, objPtr, 0)) {
\r
2580 return script->token[i].objPtr;
\r
2582 /* Enter recursively on scripts only if the object
\r
2583 * is not the same as the one we are searching for
\r
2584 * shared occurrences. */
\r
2585 if (script->token[i].objPtr->typePtr == &scriptObjType &&
\r
2586 script->token[i].objPtr != objPtr) {
\r
2587 Jim_Obj *foundObjPtr;
\r
2589 ScriptObj *subScript =
\r
2590 script->token[i].objPtr->internalRep.ptr;
\r
2591 /* Don't recursively enter the script we are trying
\r
2592 * to make shared to avoid circular references. */
\r
2593 if (subScript == scriptBarrier) continue;
\r
2594 if (subScript != script) {
\r
2596 ScriptSearchLiteral(interp, subScript,
\r
2597 scriptBarrier, objPtr);
\r
2598 if (foundObjPtr != NULL)
\r
2599 return foundObjPtr;
\r
2606 /* Share literals of a script recursively sharing sub-scripts literals. */
\r
2607 static void ScriptShareLiterals(Jim_Interp *interp, ScriptObj *script,
\r
2608 ScriptObj *topLevelScript)
\r
2613 /* Try to share with toplevel object. */
\r
2614 if (topLevelScript != NULL) {
\r
2615 for (i = 0; i < script->len; i++) {
\r
2616 Jim_Obj *foundObjPtr;
\r
2617 char *str = script->token[i].objPtr->bytes;
\r
2619 if (script->token[i].objPtr->refCount != 1) continue;
\r
2620 if (script->token[i].objPtr->typePtr == &scriptObjType) continue;
\r
2621 if (strchr(str, ' ') || strchr(str, '\n')) continue;
\r
2622 foundObjPtr = ScriptSearchLiteral(interp,
\r
2624 script, /* barrier */
\r
2625 script->token[i].objPtr);
\r
2626 if (foundObjPtr != NULL) {
\r
2627 Jim_IncrRefCount(foundObjPtr);
\r
2628 Jim_DecrRefCount(interp,
\r
2629 script->token[i].objPtr);
\r
2630 script->token[i].objPtr = foundObjPtr;
\r
2634 /* Try to share locally */
\r
2635 for (i = 0; i < script->len; i++) {
\r
2636 char *str = script->token[i].objPtr->bytes;
\r
2638 if (script->token[i].objPtr->refCount != 1) continue;
\r
2639 if (strchr(str, ' ') || strchr(str, '\n')) continue;
\r
2640 for (j = 0; j < script->len; j++) {
\r
2641 if (script->token[i].objPtr !=
\r
2642 script->token[j].objPtr &&
\r
2643 Jim_StringEqObj(script->token[i].objPtr,
\r
2644 script->token[j].objPtr, 0))
\r
2646 Jim_IncrRefCount(script->token[j].objPtr);
\r
2647 Jim_DecrRefCount(interp,
\r
2648 script->token[i].objPtr);
\r
2649 script->token[i].objPtr =
\r
2650 script->token[j].objPtr;
\r
2656 /* This method takes the string representation of an object
\r
2657 * as a Tcl script, and generates the pre-parsed internal representation
\r
2658 * of the script. */
\r
2659 int SetScriptFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr)
\r
2661 int scriptTextLen;
\r
2662 const char *scriptText = Jim_GetString(objPtr, &scriptTextLen);
\r
2663 struct JimParserCtx parser;
\r
2664 struct ScriptObj *script = Jim_Alloc(sizeof(*script));
\r
2665 ScriptToken *token;
\r
2666 int args, tokens, start, end, i;
\r
2667 int initialLineNumber;
\r
2668 int propagateSourceInfo = 0;
\r
2671 script->csLen = 0;
\r
2672 script->commands = 0;
\r
2673 script->token = NULL;
\r
2674 script->cmdStruct = NULL;
\r
2675 script->inUse = 1;
\r
2676 /* Try to get information about filename / line number */
\r
2677 if (objPtr->typePtr == &sourceObjType) {
\r
2678 script->fileName =
\r
2679 Jim_StrDup(objPtr->internalRep.sourceValue.fileName);
\r
2680 initialLineNumber = objPtr->internalRep.sourceValue.lineNumber;
\r
2681 propagateSourceInfo = 1;
\r
2683 script->fileName = Jim_StrDup("?");
\r
2684 initialLineNumber = 1;
\r
2687 JimParserInit(&parser, scriptText, scriptTextLen, initialLineNumber);
\r
2688 while(!JimParserEof(&parser)) {
\r
2690 int len, type, linenr;
\r
2692 JimParseScript(&parser);
\r
2693 token = JimParserGetToken(&parser, &len, &type, &linenr);
\r
2694 ScriptObjAddToken(interp, script, token, len, type,
\r
2695 propagateSourceInfo ? script->fileName : NULL,
\r
2698 token = script->token;
\r
2700 /* Compute the command structure array
\r
2701 * (see the ScriptObj struct definition for more info) */
\r
2702 start = 0; /* Current command start token index */
\r
2703 end = -1; /* Current command end token index */
\r
2705 int expand = 0; /* expand flag. set to 1 on {expand} form. */
\r
2706 int interpolation = 0; /* set to 1 if there is at least one
\r
2707 argument of the command obtained via
\r
2708 interpolation of more tokens. */
\r
2709 /* Search for the end of command, while
\r
2710 * count the number of args. */
\r
2712 if (start >= script->len) break;
\r
2713 args = 1; /* Number of args in current command */
\r
2714 while (token[end].type != JIM_TT_EOL) {
\r
2715 if (end == 0 || token[end-1].type == JIM_TT_SEP ||
\r
2716 token[end-1].type == JIM_TT_EOL)
\r
2718 if (token[end].type == JIM_TT_STR &&
\r
2719 token[end+1].type != JIM_TT_SEP &&
\r
2720 token[end+1].type != JIM_TT_EOL &&
\r
2721 (!strcmp(token[end].objPtr->bytes, "expand") ||
\r
2722 !strcmp(token[end].objPtr->bytes, "*")))
\r
2725 if (token[end].type == JIM_TT_SEP)
\r
2729 interpolation = !((end-start+1) == args*2);
\r
2730 /* Add the 'number of arguments' info into cmdstruct.
\r
2731 * Negative value if there is list expansion involved. */
\r
2733 ScriptObjAddInt(script, -1);
\r
2734 ScriptObjAddInt(script, args);
\r
2735 /* Now add info about the number of tokens. */
\r
2736 tokens = 0; /* Number of tokens in current argument. */
\r
2738 for (i = start; i <= end; i++) {
\r
2739 if (token[i].type == JIM_TT_SEP ||
\r
2740 token[i].type == JIM_TT_EOL)
\r
2742 if (tokens == 1 && expand)
\r
2744 ScriptObjAddInt(script,
\r
2745 expand ? -tokens : tokens);
\r
2750 } else if (tokens == 0 && token[i].type == JIM_TT_STR &&
\r
2751 (!strcmp(token[i].objPtr->bytes, "expand") ||
\r
2752 !strcmp(token[i].objPtr->bytes, "*")))
\r
2759 /* Perform literal sharing, but only for objects that appear
\r
2760 * to be scripts written as literals inside the source code,
\r
2761 * and not computed at runtime. Literal sharing is a costly
\r
2762 * operation that should be done only against objects that
\r
2763 * are likely to require compilation only the first time, and
\r
2764 * then are executed multiple times. */
\r
2765 if (propagateSourceInfo && interp->framePtr->procBodyObjPtr) {
\r
2766 Jim_Obj *bodyObjPtr = interp->framePtr->procBodyObjPtr;
\r
2767 if (bodyObjPtr->typePtr == &scriptObjType) {
\r
2768 ScriptObj *bodyScript =
\r
2769 bodyObjPtr->internalRep.ptr;
\r
2770 ScriptShareLiterals(interp, script, bodyScript);
\r
2772 } else if (propagateSourceInfo) {
\r
2773 ScriptShareLiterals(interp, script, NULL);
\r
2775 /* Free the old internal rep and set the new one. */
\r
2776 Jim_FreeIntRep(interp, objPtr);
\r
2777 Jim_SetIntRepPtr(objPtr, script);
\r
2778 objPtr->typePtr = &scriptObjType;
\r
2782 ScriptObj *Jim_GetScript(Jim_Interp *interp, Jim_Obj *objPtr)
\r
2784 if (objPtr->typePtr != &scriptObjType) {
\r
2785 SetScriptFromAny(interp, objPtr);
\r
2787 return (ScriptObj*) Jim_GetIntRepPtr(objPtr);
\r
2790 /* -----------------------------------------------------------------------------
\r
2792 * ---------------------------------------------------------------------------*/
\r
2794 /* Commands HashTable Type.
\r
2796 * Keys are dynamic allocated strings, Values are Jim_Cmd structures. */
\r
2797 static void Jim_CommandsHT_ValDestructor(void *interp, void *val)
\r
2799 Jim_Cmd *cmdPtr = (void*) val;
\r
2801 if (cmdPtr->cmdProc == NULL) {
\r
2802 Jim_DecrRefCount(interp, cmdPtr->argListObjPtr);
\r
2803 Jim_DecrRefCount(interp, cmdPtr->bodyObjPtr);
\r
2804 if (cmdPtr->staticVars) {
\r
2805 Jim_FreeHashTable(cmdPtr->staticVars);
\r
2806 Jim_Free(cmdPtr->staticVars);
\r
2808 } else if (cmdPtr->delProc != NULL) {
\r
2809 /* If it was a C coded command, call the delProc if any */
\r
2810 cmdPtr->delProc(interp, cmdPtr->privData);
\r
2815 static Jim_HashTableType JimCommandsHashTableType = {
\r
2816 JimStringCopyHTHashFunction, /* hash function */
\r
2817 JimStringCopyHTKeyDup, /* key dup */
\r
2818 NULL, /* val dup */
\r
2819 JimStringCopyHTKeyCompare, /* key compare */
\r
2820 JimStringCopyHTKeyDestructor, /* key destructor */
\r
2821 Jim_CommandsHT_ValDestructor /* val destructor */
\r
2824 /* ------------------------- Commands related functions --------------------- */
\r
2826 int Jim_CreateCommand(Jim_Interp *interp, const char *cmdName,
\r
2827 Jim_CmdProc cmdProc, void *privData, Jim_DelCmdProc delProc)
\r
2829 Jim_HashEntry *he;
\r
2832 he = Jim_FindHashEntry(&interp->commands, cmdName);
\r
2833 if (he == NULL) { /* New command to create */
\r
2834 cmdPtr = Jim_Alloc(sizeof(*cmdPtr));
\r
2835 cmdPtr->cmdProc = cmdProc;
\r
2836 cmdPtr->privData = privData;
\r
2837 cmdPtr->delProc = delProc;
\r
2838 Jim_AddHashEntry(&interp->commands, cmdName, cmdPtr);
\r
2840 Jim_InterpIncrProcEpoch(interp);
\r
2841 /* Free the arglist/body objects if it was a Tcl procedure */
\r
2843 if (cmdPtr->cmdProc == NULL) {
\r
2844 Jim_DecrRefCount(interp, cmdPtr->argListObjPtr);
\r
2845 Jim_DecrRefCount(interp, cmdPtr->bodyObjPtr);
\r
2846 if (cmdPtr->staticVars) {
\r
2847 Jim_FreeHashTable(cmdPtr->staticVars);
\r
2848 Jim_Free(cmdPtr->staticVars);
\r
2850 cmdPtr->staticVars = NULL;
\r
2851 } else if (cmdPtr->delProc != NULL) {
\r
2852 /* If it was a C coded command, call the delProc if any */
\r
2853 cmdPtr->delProc(interp, cmdPtr->privData);
\r
2855 cmdPtr->cmdProc = cmdProc;
\r
2856 cmdPtr->privData = privData;
\r
2858 /* There is no need to increment the 'proc epoch' because
\r
2859 * creation of a new procedure can never affect existing
\r
2860 * cached commands. We don't do negative caching. */
\r
2864 int Jim_CreateProcedure(Jim_Interp *interp, const char *cmdName,
\r
2865 Jim_Obj *argListObjPtr, Jim_Obj *staticsListObjPtr, Jim_Obj *bodyObjPtr,
\r
2866 int arityMin, int arityMax)
\r
2870 cmdPtr = Jim_Alloc(sizeof(*cmdPtr));
\r
2871 cmdPtr->cmdProc = NULL; /* Not a C coded command */
\r
2872 cmdPtr->argListObjPtr = argListObjPtr;
\r
2873 cmdPtr->bodyObjPtr = bodyObjPtr;
\r
2874 Jim_IncrRefCount(argListObjPtr);
\r
2875 Jim_IncrRefCount(bodyObjPtr);
\r
2876 cmdPtr->arityMin = arityMin;
\r
2877 cmdPtr->arityMax = arityMax;
\r
2878 cmdPtr->staticVars = NULL;
\r
2880 /* Create the statics hash table. */
\r
2881 if (staticsListObjPtr) {
\r
2884 Jim_ListLength(interp, staticsListObjPtr, &len);
\r
2886 cmdPtr->staticVars = Jim_Alloc(sizeof(Jim_HashTable));
\r
2887 Jim_InitHashTable(cmdPtr->staticVars, &JimVariablesHashTableType,
\r
2889 for (i = 0; i < len; i++) {
\r
2890 Jim_Obj *objPtr, *initObjPtr, *nameObjPtr;
\r
2894 Jim_ListIndex(interp, staticsListObjPtr, i, &objPtr, JIM_NONE);
\r
2895 /* Check if it's composed of two elements. */
\r
2896 Jim_ListLength(interp, objPtr, &subLen);
\r
2897 if (subLen == 1 || subLen == 2) {
\r
2898 /* Try to get the variable value from the current
\r
2900 Jim_ListIndex(interp, objPtr, 0, &nameObjPtr, JIM_NONE);
\r
2901 if (subLen == 1) {
\r
2902 initObjPtr = Jim_GetVariable(interp, nameObjPtr,
\r
2904 if (initObjPtr == NULL) {
\r
2905 Jim_SetResult(interp,
\r
2906 Jim_NewEmptyStringObj(interp));
\r
2907 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
2908 "variable for initialization of static \"",
\r
2909 Jim_GetString(nameObjPtr, NULL),
\r
2910 "\" not found in the local context",
\r
2915 Jim_ListIndex(interp, objPtr, 1, &initObjPtr, JIM_NONE);
\r
2917 varPtr = Jim_Alloc(sizeof(*varPtr));
\r
2918 varPtr->objPtr = initObjPtr;
\r
2919 Jim_IncrRefCount(initObjPtr);
\r
2920 varPtr->linkFramePtr = NULL;
\r
2921 if (Jim_AddHashEntry(cmdPtr->staticVars,
\r
2922 Jim_GetString(nameObjPtr, NULL),
\r
2923 varPtr) != JIM_OK)
\r
2925 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
2926 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
2927 "static variable name \"",
\r
2928 Jim_GetString(objPtr, NULL), "\"",
\r
2929 " duplicated in statics list", NULL);
\r
2930 Jim_DecrRefCount(interp, initObjPtr);
\r
2935 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
2936 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
2937 "too many fields in static specifier \"",
\r
2938 objPtr, "\"", NULL);
\r
2945 /* Add the new command */
\r
2947 /* it may already exist, so we try to delete the old one */
\r
2948 if (Jim_DeleteHashEntry(&interp->commands, cmdName) != JIM_ERR) {
\r
2949 /* There was an old procedure with the same name, this requires
\r
2950 * a 'proc epoch' update. */
\r
2951 Jim_InterpIncrProcEpoch(interp);
\r
2953 /* If a procedure with the same name didn't existed there is no need
\r
2954 * to increment the 'proc epoch' because creation of a new procedure
\r
2955 * can never affect existing cached commands. We don't do
\r
2956 * negative caching. */
\r
2957 Jim_AddHashEntry(&interp->commands, cmdName, cmdPtr);
\r
2961 Jim_FreeHashTable(cmdPtr->staticVars);
\r
2962 Jim_Free(cmdPtr->staticVars);
\r
2963 Jim_DecrRefCount(interp, argListObjPtr);
\r
2964 Jim_DecrRefCount(interp, bodyObjPtr);
\r
2969 int Jim_DeleteCommand(Jim_Interp *interp, const char *cmdName)
\r
2971 if (Jim_DeleteHashEntry(&interp->commands, cmdName) == JIM_ERR)
\r
2973 Jim_InterpIncrProcEpoch(interp);
\r
2977 int Jim_RenameCommand(Jim_Interp *interp, const char *oldName,
\r
2978 const char *newName)
\r
2981 Jim_HashEntry *he;
\r
2982 Jim_Cmd *copyCmdPtr;
\r
2984 if (newName[0] == '\0') /* Delete! */
\r
2985 return Jim_DeleteCommand(interp, oldName);
\r
2987 he = Jim_FindHashEntry(&interp->commands, oldName);
\r
2989 return JIM_ERR; /* Invalid command name */
\r
2991 copyCmdPtr = Jim_Alloc(sizeof(Jim_Cmd));
\r
2992 *copyCmdPtr = *cmdPtr;
\r
2993 /* In order to avoid that a procedure will get arglist/body/statics
\r
2994 * freed by the hash table methods, fake a C-coded command
\r
2995 * setting cmdPtr->cmdProc as not NULL */
\r
2996 cmdPtr->cmdProc = (void*)1;
\r
2997 /* Also make sure delProc is NULL. */
\r
2998 cmdPtr->delProc = NULL;
\r
2999 /* Destroy the old command, and make sure the new is freed
\r
3001 Jim_DeleteHashEntry(&interp->commands, oldName);
\r
3002 Jim_DeleteHashEntry(&interp->commands, newName);
\r
3003 /* Now the new command. We are sure it can't fail because
\r
3004 * the target name was already freed. */
\r
3005 Jim_AddHashEntry(&interp->commands, newName, copyCmdPtr);
\r
3006 /* Increment the epoch */
\r
3007 Jim_InterpIncrProcEpoch(interp);
\r
3011 /* -----------------------------------------------------------------------------
\r
3013 * ---------------------------------------------------------------------------*/
\r
3015 static int SetCommandFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
3017 static Jim_ObjType commandObjType = {
\r
3022 JIM_TYPE_REFERENCES,
\r
3025 int SetCommandFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
3027 Jim_HashEntry *he;
\r
3028 const char *cmdName;
\r
3030 /* Get the string representation */
\r
3031 cmdName = Jim_GetString(objPtr, NULL);
\r
3032 /* Lookup this name into the commands hash table */
\r
3033 he = Jim_FindHashEntry(&interp->commands, cmdName);
\r
3037 /* Free the old internal repr and set the new one. */
\r
3038 Jim_FreeIntRep(interp, objPtr);
\r
3039 objPtr->typePtr = &commandObjType;
\r
3040 objPtr->internalRep.cmdValue.procEpoch = interp->procEpoch;
\r
3041 objPtr->internalRep.cmdValue.cmdPtr = (void*)he->val;
\r
3045 /* This function returns the command structure for the command name
\r
3046 * stored in objPtr. It tries to specialize the objPtr to contain
\r
3047 * a cached info instead to perform the lookup into the hash table
\r
3048 * every time. The information cached may not be uptodate, in such
\r
3049 * a case the lookup is performed and the cache updated. */
\r
3050 Jim_Cmd *Jim_GetCommand(Jim_Interp *interp, Jim_Obj *objPtr, int flags)
\r
3052 if ((objPtr->typePtr != &commandObjType ||
\r
3053 objPtr->internalRep.cmdValue.procEpoch != interp->procEpoch) &&
\r
3054 SetCommandFromAny(interp, objPtr) == JIM_ERR) {
\r
3055 if (flags & JIM_ERRMSG) {
\r
3056 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3057 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3058 "invalid command name \"", objPtr->bytes, "\"",
\r
3063 return objPtr->internalRep.cmdValue.cmdPtr;
\r
3066 /* -----------------------------------------------------------------------------
\r
3068 * ---------------------------------------------------------------------------*/
\r
3070 /* Variables HashTable Type.
\r
3072 * Keys are dynamic allocated strings, Values are Jim_Var structures. */
\r
3073 static void JimVariablesHTValDestructor(void *interp, void *val)
\r
3075 Jim_Var *varPtr = (void*) val;
\r
3077 Jim_DecrRefCount(interp, varPtr->objPtr);
\r
3081 static Jim_HashTableType JimVariablesHashTableType = {
\r
3082 JimStringCopyHTHashFunction, /* hash function */
\r
3083 JimStringCopyHTKeyDup, /* key dup */
\r
3084 NULL, /* val dup */
\r
3085 JimStringCopyHTKeyCompare, /* key compare */
\r
3086 JimStringCopyHTKeyDestructor, /* key destructor */
\r
3087 JimVariablesHTValDestructor /* val destructor */
\r
3090 /* -----------------------------------------------------------------------------
\r
3092 * ---------------------------------------------------------------------------*/
\r
3094 #define JIM_DICT_SUGAR 100 /* Only returned by SetVariableFromAny() */
\r
3096 static int SetVariableFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
3098 static Jim_ObjType variableObjType = {
\r
3103 JIM_TYPE_REFERENCES,
\r
3106 /* Return true if the string "str" looks like syntax sugar for [dict]. I.e.
\r
3107 * is in the form "varname(key)". */
\r
3108 static int Jim_NameIsDictSugar(const char *str, int len)
\r
3111 len = strlen(str);
\r
3112 if (len && str[len-1] == ')' && strchr(str, '(') != NULL)
\r
3117 /* This method should be called only by the variable API.
\r
3118 * It returns JIM_OK on success (variable already exists),
\r
3119 * JIM_ERR if it does not exists, JIM_DICT_GLUE if it's not
\r
3120 * a variable name, but syntax glue for [dict] i.e. the last
\r
3121 * character is ')' */
\r
3122 int SetVariableFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr)
\r
3124 Jim_HashEntry *he;
\r
3125 const char *varName;
\r
3128 /* Check if the object is already an uptodate variable */
\r
3129 if (objPtr->typePtr == &variableObjType &&
\r
3130 objPtr->internalRep.varValue.callFrameId == interp->framePtr->id)
\r
3131 return JIM_OK; /* nothing to do */
\r
3132 /* Get the string representation */
\r
3133 varName = Jim_GetString(objPtr, &len);
\r
3134 /* Make sure it's not syntax glue to get/set dict. */
\r
3135 if (Jim_NameIsDictSugar(varName, len))
\r
3136 return JIM_DICT_SUGAR;
\r
3137 /* Lookup this name into the variables hash table */
\r
3138 he = Jim_FindHashEntry(&interp->framePtr->vars, varName);
\r
3140 /* Try with static vars. */
\r
3141 if (interp->framePtr->staticVars == NULL)
\r
3143 if (!(he = Jim_FindHashEntry(interp->framePtr->staticVars, varName)))
\r
3146 /* Free the old internal repr and set the new one. */
\r
3147 Jim_FreeIntRep(interp, objPtr);
\r
3148 objPtr->typePtr = &variableObjType;
\r
3149 objPtr->internalRep.varValue.callFrameId = interp->framePtr->id;
\r
3150 objPtr->internalRep.varValue.varPtr = (void*)he->val;
\r
3154 /* -------------------- Variables related functions ------------------------- */
\r
3155 static int JimDictSugarSet(Jim_Interp *interp, Jim_Obj *ObjPtr,
\r
3156 Jim_Obj *valObjPtr);
\r
3157 static Jim_Obj *JimDictSugarGet(Jim_Interp *interp, Jim_Obj *ObjPtr);
\r
3159 /* For now that's dummy. Variables lookup should be optimized
\r
3160 * in many ways, with caching of lookups, and possibly with
\r
3161 * a table of pre-allocated vars in every CallFrame for local vars.
\r
3162 * All the caching should also have an 'epoch' mechanism similar
\r
3163 * to the one used by Tcl for procedures lookup caching. */
\r
3165 int Jim_SetVariable(Jim_Interp *interp, Jim_Obj *nameObjPtr, Jim_Obj *valObjPtr)
\r
3171 if ((err = SetVariableFromAny(interp, nameObjPtr)) != JIM_OK) {
\r
3172 /* Check for [dict] syntax sugar. */
\r
3173 if (err == JIM_DICT_SUGAR)
\r
3174 return JimDictSugarSet(interp, nameObjPtr, valObjPtr);
\r
3175 /* New variable to create */
\r
3176 name = Jim_GetString(nameObjPtr, NULL);
\r
3178 var = Jim_Alloc(sizeof(*var));
\r
3179 var->objPtr = valObjPtr;
\r
3180 Jim_IncrRefCount(valObjPtr);
\r
3181 var->linkFramePtr = NULL;
\r
3182 /* Insert the new variable */
\r
3183 Jim_AddHashEntry(&interp->framePtr->vars, name, var);
\r
3184 /* Make the object int rep a variable */
\r
3185 Jim_FreeIntRep(interp, nameObjPtr);
\r
3186 nameObjPtr->typePtr = &variableObjType;
\r
3187 nameObjPtr->internalRep.varValue.callFrameId =
\r
3188 interp->framePtr->id;
\r
3189 nameObjPtr->internalRep.varValue.varPtr = var;
\r
3191 var = nameObjPtr->internalRep.varValue.varPtr;
\r
3192 if (var->linkFramePtr == NULL) {
\r
3193 Jim_IncrRefCount(valObjPtr);
\r
3194 Jim_DecrRefCount(interp, var->objPtr);
\r
3195 var->objPtr = valObjPtr;
\r
3196 } else { /* Else handle the link */
\r
3197 Jim_CallFrame *savedCallFrame;
\r
3199 savedCallFrame = interp->framePtr;
\r
3200 interp->framePtr = var->linkFramePtr;
\r
3201 err = Jim_SetVariable(interp, var->objPtr, valObjPtr);
\r
3202 interp->framePtr = savedCallFrame;
\r
3203 if (err != JIM_OK)
\r
3210 int Jim_SetVariableStr(Jim_Interp *interp, const char *name, Jim_Obj *objPtr)
\r
3212 Jim_Obj *nameObjPtr;
\r
3215 nameObjPtr = Jim_NewStringObj(interp, name, -1);
\r
3216 Jim_IncrRefCount(nameObjPtr);
\r
3217 result = Jim_SetVariable(interp, nameObjPtr, objPtr);
\r
3218 Jim_DecrRefCount(interp, nameObjPtr);
\r
3222 int Jim_SetGlobalVariableStr(Jim_Interp *interp, const char *name, Jim_Obj *objPtr)
\r
3224 Jim_CallFrame *savedFramePtr;
\r
3227 savedFramePtr = interp->framePtr;
\r
3228 interp->framePtr = interp->topFramePtr;
\r
3229 result = Jim_SetVariableStr(interp, name, objPtr);
\r
3230 interp->framePtr = savedFramePtr;
\r
3234 int Jim_SetVariableStrWithStr(Jim_Interp *interp, const char *name, const char *val)
\r
3236 Jim_Obj *nameObjPtr, *valObjPtr;
\r
3239 nameObjPtr = Jim_NewStringObj(interp, name, -1);
\r
3240 valObjPtr = Jim_NewStringObj(interp, val, -1);
\r
3241 Jim_IncrRefCount(nameObjPtr);
\r
3242 Jim_IncrRefCount(valObjPtr);
\r
3243 result = Jim_SetVariable(interp, nameObjPtr, valObjPtr);
\r
3244 Jim_DecrRefCount(interp, nameObjPtr);
\r
3245 Jim_DecrRefCount(interp, valObjPtr);
\r
3249 int Jim_SetVariableLink(Jim_Interp *interp, Jim_Obj *nameObjPtr,
\r
3250 Jim_Obj *targetNameObjPtr, Jim_CallFrame *targetCallFrame)
\r
3252 const char *varName;
\r
3255 /* Check for cycles. */
\r
3256 if (interp->framePtr == targetCallFrame) {
\r
3257 Jim_Obj *objPtr = targetNameObjPtr;
\r
3259 /* Cycles are only possible with 'uplevel 0' */
\r
3261 if (Jim_StringEqObj(objPtr, nameObjPtr, 0)) {
\r
3262 Jim_SetResultString(interp,
\r
3263 "can't upvar from variable to itself", -1);
\r
3266 if (SetVariableFromAny(interp, objPtr) != JIM_OK)
\r
3268 varPtr = objPtr->internalRep.varValue.varPtr;
\r
3269 if (varPtr->linkFramePtr != targetCallFrame) break;
\r
3270 objPtr = varPtr->objPtr;
\r
3273 varName = Jim_GetString(nameObjPtr, &len);
\r
3274 if (Jim_NameIsDictSugar(varName, len)) {
\r
3275 Jim_SetResultString(interp,
\r
3276 "Dict key syntax invalid as link source", -1);
\r
3279 /* Perform the binding */
\r
3280 Jim_SetVariable(interp, nameObjPtr, targetNameObjPtr);
\r
3281 /* We are now sure 'nameObjPtr' type is variableObjType */
\r
3282 nameObjPtr->internalRep.varValue.varPtr->linkFramePtr = targetCallFrame;
\r
3286 /* Return the Jim_Obj pointer associated with a variable name,
\r
3287 * or NULL if the variable was not found in the current context.
\r
3288 * The same optimization discussed in the comment to the
\r
3289 * 'SetVariable' function should apply here. */
\r
3290 Jim_Obj *Jim_GetVariable(Jim_Interp *interp, Jim_Obj *nameObjPtr, int flags)
\r
3294 /* All the rest is handled here */
\r
3295 if ((err = SetVariableFromAny(interp, nameObjPtr)) != JIM_OK) {
\r
3296 /* Check for [dict] syntax sugar. */
\r
3297 if (err == JIM_DICT_SUGAR)
\r
3298 return JimDictSugarGet(interp, nameObjPtr);
\r
3299 if (flags & JIM_ERRMSG) {
\r
3300 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3301 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3302 "can't read \"", nameObjPtr->bytes,
\r
3303 "\": no such variable", NULL);
\r
3309 Jim_CallFrame *savedCallFrame;
\r
3311 varPtr = nameObjPtr->internalRep.varValue.varPtr;
\r
3312 if (varPtr->linkFramePtr == NULL)
\r
3313 return varPtr->objPtr;
\r
3314 /* The variable is a link? Resolve it. */
\r
3315 savedCallFrame = interp->framePtr;
\r
3316 interp->framePtr = varPtr->linkFramePtr;
\r
3317 objPtr = Jim_GetVariable(interp, varPtr->objPtr, JIM_NONE);
\r
3318 if (objPtr == NULL && flags & JIM_ERRMSG) {
\r
3319 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3320 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3321 "can't read \"", nameObjPtr->bytes,
\r
3322 "\": no such variable", NULL);
\r
3324 interp->framePtr = savedCallFrame;
\r
3329 Jim_Obj *Jim_GetGlobalVariable(Jim_Interp *interp, Jim_Obj *nameObjPtr,
\r
3332 Jim_CallFrame *savedFramePtr;
\r
3335 savedFramePtr = interp->framePtr;
\r
3336 interp->framePtr = interp->topFramePtr;
\r
3337 objPtr = Jim_GetVariable(interp, nameObjPtr, flags);
\r
3338 interp->framePtr = savedFramePtr;
\r
3343 Jim_Obj *Jim_GetVariableStr(Jim_Interp *interp, const char *name, int flags)
\r
3345 Jim_Obj *nameObjPtr, *varObjPtr;
\r
3347 nameObjPtr = Jim_NewStringObj(interp, name, -1);
\r
3348 Jim_IncrRefCount(nameObjPtr);
\r
3349 varObjPtr = Jim_GetVariable(interp, nameObjPtr, flags);
\r
3350 Jim_DecrRefCount(interp, nameObjPtr);
\r
3354 Jim_Obj *Jim_GetGlobalVariableStr(Jim_Interp *interp, const char *name,
\r
3357 Jim_CallFrame *savedFramePtr;
\r
3360 savedFramePtr = interp->framePtr;
\r
3361 interp->framePtr = interp->topFramePtr;
\r
3362 objPtr = Jim_GetVariableStr(interp, name, flags);
\r
3363 interp->framePtr = savedFramePtr;
\r
3368 /* Unset a variable.
\r
3369 * Note: On success unset invalidates all the variable objects created
\r
3370 * in the current call frame incrementing. */
\r
3371 int Jim_UnsetVariable(Jim_Interp *interp, Jim_Obj *nameObjPtr, int flags)
\r
3377 if ((err = SetVariableFromAny(interp, nameObjPtr)) != JIM_OK) {
\r
3378 /* Check for [dict] syntax sugar. */
\r
3379 if (err == JIM_DICT_SUGAR)
\r
3380 return JimDictSugarSet(interp, nameObjPtr, NULL);
\r
3381 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3382 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3383 "can't unset \"", nameObjPtr->bytes,
\r
3384 "\": no such variable", NULL);
\r
3385 return JIM_ERR; /* var not found */
\r
3387 varPtr = nameObjPtr->internalRep.varValue.varPtr;
\r
3388 /* If it's a link call UnsetVariable recursively */
\r
3389 if (varPtr->linkFramePtr) {
\r
3392 Jim_CallFrame *savedCallFrame;
\r
3394 savedCallFrame = interp->framePtr;
\r
3395 interp->framePtr = varPtr->linkFramePtr;
\r
3396 retval = Jim_UnsetVariable(interp, varPtr->objPtr, JIM_NONE);
\r
3397 interp->framePtr = savedCallFrame;
\r
3398 if (retval != JIM_OK && flags & JIM_ERRMSG) {
\r
3399 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3400 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3401 "can't unset \"", nameObjPtr->bytes,
\r
3402 "\": no such variable", NULL);
\r
3406 name = Jim_GetString(nameObjPtr, NULL);
\r
3407 if (Jim_DeleteHashEntry(&interp->framePtr->vars, name)
\r
3408 != JIM_OK) return JIM_ERR;
\r
3409 /* Change the callframe id, invalidating var lookup caching */
\r
3410 JimChangeCallFrameId(interp, interp->framePtr);
\r
3415 /* ---------- Dict syntax sugar (similar to array Tcl syntax) -------------- */
\r
3417 /* Given a variable name for [dict] operation syntax sugar,
\r
3418 * this function returns two objects, the first with the name
\r
3419 * of the variable to set, and the second with the rispective key.
\r
3420 * For example "foo(bar)" will return objects with string repr. of
\r
3421 * "foo" and "bar".
\r
3423 * The returned objects have refcount = 1. The function can't fail. */
\r
3424 static void JimDictSugarParseVarKey(Jim_Interp *interp, Jim_Obj *objPtr,
\r
3425 Jim_Obj **varPtrPtr, Jim_Obj **keyPtrPtr)
\r
3427 const char *str, *p;
\r
3429 int len, keyLen, nameLen;
\r
3430 Jim_Obj *varObjPtr, *keyObjPtr;
\r
3432 str = Jim_GetString(objPtr, &len);
\r
3433 p = strchr(str, '(');
\r
3435 keyLen = len-((p-str)+1);
\r
3436 nameLen = (p-str)-1;
\r
3437 /* Create the objects with the variable name and key. */
\r
3438 t = Jim_Alloc(nameLen+1);
\r
3439 memcpy(t, str, nameLen);
\r
3440 t[nameLen] = '\0';
\r
3441 varObjPtr = Jim_NewStringObjNoAlloc(interp, t, nameLen);
\r
3443 t = Jim_Alloc(keyLen+1);
\r
3444 memcpy(t, p, keyLen);
\r
3446 keyObjPtr = Jim_NewStringObjNoAlloc(interp, t, keyLen);
\r
3448 Jim_IncrRefCount(varObjPtr);
\r
3449 Jim_IncrRefCount(keyObjPtr);
\r
3450 *varPtrPtr = varObjPtr;
\r
3451 *keyPtrPtr = keyObjPtr;
\r
3454 /* Helper of Jim_SetVariable() to deal with dict-syntax variable names.
\r
3455 * Also used by Jim_UnsetVariable() with valObjPtr = NULL. */
\r
3456 static int JimDictSugarSet(Jim_Interp *interp, Jim_Obj *objPtr,
\r
3457 Jim_Obj *valObjPtr)
\r
3459 Jim_Obj *varObjPtr, *keyObjPtr;
\r
3462 JimDictSugarParseVarKey(interp, objPtr, &varObjPtr, &keyObjPtr);
\r
3463 err = Jim_SetDictKeysVector(interp, varObjPtr, &keyObjPtr, 1,
\r
3465 Jim_DecrRefCount(interp, varObjPtr);
\r
3466 Jim_DecrRefCount(interp, keyObjPtr);
\r
3470 /* Helper of Jim_GetVariable() to deal with dict-syntax variable names */
\r
3471 static Jim_Obj *JimDictSugarGet(Jim_Interp *interp, Jim_Obj *objPtr)
\r
3473 Jim_Obj *varObjPtr, *keyObjPtr, *dictObjPtr, *resObjPtr;
\r
3475 JimDictSugarParseVarKey(interp, objPtr, &varObjPtr, &keyObjPtr);
\r
3476 dictObjPtr = Jim_GetVariable(interp, varObjPtr, JIM_ERRMSG);
\r
3477 if (!dictObjPtr) {
\r
3481 if (Jim_DictKey(interp, dictObjPtr, keyObjPtr, &resObjPtr, JIM_ERRMSG)
\r
3486 Jim_DecrRefCount(interp, varObjPtr);
\r
3487 Jim_DecrRefCount(interp, keyObjPtr);
\r
3491 /* --------- $var(INDEX) substitution, using a specialized object ----------- */
\r
3493 static void FreeDictSubstInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
3494 static void DupDictSubstInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr,
\r
3497 static Jim_ObjType dictSubstObjType = {
\r
3498 "dict-substitution",
\r
3499 FreeDictSubstInternalRep,
\r
3500 DupDictSubstInternalRep,
\r
3505 void FreeDictSubstInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
3507 Jim_DecrRefCount(interp, objPtr->internalRep.dictSubstValue.varNameObjPtr);
\r
3508 Jim_DecrRefCount(interp, objPtr->internalRep.dictSubstValue.indexObjPtr);
\r
3511 void DupDictSubstInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr,
\r
3514 JIM_NOTUSED(interp);
\r
3516 dupPtr->internalRep.dictSubstValue.varNameObjPtr =
\r
3517 srcPtr->internalRep.dictSubstValue.varNameObjPtr;
\r
3518 dupPtr->internalRep.dictSubstValue.indexObjPtr =
\r
3519 srcPtr->internalRep.dictSubstValue.indexObjPtr;
\r
3520 dupPtr->typePtr = &dictSubstObjType;
\r
3523 /* This function is used to expand [dict get] sugar in the form
\r
3524 * of $var(INDEX). The function is mainly used by Jim_EvalObj()
\r
3525 * to deal with tokens of type JIM_TT_DICTSUGAR. objPtr points to an
\r
3526 * object that is *guaranteed* to be in the form VARNAME(INDEX).
\r
3527 * The 'index' part is [subst]ituted, and is used to lookup a key inside
\r
3528 * the [dict]ionary contained in variable VARNAME. */
\r
3529 Jim_Obj *Jim_ExpandDictSugar(Jim_Interp *interp, Jim_Obj *objPtr)
\r
3531 Jim_Obj *varObjPtr, *keyObjPtr, *dictObjPtr, *resObjPtr;
\r
3532 Jim_Obj *substKeyObjPtr = NULL;
\r
3534 if (objPtr->typePtr != &dictSubstObjType) {
\r
3535 JimDictSugarParseVarKey(interp, objPtr, &varObjPtr, &keyObjPtr);
\r
3536 Jim_FreeIntRep(interp, objPtr);
\r
3537 objPtr->typePtr = &dictSubstObjType;
\r
3538 objPtr->internalRep.dictSubstValue.varNameObjPtr = varObjPtr;
\r
3539 objPtr->internalRep.dictSubstValue.indexObjPtr = keyObjPtr;
\r
3541 if (Jim_SubstObj(interp, objPtr->internalRep.dictSubstValue.indexObjPtr,
\r
3542 &substKeyObjPtr, JIM_NONE)
\r
3544 substKeyObjPtr = NULL;
\r
3547 Jim_IncrRefCount(substKeyObjPtr);
\r
3548 dictObjPtr = Jim_GetVariable(interp,
\r
3549 objPtr->internalRep.dictSubstValue.varNameObjPtr, JIM_ERRMSG);
\r
3550 if (!dictObjPtr) {
\r
3554 if (Jim_DictKey(interp, dictObjPtr, substKeyObjPtr, &resObjPtr, JIM_ERRMSG)
\r
3560 if (substKeyObjPtr) Jim_DecrRefCount(interp, substKeyObjPtr);
\r
3564 /* -----------------------------------------------------------------------------
\r
3566 * ---------------------------------------------------------------------------*/
\r
3568 static Jim_CallFrame *JimCreateCallFrame(Jim_Interp *interp)
\r
3570 Jim_CallFrame *cf;
\r
3571 if (interp->freeFramesList) {
\r
3572 cf = interp->freeFramesList;
\r
3573 interp->freeFramesList = cf->nextFramePtr;
\r
3575 cf = Jim_Alloc(sizeof(*cf));
\r
3576 cf->vars.table = NULL;
\r
3579 cf->id = interp->callFrameEpoch++;
\r
3580 cf->parentCallFrame = NULL;
\r
3583 cf->procArgsObjPtr = NULL;
\r
3584 cf->procBodyObjPtr = NULL;
\r
3585 cf->nextFramePtr = NULL;
\r
3586 cf->staticVars = NULL;
\r
3587 if (cf->vars.table == NULL)
\r
3588 Jim_InitHashTable(&cf->vars, &JimVariablesHashTableType, interp);
\r
3592 /* Used to invalidate every caching related to callframe stability. */
\r
3593 static void JimChangeCallFrameId(Jim_Interp *interp, Jim_CallFrame *cf)
\r
3595 cf->id = interp->callFrameEpoch++;
\r
3598 #define JIM_FCF_NONE 0 /* no flags */
\r
3599 #define JIM_FCF_NOHT 1 /* don't free the hash table */
\r
3600 static void JimFreeCallFrame(Jim_Interp *interp, Jim_CallFrame *cf,
\r
3603 if (cf->procArgsObjPtr) Jim_DecrRefCount(interp, cf->procArgsObjPtr);
\r
3604 if (cf->procBodyObjPtr) Jim_DecrRefCount(interp, cf->procBodyObjPtr);
\r
3605 if (!(flags & JIM_FCF_NOHT))
\r
3606 Jim_FreeHashTable(&cf->vars);
\r
3609 Jim_HashEntry **table = cf->vars.table, *he;
\r
3611 for (i = 0; i < JIM_HT_INITIAL_SIZE; i++) {
\r
3613 while (he != NULL) {
\r
3614 Jim_HashEntry *nextEntry = he->next;
\r
3615 Jim_Var *varPtr = (void*) he->val;
\r
3617 Jim_DecrRefCount(interp, varPtr->objPtr);
\r
3618 Jim_Free(he->val);
\r
3619 Jim_Free((void*)he->key); /* ATTENTION: const cast */
\r
3625 cf->vars.used = 0;
\r
3627 cf->nextFramePtr = interp->freeFramesList;
\r
3628 interp->freeFramesList = cf;
\r
3631 /* -----------------------------------------------------------------------------
\r
3633 * ---------------------------------------------------------------------------*/
\r
3635 /* References HashTable Type.
\r
3637 * Keys are jim_wide integers, dynamically allocated for now but in the
\r
3638 * future it's worth to cache this 8 bytes objects. Values are poitners
\r
3639 * to Jim_References. */
\r
3640 static void JimReferencesHTValDestructor(void *interp, void *val)
\r
3642 Jim_Reference *refPtr = (void*) val;
\r
3644 Jim_DecrRefCount(interp, refPtr->objPtr);
\r
3645 if (refPtr->finalizerCmdNamePtr != NULL) {
\r
3646 Jim_DecrRefCount(interp, refPtr->finalizerCmdNamePtr);
\r
3651 unsigned int JimReferencesHTHashFunction(const void *key)
\r
3653 /* Only the least significant bits are used. */
\r
3654 const jim_wide *widePtr = key;
\r
3655 unsigned int intValue = (unsigned int) *widePtr;
\r
3656 return Jim_IntHashFunction(intValue);
\r
3659 unsigned int JimReferencesHTDoubleHashFunction(const void *key)
\r
3661 /* Only the least significant bits are used. */
\r
3662 const jim_wide *widePtr = key;
\r
3663 unsigned int intValue = (unsigned int) *widePtr;
\r
3664 return intValue; /* identity function. */
\r
3667 const void *JimReferencesHTKeyDup(void *privdata, const void *key)
\r
3669 void *copy = Jim_Alloc(sizeof(jim_wide));
\r
3670 JIM_NOTUSED(privdata);
\r
3672 memcpy(copy, key, sizeof(jim_wide));
\r
3676 int JimReferencesHTKeyCompare(void *privdata, const void *key1,
\r
3679 JIM_NOTUSED(privdata);
\r
3681 return memcmp(key1, key2, sizeof(jim_wide)) == 0;
\r
3684 void JimReferencesHTKeyDestructor(void *privdata, const void *key)
\r
3686 JIM_NOTUSED(privdata);
\r
3688 Jim_Free((void*)key);
\r
3691 static Jim_HashTableType JimReferencesHashTableType = {
\r
3692 JimReferencesHTHashFunction, /* hash function */
\r
3693 JimReferencesHTKeyDup, /* key dup */
\r
3694 NULL, /* val dup */
\r
3695 JimReferencesHTKeyCompare, /* key compare */
\r
3696 JimReferencesHTKeyDestructor, /* key destructor */
\r
3697 JimReferencesHTValDestructor /* val destructor */
\r
3700 /* -----------------------------------------------------------------------------
\r
3701 * Reference object type and References API
\r
3702 * ---------------------------------------------------------------------------*/
\r
3704 static void UpdateStringOfReference(struct Jim_Obj *objPtr);
\r
3706 static Jim_ObjType referenceObjType = {
\r
3710 UpdateStringOfReference,
\r
3711 JIM_TYPE_REFERENCES,
\r
3714 void UpdateStringOfReference(struct Jim_Obj *objPtr)
\r
3717 char buf[JIM_REFERENCE_SPACE+1];
\r
3718 Jim_Reference *refPtr;
\r
3720 refPtr = objPtr->internalRep.refValue.refPtr;
\r
3721 len = JimFormatReference(buf, refPtr, objPtr->internalRep.refValue.id);
\r
3722 objPtr->bytes = Jim_Alloc(len+1);
\r
3723 memcpy(objPtr->bytes, buf, len+1);
\r
3724 objPtr->length = len;
\r
3727 /* returns true if 'c' is a valid reference tag character.
\r
3728 * i.e. inside the range [_a-zA-Z0-9] */
\r
3729 static int isrefchar(int c)
\r
3731 if (c == '_' || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') ||
\r
3732 (c >= '0' && c <= '9')) return 1;
\r
3736 int SetReferenceFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
3738 jim_wide wideValue;
\r
3740 const char *str, *start, *end;
\r
3742 Jim_Reference *refPtr;
\r
3743 Jim_HashEntry *he;
\r
3745 /* Get the string representation */
\r
3746 str = Jim_GetString(objPtr, &len);
\r
3747 /* Check if it looks like a reference */
\r
3748 if (len < JIM_REFERENCE_SPACE) goto badformat;
\r
3752 while (*start == ' ') start++;
\r
3753 while (*end == ' ' && end > start) end--;
\r
3754 if (end-start+1 != JIM_REFERENCE_SPACE) goto badformat;
\r
3755 /* <reference.<1234567>.%020> */
\r
3756 if (memcmp(start, "<reference.<", 12) != 0) goto badformat;
\r
3757 if (start[12+JIM_REFERENCE_TAGLEN] != '>' || end[0] != '>') goto badformat;
\r
3758 /* The tag can't contain chars other than a-zA-Z0-9 + '_'. */
\r
3759 for (i = 0; i < JIM_REFERENCE_TAGLEN; i++) {
\r
3760 if (!isrefchar(start[12+i])) goto badformat;
\r
3762 /* Extract info from the refernece. */
\r
3763 memcpy(refId, start+14+JIM_REFERENCE_TAGLEN, 20);
\r
3765 /* Try to convert the ID into a jim_wide */
\r
3766 if (Jim_StringToWide(refId, &wideValue, 10) != JIM_OK) goto badformat;
\r
3767 /* Check if the reference really exists! */
\r
3768 he = Jim_FindHashEntry(&interp->references, &wideValue);
\r
3770 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3771 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3772 "Invalid reference ID \"", str, "\"", NULL);
\r
3776 /* Free the old internal repr and set the new one. */
\r
3777 Jim_FreeIntRep(interp, objPtr);
\r
3778 objPtr->typePtr = &referenceObjType;
\r
3779 objPtr->internalRep.refValue.id = wideValue;
\r
3780 objPtr->internalRep.refValue.refPtr = refPtr;
\r
3784 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
3785 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
3786 "expected reference but got \"", str, "\"", NULL);
\r
3790 /* Returns a new reference pointing to objPtr, having cmdNamePtr
\r
3791 * as finalizer command (or NULL if there is no finalizer).
\r
3792 * The returned reference object has refcount = 0. */
\r
3793 Jim_Obj *Jim_NewReference(Jim_Interp *interp, Jim_Obj *objPtr, Jim_Obj *tagPtr,
\r
3794 Jim_Obj *cmdNamePtr)
\r
3796 struct Jim_Reference *refPtr;
\r
3797 jim_wide wideValue = interp->referenceNextId;
\r
3798 Jim_Obj *refObjPtr;
\r
3802 /* Perform the Garbage Collection if needed. */
\r
3803 Jim_CollectIfNeeded(interp);
\r
3805 refPtr = Jim_Alloc(sizeof(*refPtr));
\r
3806 refPtr->objPtr = objPtr;
\r
3807 Jim_IncrRefCount(objPtr);
\r
3808 refPtr->finalizerCmdNamePtr = cmdNamePtr;
\r
3810 Jim_IncrRefCount(cmdNamePtr);
\r
3811 Jim_AddHashEntry(&interp->references, &wideValue, refPtr);
\r
3812 refObjPtr = Jim_NewObj(interp);
\r
3813 refObjPtr->typePtr = &referenceObjType;
\r
3814 refObjPtr->bytes = NULL;
\r
3815 refObjPtr->internalRep.refValue.id = interp->referenceNextId;
\r
3816 refObjPtr->internalRep.refValue.refPtr = refPtr;
\r
3817 interp->referenceNextId++;
\r
3818 /* Set the tag. Trimmered at JIM_REFERENCE_TAGLEN. Everything
\r
3819 * that does not pass the 'isrefchar' test is replaced with '_' */
\r
3820 tag = Jim_GetString(tagPtr, &tagLen);
\r
3821 if (tagLen > JIM_REFERENCE_TAGLEN)
\r
3822 tagLen = JIM_REFERENCE_TAGLEN;
\r
3823 for (i = 0; i < JIM_REFERENCE_TAGLEN; i++) {
\r
3825 refPtr->tag[i] = tag[i];
\r
3827 refPtr->tag[i] = '_';
\r
3829 refPtr->tag[JIM_REFERENCE_TAGLEN] = '\0';
\r
3833 Jim_Reference *Jim_GetReference(Jim_Interp *interp, Jim_Obj *objPtr)
\r
3835 if (objPtr->typePtr != &referenceObjType &&
\r
3836 SetReferenceFromAny(interp, objPtr) == JIM_ERR)
\r
3838 return objPtr->internalRep.refValue.refPtr;
\r
3841 int Jim_SetFinalizer(Jim_Interp *interp, Jim_Obj *objPtr, Jim_Obj *cmdNamePtr)
\r
3843 Jim_Reference *refPtr;
\r
3845 if ((refPtr = Jim_GetReference(interp, objPtr)) == NULL)
\r
3847 Jim_IncrRefCount(cmdNamePtr);
\r
3848 if (refPtr->finalizerCmdNamePtr)
\r
3849 Jim_DecrRefCount(interp, refPtr->finalizerCmdNamePtr);
\r
3850 refPtr->finalizerCmdNamePtr = cmdNamePtr;
\r
3854 int Jim_GetFinalizer(Jim_Interp *interp, Jim_Obj *objPtr, Jim_Obj **cmdNamePtrPtr)
\r
3856 Jim_Reference *refPtr;
\r
3858 if ((refPtr = Jim_GetReference(interp, objPtr)) == NULL)
\r
3860 *cmdNamePtrPtr = refPtr->finalizerCmdNamePtr;
\r
3864 /* -----------------------------------------------------------------------------
\r
3865 * References Garbage Collection
\r
3866 * ---------------------------------------------------------------------------*/
\r
3868 /* This the hash table type for the "MARK" phase of the GC */
\r
3869 static Jim_HashTableType JimRefMarkHashTableType = {
\r
3870 JimReferencesHTHashFunction, /* hash function */
\r
3871 JimReferencesHTKeyDup, /* key dup */
\r
3872 NULL, /* val dup */
\r
3873 JimReferencesHTKeyCompare, /* key compare */
\r
3874 JimReferencesHTKeyDestructor, /* key destructor */
\r
3875 NULL /* val destructor */
\r
3878 /* #define JIM_DEBUG_GC 1 */
\r
3880 /* Performs the garbage collection. */
\r
3881 int Jim_Collect(Jim_Interp *interp)
\r
3883 Jim_HashTable marks;
\r
3884 Jim_HashTableIterator *htiter;
\r
3885 Jim_HashEntry *he;
\r
3887 int collected = 0;
\r
3889 /* Avoid recursive calls */
\r
3890 if (interp->lastCollectId == -1) {
\r
3891 /* Jim_Collect() already running. Return just now. */
\r
3894 interp->lastCollectId = -1;
\r
3896 /* Mark all the references found into the 'mark' hash table.
\r
3897 * The references are searched in every live object that
\r
3898 * is of a type that can contain references. */
\r
3899 Jim_InitHashTable(&marks, &JimRefMarkHashTableType, NULL);
\r
3900 objPtr = interp->liveList;
\r
3902 if (objPtr->typePtr == NULL ||
\r
3903 objPtr->typePtr->flags & JIM_TYPE_REFERENCES) {
\r
3904 const char *str, *p;
\r
3907 /* If the object is of type reference, to get the
\r
3908 * Id is simple... */
\r
3909 if (objPtr->typePtr == &referenceObjType) {
\r
3910 Jim_AddHashEntry(&marks,
\r
3911 &objPtr->internalRep.refValue.id, NULL);
\r
3912 #ifdef JIM_DEBUG_GC
\r
3913 fprintf(interp->stdout_,
\r
3914 "MARK (reference): %d refcount: %d" JIM_NL,
\r
3915 (int) objPtr->internalRep.refValue.id,
\r
3916 objPtr->refCount);
\r
3918 objPtr = objPtr->nextObjPtr;
\r
3921 /* Get the string repr of the object we want
\r
3922 * to scan for references. */
\r
3923 p = str = Jim_GetString(objPtr, &len);
\r
3924 /* Skip objects too little to contain references. */
\r
3925 if (len < JIM_REFERENCE_SPACE) {
\r
3926 objPtr = objPtr->nextObjPtr;
\r
3929 /* Extract references from the object string repr. */
\r
3935 if ((p = strstr(p, "<reference.<")) == NULL)
\r
3937 /* Check if it's a valid reference. */
\r
3938 if (len-(p-str) < JIM_REFERENCE_SPACE) break;
\r
3939 if (p[41] != '>' || p[19] != '>' || p[20] != '.') break;
\r
3940 for (i = 21; i <= 40; i++)
\r
3941 if (!isdigit((int)p[i]))
\r
3944 memcpy(buf, p+21, 20);
\r
3946 Jim_StringToWide(buf, &id, 10);
\r
3948 /* Ok, a reference for the given ID
\r
3949 * was found. Mark it. */
\r
3950 Jim_AddHashEntry(&marks, &id, NULL);
\r
3951 #ifdef JIM_DEBUG_GC
\r
3952 fprintf(interp->stdout_,"MARK: %d" JIM_NL, (int)id);
\r
3954 p += JIM_REFERENCE_SPACE;
\r
3957 objPtr = objPtr->nextObjPtr;
\r
3960 /* Run the references hash table to destroy every reference that
\r
3961 * is not referenced outside (not present in the mark HT). */
\r
3962 htiter = Jim_GetHashTableIterator(&interp->references);
\r
3963 while ((he = Jim_NextHashEntry(htiter)) != NULL) {
\r
3964 const jim_wide *refId;
\r
3965 Jim_Reference *refPtr;
\r
3968 /* Check if in the mark phase we encountered
\r
3969 * this reference. */
\r
3970 if (Jim_FindHashEntry(&marks, refId) == NULL) {
\r
3971 #ifdef JIM_DEBUG_GC
\r
3972 fprintf(interp->stdout_,"COLLECTING %d" JIM_NL, (int)*refId);
\r
3975 /* Drop the reference, but call the
\r
3976 * finalizer first if registered. */
\r
3978 if (refPtr->finalizerCmdNamePtr) {
\r
3979 char *refstr = Jim_Alloc(JIM_REFERENCE_SPACE+1);
\r
3980 Jim_Obj *objv[3], *oldResult;
\r
3982 JimFormatReference(refstr, refPtr, *refId);
\r
3984 objv[0] = refPtr->finalizerCmdNamePtr;
\r
3985 objv[1] = Jim_NewStringObjNoAlloc(interp,
\r
3987 objv[2] = refPtr->objPtr;
\r
3988 Jim_IncrRefCount(objv[0]);
\r
3989 Jim_IncrRefCount(objv[1]);
\r
3990 Jim_IncrRefCount(objv[2]);
\r
3992 /* Drop the reference itself */
\r
3993 Jim_DeleteHashEntry(&interp->references, refId);
\r
3995 /* Call the finalizer. Errors ignored. */
\r
3996 oldResult = interp->result;
\r
3997 Jim_IncrRefCount(oldResult);
\r
3998 Jim_EvalObjVector(interp, 3, objv);
\r
3999 Jim_SetResult(interp, oldResult);
\r
4000 Jim_DecrRefCount(interp, oldResult);
\r
4002 Jim_DecrRefCount(interp, objv[0]);
\r
4003 Jim_DecrRefCount(interp, objv[1]);
\r
4004 Jim_DecrRefCount(interp, objv[2]);
\r
4006 Jim_DeleteHashEntry(&interp->references, refId);
\r
4010 Jim_FreeHashTableIterator(htiter);
\r
4011 Jim_FreeHashTable(&marks);
\r
4012 interp->lastCollectId = interp->referenceNextId;
\r
4013 interp->lastCollectTime = time(NULL);
\r
4017 #define JIM_COLLECT_ID_PERIOD 5000
\r
4018 #define JIM_COLLECT_TIME_PERIOD 300
\r
4020 void Jim_CollectIfNeeded(Jim_Interp *interp)
\r
4022 jim_wide elapsedId;
\r
4025 elapsedId = interp->referenceNextId - interp->lastCollectId;
\r
4026 elapsedTime = time(NULL) - interp->lastCollectTime;
\r
4029 if (elapsedId > JIM_COLLECT_ID_PERIOD ||
\r
4030 elapsedTime > JIM_COLLECT_TIME_PERIOD) {
\r
4031 Jim_Collect(interp);
\r
4035 /* -----------------------------------------------------------------------------
\r
4036 * Interpreter related functions
\r
4037 * ---------------------------------------------------------------------------*/
\r
4039 Jim_Interp *Jim_CreateInterp(void)
\r
4041 Jim_Interp *i = Jim_Alloc(sizeof(*i));
\r
4045 i->errorFileName = Jim_StrDup("");
\r
4047 i->maxNestingDepth = JIM_MAX_NESTING_DEPTH;
\r
4048 i->returnCode = JIM_OK;
\r
4051 i->callFrameEpoch = 0;
\r
4052 i->liveList = i->freeList = NULL;
\r
4053 i->scriptFileName = Jim_StrDup("");
\r
4054 i->referenceNextId = 0;
\r
4055 i->lastCollectId = 0;
\r
4056 i->lastCollectTime = time(NULL);
\r
4057 i->freeFramesList = NULL;
\r
4058 i->prngState = NULL;
\r
4059 i->evalRetcodeLevel = -1;
\r
4060 i->stdin_ = stdin;
\r
4061 i->stdout_ = stdout;
\r
4062 i->stderr_ = stderr;
\r
4064 /* Note that we can create objects only after the
\r
4065 * interpreter liveList and freeList pointers are
\r
4066 * initialized to NULL. */
\r
4067 Jim_InitHashTable(&i->commands, &JimCommandsHashTableType, i);
\r
4068 Jim_InitHashTable(&i->references, &JimReferencesHashTableType, i);
\r
4069 Jim_InitHashTable(&i->sharedStrings, &JimSharedStringsHashTableType,
\r
4071 Jim_InitHashTable(&i->stub, &JimStringCopyHashTableType, NULL);
\r
4072 Jim_InitHashTable(&i->assocData, &JimAssocDataHashTableType, i);
\r
4073 Jim_InitHashTable(&i->packages, &JimStringKeyValCopyHashTableType, NULL);
\r
4074 i->framePtr = i->topFramePtr = JimCreateCallFrame(i);
\r
4075 i->emptyObj = Jim_NewEmptyStringObj(i);
\r
4076 i->result = i->emptyObj;
\r
4077 i->stackTrace = Jim_NewListObj(i, NULL, 0);
\r
4078 i->unknown = Jim_NewStringObj(i, "unknown", -1);
\r
4079 Jim_IncrRefCount(i->emptyObj);
\r
4080 Jim_IncrRefCount(i->result);
\r
4081 Jim_IncrRefCount(i->stackTrace);
\r
4082 Jim_IncrRefCount(i->unknown);
\r
4084 /* Initialize key variables every interpreter should contain */
\r
4085 pathPtr = Jim_NewStringObj(i, "./", -1);
\r
4086 Jim_SetVariableStr(i, "jim_libpath", pathPtr);
\r
4087 Jim_SetVariableStrWithStr(i, "jim_interactive", "0");
\r
4089 /* Export the core API to extensions */
\r
4090 JimRegisterCoreApi(i);
\r
4094 /* This is the only function Jim exports directly without
\r
4095 * to use the STUB system. It is only used by embedders
\r
4096 * in order to get an interpreter with the Jim API pointers
\r
4098 Jim_Interp *ExportedJimCreateInterp(void)
\r
4100 return Jim_CreateInterp();
\r
4103 void Jim_FreeInterp(Jim_Interp *i)
\r
4105 Jim_CallFrame *cf = i->framePtr, *prevcf, *nextcf;
\r
4106 Jim_Obj *objPtr, *nextObjPtr;
\r
4108 Jim_DecrRefCount(i, i->emptyObj);
\r
4109 Jim_DecrRefCount(i, i->result);
\r
4110 Jim_DecrRefCount(i, i->stackTrace);
\r
4111 Jim_DecrRefCount(i, i->unknown);
\r
4112 Jim_Free((void*)i->errorFileName);
\r
4113 Jim_Free((void*)i->scriptFileName);
\r
4114 Jim_FreeHashTable(&i->commands);
\r
4115 Jim_FreeHashTable(&i->references);
\r
4116 Jim_FreeHashTable(&i->stub);
\r
4117 Jim_FreeHashTable(&i->assocData);
\r
4118 Jim_FreeHashTable(&i->packages);
\r
4119 Jim_Free(i->prngState);
\r
4120 /* Free the call frames list */
\r
4122 prevcf = cf->parentCallFrame;
\r
4123 JimFreeCallFrame(i, cf, JIM_FCF_NONE);
\r
4126 /* Check that the live object list is empty, otherwise
\r
4127 * there is a memory leak. */
\r
4128 if (i->liveList != NULL) {
\r
4129 Jim_Obj *objPtr = i->liveList;
\r
4131 fprintf(i->stdout_,JIM_NL "-------------------------------------" JIM_NL);
\r
4132 fprintf(i->stdout_,"Objects still in the free list:" JIM_NL);
\r
4134 const char *type = objPtr->typePtr ?
\r
4135 objPtr->typePtr->name : "";
\r
4136 fprintf(i->stdout_,"%p \"%-10s\": '%.20s' (refCount: %d)" JIM_NL,
\r
4138 objPtr->bytes ? objPtr->bytes
\r
4139 : "(null)", objPtr->refCount);
\r
4140 if (objPtr->typePtr == &sourceObjType) {
\r
4141 fprintf(i->stdout_, "FILE %s LINE %d" JIM_NL,
\r
4142 objPtr->internalRep.sourceValue.fileName,
\r
4143 objPtr->internalRep.sourceValue.lineNumber);
\r
4145 objPtr = objPtr->nextObjPtr;
\r
4147 fprintf(stdout, "-------------------------------------" JIM_NL JIM_NL);
\r
4148 Jim_Panic(i,"Live list non empty freeing the interpreter! Leak?");
\r
4150 /* Free all the freed objects. */
\r
4151 objPtr = i->freeList;
\r
4153 nextObjPtr = objPtr->nextObjPtr;
\r
4155 objPtr = nextObjPtr;
\r
4157 /* Free cached CallFrame structures */
\r
4158 cf = i->freeFramesList;
\r
4160 nextcf = cf->nextFramePtr;
\r
4161 if (cf->vars.table != NULL)
\r
4162 Jim_Free(cf->vars.table);
\r
4166 /* Free the sharedString hash table. Make sure to free it
\r
4167 * after every other Jim_Object was freed. */
\r
4168 Jim_FreeHashTable(&i->sharedStrings);
\r
4169 /* Free the interpreter structure. */
\r
4173 /* Store the call frame relative to the level represented by
\r
4174 * levelObjPtr into *framePtrPtr. If levelObjPtr == NULL, the
\r
4175 * level is assumed to be '1'.
\r
4177 * If a newLevelptr int pointer is specified, the function stores
\r
4178 * the absolute level integer value of the new target callframe into
\r
4179 * *newLevelPtr. (this is used to adjust interp->numLevels
\r
4180 * in the implementation of [uplevel], so that [info level] will
\r
4181 * return a correct information).
\r
4183 * This function accepts the 'level' argument in the form
\r
4184 * of the commands [uplevel] and [upvar].
\r
4186 * For a function accepting a relative integer as level suitable
\r
4187 * for implementation of [info level ?level?] check the
\r
4188 * GetCallFrameByInteger() function. */
\r
4189 int Jim_GetCallFrameByLevel(Jim_Interp *interp, Jim_Obj *levelObjPtr,
\r
4190 Jim_CallFrame **framePtrPtr, int *newLevelPtr)
\r
4194 Jim_CallFrame *framePtr;
\r
4196 if (newLevelPtr) *newLevelPtr = interp->numLevels;
\r
4197 if (levelObjPtr) {
\r
4198 str = Jim_GetString(levelObjPtr, NULL);
\r
4199 if (str[0] == '#') {
\r
4201 /* speedup for the toplevel (level #0) */
\r
4202 if (str[1] == '0' && str[2] == '\0') {
\r
4203 if (newLevelPtr) *newLevelPtr = 0;
\r
4204 *framePtrPtr = interp->topFramePtr;
\r
4208 level = strtol(str+1, &endptr, 0);
\r
4209 if (str[1] == '\0' || endptr[0] != '\0' || level < 0)
\r
4211 /* An 'absolute' level is converted into the
\r
4212 * 'number of levels to go back' format. */
\r
4213 level = interp->numLevels - level;
\r
4214 if (level < 0) goto badlevel;
\r
4216 if (Jim_GetLong(interp, levelObjPtr, &level) != JIM_OK || level < 0)
\r
4220 str = "1"; /* Needed to format the error message. */
\r
4224 framePtr = interp->framePtr;
\r
4225 if (newLevelPtr) *newLevelPtr = (*newLevelPtr)-level;
\r
4227 framePtr = framePtr->parentCallFrame;
\r
4228 if (framePtr == NULL) goto badlevel;
\r
4230 *framePtrPtr = framePtr;
\r
4233 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
4234 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
4235 "bad level \"", str, "\"", NULL);
\r
4239 /* Similar to Jim_GetCallFrameByLevel() but the level is specified
\r
4240 * as a relative integer like in the [info level ?level?] command. */
\r
4241 static int JimGetCallFrameByInteger(Jim_Interp *interp, Jim_Obj *levelObjPtr,
\r
4242 Jim_CallFrame **framePtrPtr)
\r
4245 jim_wide relLevel; /* level relative to the current one. */
\r
4246 Jim_CallFrame *framePtr;
\r
4248 if (Jim_GetWide(interp, levelObjPtr, &level) != JIM_OK)
\r
4251 /* An 'absolute' level is converted into the
\r
4252 * 'number of levels to go back' format. */
\r
4253 relLevel = interp->numLevels - level;
\r
4255 relLevel = -level;
\r
4258 framePtr = interp->framePtr;
\r
4259 while (relLevel--) {
\r
4260 framePtr = framePtr->parentCallFrame;
\r
4261 if (framePtr == NULL) goto badlevel;
\r
4263 *framePtrPtr = framePtr;
\r
4266 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
4267 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
4268 "bad level \"", Jim_GetString(levelObjPtr, NULL), "\"", NULL);
\r
4272 static void JimSetErrorFileName(Jim_Interp *interp, char *filename)
\r
4274 Jim_Free((void*)interp->errorFileName);
\r
4275 interp->errorFileName = Jim_StrDup(filename);
\r
4278 static void JimSetErrorLineNumber(Jim_Interp *interp, int linenr)
\r
4280 interp->errorLine = linenr;
\r
4283 static void JimResetStackTrace(Jim_Interp *interp)
\r
4285 Jim_DecrRefCount(interp, interp->stackTrace);
\r
4286 interp->stackTrace = Jim_NewListObj(interp, NULL, 0);
\r
4287 Jim_IncrRefCount(interp->stackTrace);
\r
4290 static void JimAppendStackTrace(Jim_Interp *interp, const char *procname,
\r
4291 const char *filename, int linenr)
\r
4293 if (Jim_IsShared(interp->stackTrace)) {
\r
4294 interp->stackTrace =
\r
4295 Jim_DuplicateObj(interp, interp->stackTrace);
\r
4296 Jim_IncrRefCount(interp->stackTrace);
\r
4298 Jim_ListAppendElement(interp, interp->stackTrace,
\r
4299 Jim_NewStringObj(interp, procname, -1));
\r
4300 Jim_ListAppendElement(interp, interp->stackTrace,
\r
4301 Jim_NewStringObj(interp, filename, -1));
\r
4302 Jim_ListAppendElement(interp, interp->stackTrace,
\r
4303 Jim_NewIntObj(interp, linenr));
\r
4306 int Jim_SetAssocData(Jim_Interp *interp, const char *key, Jim_InterpDeleteProc *delProc, void *data)
\r
4308 AssocDataValue *assocEntryPtr = (AssocDataValue *)Jim_Alloc(sizeof(AssocDataValue));
\r
4309 assocEntryPtr->delProc = delProc;
\r
4310 assocEntryPtr->data = data;
\r
4311 return Jim_AddHashEntry(&interp->assocData, key, assocEntryPtr);
\r
4314 void *Jim_GetAssocData(Jim_Interp *interp, const char *key)
\r
4316 Jim_HashEntry *entryPtr = Jim_FindHashEntry(&interp->assocData, key);
\r
4317 if (entryPtr != NULL) {
\r
4318 AssocDataValue *assocEntryPtr = (AssocDataValue *)entryPtr->val;
\r
4319 return assocEntryPtr->data;
\r
4324 int Jim_DeleteAssocData(Jim_Interp *interp, const char *key)
\r
4326 return Jim_DeleteHashEntry(&interp->assocData, key);
\r
4329 int Jim_GetExitCode(Jim_Interp *interp) {
\r
4330 return interp->exitCode;
\r
4333 FILE *Jim_SetStdin(Jim_Interp *interp, FILE *fp)
\r
4335 if (fp != NULL) interp->stdin_ = fp;
\r
4336 return interp->stdin_;
\r
4339 FILE *Jim_SetStdout(Jim_Interp *interp, FILE *fp)
\r
4341 if (fp != NULL) interp->stdout_ = fp;
\r
4342 return interp->stdout_;
\r
4345 FILE *Jim_SetStderr(Jim_Interp *interp, FILE *fp)
\r
4347 if (fp != NULL) interp->stderr_ = fp;
\r
4348 return interp->stderr_;
\r
4351 /* -----------------------------------------------------------------------------
\r
4353 * Every interpreter has an hash table where to put shared dynamically
\r
4354 * allocate strings that are likely to be used a lot of times.
\r
4355 * For example, in the 'source' object type, there is a pointer to
\r
4356 * the filename associated with that object. Every script has a lot
\r
4357 * of this objects with the identical file name, so it is wise to share
\r
4360 * The API is trivial: Jim_GetSharedString(interp, "foobar")
\r
4361 * returns the pointer to the shared string. Every time a reference
\r
4362 * to the string is no longer used, the user should call
\r
4363 * Jim_ReleaseSharedString(interp, stringPointer). Once no one is using
\r
4364 * a given string, it is removed from the hash table.
\r
4365 * ---------------------------------------------------------------------------*/
\r
4366 const char *Jim_GetSharedString(Jim_Interp *interp, const char *str)
\r
4368 Jim_HashEntry *he = Jim_FindHashEntry(&interp->sharedStrings, str);
\r
4371 char *strCopy = Jim_StrDup(str);
\r
4373 Jim_AddHashEntry(&interp->sharedStrings, strCopy, (void*)1);
\r
4376 long refCount = (long) he->val;
\r
4379 he->val = (void*) refCount;
\r
4384 void Jim_ReleaseSharedString(Jim_Interp *interp, const char *str)
\r
4387 Jim_HashEntry *he = Jim_FindHashEntry(&interp->sharedStrings, str);
\r
4390 Jim_Panic(interp,"Jim_ReleaseSharedString called with "
\r
4391 "unknown shared string '%s'", str);
\r
4392 refCount = (long) he->val;
\r
4394 if (refCount == 0) {
\r
4395 Jim_DeleteHashEntry(&interp->sharedStrings, str);
\r
4397 he->val = (void*) refCount;
\r
4401 /* -----------------------------------------------------------------------------
\r
4403 * ---------------------------------------------------------------------------*/
\r
4404 #define JIM_INTEGER_SPACE 24
\r
4406 static void UpdateStringOfInt(struct Jim_Obj *objPtr);
\r
4407 static int SetIntFromAny(Jim_Interp *interp, Jim_Obj *objPtr, int flags);
\r
4409 static Jim_ObjType intObjType = {
\r
4413 UpdateStringOfInt,
\r
4417 void UpdateStringOfInt(struct Jim_Obj *objPtr)
\r
4420 char buf[JIM_INTEGER_SPACE+1];
\r
4422 len = Jim_WideToString(buf, objPtr->internalRep.wideValue);
\r
4423 objPtr->bytes = Jim_Alloc(len+1);
\r
4424 memcpy(objPtr->bytes, buf, len+1);
\r
4425 objPtr->length = len;
\r
4428 int SetIntFromAny(Jim_Interp *interp, Jim_Obj *objPtr, int flags)
\r
4430 jim_wide wideValue;
\r
4433 /* Get the string representation */
\r
4434 str = Jim_GetString(objPtr, NULL);
\r
4435 /* Try to convert into a jim_wide */
\r
4436 if (Jim_StringToWide(str, &wideValue, 0) != JIM_OK) {
\r
4437 if (flags & JIM_ERRMSG) {
\r
4438 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
4439 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
4440 "expected integer but got \"", str, "\"", NULL);
\r
4444 if ((wideValue == JIM_WIDE_MIN || wideValue == JIM_WIDE_MAX) &&
\r
4445 errno == ERANGE) {
\r
4446 Jim_SetResultString(interp,
\r
4447 "Integer value too big to be represented", -1);
\r
4450 /* Free the old internal repr and set the new one. */
\r
4451 Jim_FreeIntRep(interp, objPtr);
\r
4452 objPtr->typePtr = &intObjType;
\r
4453 objPtr->internalRep.wideValue = wideValue;
\r
4457 int Jim_GetWide(Jim_Interp *interp, Jim_Obj *objPtr, jim_wide *widePtr)
\r
4459 if (objPtr->typePtr != &intObjType &&
\r
4460 SetIntFromAny(interp, objPtr, JIM_ERRMSG) == JIM_ERR)
\r
4462 *widePtr = objPtr->internalRep.wideValue;
\r
4466 /* Get a wide but does not set an error if the format is bad. */
\r
4467 static int JimGetWideNoErr(Jim_Interp *interp, Jim_Obj *objPtr,
\r
4468 jim_wide *widePtr)
\r
4470 if (objPtr->typePtr != &intObjType &&
\r
4471 SetIntFromAny(interp, objPtr, JIM_NONE) == JIM_ERR)
\r
4473 *widePtr = objPtr->internalRep.wideValue;
\r
4477 int Jim_GetLong(Jim_Interp *interp, Jim_Obj *objPtr, long *longPtr)
\r
4479 jim_wide wideValue;
\r
4482 retval = Jim_GetWide(interp, objPtr, &wideValue);
\r
4483 if (retval == JIM_OK) {
\r
4484 *longPtr = (long) wideValue;
\r
4490 void Jim_SetWide(Jim_Interp *interp, Jim_Obj *objPtr, jim_wide wideValue)
\r
4492 if (Jim_IsShared(objPtr))
\r
4493 Jim_Panic(interp,"Jim_SetWide called with shared object");
\r
4494 if (objPtr->typePtr != &intObjType) {
\r
4495 Jim_FreeIntRep(interp, objPtr);
\r
4496 objPtr->typePtr = &intObjType;
\r
4498 Jim_InvalidateStringRep(objPtr);
\r
4499 objPtr->internalRep.wideValue = wideValue;
\r
4502 Jim_Obj *Jim_NewIntObj(Jim_Interp *interp, jim_wide wideValue)
\r
4506 objPtr = Jim_NewObj(interp);
\r
4507 objPtr->typePtr = &intObjType;
\r
4508 objPtr->bytes = NULL;
\r
4509 objPtr->internalRep.wideValue = wideValue;
\r
4513 /* -----------------------------------------------------------------------------
\r
4515 * ---------------------------------------------------------------------------*/
\r
4516 #define JIM_DOUBLE_SPACE 30
\r
4518 static void UpdateStringOfDouble(struct Jim_Obj *objPtr);
\r
4519 static int SetDoubleFromAny(Jim_Interp *interp, Jim_Obj *objPtr);
\r
4521 static Jim_ObjType doubleObjType = {
\r
4525 UpdateStringOfDouble,
\r
4529 void UpdateStringOfDouble(struct Jim_Obj *objPtr)
\r
4532 char buf[JIM_DOUBLE_SPACE+1];
\r
4534 len = Jim_DoubleToString(buf, objPtr->internalRep.doubleValue);
\r
4535 objPtr->bytes = Jim_Alloc(len+1);
\r
4536 memcpy(objPtr->bytes, buf, len+1);
\r
4537 objPtr->length = len;
\r
4540 int SetDoubleFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
4542 double doubleValue;
\r
4545 /* Get the string representation */
\r
4546 str = Jim_GetString(objPtr, NULL);
\r
4547 /* Try to convert into a double */
\r
4548 if (Jim_StringToDouble(str, &doubleValue) != JIM_OK) {
\r
4549 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
4550 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
4551 "expected number but got '", str, "'", NULL);
\r
4554 /* Free the old internal repr and set the new one. */
\r
4555 Jim_FreeIntRep(interp, objPtr);
\r
4556 objPtr->typePtr = &doubleObjType;
\r
4557 objPtr->internalRep.doubleValue = doubleValue;
\r
4561 int Jim_GetDouble(Jim_Interp *interp, Jim_Obj *objPtr, double *doublePtr)
\r
4563 if (objPtr->typePtr != &doubleObjType &&
\r
4564 SetDoubleFromAny(interp, objPtr) == JIM_ERR)
\r
4566 *doublePtr = objPtr->internalRep.doubleValue;
\r
4570 void Jim_SetDouble(Jim_Interp *interp, Jim_Obj *objPtr, double doubleValue)
\r
4572 if (Jim_IsShared(objPtr))
\r
4573 Jim_Panic(interp,"Jim_SetDouble called with shared object");
\r
4574 if (objPtr->typePtr != &doubleObjType) {
\r
4575 Jim_FreeIntRep(interp, objPtr);
\r
4576 objPtr->typePtr = &doubleObjType;
\r
4578 Jim_InvalidateStringRep(objPtr);
\r
4579 objPtr->internalRep.doubleValue = doubleValue;
\r
4582 Jim_Obj *Jim_NewDoubleObj(Jim_Interp *interp, double doubleValue)
\r
4586 objPtr = Jim_NewObj(interp);
\r
4587 objPtr->typePtr = &doubleObjType;
\r
4588 objPtr->bytes = NULL;
\r
4589 objPtr->internalRep.doubleValue = doubleValue;
\r
4593 /* -----------------------------------------------------------------------------
\r
4595 * ---------------------------------------------------------------------------*/
\r
4596 static void ListAppendElement(Jim_Obj *listPtr, Jim_Obj *objPtr);
\r
4597 static void FreeListInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
4598 static void DupListInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
4599 static void UpdateStringOfList(struct Jim_Obj *objPtr);
\r
4600 static int SetListFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
4602 /* Note that while the elements of the list may contain references,
\r
4603 * the list object itself can't. This basically means that the
\r
4604 * list object string representation as a whole can't contain references
\r
4605 * that are not presents in the single elements. */
\r
4606 static Jim_ObjType listObjType = {
\r
4608 FreeListInternalRep,
\r
4609 DupListInternalRep,
\r
4610 UpdateStringOfList,
\r
4614 void FreeListInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
4618 for (i = 0; i < objPtr->internalRep.listValue.len; i++) {
\r
4619 Jim_DecrRefCount(interp, objPtr->internalRep.listValue.ele[i]);
\r
4621 Jim_Free(objPtr->internalRep.listValue.ele);
\r
4624 void DupListInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
4627 JIM_NOTUSED(interp);
\r
4629 dupPtr->internalRep.listValue.len = srcPtr->internalRep.listValue.len;
\r
4630 dupPtr->internalRep.listValue.maxLen = srcPtr->internalRep.listValue.maxLen;
\r
4631 dupPtr->internalRep.listValue.ele =
\r
4632 Jim_Alloc(sizeof(Jim_Obj*)*srcPtr->internalRep.listValue.maxLen);
\r
4633 memcpy(dupPtr->internalRep.listValue.ele, srcPtr->internalRep.listValue.ele,
\r
4634 sizeof(Jim_Obj*)*srcPtr->internalRep.listValue.len);
\r
4635 for (i = 0; i < dupPtr->internalRep.listValue.len; i++) {
\r
4636 Jim_IncrRefCount(dupPtr->internalRep.listValue.ele[i]);
\r
4638 dupPtr->typePtr = &listObjType;
\r
4641 /* The following function checks if a given string can be encoded
\r
4642 * into a list element without any kind of quoting, surrounded by braces,
\r
4643 * or using escapes to quote. */
\r
4644 #define JIM_ELESTR_SIMPLE 0
\r
4645 #define JIM_ELESTR_BRACE 1
\r
4646 #define JIM_ELESTR_QUOTE 2
\r
4647 static int ListElementQuotingType(const char *s, int len)
\r
4649 int i, level, trySimple = 1;
\r
4651 /* Try with the SIMPLE case */
\r
4652 if (len == 0) return JIM_ELESTR_BRACE;
\r
4653 if (s[0] == '"' || s[0] == '{') {
\r
4657 for (i = 0; i < len; i++) {
\r
4677 return JIM_ELESTR_SIMPLE;
\r
4680 /* Test if it's possible to do with braces */
\r
4681 if (s[len-1] == '\\' ||
\r
4682 s[len-1] == ']') return JIM_ELESTR_QUOTE;
\r
4684 for (i = 0; i < len; i++) {
\r
4686 case '{': level++; break;
\r
4687 case '}': level--;
\r
4688 if (level < 0) return JIM_ELESTR_QUOTE;
\r
4691 if (s[i+1] == '\n')
\r
4692 return JIM_ELESTR_QUOTE;
\r
4694 if (s[i+1] != '\0') i++;
\r
4699 if (!trySimple) return JIM_ELESTR_BRACE;
\r
4700 for (i = 0; i < len; i++) {
\r
4714 return JIM_ELESTR_BRACE;
\r
4718 return JIM_ELESTR_SIMPLE;
\r
4720 return JIM_ELESTR_QUOTE;
\r
4723 /* Returns the malloc-ed representation of a string
\r
4724 * using backslash to quote special chars. */
\r
4725 char *BackslashQuoteString(const char *s, int len, int *qlenPtr)
\r
4727 char *q = Jim_Alloc(len*2+1), *p;
\r
4744 case '\n': *p++ = '\\'; *p++ = 'n'; s++; break;
\r
4745 case '\r': *p++ = '\\'; *p++ = 'r'; s++; break;
\r
4746 case '\t': *p++ = '\\'; *p++ = 't'; s++; break;
\r
4747 case '\f': *p++ = '\\'; *p++ = 'f'; s++; break;
\r
4748 case '\v': *p++ = '\\'; *p++ = 'v'; s++; break;
\r
4759 void UpdateStringOfList(struct Jim_Obj *objPtr)
\r
4761 int i, bufLen, realLength;
\r
4762 const char *strRep;
\r
4765 Jim_Obj **ele = objPtr->internalRep.listValue.ele;
\r
4767 /* (Over) Estimate the space needed. */
\r
4768 quotingType = Jim_Alloc(sizeof(int)*objPtr->internalRep.listValue.len+1);
\r
4770 for (i = 0; i < objPtr->internalRep.listValue.len; i++) {
\r
4773 strRep = Jim_GetString(ele[i], &len);
\r
4774 quotingType[i] = ListElementQuotingType(strRep, len);
\r
4775 switch (quotingType[i]) {
\r
4776 case JIM_ELESTR_SIMPLE: bufLen += len; break;
\r
4777 case JIM_ELESTR_BRACE: bufLen += len+2; break;
\r
4778 case JIM_ELESTR_QUOTE: bufLen += len*2; break;
\r
4780 bufLen++; /* elements separator. */
\r
4784 /* Generate the string rep. */
\r
4785 p = objPtr->bytes = Jim_Alloc(bufLen+1);
\r
4787 for (i = 0; i < objPtr->internalRep.listValue.len; i++) {
\r
4789 const char *strRep = Jim_GetString(ele[i], &len);
\r
4792 switch(quotingType[i]) {
\r
4793 case JIM_ELESTR_SIMPLE:
\r
4794 memcpy(p, strRep, len);
\r
4796 realLength += len;
\r
4798 case JIM_ELESTR_BRACE:
\r
4800 memcpy(p, strRep, len);
\r
4803 realLength += len+2;
\r
4805 case JIM_ELESTR_QUOTE:
\r
4806 q = BackslashQuoteString(strRep, len, &qlen);
\r
4807 memcpy(p, q, qlen);
\r
4810 realLength += qlen;
\r
4813 /* Add a separating space */
\r
4814 if (i+1 != objPtr->internalRep.listValue.len) {
\r
4819 *p = '\0'; /* nul term. */
\r
4820 objPtr->length = realLength;
\r
4821 Jim_Free(quotingType);
\r
4824 int SetListFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr)
\r
4826 struct JimParserCtx parser;
\r
4830 /* Get the string representation */
\r
4831 str = Jim_GetString(objPtr, &strLen);
\r
4833 /* Free the old internal repr just now and initialize the
\r
4834 * new one just now. The string->list conversion can't fail. */
\r
4835 Jim_FreeIntRep(interp, objPtr);
\r
4836 objPtr->typePtr = &listObjType;
\r
4837 objPtr->internalRep.listValue.len = 0;
\r
4838 objPtr->internalRep.listValue.maxLen = 0;
\r
4839 objPtr->internalRep.listValue.ele = NULL;
\r
4841 /* Convert into a list */
\r
4842 JimParserInit(&parser, str, strLen, 1);
\r
4843 while(!JimParserEof(&parser)) {
\r
4845 int tokenLen, type;
\r
4846 Jim_Obj *elementPtr;
\r
4848 JimParseList(&parser);
\r
4849 if (JimParserTtype(&parser) != JIM_TT_STR &&
\r
4850 JimParserTtype(&parser) != JIM_TT_ESC)
\r
4852 token = JimParserGetToken(&parser, &tokenLen, &type, NULL);
\r
4853 elementPtr = Jim_NewStringObjNoAlloc(interp, token, tokenLen);
\r
4854 ListAppendElement(objPtr, elementPtr);
\r
4859 Jim_Obj *Jim_NewListObj(Jim_Interp *interp, Jim_Obj *const *elements,
\r
4865 objPtr = Jim_NewObj(interp);
\r
4866 objPtr->typePtr = &listObjType;
\r
4867 objPtr->bytes = NULL;
\r
4868 objPtr->internalRep.listValue.ele = NULL;
\r
4869 objPtr->internalRep.listValue.len = 0;
\r
4870 objPtr->internalRep.listValue.maxLen = 0;
\r
4871 for (i = 0; i < len; i++) {
\r
4872 ListAppendElement(objPtr, elements[i]);
\r
4877 /* Return a vector of Jim_Obj with the elements of a Jim list, and the
\r
4878 * length of the vector. Note that the user of this function should make
\r
4879 * sure that the list object can't shimmer while the vector returned
\r
4880 * is in use, this vector is the one stored inside the internal representation
\r
4881 * of the list object. This function is not exported, extensions should
\r
4882 * always access to the List object elements using Jim_ListIndex(). */
\r
4883 static void JimListGetElements(Jim_Interp *interp, Jim_Obj *listObj, int *argc,
\r
4884 Jim_Obj ***listVec)
\r
4886 Jim_ListLength(interp, listObj, argc);
\r
4887 assert(listObj->typePtr == &listObjType);
\r
4888 *listVec = listObj->internalRep.listValue.ele;
\r
4891 /* ListSortElements type values */
\r
4892 enum {JIM_LSORT_ASCII, JIM_LSORT_NOCASE, JIM_LSORT_ASCII_DECR,
\r
4893 JIM_LSORT_NOCASE_DECR};
\r
4895 /* Sort the internal rep of a list. */
\r
4896 static int ListSortString(Jim_Obj **lhsObj, Jim_Obj **rhsObj)
\r
4898 return Jim_StringCompareObj(*lhsObj, *rhsObj, 0);
\r
4901 static int ListSortStringDecr(Jim_Obj **lhsObj, Jim_Obj **rhsObj)
\r
4903 return Jim_StringCompareObj(*lhsObj, *rhsObj, 0) * -1;
\r
4906 static int ListSortStringNoCase(Jim_Obj **lhsObj, Jim_Obj **rhsObj)
\r
4908 return Jim_StringCompareObj(*lhsObj, *rhsObj, 1);
\r
4911 static int ListSortStringNoCaseDecr(Jim_Obj **lhsObj, Jim_Obj **rhsObj)
\r
4913 return Jim_StringCompareObj(*lhsObj, *rhsObj, 1) * -1;
\r
4916 /* Sort a list *in place*. MUST be called with non-shared objects. */
\r
4917 static void ListSortElements(Jim_Interp *interp, Jim_Obj *listObjPtr, int type)
\r
4919 typedef int (qsort_comparator)(const void *, const void *);
\r
4920 int (*fn)(Jim_Obj**, Jim_Obj**);
\r
4924 if (Jim_IsShared(listObjPtr))
\r
4925 Jim_Panic(interp,"Jim_ListSortElements called with shared object");
\r
4926 if (listObjPtr->typePtr != &listObjType)
\r
4927 SetListFromAny(interp, listObjPtr);
\r
4929 vector = listObjPtr->internalRep.listValue.ele;
\r
4930 len = listObjPtr->internalRep.listValue.len;
\r
4932 case JIM_LSORT_ASCII: fn = ListSortString; break;
\r
4933 case JIM_LSORT_NOCASE: fn = ListSortStringNoCase; break;
\r
4934 case JIM_LSORT_ASCII_DECR: fn = ListSortStringDecr; break;
\r
4935 case JIM_LSORT_NOCASE_DECR: fn = ListSortStringNoCaseDecr; break;
\r
4937 fn = NULL; /* avoid warning */
\r
4938 Jim_Panic(interp,"ListSort called with invalid sort type");
\r
4940 qsort(vector, len, sizeof(Jim_Obj *), (qsort_comparator *)fn);
\r
4941 Jim_InvalidateStringRep(listObjPtr);
\r
4944 /* This is the low-level function to append an element to a list.
\r
4945 * The higher-level Jim_ListAppendElement() performs shared object
\r
4946 * check and invalidate the string repr. This version is used
\r
4947 * in the internals of the List Object and is not exported.
\r
4949 * NOTE: this function can be called only against objects
\r
4950 * with internal type of List. */
\r
4951 void ListAppendElement(Jim_Obj *listPtr, Jim_Obj *objPtr)
\r
4953 int requiredLen = listPtr->internalRep.listValue.len + 1;
\r
4955 if (requiredLen > listPtr->internalRep.listValue.maxLen) {
\r
4956 int maxLen = requiredLen * 2;
\r
4958 listPtr->internalRep.listValue.ele =
\r
4959 Jim_Realloc(listPtr->internalRep.listValue.ele,
\r
4960 sizeof(Jim_Obj*)*maxLen);
\r
4961 listPtr->internalRep.listValue.maxLen = maxLen;
\r
4963 listPtr->internalRep.listValue.ele[listPtr->internalRep.listValue.len] =
\r
4965 listPtr->internalRep.listValue.len ++;
\r
4966 Jim_IncrRefCount(objPtr);
\r
4969 /* This is the low-level function to insert elements into a list.
\r
4970 * The higher-level Jim_ListInsertElements() performs shared object
\r
4971 * check and invalidate the string repr. This version is used
\r
4972 * in the internals of the List Object and is not exported.
\r
4974 * NOTE: this function can be called only against objects
\r
4975 * with internal type of List. */
\r
4976 void ListInsertElements(Jim_Obj *listPtr, int index, int elemc,
\r
4977 Jim_Obj *const *elemVec)
\r
4979 int currentLen = listPtr->internalRep.listValue.len;
\r
4980 int requiredLen = currentLen + elemc;
\r
4984 if (requiredLen > listPtr->internalRep.listValue.maxLen) {
\r
4985 int maxLen = requiredLen * 2;
\r
4987 listPtr->internalRep.listValue.ele =
\r
4988 Jim_Realloc(listPtr->internalRep.listValue.ele,
\r
4989 sizeof(Jim_Obj*)*maxLen);
\r
4990 listPtr->internalRep.listValue.maxLen = maxLen;
\r
4992 point = listPtr->internalRep.listValue.ele + index;
\r
4993 memmove(point+elemc, point, (currentLen-index) * sizeof(Jim_Obj*));
\r
4994 for (i=0; i < elemc; ++i) {
\r
4995 point[i] = elemVec[i];
\r
4996 Jim_IncrRefCount(point[i]);
\r
4998 listPtr->internalRep.listValue.len += elemc;
\r
5001 /* Appends every element of appendListPtr into listPtr.
\r
5002 * Both have to be of the list type. */
\r
5003 void ListAppendList(Jim_Obj *listPtr, Jim_Obj *appendListPtr)
\r
5005 int i, oldLen = listPtr->internalRep.listValue.len;
\r
5006 int appendLen = appendListPtr->internalRep.listValue.len;
\r
5007 int requiredLen = oldLen + appendLen;
\r
5009 if (requiredLen > listPtr->internalRep.listValue.maxLen) {
\r
5010 int maxLen = requiredLen * 2;
\r
5012 listPtr->internalRep.listValue.ele =
\r
5013 Jim_Realloc(listPtr->internalRep.listValue.ele,
\r
5014 sizeof(Jim_Obj*)*maxLen);
\r
5015 listPtr->internalRep.listValue.maxLen = maxLen;
\r
5017 for (i = 0; i < appendLen; i++) {
\r
5018 Jim_Obj *objPtr = appendListPtr->internalRep.listValue.ele[i];
\r
5019 listPtr->internalRep.listValue.ele[oldLen+i] = objPtr;
\r
5020 Jim_IncrRefCount(objPtr);
\r
5022 listPtr->internalRep.listValue.len += appendLen;
\r
5025 void Jim_ListAppendElement(Jim_Interp *interp, Jim_Obj *listPtr, Jim_Obj *objPtr)
\r
5027 if (Jim_IsShared(listPtr))
\r
5028 Jim_Panic(interp,"Jim_ListAppendElement called with shared object");
\r
5029 if (listPtr->typePtr != &listObjType)
\r
5030 SetListFromAny(interp, listPtr);
\r
5031 Jim_InvalidateStringRep(listPtr);
\r
5032 ListAppendElement(listPtr, objPtr);
\r
5035 void Jim_ListAppendList(Jim_Interp *interp, Jim_Obj *listPtr, Jim_Obj *appendListPtr)
\r
5037 if (Jim_IsShared(listPtr))
\r
5038 Jim_Panic(interp,"Jim_ListAppendList called with shared object");
\r
5039 if (listPtr->typePtr != &listObjType)
\r
5040 SetListFromAny(interp, listPtr);
\r
5041 Jim_InvalidateStringRep(listPtr);
\r
5042 ListAppendList(listPtr, appendListPtr);
\r
5045 void Jim_ListLength(Jim_Interp *interp, Jim_Obj *listPtr, int *intPtr)
\r
5047 if (listPtr->typePtr != &listObjType)
\r
5048 SetListFromAny(interp, listPtr);
\r
5049 *intPtr = listPtr->internalRep.listValue.len;
\r
5052 void Jim_ListInsertElements(Jim_Interp *interp, Jim_Obj *listPtr, int index,
\r
5053 int objc, Jim_Obj *const *objVec)
\r
5055 if (Jim_IsShared(listPtr))
\r
5056 Jim_Panic(interp,"Jim_ListInsertElement called with shared object");
\r
5057 if (listPtr->typePtr != &listObjType)
\r
5058 SetListFromAny(interp, listPtr);
\r
5059 if (index >= 0 && index > listPtr->internalRep.listValue.len)
\r
5060 index = listPtr->internalRep.listValue.len;
\r
5061 else if (index < 0 )
\r
5063 Jim_InvalidateStringRep(listPtr);
\r
5064 ListInsertElements(listPtr, index, objc, objVec);
\r
5067 int Jim_ListIndex(Jim_Interp *interp, Jim_Obj *listPtr, int index,
\r
5068 Jim_Obj **objPtrPtr, int flags)
\r
5070 if (listPtr->typePtr != &listObjType)
\r
5071 SetListFromAny(interp, listPtr);
\r
5072 if ((index >= 0 && index >= listPtr->internalRep.listValue.len) ||
\r
5073 (index < 0 && (-index-1) >= listPtr->internalRep.listValue.len)) {
\r
5074 if (flags & JIM_ERRMSG) {
\r
5075 Jim_SetResultString(interp,
\r
5076 "list index out of range", -1);
\r
5081 index = listPtr->internalRep.listValue.len+index;
\r
5082 *objPtrPtr = listPtr->internalRep.listValue.ele[index];
\r
5086 static int ListSetIndex(Jim_Interp *interp, Jim_Obj *listPtr, int index,
\r
5087 Jim_Obj *newObjPtr, int flags)
\r
5089 if (listPtr->typePtr != &listObjType)
\r
5090 SetListFromAny(interp, listPtr);
\r
5091 if ((index >= 0 && index >= listPtr->internalRep.listValue.len) ||
\r
5092 (index < 0 && (-index-1) >= listPtr->internalRep.listValue.len)) {
\r
5093 if (flags & JIM_ERRMSG) {
\r
5094 Jim_SetResultString(interp,
\r
5095 "list index out of range", -1);
\r
5100 index = listPtr->internalRep.listValue.len+index;
\r
5101 Jim_DecrRefCount(interp, listPtr->internalRep.listValue.ele[index]);
\r
5102 listPtr->internalRep.listValue.ele[index] = newObjPtr;
\r
5103 Jim_IncrRefCount(newObjPtr);
\r
5107 /* Modify the list stored into the variable named 'varNamePtr'
\r
5108 * setting the element specified by the 'indexc' indexes objects in 'indexv',
\r
5109 * with the new element 'newObjptr'. */
\r
5110 int Jim_SetListIndex(Jim_Interp *interp, Jim_Obj *varNamePtr,
\r
5111 Jim_Obj *const *indexv, int indexc, Jim_Obj *newObjPtr)
\r
5113 Jim_Obj *varObjPtr, *objPtr, *listObjPtr;
\r
5114 int shared, i, index;
\r
5116 varObjPtr = objPtr = Jim_GetVariable(interp, varNamePtr, JIM_ERRMSG);
\r
5117 if (objPtr == NULL)
\r
5119 if ((shared = Jim_IsShared(objPtr)))
\r
5120 varObjPtr = objPtr = Jim_DuplicateObj(interp, objPtr);
\r
5121 for (i = 0; i < indexc-1; i++) {
\r
5122 listObjPtr = objPtr;
\r
5123 if (Jim_GetIndex(interp, indexv[i], &index) != JIM_OK)
\r
5125 if (Jim_ListIndex(interp, listObjPtr, index, &objPtr,
\r
5126 JIM_ERRMSG) != JIM_OK) {
\r
5129 if (Jim_IsShared(objPtr)) {
\r
5130 objPtr = Jim_DuplicateObj(interp, objPtr);
\r
5131 ListSetIndex(interp, listObjPtr, index, objPtr, JIM_NONE);
\r
5133 Jim_InvalidateStringRep(listObjPtr);
\r
5135 if (Jim_GetIndex(interp, indexv[indexc-1], &index) != JIM_OK)
\r
5137 if (ListSetIndex(interp, objPtr, index, newObjPtr, JIM_ERRMSG) == JIM_ERR)
\r
5139 Jim_InvalidateStringRep(objPtr);
\r
5140 Jim_InvalidateStringRep(varObjPtr);
\r
5141 if (Jim_SetVariable(interp, varNamePtr, varObjPtr) != JIM_OK)
\r
5143 Jim_SetResult(interp, varObjPtr);
\r
5147 Jim_FreeNewObj(interp, varObjPtr);
\r
5152 Jim_Obj *Jim_ConcatObj(Jim_Interp *interp, int objc, Jim_Obj *const *objv)
\r
5156 /* If all the objects in objv are lists without string rep.
\r
5157 * it's possible to return a list as result, that's the
\r
5158 * concatenation of all the lists. */
\r
5159 for (i = 0; i < objc; i++) {
\r
5160 if (objv[i]->typePtr != &listObjType || objv[i]->bytes)
\r
5164 Jim_Obj *objPtr = Jim_NewListObj(interp, NULL, 0);
\r
5165 for (i = 0; i < objc; i++)
\r
5166 Jim_ListAppendList(interp, objPtr, objv[i]);
\r
5169 /* Else... we have to glue strings together */
\r
5170 int len = 0, objLen;
\r
5173 /* Compute the length */
\r
5174 for (i = 0; i < objc; i++) {
\r
5175 Jim_GetString(objv[i], &objLen);
\r
5178 if (objc) len += objc-1;
\r
5179 /* Create the string rep, and a stinrg object holding it. */
\r
5180 p = bytes = Jim_Alloc(len+1);
\r
5181 for (i = 0; i < objc; i++) {
\r
5182 const char *s = Jim_GetString(objv[i], &objLen);
\r
5183 while (objLen && (*s == ' ' || *s == '\t' || *s == '\n'))
\r
5185 s++; objLen--; len--;
\r
5187 while (objLen && (s[objLen-1] == ' ' ||
\r
5188 s[objLen-1] == '\n' || s[objLen-1] == '\t')) {
\r
5191 memcpy(p, s, objLen);
\r
5193 if (objLen && i+1 != objc) {
\r
5195 } else if (i+1 != objc) {
\r
5196 /* Drop the space calcuated for this
\r
5197 * element that is instead null. */
\r
5202 return Jim_NewStringObjNoAlloc(interp, bytes, len);
\r
5206 /* Returns a list composed of the elements in the specified range.
\r
5207 * first and start are directly accepted as Jim_Objects and
\r
5208 * processed for the end?-index? case. */
\r
5209 Jim_Obj *Jim_ListRange(Jim_Interp *interp, Jim_Obj *listObjPtr, Jim_Obj *firstObjPtr, Jim_Obj *lastObjPtr)
\r
5212 int len, rangeLen;
\r
5214 if (Jim_GetIndex(interp, firstObjPtr, &first) != JIM_OK ||
\r
5215 Jim_GetIndex(interp, lastObjPtr, &last) != JIM_OK)
\r
5217 Jim_ListLength(interp, listObjPtr, &len); /* will convert into list */
\r
5218 first = JimRelToAbsIndex(len, first);
\r
5219 last = JimRelToAbsIndex(len, last);
\r
5220 JimRelToAbsRange(len, first, last, &first, &last, &rangeLen);
\r
5221 return Jim_NewListObj(interp,
\r
5222 listObjPtr->internalRep.listValue.ele+first, rangeLen);
\r
5225 /* -----------------------------------------------------------------------------
\r
5227 * ---------------------------------------------------------------------------*/
\r
5228 static void FreeDictInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
5229 static void DupDictInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
5230 static void UpdateStringOfDict(struct Jim_Obj *objPtr);
\r
5231 static int SetDictFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
5233 /* Dict HashTable Type.
\r
5235 * Keys and Values are Jim objects. */
\r
5237 unsigned int JimObjectHTHashFunction(const void *key)
\r
5240 Jim_Obj *objPtr = (Jim_Obj*) key;
\r
5243 str = Jim_GetString(objPtr, &len);
\r
5244 h = Jim_GenHashFunction((unsigned char*)str, len);
\r
5248 int JimObjectHTKeyCompare(void *privdata, const void *key1, const void *key2)
\r
5250 JIM_NOTUSED(privdata);
\r
5252 return Jim_StringEqObj((Jim_Obj*)key1, (Jim_Obj*)key2, 0);
\r
5255 static void JimObjectHTKeyValDestructor(void *interp, void *val)
\r
5257 Jim_Obj *objPtr = val;
\r
5259 Jim_DecrRefCount(interp, objPtr);
\r
5262 static Jim_HashTableType JimDictHashTableType = {
\r
5263 JimObjectHTHashFunction, /* hash function */
\r
5264 NULL, /* key dup */
\r
5265 NULL, /* val dup */
\r
5266 JimObjectHTKeyCompare, /* key compare */
\r
5267 (void(*)(void*, const void*)) /* ATTENTION: const cast */
\r
5268 JimObjectHTKeyValDestructor, /* key destructor */
\r
5269 JimObjectHTKeyValDestructor /* val destructor */
\r
5272 /* Note that while the elements of the dict may contain references,
\r
5273 * the list object itself can't. This basically means that the
\r
5274 * dict object string representation as a whole can't contain references
\r
5275 * that are not presents in the single elements. */
\r
5276 static Jim_ObjType dictObjType = {
\r
5278 FreeDictInternalRep,
\r
5279 DupDictInternalRep,
\r
5280 UpdateStringOfDict,
\r
5284 void FreeDictInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
5286 JIM_NOTUSED(interp);
\r
5288 Jim_FreeHashTable(objPtr->internalRep.ptr);
\r
5289 Jim_Free(objPtr->internalRep.ptr);
\r
5292 void DupDictInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
5294 Jim_HashTable *ht, *dupHt;
\r
5295 Jim_HashTableIterator *htiter;
\r
5296 Jim_HashEntry *he;
\r
5298 /* Create a new hash table */
\r
5299 ht = srcPtr->internalRep.ptr;
\r
5300 dupHt = Jim_Alloc(sizeof(*dupHt));
\r
5301 Jim_InitHashTable(dupHt, &JimDictHashTableType, interp);
\r
5302 if (ht->size != 0)
\r
5303 Jim_ExpandHashTable(dupHt, ht->size);
\r
5304 /* Copy every element from the source to the dup hash table */
\r
5305 htiter = Jim_GetHashTableIterator(ht);
\r
5306 while ((he = Jim_NextHashEntry(htiter)) != NULL) {
\r
5307 const Jim_Obj *keyObjPtr = he->key;
\r
5308 Jim_Obj *valObjPtr = he->val;
\r
5310 Jim_IncrRefCount((Jim_Obj*)keyObjPtr); /* ATTENTION: const cast */
\r
5311 Jim_IncrRefCount(valObjPtr);
\r
5312 Jim_AddHashEntry(dupHt, keyObjPtr, valObjPtr);
\r
5314 Jim_FreeHashTableIterator(htiter);
\r
5316 dupPtr->internalRep.ptr = dupHt;
\r
5317 dupPtr->typePtr = &dictObjType;
\r
5320 void UpdateStringOfDict(struct Jim_Obj *objPtr)
\r
5322 int i, bufLen, realLength;
\r
5323 const char *strRep;
\r
5325 int *quotingType, objc;
\r
5326 Jim_HashTable *ht;
\r
5327 Jim_HashTableIterator *htiter;
\r
5328 Jim_HashEntry *he;
\r
5331 /* Trun the hash table into a flat vector of Jim_Objects. */
\r
5332 ht = objPtr->internalRep.ptr;
\r
5333 objc = ht->used*2;
\r
5334 objv = Jim_Alloc(objc*sizeof(Jim_Obj*));
\r
5335 htiter = Jim_GetHashTableIterator(ht);
\r
5337 while ((he = Jim_NextHashEntry(htiter)) != NULL) {
\r
5338 objv[i++] = (Jim_Obj*)he->key; /* ATTENTION: const cast */
\r
5339 objv[i++] = he->val;
\r
5341 Jim_FreeHashTableIterator(htiter);
\r
5342 /* (Over) Estimate the space needed. */
\r
5343 quotingType = Jim_Alloc(sizeof(int)*objc);
\r
5345 for (i = 0; i < objc; i++) {
\r
5348 strRep = Jim_GetString(objv[i], &len);
\r
5349 quotingType[i] = ListElementQuotingType(strRep, len);
\r
5350 switch (quotingType[i]) {
\r
5351 case JIM_ELESTR_SIMPLE: bufLen += len; break;
\r
5352 case JIM_ELESTR_BRACE: bufLen += len+2; break;
\r
5353 case JIM_ELESTR_QUOTE: bufLen += len*2; break;
\r
5355 bufLen++; /* elements separator. */
\r
5359 /* Generate the string rep. */
\r
5360 p = objPtr->bytes = Jim_Alloc(bufLen+1);
\r
5362 for (i = 0; i < objc; i++) {
\r
5364 const char *strRep = Jim_GetString(objv[i], &len);
\r
5367 switch(quotingType[i]) {
\r
5368 case JIM_ELESTR_SIMPLE:
\r
5369 memcpy(p, strRep, len);
\r
5371 realLength += len;
\r
5373 case JIM_ELESTR_BRACE:
\r
5375 memcpy(p, strRep, len);
\r
5378 realLength += len+2;
\r
5380 case JIM_ELESTR_QUOTE:
\r
5381 q = BackslashQuoteString(strRep, len, &qlen);
\r
5382 memcpy(p, q, qlen);
\r
5385 realLength += qlen;
\r
5388 /* Add a separating space */
\r
5389 if (i+1 != objc) {
\r
5394 *p = '\0'; /* nul term. */
\r
5395 objPtr->length = realLength;
\r
5396 Jim_Free(quotingType);
\r
5400 int SetDictFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr)
\r
5402 struct JimParserCtx parser;
\r
5403 Jim_HashTable *ht;
\r
5408 /* Get the string representation */
\r
5409 str = Jim_GetString(objPtr, &strLen);
\r
5411 /* Free the old internal repr just now and initialize the
\r
5412 * new one just now. The string->list conversion can't fail. */
\r
5413 Jim_FreeIntRep(interp, objPtr);
\r
5414 ht = Jim_Alloc(sizeof(*ht));
\r
5415 Jim_InitHashTable(ht, &JimDictHashTableType, interp);
\r
5416 objPtr->typePtr = &dictObjType;
\r
5417 objPtr->internalRep.ptr = ht;
\r
5419 /* Convert into a dict */
\r
5420 JimParserInit(&parser, str, strLen, 1);
\r
5422 while(!JimParserEof(&parser)) {
\r
5424 int tokenLen, type;
\r
5426 JimParseList(&parser);
\r
5427 if (JimParserTtype(&parser) != JIM_TT_STR &&
\r
5428 JimParserTtype(&parser) != JIM_TT_ESC)
\r
5430 token = JimParserGetToken(&parser, &tokenLen, &type, NULL);
\r
5431 objv[i++] = Jim_NewStringObjNoAlloc(interp, token, tokenLen);
\r
5434 Jim_IncrRefCount(objv[0]);
\r
5435 Jim_IncrRefCount(objv[1]);
\r
5436 if (Jim_AddHashEntry(ht, objv[0], objv[1]) != JIM_OK) {
\r
5437 Jim_HashEntry *he;
\r
5438 he = Jim_FindHashEntry(ht, objv[0]);
\r
5439 Jim_DecrRefCount(interp, objv[0]);
\r
5440 /* ATTENTION: const cast */
\r
5441 Jim_DecrRefCount(interp, (Jim_Obj*)he->val);
\r
5442 he->val = objv[1];
\r
5447 Jim_FreeNewObj(interp, objv[0]);
\r
5448 objPtr->typePtr = NULL;
\r
5449 Jim_FreeHashTable(ht);
\r
5450 Jim_SetResultString(interp, "invalid dictionary value: must be a list with an even number of elements", -1);
\r
5456 /* Dict object API */
\r
5458 /* Add an element to a dict. objPtr must be of the "dict" type.
\r
5459 * The higer-level exported function is Jim_DictAddElement().
\r
5460 * If an element with the specified key already exists, the value
\r
5461 * associated is replaced with the new one.
\r
5463 * if valueObjPtr == NULL, the key is instead removed if it exists. */
\r
5464 static void DictAddElement(Jim_Interp *interp, Jim_Obj *objPtr,
\r
5465 Jim_Obj *keyObjPtr, Jim_Obj *valueObjPtr)
\r
5467 Jim_HashTable *ht = objPtr->internalRep.ptr;
\r
5469 if (valueObjPtr == NULL) { /* unset */
\r
5470 Jim_DeleteHashEntry(ht, keyObjPtr);
\r
5473 Jim_IncrRefCount(keyObjPtr);
\r
5474 Jim_IncrRefCount(valueObjPtr);
\r
5475 if (Jim_AddHashEntry(ht, keyObjPtr, valueObjPtr) != JIM_OK) {
\r
5476 Jim_HashEntry *he = Jim_FindHashEntry(ht, keyObjPtr);
\r
5477 Jim_DecrRefCount(interp, keyObjPtr);
\r
5478 /* ATTENTION: const cast */
\r
5479 Jim_DecrRefCount(interp, (Jim_Obj*)he->val);
\r
5480 he->val = valueObjPtr;
\r
5484 /* Add an element, higher-level interface for DictAddElement().
\r
5485 * If valueObjPtr == NULL, the key is removed if it exists. */
\r
5486 int Jim_DictAddElement(Jim_Interp *interp, Jim_Obj *objPtr,
\r
5487 Jim_Obj *keyObjPtr, Jim_Obj *valueObjPtr)
\r
5489 if (Jim_IsShared(objPtr))
\r
5490 Jim_Panic(interp,"Jim_DictAddElement called with shared object");
\r
5491 if (objPtr->typePtr != &dictObjType) {
\r
5492 if (SetDictFromAny(interp, objPtr) != JIM_OK)
\r
5495 DictAddElement(interp, objPtr, keyObjPtr, valueObjPtr);
\r
5496 Jim_InvalidateStringRep(objPtr);
\r
5500 Jim_Obj *Jim_NewDictObj(Jim_Interp *interp, Jim_Obj *const *elements, int len)
\r
5506 Jim_Panic(interp,"Jim_NewDicObj() 'len' argument must be even");
\r
5508 objPtr = Jim_NewObj(interp);
\r
5509 objPtr->typePtr = &dictObjType;
\r
5510 objPtr->bytes = NULL;
\r
5511 objPtr->internalRep.ptr = Jim_Alloc(sizeof(Jim_HashTable));
\r
5512 Jim_InitHashTable(objPtr->internalRep.ptr, &JimDictHashTableType, interp);
\r
5513 for (i = 0; i < len; i += 2)
\r
5514 DictAddElement(interp, objPtr, elements[i], elements[i+1]);
\r
5518 /* Return the value associated to the specified dict key */
\r
5519 int Jim_DictKey(Jim_Interp *interp, Jim_Obj *dictPtr, Jim_Obj *keyPtr,
\r
5520 Jim_Obj **objPtrPtr, int flags)
\r
5522 Jim_HashEntry *he;
\r
5523 Jim_HashTable *ht;
\r
5525 if (dictPtr->typePtr != &dictObjType) {
\r
5526 if (SetDictFromAny(interp, dictPtr) != JIM_OK)
\r
5529 ht = dictPtr->internalRep.ptr;
\r
5530 if ((he = Jim_FindHashEntry(ht, keyPtr)) == NULL) {
\r
5531 if (flags & JIM_ERRMSG) {
\r
5532 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
5533 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
5534 "key \"", Jim_GetString(keyPtr, NULL),
\r
5535 "\" not found in dictionary", NULL);
\r
5539 *objPtrPtr = he->val;
\r
5543 /* Return the value associated to the specified dict keys */
\r
5544 int Jim_DictKeysVector(Jim_Interp *interp, Jim_Obj *dictPtr,
\r
5545 Jim_Obj *const *keyv, int keyc, Jim_Obj **objPtrPtr, int flags)
\r
5551 *objPtrPtr = dictPtr;
\r
5555 for (i = 0; i < keyc; i++) {
\r
5556 if (Jim_DictKey(interp, dictPtr, keyv[i], &objPtr, flags)
\r
5561 *objPtrPtr = objPtr;
\r
5565 /* Modify the dict stored into the variable named 'varNamePtr'
\r
5566 * setting the element specified by the 'keyc' keys objects in 'keyv',
\r
5567 * with the new value of the element 'newObjPtr'.
\r
5569 * If newObjPtr == NULL the operation is to remove the given key
\r
5570 * from the dictionary. */
\r
5571 int Jim_SetDictKeysVector(Jim_Interp *interp, Jim_Obj *varNamePtr,
\r
5572 Jim_Obj *const *keyv, int keyc, Jim_Obj *newObjPtr)
\r
5574 Jim_Obj *varObjPtr, *objPtr, *dictObjPtr;
\r
5577 varObjPtr = objPtr = Jim_GetVariable(interp, varNamePtr, JIM_ERRMSG);
\r
5578 if (objPtr == NULL) {
\r
5579 if (newObjPtr == NULL) /* Cannot remove a key from non existing var */
\r
5581 varObjPtr = objPtr = Jim_NewDictObj(interp, NULL, 0);
\r
5582 if (Jim_SetVariable(interp, varNamePtr, objPtr) != JIM_OK) {
\r
5583 Jim_FreeNewObj(interp, varObjPtr);
\r
5587 if ((shared = Jim_IsShared(objPtr)))
\r
5588 varObjPtr = objPtr = Jim_DuplicateObj(interp, objPtr);
\r
5589 for (i = 0; i < keyc-1; i++) {
\r
5590 dictObjPtr = objPtr;
\r
5592 /* Check if it's a valid dictionary */
\r
5593 if (dictObjPtr->typePtr != &dictObjType) {
\r
5594 if (SetDictFromAny(interp, dictObjPtr) != JIM_OK)
\r
5597 /* Check if the given key exists. */
\r
5598 Jim_InvalidateStringRep(dictObjPtr);
\r
5599 if (Jim_DictKey(interp, dictObjPtr, keyv[i], &objPtr,
\r
5600 newObjPtr ? JIM_NONE : JIM_ERRMSG) == JIM_OK)
\r
5602 /* This key exists at the current level.
\r
5603 * Make sure it's not shared!. */
\r
5604 if (Jim_IsShared(objPtr)) {
\r
5605 objPtr = Jim_DuplicateObj(interp, objPtr);
\r
5606 DictAddElement(interp, dictObjPtr, keyv[i], objPtr);
\r
5609 /* Key not found. If it's an [unset] operation
\r
5610 * this is an error. Only the last key may not
\r
5612 if (newObjPtr == NULL)
\r
5614 /* Otherwise set an empty dictionary
\r
5615 * as key's value. */
\r
5616 objPtr = Jim_NewDictObj(interp, NULL, 0);
\r
5617 DictAddElement(interp, dictObjPtr, keyv[i], objPtr);
\r
5620 if (Jim_DictAddElement(interp, objPtr, keyv[keyc-1], newObjPtr)
\r
5623 Jim_InvalidateStringRep(objPtr);
\r
5624 Jim_InvalidateStringRep(varObjPtr);
\r
5625 if (Jim_SetVariable(interp, varNamePtr, varObjPtr) != JIM_OK)
\r
5627 Jim_SetResult(interp, varObjPtr);
\r
5631 Jim_FreeNewObj(interp, varObjPtr);
\r
5636 /* -----------------------------------------------------------------------------
\r
5638 * ---------------------------------------------------------------------------*/
\r
5639 static void UpdateStringOfIndex(struct Jim_Obj *objPtr);
\r
5640 static int SetIndexFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
5642 static Jim_ObjType indexObjType = {
\r
5646 UpdateStringOfIndex,
\r
5650 void UpdateStringOfIndex(struct Jim_Obj *objPtr)
\r
5653 char buf[JIM_INTEGER_SPACE+1];
\r
5655 if (objPtr->internalRep.indexValue >= 0)
\r
5656 len = sprintf(buf, "%d", objPtr->internalRep.indexValue);
\r
5657 else if (objPtr->internalRep.indexValue == -1)
\r
5658 len = sprintf(buf, "end");
\r
5660 len = sprintf(buf, "end%d", objPtr->internalRep.indexValue+1);
\r
5662 objPtr->bytes = Jim_Alloc(len+1);
\r
5663 memcpy(objPtr->bytes, buf, len+1);
\r
5664 objPtr->length = len;
\r
5667 int SetIndexFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
5669 int index, end = 0;
\r
5672 /* Get the string representation */
\r
5673 str = Jim_GetString(objPtr, NULL);
\r
5674 /* Try to convert into an index */
\r
5675 if (!strcmp(str, "end")) {
\r
5679 if (!strncmp(str, "end-", 4)) {
\r
5683 if (Jim_StringToIndex(str, &index) != JIM_OK) {
\r
5684 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
5685 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
5686 "bad index \"", Jim_GetString(objPtr, NULL), "\": "
\r
5687 "must be integer or end?-integer?", NULL);
\r
5695 index = -(index+1);
\r
5696 } else if (!end && index < 0)
\r
5698 /* Free the old internal repr and set the new one. */
\r
5699 Jim_FreeIntRep(interp, objPtr);
\r
5700 objPtr->typePtr = &indexObjType;
\r
5701 objPtr->internalRep.indexValue = index;
\r
5705 int Jim_GetIndex(Jim_Interp *interp, Jim_Obj *objPtr, int *indexPtr)
\r
5707 /* Avoid shimmering if the object is an integer. */
\r
5708 if (objPtr->typePtr == &intObjType) {
\r
5709 jim_wide val = objPtr->internalRep.wideValue;
\r
5710 if (!(val < LONG_MIN) && !(val > LONG_MAX)) {
\r
5711 *indexPtr = (val < 0) ? -INT_MAX : (long)val;;
\r
5715 if (objPtr->typePtr != &indexObjType &&
\r
5716 SetIndexFromAny(interp, objPtr) == JIM_ERR)
\r
5718 *indexPtr = objPtr->internalRep.indexValue;
\r
5722 /* -----------------------------------------------------------------------------
\r
5723 * Return Code Object.
\r
5724 * ---------------------------------------------------------------------------*/
\r
5726 static int SetReturnCodeFromAny(Jim_Interp *interp, Jim_Obj *objPtr);
\r
5728 static Jim_ObjType returnCodeObjType = {
\r
5736 int SetReturnCodeFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
5739 int strLen, returnCode;
\r
5740 jim_wide wideValue;
\r
5742 /* Get the string representation */
\r
5743 str = Jim_GetString(objPtr, &strLen);
\r
5744 /* Try to convert into an integer */
\r
5745 if (JimGetWideNoErr(interp, objPtr, &wideValue) != JIM_ERR)
\r
5746 returnCode = (int) wideValue;
\r
5747 else if (!JimStringCompare(str, strLen, "ok", 2, JIM_NOCASE))
\r
5748 returnCode = JIM_OK;
\r
5749 else if (!JimStringCompare(str, strLen, "error", 5, JIM_NOCASE))
\r
5750 returnCode = JIM_ERR;
\r
5751 else if (!JimStringCompare(str, strLen, "return", 6, JIM_NOCASE))
\r
5752 returnCode = JIM_RETURN;
\r
5753 else if (!JimStringCompare(str, strLen, "break", 5, JIM_NOCASE))
\r
5754 returnCode = JIM_BREAK;
\r
5755 else if (!JimStringCompare(str, strLen, "continue", 8, JIM_NOCASE))
\r
5756 returnCode = JIM_CONTINUE;
\r
5757 else if (!JimStringCompare(str, strLen, "eval", 4, JIM_NOCASE))
\r
5758 returnCode = JIM_EVAL;
\r
5759 else if (!JimStringCompare(str, strLen, "exit", 4, JIM_NOCASE))
\r
5760 returnCode = JIM_EXIT;
\r
5762 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
5763 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
5764 "expected return code but got '", str, "'",
\r
5768 /* Free the old internal repr and set the new one. */
\r
5769 Jim_FreeIntRep(interp, objPtr);
\r
5770 objPtr->typePtr = &returnCodeObjType;
\r
5771 objPtr->internalRep.returnCode = returnCode;
\r
5775 int Jim_GetReturnCode(Jim_Interp *interp, Jim_Obj *objPtr, int *intPtr)
\r
5777 if (objPtr->typePtr != &returnCodeObjType &&
\r
5778 SetReturnCodeFromAny(interp, objPtr) == JIM_ERR)
\r
5780 *intPtr = objPtr->internalRep.returnCode;
\r
5784 /* -----------------------------------------------------------------------------
\r
5785 * Expression Parsing
\r
5786 * ---------------------------------------------------------------------------*/
\r
5787 static int JimParseExprOperator(struct JimParserCtx *pc);
\r
5788 static int JimParseExprNumber(struct JimParserCtx *pc);
\r
5789 static int JimParseExprIrrational(struct JimParserCtx *pc);
\r
5791 /* Exrp's Stack machine operators opcodes. */
\r
5793 /* Binary operators (numbers) */
\r
5794 #define JIM_EXPROP_BINARY_NUM_FIRST 0 /* first */
\r
5795 #define JIM_EXPROP_MUL 0
\r
5796 #define JIM_EXPROP_DIV 1
\r
5797 #define JIM_EXPROP_MOD 2
\r
5798 #define JIM_EXPROP_SUB 3
\r
5799 #define JIM_EXPROP_ADD 4
\r
5800 #define JIM_EXPROP_LSHIFT 5
\r
5801 #define JIM_EXPROP_RSHIFT 6
\r
5802 #define JIM_EXPROP_ROTL 7
\r
5803 #define JIM_EXPROP_ROTR 8
\r
5804 #define JIM_EXPROP_LT 9
\r
5805 #define JIM_EXPROP_GT 10
\r
5806 #define JIM_EXPROP_LTE 11
\r
5807 #define JIM_EXPROP_GTE 12
\r
5808 #define JIM_EXPROP_NUMEQ 13
\r
5809 #define JIM_EXPROP_NUMNE 14
\r
5810 #define JIM_EXPROP_BITAND 15
\r
5811 #define JIM_EXPROP_BITXOR 16
\r
5812 #define JIM_EXPROP_BITOR 17
\r
5813 #define JIM_EXPROP_LOGICAND 18
\r
5814 #define JIM_EXPROP_LOGICOR 19
\r
5815 #define JIM_EXPROP_LOGICAND_LEFT 20
\r
5816 #define JIM_EXPROP_LOGICOR_LEFT 21
\r
5817 #define JIM_EXPROP_POW 22
\r
5818 #define JIM_EXPROP_BINARY_NUM_LAST 22 /* last */
\r
5820 /* Binary operators (strings) */
\r
5821 #define JIM_EXPROP_STREQ 23
\r
5822 #define JIM_EXPROP_STRNE 24
\r
5824 /* Unary operators (numbers) */
\r
5825 #define JIM_EXPROP_NOT 25
\r
5826 #define JIM_EXPROP_BITNOT 26
\r
5827 #define JIM_EXPROP_UNARYMINUS 27
\r
5828 #define JIM_EXPROP_UNARYPLUS 28
\r
5829 #define JIM_EXPROP_LOGICAND_RIGHT 29
\r
5830 #define JIM_EXPROP_LOGICOR_RIGHT 30
\r
5832 /* Ternary operators */
\r
5833 #define JIM_EXPROP_TERNARY 31
\r
5836 #define JIM_EXPROP_NUMBER 32
\r
5837 #define JIM_EXPROP_COMMAND 33
\r
5838 #define JIM_EXPROP_VARIABLE 34
\r
5839 #define JIM_EXPROP_DICTSUGAR 35
\r
5840 #define JIM_EXPROP_SUBST 36
\r
5841 #define JIM_EXPROP_STRING 37
\r
5843 /* Operators table */
\r
5844 typedef struct Jim_ExprOperator {
\r
5849 } Jim_ExprOperator;
\r
5851 /* name - precedence - arity - opcode */
\r
5852 static struct Jim_ExprOperator Jim_ExprOperators[] = {
\r
5853 {"!", 300, 1, JIM_EXPROP_NOT},
\r
5854 {"~", 300, 1, JIM_EXPROP_BITNOT},
\r
5855 {"unarymin", 300, 1, JIM_EXPROP_UNARYMINUS},
\r
5856 {"unaryplus", 300, 1, JIM_EXPROP_UNARYPLUS},
\r
5858 {"**", 250, 2, JIM_EXPROP_POW},
\r
5860 {"*", 200, 2, JIM_EXPROP_MUL},
\r
5861 {"/", 200, 2, JIM_EXPROP_DIV},
\r
5862 {"%", 200, 2, JIM_EXPROP_MOD},
\r
5864 {"-", 100, 2, JIM_EXPROP_SUB},
\r
5865 {"+", 100, 2, JIM_EXPROP_ADD},
\r
5867 {"<<<", 90, 3, JIM_EXPROP_ROTL},
\r
5868 {">>>", 90, 3, JIM_EXPROP_ROTR},
\r
5869 {"<<", 90, 2, JIM_EXPROP_LSHIFT},
\r
5870 {">>", 90, 2, JIM_EXPROP_RSHIFT},
\r
5872 {"<", 80, 2, JIM_EXPROP_LT},
\r
5873 {">", 80, 2, JIM_EXPROP_GT},
\r
5874 {"<=", 80, 2, JIM_EXPROP_LTE},
\r
5875 {">=", 80, 2, JIM_EXPROP_GTE},
\r
5877 {"==", 70, 2, JIM_EXPROP_NUMEQ},
\r
5878 {"!=", 70, 2, JIM_EXPROP_NUMNE},
\r
5880 {"eq", 60, 2, JIM_EXPROP_STREQ},
\r
5881 {"ne", 60, 2, JIM_EXPROP_STRNE},
\r
5883 {"&", 50, 2, JIM_EXPROP_BITAND},
\r
5884 {"^", 49, 2, JIM_EXPROP_BITXOR},
\r
5885 {"|", 48, 2, JIM_EXPROP_BITOR},
\r
5887 {"&&", 10, 2, JIM_EXPROP_LOGICAND},
\r
5888 {"||", 10, 2, JIM_EXPROP_LOGICOR},
\r
5890 {"?", 5, 3, JIM_EXPROP_TERNARY},
\r
5891 /* private operators */
\r
5892 {NULL, 10, 2, JIM_EXPROP_LOGICAND_LEFT},
\r
5893 {NULL, 10, 1, JIM_EXPROP_LOGICAND_RIGHT},
\r
5894 {NULL, 10, 2, JIM_EXPROP_LOGICOR_LEFT},
\r
5895 {NULL, 10, 1, JIM_EXPROP_LOGICOR_RIGHT},
\r
5898 #define JIM_EXPR_OPERATORS_NUM \
\r
5899 (sizeof(Jim_ExprOperators)/sizeof(struct Jim_ExprOperator))
\r
5901 int JimParseExpression(struct JimParserCtx *pc)
\r
5903 /* Discard spaces and quoted newline */
\r
5904 while(*(pc->p) == ' ' ||
\r
5905 *(pc->p) == '\t' ||
\r
5906 *(pc->p) == '\r' ||
\r
5907 *(pc->p) == '\n' ||
\r
5908 (*(pc->p) == '\\' && *(pc->p+1) == '\n')) {
\r
5909 pc->p++; pc->len--;
\r
5912 if (pc->len == 0) {
\r
5913 pc->tstart = pc->tend = pc->p;
\r
5914 pc->tline = pc->linenr;
\r
5915 pc->tt = JIM_TT_EOL;
\r
5919 switch(*(pc->p)) {
\r
5921 pc->tstart = pc->tend = pc->p;
\r
5922 pc->tline = pc->linenr;
\r
5923 pc->tt = JIM_TT_SUBEXPR_START;
\r
5924 pc->p++; pc->len--;
\r
5927 pc->tstart = pc->tend = pc->p;
\r
5928 pc->tline = pc->linenr;
\r
5929 pc->tt = JIM_TT_SUBEXPR_END;
\r
5930 pc->p++; pc->len--;
\r
5933 return JimParseCmd(pc);
\r
5936 if (JimParseVar(pc) == JIM_ERR)
\r
5937 return JimParseExprOperator(pc);
\r
5942 if ((pc->tt == JIM_TT_NONE || pc->tt == JIM_TT_EXPR_OPERATOR) &&
\r
5943 isdigit((int)*(pc->p+1)))
\r
5944 return JimParseExprNumber(pc);
\r
5946 return JimParseExprOperator(pc);
\r
5948 case '0': case '1': case '2': case '3': case '4':
\r
5949 case '5': case '6': case '7': case '8': case '9': case '.':
\r
5950 return JimParseExprNumber(pc);
\r
5954 /* Here it's possible to reuse the List String parsing. */
\r
5955 pc->tt = JIM_TT_NONE; /* Make sure it's sensed as a new word. */
\r
5956 return JimParseListStr(pc);
\r
5958 case 'N': case 'I':
\r
5959 case 'n': case 'i':
\r
5960 if (JimParseExprIrrational(pc) == JIM_ERR)
\r
5961 return JimParseExprOperator(pc);
\r
5964 return JimParseExprOperator(pc);
\r
5970 int JimParseExprNumber(struct JimParserCtx *pc)
\r
5975 pc->tstart = pc->p;
\r
5976 pc->tline = pc->linenr;
\r
5977 if (*pc->p == '-') {
\r
5978 pc->p++; pc->len--;
\r
5980 while ( isdigit((int)*pc->p)
\r
5981 || (allowhex && isxdigit((int)*pc->p) )
\r
5982 || (allowdot && *pc->p == '.')
\r
5983 || (pc->p-pc->tstart == 1 && *pc->tstart == '0' &&
\r
5984 (*pc->p == 'x' || *pc->p == 'X'))
\r
5987 if ((*pc->p == 'x') || (*pc->p == 'X')) {
\r
5991 if (*pc->p == '.')
\r
5993 pc->p++; pc->len--;
\r
5994 if (!allowdot && *pc->p == 'e' && *(pc->p+1) == '-') {
\r
5995 pc->p += 2; pc->len -= 2;
\r
5998 pc->tend = pc->p-1;
\r
5999 pc->tt = JIM_TT_EXPR_NUMBER;
\r
6003 int JimParseExprIrrational(struct JimParserCtx *pc)
\r
6005 const char *Tokens[] = {"NaN", "nan", "NAN", "Inf", "inf", "INF", NULL};
\r
6006 const char **token;
\r
6007 for (token = Tokens; *token != NULL; token++) {
\r
6008 int len = strlen(*token);
\r
6009 if (strncmp(*token, pc->p, len) == 0) {
\r
6010 pc->tstart = pc->p;
\r
6011 pc->tend = pc->p + len - 1;
\r
6012 pc->p += len; pc->len -= len;
\r
6013 pc->tline = pc->linenr;
\r
6014 pc->tt = JIM_TT_EXPR_NUMBER;
\r
6021 int JimParseExprOperator(struct JimParserCtx *pc)
\r
6024 int bestIdx = -1, bestLen = 0;
\r
6026 /* Try to get the longest match. */
\r
6027 for (i = 0; i < (signed)JIM_EXPR_OPERATORS_NUM; i++) {
\r
6028 const char *opname;
\r
6031 opname = Jim_ExprOperators[i].name;
\r
6032 if (opname == NULL) continue;
\r
6033 oplen = strlen(opname);
\r
6035 if (strncmp(opname, pc->p, oplen) == 0 && oplen > bestLen) {
\r
6040 if (bestIdx == -1) return JIM_ERR;
\r
6041 pc->tstart = pc->p;
\r
6042 pc->tend = pc->p + bestLen - 1;
\r
6043 pc->p += bestLen; pc->len -= bestLen;
\r
6044 pc->tline = pc->linenr;
\r
6045 pc->tt = JIM_TT_EXPR_OPERATOR;
\r
6049 struct Jim_ExprOperator *JimExprOperatorInfo(const char *opname)
\r
6052 for (i = 0; i < (signed)JIM_EXPR_OPERATORS_NUM; i++)
\r
6053 if (Jim_ExprOperators[i].name &&
\r
6054 strcmp(opname, Jim_ExprOperators[i].name) == 0)
\r
6055 return &Jim_ExprOperators[i];
\r
6059 struct Jim_ExprOperator *JimExprOperatorInfoByOpcode(int opcode)
\r
6062 for (i = 0; i < (signed)JIM_EXPR_OPERATORS_NUM; i++)
\r
6063 if (Jim_ExprOperators[i].opcode == opcode)
\r
6064 return &Jim_ExprOperators[i];
\r
6068 /* -----------------------------------------------------------------------------
\r
6069 * Expression Object
\r
6070 * ---------------------------------------------------------------------------*/
\r
6071 static void FreeExprInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
6072 static void DupExprInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
6073 static int SetExprFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr);
\r
6075 static Jim_ObjType exprObjType = {
\r
6077 FreeExprInternalRep,
\r
6078 DupExprInternalRep,
\r
6080 JIM_TYPE_REFERENCES,
\r
6083 /* Expr bytecode structure */
\r
6084 typedef struct ExprByteCode {
\r
6085 int *opcode; /* Integer array of opcodes. */
\r
6086 Jim_Obj **obj; /* Array of associated Jim Objects. */
\r
6087 int len; /* Bytecode length */
\r
6088 int inUse; /* Used for sharing. */
\r
6091 void FreeExprInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
6094 ExprByteCode *expr = (void*) objPtr->internalRep.ptr;
\r
6097 if (expr->inUse != 0) return;
\r
6098 for (i = 0; i < expr->len; i++)
\r
6099 Jim_DecrRefCount(interp, expr->obj[i]);
\r
6100 Jim_Free(expr->opcode);
\r
6101 Jim_Free(expr->obj);
\r
6105 void DupExprInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
6107 JIM_NOTUSED(interp);
\r
6108 JIM_NOTUSED(srcPtr);
\r
6110 /* Just returns an simple string. */
\r
6111 dupPtr->typePtr = NULL;
\r
6114 /* Add a new instruction to an expression bytecode structure. */
\r
6115 static void ExprObjAddInstr(Jim_Interp *interp, ExprByteCode *expr,
\r
6116 int opcode, char *str, int len)
\r
6118 expr->opcode = Jim_Realloc(expr->opcode, sizeof(int)*(expr->len+1));
\r
6119 expr->obj = Jim_Realloc(expr->obj, sizeof(Jim_Obj*)*(expr->len+1));
\r
6120 expr->opcode[expr->len] = opcode;
\r
6121 expr->obj[expr->len] = Jim_NewStringObjNoAlloc(interp, str, len);
\r
6122 Jim_IncrRefCount(expr->obj[expr->len]);
\r
6126 /* Check if an expr program looks correct. */
\r
6127 static int ExprCheckCorrectness(ExprByteCode *expr)
\r
6132 /* Try to check if there are stack underflows,
\r
6133 * and make sure at the end of the program there is
\r
6134 * a single result on the stack. */
\r
6135 for (i = 0; i < expr->len; i++) {
\r
6136 switch(expr->opcode[i]) {
\r
6137 case JIM_EXPROP_NUMBER:
\r
6138 case JIM_EXPROP_STRING:
\r
6139 case JIM_EXPROP_SUBST:
\r
6140 case JIM_EXPROP_VARIABLE:
\r
6141 case JIM_EXPROP_DICTSUGAR:
\r
6142 case JIM_EXPROP_COMMAND:
\r
6145 case JIM_EXPROP_NOT:
\r
6146 case JIM_EXPROP_BITNOT:
\r
6147 case JIM_EXPROP_UNARYMINUS:
\r
6148 case JIM_EXPROP_UNARYPLUS:
\r
6149 /* Unary operations */
\r
6150 if (stacklen < 1) return JIM_ERR;
\r
6152 case JIM_EXPROP_ADD:
\r
6153 case JIM_EXPROP_SUB:
\r
6154 case JIM_EXPROP_MUL:
\r
6155 case JIM_EXPROP_DIV:
\r
6156 case JIM_EXPROP_MOD:
\r
6157 case JIM_EXPROP_LT:
\r
6158 case JIM_EXPROP_GT:
\r
6159 case JIM_EXPROP_LTE:
\r
6160 case JIM_EXPROP_GTE:
\r
6161 case JIM_EXPROP_ROTL:
\r
6162 case JIM_EXPROP_ROTR:
\r
6163 case JIM_EXPROP_LSHIFT:
\r
6164 case JIM_EXPROP_RSHIFT:
\r
6165 case JIM_EXPROP_NUMEQ:
\r
6166 case JIM_EXPROP_NUMNE:
\r
6167 case JIM_EXPROP_STREQ:
\r
6168 case JIM_EXPROP_STRNE:
\r
6169 case JIM_EXPROP_BITAND:
\r
6170 case JIM_EXPROP_BITXOR:
\r
6171 case JIM_EXPROP_BITOR:
\r
6172 case JIM_EXPROP_LOGICAND:
\r
6173 case JIM_EXPROP_LOGICOR:
\r
6174 case JIM_EXPROP_POW:
\r
6175 /* binary operations */
\r
6176 if (stacklen < 2) return JIM_ERR;
\r
6180 Jim_Panic(NULL,"Default opcode reached ExprCheckCorrectness");
\r
6184 if (stacklen != 1) return JIM_ERR;
\r
6188 static void ExprShareLiterals(Jim_Interp *interp, ExprByteCode *expr,
\r
6189 ScriptObj *topLevelScript)
\r
6194 for (i = 0; i < expr->len; i++) {
\r
6195 Jim_Obj *foundObjPtr;
\r
6197 if (expr->obj[i] == NULL) continue;
\r
6198 foundObjPtr = ScriptSearchLiteral(interp, topLevelScript,
\r
6199 NULL, expr->obj[i]);
\r
6200 if (foundObjPtr != NULL) {
\r
6201 Jim_IncrRefCount(foundObjPtr);
\r
6202 Jim_DecrRefCount(interp, expr->obj[i]);
\r
6203 expr->obj[i] = foundObjPtr;
\r
6208 /* This procedure converts every occurrence of || and && opereators
\r
6209 * in lazy unary versions.
\r
6211 * a b || is converted into:
\r
6213 * a <offset> |L b |R
\r
6215 * a b && is converted into:
\r
6217 * a <offset> &L b &R
\r
6219 * "|L" checks if 'a' is true:
\r
6220 * 1) if it is true pushes 1 and skips <offset> istructions to reach
\r
6221 * the opcode just after |R.
\r
6222 * 2) if it is false does nothing.
\r
6223 * "|R" checks if 'b' is true:
\r
6224 * 1) if it is true pushes 1, otherwise pushes 0.
\r
6226 * "&L" checks if 'a' is true:
\r
6227 * 1) if it is true does nothing.
\r
6228 * 2) If it is false pushes 0 and skips <offset> istructions to reach
\r
6229 * the opcode just after &R
\r
6230 * "&R" checks if 'a' is true:
\r
6231 * if it is true pushes 1, otherwise pushes 0.
\r
6233 static void ExprMakeLazy(Jim_Interp *interp, ExprByteCode *expr)
\r
6236 int index = -1, leftindex, arity, i, offset;
\r
6237 Jim_ExprOperator *op;
\r
6239 /* Search for || or && */
\r
6240 for (i = 0; i < expr->len; i++) {
\r
6241 if (expr->opcode[i] == JIM_EXPROP_LOGICAND ||
\r
6242 expr->opcode[i] == JIM_EXPROP_LOGICOR) {
\r
6247 if (index == -1) return;
\r
6248 /* Search for the end of the first operator */
\r
6249 leftindex = index-1;
\r
6252 switch(expr->opcode[leftindex]) {
\r
6253 case JIM_EXPROP_NUMBER:
\r
6254 case JIM_EXPROP_COMMAND:
\r
6255 case JIM_EXPROP_VARIABLE:
\r
6256 case JIM_EXPROP_DICTSUGAR:
\r
6257 case JIM_EXPROP_SUBST:
\r
6258 case JIM_EXPROP_STRING:
\r
6261 op = JimExprOperatorInfoByOpcode(expr->opcode[i]);
\r
6263 Jim_Panic(interp,"Default reached in ExprMakeLazy()");
\r
6265 arity += op->arity;
\r
6272 expr->opcode = Jim_Realloc(expr->opcode, sizeof(int)*(expr->len+2));
\r
6273 expr->obj = Jim_Realloc(expr->obj, sizeof(Jim_Obj*)*(expr->len+2));
\r
6274 memmove(&expr->opcode[leftindex+2], &expr->opcode[leftindex],
\r
6275 sizeof(int)*(expr->len-leftindex));
\r
6276 memmove(&expr->obj[leftindex+2], &expr->obj[leftindex],
\r
6277 sizeof(Jim_Obj*)*(expr->len-leftindex));
\r
6280 offset = (index-leftindex)-1;
\r
6281 Jim_DecrRefCount(interp, expr->obj[index]);
\r
6282 if (expr->opcode[index] == JIM_EXPROP_LOGICAND) {
\r
6283 expr->opcode[leftindex+1] = JIM_EXPROP_LOGICAND_LEFT;
\r
6284 expr->opcode[index] = JIM_EXPROP_LOGICAND_RIGHT;
\r
6285 expr->obj[leftindex+1] = Jim_NewStringObj(interp, "&L", -1);
\r
6286 expr->obj[index] = Jim_NewStringObj(interp, "&R", -1);
\r
6288 expr->opcode[leftindex+1] = JIM_EXPROP_LOGICOR_LEFT;
\r
6289 expr->opcode[index] = JIM_EXPROP_LOGICOR_RIGHT;
\r
6290 expr->obj[leftindex+1] = Jim_NewStringObj(interp, "|L", -1);
\r
6291 expr->obj[index] = Jim_NewStringObj(interp, "|R", -1);
\r
6293 expr->opcode[leftindex] = JIM_EXPROP_NUMBER;
\r
6294 expr->obj[leftindex] = Jim_NewIntObj(interp, offset);
\r
6295 Jim_IncrRefCount(expr->obj[index]);
\r
6296 Jim_IncrRefCount(expr->obj[leftindex]);
\r
6297 Jim_IncrRefCount(expr->obj[leftindex+1]);
\r
6301 /* This method takes the string representation of an expression
\r
6302 * and generates a program for the Expr's stack-based VM. */
\r
6303 int SetExprFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr)
\r
6306 const char *exprText = Jim_GetString(objPtr, &exprTextLen);
\r
6307 struct JimParserCtx parser;
\r
6308 int i, shareLiterals;
\r
6309 ExprByteCode *expr = Jim_Alloc(sizeof(*expr));
\r
6311 Jim_ExprOperator *op;
\r
6313 /* Perform literal sharing with the current procedure
\r
6314 * running only if this expression appears to be not generated
\r
6316 shareLiterals = objPtr->typePtr == &sourceObjType;
\r
6318 expr->opcode = NULL;
\r
6323 Jim_InitStack(&stack);
\r
6324 JimParserInit(&parser, exprText, exprTextLen, 1);
\r
6325 while(!JimParserEof(&parser)) {
\r
6329 if (JimParseExpression(&parser) != JIM_OK) {
\r
6330 Jim_SetResultString(interp, "Syntax error in expression", -1);
\r
6333 token = JimParserGetToken(&parser, &len, &type, NULL);
\r
6334 if (type == JIM_TT_EOL) {
\r
6340 ExprObjAddInstr(interp, expr, JIM_EXPROP_STRING, token, len);
\r
6343 ExprObjAddInstr(interp, expr, JIM_EXPROP_SUBST, token, len);
\r
6346 ExprObjAddInstr(interp, expr, JIM_EXPROP_VARIABLE, token, len);
\r
6348 case JIM_TT_DICTSUGAR:
\r
6349 ExprObjAddInstr(interp, expr, JIM_EXPROP_DICTSUGAR, token, len);
\r
6352 ExprObjAddInstr(interp, expr, JIM_EXPROP_COMMAND, token, len);
\r
6354 case JIM_TT_EXPR_NUMBER:
\r
6355 ExprObjAddInstr(interp, expr, JIM_EXPROP_NUMBER, token, len);
\r
6357 case JIM_TT_EXPR_OPERATOR:
\r
6358 op = JimExprOperatorInfo(token);
\r
6360 Jim_ExprOperator *stackTopOp;
\r
6362 if (Jim_StackPeek(&stack) != NULL) {
\r
6363 stackTopOp = JimExprOperatorInfo(Jim_StackPeek(&stack));
\r
6365 stackTopOp = NULL;
\r
6367 if (Jim_StackLen(&stack) && op->arity != 1 &&
\r
6368 stackTopOp && stackTopOp->precedence >= op->precedence)
\r
6370 ExprObjAddInstr(interp, expr, stackTopOp->opcode,
\r
6371 Jim_StackPeek(&stack), -1);
\r
6372 Jim_StackPop(&stack);
\r
6377 Jim_StackPush(&stack, token);
\r
6379 case JIM_TT_SUBEXPR_START:
\r
6380 Jim_StackPush(&stack, Jim_StrDup("("));
\r
6383 case JIM_TT_SUBEXPR_END:
\r
6386 while(Jim_StackLen(&stack)) {
\r
6387 char *opstr = Jim_StackPop(&stack);
\r
6388 if (!strcmp(opstr, "(")) {
\r
6393 op = JimExprOperatorInfo(opstr);
\r
6394 ExprObjAddInstr(interp, expr, op->opcode, opstr, -1);
\r
6397 Jim_SetResultString(interp,
\r
6398 "Unexpected close parenthesis", -1);
\r
6405 Jim_Panic(interp,"Default reached in SetExprFromAny()");
\r
6409 while (Jim_StackLen(&stack)) {
\r
6410 char *opstr = Jim_StackPop(&stack);
\r
6411 op = JimExprOperatorInfo(opstr);
\r
6412 if (op == NULL && !strcmp(opstr, "(")) {
\r
6414 Jim_SetResultString(interp, "Missing close parenthesis", -1);
\r
6417 ExprObjAddInstr(interp, expr, op->opcode, opstr, -1);
\r
6419 /* Check program correctness. */
\r
6420 if (ExprCheckCorrectness(expr) != JIM_OK) {
\r
6421 Jim_SetResultString(interp, "Invalid expression", -1);
\r
6425 /* Free the stack used for the compilation. */
\r
6426 Jim_FreeStackElements(&stack, Jim_Free);
\r
6427 Jim_FreeStack(&stack);
\r
6429 /* Convert || and && operators in unary |L |R and &L &R for lazyness */
\r
6430 ExprMakeLazy(interp, expr);
\r
6432 /* Perform literal sharing */
\r
6433 if (shareLiterals && interp->framePtr->procBodyObjPtr) {
\r
6434 Jim_Obj *bodyObjPtr = interp->framePtr->procBodyObjPtr;
\r
6435 if (bodyObjPtr->typePtr == &scriptObjType) {
\r
6436 ScriptObj *bodyScript = bodyObjPtr->internalRep.ptr;
\r
6437 ExprShareLiterals(interp, expr, bodyScript);
\r
6441 /* Free the old internal rep and set the new one. */
\r
6442 Jim_FreeIntRep(interp, objPtr);
\r
6443 Jim_SetIntRepPtr(objPtr, expr);
\r
6444 objPtr->typePtr = &exprObjType;
\r
6447 err: /* we jump here on syntax/compile errors. */
\r
6448 Jim_FreeStackElements(&stack, Jim_Free);
\r
6449 Jim_FreeStack(&stack);
\r
6450 Jim_Free(expr->opcode);
\r
6451 for (i = 0; i < expr->len; i++) {
\r
6452 Jim_DecrRefCount(interp,expr->obj[i]);
\r
6454 Jim_Free(expr->obj);
\r
6459 ExprByteCode *Jim_GetExpression(Jim_Interp *interp, Jim_Obj *objPtr)
\r
6461 if (objPtr->typePtr != &exprObjType) {
\r
6462 if (SetExprFromAny(interp, objPtr) != JIM_OK)
\r
6465 return (ExprByteCode*) Jim_GetIntRepPtr(objPtr);
\r
6468 /* -----------------------------------------------------------------------------
\r
6469 * Expressions evaluation.
\r
6470 * Jim uses a specialized stack-based virtual machine for expressions,
\r
6471 * that takes advantage of the fact that expr's operators
\r
6472 * can't be redefined.
\r
6474 * Jim_EvalExpression() uses the bytecode compiled by
\r
6475 * SetExprFromAny() method of the "expression" object.
\r
6477 * On success a Tcl Object containing the result of the evaluation
\r
6478 * is stored into expResultPtrPtr (having refcount of 1), and JIM_OK is
\r
6480 * On error the function returns a retcode != to JIM_OK and set a suitable
\r
6481 * error on the interp.
\r
6482 * ---------------------------------------------------------------------------*/
\r
6483 #define JIM_EE_STATICSTACK_LEN 10
\r
6485 int Jim_EvalExpression(Jim_Interp *interp, Jim_Obj *exprObjPtr,
\r
6486 Jim_Obj **exprResultPtrPtr)
\r
6488 ExprByteCode *expr;
\r
6489 Jim_Obj **stack, *staticStack[JIM_EE_STATICSTACK_LEN];
\r
6490 int stacklen = 0, i, error = 0, errRetCode = JIM_ERR;
\r
6492 Jim_IncrRefCount(exprObjPtr);
\r
6493 expr = Jim_GetExpression(interp, exprObjPtr);
\r
6495 Jim_DecrRefCount(interp, exprObjPtr);
\r
6496 return JIM_ERR; /* error in expression. */
\r
6498 /* In order to avoid that the internal repr gets freed due to
\r
6499 * shimmering of the exprObjPtr's object, we make the internal rep
\r
6503 /* The stack-based expr VM itself */
\r
6505 /* Stack allocation. Expr programs have the feature that
\r
6506 * a program of length N can't require a stack longer than
\r
6508 if (expr->len > JIM_EE_STATICSTACK_LEN)
\r
6509 stack = Jim_Alloc(sizeof(Jim_Obj*)*expr->len);
\r
6511 stack = staticStack;
\r
6513 /* Execute every istruction */
\r
6514 for (i = 0; i < expr->len; i++) {
\r
6515 Jim_Obj *A, *B, *objPtr;
\r
6516 jim_wide wA, wB, wC;
\r
6517 double dA, dB, dC;
\r
6518 const char *sA, *sB;
\r
6519 int Alen, Blen, retcode;
\r
6520 int opcode = expr->opcode[i];
\r
6522 if (opcode == JIM_EXPROP_NUMBER || opcode == JIM_EXPROP_STRING) {
\r
6523 stack[stacklen++] = expr->obj[i];
\r
6524 Jim_IncrRefCount(expr->obj[i]);
\r
6525 } else if (opcode == JIM_EXPROP_VARIABLE) {
\r
6526 objPtr = Jim_GetVariable(interp, expr->obj[i], JIM_ERRMSG);
\r
6527 if (objPtr == NULL) {
\r
6531 stack[stacklen++] = objPtr;
\r
6532 Jim_IncrRefCount(objPtr);
\r
6533 } else if (opcode == JIM_EXPROP_SUBST) {
\r
6534 if ((retcode = Jim_SubstObj(interp, expr->obj[i],
\r
6535 &objPtr, JIM_NONE)) != JIM_OK)
\r
6538 errRetCode = retcode;
\r
6541 stack[stacklen++] = objPtr;
\r
6542 Jim_IncrRefCount(objPtr);
\r
6543 } else if (opcode == JIM_EXPROP_DICTSUGAR) {
\r
6544 objPtr = Jim_ExpandDictSugar(interp, expr->obj[i]);
\r
6545 if (objPtr == NULL) {
\r
6549 stack[stacklen++] = objPtr;
\r
6550 Jim_IncrRefCount(objPtr);
\r
6551 } else if (opcode == JIM_EXPROP_COMMAND) {
\r
6552 if ((retcode = Jim_EvalObj(interp, expr->obj[i])) != JIM_OK) {
\r
6554 errRetCode = retcode;
\r
6557 stack[stacklen++] = interp->result;
\r
6558 Jim_IncrRefCount(interp->result);
\r
6559 } else if (opcode >= JIM_EXPROP_BINARY_NUM_FIRST &&
\r
6560 opcode <= JIM_EXPROP_BINARY_NUM_LAST)
\r
6562 /* Note that there isn't to increment the
\r
6563 * refcount of objects. the references are moved
\r
6564 * from stack to A and B. */
\r
6565 B = stack[--stacklen];
\r
6566 A = stack[--stacklen];
\r
6568 /* --- Integer --- */
\r
6569 if ((A->typePtr == &doubleObjType && !A->bytes) ||
\r
6570 (B->typePtr == &doubleObjType && !B->bytes) ||
\r
6571 JimGetWideNoErr(interp, A, &wA) != JIM_OK ||
\r
6572 JimGetWideNoErr(interp, B, &wB) != JIM_OK) {
\r
6575 Jim_DecrRefCount(interp, A);
\r
6576 Jim_DecrRefCount(interp, B);
\r
6577 switch(expr->opcode[i]) {
\r
6578 case JIM_EXPROP_ADD: wC = wA+wB; break;
\r
6579 case JIM_EXPROP_SUB: wC = wA-wB; break;
\r
6580 case JIM_EXPROP_MUL: wC = wA*wB; break;
\r
6581 case JIM_EXPROP_LT: wC = wA<wB; break;
\r
6582 case JIM_EXPROP_GT: wC = wA>wB; break;
\r
6583 case JIM_EXPROP_LTE: wC = wA<=wB; break;
\r
6584 case JIM_EXPROP_GTE: wC = wA>=wB; break;
\r
6585 case JIM_EXPROP_LSHIFT: wC = wA<<wB; break;
\r
6586 case JIM_EXPROP_RSHIFT: wC = wA>>wB; break;
\r
6587 case JIM_EXPROP_NUMEQ: wC = wA==wB; break;
\r
6588 case JIM_EXPROP_NUMNE: wC = wA!=wB; break;
\r
6589 case JIM_EXPROP_BITAND: wC = wA&wB; break;
\r
6590 case JIM_EXPROP_BITXOR: wC = wA^wB; break;
\r
6591 case JIM_EXPROP_BITOR: wC = wA|wB; break;
\r
6592 case JIM_EXPROP_POW: wC = JimPowWide(wA,wB); break;
\r
6593 case JIM_EXPROP_LOGICAND_LEFT:
\r
6601 case JIM_EXPROP_LOGICOR_LEFT:
\r
6609 case JIM_EXPROP_DIV:
\r
6610 if (wB == 0) goto divbyzero;
\r
6613 case JIM_EXPROP_MOD:
\r
6614 if (wB == 0) goto divbyzero;
\r
6617 case JIM_EXPROP_ROTL: {
\r
6618 /* uint32_t would be better. But not everyone has inttypes.h?*/
\r
6619 unsigned long uA = (unsigned long)wA;
\r
6621 wC = _rotl(uA,(unsigned long)wB);
\r
6623 const unsigned int S = sizeof(unsigned long) * 8;
\r
6624 wC = (unsigned long)((uA<<wB)|(uA>>(S-wB)));
\r
6628 case JIM_EXPROP_ROTR: {
\r
6629 unsigned long uA = (unsigned long)wA;
\r
6631 wC = _rotr(uA,(unsigned long)wB);
\r
6633 const unsigned int S = sizeof(unsigned long) * 8;
\r
6634 wC = (unsigned long)((uA>>wB)|(uA<<(S-wB)));
\r
6640 wC = 0; /* avoid gcc warning */
\r
6643 stack[stacklen] = Jim_NewIntObj(interp, wC);
\r
6644 Jim_IncrRefCount(stack[stacklen]);
\r
6648 /* --- Double --- */
\r
6649 if (Jim_GetDouble(interp, A, &dA) != JIM_OK ||
\r
6650 Jim_GetDouble(interp, B, &dB) != JIM_OK) {
\r
6651 Jim_DecrRefCount(interp, A);
\r
6652 Jim_DecrRefCount(interp, B);
\r
6656 Jim_DecrRefCount(interp, A);
\r
6657 Jim_DecrRefCount(interp, B);
\r
6658 switch(expr->opcode[i]) {
\r
6659 case JIM_EXPROP_ROTL:
\r
6660 case JIM_EXPROP_ROTR:
\r
6661 case JIM_EXPROP_LSHIFT:
\r
6662 case JIM_EXPROP_RSHIFT:
\r
6663 case JIM_EXPROP_BITAND:
\r
6664 case JIM_EXPROP_BITXOR:
\r
6665 case JIM_EXPROP_BITOR:
\r
6666 case JIM_EXPROP_MOD:
\r
6667 case JIM_EXPROP_POW:
\r
6668 Jim_SetResultString(interp,
\r
6669 "Got floating-point value where integer was expected", -1);
\r
6673 case JIM_EXPROP_ADD: dC = dA+dB; break;
\r
6674 case JIM_EXPROP_SUB: dC = dA-dB; break;
\r
6675 case JIM_EXPROP_MUL: dC = dA*dB; break;
\r
6676 case JIM_EXPROP_LT: dC = dA<dB; break;
\r
6677 case JIM_EXPROP_GT: dC = dA>dB; break;
\r
6678 case JIM_EXPROP_LTE: dC = dA<=dB; break;
\r
6679 case JIM_EXPROP_GTE: dC = dA>=dB; break;
\r
6680 case JIM_EXPROP_NUMEQ: dC = dA==dB; break;
\r
6681 case JIM_EXPROP_NUMNE: dC = dA!=dB; break;
\r
6682 case JIM_EXPROP_LOGICAND_LEFT:
\r
6690 case JIM_EXPROP_LOGICOR_LEFT:
\r
6698 case JIM_EXPROP_DIV:
\r
6699 if (dB == 0) goto divbyzero;
\r
6703 dC = 0; /* avoid gcc warning */
\r
6706 stack[stacklen] = Jim_NewDoubleObj(interp, dC);
\r
6707 Jim_IncrRefCount(stack[stacklen]);
\r
6709 } else if (opcode == JIM_EXPROP_STREQ || opcode == JIM_EXPROP_STRNE) {
\r
6710 B = stack[--stacklen];
\r
6711 A = stack[--stacklen];
\r
6712 sA = Jim_GetString(A, &Alen);
\r
6713 sB = Jim_GetString(B, &Blen);
\r
6714 switch(expr->opcode[i]) {
\r
6715 case JIM_EXPROP_STREQ:
\r
6716 if (Alen == Blen && memcmp(sA, sB, Alen) ==0)
\r
6721 case JIM_EXPROP_STRNE:
\r
6722 if (Alen != Blen || memcmp(sA, sB, Alen) != 0)
\r
6728 wC = 0; /* avoid gcc warning */
\r
6731 Jim_DecrRefCount(interp, A);
\r
6732 Jim_DecrRefCount(interp, B);
\r
6733 stack[stacklen] = Jim_NewIntObj(interp, wC);
\r
6734 Jim_IncrRefCount(stack[stacklen]);
\r
6736 } else if (opcode == JIM_EXPROP_NOT ||
\r
6737 opcode == JIM_EXPROP_BITNOT ||
\r
6738 opcode == JIM_EXPROP_LOGICAND_RIGHT ||
\r
6739 opcode == JIM_EXPROP_LOGICOR_RIGHT) {
\r
6740 /* Note that there isn't to increment the
\r
6741 * refcount of objects. the references are moved
\r
6742 * from stack to A and B. */
\r
6743 A = stack[--stacklen];
\r
6745 /* --- Integer --- */
\r
6746 if ((A->typePtr == &doubleObjType && !A->bytes) ||
\r
6747 JimGetWideNoErr(interp, A, &wA) != JIM_OK) {
\r
6748 goto trydouble_unary;
\r
6750 Jim_DecrRefCount(interp, A);
\r
6751 switch(expr->opcode[i]) {
\r
6752 case JIM_EXPROP_NOT: wC = !wA; break;
\r
6753 case JIM_EXPROP_BITNOT: wC = ~wA; break;
\r
6754 case JIM_EXPROP_LOGICAND_RIGHT:
\r
6755 case JIM_EXPROP_LOGICOR_RIGHT: wC = (wA != 0); break;
\r
6757 wC = 0; /* avoid gcc warning */
\r
6760 stack[stacklen] = Jim_NewIntObj(interp, wC);
\r
6761 Jim_IncrRefCount(stack[stacklen]);
\r
6765 /* --- Double --- */
\r
6766 if (Jim_GetDouble(interp, A, &dA) != JIM_OK) {
\r
6767 Jim_DecrRefCount(interp, A);
\r
6771 Jim_DecrRefCount(interp, A);
\r
6772 switch(expr->opcode[i]) {
\r
6773 case JIM_EXPROP_NOT: dC = !dA; break;
\r
6774 case JIM_EXPROP_LOGICAND_RIGHT:
\r
6775 case JIM_EXPROP_LOGICOR_RIGHT: dC = (dA != 0); break;
\r
6776 case JIM_EXPROP_BITNOT:
\r
6777 Jim_SetResultString(interp,
\r
6778 "Got floating-point value where integer was expected", -1);
\r
6783 dC = 0; /* avoid gcc warning */
\r
6786 stack[stacklen] = Jim_NewDoubleObj(interp, dC);
\r
6787 Jim_IncrRefCount(stack[stacklen]);
\r
6790 Jim_Panic(interp,"Unknown opcode in Jim_EvalExpression");
\r
6794 /* There is no need to decerement the inUse field because
\r
6795 * this reference is transfered back into the exprObjPtr. */
\r
6796 Jim_FreeIntRep(interp, exprObjPtr);
\r
6797 exprObjPtr->typePtr = &exprObjType;
\r
6798 Jim_SetIntRepPtr(exprObjPtr, expr);
\r
6799 Jim_DecrRefCount(interp, exprObjPtr);
\r
6801 *exprResultPtrPtr = stack[0];
\r
6802 Jim_IncrRefCount(stack[0]);
\r
6803 errRetCode = JIM_OK;
\r
6805 for (i = 0; i < stacklen; i++) {
\r
6806 Jim_DecrRefCount(interp, stack[i]);
\r
6808 if (stack != staticStack)
\r
6810 return errRetCode;
\r
6813 Jim_SetResultString(interp, "Division by zero", -1);
\r
6817 int Jim_GetBoolFromExpr(Jim_Interp *interp, Jim_Obj *exprObjPtr, int *boolPtr)
\r
6820 jim_wide wideValue;
\r
6821 double doubleValue;
\r
6822 Jim_Obj *exprResultPtr;
\r
6824 retcode = Jim_EvalExpression(interp, exprObjPtr, &exprResultPtr);
\r
6825 if (retcode != JIM_OK)
\r
6827 if (JimGetWideNoErr(interp, exprResultPtr, &wideValue) != JIM_OK) {
\r
6828 if (Jim_GetDouble(interp, exprResultPtr, &doubleValue) != JIM_OK)
\r
6830 Jim_DecrRefCount(interp, exprResultPtr);
\r
6833 Jim_DecrRefCount(interp, exprResultPtr);
\r
6834 *boolPtr = doubleValue != 0;
\r
6838 Jim_DecrRefCount(interp, exprResultPtr);
\r
6839 *boolPtr = wideValue != 0;
\r
6843 /* -----------------------------------------------------------------------------
\r
6844 * ScanFormat String Object
\r
6845 * ---------------------------------------------------------------------------*/
\r
6847 /* This Jim_Obj will held a parsed representation of a format string passed to
\r
6848 * the Jim_ScanString command. For error diagnostics, the scanformat string has
\r
6849 * to be parsed in its entirely first and then, if correct, can be used for
\r
6850 * scanning. To avoid endless re-parsing, the parsed representation will be
\r
6851 * stored in an internal representation and re-used for performance reason. */
\r
6853 /* A ScanFmtPartDescr will held the information of /one/ part of the whole
\r
6854 * scanformat string. This part will later be used to extract information
\r
6855 * out from the string to be parsed by Jim_ScanString */
\r
6857 typedef struct ScanFmtPartDescr {
\r
6858 char type; /* Type of conversion (e.g. c, d, f) */
\r
6859 char modifier; /* Modify type (e.g. l - long, h - short */
\r
6860 size_t width; /* Maximal width of input to be converted */
\r
6861 int pos; /* -1 - no assign, 0 - natural pos, >0 - XPG3 pos */
\r
6862 char *arg; /* Specification of a CHARSET conversion */
\r
6863 char *prefix; /* Prefix to be scanned literally before conversion */
\r
6864 } ScanFmtPartDescr;
\r
6866 /* The ScanFmtStringObj will held the internal representation of a scanformat
\r
6867 * string parsed and separated in part descriptions. Furthermore it contains
\r
6868 * the original string representation of the scanformat string to allow for
\r
6869 * fast update of the Jim_Obj's string representation part.
\r
6871 * As add-on the internal object representation add some scratch pad area
\r
6872 * for usage by Jim_ScanString to avoid endless allocating and freeing of
\r
6873 * memory for purpose of string scanning.
\r
6875 * The error member points to a static allocated string in case of a mal-
\r
6876 * formed scanformat string or it contains '0' (NULL) in case of a valid
\r
6877 * parse representation.
\r
6879 * The whole memory of the internal representation is allocated as a single
\r
6880 * area of memory that will be internally separated. So freeing and duplicating
\r
6881 * of such an object is cheap */
\r
6883 typedef struct ScanFmtStringObj {
\r
6884 jim_wide size; /* Size of internal repr in bytes */
\r
6885 char *stringRep; /* Original string representation */
\r
6886 size_t count; /* Number of ScanFmtPartDescr contained */
\r
6887 size_t convCount; /* Number of conversions that will assign */
\r
6888 size_t maxPos; /* Max position index if XPG3 is used */
\r
6889 const char *error; /* Ptr to error text (NULL if no error */
\r
6890 char *scratch; /* Some scratch pad used by Jim_ScanString */
\r
6891 ScanFmtPartDescr descr[1]; /* The vector of partial descriptions */
\r
6892 } ScanFmtStringObj;
\r
6895 static void FreeScanFmtInternalRep(Jim_Interp *interp, Jim_Obj *objPtr);
\r
6896 static void DupScanFmtInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr);
\r
6897 static void UpdateStringOfScanFmt(Jim_Obj *objPtr);
\r
6899 static Jim_ObjType scanFmtStringObjType = {
\r
6900 "scanformatstring",
\r
6901 FreeScanFmtInternalRep,
\r
6902 DupScanFmtInternalRep,
\r
6903 UpdateStringOfScanFmt,
\r
6907 void FreeScanFmtInternalRep(Jim_Interp *interp, Jim_Obj *objPtr)
\r
6909 JIM_NOTUSED(interp);
\r
6910 Jim_Free((char*)objPtr->internalRep.ptr);
\r
6911 objPtr->internalRep.ptr = 0;
\r
6914 void DupScanFmtInternalRep(Jim_Interp *interp, Jim_Obj *srcPtr, Jim_Obj *dupPtr)
\r
6916 size_t size = (size_t)((ScanFmtStringObj*)srcPtr->internalRep.ptr)->size;
\r
6917 ScanFmtStringObj *newVec = (ScanFmtStringObj*)Jim_Alloc(size);
\r
6919 JIM_NOTUSED(interp);
\r
6920 memcpy(newVec, srcPtr->internalRep.ptr, size);
\r
6921 dupPtr->internalRep.ptr = newVec;
\r
6922 dupPtr->typePtr = &scanFmtStringObjType;
\r
6925 void UpdateStringOfScanFmt(Jim_Obj *objPtr)
\r
6927 char *bytes = ((ScanFmtStringObj*)objPtr->internalRep.ptr)->stringRep;
\r
6929 objPtr->bytes = Jim_StrDup(bytes);
\r
6930 objPtr->length = strlen(bytes);
\r
6933 /* SetScanFmtFromAny will parse a given string and create the internal
\r
6934 * representation of the format specification. In case of an error
\r
6935 * the error data member of the internal representation will be set
\r
6936 * to an descriptive error text and the function will be left with
\r
6937 * JIM_ERR to indicate unsucessful parsing (aka. malformed scanformat
\r
6938 * specification */
\r
6940 static int SetScanFmtFromAny(Jim_Interp *interp, Jim_Obj *objPtr)
\r
6942 ScanFmtStringObj *fmtObj;
\r
6944 int maxCount, i, approxSize, lastPos = -1;
\r
6945 const char *fmt = objPtr->bytes;
\r
6946 int maxFmtLen = objPtr->length;
\r
6947 const char *fmtEnd = fmt + maxFmtLen;
\r
6950 Jim_FreeIntRep(interp, objPtr);
\r
6951 /* Count how many conversions could take place maximally */
\r
6952 for (i=0, maxCount=0; i < maxFmtLen; ++i)
\r
6953 if (fmt[i] == '%')
\r
6955 /* Calculate an approximation of the memory necessary */
\r
6956 approxSize = sizeof(ScanFmtStringObj) /* Size of the container */
\r
6957 + (maxCount + 1) * sizeof(ScanFmtPartDescr) /* Size of all partials */
\r
6958 + maxFmtLen * sizeof(char) + 3 + 1 /* Scratch + "%n" + '\0' */
\r
6959 + maxFmtLen * sizeof(char) + 1 /* Original stringrep */
\r
6960 + maxFmtLen * sizeof(char) /* Arg for CHARSETs */
\r
6961 + (maxCount +1) * sizeof(char) /* '\0' for every partial */
\r
6962 + 1; /* safety byte */
\r
6963 fmtObj = (ScanFmtStringObj*)Jim_Alloc(approxSize);
\r
6964 memset(fmtObj, 0, approxSize);
\r
6965 fmtObj->size = approxSize;
\r
6966 fmtObj->maxPos = 0;
\r
6967 fmtObj->scratch = (char*)&fmtObj->descr[maxCount+1];
\r
6968 fmtObj->stringRep = fmtObj->scratch + maxFmtLen + 3 + 1;
\r
6969 memcpy(fmtObj->stringRep, fmt, maxFmtLen);
\r
6970 buffer = fmtObj->stringRep + maxFmtLen + 1;
\r
6971 objPtr->internalRep.ptr = fmtObj;
\r
6972 objPtr->typePtr = &scanFmtStringObjType;
\r
6973 for (i=0, curr=0; fmt < fmtEnd; ++fmt) {
\r
6974 int width=0, skip;
\r
6975 ScanFmtPartDescr *descr = &fmtObj->descr[curr];
\r
6977 descr->width = 0; /* Assume width unspecified */
\r
6978 /* Overread and store any "literal" prefix */
\r
6979 if (*fmt != '%' || fmt[1] == '%') {
\r
6981 descr->prefix = &buffer[i];
\r
6982 for (; fmt < fmtEnd; ++fmt) {
\r
6983 if (*fmt == '%') {
\r
6984 if (fmt[1] != '%') break;
\r
6987 buffer[i++] = *fmt;
\r
6991 /* Skip the conversion introducing '%' sign */
\r
6993 /* End reached due to non-conversion literal only? */
\r
6994 if (fmt >= fmtEnd)
\r
6996 descr->pos = 0; /* Assume "natural" positioning */
\r
6997 if (*fmt == '*') {
\r
6998 descr->pos = -1; /* Okay, conversion will not be assigned */
\r
7001 fmtObj->convCount++; /* Otherwise count as assign-conversion */
\r
7002 /* Check if next token is a number (could be width or pos */
\r
7003 if (sscanf(fmt, "%d%n", &width, &skip) == 1) {
\r
7005 /* Was the number a XPG3 position specifier? */
\r
7006 if (descr->pos != -1 && *fmt == '$') {
\r
7009 descr->pos = width;
\r
7011 /* Look if "natural" postioning and XPG3 one was mixed */
\r
7012 if ((lastPos == 0 && descr->pos > 0)
\r
7013 || (lastPos > 0 && descr->pos == 0)) {
\r
7014 fmtObj->error = "cannot mix \"%\" and \"%n$\" conversion specifiers";
\r
7017 /* Look if this position was already used */
\r
7018 for (prev=0; prev < curr; ++prev) {
\r
7019 if (fmtObj->descr[prev].pos == -1) continue;
\r
7020 if (fmtObj->descr[prev].pos == descr->pos) {
\r
7021 fmtObj->error = "same \"%n$\" conversion specifier "
\r
7022 "used more than once";
\r
7026 /* Try to find a width after the XPG3 specifier */
\r
7027 if (sscanf(fmt, "%d%n", &width, &skip) == 1) {
\r
7028 descr->width = width;
\r
7031 if (descr->pos > 0 && (size_t)descr->pos > fmtObj->maxPos)
\r
7032 fmtObj->maxPos = descr->pos;
\r
7034 /* Number was not a XPG3, so it has to be a width */
\r
7035 descr->width = width;
\r
7038 /* If positioning mode was undetermined yet, fix this */
\r
7039 if (lastPos == -1)
\r
7040 lastPos = descr->pos;
\r
7041 /* Handle CHARSET conversion type ... */
\r
7042 if (*fmt == '[') {
\r
7043 int swapped = 1, beg = i, end, j;
\r
7044 descr->type = '[';
\r
7045 descr->arg = &buffer[i];
\r
7047 if (*fmt == '^') buffer[i++] = *fmt++;
\r
7048 if (*fmt == ']') buffer[i++] = *fmt++;
\r
7049 while (*fmt && *fmt != ']') buffer[i++] = *fmt++;
\r
7050 if (*fmt != ']') {
\r
7051 fmtObj->error = "unmatched [ in format string";
\r
7056 /* In case a range fence was given "backwards", swap it */
\r
7059 for (j=beg+1; j < end-1; ++j) {
\r
7060 if (buffer[j] == '-' && buffer[j-1] > buffer[j+1]) {
\r
7061 char tmp = buffer[j-1];
\r
7062 buffer[j-1] = buffer[j+1];
\r
7063 buffer[j+1] = tmp;
\r
7069 /* Remember any valid modifier if given */
\r
7070 if (strchr("hlL", *fmt) != 0)
\r
7071 descr->modifier = tolower((int)*fmt++);
\r
7073 descr->type = *fmt;
\r
7074 if (strchr("efgcsndoxui", *fmt) == 0) {
\r
7075 fmtObj->error = "bad scan conversion character";
\r
7077 } else if (*fmt == 'c' && descr->width != 0) {
\r
7078 fmtObj->error = "field width may not be specified in %c "
\r
7081 } else if (*fmt == 'u' && descr->modifier == 'l') {
\r
7082 fmtObj->error = "unsigned wide not supported";
\r
7089 if (fmtObj->convCount == 0) {
\r
7090 fmtObj->error = "no any conversion specifier given";
\r
7096 /* Some accessor macros to allow lowlevel access to fields of internal repr */
\r
7098 #define FormatGetCnvCount(_fo_) \
\r
7099 ((ScanFmtStringObj*)((_fo_)->internalRep.ptr))->convCount
\r
7100 #define FormatGetMaxPos(_fo_) \
\r
7101 ((ScanFmtStringObj*)((_fo_)->internalRep.ptr))->maxPos
\r
7102 #define FormatGetError(_fo_) \
\r
7103 ((ScanFmtStringObj*)((_fo_)->internalRep.ptr))->error
\r
7105 /* Some Bit testing/setting/cleaning routines. For now only used in handling
\r
7106 * charsets ([a-z123]) within scanning. Later on perhaps a base for a
\r
7107 * bitvector implementation in Jim? */
\r
7109 static int JimTestBit(const char *bitvec, char ch)
\r
7111 div_t pos = div(ch-1, 8);
\r
7112 return bitvec[pos.quot] & (1 << pos.rem);
\r
7115 static void JimSetBit(char *bitvec, char ch)
\r
7117 div_t pos = div(ch-1, 8);
\r
7118 bitvec[pos.quot] |= (1 << pos.rem);
\r
7121 #if 0 /* currently not used */
\r
7122 static void JimClearBit(char *bitvec, char ch)
\r
7124 div_t pos = div(ch-1, 8);
\r
7125 bitvec[pos.quot] &= ~(1 << pos.rem);
\r
7129 /* JimScanAString is used to scan an unspecified string that ends with
\r
7130 * next WS, or a string that is specified via a charset. The charset
\r
7131 * is currently implemented in a way to only allow for usage with
\r
7132 * ASCII. Whenever we will switch to UNICODE, another idea has to
\r
7135 * FIXME: Works only with ASCII */
\r
7138 JimScanAString(Jim_Interp *interp, const char *sdescr, const char *str)
\r
7142 char charset[256/8+1]; /* A Charset may contain max 256 chars */
\r
7143 char *buffer = Jim_Alloc(strlen(str)+1), *anchor = buffer;
\r
7145 /* First init charset to nothing or all, depending if a specified
\r
7146 * or an unspecified string has to be parsed */
\r
7147 memset(charset, (sdescr ? 0 : 255), sizeof(charset));
\r
7149 /* There was a set description given, that means we are parsing
\r
7150 * a specified string. So we have to build a corresponding
\r
7151 * charset reflecting the description */
\r
7153 /* Should the set be negated at the end? */
\r
7154 if (*sdescr == '^') {
\r
7158 /* Here '-' is meant literally and not to define a range */
\r
7159 if (*sdescr == '-') {
\r
7160 JimSetBit(charset, '-');
\r
7164 if (sdescr[1] == '-' && sdescr[2] != 0) {
\r
7165 /* Handle range definitions */
\r
7167 for (i=sdescr[0]; i <= sdescr[2]; ++i)
\r
7168 JimSetBit(charset, (char)i);
\r
7171 /* Handle verbatim character definitions */
\r
7172 JimSetBit(charset, *sdescr++);
\r
7175 /* Negate the charset if there was a NOT given */
\r
7176 for (i=0; notFlag && i < sizeof(charset); ++i)
\r
7177 charset[i] = ~charset[i];
\r
7179 /* And after all the mess above, the real work begin ... */
\r
7180 while (str && *str) {
\r
7181 if (!sdescr && isspace((int)*str))
\r
7182 break; /* EOS via WS if unspecified */
\r
7183 if (JimTestBit(charset, *str)) *buffer++ = *str++;
\r
7184 else break; /* EOS via mismatch if specified scanning */
\r
7186 *buffer = 0; /* Close the string properly ... */
\r
7187 result = Jim_NewStringObj(interp, anchor, -1);
\r
7188 Jim_Free(anchor); /* ... and free it afer usage */
\r
7192 /* ScanOneEntry will scan one entry out of the string passed as argument.
\r
7193 * It use the sscanf() function for this task. After extracting and
\r
7194 * converting of the value, the count of scanned characters will be
\r
7195 * returned of -1 in case of no conversion tool place and string was
\r
7196 * already scanned thru */
\r
7198 static int ScanOneEntry(Jim_Interp *interp, const char *str, long pos,
\r
7199 ScanFmtStringObj *fmtObj, long index, Jim_Obj **valObjPtr)
\r
7201 # define MAX_SIZE (sizeof(jim_wide) > sizeof(double) \
\r
7202 ? sizeof(jim_wide) \
\r
7204 char buffer[MAX_SIZE];
\r
7205 char *value = buffer;
\r
7207 const ScanFmtPartDescr *descr = &fmtObj->descr[index];
\r
7208 size_t sLen = strlen(&str[pos]), scanned = 0;
\r
7209 size_t anchor = pos;
\r
7212 /* First pessimiticly assume, we will not scan anything :-) */
\r
7214 if (descr->prefix) {
\r
7215 /* There was a prefix given before the conversion, skip it and adjust
\r
7216 * the string-to-be-parsed accordingly */
\r
7217 for (i=0; str[pos] && descr->prefix[i]; ++i) {
\r
7218 /* If prefix require, skip WS */
\r
7219 if (isspace((int)descr->prefix[i]))
\r
7220 while (str[pos] && isspace((int)str[pos])) ++pos;
\r
7221 else if (descr->prefix[i] != str[pos])
\r
7222 break; /* Prefix do not match here, leave the loop */
\r
7224 ++pos; /* Prefix matched so far, next round */
\r
7226 if (str[pos] == 0)
\r
7227 return -1; /* All of str consumed: EOF condition */
\r
7228 else if (descr->prefix[i] != 0)
\r
7229 return 0; /* Not whole prefix consumed, no conversion possible */
\r
7231 /* For all but following conversion, skip leading WS */
\r
7232 if (descr->type != 'c' && descr->type != '[' && descr->type != 'n')
\r
7233 while (isspace((int)str[pos])) ++pos;
\r
7234 /* Determine how much skipped/scanned so far */
\r
7235 scanned = pos - anchor;
\r
7236 if (descr->type == 'n') {
\r
7237 /* Return pseudo conversion means: how much scanned so far? */
\r
7238 *valObjPtr = Jim_NewIntObj(interp, anchor + scanned);
\r
7239 } else if (str[pos] == 0) {
\r
7240 /* Cannot scan anything, as str is totally consumed */
\r
7243 /* Processing of conversions follows ... */
\r
7244 if (descr->width > 0) {
\r
7245 /* Do not try to scan as fas as possible but only the given width.
\r
7246 * To ensure this, we copy the part that should be scanned. */
\r
7247 size_t tLen = descr->width > sLen ? sLen : descr->width;
\r
7248 tok = Jim_StrDupLen(&str[pos], tLen);
\r
7250 /* As no width was given, simply refer to the original string */
\r
7253 switch (descr->type) {
\r
7255 *valObjPtr = Jim_NewIntObj(interp, *tok);
\r
7258 case 'd': case 'o': case 'x': case 'u': case 'i': {
\r
7259 char *endp; /* Position where the number finished */
\r
7260 int base = descr->type == 'o' ? 8
\r
7261 : descr->type == 'x' ? 16
\r
7262 : descr->type == 'i' ? 0
\r
7266 /* Try to scan a number with the given base */
\r
7267 if (descr->modifier == 'l')
\r
7268 #ifdef HAVE_LONG_LONG
\r
7269 *(jim_wide*)value = JimStrtoll(tok, &endp, base);
\r
7271 *(jim_wide*)value = strtol(tok, &endp, base);
\r
7274 if (descr->type == 'u')
\r
7275 *(long*)value = strtoul(tok, &endp, base);
\r
7277 *(long*)value = strtol(tok, &endp, base);
\r
7278 /* If scanning failed, and base was undetermined, simply
\r
7279 * put it to 10 and try once more. This should catch the
\r
7280 * case where %i begin to parse a number prefix (e.g.
\r
7281 * '0x' but no further digits follows. This will be
\r
7282 * handled as a ZERO followed by a char 'x' by Tcl */
\r
7283 if (endp == tok && base == 0) base = 10;
\r
7286 if (endp != tok) {
\r
7287 /* There was some number sucessfully scanned! */
\r
7288 if (descr->modifier == 'l')
\r
7289 *valObjPtr = Jim_NewIntObj(interp, *(jim_wide*)value);
\r
7291 *valObjPtr = Jim_NewIntObj(interp, *(long*)value);
\r
7292 /* Adjust the number-of-chars scanned so far */
\r
7293 scanned += endp - tok;
\r
7295 /* Nothing was scanned. We have to determine if this
\r
7296 * happened due to e.g. prefix mismatch or input str
\r
7298 scanned = *tok ? 0 : -1;
\r
7302 case 's': case '[': {
\r
7303 *valObjPtr = JimScanAString(interp, descr->arg, tok);
\r
7304 scanned += Jim_Length(*valObjPtr);
\r
7307 case 'e': case 'f': case 'g': {
\r
7310 *(double*)value = strtod(tok, &endp);
\r
7311 if (endp != tok) {
\r
7312 /* There was some number sucessfully scanned! */
\r
7313 *valObjPtr = Jim_NewDoubleObj(interp, *(double*)value);
\r
7314 /* Adjust the number-of-chars scanned so far */
\r
7315 scanned += endp - tok;
\r
7317 /* Nothing was scanned. We have to determine if this
\r
7318 * happened due to e.g. prefix mismatch or input str
\r
7320 scanned = *tok ? 0 : -1;
\r
7325 /* If a substring was allocated (due to pre-defined width) do not
\r
7326 * forget to free it */
\r
7327 if (tok != &str[pos])
\r
7328 Jim_Free((char*)tok);
\r
7333 /* Jim_ScanString is the workhorse of string scanning. It will scan a given
\r
7334 * string and returns all converted (and not ignored) values in a list back
\r
7335 * to the caller. If an error occured, a NULL pointer will be returned */
\r
7337 Jim_Obj *Jim_ScanString(Jim_Interp *interp, Jim_Obj *strObjPtr,
\r
7338 Jim_Obj *fmtObjPtr, int flags)
\r
7342 const char *str = Jim_GetString(strObjPtr, 0);
\r
7343 Jim_Obj *resultList = 0;
\r
7344 Jim_Obj **resultVec;
\r
7346 Jim_Obj *emptyStr = 0;
\r
7347 ScanFmtStringObj *fmtObj;
\r
7349 /* If format specification is not an object, convert it! */
\r
7350 if (fmtObjPtr->typePtr != &scanFmtStringObjType)
\r
7351 SetScanFmtFromAny(interp, fmtObjPtr);
\r
7352 fmtObj = (ScanFmtStringObj*)fmtObjPtr->internalRep.ptr;
\r
7353 /* Check if format specification was valid */
\r
7354 if (fmtObj->error != 0) {
\r
7355 if (flags & JIM_ERRMSG)
\r
7356 Jim_SetResultString(interp, fmtObj->error, -1);
\r
7359 /* Allocate a new "shared" empty string for all unassigned conversions */
\r
7360 emptyStr = Jim_NewEmptyStringObj(interp);
\r
7361 Jim_IncrRefCount(emptyStr);
\r
7362 /* Create a list and fill it with empty strings up to max specified XPG3 */
\r
7363 resultList = Jim_NewListObj(interp, 0, 0);
\r
7364 if (fmtObj->maxPos > 0) {
\r
7365 for (i=0; i < fmtObj->maxPos; ++i)
\r
7366 Jim_ListAppendElement(interp, resultList, emptyStr);
\r
7367 JimListGetElements(interp, resultList, &resultc, &resultVec);
\r
7369 /* Now handle every partial format description */
\r
7370 for (i=0, pos=0; i < fmtObj->count; ++i) {
\r
7371 ScanFmtPartDescr *descr = &(fmtObj->descr[i]);
\r
7372 Jim_Obj *value = 0;
\r
7373 /* Only last type may be "literal" w/o conversion - skip it! */
\r
7374 if (descr->type == 0) continue;
\r
7375 /* As long as any conversion could be done, we will proceed */
\r
7377 scanned = ScanOneEntry(interp, str, pos, fmtObj, i, &value);
\r
7378 /* In case our first try results in EOF, we will leave */
\r
7379 if (scanned == -1 && i == 0)
\r
7381 /* Advance next pos-to-be-scanned for the amount scanned already */
\r
7383 /* value == 0 means no conversion took place so take empty string */
\r
7385 value = Jim_NewEmptyStringObj(interp);
\r
7386 /* If value is a non-assignable one, skip it */
\r
7387 if (descr->pos == -1) {
\r
7388 Jim_FreeNewObj(interp, value);
\r
7389 } else if (descr->pos == 0)
\r
7390 /* Otherwise append it to the result list if no XPG3 was given */
\r
7391 Jim_ListAppendElement(interp, resultList, value);
\r
7392 else if (resultVec[descr->pos-1] == emptyStr) {
\r
7393 /* But due to given XPG3, put the value into the corr. slot */
\r
7394 Jim_DecrRefCount(interp, resultVec[descr->pos-1]);
\r
7395 Jim_IncrRefCount(value);
\r
7396 resultVec[descr->pos-1] = value;
\r
7398 /* Otherwise, the slot was already used - free obj and ERROR */
\r
7399 Jim_FreeNewObj(interp, value);
\r
7403 Jim_DecrRefCount(interp, emptyStr);
\r
7404 return resultList;
\r
7406 Jim_DecrRefCount(interp, emptyStr);
\r
7407 Jim_FreeNewObj(interp, resultList);
\r
7408 return (Jim_Obj*)EOF;
\r
7410 Jim_DecrRefCount(interp, emptyStr);
\r
7411 Jim_FreeNewObj(interp, resultList);
\r
7415 /* -----------------------------------------------------------------------------
\r
7416 * Pseudo Random Number Generation
\r
7417 * ---------------------------------------------------------------------------*/
\r
7418 static void JimPrngSeed(Jim_Interp *interp, const unsigned char *seed,
\r
7421 /* Initialize the sbox with the numbers from 0 to 255 */
\r
7422 static void JimPrngInit(Jim_Interp *interp)
\r
7425 unsigned int seed[256];
\r
7427 interp->prngState = Jim_Alloc(sizeof(Jim_PrngState));
\r
7428 for (i = 0; i < 256; i++)
\r
7429 seed[i] = (rand() ^ time(NULL) ^ clock());
\r
7430 JimPrngSeed(interp, (unsigned char*) seed, sizeof(int)*256);
\r
7433 /* Generates N bytes of random data */
\r
7434 static void JimRandomBytes(Jim_Interp *interp, void *dest, unsigned int len)
\r
7436 Jim_PrngState *prng;
\r
7437 unsigned char *destByte = (unsigned char*) dest;
\r
7438 unsigned int si, sj, x;
\r
7440 /* initialization, only needed the first time */
\r
7441 if (interp->prngState == NULL)
\r
7442 JimPrngInit(interp);
\r
7443 prng = interp->prngState;
\r
7444 /* generates 'len' bytes of pseudo-random numbers */
\r
7445 for (x = 0; x < len; x++) {
\r
7446 prng->i = (prng->i+1) & 0xff;
\r
7447 si = prng->sbox[prng->i];
\r
7448 prng->j = (prng->j + si) & 0xff;
\r
7449 sj = prng->sbox[prng->j];
\r
7450 prng->sbox[prng->i] = sj;
\r
7451 prng->sbox[prng->j] = si;
\r
7452 *destByte++ = prng->sbox[(si+sj)&0xff];
\r
7456 /* Re-seed the generator with user-provided bytes */
\r
7457 static void JimPrngSeed(Jim_Interp *interp, const unsigned char *seed,
\r
7461 unsigned char buf[256];
\r
7462 Jim_PrngState *prng;
\r
7464 /* initialization, only needed the first time */
\r
7465 if (interp->prngState == NULL)
\r
7466 JimPrngInit(interp);
\r
7467 prng = interp->prngState;
\r
7469 /* Set the sbox[i] with i */
\r
7470 for (i = 0; i < 256; i++)
\r
7471 prng->sbox[i] = i;
\r
7472 /* Now use the seed to perform a random permutation of the sbox */
\r
7473 for (i = 0; i < seedLen; i++) {
\r
7476 t = prng->sbox[i&0xFF];
\r
7477 prng->sbox[i&0xFF] = prng->sbox[seed[i]];
\r
7478 prng->sbox[seed[i]] = t;
\r
7480 prng->i = prng->j = 0;
\r
7481 /* discard the first 256 bytes of stream. */
\r
7482 JimRandomBytes(interp, buf, 256);
\r
7485 /* -----------------------------------------------------------------------------
\r
7486 * Dynamic libraries support (WIN32 not supported)
\r
7487 * ---------------------------------------------------------------------------*/
\r
7491 #define RTLD_LAZY 0
\r
7492 void * dlopen(const char *path, int mode)
\r
7494 JIM_NOTUSED(mode);
\r
7496 return (void *)LoadLibraryA(path);
\r
7498 int dlclose(void *handle)
\r
7500 FreeLibrary((HANDLE)handle);
\r
7503 void *dlsym(void *handle, const char *symbol)
\r
7505 return GetProcAddress((HMODULE)handle, symbol);
\r
7507 static char win32_dlerror_string[121];
\r
7508 const char *dlerror()
\r
7510 FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM, NULL, GetLastError(),
\r
7511 LANG_NEUTRAL, win32_dlerror_string, 120, NULL);
\r
7512 return win32_dlerror_string;
\r
7514 #endif /* WIN32 */
\r
7516 int Jim_LoadLibrary(Jim_Interp *interp, const char *pathName)
\r
7518 Jim_Obj *libPathObjPtr;
\r
7521 int (*onload)(Jim_Interp *interp);
\r
7523 libPathObjPtr = Jim_GetGlobalVariableStr(interp, "jim_libpath", JIM_NONE);
\r
7524 if (libPathObjPtr == NULL) {
\r
7526 libPathObjPtr = NULL;
\r
7528 Jim_IncrRefCount(libPathObjPtr);
\r
7529 Jim_ListLength(interp, libPathObjPtr, &prefixc);
\r
7532 for (i = -1; i < prefixc; i++) {
\r
7534 handle = dlopen(pathName, RTLD_LAZY);
\r
7537 char buf[JIM_PATH_LEN];
\r
7538 const char *prefix;
\r
7540 Jim_Obj *prefixObjPtr;
\r
7543 if (Jim_ListIndex(interp, libPathObjPtr, i,
\r
7544 &prefixObjPtr, JIM_NONE) != JIM_OK)
\r
7546 prefix = Jim_GetString(prefixObjPtr, NULL);
\r
7547 prefixlen = strlen(prefix);
\r
7548 if (prefixlen+strlen(pathName)+1 >= JIM_PATH_LEN)
\r
7550 if (prefixlen && prefix[prefixlen-1] == '/')
\r
7551 sprintf(buf, "%s%s", prefix, pathName);
\r
7553 sprintf(buf, "%s/%s", prefix, pathName);
\r
7554 printf("opening '%s'\n", buf);
\r
7555 fp = fopen(buf, "r");
\r
7559 handle = dlopen(buf, RTLD_LAZY);
\r
7560 printf("got handle %p\n", handle);
\r
7562 if (handle == NULL) {
\r
7563 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
7564 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
7565 "error loading extension \"", pathName,
\r
7566 "\": ", dlerror(), NULL);
\r
7571 if ((onload = dlsym(handle, "Jim_OnLoad")) == NULL) {
\r
7572 Jim_SetResultString(interp,
\r
7573 "No Jim_OnLoad symbol found on extension", -1);
\r
7576 if (onload(interp) == JIM_ERR) {
\r
7580 Jim_SetEmptyResult(interp);
\r
7581 if (libPathObjPtr != NULL)
\r
7582 Jim_DecrRefCount(interp, libPathObjPtr);
\r
7586 if (libPathObjPtr != NULL)
\r
7587 Jim_DecrRefCount(interp, libPathObjPtr);
\r
7590 #else /* JIM_DYNLIB */
\r
7591 int Jim_LoadLibrary(Jim_Interp *interp, const char *pathName)
\r
7593 JIM_NOTUSED(interp);
\r
7594 JIM_NOTUSED(pathName);
\r
7596 Jim_SetResultString(interp, "the Jim binary has no support for [load]", -1);
\r
7599 #endif/* JIM_DYNLIB */
\r
7601 /* -----------------------------------------------------------------------------
\r
7602 * Packages handling
\r
7603 * ---------------------------------------------------------------------------*/
\r
7605 #define JIM_PKG_ANY_VERSION -1
\r
7607 /* Convert a string of the type "1.2" into an integer.
\r
7608 * MAJOR.MINOR is converted as MAJOR*100+MINOR, so "1.2" is converted
\r
7609 * to the integer with value 102 */
\r
7610 static int JimPackageVersionToInt(Jim_Interp *interp, const char *v,
\r
7611 int *intPtr, int flags)
\r
7614 jim_wide major, minor;
\r
7615 char *majorStr, *minorStr, *p;
\r
7617 if (v[0] == '\0') {
\r
7618 *intPtr = JIM_PKG_ANY_VERSION;
\r
7622 copy = Jim_StrDup(v);
\r
7623 p = strchr(copy, '.');
\r
7624 if (p == NULL) goto badfmt;
\r
7629 if (Jim_StringToWide(majorStr, &major, 10) != JIM_OK ||
\r
7630 Jim_StringToWide(minorStr, &minor, 10) != JIM_OK)
\r
7632 *intPtr = (int)(major*100+minor);
\r
7638 if (flags & JIM_ERRMSG) {
\r
7639 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
7640 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
7641 "invalid package version '", v, "'", NULL);
\r
7646 #define JIM_MATCHVER_EXACT (1<<JIM_PRIV_FLAG_SHIFT)
\r
7647 static int JimPackageMatchVersion(int needed, int actual, int flags)
\r
7649 if (needed == JIM_PKG_ANY_VERSION) return 1;
\r
7650 if (flags & JIM_MATCHVER_EXACT) {
\r
7651 return needed == actual;
\r
7653 return needed/100 == actual/100 && (needed <= actual);
\r
7657 int Jim_PackageProvide(Jim_Interp *interp, const char *name, const char *ver,
\r
7661 /* Check if the version format is ok */
\r
7662 if (JimPackageVersionToInt(interp, ver, &intVersion, JIM_ERRMSG) != JIM_OK)
\r
7664 /* If the package was already provided returns an error. */
\r
7665 if (Jim_FindHashEntry(&interp->packages, name) != NULL) {
\r
7666 if (flags & JIM_ERRMSG) {
\r
7667 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
7668 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
7669 "package '", name, "' was already provided", NULL);
\r
7673 Jim_AddHashEntry(&interp->packages, name, (char*) ver);
\r
7680 # include <sys/types.h>
\r
7681 # include <dirent.h>
\r
7684 /* Posix dirent.h compatiblity layer for WIN32.
\r
7685 * Copyright Kevlin Henney, 1997, 2003. All rights reserved.
\r
7686 * Copyright Salvatore Sanfilippo ,2005.
\r
7688 * Permission to use, copy, modify, and distribute this software and its
\r
7689 * documentation for any purpose is hereby granted without fee, provided
\r
7690 * that this copyright and permissions notice appear in all copies and
\r
7693 * This software is supplied "as is" without express or implied warranty.
\r
7694 * This software was modified by Salvatore Sanfilippo for the Jim Interpreter.
\r
7701 typedef struct DIR {
\r
7702 long handle; /* -1 for failed rewind */
\r
7703 struct _finddata_t info;
\r
7704 struct dirent result; /* d_name null iff first time */
\r
7705 char *name; /* null-terminated char string */
\r
7708 DIR *opendir(const char *name)
\r
7712 if(name && name[0]) {
\r
7713 size_t base_length = strlen(name);
\r
7714 const char *all = /* search pattern must end with suitable wildcard */
\r
7715 strchr("/\\", name[base_length - 1]) ? "*" : "/*";
\r
7717 if((dir = (DIR *) Jim_Alloc(sizeof *dir)) != 0 &&
\r
7718 (dir->name = (char *) Jim_Alloc(base_length + strlen(all) + 1)) != 0)
\r
7720 strcat(strcpy(dir->name, name), all);
\r
7722 if((dir->handle = (long) _findfirst(dir->name, &dir->info)) != -1)
\r
7723 dir->result.d_name = 0;
\r
7724 else { /* rollback */
\r
7725 Jim_Free(dir->name);
\r
7729 } else { /* rollback */
\r
7740 int closedir(DIR *dir)
\r
7745 if(dir->handle != -1)
\r
7746 result = _findclose(dir->handle);
\r
7747 Jim_Free(dir->name);
\r
7750 if(result == -1) /* map all errors to EBADF */
\r
7755 struct dirent *readdir(DIR *dir)
\r
7757 struct dirent *result = 0;
\r
7759 if(dir && dir->handle != -1) {
\r
7760 if(!dir->result.d_name || _findnext(dir->handle, &dir->info) != -1) {
\r
7761 result = &dir->result;
\r
7762 result->d_name = dir->info.name;
\r
7770 #endif /* WIN32 */
\r
7772 static char *JimFindBestPackage(Jim_Interp *interp, char **prefixes,
\r
7773 int prefixc, const char *pkgName, int pkgVer, int flags)
\r
7775 int bestVer = -1, i;
\r
7776 int pkgNameLen = strlen(pkgName);
\r
7777 char *bestPackage = NULL;
\r
7778 struct dirent *de;
\r
7780 for (i = 0; i < prefixc; i++) {
\r
7782 char buf[JIM_PATH_LEN];
\r
7785 if (prefixes[i] == NULL) continue;
\r
7786 strncpy(buf, prefixes[i], JIM_PATH_LEN);
\r
7787 buf[JIM_PATH_LEN-1] = '\0';
\r
7788 prefixLen = strlen(buf);
\r
7789 if (prefixLen && buf[prefixLen-1] == '/')
\r
7790 buf[prefixLen-1] = '\0';
\r
7792 if ((dir = opendir(buf)) == NULL) continue;
\r
7793 while ((de = readdir(dir)) != NULL) {
\r
7794 char *fileName = de->d_name;
\r
7795 int fileNameLen = strlen(fileName);
\r
7797 if (strncmp(fileName, "jim-", 4) == 0 &&
\r
7798 strncmp(fileName+4, pkgName, pkgNameLen) == 0 &&
\r
7799 *(fileName+4+pkgNameLen) == '-' &&
\r
7800 fileNameLen > 4 && /* note that this is not really useful */
\r
7801 (strncmp(fileName+fileNameLen-4, ".tcl", 4) == 0 ||
\r
7802 strncmp(fileName+fileNameLen-4, ".dll", 4) == 0 ||
\r
7803 strncmp(fileName+fileNameLen-3, ".so", 3) == 0))
\r
7805 char ver[6]; /* xx.yy<nulterm> */
\r
7806 char *p = strrchr(fileName, '.');
\r
7807 int verLen, fileVer;
\r
7809 verLen = p - (fileName+4+pkgNameLen+1);
\r
7810 if (verLen < 3 || verLen > 5) continue;
\r
7811 memcpy(ver, fileName+4+pkgNameLen+1, verLen);
\r
7812 ver[verLen] = '\0';
\r
7813 if (JimPackageVersionToInt(interp, ver, &fileVer, JIM_NONE)
\r
7814 != JIM_OK) continue;
\r
7815 if (JimPackageMatchVersion(pkgVer, fileVer, flags) &&
\r
7816 (bestVer == -1 || bestVer < fileVer))
\r
7818 bestVer = fileVer;
\r
7819 Jim_Free(bestPackage);
\r
7820 bestPackage = Jim_Alloc(strlen(buf)+strlen(fileName)+2);
\r
7821 sprintf(bestPackage, "%s/%s", buf, fileName);
\r
7827 return bestPackage;
\r
7830 #else /* JIM_ANSIC */
\r
7832 static char *JimFindBestPackage(Jim_Interp *interp, char **prefixes,
\r
7833 int prefixc, const char *pkgName, int pkgVer, int flags)
\r
7835 JIM_NOTUSED(interp);
\r
7836 JIM_NOTUSED(prefixes);
\r
7837 JIM_NOTUSED(prefixc);
\r
7838 JIM_NOTUSED(pkgName);
\r
7839 JIM_NOTUSED(pkgVer);
\r
7840 JIM_NOTUSED(flags);
\r
7844 #endif /* JIM_ANSIC */
\r
7846 /* Search for a suitable package under every dir specified by jim_libpath
\r
7847 * and load it if possible. If a suitable package was loaded with success
\r
7848 * JIM_OK is returned, otherwise JIM_ERR is returned. */
\r
7849 static int JimLoadPackage(Jim_Interp *interp, const char *name, int ver,
\r
7852 Jim_Obj *libPathObjPtr;
\r
7853 char **prefixes, *best;
\r
7854 int prefixc, i, retCode = JIM_OK;
\r
7856 libPathObjPtr = Jim_GetGlobalVariableStr(interp, "jim_libpath", JIM_NONE);
\r
7857 if (libPathObjPtr == NULL) {
\r
7859 libPathObjPtr = NULL;
\r
7861 Jim_IncrRefCount(libPathObjPtr);
\r
7862 Jim_ListLength(interp, libPathObjPtr, &prefixc);
\r
7865 prefixes = Jim_Alloc(sizeof(char*)*prefixc);
\r
7866 for (i = 0; i < prefixc; i++) {
\r
7867 Jim_Obj *prefixObjPtr;
\r
7868 if (Jim_ListIndex(interp, libPathObjPtr, i,
\r
7869 &prefixObjPtr, JIM_NONE) != JIM_OK)
\r
7871 prefixes[i] = NULL;
\r
7874 prefixes[i] = Jim_StrDup(Jim_GetString(prefixObjPtr, NULL));
\r
7876 /* Scan every directory to find the "best" package. */
\r
7877 best = JimFindBestPackage(interp, prefixes, prefixc, name, ver, flags);
\r
7878 if (best != NULL) {
\r
7879 char *p = strrchr(best, '.');
\r
7880 /* Try to load/source it */
\r
7881 if (p && strcmp(p, ".tcl") == 0) {
\r
7882 retCode = Jim_EvalFile(interp, best);
\r
7884 retCode = Jim_LoadLibrary(interp, best);
\r
7887 retCode = JIM_ERR;
\r
7890 for (i = 0; i < prefixc; i++)
\r
7891 Jim_Free(prefixes[i]);
\r
7892 Jim_Free(prefixes);
\r
7893 if (libPathObjPtr)
\r
7894 Jim_DecrRefCount(interp, libPathObjPtr);
\r
7898 const char *Jim_PackageRequire(Jim_Interp *interp, const char *name,
\r
7899 const char *ver, int flags)
\r
7901 Jim_HashEntry *he;
\r
7904 if (JimPackageVersionToInt(interp, ver, &requiredVer, JIM_ERRMSG) != JIM_OK)
\r
7906 he = Jim_FindHashEntry(&interp->packages, name);
\r
7908 /* Try to load the package. */
\r
7909 if (JimLoadPackage(interp, name, requiredVer, flags) == JIM_OK) {
\r
7910 he = Jim_FindHashEntry(&interp->packages, name);
\r
7916 /* No way... return an error. */
\r
7917 if (flags & JIM_ERRMSG) {
\r
7918 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
7919 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
7920 "Can't find package '", name, "'", NULL);
\r
7925 if (JimPackageVersionToInt(interp, he->val, &actualVer, JIM_ERRMSG)
\r
7930 /* Check if version matches. */
\r
7931 if (JimPackageMatchVersion(requiredVer, actualVer, flags) == 0) {
\r
7932 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
7933 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
7934 "Package '", name, "' already loaded, but with version ",
\r
7942 /* -----------------------------------------------------------------------------
\r
7944 * ---------------------------------------------------------------------------*/
\r
7945 #define JIM_EVAL_SARGV_LEN 8 /* static arguments vector length */
\r
7946 #define JIM_EVAL_SINTV_LEN 8 /* static interpolation vector length */
\r
7948 static int JimCallProcedure(Jim_Interp *interp, Jim_Cmd *cmd, int argc,
\r
7949 Jim_Obj *const *argv);
\r
7951 /* Handle calls to the [unknown] command */
\r
7952 static int JimUnknown(Jim_Interp *interp, int argc, Jim_Obj *const *argv)
\r
7954 Jim_Obj **v, *sv[JIM_EVAL_SARGV_LEN];
\r
7957 /* If the [unknown] command does not exists returns
\r
7959 if (Jim_GetCommand(interp, interp->unknown, JIM_NONE) == NULL)
\r
7962 /* The object interp->unknown just contains
\r
7963 * the "unknown" string, it is used in order to
\r
7964 * avoid to lookup the unknown command every time
\r
7965 * but instread to cache the result. */
\r
7966 if (argc+1 <= JIM_EVAL_SARGV_LEN)
\r
7969 v = Jim_Alloc(sizeof(Jim_Obj*)*(argc+1));
\r
7970 /* Make a copy of the arguments vector, but shifted on
\r
7971 * the right of one position. The command name of the
\r
7972 * command will be instead the first argument of the
\r
7973 * [unknonw] call. */
\r
7974 memcpy(v+1, argv, sizeof(Jim_Obj*)*argc);
\r
7975 v[0] = interp->unknown;
\r
7977 retCode = Jim_EvalObjVector(interp, argc+1, v);
\r
7984 /* Eval the object vector 'objv' composed of 'objc' elements.
\r
7985 * Every element is used as single argument.
\r
7986 * Jim_EvalObj() will call this function every time its object
\r
7987 * argument is of "list" type, with no string representation.
\r
7989 * This is possible because the string representation of a
\r
7990 * list object generated by the UpdateStringOfList is made
\r
7991 * in a way that ensures that every list element is a different
\r
7992 * command argument. */
\r
7993 int Jim_EvalObjVector(Jim_Interp *interp, int objc, Jim_Obj *const *objv)
\r
7998 /* Incr refcount of arguments. */
\r
7999 for (i = 0; i < objc; i++)
\r
8000 Jim_IncrRefCount(objv[i]);
\r
8001 /* Command lookup */
\r
8002 cmdPtr = Jim_GetCommand(interp, objv[0], JIM_ERRMSG);
\r
8003 if (cmdPtr == NULL) {
\r
8004 retcode = JimUnknown(interp, objc, objv);
\r
8006 /* Call it -- Make sure result is an empty object. */
\r
8007 Jim_SetEmptyResult(interp);
\r
8008 if (cmdPtr->cmdProc) {
\r
8009 interp->cmdPrivData = cmdPtr->privData;
\r
8010 retcode = cmdPtr->cmdProc(interp, objc, objv);
\r
8012 retcode = JimCallProcedure(interp, cmdPtr, objc, objv);
\r
8013 if (retcode == JIM_ERR) {
\r
8014 JimAppendStackTrace(interp,
\r
8015 Jim_GetString(objv[0], NULL), "?", 1);
\r
8019 /* Decr refcount of arguments and return the retcode */
\r
8020 for (i = 0; i < objc; i++)
\r
8021 Jim_DecrRefCount(interp, objv[i]);
\r
8025 /* Interpolate the given tokens into a unique Jim_Obj returned by reference
\r
8026 * via *objPtrPtr. This function is only called by Jim_EvalObj().
\r
8027 * The returned object has refcount = 0. */
\r
8028 int Jim_InterpolateTokens(Jim_Interp *interp, ScriptToken *token,
\r
8029 int tokens, Jim_Obj **objPtrPtr)
\r
8031 int totlen = 0, i, retcode;
\r
8033 Jim_Obj *sintv[JIM_EVAL_SINTV_LEN];
\r
8037 if (tokens <= JIM_EVAL_SINTV_LEN)
\r
8040 intv = Jim_Alloc(sizeof(Jim_Obj*)*
\r
8042 /* Compute every token forming the argument
\r
8043 * in the intv objects vector. */
\r
8044 for (i = 0; i < tokens; i++) {
\r
8045 switch(token[i].type) {
\r
8048 intv[i] = token[i].objPtr;
\r
8051 intv[i] = Jim_GetVariable(interp, token[i].objPtr, JIM_ERRMSG);
\r
8053 retcode = JIM_ERR;
\r
8057 case JIM_TT_DICTSUGAR:
\r
8058 intv[i] = Jim_ExpandDictSugar(interp, token[i].objPtr);
\r
8060 retcode = JIM_ERR;
\r
8065 retcode = Jim_EvalObj(interp, token[i].objPtr);
\r
8066 if (retcode != JIM_OK)
\r
8068 intv[i] = Jim_GetResult(interp);
\r
8072 "default token type reached "
\r
8073 "in Jim_InterpolateTokens().");
\r
8076 Jim_IncrRefCount(intv[i]);
\r
8077 /* Make sure there is a valid
\r
8078 * string rep, and add the string
\r
8079 * length to the total legnth. */
\r
8080 Jim_GetString(intv[i], NULL);
\r
8081 totlen += intv[i]->length;
\r
8083 /* Concatenate every token in an unique
\r
8085 objPtr = Jim_NewStringObjNoAlloc(interp,
\r
8087 s = objPtr->bytes = Jim_Alloc(totlen+1);
\r
8088 objPtr->length = totlen;
\r
8089 for (i = 0; i < tokens; i++) {
\r
8090 memcpy(s, intv[i]->bytes, intv[i]->length);
\r
8091 s += intv[i]->length;
\r
8092 Jim_DecrRefCount(interp, intv[i]);
\r
8094 objPtr->bytes[totlen] = '\0';
\r
8095 /* Free the intv vector if not static. */
\r
8096 if (tokens > JIM_EVAL_SINTV_LEN)
\r
8098 *objPtrPtr = objPtr;
\r
8102 for (; i >= 0; i--)
\r
8103 Jim_DecrRefCount(interp, intv[i]);
\r
8104 if (tokens > JIM_EVAL_SINTV_LEN)
\r
8109 /* Helper of Jim_EvalObj() to perform argument expansion.
\r
8110 * Basically this function append an argument to 'argv'
\r
8111 * (and increments argc by reference accordingly), performing
\r
8112 * expansion of the list object if 'expand' is non-zero, or
\r
8113 * just adding objPtr to argv if 'expand' is zero. */
\r
8114 void Jim_ExpandArgument(Jim_Interp *interp, Jim_Obj ***argv,
\r
8115 int *argcPtr, int expand, Jim_Obj *objPtr)
\r
8118 (*argv) = Jim_Realloc(*argv, sizeof(Jim_Obj*)*((*argcPtr)+1));
\r
8119 /* refcount of objPtr not incremented because
\r
8120 * we are actually transfering a reference from
\r
8121 * the old 'argv' to the expanded one. */
\r
8122 (*argv)[*argcPtr] = objPtr;
\r
8127 Jim_ListLength(interp, objPtr, &len);
\r
8128 (*argv) = Jim_Realloc(*argv, sizeof(Jim_Obj*)*((*argcPtr)+len));
\r
8129 for (i = 0; i < len; i++) {
\r
8130 (*argv)[*argcPtr] = objPtr->internalRep.listValue.ele[i];
\r
8131 Jim_IncrRefCount(objPtr->internalRep.listValue.ele[i]);
\r
8134 /* The original object reference is no longer needed,
\r
8135 * after the expansion it is no longer present on
\r
8136 * the argument vector, but the single elements are
\r
8137 * in its place. */
\r
8138 Jim_DecrRefCount(interp, objPtr);
\r
8142 int Jim_EvalObj(Jim_Interp *interp, Jim_Obj *scriptObjPtr)
\r
8144 int i, j = 0, len;
\r
8145 ScriptObj *script;
\r
8146 ScriptToken *token;
\r
8147 int *cs; /* command structure array */
\r
8148 int retcode = JIM_OK;
\r
8149 Jim_Obj *sargv[JIM_EVAL_SARGV_LEN], **argv = NULL, *tmpObjPtr;
\r
8151 interp->errorFlag = 0;
\r
8153 /* If the object is of type "list" and there is no
\r
8154 * string representation for this object, we can call
\r
8155 * a specialized version of Jim_EvalObj() */
\r
8156 if (scriptObjPtr->typePtr == &listObjType &&
\r
8157 scriptObjPtr->internalRep.listValue.len &&
\r
8158 scriptObjPtr->bytes == NULL) {
\r
8159 Jim_IncrRefCount(scriptObjPtr);
\r
8160 retcode = Jim_EvalObjVector(interp,
\r
8161 scriptObjPtr->internalRep.listValue.len,
\r
8162 scriptObjPtr->internalRep.listValue.ele);
\r
8163 Jim_DecrRefCount(interp, scriptObjPtr);
\r
8167 Jim_IncrRefCount(scriptObjPtr); /* Make sure it's shared. */
\r
8168 script = Jim_GetScript(interp, scriptObjPtr);
\r
8169 /* Now we have to make sure the internal repr will not be
\r
8170 * freed on shimmering.
\r
8172 * Think for example to this:
\r
8174 * set x {llength $x; ... some more code ...}; eval $x
\r
8176 * In order to preserve the internal rep, we increment the
\r
8177 * inUse field of the script internal rep structure. */
\r
8180 token = script->token;
\r
8181 len = script->len;
\r
8182 cs = script->cmdStruct;
\r
8183 i = 0; /* 'i' is the current token index. */
\r
8185 /* Reset the interpreter result. This is useful to
\r
8186 * return the emtpy result in the case of empty program. */
\r
8187 Jim_SetEmptyResult(interp);
\r
8189 /* Execute every command sequentially, returns on
\r
8190 * error (i.e. if a command does not return JIM_OK) */
\r
8193 int argc = *cs++; /* Get the number of arguments */
\r
8196 /* Set the expand flag if needed. */
\r
8201 /* Allocate the arguments vector */
\r
8202 if (argc <= JIM_EVAL_SARGV_LEN)
\r
8205 argv = Jim_Alloc(sizeof(Jim_Obj*)*argc);
\r
8206 /* Populate the arguments objects. */
\r
8207 for (j = 0; j < argc; j++) {
\r
8208 int tokens = *cs++;
\r
8210 /* tokens is negative if expansion is needed.
\r
8211 * for this argument. */
\r
8213 tokens = (-tokens)-1;
\r
8216 if (tokens == 1) {
\r
8217 /* Fast path if the token does not
\r
8218 * need interpolation */
\r
8219 switch(token[i].type) {
\r
8222 argv[j] = token[i].objPtr;
\r
8225 tmpObjPtr = Jim_GetVariable(interp, token[i].objPtr,
\r
8228 retcode = JIM_ERR;
\r
8231 argv[j] = tmpObjPtr;
\r
8233 case JIM_TT_DICTSUGAR:
\r
8234 tmpObjPtr = Jim_ExpandDictSugar(interp, token[i].objPtr);
\r
8236 retcode = JIM_ERR;
\r
8239 argv[j] = tmpObjPtr;
\r
8242 retcode = Jim_EvalObj(interp, token[i].objPtr);
\r
8243 if (retcode != JIM_OK)
\r
8245 argv[j] = Jim_GetResult(interp);
\r
8249 "default token type reached "
\r
8250 "in Jim_EvalObj().");
\r
8253 Jim_IncrRefCount(argv[j]);
\r
8256 /* For interpolation we call an helper
\r
8257 * function doing the work for us. */
\r
8258 if ((retcode = Jim_InterpolateTokens(interp,
\r
8259 token+i, tokens, &tmpObjPtr)) != JIM_OK)
\r
8263 argv[j] = tmpObjPtr;
\r
8264 Jim_IncrRefCount(argv[j]);
\r
8268 /* Handle {expand} expansion */
\r
8270 int *ecs = cs - argc;
\r
8272 Jim_Obj **eargv = NULL;
\r
8274 for (j = 0; j < argc; j++) {
\r
8275 Jim_ExpandArgument( interp, &eargv, &eargc,
\r
8276 ecs[j] < 0, argv[j]);
\r
8278 if (argv != sargv)
\r
8284 /* Nothing to do with zero args. */
\r
8289 /* Lookup the command to call */
\r
8290 cmd = Jim_GetCommand(interp, argv[0], JIM_ERRMSG);
\r
8291 if (cmd != NULL) {
\r
8292 /* Call it -- Make sure result is an empty object. */
\r
8293 Jim_SetEmptyResult(interp);
\r
8294 if (cmd->cmdProc) {
\r
8295 interp->cmdPrivData = cmd->privData;
\r
8296 retcode = cmd->cmdProc(interp, argc, argv);
\r
8298 retcode = JimCallProcedure(interp, cmd, argc, argv);
\r
8299 if (retcode == JIM_ERR) {
\r
8300 JimAppendStackTrace(interp,
\r
8301 Jim_GetString(argv[0], NULL), script->fileName,
\r
8302 token[i-argc*2].linenr);
\r
8306 /* Call [unknown] */
\r
8307 retcode = JimUnknown(interp, argc, argv);
\r
8309 if (retcode != JIM_OK) {
\r
8310 i -= argc*2; /* point to the command name. */
\r
8313 /* Decrement the arguments count */
\r
8314 for (j = 0; j < argc; j++) {
\r
8315 Jim_DecrRefCount(interp, argv[j]);
\r
8318 if (argv != sargv) {
\r
8323 /* Note that we don't have to decrement inUse, because the
\r
8324 * following code transfers our use of the reference again to
\r
8325 * the script object. */
\r
8326 j = 0; /* on normal termination, the argv array is already
\r
8327 Jim_DecrRefCount-ed. */
\r
8329 /* Handle errors. */
\r
8330 if (retcode == JIM_ERR && !interp->errorFlag) {
\r
8331 interp->errorFlag = 1;
\r
8332 JimSetErrorFileName(interp, script->fileName);
\r
8333 JimSetErrorLineNumber(interp, token[i].linenr);
\r
8334 JimResetStackTrace(interp);
\r
8336 Jim_FreeIntRep(interp, scriptObjPtr);
\r
8337 scriptObjPtr->typePtr = &scriptObjType;
\r
8338 Jim_SetIntRepPtr(scriptObjPtr, script);
\r
8339 Jim_DecrRefCount(interp, scriptObjPtr);
\r
8340 for (i = 0; i < j; i++) {
\r
8341 Jim_DecrRefCount(interp, argv[i]);
\r
8343 if (argv != sargv)
\r
8348 /* Call a procedure implemented in Tcl.
\r
8349 * It's possible to speed-up a lot this function, currently
\r
8350 * the callframes are not cached, but allocated and
\r
8351 * destroied every time. What is expecially costly is
\r
8352 * to create/destroy the local vars hash table every time.
\r
8354 * This can be fixed just implementing callframes caching
\r
8355 * in JimCreateCallFrame() and JimFreeCallFrame(). */
\r
8356 int JimCallProcedure(Jim_Interp *interp, Jim_Cmd *cmd, int argc,
\r
8357 Jim_Obj *const *argv)
\r
8360 Jim_CallFrame *callFramePtr;
\r
8363 if (argc < cmd->arityMin || (cmd->arityMax != -1 &&
\r
8364 argc > cmd->arityMax)) {
\r
8365 Jim_Obj *objPtr = Jim_NewEmptyStringObj(interp);
\r
8366 Jim_AppendStrings(interp, objPtr,
\r
8367 "wrong # args: should be \"", Jim_GetString(argv[0], NULL),
\r
8368 (cmd->arityMin > 1) ? " " : "",
\r
8369 Jim_GetString(cmd->argListObjPtr, NULL), "\"", NULL);
\r
8370 Jim_SetResult(interp, objPtr);
\r
8373 /* Check if there are too nested calls */
\r
8374 if (interp->numLevels == interp->maxNestingDepth) {
\r
8375 Jim_SetResultString(interp,
\r
8376 "Too many nested calls. Infinite recursion?", -1);
\r
8379 /* Create a new callframe */
\r
8380 callFramePtr = JimCreateCallFrame(interp);
\r
8381 callFramePtr->parentCallFrame = interp->framePtr;
\r
8382 callFramePtr->argv = argv;
\r
8383 callFramePtr->argc = argc;
\r
8384 callFramePtr->procArgsObjPtr = cmd->argListObjPtr;
\r
8385 callFramePtr->procBodyObjPtr = cmd->bodyObjPtr;
\r
8386 callFramePtr->staticVars = cmd->staticVars;
\r
8387 Jim_IncrRefCount(cmd->argListObjPtr);
\r
8388 Jim_IncrRefCount(cmd->bodyObjPtr);
\r
8389 interp->framePtr = callFramePtr;
\r
8390 interp->numLevels ++;
\r
8391 /* Set arguments */
\r
8392 for (i = 0; i < cmd->arityMin-1; i++) {
\r
8395 Jim_ListIndex(interp, cmd->argListObjPtr, i, &objPtr, JIM_NONE);
\r
8396 Jim_SetVariable(interp, objPtr, argv[i+1]);
\r
8398 if (cmd->arityMax == -1) {
\r
8399 Jim_Obj *listObjPtr, *objPtr;
\r
8401 listObjPtr = Jim_NewListObj(interp, argv+cmd->arityMin,
\r
8402 argc-cmd->arityMin);
\r
8403 Jim_ListIndex(interp, cmd->argListObjPtr, i, &objPtr, JIM_NONE);
\r
8404 Jim_SetVariable(interp, objPtr, listObjPtr);
\r
8406 /* Eval the body */
\r
8407 retcode = Jim_EvalObj(interp, cmd->bodyObjPtr);
\r
8409 /* Destroy the callframe */
\r
8410 interp->numLevels --;
\r
8411 interp->framePtr = interp->framePtr->parentCallFrame;
\r
8412 if (callFramePtr->vars.size != JIM_HT_INITIAL_SIZE) {
\r
8413 JimFreeCallFrame(interp, callFramePtr, JIM_FCF_NONE);
\r
8415 JimFreeCallFrame(interp, callFramePtr, JIM_FCF_NOHT);
\r
8417 /* Handle the JIM_EVAL return code */
\r
8418 if (retcode == JIM_EVAL && interp->evalRetcodeLevel != interp->numLevels) {
\r
8419 int savedLevel = interp->evalRetcodeLevel;
\r
8421 interp->evalRetcodeLevel = interp->numLevels;
\r
8422 while (retcode == JIM_EVAL) {
\r
8423 Jim_Obj *resultScriptObjPtr = Jim_GetResult(interp);
\r
8424 Jim_IncrRefCount(resultScriptObjPtr);
\r
8425 retcode = Jim_EvalObj(interp, resultScriptObjPtr);
\r
8426 Jim_DecrRefCount(interp, resultScriptObjPtr);
\r
8428 interp->evalRetcodeLevel = savedLevel;
\r
8430 /* Handle the JIM_RETURN return code */
\r
8431 if (retcode == JIM_RETURN) {
\r
8432 retcode = interp->returnCode;
\r
8433 interp->returnCode = JIM_OK;
\r
8438 int Jim_Eval(Jim_Interp *interp, const char *script)
\r
8440 Jim_Obj *scriptObjPtr = Jim_NewStringObj(interp, script, -1);
\r
8443 Jim_IncrRefCount(scriptObjPtr);
\r
8444 retval = Jim_EvalObj(interp, scriptObjPtr);
\r
8445 Jim_DecrRefCount(interp, scriptObjPtr);
\r
8449 /* Execute script in the scope of the global level */
\r
8450 int Jim_EvalGlobal(Jim_Interp *interp, const char *script)
\r
8452 Jim_CallFrame *savedFramePtr;
\r
8455 savedFramePtr = interp->framePtr;
\r
8456 interp->framePtr = interp->topFramePtr;
\r
8457 retval = Jim_Eval(interp, script);
\r
8458 interp->framePtr = savedFramePtr;
\r
8462 int Jim_EvalObjBackground(Jim_Interp *interp, Jim_Obj *scriptObjPtr)
\r
8464 Jim_CallFrame *savedFramePtr;
\r
8467 savedFramePtr = interp->framePtr;
\r
8468 interp->framePtr = interp->topFramePtr;
\r
8469 retval = Jim_EvalObj(interp, scriptObjPtr);
\r
8470 interp->framePtr = savedFramePtr;
\r
8471 /* Try to report the error (if any) via the bgerror proc */
\r
8472 if (retval != JIM_OK) {
\r
8475 objv[0] = Jim_NewStringObj(interp, "bgerror", -1);
\r
8476 objv[1] = Jim_GetResult(interp);
\r
8477 Jim_IncrRefCount(objv[0]);
\r
8478 Jim_IncrRefCount(objv[1]);
\r
8479 if (Jim_EvalObjVector(interp, 2, objv) != JIM_OK) {
\r
8480 /* Report the error to stderr. */
\r
8481 fprintf(interp->stderr_, "Background error:" JIM_NL);
\r
8482 Jim_PrintErrorMessage(interp);
\r
8484 Jim_DecrRefCount(interp, objv[0]);
\r
8485 Jim_DecrRefCount(interp, objv[1]);
\r
8490 int Jim_EvalFile(Jim_Interp *interp, const char *filename)
\r
8494 int nread, totread, maxlen, buflen;
\r
8496 Jim_Obj *scriptObjPtr;
\r
8498 if ((fp = fopen(filename, "r")) == NULL) {
\r
8499 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
8500 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
8501 "Error loading script \"", filename, "\": ",
\r
8502 strerror(errno), NULL);
\r
8506 maxlen = totread = 0;
\r
8508 if (maxlen < totread+buflen+1) {
\r
8509 maxlen = totread+buflen+1;
\r
8510 prg = Jim_Realloc(prg, maxlen);
\r
8512 if ((nread = fread(prg+totread, 1, buflen, fp)) == 0) break;
\r
8515 prg[totread] = '\0';
\r
8518 scriptObjPtr = Jim_NewStringObjNoAlloc(interp, prg, totread);
\r
8519 JimSetSourceInfo(interp, scriptObjPtr, filename, 1);
\r
8520 Jim_IncrRefCount(scriptObjPtr);
\r
8521 retval = Jim_EvalObj(interp, scriptObjPtr);
\r
8522 Jim_DecrRefCount(interp, scriptObjPtr);
\r
8526 /* -----------------------------------------------------------------------------
\r
8528 * ---------------------------------------------------------------------------*/
\r
8529 static int JimParseSubstStr(struct JimParserCtx *pc)
\r
8531 pc->tstart = pc->p;
\r
8532 pc->tline = pc->linenr;
\r
8533 while (*pc->p && *pc->p != '$' && *pc->p != '[') {
\r
8534 pc->p++; pc->len--;
\r
8536 pc->tend = pc->p-1;
\r
8537 pc->tt = JIM_TT_ESC;
\r
8541 static int JimParseSubst(struct JimParserCtx *pc, int flags)
\r
8545 if (pc->len == 0) {
\r
8546 pc->tstart = pc->tend = pc->p;
\r
8547 pc->tline = pc->linenr;
\r
8548 pc->tt = JIM_TT_EOL;
\r
8554 retval = JimParseCmd(pc);
\r
8555 if (flags & JIM_SUBST_NOCMD) {
\r
8558 pc->tt = (flags & JIM_SUBST_NOESC) ?
\r
8559 JIM_TT_STR : JIM_TT_ESC;
\r
8564 if (JimParseVar(pc) == JIM_ERR) {
\r
8565 pc->tstart = pc->tend = pc->p++; pc->len--;
\r
8566 pc->tline = pc->linenr;
\r
8567 pc->tt = JIM_TT_STR;
\r
8569 if (flags & JIM_SUBST_NOVAR) {
\r
8571 if (flags & JIM_SUBST_NOESC)
\r
8572 pc->tt = JIM_TT_STR;
\r
8574 pc->tt = JIM_TT_ESC;
\r
8575 if (*pc->tstart == '{') {
\r
8577 if (*(pc->tend+1))
\r
8584 retval = JimParseSubstStr(pc);
\r
8585 if (flags & JIM_SUBST_NOESC)
\r
8586 pc->tt = JIM_TT_STR;
\r
8593 /* The subst object type reuses most of the data structures and functions
\r
8594 * of the script object. Script's data structures are a bit more complex
\r
8595 * for what is needed for [subst]itution tasks, but the reuse helps to
\r
8596 * deal with a single data structure at the cost of some more memory
\r
8597 * usage for substitutions. */
\r
8598 static Jim_ObjType substObjType = {
\r
8600 FreeScriptInternalRep,
\r
8601 DupScriptInternalRep,
\r
8603 JIM_TYPE_REFERENCES,
\r
8606 /* This method takes the string representation of an object
\r
8607 * as a Tcl string where to perform [subst]itution, and generates
\r
8608 * the pre-parsed internal representation. */
\r
8609 int SetSubstFromAny(Jim_Interp *interp, struct Jim_Obj *objPtr, int flags)
\r
8611 int scriptTextLen;
\r
8612 const char *scriptText = Jim_GetString(objPtr, &scriptTextLen);
\r
8613 struct JimParserCtx parser;
\r
8614 struct ScriptObj *script = Jim_Alloc(sizeof(*script));
\r
8617 script->csLen = 0;
\r
8618 script->commands = 0;
\r
8619 script->token = NULL;
\r
8620 script->cmdStruct = NULL;
\r
8621 script->inUse = 1;
\r
8622 script->substFlags = flags;
\r
8623 script->fileName = NULL;
\r
8625 JimParserInit(&parser, scriptText, scriptTextLen, 1);
\r
8628 int len, type, linenr;
\r
8630 JimParseSubst(&parser, flags);
\r
8631 if (JimParserEof(&parser)) break;
\r
8632 token = JimParserGetToken(&parser, &len, &type, &linenr);
\r
8633 ScriptObjAddToken(interp, script, token, len, type,
\r
8636 /* Free the old internal rep and set the new one. */
\r
8637 Jim_FreeIntRep(interp, objPtr);
\r
8638 Jim_SetIntRepPtr(objPtr, script);
\r
8639 objPtr->typePtr = &scriptObjType;
\r
8643 ScriptObj *Jim_GetSubst(Jim_Interp *interp, Jim_Obj *objPtr, int flags)
\r
8645 struct ScriptObj *script = Jim_GetIntRepPtr(objPtr);
\r
8647 if (objPtr->typePtr != &substObjType || script->substFlags != flags)
\r
8648 SetSubstFromAny(interp, objPtr, flags);
\r
8649 return (ScriptObj*) Jim_GetIntRepPtr(objPtr);
\r
8652 /* Performs commands,variables,blackslashes substitution,
\r
8653 * storing the result object (with refcount 0) into
\r
8654 * resObjPtrPtr. */
\r
8655 int Jim_SubstObj(Jim_Interp *interp, Jim_Obj *substObjPtr,
\r
8656 Jim_Obj **resObjPtrPtr, int flags)
\r
8658 ScriptObj *script;
\r
8659 ScriptToken *token;
\r
8660 int i, len, retcode = JIM_OK;
\r
8661 Jim_Obj *resObjPtr, *savedResultObjPtr;
\r
8663 script = Jim_GetSubst(interp, substObjPtr, flags);
\r
8664 #ifdef JIM_OPTIMIZATION
\r
8665 /* Fast path for a very common case with array-alike syntax,
\r
8666 * that's: $foo($bar) */
\r
8667 if (script->len == 1 && script->token[0].type == JIM_TT_VAR) {
\r
8668 Jim_Obj *varObjPtr = script->token[0].objPtr;
\r
8670 Jim_IncrRefCount(varObjPtr);
\r
8671 resObjPtr = Jim_GetVariable(interp, varObjPtr, JIM_ERRMSG);
\r
8672 if (resObjPtr == NULL) {
\r
8673 Jim_DecrRefCount(interp, varObjPtr);
\r
8676 Jim_DecrRefCount(interp, varObjPtr);
\r
8677 *resObjPtrPtr = resObjPtr;
\r
8682 Jim_IncrRefCount(substObjPtr); /* Make sure it's shared. */
\r
8683 /* In order to preserve the internal rep, we increment the
\r
8684 * inUse field of the script internal rep structure. */
\r
8687 token = script->token;
\r
8688 len = script->len;
\r
8690 /* Save the interp old result, to set it again before
\r
8692 savedResultObjPtr = interp->result;
\r
8693 Jim_IncrRefCount(savedResultObjPtr);
\r
8695 /* Perform the substitution. Starts with an empty object
\r
8696 * and adds every token (performing the appropriate
\r
8697 * var/command/escape substitution). */
\r
8698 resObjPtr = Jim_NewStringObj(interp, "", 0);
\r
8699 for (i = 0; i < len; i++) {
\r
8702 switch(token[i].type) {
\r
8705 Jim_AppendObj(interp, resObjPtr, token[i].objPtr);
\r
8708 objPtr = Jim_GetVariable(interp, token[i].objPtr, JIM_ERRMSG);
\r
8709 if (objPtr == NULL) goto err;
\r
8710 Jim_IncrRefCount(objPtr);
\r
8711 Jim_AppendObj(interp, resObjPtr, objPtr);
\r
8712 Jim_DecrRefCount(interp, objPtr);
\r
8715 if (Jim_EvalObj(interp, token[i].objPtr) != JIM_OK)
\r
8717 Jim_AppendObj(interp, resObjPtr, interp->result);
\r
8721 "default token type (%d) reached "
\r
8722 "in Jim_SubstObj().", token[i].type);
\r
8727 if (retcode == JIM_OK)
\r
8728 Jim_SetResult(interp, savedResultObjPtr);
\r
8729 Jim_DecrRefCount(interp, savedResultObjPtr);
\r
8730 /* Note that we don't have to decrement inUse, because the
\r
8731 * following code transfers our use of the reference again to
\r
8732 * the script object. */
\r
8733 Jim_FreeIntRep(interp, substObjPtr);
\r
8734 substObjPtr->typePtr = &scriptObjType;
\r
8735 Jim_SetIntRepPtr(substObjPtr, script);
\r
8736 Jim_DecrRefCount(interp, substObjPtr);
\r
8737 *resObjPtrPtr = resObjPtr;
\r
8740 Jim_FreeNewObj(interp, resObjPtr);
\r
8741 retcode = JIM_ERR;
\r
8745 /* -----------------------------------------------------------------------------
\r
8746 * API Input/Export functions
\r
8747 * ---------------------------------------------------------------------------*/
\r
8749 int Jim_GetApi(Jim_Interp *interp, const char *funcname, void *targetPtrPtr)
\r
8751 Jim_HashEntry *he;
\r
8753 he = Jim_FindHashEntry(&interp->stub, funcname);
\r
8756 memcpy(targetPtrPtr, &he->val, sizeof(void*));
\r
8760 int Jim_RegisterApi(Jim_Interp *interp, const char *funcname, void *funcptr)
\r
8762 return Jim_AddHashEntry(&interp->stub, funcname, funcptr);
\r
8765 #define JIM_REGISTER_API(name) \
\r
8766 Jim_RegisterApi(interp, "Jim_" #name, (void *)Jim_ ## name)
\r
8768 void JimRegisterCoreApi(Jim_Interp *interp)
\r
8770 interp->getApiFuncPtr = Jim_GetApi;
\r
8771 JIM_REGISTER_API(Alloc);
\r
8772 JIM_REGISTER_API(Free);
\r
8773 JIM_REGISTER_API(Eval);
\r
8774 JIM_REGISTER_API(EvalGlobal);
\r
8775 JIM_REGISTER_API(EvalFile);
\r
8776 JIM_REGISTER_API(EvalObj);
\r
8777 JIM_REGISTER_API(EvalObjBackground);
\r
8778 JIM_REGISTER_API(EvalObjVector);
\r
8779 JIM_REGISTER_API(InitHashTable);
\r
8780 JIM_REGISTER_API(ExpandHashTable);
\r
8781 JIM_REGISTER_API(AddHashEntry);
\r
8782 JIM_REGISTER_API(ReplaceHashEntry);
\r
8783 JIM_REGISTER_API(DeleteHashEntry);
\r
8784 JIM_REGISTER_API(FreeHashTable);
\r
8785 JIM_REGISTER_API(FindHashEntry);
\r
8786 JIM_REGISTER_API(ResizeHashTable);
\r
8787 JIM_REGISTER_API(GetHashTableIterator);
\r
8788 JIM_REGISTER_API(NextHashEntry);
\r
8789 JIM_REGISTER_API(NewObj);
\r
8790 JIM_REGISTER_API(FreeObj);
\r
8791 JIM_REGISTER_API(InvalidateStringRep);
\r
8792 JIM_REGISTER_API(InitStringRep);
\r
8793 JIM_REGISTER_API(DuplicateObj);
\r
8794 JIM_REGISTER_API(GetString);
\r
8795 JIM_REGISTER_API(Length);
\r
8796 JIM_REGISTER_API(InvalidateStringRep);
\r
8797 JIM_REGISTER_API(NewStringObj);
\r
8798 JIM_REGISTER_API(NewStringObjNoAlloc);
\r
8799 JIM_REGISTER_API(AppendString);
\r
8800 JIM_REGISTER_API(AppendObj);
\r
8801 JIM_REGISTER_API(AppendStrings);
\r
8802 JIM_REGISTER_API(StringEqObj);
\r
8803 JIM_REGISTER_API(StringMatchObj);
\r
8804 JIM_REGISTER_API(StringRangeObj);
\r
8805 JIM_REGISTER_API(FormatString);
\r
8806 JIM_REGISTER_API(CompareStringImmediate);
\r
8807 JIM_REGISTER_API(NewReference);
\r
8808 JIM_REGISTER_API(GetReference);
\r
8809 JIM_REGISTER_API(SetFinalizer);
\r
8810 JIM_REGISTER_API(GetFinalizer);
\r
8811 JIM_REGISTER_API(CreateInterp);
\r
8812 JIM_REGISTER_API(FreeInterp);
\r
8813 JIM_REGISTER_API(GetExitCode);
\r
8814 JIM_REGISTER_API(SetStdin);
\r
8815 JIM_REGISTER_API(SetStdout);
\r
8816 JIM_REGISTER_API(SetStderr);
\r
8817 JIM_REGISTER_API(CreateCommand);
\r
8818 JIM_REGISTER_API(CreateProcedure);
\r
8819 JIM_REGISTER_API(DeleteCommand);
\r
8820 JIM_REGISTER_API(RenameCommand);
\r
8821 JIM_REGISTER_API(GetCommand);
\r
8822 JIM_REGISTER_API(SetVariable);
\r
8823 JIM_REGISTER_API(SetVariableStr);
\r
8824 JIM_REGISTER_API(SetGlobalVariableStr);
\r
8825 JIM_REGISTER_API(SetVariableStrWithStr);
\r
8826 JIM_REGISTER_API(SetVariableLink);
\r
8827 JIM_REGISTER_API(GetVariable);
\r
8828 JIM_REGISTER_API(GetCallFrameByLevel);
\r
8829 JIM_REGISTER_API(Collect);
\r
8830 JIM_REGISTER_API(CollectIfNeeded);
\r
8831 JIM_REGISTER_API(GetIndex);
\r
8832 JIM_REGISTER_API(NewListObj);
\r
8833 JIM_REGISTER_API(ListAppendElement);
\r
8834 JIM_REGISTER_API(ListAppendList);
\r
8835 JIM_REGISTER_API(ListLength);
\r
8836 JIM_REGISTER_API(ListIndex);
\r
8837 JIM_REGISTER_API(SetListIndex);
\r
8838 JIM_REGISTER_API(ConcatObj);
\r
8839 JIM_REGISTER_API(NewDictObj);
\r
8840 JIM_REGISTER_API(DictKey);
\r
8841 JIM_REGISTER_API(DictKeysVector);
\r
8842 JIM_REGISTER_API(GetIndex);
\r
8843 JIM_REGISTER_API(GetReturnCode);
\r
8844 JIM_REGISTER_API(EvalExpression);
\r
8845 JIM_REGISTER_API(GetBoolFromExpr);
\r
8846 JIM_REGISTER_API(GetWide);
\r
8847 JIM_REGISTER_API(GetLong);
\r
8848 JIM_REGISTER_API(SetWide);
\r
8849 JIM_REGISTER_API(NewIntObj);
\r
8850 JIM_REGISTER_API(GetDouble);
\r
8851 JIM_REGISTER_API(SetDouble);
\r
8852 JIM_REGISTER_API(NewDoubleObj);
\r
8853 JIM_REGISTER_API(WrongNumArgs);
\r
8854 JIM_REGISTER_API(SetDictKeysVector);
\r
8855 JIM_REGISTER_API(SubstObj);
\r
8856 JIM_REGISTER_API(RegisterApi);
\r
8857 JIM_REGISTER_API(PrintErrorMessage);
\r
8858 JIM_REGISTER_API(InteractivePrompt);
\r
8859 JIM_REGISTER_API(RegisterCoreCommands);
\r
8860 JIM_REGISTER_API(GetSharedString);
\r
8861 JIM_REGISTER_API(ReleaseSharedString);
\r
8862 JIM_REGISTER_API(Panic);
\r
8863 JIM_REGISTER_API(StrDup);
\r
8864 JIM_REGISTER_API(UnsetVariable);
\r
8865 JIM_REGISTER_API(GetVariableStr);
\r
8866 JIM_REGISTER_API(GetGlobalVariable);
\r
8867 JIM_REGISTER_API(GetGlobalVariableStr);
\r
8868 JIM_REGISTER_API(GetAssocData);
\r
8869 JIM_REGISTER_API(SetAssocData);
\r
8870 JIM_REGISTER_API(DeleteAssocData);
\r
8871 JIM_REGISTER_API(GetEnum);
\r
8872 JIM_REGISTER_API(ScriptIsComplete);
\r
8873 JIM_REGISTER_API(PackageRequire);
\r
8874 JIM_REGISTER_API(PackageProvide);
\r
8875 JIM_REGISTER_API(InitStack);
\r
8876 JIM_REGISTER_API(FreeStack);
\r
8877 JIM_REGISTER_API(StackLen);
\r
8878 JIM_REGISTER_API(StackPush);
\r
8879 JIM_REGISTER_API(StackPop);
\r
8880 JIM_REGISTER_API(StackPeek);
\r
8881 JIM_REGISTER_API(FreeStackElements);
\r
8884 /* -----------------------------------------------------------------------------
\r
8885 * Core commands utility functions
\r
8886 * ---------------------------------------------------------------------------*/
\r
8887 void Jim_WrongNumArgs(Jim_Interp *interp, int argc, Jim_Obj *const *argv,
\r
8891 Jim_Obj *objPtr = Jim_NewEmptyStringObj(interp);
\r
8893 Jim_AppendString(interp, objPtr, "wrong # args: should be \"", -1);
\r
8894 for (i = 0; i < argc; i++) {
\r
8895 Jim_AppendObj(interp, objPtr, argv[i]);
\r
8896 if (!(i+1 == argc && msg[0] == '\0'))
\r
8897 Jim_AppendString(interp, objPtr, " ", 1);
\r
8899 Jim_AppendString(interp, objPtr, msg, -1);
\r
8900 Jim_AppendString(interp, objPtr, "\"", 1);
\r
8901 Jim_SetResult(interp, objPtr);
\r
8904 static Jim_Obj *JimCommandsList(Jim_Interp *interp, Jim_Obj *patternObjPtr)
\r
8906 Jim_HashTableIterator *htiter;
\r
8907 Jim_HashEntry *he;
\r
8908 Jim_Obj *listObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
8909 const char *pattern;
\r
8912 pattern = patternObjPtr ? Jim_GetString(patternObjPtr, &patternLen) : NULL;
\r
8913 htiter = Jim_GetHashTableIterator(&interp->commands);
\r
8914 while ((he = Jim_NextHashEntry(htiter)) != NULL) {
\r
8915 if (pattern && !JimStringMatch(pattern, patternLen, he->key,
\r
8916 strlen((const char*)he->key), 0))
\r
8918 Jim_ListAppendElement(interp, listObjPtr,
\r
8919 Jim_NewStringObj(interp, he->key, -1));
\r
8921 Jim_FreeHashTableIterator(htiter);
\r
8922 return listObjPtr;
\r
8925 #define JIM_VARLIST_GLOBALS 0
\r
8926 #define JIM_VARLIST_LOCALS 1
\r
8927 #define JIM_VARLIST_VARS 2
\r
8929 static Jim_Obj *JimVariablesList(Jim_Interp *interp, Jim_Obj *patternObjPtr,
\r
8932 Jim_HashTableIterator *htiter;
\r
8933 Jim_HashEntry *he;
\r
8934 Jim_Obj *listObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
8935 const char *pattern;
\r
8938 pattern = patternObjPtr ? Jim_GetString(patternObjPtr, &patternLen) : NULL;
\r
8939 if (mode == JIM_VARLIST_GLOBALS) {
\r
8940 htiter = Jim_GetHashTableIterator(&interp->topFramePtr->vars);
\r
8942 /* For [info locals], if we are at top level an emtpy list
\r
8943 * is returned. I don't agree, but we aim at compatibility (SS) */
\r
8944 if (mode == JIM_VARLIST_LOCALS &&
\r
8945 interp->framePtr == interp->topFramePtr)
\r
8946 return listObjPtr;
\r
8947 htiter = Jim_GetHashTableIterator(&interp->framePtr->vars);
\r
8949 while ((he = Jim_NextHashEntry(htiter)) != NULL) {
\r
8950 Jim_Var *varPtr = (Jim_Var*) he->val;
\r
8951 if (mode == JIM_VARLIST_LOCALS) {
\r
8952 if (varPtr->linkFramePtr != NULL)
\r
8955 if (pattern && !JimStringMatch(pattern, patternLen, he->key,
\r
8956 strlen((const char*)he->key), 0))
\r
8958 Jim_ListAppendElement(interp, listObjPtr,
\r
8959 Jim_NewStringObj(interp, he->key, -1));
\r
8961 Jim_FreeHashTableIterator(htiter);
\r
8962 return listObjPtr;
\r
8965 static int JimInfoLevel(Jim_Interp *interp, Jim_Obj *levelObjPtr,
\r
8966 Jim_Obj **objPtrPtr)
\r
8968 Jim_CallFrame *targetCallFrame;
\r
8970 if (JimGetCallFrameByInteger(interp, levelObjPtr, &targetCallFrame)
\r
8973 /* No proc call at toplevel callframe */
\r
8974 if (targetCallFrame == interp->topFramePtr) {
\r
8975 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
8976 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
8978 Jim_GetString(levelObjPtr, NULL), "\"", NULL);
\r
8981 *objPtrPtr = Jim_NewListObj(interp,
\r
8982 targetCallFrame->argv,
\r
8983 targetCallFrame->argc);
\r
8987 /* -----------------------------------------------------------------------------
\r
8989 * ---------------------------------------------------------------------------*/
\r
8991 /* fake [puts] -- not the real puts, just for debugging. */
\r
8992 static int Jim_PutsCoreCommand(Jim_Interp *interp, int argc,
\r
8993 Jim_Obj *const *argv)
\r
8996 int len, nonewline = 0;
\r
8998 if (argc != 2 && argc != 3) {
\r
8999 Jim_WrongNumArgs(interp, 1, argv, "-nonewline string");
\r
9003 if (!Jim_CompareStringImmediate(interp, argv[1], "-nonewline"))
\r
9005 Jim_SetResultString(interp, "The second argument must "
\r
9006 "be -nonewline", -1);
\r
9013 str = Jim_GetString(argv[1], &len);
\r
9014 fwrite(str, 1, len, interp->stdout_);
\r
9015 if (!nonewline) fprintf(interp->stdout_, JIM_NL);
\r
9019 /* Helper for [+] and [*] */
\r
9020 static int Jim_AddMulHelper(Jim_Interp *interp, int argc,
\r
9021 Jim_Obj *const *argv, int op)
\r
9023 jim_wide wideValue, res;
\r
9024 double doubleValue, doubleRes;
\r
9027 res = (op == JIM_EXPROP_ADD) ? 0 : 1;
\r
9029 for (i = 1; i < argc; i++) {
\r
9030 if (Jim_GetWide(interp, argv[i], &wideValue) != JIM_OK)
\r
9032 if (op == JIM_EXPROP_ADD)
\r
9037 Jim_SetResult(interp, Jim_NewIntObj(interp, res));
\r
9040 doubleRes = (double) res;
\r
9041 for (;i < argc; i++) {
\r
9042 if (Jim_GetDouble(interp, argv[i], &doubleValue) != JIM_OK)
\r
9044 if (op == JIM_EXPROP_ADD)
\r
9045 doubleRes += doubleValue;
\r
9047 doubleRes *= doubleValue;
\r
9049 Jim_SetResult(interp, Jim_NewDoubleObj(interp, doubleRes));
\r
9053 /* Helper for [-] and [/] */
\r
9054 static int Jim_SubDivHelper(Jim_Interp *interp, int argc,
\r
9055 Jim_Obj *const *argv, int op)
\r
9057 jim_wide wideValue, res = 0;
\r
9058 double doubleValue, doubleRes = 0;
\r
9062 Jim_WrongNumArgs(interp, 1, argv, "number ?number ... number?");
\r
9064 } else if (argc == 2) {
\r
9065 /* The arity = 2 case is different. For [- x] returns -x,
\r
9066 * while [/ x] returns 1/x. */
\r
9067 if (Jim_GetWide(interp, argv[1], &wideValue) != JIM_OK) {
\r
9068 if (Jim_GetDouble(interp, argv[1], &doubleValue) !=
\r
9073 if (op == JIM_EXPROP_SUB)
\r
9074 doubleRes = -doubleValue;
\r
9076 doubleRes = 1.0/doubleValue;
\r
9077 Jim_SetResult(interp, Jim_NewDoubleObj(interp,
\r
9082 if (op == JIM_EXPROP_SUB) {
\r
9084 Jim_SetResult(interp, Jim_NewIntObj(interp, res));
\r
9086 doubleRes = 1.0/wideValue;
\r
9087 Jim_SetResult(interp, Jim_NewDoubleObj(interp,
\r
9092 if (Jim_GetWide(interp, argv[1], &res) != JIM_OK) {
\r
9093 if (Jim_GetDouble(interp, argv[1], &doubleRes)
\r
9101 for (i = 2; i < argc; i++) {
\r
9102 if (Jim_GetWide(interp, argv[i], &wideValue) != JIM_OK) {
\r
9103 doubleRes = (double) res;
\r
9106 if (op == JIM_EXPROP_SUB)
\r
9111 Jim_SetResult(interp, Jim_NewIntObj(interp, res));
\r
9114 for (;i < argc; i++) {
\r
9115 if (Jim_GetDouble(interp, argv[i], &doubleValue) != JIM_OK)
\r
9117 if (op == JIM_EXPROP_SUB)
\r
9118 doubleRes -= doubleValue;
\r
9120 doubleRes /= doubleValue;
\r
9122 Jim_SetResult(interp, Jim_NewDoubleObj(interp, doubleRes));
\r
9128 static int Jim_AddCoreCommand(Jim_Interp *interp, int argc,
\r
9129 Jim_Obj *const *argv)
\r
9131 return Jim_AddMulHelper(interp, argc, argv, JIM_EXPROP_ADD);
\r
9135 static int Jim_MulCoreCommand(Jim_Interp *interp, int argc,
\r
9136 Jim_Obj *const *argv)
\r
9138 return Jim_AddMulHelper(interp, argc, argv, JIM_EXPROP_MUL);
\r
9142 static int Jim_SubCoreCommand(Jim_Interp *interp, int argc,
\r
9143 Jim_Obj *const *argv)
\r
9145 return Jim_SubDivHelper(interp, argc, argv, JIM_EXPROP_SUB);
\r
9149 static int Jim_DivCoreCommand(Jim_Interp *interp, int argc,
\r
9150 Jim_Obj *const *argv)
\r
9152 return Jim_SubDivHelper(interp, argc, argv, JIM_EXPROP_DIV);
\r
9156 static int Jim_SetCoreCommand(Jim_Interp *interp, int argc,
\r
9157 Jim_Obj *const *argv)
\r
9159 if (argc != 2 && argc != 3) {
\r
9160 Jim_WrongNumArgs(interp, 1, argv, "varName ?newValue?");
\r
9165 objPtr = Jim_GetVariable(interp, argv[1], JIM_ERRMSG);
\r
9168 Jim_SetResult(interp, objPtr);
\r
9171 /* argc == 3 case. */
\r
9172 if (Jim_SetVariable(interp, argv[1], argv[2]) != JIM_OK)
\r
9174 Jim_SetResult(interp, argv[2]);
\r
9179 static int Jim_UnsetCoreCommand(Jim_Interp *interp, int argc,
\r
9180 Jim_Obj *const *argv)
\r
9185 Jim_WrongNumArgs(interp, 1, argv, "varName ?varName ...?");
\r
9188 for (i = 1; i < argc; i++) {
\r
9189 if (Jim_UnsetVariable(interp, argv[i], JIM_ERRMSG) != JIM_OK)
\r
9196 static int Jim_IncrCoreCommand(Jim_Interp *interp, int argc,
\r
9197 Jim_Obj *const *argv)
\r
9199 jim_wide wideValue, increment = 1;
\r
9200 Jim_Obj *intObjPtr;
\r
9202 if (argc != 2 && argc != 3) {
\r
9203 Jim_WrongNumArgs(interp, 1, argv, "varName ?increment?");
\r
9207 if (Jim_GetWide(interp, argv[2], &increment) != JIM_OK)
\r
9210 intObjPtr = Jim_GetVariable(interp, argv[1], JIM_ERRMSG);
\r
9211 if (!intObjPtr) return JIM_ERR;
\r
9212 if (Jim_GetWide(interp, intObjPtr, &wideValue) != JIM_OK)
\r
9214 if (Jim_IsShared(intObjPtr)) {
\r
9215 intObjPtr = Jim_NewIntObj(interp, wideValue+increment);
\r
9216 if (Jim_SetVariable(interp, argv[1], intObjPtr) != JIM_OK) {
\r
9217 Jim_FreeNewObj(interp, intObjPtr);
\r
9221 Jim_SetWide(interp, intObjPtr, wideValue+increment);
\r
9222 /* The following step is required in order to invalidate the
\r
9223 * string repr of "FOO" if the var name is on the form of "FOO(IDX)" */
\r
9224 if (Jim_SetVariable(interp, argv[1], intObjPtr) != JIM_OK) {
\r
9228 Jim_SetResult(interp, intObjPtr);
\r
9233 static int Jim_WhileCoreCommand(Jim_Interp *interp, int argc,
\r
9234 Jim_Obj *const *argv)
\r
9237 Jim_WrongNumArgs(interp, 1, argv, "condition body");
\r
9240 /* Try to run a specialized version of while if the expression
\r
9241 * is in one of the following forms:
\r
9243 * $a < CONST, $a < $b
\r
9244 * $a <= CONST, $a <= $b
\r
9245 * $a > CONST, $a > $b
\r
9246 * $a >= CONST, $a >= $b
\r
9247 * $a != CONST, $a != $b
\r
9248 * $a == CONST, $a == $b
\r
9254 #ifdef JIM_OPTIMIZATION
\r
9256 ExprByteCode *expr;
\r
9257 Jim_Obj *varAObjPtr = NULL, *varBObjPtr = NULL, *objPtr;
\r
9258 int exprLen, retval;
\r
9260 /* STEP 1 -- Check if there are the conditions to run the specialized
\r
9261 * version of while */
\r
9263 if ((expr = Jim_GetExpression(interp, argv[1])) == NULL) goto noopt;
\r
9264 if (expr->len <= 0 || expr->len > 3) goto noopt;
\r
9265 switch(expr->len) {
\r
9267 if (expr->opcode[0] != JIM_EXPROP_VARIABLE &&
\r
9268 expr->opcode[0] != JIM_EXPROP_NUMBER)
\r
9272 if (expr->opcode[1] != JIM_EXPROP_NOT ||
\r
9273 expr->opcode[0] != JIM_EXPROP_VARIABLE)
\r
9277 if (expr->opcode[0] != JIM_EXPROP_VARIABLE ||
\r
9278 (expr->opcode[1] != JIM_EXPROP_NUMBER &&
\r
9279 expr->opcode[1] != JIM_EXPROP_VARIABLE))
\r
9281 switch(expr->opcode[2]) {
\r
9282 case JIM_EXPROP_LT:
\r
9283 case JIM_EXPROP_LTE:
\r
9284 case JIM_EXPROP_GT:
\r
9285 case JIM_EXPROP_GTE:
\r
9286 case JIM_EXPROP_NUMEQ:
\r
9287 case JIM_EXPROP_NUMNE:
\r
9288 /* nothing to do */
\r
9296 "Unexpected default reached in Jim_WhileCoreCommand()");
\r
9300 /* STEP 2 -- conditions meet. Initialization. Take different
\r
9301 * branches for different expression lengths. */
\r
9302 exprLen = expr->len;
\r
9304 if (exprLen == 1) {
\r
9305 jim_wide wideValue;
\r
9307 if (expr->opcode[0] == JIM_EXPROP_VARIABLE) {
\r
9308 varAObjPtr = expr->obj[0];
\r
9309 Jim_IncrRefCount(varAObjPtr);
\r
9311 if (Jim_GetWide(interp, expr->obj[0], &wideValue) != JIM_OK)
\r
9317 Jim_GetVariable(interp, varAObjPtr, JIM_NONE)) ||
\r
9318 Jim_GetWide(interp, objPtr, &wideValue) != JIM_OK)
\r
9320 Jim_DecrRefCount(interp, varAObjPtr);
\r
9324 if (!wideValue) break;
\r
9325 if ((retval = Jim_EvalObj(interp, argv[2])) != JIM_OK) {
\r
9329 Jim_DecrRefCount(interp, varAObjPtr);
\r
9332 case JIM_CONTINUE:
\r
9337 Jim_DecrRefCount(interp, varAObjPtr);
\r
9343 Jim_DecrRefCount(interp, varAObjPtr);
\r
9344 } else if (exprLen == 3) {
\r
9345 jim_wide wideValueA, wideValueB, cmpRes = 0;
\r
9346 int cmpType = expr->opcode[2];
\r
9348 varAObjPtr = expr->obj[0];
\r
9349 Jim_IncrRefCount(varAObjPtr);
\r
9350 if (expr->opcode[1] == JIM_EXPROP_VARIABLE) {
\r
9351 varBObjPtr = expr->obj[1];
\r
9352 Jim_IncrRefCount(varBObjPtr);
\r
9354 if (Jim_GetWide(interp, expr->obj[1], &wideValueB) != JIM_OK)
\r
9358 if (!(objPtr = Jim_GetVariable(interp, varAObjPtr, JIM_NONE)) ||
\r
9359 Jim_GetWide(interp, objPtr, &wideValueA) != JIM_OK)
\r
9361 Jim_DecrRefCount(interp, varAObjPtr);
\r
9363 Jim_DecrRefCount(interp, varBObjPtr);
\r
9368 Jim_GetVariable(interp, varBObjPtr, JIM_NONE)) ||
\r
9369 Jim_GetWide(interp, objPtr, &wideValueB) != JIM_OK)
\r
9371 Jim_DecrRefCount(interp, varAObjPtr);
\r
9373 Jim_DecrRefCount(interp, varBObjPtr);
\r
9378 case JIM_EXPROP_LT:
\r
9379 cmpRes = wideValueA < wideValueB; break;
\r
9380 case JIM_EXPROP_LTE:
\r
9381 cmpRes = wideValueA <= wideValueB; break;
\r
9382 case JIM_EXPROP_GT:
\r
9383 cmpRes = wideValueA > wideValueB; break;
\r
9384 case JIM_EXPROP_GTE:
\r
9385 cmpRes = wideValueA >= wideValueB; break;
\r
9386 case JIM_EXPROP_NUMEQ:
\r
9387 cmpRes = wideValueA == wideValueB; break;
\r
9388 case JIM_EXPROP_NUMNE:
\r
9389 cmpRes = wideValueA != wideValueB; break;
\r
9391 if (!cmpRes) break;
\r
9392 if ((retval = Jim_EvalObj(interp, argv[2])) != JIM_OK) {
\r
9395 Jim_DecrRefCount(interp, varAObjPtr);
\r
9397 Jim_DecrRefCount(interp, varBObjPtr);
\r
9400 case JIM_CONTINUE:
\r
9404 Jim_DecrRefCount(interp, varAObjPtr);
\r
9406 Jim_DecrRefCount(interp, varBObjPtr);
\r
9411 Jim_DecrRefCount(interp, varAObjPtr);
\r
9413 Jim_DecrRefCount(interp, varBObjPtr);
\r
9415 /* TODO: case for len == 2 */
\r
9418 Jim_SetEmptyResult(interp);
\r
9424 /* The general purpose implementation of while starts here */
\r
9426 int boolean, retval;
\r
9428 if ((retval = Jim_GetBoolFromExpr(interp, argv[1],
\r
9429 &boolean)) != JIM_OK)
\r
9431 if (!boolean) break;
\r
9432 if ((retval = Jim_EvalObj(interp, argv[2])) != JIM_OK) {
\r
9437 case JIM_CONTINUE:
\r
9446 Jim_SetEmptyResult(interp);
\r
9451 static int Jim_ForCoreCommand(Jim_Interp *interp, int argc,
\r
9452 Jim_Obj *const *argv)
\r
9457 Jim_WrongNumArgs(interp, 1, argv, "start test next body");
\r
9460 /* Check if the for is on the form:
\r
9461 * for {set i CONST} {$i < CONST} {incr i}
\r
9462 * for {set i CONST} {$i < $j} {incr i}
\r
9463 * for {set i CONST} {$i <= CONST} {incr i}
\r
9464 * for {set i CONST} {$i <= $j} {incr i}
\r
9465 * XXX: NOTE: if variable traces are implemented, this optimization
\r
9466 * need to be modified to check for the proc epoch at every variable
\r
9468 #ifdef JIM_OPTIMIZATION
\r
9470 ScriptObj *initScript, *incrScript;
\r
9471 ExprByteCode *expr;
\r
9472 jim_wide start, stop, currentVal;
\r
9473 unsigned jim_wide procEpoch = interp->procEpoch;
\r
9474 Jim_Obj *varNamePtr, *stopVarNamePtr = NULL, *objPtr;
\r
9476 struct Jim_Cmd *cmdPtr;
\r
9478 /* Do it only if there aren't shared arguments */
\r
9479 if (argv[1] == argv[2] || argv[2] == argv[3] || argv[1] == argv[3])
\r
9481 initScript = Jim_GetScript(interp, argv[1]);
\r
9482 expr = Jim_GetExpression(interp, argv[2]);
\r
9483 incrScript = Jim_GetScript(interp, argv[3]);
\r
9485 /* Ensure proper lengths to start */
\r
9486 if (initScript->len != 6) goto evalstart;
\r
9487 if (incrScript->len != 4) goto evalstart;
\r
9488 if (expr->len != 3) goto evalstart;
\r
9489 /* Ensure proper token types. */
\r
9490 if (initScript->token[2].type != JIM_TT_ESC ||
\r
9491 initScript->token[4].type != JIM_TT_ESC ||
\r
9492 incrScript->token[2].type != JIM_TT_ESC ||
\r
9493 expr->opcode[0] != JIM_EXPROP_VARIABLE ||
\r
9494 (expr->opcode[1] != JIM_EXPROP_NUMBER &&
\r
9495 expr->opcode[1] != JIM_EXPROP_VARIABLE) ||
\r
9496 (expr->opcode[2] != JIM_EXPROP_LT &&
\r
9497 expr->opcode[2] != JIM_EXPROP_LTE))
\r
9499 cmpType = expr->opcode[2];
\r
9500 /* Initialization command must be [set] */
\r
9501 cmdPtr = Jim_GetCommand(interp, initScript->token[0].objPtr, JIM_NONE);
\r
9502 if (cmdPtr == NULL || cmdPtr->cmdProc != Jim_SetCoreCommand)
\r
9504 /* Update command must be incr */
\r
9505 cmdPtr = Jim_GetCommand(interp, incrScript->token[0].objPtr, JIM_NONE);
\r
9506 if (cmdPtr == NULL || cmdPtr->cmdProc != Jim_IncrCoreCommand)
\r
9508 /* set, incr, expression must be about the same variable */
\r
9509 if (!Jim_StringEqObj(initScript->token[2].objPtr,
\r
9510 incrScript->token[2].objPtr, 0))
\r
9512 if (!Jim_StringEqObj(initScript->token[2].objPtr,
\r
9515 /* Check that the initialization and comparison are valid integers */
\r
9516 if (Jim_GetWide(interp, initScript->token[4].objPtr, &start) == JIM_ERR)
\r
9518 if (expr->opcode[1] == JIM_EXPROP_NUMBER &&
\r
9519 Jim_GetWide(interp, expr->obj[1], &stop) == JIM_ERR)
\r
9524 /* Initialization */
\r
9525 varNamePtr = expr->obj[0];
\r
9526 if (expr->opcode[1] == JIM_EXPROP_VARIABLE) {
\r
9527 stopVarNamePtr = expr->obj[1];
\r
9528 Jim_IncrRefCount(stopVarNamePtr);
\r
9530 Jim_IncrRefCount(varNamePtr);
\r
9532 /* --- OPTIMIZED FOR --- */
\r
9533 /* Start to loop */
\r
9534 objPtr = Jim_NewIntObj(interp, start);
\r
9535 if (Jim_SetVariable(interp, varNamePtr, objPtr) != JIM_OK) {
\r
9536 Jim_DecrRefCount(interp, varNamePtr);
\r
9537 if (stopVarNamePtr) Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9538 Jim_FreeNewObj(interp, objPtr);
\r
9542 /* === Check condition === */
\r
9543 /* Common code: */
\r
9544 objPtr = Jim_GetVariable(interp, varNamePtr, JIM_NONE);
\r
9545 if (objPtr == NULL ||
\r
9546 Jim_GetWide(interp, objPtr, ¤tVal) != JIM_OK)
\r
9548 Jim_DecrRefCount(interp, varNamePtr);
\r
9549 if (stopVarNamePtr) Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9552 /* Immediate or Variable? get the 'stop' value if the latter. */
\r
9553 if (stopVarNamePtr) {
\r
9554 objPtr = Jim_GetVariable(interp, stopVarNamePtr, JIM_NONE);
\r
9555 if (objPtr == NULL ||
\r
9556 Jim_GetWide(interp, objPtr, &stop) != JIM_OK)
\r
9558 Jim_DecrRefCount(interp, varNamePtr);
\r
9559 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9563 if (cmpType == JIM_EXPROP_LT) {
\r
9564 if (currentVal >= stop) break;
\r
9566 if (currentVal > stop) break;
\r
9569 if ((retval = Jim_EvalObj(interp, argv[4])) != JIM_OK) {
\r
9572 if (stopVarNamePtr)
\r
9573 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9574 Jim_DecrRefCount(interp, varNamePtr);
\r
9576 case JIM_CONTINUE:
\r
9577 /* nothing to do */
\r
9580 if (stopVarNamePtr)
\r
9581 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9582 Jim_DecrRefCount(interp, varNamePtr);
\r
9586 /* If there was a change in procedures/command continue
\r
9587 * with the usual [for] command implementation */
\r
9588 if (procEpoch != interp->procEpoch) {
\r
9589 if (stopVarNamePtr)
\r
9590 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9591 Jim_DecrRefCount(interp, varNamePtr);
\r
9595 objPtr = Jim_GetVariable(interp, varNamePtr, JIM_ERRMSG);
\r
9596 if (objPtr->refCount == 1 && objPtr->typePtr == &intObjType) {
\r
9597 objPtr->internalRep.wideValue ++;
\r
9598 Jim_InvalidateStringRep(objPtr);
\r
9600 Jim_Obj *auxObjPtr;
\r
9602 if (Jim_GetWide(interp, objPtr, ¤tVal) == JIM_ERR) {
\r
9603 if (stopVarNamePtr)
\r
9604 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9605 Jim_DecrRefCount(interp, varNamePtr);
\r
9608 auxObjPtr = Jim_NewIntObj(interp, currentVal+1);
\r
9609 if (Jim_SetVariable(interp, varNamePtr, auxObjPtr) == JIM_ERR) {
\r
9610 if (stopVarNamePtr)
\r
9611 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9612 Jim_DecrRefCount(interp, varNamePtr);
\r
9613 Jim_FreeNewObj(interp, auxObjPtr);
\r
9618 if (stopVarNamePtr)
\r
9619 Jim_DecrRefCount(interp, stopVarNamePtr);
\r
9620 Jim_DecrRefCount(interp, varNamePtr);
\r
9621 Jim_SetEmptyResult(interp);
\r
9627 if ((retval = Jim_EvalObj(interp, argv[1])) != JIM_OK)
\r
9632 /* Test the condition */
\r
9633 if ((retval = Jim_GetBoolFromExpr(interp, argv[2], &boolean))
\r
9636 if (!boolean) break;
\r
9638 if ((retval = Jim_EvalObj(interp, argv[4])) != JIM_OK) {
\r
9643 case JIM_CONTINUE:
\r
9644 /* Nothing to do */
\r
9652 if ((retval = Jim_EvalObj(interp, argv[3])) != JIM_OK) {
\r
9657 case JIM_CONTINUE:
\r
9666 Jim_SetEmptyResult(interp);
\r
9670 /* foreach + lmap implementation. */
\r
9671 static int JimForeachMapHelper(Jim_Interp *interp, int argc,
\r
9672 Jim_Obj *const *argv, int doMap)
\r
9674 int result = JIM_ERR, i, nbrOfLists, *listsIdx, *listsEnd;
\r
9675 int nbrOfLoops = 0;
\r
9676 Jim_Obj *emptyStr, *script, *mapRes = NULL;
\r
9678 if (argc < 4 || argc % 2 != 0) {
\r
9679 Jim_WrongNumArgs(interp, 1, argv, "varList list ?varList list ...? script");
\r
9683 mapRes = Jim_NewListObj(interp, NULL, 0);
\r
9684 Jim_IncrRefCount(mapRes);
\r
9686 emptyStr = Jim_NewEmptyStringObj(interp);
\r
9687 Jim_IncrRefCount(emptyStr);
\r
9688 script = argv[argc-1]; /* Last argument is a script */
\r
9689 nbrOfLists = (argc - 1 - 1) / 2; /* argc - 'foreach' - script */
\r
9690 listsIdx = (int*)Jim_Alloc(nbrOfLists * sizeof(int));
\r
9691 listsEnd = (int*)Jim_Alloc(nbrOfLists*2 * sizeof(int));
\r
9692 /* Initialize iterators and remember max nbr elements each list */
\r
9693 memset(listsIdx, 0, nbrOfLists * sizeof(int));
\r
9694 /* Remember lengths of all lists and calculate how much rounds to loop */
\r
9695 for (i=0; i < nbrOfLists*2; i += 2) {
\r
9698 Jim_ListLength(interp, argv[i+1], &listsEnd[i]);
\r
9699 Jim_ListLength(interp, argv[i+2], &listsEnd[i+1]);
\r
9700 if (listsEnd[i] == 0) {
\r
9701 Jim_SetResultString(interp, "foreach varlist is empty", -1);
\r
9704 cnt = div(listsEnd[i+1], listsEnd[i]);
\r
9705 count = cnt.quot + (cnt.rem ? 1 : 0);
\r
9706 if (count > nbrOfLoops)
\r
9707 nbrOfLoops = count;
\r
9709 for (; nbrOfLoops-- > 0; ) {
\r
9710 for (i=0; i < nbrOfLists; ++i) {
\r
9711 int varIdx = 0, var = i * 2;
\r
9712 while (varIdx < listsEnd[var]) {
\r
9713 Jim_Obj *varName, *ele;
\r
9714 int lst = i * 2 + 1;
\r
9715 if (Jim_ListIndex(interp, argv[var+1], varIdx, &varName, JIM_ERRMSG)
\r
9718 if (listsIdx[i] < listsEnd[lst]) {
\r
9719 if (Jim_ListIndex(interp, argv[lst+1], listsIdx[i], &ele, JIM_ERRMSG)
\r
9722 if (Jim_SetVariable(interp, varName, ele) != JIM_OK) {
\r
9723 Jim_SetResultString(interp, "couldn't set loop variable: ", -1);
\r
9726 ++listsIdx[i]; /* Remember next iterator of current list */
\r
9727 } else if (Jim_SetVariable(interp, varName, emptyStr) != JIM_OK) {
\r
9728 Jim_SetResultString(interp, "couldn't set loop variable: ", -1);
\r
9731 ++varIdx; /* Next variable */
\r
9734 switch (result = Jim_EvalObj(interp, script)) {
\r
9737 Jim_ListAppendElement(interp, mapRes, interp->result);
\r
9739 case JIM_CONTINUE:
\r
9751 Jim_SetResult(interp, mapRes);
\r
9753 Jim_SetEmptyResult(interp);
\r
9756 Jim_DecrRefCount(interp, mapRes);
\r
9757 Jim_DecrRefCount(interp, emptyStr);
\r
9758 Jim_Free(listsIdx);
\r
9759 Jim_Free(listsEnd);
\r
9764 static int Jim_ForeachCoreCommand(Jim_Interp *interp, int argc,
\r
9765 Jim_Obj *const *argv)
\r
9767 return JimForeachMapHelper(interp, argc, argv, 0);
\r
9771 static int Jim_LmapCoreCommand(Jim_Interp *interp, int argc,
\r
9772 Jim_Obj *const *argv)
\r
9774 return JimForeachMapHelper(interp, argc, argv, 1);
\r
9778 static int Jim_IfCoreCommand(Jim_Interp *interp, int argc,
\r
9779 Jim_Obj *const *argv)
\r
9781 int boolean, retval, current = 1, falsebody = 0;
\r
9784 /* Far not enough arguments given! */
\r
9785 if (current >= argc) goto err;
\r
9786 if ((retval = Jim_GetBoolFromExpr(interp,
\r
9787 argv[current++], &boolean))
\r
9790 /* There lacks something, isn't it? */
\r
9791 if (current >= argc) goto err;
\r
9792 if (Jim_CompareStringImmediate(interp, argv[current],
\r
9793 "then")) current++;
\r
9794 /* Tsk tsk, no then-clause? */
\r
9795 if (current >= argc) goto err;
\r
9797 return Jim_EvalObj(interp, argv[current]);
\r
9798 /* Ok: no else-clause follows */
\r
9799 if (++current >= argc) return JIM_OK;
\r
9800 falsebody = current++;
\r
9801 if (Jim_CompareStringImmediate(interp, argv[falsebody],
\r
9803 /* IIICKS - else-clause isn't last cmd? */
\r
9804 if (current != argc-1) goto err;
\r
9805 return Jim_EvalObj(interp, argv[current]);
\r
9806 } else if (Jim_CompareStringImmediate(interp,
\r
9807 argv[falsebody], "elseif"))
\r
9808 /* Ok: elseif follows meaning all the stuff
\r
9809 * again (how boring...) */
\r
9811 /* OOPS - else-clause is not last cmd?*/
\r
9812 else if (falsebody != argc-1)
\r
9814 return Jim_EvalObj(interp, argv[falsebody]);
\r
9819 Jim_WrongNumArgs(interp, 1, argv, "condition ?then? trueBody ?elseif ...? ?else? falseBody");
\r
9823 enum {SWITCH_EXACT, SWITCH_GLOB, SWITCH_RE, SWITCH_CMD, SWITCH_UNKNOWN};
\r
9826 static int Jim_SwitchCoreCommand(Jim_Interp *interp, int argc,
\r
9827 Jim_Obj *const *argv)
\r
9829 int retcode = JIM_ERR, matchOpt = SWITCH_EXACT, opt=1, patCount, i;
\r
9830 Jim_Obj *command = 0, *const *caseList = 0, *strObj;
\r
9831 Jim_Obj *script = 0;
\r
9832 if (argc < 3) goto wrongnumargs;
\r
9833 for (opt=1; opt < argc; ++opt) {
\r
9834 const char *option = Jim_GetString(argv[opt], 0);
\r
9835 if (*option != '-') break;
\r
9836 else if (strncmp(option, "--", 2) == 0) { ++opt; break; }
\r
9837 else if (strncmp(option, "-exact", 2) == 0) matchOpt = SWITCH_EXACT;
\r
9838 else if (strncmp(option, "-glob", 2) == 0) matchOpt = SWITCH_GLOB;
\r
9839 else if (strncmp(option, "-regexp", 2) == 0) matchOpt = SWITCH_RE;
\r
9840 else if (strncmp(option, "-command", 2) == 0) { matchOpt = SWITCH_CMD;
\r
9841 if ((argc - opt) < 2) goto wrongnumargs;
\r
9842 command = argv[++opt];
\r
9844 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
9845 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
9846 "bad option \"", option, "\": must be -exact, -glob, "
\r
9847 "-regexp, -command procname or --", 0);
\r
9850 if ((argc - opt) < 2) goto wrongnumargs;
\r
9852 strObj = argv[opt++];
\r
9853 patCount = argc - opt;
\r
9854 if (patCount == 1) {
\r
9856 JimListGetElements(interp, argv[opt], &patCount, &vector);
\r
9857 caseList = vector;
\r
9859 caseList = &argv[opt];
\r
9860 if (patCount == 0 || patCount % 2 != 0) goto wrongnumargs;
\r
9861 for (i=0; script == 0 && i < patCount; i += 2) {
\r
9862 Jim_Obj *patObj = caseList[i];
\r
9863 if (!Jim_CompareStringImmediate(interp, patObj, "default")
\r
9864 || i < (patCount-2)) {
\r
9865 switch (matchOpt) {
\r
9866 case SWITCH_EXACT:
\r
9867 if (Jim_StringEqObj(strObj, patObj, 0))
\r
9868 script = caseList[i+1];
\r
9871 if (Jim_StringMatchObj(patObj, strObj, 0))
\r
9872 script = caseList[i+1];
\r
9875 command = Jim_NewStringObj(interp, "regexp", -1);
\r
9876 /* Fall thru intentionally */
\r
9877 case SWITCH_CMD: {
\r
9878 Jim_Obj *parms[] = {command, patObj, strObj};
\r
9879 int rc = Jim_EvalObjVector(interp, 3, parms);
\r
9881 /* After the execution of a command we need to
\r
9882 * make sure to reconvert the object into a list
\r
9883 * again. Only for the single-list style [switch]. */
\r
9884 if (argc-opt == 1) {
\r
9886 JimListGetElements(interp, argv[opt], &patCount,
\r
9888 caseList = vector;
\r
9890 /* command is here already decref'd */
\r
9891 if (rc != JIM_OK) {
\r
9895 rc = Jim_GetLong(interp, Jim_GetResult(interp), &matching);
\r
9896 if (rc != JIM_OK) {
\r
9901 script = caseList[i+1];
\r
9905 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
9906 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
9907 "internal error: no such option implemented", 0);
\r
9911 script = caseList[i+1];
\r
9914 for(; i < patCount && Jim_CompareStringImmediate(interp, script, "-");
\r
9916 script = caseList[i+1];
\r
9917 if (script && Jim_CompareStringImmediate(interp, script, "-")) {
\r
9918 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
9919 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
9920 "no body specified for pattern \"",
\r
9921 Jim_GetString(caseList[i-2], 0), "\"", 0);
\r
9925 Jim_SetEmptyResult(interp);
\r
9927 retcode = Jim_EvalObj(interp, script);
\r
9930 Jim_WrongNumArgs(interp, 1, argv, "?options? string "
\r
9931 "pattern body ... ?default body? or "
\r
9932 "{pattern body ?pattern body ...?}");
\r
9938 static int Jim_ListCoreCommand(Jim_Interp *interp, int argc,
\r
9939 Jim_Obj *const *argv)
\r
9941 Jim_Obj *listObjPtr;
\r
9943 listObjPtr = Jim_NewListObj(interp, argv+1, argc-1);
\r
9944 Jim_SetResult(interp, listObjPtr);
\r
9949 static int Jim_LindexCoreCommand(Jim_Interp *interp, int argc,
\r
9950 Jim_Obj *const *argv)
\r
9952 Jim_Obj *objPtr, *listObjPtr;
\r
9957 Jim_WrongNumArgs(interp, 1, argv, "list index ?...?");
\r
9961 Jim_IncrRefCount(objPtr);
\r
9962 for (i = 2; i < argc; i++) {
\r
9963 listObjPtr = objPtr;
\r
9964 if (Jim_GetIndex(interp, argv[i], &index) != JIM_OK) {
\r
9965 Jim_DecrRefCount(interp, listObjPtr);
\r
9968 if (Jim_ListIndex(interp, listObjPtr, index, &objPtr,
\r
9969 JIM_NONE) != JIM_OK) {
\r
9970 /* Returns an empty object if the index
\r
9971 * is out of range. */
\r
9972 Jim_DecrRefCount(interp, listObjPtr);
\r
9973 Jim_SetEmptyResult(interp);
\r
9976 Jim_IncrRefCount(objPtr);
\r
9977 Jim_DecrRefCount(interp, listObjPtr);
\r
9979 Jim_SetResult(interp, objPtr);
\r
9980 Jim_DecrRefCount(interp, objPtr);
\r
9985 static int Jim_LlengthCoreCommand(Jim_Interp *interp, int argc,
\r
9986 Jim_Obj *const *argv)
\r
9991 Jim_WrongNumArgs(interp, 1, argv, "list");
\r
9994 Jim_ListLength(interp, argv[1], &len);
\r
9995 Jim_SetResult(interp, Jim_NewIntObj(interp, len));
\r
10000 static int Jim_LappendCoreCommand(Jim_Interp *interp, int argc,
\r
10001 Jim_Obj *const *argv)
\r
10003 Jim_Obj *listObjPtr;
\r
10007 Jim_WrongNumArgs(interp, 1, argv, "varName ?value value ...?");
\r
10010 listObjPtr = Jim_GetVariable(interp, argv[1], JIM_NONE);
\r
10011 if (!listObjPtr) {
\r
10012 /* Create the list if it does not exists */
\r
10013 listObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
10014 if (Jim_SetVariable(interp, argv[1], listObjPtr) != JIM_OK) {
\r
10015 Jim_FreeNewObj(interp, listObjPtr);
\r
10019 shared = Jim_IsShared(listObjPtr);
\r
10021 listObjPtr = Jim_DuplicateObj(interp, listObjPtr);
\r
10022 for (i = 2; i < argc; i++)
\r
10023 Jim_ListAppendElement(interp, listObjPtr, argv[i]);
\r
10024 if (Jim_SetVariable(interp, argv[1], listObjPtr) != JIM_OK) {
\r
10026 Jim_FreeNewObj(interp, listObjPtr);
\r
10029 Jim_SetResult(interp, listObjPtr);
\r
10034 static int Jim_LinsertCoreCommand(Jim_Interp *interp, int argc,
\r
10035 Jim_Obj *const *argv)
\r
10038 Jim_Obj *listPtr;
\r
10041 Jim_WrongNumArgs(interp, 1, argv, "list index element "
\r
10042 "?element ...?");
\r
10045 listPtr = argv[1];
\r
10046 if (Jim_IsShared(listPtr))
\r
10047 listPtr = Jim_DuplicateObj(interp, listPtr);
\r
10048 if (Jim_GetIndex(interp, argv[2], &index) != JIM_OK)
\r
10050 Jim_ListLength(interp, listPtr, &len);
\r
10051 if (index >= len)
\r
10053 else if (index < 0)
\r
10054 index = len + index + 1;
\r
10055 Jim_ListInsertElements(interp, listPtr, index, argc-3, &argv[3]);
\r
10056 Jim_SetResult(interp, listPtr);
\r
10059 if (listPtr != argv[1]) {
\r
10060 Jim_FreeNewObj(interp, listPtr);
\r
10066 static int Jim_LsetCoreCommand(Jim_Interp *interp, int argc,
\r
10067 Jim_Obj *const *argv)
\r
10070 Jim_WrongNumArgs(interp, 1, argv, "listVar ?index...? newVal");
\r
10072 } else if (argc == 3) {
\r
10073 if (Jim_SetVariable(interp, argv[1], argv[2]) != JIM_OK)
\r
10075 Jim_SetResult(interp, argv[2]);
\r
10078 if (Jim_SetListIndex(interp, argv[1], argv+2, argc-3, argv[argc-1])
\r
10079 == JIM_ERR) return JIM_ERR;
\r
10084 static int Jim_LsortCoreCommand(Jim_Interp *interp, int argc, Jim_Obj *const argv[])
\r
10086 const char *options[] = {
\r
10087 "-ascii", "-nocase", "-increasing", "-decreasing", NULL
\r
10089 enum {OPT_ASCII, OPT_NOCASE, OPT_INCREASING, OPT_DECREASING};
\r
10091 int i, lsortType = JIM_LSORT_ASCII; /* default sort type */
\r
10092 int decreasing = 0;
\r
10095 Jim_WrongNumArgs(interp, 1, argv, "?options? list");
\r
10098 for (i = 1; i < (argc-1); i++) {
\r
10101 if (Jim_GetEnum(interp, argv[i], options, &option, "option", JIM_ERRMSG)
\r
10105 case OPT_ASCII: lsortType = JIM_LSORT_ASCII; break;
\r
10106 case OPT_NOCASE: lsortType = JIM_LSORT_NOCASE; break;
\r
10107 case OPT_INCREASING: decreasing = 0; break;
\r
10108 case OPT_DECREASING: decreasing = 1; break;
\r
10111 if (decreasing) {
\r
10112 switch(lsortType) {
\r
10113 case JIM_LSORT_ASCII: lsortType = JIM_LSORT_ASCII_DECR; break;
\r
10114 case JIM_LSORT_NOCASE: lsortType = JIM_LSORT_NOCASE_DECR; break;
\r
10117 resObj = Jim_DuplicateObj(interp, argv[argc-1]);
\r
10118 ListSortElements(interp, resObj, lsortType);
\r
10119 Jim_SetResult(interp, resObj);
\r
10124 static int Jim_AppendCoreCommand(Jim_Interp *interp, int argc,
\r
10125 Jim_Obj *const *argv)
\r
10127 Jim_Obj *stringObjPtr;
\r
10131 Jim_WrongNumArgs(interp, 1, argv, "varName ?value value ...?");
\r
10135 stringObjPtr = Jim_GetVariable(interp, argv[1], JIM_ERRMSG);
\r
10136 if (!stringObjPtr) return JIM_ERR;
\r
10138 stringObjPtr = Jim_GetVariable(interp, argv[1], JIM_NONE);
\r
10139 if (!stringObjPtr) {
\r
10140 /* Create the string if it does not exists */
\r
10141 stringObjPtr = Jim_NewEmptyStringObj(interp);
\r
10142 if (Jim_SetVariable(interp, argv[1], stringObjPtr)
\r
10144 Jim_FreeNewObj(interp, stringObjPtr);
\r
10149 shared = Jim_IsShared(stringObjPtr);
\r
10151 stringObjPtr = Jim_DuplicateObj(interp, stringObjPtr);
\r
10152 for (i = 2; i < argc; i++)
\r
10153 Jim_AppendObj(interp, stringObjPtr, argv[i]);
\r
10154 if (Jim_SetVariable(interp, argv[1], stringObjPtr) != JIM_OK) {
\r
10156 Jim_FreeNewObj(interp, stringObjPtr);
\r
10159 Jim_SetResult(interp, stringObjPtr);
\r
10164 static int Jim_DebugCoreCommand(Jim_Interp *interp, int argc,
\r
10165 Jim_Obj *const *argv)
\r
10167 const char *options[] = {
\r
10168 "refcount", "objcount", "objects", "invstr", "scriptlen", "exprlen",
\r
10173 OPT_REFCOUNT, OPT_OBJCOUNT, OPT_OBJECTS, OPT_INVSTR, OPT_SCRIPTLEN,
\r
10174 OPT_EXPRLEN, OPT_EXPRBC
\r
10179 Jim_WrongNumArgs(interp, 1, argv, "option ?...?");
\r
10182 if (Jim_GetEnum(interp, argv[1], options, &option, "option",
\r
10183 JIM_ERRMSG) != JIM_OK)
\r
10185 if (option == OPT_REFCOUNT) {
\r
10187 Jim_WrongNumArgs(interp, 2, argv, "object");
\r
10190 Jim_SetResult(interp, Jim_NewIntObj(interp, argv[2]->refCount));
\r
10192 } else if (option == OPT_OBJCOUNT) {
\r
10193 int freeobj = 0, liveobj = 0;
\r
10198 Jim_WrongNumArgs(interp, 2, argv, "");
\r
10201 /* Count the number of free objects. */
\r
10202 objPtr = interp->freeList;
\r
10205 objPtr = objPtr->nextObjPtr;
\r
10207 /* Count the number of live objects. */
\r
10208 objPtr = interp->liveList;
\r
10211 objPtr = objPtr->nextObjPtr;
\r
10213 /* Set the result string and return. */
\r
10214 sprintf(buf, "free %d used %d", freeobj, liveobj);
\r
10215 Jim_SetResultString(interp, buf, -1);
\r
10217 } else if (option == OPT_OBJECTS) {
\r
10218 Jim_Obj *objPtr, *listObjPtr, *subListObjPtr;
\r
10219 /* Count the number of live objects. */
\r
10220 objPtr = interp->liveList;
\r
10221 listObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
10224 const char *type = objPtr->typePtr ?
\r
10225 objPtr->typePtr->name : "";
\r
10226 subListObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
10227 sprintf(buf, "%p", objPtr);
\r
10228 Jim_ListAppendElement(interp, subListObjPtr,
\r
10229 Jim_NewStringObj(interp, buf, -1));
\r
10230 Jim_ListAppendElement(interp, subListObjPtr,
\r
10231 Jim_NewStringObj(interp, type, -1));
\r
10232 Jim_ListAppendElement(interp, subListObjPtr,
\r
10233 Jim_NewIntObj(interp, objPtr->refCount));
\r
10234 Jim_ListAppendElement(interp, subListObjPtr, objPtr);
\r
10235 Jim_ListAppendElement(interp, listObjPtr, subListObjPtr);
\r
10236 objPtr = objPtr->nextObjPtr;
\r
10238 Jim_SetResult(interp, listObjPtr);
\r
10240 } else if (option == OPT_INVSTR) {
\r
10244 Jim_WrongNumArgs(interp, 2, argv, "object");
\r
10247 objPtr = argv[2];
\r
10248 if (objPtr->typePtr != NULL)
\r
10249 Jim_InvalidateStringRep(objPtr);
\r
10250 Jim_SetEmptyResult(interp);
\r
10252 } else if (option == OPT_SCRIPTLEN) {
\r
10253 ScriptObj *script;
\r
10255 Jim_WrongNumArgs(interp, 2, argv, "script");
\r
10258 script = Jim_GetScript(interp, argv[2]);
\r
10259 Jim_SetResult(interp, Jim_NewIntObj(interp, script->len));
\r
10261 } else if (option == OPT_EXPRLEN) {
\r
10262 ExprByteCode *expr;
\r
10264 Jim_WrongNumArgs(interp, 2, argv, "expression");
\r
10267 expr = Jim_GetExpression(interp, argv[2]);
\r
10268 if (expr == NULL)
\r
10270 Jim_SetResult(interp, Jim_NewIntObj(interp, expr->len));
\r
10272 } else if (option == OPT_EXPRBC) {
\r
10274 ExprByteCode *expr;
\r
10278 Jim_WrongNumArgs(interp, 2, argv, "expression");
\r
10281 expr = Jim_GetExpression(interp, argv[2]);
\r
10282 if (expr == NULL)
\r
10284 objPtr = Jim_NewListObj(interp, NULL, 0);
\r
10285 for (i = 0; i < expr->len; i++) {
\r
10286 const char *type;
\r
10287 Jim_ExprOperator *op;
\r
10289 switch(expr->opcode[i]) {
\r
10290 case JIM_EXPROP_NUMBER: type = "number"; break;
\r
10291 case JIM_EXPROP_COMMAND: type = "command"; break;
\r
10292 case JIM_EXPROP_VARIABLE: type = "variable"; break;
\r
10293 case JIM_EXPROP_DICTSUGAR: type = "dictsugar"; break;
\r
10294 case JIM_EXPROP_SUBST: type = "subst"; break;
\r
10295 case JIM_EXPROP_STRING: type = "string"; break;
\r
10297 op = JimExprOperatorInfo(Jim_GetString(expr->obj[i], NULL));
\r
10298 if (op == NULL) {
\r
10299 type = "private";
\r
10301 type = "operator";
\r
10305 Jim_ListAppendElement(interp, objPtr,
\r
10306 Jim_NewStringObj(interp, type, -1));
\r
10307 Jim_ListAppendElement(interp, objPtr, expr->obj[i]);
\r
10309 Jim_SetResult(interp, objPtr);
\r
10312 Jim_SetResultString(interp,
\r
10313 "bad option. Valid options are refcount, "
\r
10314 "objcount, objects, invstr", -1);
\r
10317 return JIM_OK; /* unreached */
\r
10321 static int Jim_EvalCoreCommand(Jim_Interp *interp, int argc,
\r
10322 Jim_Obj *const *argv)
\r
10325 return Jim_EvalObj(interp, argv[1]);
\r
10326 } else if (argc > 2) {
\r
10330 objPtr = Jim_ConcatObj(interp, argc-1, argv+1);
\r
10331 Jim_IncrRefCount(objPtr);
\r
10332 retcode = Jim_EvalObj(interp, objPtr);
\r
10333 Jim_DecrRefCount(interp, objPtr);
\r
10336 Jim_WrongNumArgs(interp, 1, argv, "script ?...?");
\r
10342 static int Jim_UplevelCoreCommand(Jim_Interp *interp, int argc,
\r
10343 Jim_Obj *const *argv)
\r
10346 int retcode, newLevel, oldLevel;
\r
10347 Jim_CallFrame *savedCallFrame, *targetCallFrame;
\r
10351 /* Save the old callframe pointer */
\r
10352 savedCallFrame = interp->framePtr;
\r
10354 /* Lookup the target frame pointer */
\r
10355 str = Jim_GetString(argv[1], NULL);
\r
10356 if ((str[0] >= '0' && str[0] <= '9') || str[0] == '#')
\r
10358 if (Jim_GetCallFrameByLevel(interp, argv[1],
\r
10359 &targetCallFrame,
\r
10360 &newLevel) != JIM_OK)
\r
10365 if (Jim_GetCallFrameByLevel(interp, NULL,
\r
10366 &targetCallFrame,
\r
10367 &newLevel) != JIM_OK)
\r
10373 Jim_WrongNumArgs(interp, 1, argv,
\r
10374 "?level? command ?arg ...?");
\r
10377 /* Eval the code in the target callframe. */
\r
10378 interp->framePtr = targetCallFrame;
\r
10379 oldLevel = interp->numLevels;
\r
10380 interp->numLevels = newLevel;
\r
10382 retcode = Jim_EvalObj(interp, argv[1]);
\r
10384 objPtr = Jim_ConcatObj(interp, argc-1, argv+1);
\r
10385 Jim_IncrRefCount(objPtr);
\r
10386 retcode = Jim_EvalObj(interp, objPtr);
\r
10387 Jim_DecrRefCount(interp, objPtr);
\r
10389 interp->numLevels = oldLevel;
\r
10390 interp->framePtr = savedCallFrame;
\r
10393 Jim_WrongNumArgs(interp, 1, argv, "?level? command ?arg ...?");
\r
10399 static int Jim_ExprCoreCommand(Jim_Interp *interp, int argc,
\r
10400 Jim_Obj *const *argv)
\r
10402 Jim_Obj *exprResultPtr;
\r
10406 retcode = Jim_EvalExpression(interp, argv[1], &exprResultPtr);
\r
10407 } else if (argc > 2) {
\r
10410 objPtr = Jim_ConcatObj(interp, argc-1, argv+1);
\r
10411 Jim_IncrRefCount(objPtr);
\r
10412 retcode = Jim_EvalExpression(interp, objPtr, &exprResultPtr);
\r
10413 Jim_DecrRefCount(interp, objPtr);
\r
10415 Jim_WrongNumArgs(interp, 1, argv, "expression ?...?");
\r
10418 if (retcode != JIM_OK) return retcode;
\r
10419 Jim_SetResult(interp, exprResultPtr);
\r
10420 Jim_DecrRefCount(interp, exprResultPtr);
\r
10425 static int Jim_BreakCoreCommand(Jim_Interp *interp, int argc,
\r
10426 Jim_Obj *const *argv)
\r
10429 Jim_WrongNumArgs(interp, 1, argv, "");
\r
10432 return JIM_BREAK;
\r
10436 static int Jim_ContinueCoreCommand(Jim_Interp *interp, int argc,
\r
10437 Jim_Obj *const *argv)
\r
10440 Jim_WrongNumArgs(interp, 1, argv, "");
\r
10443 return JIM_CONTINUE;
\r
10447 static int Jim_ReturnCoreCommand(Jim_Interp *interp, int argc,
\r
10448 Jim_Obj *const *argv)
\r
10451 return JIM_RETURN;
\r
10452 } else if (argc == 2) {
\r
10453 Jim_SetResult(interp, argv[1]);
\r
10454 interp->returnCode = JIM_OK;
\r
10455 return JIM_RETURN;
\r
10456 } else if (argc == 3 || argc == 4) {
\r
10458 if (Jim_GetReturnCode(interp, argv[2], &returnCode) == JIM_ERR)
\r
10460 interp->returnCode = returnCode;
\r
10462 Jim_SetResult(interp, argv[3]);
\r
10463 return JIM_RETURN;
\r
10465 Jim_WrongNumArgs(interp, 1, argv, "?-code code? ?result?");
\r
10468 return JIM_RETURN; /* unreached */
\r
10472 static int Jim_TailcallCoreCommand(Jim_Interp *interp, int argc,
\r
10473 Jim_Obj *const *argv)
\r
10477 objPtr = Jim_NewListObj(interp, argv+1, argc-1);
\r
10478 Jim_SetResult(interp, objPtr);
\r
10483 static int Jim_ProcCoreCommand(Jim_Interp *interp, int argc,
\r
10484 Jim_Obj *const *argv)
\r
10487 int arityMin, arityMax;
\r
10489 if (argc != 4 && argc != 5) {
\r
10490 Jim_WrongNumArgs(interp, 1, argv, "name arglist ?statics? body");
\r
10493 Jim_ListLength(interp, argv[2], &argListLen);
\r
10494 arityMin = arityMax = argListLen+1;
\r
10495 if (argListLen) {
\r
10498 Jim_Obj *lastArgPtr;
\r
10500 Jim_ListIndex(interp, argv[2], argListLen-1, &lastArgPtr, JIM_NONE);
\r
10501 str = Jim_GetString(lastArgPtr, &len);
\r
10502 if (len == 4 && memcmp(str, "args", 4) == 0) {
\r
10508 return Jim_CreateProcedure(interp, Jim_GetString(argv[1], NULL),
\r
10509 argv[2], NULL, argv[3], arityMin, arityMax);
\r
10511 return Jim_CreateProcedure(interp, Jim_GetString(argv[1], NULL),
\r
10512 argv[2], argv[3], argv[4], arityMin, arityMax);
\r
10517 static int Jim_ConcatCoreCommand(Jim_Interp *interp, int argc,
\r
10518 Jim_Obj *const *argv)
\r
10520 Jim_SetResult(interp, Jim_ConcatObj(interp, argc-1, argv+1));
\r
10525 static int Jim_UpvarCoreCommand(Jim_Interp *interp, int argc,
\r
10526 Jim_Obj *const *argv)
\r
10530 Jim_CallFrame *targetCallFrame;
\r
10532 /* Lookup the target frame pointer */
\r
10533 str = Jim_GetString(argv[1], NULL);
\r
10535 ((str[0] >= '0' && str[0] <= '9') || str[0] == '#'))
\r
10537 if (Jim_GetCallFrameByLevel(interp, argv[1],
\r
10538 &targetCallFrame, NULL) != JIM_OK)
\r
10543 if (Jim_GetCallFrameByLevel(interp, NULL,
\r
10544 &targetCallFrame, NULL) != JIM_OK)
\r
10547 /* Check for arity */
\r
10548 if (argc < 3 || ((argc-1)%2) != 0) {
\r
10549 Jim_WrongNumArgs(interp, 1, argv, "?level? otherVar localVar ?otherVar localVar ...?");
\r
10552 /* Now... for every other/local couple: */
\r
10553 for (i = 1; i < argc; i += 2) {
\r
10554 if (Jim_SetVariableLink(interp, argv[i+1], argv[i],
\r
10555 targetCallFrame) != JIM_OK) return JIM_ERR;
\r
10561 static int Jim_GlobalCoreCommand(Jim_Interp *interp, int argc,
\r
10562 Jim_Obj *const *argv)
\r
10567 Jim_WrongNumArgs(interp, 1, argv, "varName ?varName ...?");
\r
10570 /* Link every var to the toplevel having the same name */
\r
10571 if (interp->numLevels == 0) return JIM_OK; /* global at toplevel... */
\r
10572 for (i = 1; i < argc; i++) {
\r
10573 if (Jim_SetVariableLink(interp, argv[i], argv[i],
\r
10574 interp->topFramePtr) != JIM_OK) return JIM_ERR;
\r
10579 /* does the [string map] operation. On error NULL is returned,
\r
10580 * otherwise a new string object with the result, having refcount = 0,
\r
10581 * is returned. */
\r
10582 static Jim_Obj *JimStringMap(Jim_Interp *interp, Jim_Obj *mapListObjPtr,
\r
10583 Jim_Obj *objPtr, int nocase)
\r
10586 const char **key, *str, *noMatchStart = NULL;
\r
10588 int *keyLen, strLen, i;
\r
10589 Jim_Obj *resultObjPtr;
\r
10591 Jim_ListLength(interp, mapListObjPtr, &numMaps);
\r
10592 if (numMaps % 2) {
\r
10593 Jim_SetResultString(interp,
\r
10594 "list must contain an even number of elements", -1);
\r
10597 /* Initialization */
\r
10599 key = Jim_Alloc(sizeof(char*)*numMaps);
\r
10600 keyLen = Jim_Alloc(sizeof(int)*numMaps);
\r
10601 value = Jim_Alloc(sizeof(Jim_Obj*)*numMaps);
\r
10602 resultObjPtr = Jim_NewStringObj(interp, "", 0);
\r
10603 for (i = 0; i < numMaps; i++) {
\r
10604 Jim_Obj *eleObjPtr;
\r
10606 Jim_ListIndex(interp, mapListObjPtr, i*2, &eleObjPtr, JIM_NONE);
\r
10607 key[i] = Jim_GetString(eleObjPtr, &keyLen[i]);
\r
10608 Jim_ListIndex(interp, mapListObjPtr, i*2+1, &eleObjPtr, JIM_NONE);
\r
10609 value[i] = eleObjPtr;
\r
10611 str = Jim_GetString(objPtr, &strLen);
\r
10614 for (i = 0; i < numMaps; i++) {
\r
10615 if (strLen >= keyLen[i] && keyLen[i]) {
\r
10616 if (!JimStringCompare(str, keyLen[i], key[i], keyLen[i],
\r
10619 if (noMatchStart) {
\r
10620 Jim_AppendString(interp, resultObjPtr,
\r
10621 noMatchStart, str-noMatchStart);
\r
10622 noMatchStart = NULL;
\r
10624 Jim_AppendObj(interp, resultObjPtr, value[i]);
\r
10625 str += keyLen[i];
\r
10626 strLen -= keyLen[i];
\r
10631 if (i == numMaps) { /* no match */
\r
10632 if (noMatchStart == NULL)
\r
10633 noMatchStart = str;
\r
10638 if (noMatchStart) {
\r
10639 Jim_AppendString(interp, resultObjPtr,
\r
10640 noMatchStart, str-noMatchStart);
\r
10642 Jim_Free((void*)key);
\r
10643 Jim_Free(keyLen);
\r
10645 return resultObjPtr;
\r
10649 static int Jim_StringCoreCommand(Jim_Interp *interp, int argc,
\r
10650 Jim_Obj *const *argv)
\r
10653 const char *options[] = {
\r
10654 "length", "compare", "match", "equal", "range", "map", "repeat",
\r
10655 "index", "first", "tolower", "toupper", NULL
\r
10658 OPT_LENGTH, OPT_COMPARE, OPT_MATCH, OPT_EQUAL, OPT_RANGE,
\r
10659 OPT_MAP, OPT_REPEAT, OPT_INDEX, OPT_FIRST, OPT_TOLOWER, OPT_TOUPPER
\r
10663 Jim_WrongNumArgs(interp, 1, argv, "option ?arguments ...?");
\r
10666 if (Jim_GetEnum(interp, argv[1], options, &option, "option",
\r
10667 JIM_ERRMSG) != JIM_OK)
\r
10670 if (option == OPT_LENGTH) {
\r
10674 Jim_WrongNumArgs(interp, 2, argv, "string");
\r
10677 Jim_GetString(argv[2], &len);
\r
10678 Jim_SetResult(interp, Jim_NewIntObj(interp, len));
\r
10680 } else if (option == OPT_COMPARE) {
\r
10682 if ((argc != 4 && argc != 5) ||
\r
10683 (argc == 5 && Jim_CompareStringImmediate(interp,
\r
10684 argv[2], "-nocase") == 0)) {
\r
10685 Jim_WrongNumArgs(interp, 2, argv, "string1 string2");
\r
10692 Jim_SetResult(interp, Jim_NewIntObj(interp,
\r
10693 Jim_StringCompareObj(argv[2],
\r
10694 argv[3], nocase)));
\r
10696 } else if (option == OPT_MATCH) {
\r
10698 if ((argc != 4 && argc != 5) ||
\r
10699 (argc == 5 && Jim_CompareStringImmediate(interp,
\r
10700 argv[2], "-nocase") == 0)) {
\r
10701 Jim_WrongNumArgs(interp, 2, argv, "?-nocase? pattern "
\r
10709 Jim_SetResult(interp,
\r
10710 Jim_NewIntObj(interp, Jim_StringMatchObj(argv[2],
\r
10711 argv[3], nocase)));
\r
10713 } else if (option == OPT_EQUAL) {
\r
10715 Jim_WrongNumArgs(interp, 2, argv, "string1 string2");
\r
10718 Jim_SetResult(interp,
\r
10719 Jim_NewIntObj(interp, Jim_StringEqObj(argv[2],
\r
10722 } else if (option == OPT_RANGE) {
\r
10726 Jim_WrongNumArgs(interp, 2, argv, "string first last");
\r
10729 objPtr = Jim_StringRangeObj(interp, argv[2], argv[3], argv[4]);
\r
10730 if (objPtr == NULL)
\r
10732 Jim_SetResult(interp, objPtr);
\r
10734 } else if (option == OPT_MAP) {
\r
10738 if ((argc != 4 && argc != 5) ||
\r
10739 (argc == 5 && Jim_CompareStringImmediate(interp,
\r
10740 argv[2], "-nocase") == 0)) {
\r
10741 Jim_WrongNumArgs(interp, 2, argv, "?-nocase? mapList "
\r
10749 objPtr = JimStringMap(interp, argv[2], argv[3], nocase);
\r
10750 if (objPtr == NULL)
\r
10752 Jim_SetResult(interp, objPtr);
\r
10754 } else if (option == OPT_REPEAT) {
\r
10759 Jim_WrongNumArgs(interp, 2, argv, "string count");
\r
10762 if (Jim_GetWide(interp, argv[3], &count) != JIM_OK)
\r
10764 objPtr = Jim_NewStringObj(interp, "", 0);
\r
10765 while (count--) {
\r
10766 Jim_AppendObj(interp, objPtr, argv[2]);
\r
10768 Jim_SetResult(interp, objPtr);
\r
10770 } else if (option == OPT_INDEX) {
\r
10775 Jim_WrongNumArgs(interp, 2, argv, "string index");
\r
10778 if (Jim_GetIndex(interp, argv[3], &index) != JIM_OK)
\r
10780 str = Jim_GetString(argv[2], &len);
\r
10781 if (index != INT_MIN && index != INT_MAX)
\r
10782 index = JimRelToAbsIndex(len, index);
\r
10783 if (index < 0 || index >= len) {
\r
10784 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
10787 Jim_SetResult(interp, Jim_NewStringObj(interp, str+index, 1));
\r
10790 } else if (option == OPT_FIRST) {
\r
10791 int index = 0, l1, l2;
\r
10792 const char *s1, *s2;
\r
10794 if (argc != 4 && argc != 5) {
\r
10795 Jim_WrongNumArgs(interp, 2, argv, "subString string ?startIndex?");
\r
10798 s1 = Jim_GetString(argv[2], &l1);
\r
10799 s2 = Jim_GetString(argv[3], &l2);
\r
10801 if (Jim_GetIndex(interp, argv[4], &index) != JIM_OK)
\r
10803 index = JimRelToAbsIndex(l2, index);
\r
10805 Jim_SetResult(interp, Jim_NewIntObj(interp,
\r
10806 JimStringFirst(s1, l1, s2, l2, index)));
\r
10808 } else if (option == OPT_TOLOWER) {
\r
10810 Jim_WrongNumArgs(interp, 2, argv, "string");
\r
10813 Jim_SetResult(interp, JimStringToLower(interp, argv[2]));
\r
10814 } else if (option == OPT_TOUPPER) {
\r
10816 Jim_WrongNumArgs(interp, 2, argv, "string");
\r
10819 Jim_SetResult(interp, JimStringToUpper(interp, argv[2]));
\r
10825 static int Jim_TimeCoreCommand(Jim_Interp *interp, int argc,
\r
10826 Jim_Obj *const *argv)
\r
10828 long i, count = 1;
\r
10829 jim_wide start, elapsed;
\r
10831 const char *fmt = "%" JIM_WIDE_MODIFIER " microseconds per iteration";
\r
10834 Jim_WrongNumArgs(interp, 1, argv, "script ?count?");
\r
10838 if (Jim_GetLong(interp, argv[2], &count) != JIM_OK)
\r
10844 start = JimClock();
\r
10845 while (i-- > 0) {
\r
10848 if ((retval = Jim_EvalObj(interp, argv[1])) != JIM_OK)
\r
10851 elapsed = JimClock() - start;
\r
10852 sprintf(buf, fmt, elapsed/count);
\r
10853 Jim_SetResultString(interp, buf, -1);
\r
10858 static int Jim_ExitCoreCommand(Jim_Interp *interp, int argc,
\r
10859 Jim_Obj *const *argv)
\r
10861 long exitCode = 0;
\r
10864 Jim_WrongNumArgs(interp, 1, argv, "?exitCode?");
\r
10868 if (Jim_GetLong(interp, argv[1], &exitCode) != JIM_OK)
\r
10871 interp->exitCode = exitCode;
\r
10876 static int Jim_CatchCoreCommand(Jim_Interp *interp, int argc,
\r
10877 Jim_Obj *const *argv)
\r
10879 int exitCode = 0;
\r
10881 if (argc != 2 && argc != 3) {
\r
10882 Jim_WrongNumArgs(interp, 1, argv, "script ?varName?");
\r
10885 exitCode = Jim_EvalObj(interp, argv[1]);
\r
10887 if (Jim_SetVariable(interp, argv[2], Jim_GetResult(interp))
\r
10891 Jim_SetResult(interp, Jim_NewIntObj(interp, exitCode));
\r
10896 static int Jim_RefCoreCommand(Jim_Interp *interp, int argc,
\r
10897 Jim_Obj *const *argv)
\r
10899 if (argc != 3 && argc != 4) {
\r
10900 Jim_WrongNumArgs(interp, 1, argv, "string tag ?finalizer?");
\r
10904 Jim_SetResult(interp, Jim_NewReference(interp, argv[1], argv[2], NULL));
\r
10906 Jim_SetResult(interp, Jim_NewReference(interp, argv[1], argv[2],
\r
10913 static int Jim_GetrefCoreCommand(Jim_Interp *interp, int argc,
\r
10914 Jim_Obj *const *argv)
\r
10916 Jim_Reference *refPtr;
\r
10919 Jim_WrongNumArgs(interp, 1, argv, "reference");
\r
10922 if ((refPtr = Jim_GetReference(interp, argv[1])) == NULL)
\r
10924 Jim_SetResult(interp, refPtr->objPtr);
\r
10929 static int Jim_SetrefCoreCommand(Jim_Interp *interp, int argc,
\r
10930 Jim_Obj *const *argv)
\r
10932 Jim_Reference *refPtr;
\r
10935 Jim_WrongNumArgs(interp, 1, argv, "reference newValue");
\r
10938 if ((refPtr = Jim_GetReference(interp, argv[1])) == NULL)
\r
10940 Jim_IncrRefCount(argv[2]);
\r
10941 Jim_DecrRefCount(interp, refPtr->objPtr);
\r
10942 refPtr->objPtr = argv[2];
\r
10943 Jim_SetResult(interp, argv[2]);
\r
10948 static int Jim_CollectCoreCommand(Jim_Interp *interp, int argc,
\r
10949 Jim_Obj *const *argv)
\r
10952 Jim_WrongNumArgs(interp, 1, argv, "");
\r
10955 Jim_SetResult(interp, Jim_NewIntObj(interp, Jim_Collect(interp)));
\r
10959 /* [finalize] reference ?newValue? */
\r
10960 static int Jim_FinalizeCoreCommand(Jim_Interp *interp, int argc,
\r
10961 Jim_Obj *const *argv)
\r
10963 if (argc != 2 && argc != 3) {
\r
10964 Jim_WrongNumArgs(interp, 1, argv, "reference ?finalizerProc?");
\r
10968 Jim_Obj *cmdNamePtr;
\r
10970 if (Jim_GetFinalizer(interp, argv[1], &cmdNamePtr) != JIM_OK)
\r
10972 if (cmdNamePtr != NULL) /* otherwise the null string is returned. */
\r
10973 Jim_SetResult(interp, cmdNamePtr);
\r
10975 if (Jim_SetFinalizer(interp, argv[1], argv[2]) != JIM_OK)
\r
10977 Jim_SetResult(interp, argv[2]);
\r
10983 /* [info references] (list of all the references/finalizers) */
\r
10986 static int Jim_RenameCoreCommand(Jim_Interp *interp, int argc,
\r
10987 Jim_Obj *const *argv)
\r
10989 const char *oldName, *newName;
\r
10992 Jim_WrongNumArgs(interp, 1, argv, "oldName newName");
\r
10995 oldName = Jim_GetString(argv[1], NULL);
\r
10996 newName = Jim_GetString(argv[2], NULL);
\r
10997 if (Jim_RenameCommand(interp, oldName, newName) != JIM_OK) {
\r
10998 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
10999 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
11000 "can't rename \"", oldName, "\": ",
\r
11001 "command doesn't exist", NULL);
\r
11008 static int Jim_DictCoreCommand(Jim_Interp *interp, int argc,
\r
11009 Jim_Obj *const *argv)
\r
11012 const char *options[] = {
\r
11013 "create", "get", "set", "unset", "exists", NULL
\r
11016 OPT_CREATE, OPT_GET, OPT_SET, OPT_UNSET, OPT_EXIST
\r
11020 Jim_WrongNumArgs(interp, 1, argv, "option ?arguments ...?");
\r
11024 if (Jim_GetEnum(interp, argv[1], options, &option, "option",
\r
11025 JIM_ERRMSG) != JIM_OK)
\r
11028 if (option == OPT_CREATE) {
\r
11032 Jim_WrongNumArgs(interp, 2, argv, "?key value ...?");
\r
11035 objPtr = Jim_NewDictObj(interp, argv+2, argc-2);
\r
11036 Jim_SetResult(interp, objPtr);
\r
11038 } else if (option == OPT_GET) {
\r
11041 if (Jim_DictKeysVector(interp, argv[2], argv+3, argc-3, &objPtr,
\r
11042 JIM_ERRMSG) != JIM_OK)
\r
11044 Jim_SetResult(interp, objPtr);
\r
11046 } else if (option == OPT_SET) {
\r
11048 Jim_WrongNumArgs(interp, 2, argv, "varName key ?key ...? value");
\r
11051 return Jim_SetDictKeysVector(interp, argv[2], argv+3, argc-4,
\r
11053 } else if (option == OPT_UNSET) {
\r
11055 Jim_WrongNumArgs(interp, 2, argv, "varName key ?key ...?");
\r
11058 return Jim_SetDictKeysVector(interp, argv[2], argv+3, argc-3,
\r
11060 } else if (option == OPT_EXIST) {
\r
11064 if (Jim_DictKeysVector(interp, argv[2], argv+3, argc-3, &objPtr,
\r
11065 JIM_ERRMSG) == JIM_OK)
\r
11069 Jim_SetResult(interp, Jim_NewIntObj(interp, exists));
\r
11072 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
11073 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
11074 "bad option \"", Jim_GetString(argv[1], NULL), "\":",
\r
11075 " must be create, get, set", NULL);
\r
11082 static int Jim_LoadCoreCommand(Jim_Interp *interp, int argc,
\r
11083 Jim_Obj *const *argv)
\r
11086 Jim_WrongNumArgs(interp, 1, argv, "libaryFile");
\r
11089 return Jim_LoadLibrary(interp, Jim_GetString(argv[1], NULL));
\r
11093 static int Jim_SubstCoreCommand(Jim_Interp *interp, int argc,
\r
11094 Jim_Obj *const *argv)
\r
11096 int i, flags = 0;
\r
11100 Jim_WrongNumArgs(interp, 1, argv,
\r
11101 "?-nobackslashes? ?-nocommands? ?-novariables? string");
\r
11106 if (Jim_CompareStringImmediate(interp, argv[i+1],
\r
11107 "-nobackslashes"))
\r
11108 flags |= JIM_SUBST_NOESC;
\r
11109 else if (Jim_CompareStringImmediate(interp, argv[i+1],
\r
11111 flags |= JIM_SUBST_NOVAR;
\r
11112 else if (Jim_CompareStringImmediate(interp, argv[i+1],
\r
11114 flags |= JIM_SUBST_NOCMD;
\r
11116 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
11117 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
11118 "bad option \"", Jim_GetString(argv[i+1], NULL),
\r
11119 "\": must be -nobackslashes, -nocommands, or "
\r
11120 "-novariables", NULL);
\r
11124 if (Jim_SubstObj(interp, argv[argc-1], &objPtr, flags) != JIM_OK)
\r
11126 Jim_SetResult(interp, objPtr);
\r
11131 static int Jim_InfoCoreCommand(Jim_Interp *interp, int argc,
\r
11132 Jim_Obj *const *argv)
\r
11134 int cmd, result = JIM_OK;
\r
11135 static const char *commands[] = {
\r
11136 "body", "commands", "exists", "globals", "level", "locals",
\r
11137 "vars", "version", "complete", "args", NULL
\r
11139 enum {INFO_BODY, INFO_COMMANDS, INFO_EXISTS, INFO_GLOBALS, INFO_LEVEL,
\r
11140 INFO_LOCALS, INFO_VARS, INFO_VERSION, INFO_COMPLETE, INFO_ARGS};
\r
11143 Jim_WrongNumArgs(interp, 1, argv, "command ?args ...?");
\r
11146 if (Jim_GetEnum(interp, argv[1], commands, &cmd, "command", JIM_ERRMSG)
\r
11151 if (cmd == INFO_COMMANDS) {
\r
11152 if (argc != 2 && argc != 3) {
\r
11153 Jim_WrongNumArgs(interp, 2, argv, "?pattern?");
\r
11157 Jim_SetResult(interp,JimCommandsList(interp, argv[2]));
\r
11159 Jim_SetResult(interp, JimCommandsList(interp, NULL));
\r
11160 } else if (cmd == INFO_EXISTS) {
\r
11163 Jim_WrongNumArgs(interp, 2, argv, "varName");
\r
11166 exists = Jim_GetVariable(interp, argv[2], 0);
\r
11167 Jim_SetResult(interp, Jim_NewIntObj(interp, exists != 0));
\r
11168 } else if (cmd == INFO_GLOBALS || cmd == INFO_LOCALS || cmd == INFO_VARS) {
\r
11171 case INFO_GLOBALS: mode = JIM_VARLIST_GLOBALS; break;
\r
11172 case INFO_LOCALS: mode = JIM_VARLIST_LOCALS; break;
\r
11173 case INFO_VARS: mode = JIM_VARLIST_VARS; break;
\r
11174 default: mode = 0; /* avoid warning */; break;
\r
11176 if (argc != 2 && argc != 3) {
\r
11177 Jim_WrongNumArgs(interp, 2, argv, "?pattern?");
\r
11181 Jim_SetResult(interp,JimVariablesList(interp, argv[2], mode));
\r
11183 Jim_SetResult(interp, JimVariablesList(interp, NULL, mode));
\r
11184 } else if (cmd == INFO_LEVEL) {
\r
11188 Jim_SetResult(interp,
\r
11189 Jim_NewIntObj(interp, interp->numLevels));
\r
11192 if (JimInfoLevel(interp, argv[2], &objPtr) != JIM_OK)
\r
11194 Jim_SetResult(interp, objPtr);
\r
11197 Jim_WrongNumArgs(interp, 2, argv, "?levelNum?");
\r
11200 } else if (cmd == INFO_BODY || cmd == INFO_ARGS) {
\r
11204 Jim_WrongNumArgs(interp, 2, argv, "procname");
\r
11207 if ((cmdPtr = Jim_GetCommand(interp, argv[2], JIM_ERRMSG)) == NULL)
\r
11209 if (cmdPtr->cmdProc != NULL) {
\r
11210 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
11211 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
11212 "command \"", Jim_GetString(argv[2], NULL),
\r
11213 "\" is not a procedure", NULL);
\r
11216 if (cmd == INFO_BODY)
\r
11217 Jim_SetResult(interp, cmdPtr->bodyObjPtr);
\r
11219 Jim_SetResult(interp, cmdPtr->argListObjPtr);
\r
11220 } else if (cmd == INFO_VERSION) {
\r
11221 char buf[(JIM_INTEGER_SPACE * 2) + 1];
\r
11222 sprintf(buf, "%d.%d",
\r
11223 JIM_VERSION / 100, JIM_VERSION % 100);
\r
11224 Jim_SetResultString(interp, buf, -1);
\r
11225 } else if (cmd == INFO_COMPLETE) {
\r
11230 Jim_WrongNumArgs(interp, 2, argv, "script");
\r
11233 s = Jim_GetString(argv[2], &len);
\r
11234 Jim_SetResult(interp,
\r
11235 Jim_NewIntObj(interp, Jim_ScriptIsComplete(s, len, NULL)));
\r
11241 static int Jim_SplitCoreCommand(Jim_Interp *interp, int argc,
\r
11242 Jim_Obj *const *argv)
\r
11244 const char *str, *splitChars, *noMatchStart;
\r
11245 int splitLen, strLen, i;
\r
11246 Jim_Obj *resObjPtr;
\r
11248 if (argc != 2 && argc != 3) {
\r
11249 Jim_WrongNumArgs(interp, 1, argv, "string ?splitChars?");
\r
11254 splitChars = " \n\t\r";
\r
11257 splitChars = Jim_GetString(argv[2], &splitLen);
\r
11259 str = Jim_GetString(argv[1], &strLen);
\r
11260 if (!strLen) return JIM_OK;
\r
11261 noMatchStart = str;
\r
11262 resObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
11266 for (i = 0; i < splitLen; i++) {
\r
11267 if (*str == splitChars[i]) {
\r
11270 objPtr = Jim_NewStringObj(interp, noMatchStart,
\r
11271 (str-noMatchStart));
\r
11272 Jim_ListAppendElement(interp, resObjPtr, objPtr);
\r
11273 noMatchStart = str+1;
\r
11280 Jim_ListAppendElement(interp, resObjPtr,
\r
11281 Jim_NewStringObj(interp, noMatchStart, (str-noMatchStart)));
\r
11283 /* This handles the special case of splitchars eq {}. This
\r
11284 * is trivial but we want to perform object sharing as Tcl does. */
\r
11285 Jim_Obj *objCache[256];
\r
11286 const unsigned char *u = (unsigned char*) str;
\r
11287 memset(objCache, 0, sizeof(objCache));
\r
11288 for (i = 0; i < strLen; i++) {
\r
11291 if (objCache[c] == NULL)
\r
11292 objCache[c] = Jim_NewStringObj(interp, (char*)u+i, 1);
\r
11293 Jim_ListAppendElement(interp, resObjPtr, objCache[c]);
\r
11296 Jim_SetResult(interp, resObjPtr);
\r
11301 static int Jim_JoinCoreCommand(Jim_Interp *interp, int argc,
\r
11302 Jim_Obj *const *argv)
\r
11304 const char *joinStr;
\r
11305 int joinStrLen, i, listLen;
\r
11306 Jim_Obj *resObjPtr;
\r
11308 if (argc != 2 && argc != 3) {
\r
11309 Jim_WrongNumArgs(interp, 1, argv, "list ?joinString?");
\r
11317 joinStr = Jim_GetString(argv[2], &joinStrLen);
\r
11319 Jim_ListLength(interp, argv[1], &listLen);
\r
11320 resObjPtr = Jim_NewStringObj(interp, NULL, 0);
\r
11322 for (i = 0; i < listLen; i++) {
\r
11325 Jim_ListIndex(interp, argv[1], i, &objPtr, JIM_NONE);
\r
11326 Jim_AppendObj(interp, resObjPtr, objPtr);
\r
11327 if (i+1 != listLen) {
\r
11328 Jim_AppendString(interp, resObjPtr, joinStr, joinStrLen);
\r
11331 Jim_SetResult(interp, resObjPtr);
\r
11336 static int Jim_FormatCoreCommand(Jim_Interp *interp, int argc,
\r
11337 Jim_Obj *const *argv)
\r
11342 Jim_WrongNumArgs(interp, 1, argv, "formatString ?arg arg ...?");
\r
11345 objPtr = Jim_FormatString(interp, argv[1], argc-2, argv+2);
\r
11346 if (objPtr == NULL)
\r
11348 Jim_SetResult(interp, objPtr);
\r
11353 static int Jim_ScanCoreCommand(Jim_Interp *interp, int argc,
\r
11354 Jim_Obj *const *argv)
\r
11356 Jim_Obj *listPtr, **outVec;
\r
11357 int outc, i, count = 0;
\r
11360 Jim_WrongNumArgs(interp, 1, argv, "string formatString ?varName ...?");
\r
11363 if (argv[2]->typePtr != &scanFmtStringObjType)
\r
11364 SetScanFmtFromAny(interp, argv[2]);
\r
11365 if (FormatGetError(argv[2]) != 0) {
\r
11366 Jim_SetResultString(interp, FormatGetError(argv[2]), -1);
\r
11370 int maxPos = FormatGetMaxPos(argv[2]);
\r
11371 int count = FormatGetCnvCount(argv[2]);
\r
11372 if (maxPos > argc-3) {
\r
11373 Jim_SetResultString(interp, "\"%n$\" argument index out of range", -1);
\r
11375 } else if (count != 0 && count < argc-3) {
\r
11376 Jim_SetResultString(interp, "variable is not assigned by any "
\r
11377 "conversion specifiers", -1);
\r
11379 } else if (count > argc-3) {
\r
11380 Jim_SetResultString(interp, "different numbers of variable names and "
\r
11381 "field specifiers", -1);
\r
11385 listPtr = Jim_ScanString(interp, argv[1], argv[2], JIM_ERRMSG);
\r
11386 if (listPtr == 0)
\r
11390 if (listPtr != 0 && listPtr != (Jim_Obj*)EOF)
\r
11391 Jim_ListLength(interp, listPtr, &len);
\r
11392 if (listPtr == (Jim_Obj*)EOF || len == 0) { // XXX
\r
11393 Jim_SetResult(interp, Jim_NewIntObj(interp, -1));
\r
11396 JimListGetElements(interp, listPtr, &outc, &outVec);
\r
11397 for (i = 0; i < outc; ++i) {
\r
11398 if (Jim_Length(outVec[i]) > 0) {
\r
11400 if (Jim_SetVariable(interp, argv[3+i], outVec[i]) != JIM_OK)
\r
11404 Jim_FreeNewObj(interp, listPtr);
\r
11405 Jim_SetResult(interp, Jim_NewIntObj(interp, count));
\r
11407 if (listPtr == (Jim_Obj*)EOF) {
\r
11408 Jim_SetResult(interp, Jim_NewListObj(interp, 0, 0));
\r
11411 Jim_SetResult(interp, listPtr);
\r
11415 Jim_FreeNewObj(interp, listPtr);
\r
11420 static int Jim_ErrorCoreCommand(Jim_Interp *interp, int argc,
\r
11421 Jim_Obj *const *argv)
\r
11424 Jim_WrongNumArgs(interp, 1, argv, "message");
\r
11427 Jim_SetResult(interp, argv[1]);
\r
11432 static int Jim_LrangeCoreCommand(Jim_Interp *interp, int argc,
\r
11433 Jim_Obj *const *argv)
\r
11438 Jim_WrongNumArgs(interp, 1, argv, "list first last");
\r
11441 if ((objPtr = Jim_ListRange(interp, argv[1], argv[2], argv[3])) == NULL)
\r
11443 Jim_SetResult(interp, objPtr);
\r
11448 static int Jim_EnvCoreCommand(Jim_Interp *interp, int argc,
\r
11449 Jim_Obj *const *argv)
\r
11455 Jim_WrongNumArgs(interp, 1, argv, "varName");
\r
11458 key = Jim_GetString(argv[1], NULL);
\r
11459 val = getenv(key);
\r
11460 if (val == NULL) {
\r
11461 Jim_SetResult(interp, Jim_NewEmptyStringObj(interp));
\r
11462 Jim_AppendStrings(interp, Jim_GetResult(interp),
\r
11463 "environment variable \"",
\r
11464 key, "\" does not exist", NULL);
\r
11467 Jim_SetResult(interp, Jim_NewStringObj(interp, val, -1));
\r
11472 static int Jim_SourceCoreCommand(Jim_Interp *interp, int argc,
\r
11473 Jim_Obj *const *argv)
\r
11478 Jim_WrongNumArgs(interp, 1, argv, "fileName");
\r
11481 retval = Jim_EvalFile(interp, Jim_GetString(argv[1], NULL));
\r
11482 if (retval == JIM_RETURN)
\r
11488 static int Jim_LreverseCoreCommand(Jim_Interp *interp, int argc,
\r
11489 Jim_Obj *const *argv)
\r
11491 Jim_Obj *revObjPtr, **ele;
\r
11495 Jim_WrongNumArgs(interp, 1, argv, "list");
\r
11498 JimListGetElements(interp, argv[1], &len, &ele);
\r
11500 revObjPtr = Jim_NewListObj(interp, NULL, 0);
\r
11502 ListAppendElement(revObjPtr, ele[len--]);
\r
11503 Jim_SetResult(interp, revObjPtr);
\r
11507 static int JimRangeLen(jim_wide start, jim_wide end, jim_wide step)
\r
11511 if (step == 0) return -1;
\r
11512 if (start == end) return 0;
\r
11513 else if (step > 0 && start > end) return -1;
\r
11514 else if (step < 0 && end > start) return -1;
\r
11516 if (len < 0) len = -len; /* abs(len) */
\r
11517 if (step < 0) step = -step; /* abs(step) */
\r
11518 len = 1 + ((len-1)/step);
\r
11519 /* We can truncate safely to INT_MAX, the range command
\r
11520 * will always return an error for a such long range
\r
11521 * because Tcl lists can't be so long. */
\r
11522 if (len > INT_MAX) len = INT_MAX;
\r
11523 return (int)((len < 0) ? -1 : len);
\r
11527 static int Jim_RangeCoreCommand(Jim_Interp *interp, int argc,
\r
11528 Jim_Obj *const *argv)
\r
11530 jim_wide start = 0, end, step = 1;
\r
11534 if (argc < 2 || argc > 4) {
\r
11535 Jim_WrongNumArgs(interp, 1, argv, "?start? end ?step?");
\r
11539 if (Jim_GetWide(interp, argv[1], &end) != JIM_OK)
\r
11542 if (Jim_GetWide(interp, argv[1], &start) != JIM_OK ||
\r
11543 Jim_GetWide(interp, argv[2], &end) != JIM_OK)
\r
11545 if (argc == 4 && Jim_GetWide(interp, argv[3], &step) != JIM_OK)
\r
11548 if ((len = JimRangeLen(start, end, step)) == -1) {
\r
11549 Jim_SetResultString(interp, "Invalid (infinite?) range specified", -1);
\r
11552 objPtr = Jim_NewListObj(interp, NULL, 0);
\r
11553 for (i = 0; i < len; i++)
\r
11554 ListAppendElement(objPtr, Jim_NewIntObj(interp, start+i*step));
\r
11555 Jim_SetResult(interp, objPtr);
\r
11560 static int Jim_RandCoreCommand(Jim_Interp *interp, int argc,
\r
11561 Jim_Obj *const *argv)
\r
11563 jim_wide min = 0, max, len, maxMul;
\r
11565 if (argc < 1 || argc > 3) {
\r
11566 Jim_WrongNumArgs(interp, 1, argv, "?min? max");
\r
11570 max = JIM_WIDE_MAX;
\r
11571 } else if (argc == 2) {
\r
11572 if (Jim_GetWide(interp, argv[1], &max) != JIM_OK)
\r
11574 } else if (argc == 3) {
\r
11575 if (Jim_GetWide(interp, argv[1], &min) != JIM_OK ||
\r
11576 Jim_GetWide(interp, argv[2], &max) != JIM_OK)
\r
11581 Jim_SetResultString(interp, "Invalid arguments (max < min)", -1);
\r
11584 maxMul = JIM_WIDE_MAX - (len ? (JIM_WIDE_MAX%len) : 0);
\r
11588 JimRandomBytes(interp, &r, sizeof(jim_wide));
\r
11589 if (r < 0 || r >= maxMul) continue;
\r
11590 r = (len == 0) ? 0 : r%len;
\r
11591 Jim_SetResult(interp, Jim_NewIntObj(interp, min+r));
\r
11597 static int Jim_PackageCoreCommand(Jim_Interp *interp, int argc,
\r
11598 Jim_Obj *const *argv)
\r
11601 const char *options[] = {
\r
11602 "require", "provide", NULL
\r
11604 enum {OPT_REQUIRE, OPT_PROVIDE};
\r
11607 Jim_WrongNumArgs(interp, 1, argv, "option ?arguments ...?");
\r
11610 if (Jim_GetEnum(interp, argv[1], options, &option, "option",
\r
11611 JIM_ERRMSG) != JIM_OK)
\r
11614 if (option == OPT_REQUIRE) {
\r
11618 if (Jim_CompareStringImmediate(interp, argv[2], "-exact")) {
\r
11623 if (argc != 3 && argc != 4) {
\r
11624 Jim_WrongNumArgs(interp, 2, argv, "?-exact? package ?version?");
\r
11627 ver = Jim_PackageRequire(interp, Jim_GetString(argv[2], NULL),
\r
11628 argc == 4 ? Jim_GetString(argv[3], NULL) : "",
\r
11632 Jim_SetResultString(interp, ver, -1);
\r
11633 } else if (option == OPT_PROVIDE) {
\r
11635 Jim_WrongNumArgs(interp, 2, argv, "package version");
\r
11638 return Jim_PackageProvide(interp, Jim_GetString(argv[2], NULL),
\r
11639 Jim_GetString(argv[3], NULL), JIM_ERRMSG);
\r
11645 const char *name;
\r
11646 Jim_CmdProc cmdProc;
\r
11647 } Jim_CoreCommandsTable[] = {
\r
11648 {"set", Jim_SetCoreCommand},
\r
11649 {"unset", Jim_UnsetCoreCommand},
\r
11650 {"puts", Jim_PutsCoreCommand},
\r
11651 {"+", Jim_AddCoreCommand},
\r
11652 {"*", Jim_MulCoreCommand},
\r
11653 {"-", Jim_SubCoreCommand},
\r
11654 {"/", Jim_DivCoreCommand},
\r
11655 {"incr", Jim_IncrCoreCommand},
\r
11656 {"while", Jim_WhileCoreCommand},
\r
11657 {"for", Jim_ForCoreCommand},
\r
11658 {"foreach", Jim_ForeachCoreCommand},
\r
11659 {"lmap", Jim_LmapCoreCommand},
\r
11660 {"if", Jim_IfCoreCommand},
\r
11661 {"switch", Jim_SwitchCoreCommand},
\r
11662 {"list", Jim_ListCoreCommand},
\r
11663 {"lindex", Jim_LindexCoreCommand},
\r
11664 {"lset", Jim_LsetCoreCommand},
\r
11665 {"llength", Jim_LlengthCoreCommand},
\r
11666 {"lappend", Jim_LappendCoreCommand},
\r
11667 {"linsert", Jim_LinsertCoreCommand},
\r
11668 {"lsort", Jim_LsortCoreCommand},
\r
11669 {"append", Jim_AppendCoreCommand},
\r
11670 {"debug", Jim_DebugCoreCommand},
\r
11671 {"eval", Jim_EvalCoreCommand},
\r
11672 {"uplevel", Jim_UplevelCoreCommand},
\r
11673 {"expr", Jim_ExprCoreCommand},
\r
11674 {"break", Jim_BreakCoreCommand},
\r
11675 {"continue", Jim_ContinueCoreCommand},
\r
11676 {"proc", Jim_ProcCoreCommand},
\r
11677 {"concat", Jim_ConcatCoreCommand},
\r
11678 {"return", Jim_ReturnCoreCommand},
\r
11679 {"upvar", Jim_UpvarCoreCommand},
\r
11680 {"global", Jim_GlobalCoreCommand},
\r
11681 {"string", Jim_StringCoreCommand},
\r
11682 {"time", Jim_TimeCoreCommand},
\r
11683 {"exit", Jim_ExitCoreCommand},
\r
11684 {"catch", Jim_CatchCoreCommand},
\r
11685 {"ref", Jim_RefCoreCommand},
\r
11686 {"getref", Jim_GetrefCoreCommand},
\r
11687 {"setref", Jim_SetrefCoreCommand},
\r
11688 {"finalize", Jim_FinalizeCoreCommand},
\r
11689 {"collect", Jim_CollectCoreCommand},
\r
11690 {"rename", Jim_RenameCoreCommand},
\r
11691 {"dict", Jim_DictCoreCommand},
\r
11692 {"load", Jim_LoadCoreCommand},
\r
11693 {"subst", Jim_SubstCoreCommand},
\r
11694 {"info", Jim_InfoCoreCommand},
\r
11695 {"split", Jim_SplitCoreCommand},
\r
11696 {"join", Jim_JoinCoreCommand},
\r
11697 {"format", Jim_FormatCoreCommand},
\r
11698 {"scan", Jim_ScanCoreCommand},
\r
11699 {"error", Jim_ErrorCoreCommand},
\r
11700 {"lrange", Jim_LrangeCoreCommand},
\r
11701 {"env", Jim_EnvCoreCommand},
\r
11702 {"source", Jim_SourceCoreCommand},
\r
11703 {"lreverse", Jim_LreverseCoreCommand},
\r
11704 {"range", Jim_RangeCoreCommand},
\r
11705 {"rand", Jim_RandCoreCommand},
\r
11706 {"package", Jim_PackageCoreCommand},
\r
11707 {"tailcall", Jim_TailcallCoreCommand},
\r
11711 /* Some Jim core command is actually a procedure written in Jim itself. */
\r
11712 static void Jim_RegisterCoreProcedures(Jim_Interp *interp)
\r
11714 Jim_Eval(interp, (char*)
\r
11715 "proc lambda {arglist args} {\n"
\r
11716 " set name [ref {} function lambdaFinalizer]\n"
\r
11717 " uplevel 1 [list proc $name $arglist {expand}$args]\n"
\r
11718 " return $name\n"
\r
11720 "proc lambdaFinalizer {name val} {\n"
\r
11721 " rename $name {}\n"
\r
11726 void Jim_RegisterCoreCommands(Jim_Interp *interp)
\r
11730 while(Jim_CoreCommandsTable[i].name != NULL) {
\r
11731 Jim_CreateCommand(interp,
\r
11732 Jim_CoreCommandsTable[i].name,
\r
11733 Jim_CoreCommandsTable[i].cmdProc,
\r
11737 Jim_RegisterCoreProcedures(interp);
\r
11740 /* -----------------------------------------------------------------------------
\r
11741 * Interactive prompt
\r
11742 * ---------------------------------------------------------------------------*/
\r
11743 void Jim_PrintErrorMessage(Jim_Interp *interp)
\r
11747 fprintf(interp->stderr_, "Runtime error, file \"%s\", line %d:" JIM_NL,
\r
11748 interp->errorFileName, interp->errorLine);
\r
11749 fprintf(interp->stderr_, " %s" JIM_NL,
\r
11750 Jim_GetString(interp->result, NULL));
\r
11751 Jim_ListLength(interp, interp->stackTrace, &len);
\r
11752 for (i = 0; i < len; i+= 3) {
\r
11754 const char *proc, *file, *line;
\r
11756 Jim_ListIndex(interp, interp->stackTrace, i, &objPtr, JIM_NONE);
\r
11757 proc = Jim_GetString(objPtr, NULL);
\r
11758 Jim_ListIndex(interp, interp->stackTrace, i+1, &objPtr,
\r
11760 file = Jim_GetString(objPtr, NULL);
\r
11761 Jim_ListIndex(interp, interp->stackTrace, i+2, &objPtr,
\r
11763 line = Jim_GetString(objPtr, NULL);
\r
11764 fprintf(interp->stderr_,
\r
11765 "In procedure '%s' called at file \"%s\", line %s" JIM_NL,
\r
11766 proc, file, line);
\r
11770 int Jim_InteractivePrompt(Jim_Interp *interp)
\r
11772 int retcode = JIM_OK;
\r
11773 Jim_Obj *scriptObjPtr;
\r
11775 fprintf(interp->stdout_, "Welcome to Jim version %d.%d, "
\r
11776 "Copyright (c) 2005-8 Salvatore Sanfilippo" JIM_NL,
\r
11777 JIM_VERSION / 100, JIM_VERSION % 100);
\r
11778 Jim_SetVariableStrWithStr(interp, "jim_interactive", "1");
\r
11781 const char *result;
\r
11782 const char *retcodestr[] = {
\r
11783 "ok", "error", "return", "break", "continue", "eval", "exit"
\r
11787 if (retcode != 0) {
\r
11788 if (retcode >= 2 && retcode <= 6)
\r
11789 fprintf(interp->stdout_, "[%s] . ", retcodestr[retcode]);
\r
11791 fprintf(interp->stdout_, "[%d] . ", retcode);
\r
11793 fprintf(interp->stdout_, ". ");
\r
11794 fflush(interp->stdout_);
\r
11795 scriptObjPtr = Jim_NewStringObj(interp, "", 0);
\r
11796 Jim_IncrRefCount(scriptObjPtr);
\r
11802 if (fgets(buf, 1024, interp->stdin_) == NULL) {
\r
11803 Jim_DecrRefCount(interp, scriptObjPtr);
\r
11806 Jim_AppendString(interp, scriptObjPtr, buf, -1);
\r
11807 str = Jim_GetString(scriptObjPtr, &len);
\r
11808 if (Jim_ScriptIsComplete(str, len, &state))
\r
11810 fprintf(interp->stdout_, "%c> ", state);
\r
11813 retcode = Jim_EvalObj(interp, scriptObjPtr);
\r
11814 Jim_DecrRefCount(interp, scriptObjPtr);
\r
11815 result = Jim_GetString(Jim_GetResult(interp), &reslen);
\r
11816 if (retcode == JIM_ERR) {
\r
11817 Jim_PrintErrorMessage(interp);
\r
11818 } else if (retcode == JIM_EXIT) {
\r
11819 exit(Jim_GetExitCode(interp));
\r
11822 fwrite(result, 1, reslen, interp->stdout_);
\r
11823 fprintf(interp->stdout_, JIM_NL);
\r
projects / openocd / blob