vrtc / pjass (public) (License: BSD) (since 2023-08-03) (hash sha1)
pjass is a free Jass scripting language parser. This repository is a fork of lep/pjass. The goal is to add Debian packaging. As of the time of this writing, it works for current stable, that is Debian 12 (bookworm).
Clone URLs: https://rocketgit.com/user/vrtc/pjass ssh://rocketgit@ssh.rocketgit.com/user/vrtc/pjass git://git.rocketgit.com/user/vrtc/pjass
master upstream
List of commits:
Subject Hash Author Date (UTC)
Optimized ht_put by not calling ht_lookup. 4a2c4d293b719c939b4d8f357adcc04ef26b1cbb lep 2018-11-07 20:51:00
Only add globals to uninitialized globals. efb384fb661e08a855a5861189bf9409ebf9f557 lep 2018-11-07 14:56:38
Added unitialized check for globals. d8a909d8ac08cc233f5cd988afac043cbaeb1b4e lep 2018-11-06 19:43:57
Fixed off-by-one error in str_append. b458eb97a71bad87bbbbef610009da40e0dbf855 lep 2018-11-01 12:26:48
Added modulo operator. 70b4c5117a0b84cddd0c35e07a47e3b2aaf847b8 lep 2018-08-09 19:46:14
realloc returns the new pointer... c15eac9a4c2c2531a256125bc70272edbbf1d036 lep 2018-07-24 20:03:41
Track blocks d2763ae8473a1c699aa2e5605922e4b500c83ed4 lep 2018-07-22 13:28:40
Cross compile and strip under FreeBSD 296bd56c1347afb7a20337e02574f9196b48317a lep 2018-07-22 11:55:29
Track opening/closing blocks. 49b23df64b209106cce92e417ee13ecebb0bc009 lep 2018-07-09 09:37:01
Replace strncat with str_append. ad968e040f315ed3cf6580e46587342897839529 lep 2018-03-21 13:53:11
Do not report arrays as uninitialized when the index is missing. 72e93bd234743a438fb0a5c105514bf732c22b89 lep 2017-12-20 14:59:10
Better error messages. ad8342582ac3617280f471d889b1766be272858b lep 2017-11-15 17:52:08
Handle wrong shadowing. 0500a60ef11f39c4f33044e26c29798f6d8445b5 lep 2017-02-19 14:37:21
Added checks for natives which behave bad in a globals block. 3e6ac270dda9ad695723d3bc2aac4d69a2fdf87a lep 2017-02-19 10:57:33
Update readme.md 2c9177dd5482ed8c4c1464a4ade37c301205fe6b lep 2017-02-01 17:42:49
Public git release. 2da78f3665ac4f53f5833c6a48ebbeaabea0cd49 lep 2017-02-01 16:42:21
Better ifdef-handling for aligned malloc. d95ebafa7204e49d84a9fed8cdeb01713dd0bc82 lep 2017-02-01 16:41:07
Makefile changes. 0458bb26764aad1caec71ccf721e84a28c699ee0 lep 2017-02-01 15:48:25
Can now compile on freebsd and linux from one branch. 0772c4bd17dcfc389ca0e887b4bbceda8e46fa8e lep 2017-01-07 21:05:10
More descriptive check for assignment. 474462b44fe20e958e8c6a3b51ba2da9c4a46451 lep 2016-11-24 16:47:15
Commit 4a2c4d293b719c939b4d8f357adcc04ef26b1cbb - Optimized ht_put by not calling ht_lookup.
We just do the same check as ht_lookup but inline.
Also changed hashfunc from murmur3 to fnv since it seems to be about the
same speed and fnv is way less code.
Author: lep
Author date (UTC): 2018-11-07 20:51
Committer name: lep
Committer date (UTC): 2018-11-07 20:51
Parent(s): efb384fb661e08a855a5861189bf9409ebf9f557
Signer:
Signing key:
Signing status: N
Tree: 35ba4c319b691e025f21895f8ca86a048fe8800f
File Lines added Lines deleted
Makefile 1 0
hashtable.c 8 54
main.c 7 7
misc.c 3 3
File Makefile changed (mode: 100644) (index cf65b80..5fefd32)
... ... clean-release-files: ## Cleans all release zipballs
78 78 clean-prof-files: ## Cleans all profiling files clean-prof-files: ## Cleans all profiling files
79 79 rm -f tests/should-check/*-analysis.txt \ rm -f tests/should-check/*-analysis.txt \
80 80 tests/should-fail/*-analysis.txt \ tests/should-fail/*-analysis.txt \
81 tests/map-scripts/*-analysis.txt \
81 82 gmon.out gmon.out
82 83
83 84
File hashtable.c changed (mode: 100644) (index 42cca35..2893edb)
6 6
7 7 static uint32_t hashfunc(const char *key) static uint32_t hashfunc(const char *key)
8 8 { {
9 //murmur3_32
10 static const uint32_t c1 = 0xcc9e2d51;
11 static const uint32_t c2 = 0x1b873593;
12 static const uint32_t r1 = 15;
13 static const uint32_t r2 = 13;
14 static const uint32_t m = 5;
15 static const uint32_t n = 0xe6546b64;
16
17 uint32_t len = strlen(key);
18 uint32_t hash = 0;
19
20 const int nblocks = len / 4;
21 const uint32_t *blocks = (const uint32_t *) key;
22 int i;
23 for (i = 0; i < nblocks; i++) {
24 uint32_t k = blocks[i];
25 k *= c1;
26 k = (k << r1) | (k >> (32 - r1));
27 k *= c2;
28
29 hash ^= k;
30 hash = ((hash << r2) | (hash >> (32 - r2))) * m + n;
31 }
32
33 const uint8_t *tail = (const uint8_t *) (key + nblocks * 4);
34 uint32_t k1 = 0;
35
36 switch (len & 3) {
37 case 3:
38 k1 ^= tail[2] << 16;
39 case 2:
40 k1 ^= tail[1] << 8;
41 case 1:
42 k1 ^= tail[0];
43
44 k1 *= c1;
45 k1 = (k1 << r1) | (k1 >> (32 - r1));
46 k1 *= c2;
47 hash ^= k1;
48 }
49
50 hash ^= len;
51 hash ^= (hash >> 16);
52 hash *= 0x85ebca6b;
53 hash ^= (hash >> 13);
54 hash *= 0xc2b2ae35;
55 hash ^= (hash >> 16);
56
57 return hash;
9 // fnv
10 uint32_t hash = 2166136261;
11 while(*key)
12 hash = (hash ^ *key++) * 16777619;
13 return hash;
58 14 } }
59 15
60 16 void ht_init(struct hashtable *h, size_t size) void ht_init(struct hashtable *h, size_t size)
 
... ... void * ht_lookup(struct hashtable *h, const char *name)
70 26 size_t idx = (start + 1) % h->size; size_t idx = (start + 1) % h->size;
71 27 for(; idx != start; idx = (idx + 1) % h->size){ for(; idx != start; idx = (idx + 1) % h->size){
72 28 if(h->bucket[idx].name){ if(h->bucket[idx].name){
73 if(!strcmp(h->bucket[idx].name, name)){
29 if( !strcmp(h->bucket[idx].name, name)){
74 30 return h->bucket[idx].val; return h->bucket[idx].val;
75 31 } }
76 32 }else{ }else{
 
... ... static void resize(struct hashtable *h)
98 54
99 55 bool ht_put(struct hashtable *h, const char *name, void *val) bool ht_put(struct hashtable *h, const char *name, void *val)
100 56 { {
101 if (ht_lookup(h, name) != NULL) {
102 return false;
103 }
104
105 57 size_t start = hashfunc(name); size_t start = hashfunc(name);
106 58 size_t idx = (start + 1) % h->size; size_t idx = (start + 1) % h->size;
107 59 for(; /*idx != start*/; idx = (idx + 1) % h->size){ for(; /*idx != start*/; idx = (idx + 1) % h->size){
 
... ... bool ht_put(struct hashtable *h, const char *name, void *val)
109 61 h->bucket[idx].name = name; h->bucket[idx].name = name;
110 62 h->bucket[idx].val = val; h->bucket[idx].val = val;
111 63 break; break;
64 }else if( !strcmp(h->bucket[idx].name, name)){
65 return false;
112 66 } }
113 67 } }
114 68 h->count++; h->count++;
File main.c changed (mode: 100644) (index ee39349..9eeed2a)
... ... static struct typenode* addPrimitiveType(const char *name)
17 17
18 18 static void init() static void init()
19 19 { {
20 ht_init(&functions, 8191);
20 ht_init(&functions, 10009);
21 21 ht_init(&globals, 8191); ht_init(&globals, 8191);
22 ht_init(&locals, 23);
23 ht_init(&params, 11);
24 ht_init(&types, 511);
25 ht_init(&initialized, 23);
22 ht_init(&locals, 27);
23 ht_init(&params, 23);
24 ht_init(&types, 149);
25 ht_init(&initialized, 2047);
26 26
27 27 ht_init(&bad_natives_in_globals, 17); ht_init(&bad_natives_in_globals, 17);
28 28 ht_init(&shadowed_variables, 17); ht_init(&shadowed_variables, 17);
29 29
30 ht_init(&uninitialized_globals, 511);
30 ht_init(&uninitialized_globals, 2047);
31 31
32 32 gHandle = addPrimitiveType("handle"); gHandle = addPrimitiveType("handle");
33 33 gInteger = addPrimitiveType("integer"); gInteger = addPrimitiveType("integer");
 
... ... printf(
176 176 dofile(stdin, "<stdin>"); dofile(stdin, "<stdin>");
177 177 } }
178 178 } }
179
179 180 int main(int argc, char **argv) int main(int argc, char **argv)
180 181 { {
181 182 init(); init();
 
... ... int main(int argc, char **argv)
186 187 if (ignorederrors) { if (ignorederrors) {
187 188 printf("%d errors ignored\n", ignorederrors); printf("%d errors ignored\n", ignorederrors);
188 189 } }
189
190 190 return 0; return 0;
191 191 } else { } else {
192 192 if (haderrors) { if (haderrors) {
File misc.c changed (mode: 100644) (index 1fb8d1e..4b22c86)
... ... void checkmodulo(const struct typenode *a, const struct typenode *b)
500 500 bool snd = typeeq(pb, gInteger); bool snd = typeeq(pb, gInteger);
501 501
502 502 if(! fst && ! snd){ if(! fst && ! snd){
503 yyerrorex(semanticerror, "Both arguments of the modulo-operator must be integers");
503 yyerrorex(semanticerror, "Both arguments of the modulo-operator must be integers");
504 504 }else if(! fst){ }else if(! fst){
505 yyerrorex(semanticerror, "First argument of the modulo-operator must be an integer");
505 yyerrorex(semanticerror, "First argument of the modulo-operator must be an integer");
506 506 }else if(! snd){ }else if(! snd){
507 yyerrorex(semanticerror, "Second argument of the modulo-operator must be an integer");
507 yyerrorex(semanticerror, "Second argument of the modulo-operator must be an integer");
508 508 } }
509 509
510 510
Hints:
Before first commit, do not forget to setup your git environment:
git config --global user.name "your_name_here"
git config --global user.email "your@email_here"

Clone this repository using HTTP(S):
git clone https://rocketgit.com/user/vrtc/pjass

Clone this repository using ssh (do not forget to upload a key first):
git clone ssh://rocketgit@ssh.rocketgit.com/user/vrtc/pjass

Clone this repository using git:
git clone git://git.rocketgit.com/user/vrtc/pjass

You are allowed to anonymously push to this repository.
This means that your pushed commits will automatically be transformed into a merge request:
... clone the repository ...
... make some changes and some commits ...
git push origin main