/[jscoverage]/trunk/instrument-js.cpp
ViewVC logotype

Contents of /trunk/instrument-js.cpp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 369 - (show annotations)
Mon Oct 27 20:33:57 2008 UTC (9 years, 11 months ago) by siliconforks
Original Path: trunk/instrument-js.c
File MIME type: text/plain
File size: 51839 byte(s)
Handle versions specified as integers (`180') and decimal numbers (`1.8').
1 /*
2 instrument-js.c - JavaScript instrumentation routines
3 Copyright (C) 2007, 2008 siliconforks.com
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
18 */
19
20 #include <config.h>
21
22 #include "instrument-js.h"
23
24 #include <assert.h>
25 #include <stdlib.h>
26 #include <string.h>
27
28 #include <jsapi.h>
29 #include <jsarena.h>
30 #include <jsatom.h>
31 #include <jsemit.h>
32 #include <jsexn.h>
33 #include <jsfun.h>
34 #include <jsinterp.h>
35 #include <jsiter.h>
36 #include <jsparse.h>
37 #include <jsregexp.h>
38 #include <jsscope.h>
39 #include <jsstr.h>
40
41 #include "encoding.h"
42 #include "global.h"
43 #include "highlight.h"
44 #include "resource-manager.h"
45 #include "util.h"
46
47 struct IfDirective {
48 const jschar * condition_start;
49 const jschar * condition_end;
50 uint16_t start_line;
51 uint16_t end_line;
52 struct IfDirective * next;
53 };
54
55 bool jscoverage_mozilla = false;
56
57 static bool * exclusive_directives = NULL;
58
59 static JSRuntime * runtime = NULL;
60 static JSContext * context = NULL;
61 static JSObject * global = NULL;
62 static JSVersion js_version = JSVERSION_ECMA_3;
63
64 /*
65 JSParseNode objects store line numbers starting from 1.
66 The lines array stores line numbers starting from 0.
67 */
68 static const char * file_id = NULL;
69 static char * lines = NULL;
70 static uint16_t num_lines = 0;
71
72 void jscoverage_set_js_version(const char * version) {
73 js_version = JS_StringToVersion(version);
74 if (js_version != JSVERSION_UNKNOWN) {
75 return;
76 }
77
78 char * end;
79 js_version = (JSVersion) strtol(version, &end, 10);
80 if (end - version != strlen(version)) {
81 fatal("invalid version: %s", version);
82 }
83 }
84
85 void jscoverage_init(void) {
86 runtime = JS_NewRuntime(8L * 1024L * 1024L);
87 if (runtime == NULL) {
88 fatal("cannot create runtime");
89 }
90
91 context = JS_NewContext(runtime, 8192);
92 if (context == NULL) {
93 fatal("cannot create context");
94 }
95
96 JS_SetVersion(context, js_version);
97
98 global = JS_NewObject(context, NULL, NULL, NULL);
99 if (global == NULL) {
100 fatal("cannot create global object");
101 }
102
103 if (! JS_InitStandardClasses(context, global)) {
104 fatal("cannot initialize standard classes");
105 }
106 }
107
108 void jscoverage_cleanup(void) {
109 JS_DestroyContext(context);
110 JS_DestroyRuntime(runtime);
111 }
112
113 static void print_javascript(const jschar * characters, size_t num_characters, Stream * f) {
114 for (size_t i = 0; i < num_characters; i++) {
115 jschar c = characters[i];
116 /*
117 XXX does not handle no-break space, other unicode "space separator"
118 */
119 switch (c) {
120 case 0x9:
121 case 0xB:
122 case 0xC:
123 Stream_write_char(f, c);
124 break;
125 default:
126 if (32 <= c && c <= 126) {
127 Stream_write_char(f, c);
128 }
129 else {
130 Stream_printf(f, "\\u%04x", c);
131 }
132 break;
133 }
134 }
135 }
136
137 static void print_string(JSString * s, Stream * f) {
138 size_t length = JSSTRING_LENGTH(s);
139 jschar * characters = JSSTRING_CHARS(s);
140 for (size_t i = 0; i < length; i++) {
141 jschar c = characters[i];
142 if (32 <= c && c <= 126) {
143 switch (c) {
144 case '"':
145 Stream_write_string(f, "\\\"");
146 break;
147 /*
148 case '\'':
149 Stream_write_string(f, "\\'");
150 break;
151 */
152 case '\\':
153 Stream_write_string(f, "\\\\");
154 break;
155 default:
156 Stream_write_char(f, c);
157 break;
158 }
159 }
160 else {
161 switch (c) {
162 case 0x8:
163 Stream_write_string(f, "\\b");
164 break;
165 case 0x9:
166 Stream_write_string(f, "\\t");
167 break;
168 case 0xa:
169 Stream_write_string(f, "\\n");
170 break;
171 /* IE doesn't support this */
172 /*
173 case 0xb:
174 Stream_write_string(f, "\\v");
175 break;
176 */
177 case 0xc:
178 Stream_write_string(f, "\\f");
179 break;
180 case 0xd:
181 Stream_write_string(f, "\\r");
182 break;
183 default:
184 Stream_printf(f, "\\u%04x", c);
185 break;
186 }
187 }
188 }
189 }
190
191 static void print_string_atom(JSAtom * atom, Stream * f) {
192 assert(ATOM_IS_STRING(atom));
193 JSString * s = ATOM_TO_STRING(atom);
194 print_string(s, f);
195 }
196
197 static void print_regex(jsval value, Stream * f) {
198 assert(JSVAL_IS_STRING(value));
199 JSString * s = JSVAL_TO_STRING(value);
200 size_t length = JSSTRING_LENGTH(s);
201 jschar * characters = JSSTRING_CHARS(s);
202 for (size_t i = 0; i < length; i++) {
203 jschar c = characters[i];
204 if (32 <= c && c <= 126) {
205 Stream_write_char(f, c);
206 }
207 else {
208 Stream_printf(f, "\\u%04x", c);
209 }
210 }
211 }
212
213 static void print_quoted_string_atom(JSAtom * atom, Stream * f) {
214 assert(ATOM_IS_STRING(atom));
215 JSString * s = ATOM_TO_STRING(atom);
216 Stream_write_char(f, '"');
217 print_string(s, f);
218 Stream_write_char(f, '"');
219 }
220
221 static const char * get_op(uint8 op) {
222 switch(op) {
223 case JSOP_OR:
224 return "||";
225 case JSOP_AND:
226 return "&&";
227 case JSOP_BITOR:
228 return "|";
229 case JSOP_BITXOR:
230 return "^";
231 case JSOP_BITAND:
232 return "&";
233 case JSOP_EQ:
234 return "==";
235 case JSOP_NE:
236 return "!=";
237 case JSOP_STRICTEQ:
238 return "===";
239 case JSOP_STRICTNE:
240 return "!==";
241 case JSOP_LT:
242 return "<";
243 case JSOP_LE:
244 return "<=";
245 case JSOP_GT:
246 return ">";
247 case JSOP_GE:
248 return ">=";
249 case JSOP_LSH:
250 return "<<";
251 case JSOP_RSH:
252 return ">>";
253 case JSOP_URSH:
254 return ">>>";
255 case JSOP_ADD:
256 return "+";
257 case JSOP_SUB:
258 return "-";
259 case JSOP_MUL:
260 return "*";
261 case JSOP_DIV:
262 return "/";
263 case JSOP_MOD:
264 return "%";
265 default:
266 abort();
267 }
268 }
269
270 static void instrument_expression(JSParseNode * node, Stream * f);
271 static void instrument_statement(JSParseNode * node, Stream * f, int indent, bool is_jscoverage_if);
272 static void output_statement(JSParseNode * node, Stream * f, int indent, bool is_jscoverage_if);
273
274 enum FunctionType {
275 FUNCTION_NORMAL,
276 FUNCTION_GETTER_OR_SETTER
277 };
278
279 static void output_for_in(JSParseNode * node, Stream * f) {
280 assert(node->pn_type == TOK_FOR);
281 assert(node->pn_arity == PN_BINARY);
282 Stream_write_string(f, "for ");
283 if (node->pn_iflags & JSITER_FOREACH) {
284 Stream_write_string(f, "each ");
285 }
286 Stream_write_char(f, '(');
287 instrument_expression(node->pn_left, f);
288 Stream_write_char(f, ')');
289 }
290
291 static void output_array_comprehension_or_generator_expression(JSParseNode * node, Stream * f) {
292 assert(node->pn_type == TOK_LEXICALSCOPE);
293 assert(node->pn_arity == PN_NAME);
294 JSParseNode * for_node = node->pn_expr;
295 assert(for_node->pn_type == TOK_FOR);
296 assert(for_node->pn_arity == PN_BINARY);
297 JSParseNode * p = for_node;
298 while (p->pn_type == TOK_FOR) {
299 p = p->pn_right;
300 }
301 JSParseNode * if_node = NULL;
302 if (p->pn_type == TOK_IF) {
303 if_node = p;
304 assert(if_node->pn_arity == PN_TERNARY);
305 p = if_node->pn_kid2;
306 }
307 assert(p->pn_arity == PN_UNARY);
308 p = p->pn_kid;
309 if (p->pn_type == TOK_YIELD) {
310 /* for generator expressions */
311 p = p->pn_kid;
312 }
313
314 instrument_expression(p, f);
315 p = for_node;
316 while (p->pn_type == TOK_FOR) {
317 Stream_write_char(f, ' ');
318 output_for_in(p, f);
319 p = p->pn_right;
320 }
321 if (if_node) {
322 Stream_write_string(f, " if (");
323 instrument_expression(if_node->pn_kid1, f);
324 Stream_write_char(f, ')');
325 }
326 }
327
328 static void instrument_function(JSParseNode * node, Stream * f, int indent, enum FunctionType type) {
329 assert(node->pn_type == TOK_FUNCTION);
330 assert(node->pn_arity == PN_FUNC);
331 JSObject * object = node->pn_funpob->object;
332 assert(JS_ObjectIsFunction(context, object));
333 JSFunction * function = (JSFunction *) JS_GetPrivate(context, object);
334 assert(function);
335 assert(object == &function->object);
336 Stream_printf(f, "%*s", indent, "");
337 if (type == FUNCTION_NORMAL) {
338 Stream_write_string(f, "function");
339 }
340
341 /* function name */
342 if (function->atom) {
343 Stream_write_char(f, ' ');
344 print_string_atom(function->atom, f);
345 }
346
347 /*
348 function parameters - see JS_DecompileFunction in jsapi.cpp, which calls
349 js_DecompileFunction in jsopcode.cpp
350 */
351 Stream_write_string(f, "(");
352 JSArenaPool pool;
353 JS_INIT_ARENA_POOL(&pool, "instrument_function", 256, 1, &context->scriptStackQuota);
354 jsuword * local_names = NULL;
355 if (JS_GET_LOCAL_NAME_COUNT(function)) {
356 local_names = js_GetLocalNameArray(context, function, &pool);
357 if (local_names == NULL) {
358 fatal("out of memory");
359 }
360 }
361 for (int i = 0; i < function->nargs; i++) {
362 if (i > 0) {
363 Stream_write_string(f, ", ");
364 }
365 JSAtom * param = JS_LOCAL_NAME_TO_ATOM(local_names[i]);
366 if (param == NULL) {
367 fatal("unsupported parameter type for function: %s", file_id);
368 }
369 print_string_atom(param, f);
370 }
371 JS_FinishArenaPool(&pool);
372 Stream_write_string(f, ") {\n");
373
374 /* function body */
375 if (function->flags & JSFUN_EXPR_CLOSURE) {
376 /* expression closure */
377 output_statement(node->pn_body, f, indent + 2, false);
378 }
379 else {
380 instrument_statement(node->pn_body, f, indent + 2, false);
381 }
382
383 Stream_write_string(f, "}\n");
384 }
385
386 static void instrument_function_call(JSParseNode * node, Stream * f) {
387 JSParseNode * function_node = node->pn_head;
388 if (function_node->pn_type == TOK_FUNCTION) {
389 JSObject * object = function_node->pn_funpob->object;
390 assert(JS_ObjectIsFunction(context, object));
391 JSFunction * function = (JSFunction *) JS_GetPrivate(context, object);
392 assert(function);
393 assert(object == &function->object);
394
395 if (function_node->pn_flags & TCF_GENEXP_LAMBDA) {
396 /* it's a generator expression */
397 Stream_write_char(f, '(');
398 output_array_comprehension_or_generator_expression(function_node->pn_body, f);
399 Stream_write_char(f, ')');
400 return;
401 }
402 else {
403 Stream_write_char(f, '(');
404 instrument_expression(function_node, f);
405 Stream_write_char(f, ')');
406 }
407 }
408 else {
409 instrument_expression(function_node, f);
410 }
411 Stream_write_char(f, '(');
412 for (struct JSParseNode * p = function_node->pn_next; p != NULL; p = p->pn_next) {
413 if (p != node->pn_head->pn_next) {
414 Stream_write_string(f, ", ");
415 }
416 instrument_expression(p, f);
417 }
418 Stream_write_char(f, ')');
419 }
420
421 static void instrument_declarations(JSParseNode * list, Stream * f) {
422 assert(list->pn_arity == PN_LIST);
423 for (JSParseNode * p = list->pn_head; p != NULL; p = p->pn_next) {
424 switch (p->pn_type) {
425 case TOK_NAME:
426 assert(p->pn_arity == PN_NAME);
427 if (p != list->pn_head) {
428 Stream_write_string(f, ", ");
429 }
430 print_string_atom(p->pn_atom, f);
431 if (p->pn_expr != NULL) {
432 Stream_write_string(f, " = ");
433 instrument_expression(p->pn_expr, f);
434 }
435 break;
436 case TOK_ASSIGN:
437 case TOK_RB:
438 case TOK_RC:
439 /* destructuring */
440 instrument_expression(p, f);
441 break;
442 default:
443 abort();
444 break;
445 }
446 }
447 }
448
449 /*
450 See <Expressions> in jsparse.h.
451 TOK_FUNCTION is handled as a statement and as an expression.
452 TOK_DBLDOT is not handled (XML op).
453 TOK_DEFSHARP and TOK_USESHARP are not handled.
454 TOK_ANYNAME is not handled (XML op).
455 TOK_AT is not handled (XML op).
456 TOK_DBLCOLON is not handled.
457 TOK_XML* are not handled.
458 There seem to be some undocumented expressions:
459 TOK_INSTANCEOF binary
460 TOK_IN binary
461 */
462 static void instrument_expression(JSParseNode * node, Stream * f) {
463 switch (node->pn_type) {
464 case TOK_FUNCTION:
465 instrument_function(node, f, 0, FUNCTION_NORMAL);
466 break;
467 case TOK_COMMA:
468 for (struct JSParseNode * p = node->pn_head; p != NULL; p = p->pn_next) {
469 if (p != node->pn_head) {
470 Stream_write_string(f, ", ");
471 }
472 instrument_expression(p, f);
473 }
474 break;
475 case TOK_ASSIGN:
476 instrument_expression(node->pn_left, f);
477 Stream_write_char(f, ' ');
478 switch (node->pn_op) {
479 case JSOP_ADD:
480 case JSOP_SUB:
481 case JSOP_MUL:
482 case JSOP_MOD:
483 case JSOP_LSH:
484 case JSOP_RSH:
485 case JSOP_URSH:
486 case JSOP_BITAND:
487 case JSOP_BITOR:
488 case JSOP_BITXOR:
489 case JSOP_DIV:
490 Stream_printf(f, "%s", get_op(node->pn_op));
491 break;
492 default:
493 /* do nothing - it must be a simple assignment */
494 break;
495 }
496 Stream_write_string(f, "= ");
497 instrument_expression(node->pn_right, f);
498 break;
499 case TOK_HOOK:
500 instrument_expression(node->pn_kid1, f);
501 Stream_write_string(f, "? ");
502 instrument_expression(node->pn_kid2, f);
503 Stream_write_string(f, ": ");
504 instrument_expression(node->pn_kid3, f);
505 break;
506 case TOK_OR:
507 case TOK_AND:
508 case TOK_BITOR:
509 case TOK_BITXOR:
510 case TOK_BITAND:
511 case TOK_EQOP:
512 case TOK_RELOP:
513 case TOK_SHOP:
514 case TOK_PLUS:
515 case TOK_MINUS:
516 case TOK_STAR:
517 case TOK_DIVOP:
518 switch (node->pn_arity) {
519 case PN_BINARY:
520 instrument_expression(node->pn_left, f);
521 Stream_printf(f, " %s ", get_op(node->pn_op));
522 instrument_expression(node->pn_right, f);
523 break;
524 case PN_LIST:
525 for (struct JSParseNode * p = node->pn_head; p != NULL; p = p->pn_next) {
526 if (p != node->pn_head) {
527 Stream_printf(f, " %s ", get_op(node->pn_op));
528 }
529 instrument_expression(p, f);
530 }
531 break;
532 default:
533 abort();
534 }
535 break;
536 case TOK_UNARYOP:
537 switch (node->pn_op) {
538 case JSOP_NEG:
539 Stream_write_char(f, '-');
540 instrument_expression(node->pn_kid, f);
541 break;
542 case JSOP_POS:
543 Stream_write_char(f, '+');
544 instrument_expression(node->pn_kid, f);
545 break;
546 case JSOP_NOT:
547 Stream_write_char(f, '!');
548 instrument_expression(node->pn_kid, f);
549 break;
550 case JSOP_BITNOT:
551 Stream_write_char(f, '~');
552 instrument_expression(node->pn_kid, f);
553 break;
554 case JSOP_TYPEOF:
555 Stream_write_string(f, "typeof ");
556 instrument_expression(node->pn_kid, f);
557 break;
558 case JSOP_VOID:
559 Stream_write_string(f, "void ");
560 instrument_expression(node->pn_kid, f);
561 break;
562 default:
563 fatal("%s: unknown operator (%d) in file", file_id, node->pn_op);
564 break;
565 }
566 break;
567 case TOK_INC:
568 case TOK_DEC:
569 /*
570 This is not documented, but node->pn_op tells whether it is pre- or post-increment.
571 */
572 switch (node->pn_op) {
573 case JSOP_INCNAME:
574 case JSOP_INCPROP:
575 case JSOP_INCELEM:
576 Stream_write_string(f, "++");
577 instrument_expression(node->pn_kid, f);
578 break;
579 case JSOP_DECNAME:
580 case JSOP_DECPROP:
581 case JSOP_DECELEM:
582 Stream_write_string(f, "--");
583 instrument_expression(node->pn_kid, f);
584 break;
585 case JSOP_NAMEINC:
586 case JSOP_PROPINC:
587 case JSOP_ELEMINC:
588 instrument_expression(node->pn_kid, f);
589 Stream_write_string(f, "++");
590 break;
591 case JSOP_NAMEDEC:
592 case JSOP_PROPDEC:
593 case JSOP_ELEMDEC:
594 instrument_expression(node->pn_kid, f);
595 Stream_write_string(f, "--");
596 break;
597 default:
598 abort();
599 break;
600 }
601 break;
602 case TOK_NEW:
603 Stream_write_string(f, "new ");
604 instrument_function_call(node, f);
605 break;
606 case TOK_DELETE:
607 Stream_write_string(f, "delete ");
608 instrument_expression(node->pn_kid, f);
609 break;
610 case TOK_DOT:
611 /*
612 This may have originally been x['foo-bar']. Because the string 'foo-bar'
613 contains illegal characters, we have to use the subscript syntax instead of
614 the dot syntax.
615 */
616 instrument_expression(node->pn_expr, f);
617 assert(ATOM_IS_STRING(node->pn_atom));
618 {
619 JSString * s = ATOM_TO_STRING(node->pn_atom);
620 bool must_quote;
621 if (JSSTRING_LENGTH(s) == 0) {
622 must_quote = true;
623 }
624 else if (js_CheckKeyword(JSSTRING_CHARS(s), JSSTRING_LENGTH(s)) != TOK_EOF) {
625 must_quote = true;
626 }
627 else if (! js_IsIdentifier(s)) {
628 must_quote = true;
629 }
630 else {
631 must_quote = false;
632 }
633 if (must_quote) {
634 Stream_write_char(f, '[');
635 print_quoted_string_atom(node->pn_atom, f);
636 Stream_write_char(f, ']');
637 }
638 else {
639 Stream_write_char(f, '.');
640 print_string_atom(node->pn_atom, f);
641 }
642 }
643 break;
644 case TOK_LB:
645 instrument_expression(node->pn_left, f);
646 Stream_write_char(f, '[');
647 instrument_expression(node->pn_right, f);
648 Stream_write_char(f, ']');
649 break;
650 case TOK_LP:
651 instrument_function_call(node, f);
652 break;
653 case TOK_RB:
654 Stream_write_char(f, '[');
655 for (struct JSParseNode * p = node->pn_head; p != NULL; p = p->pn_next) {
656 if (p != node->pn_head) {
657 Stream_write_string(f, ", ");
658 }
659 /* TOK_COMMA is a special case: a hole in the array */
660 if (p->pn_type != TOK_COMMA) {
661 instrument_expression(p, f);
662 }
663 }
664 if (node->pn_extra == PNX_ENDCOMMA) {
665 Stream_write_char(f, ',');
666 }
667 Stream_write_char(f, ']');
668 break;
669 case TOK_RC:
670 Stream_write_char(f, '{');
671 for (struct JSParseNode * p = node->pn_head; p != NULL; p = p->pn_next) {
672 if (p->pn_type != TOK_COLON) {
673 fatal("unsupported node type in file %s: %d", file_id, p->pn_type);
674 }
675 if (p != node->pn_head) {
676 Stream_write_string(f, ", ");
677 }
678
679 /* check whether this is a getter or setter */
680 switch (p->pn_op) {
681 case JSOP_GETTER:
682 case JSOP_SETTER:
683 if (p->pn_op == JSOP_GETTER) {
684 Stream_write_string(f, "get ");
685 }
686 else {
687 Stream_write_string(f, "set ");
688 }
689 instrument_expression(p->pn_left, f);
690 if (p->pn_right->pn_type != TOK_FUNCTION) {
691 fatal("parse error: expected function");
692 }
693 instrument_function(p->pn_right, f, 0, FUNCTION_GETTER_OR_SETTER);
694 break;
695 default:
696 instrument_expression(p->pn_left, f);
697 Stream_write_string(f, ": ");
698 instrument_expression(p->pn_right, f);
699 break;
700 }
701 }
702 Stream_write_char(f, '}');
703 break;
704 case TOK_RP:
705 Stream_write_char(f, '(');
706 instrument_expression(node->pn_kid, f);
707 Stream_write_char(f, ')');
708 break;
709 case TOK_NAME:
710 print_string_atom(node->pn_atom, f);
711 break;
712 case TOK_STRING:
713 print_quoted_string_atom(node->pn_atom, f);
714 break;
715 case TOK_REGEXP:
716 assert(node->pn_op == JSOP_REGEXP);
717 {
718 JSObject * object = node->pn_pob->object;
719 jsval result;
720 js_regexp_toString(context, object, &result);
721 print_regex(result, f);
722 }
723 break;
724 case TOK_NUMBER:
725 /*
726 A 64-bit IEEE 754 floating point number has a 52-bit fraction.
727 2^(-52) = 2.22 x 10^(-16)
728 Thus there are 16 significant digits.
729 To keep the output simple, special-case zero.
730 */
731 if (node->pn_dval == 0.0) {
732 Stream_write_string(f, "0");
733 }
734 else {
735 Stream_printf(f, "%.15g", node->pn_dval);
736 }
737 break;
738 case TOK_PRIMARY:
739 switch (node->pn_op) {
740 case JSOP_TRUE:
741 Stream_write_string(f, "true");
742 break;
743 case JSOP_FALSE:
744 Stream_write_string(f, "false");
745 break;
746 case JSOP_NULL:
747 Stream_write_string(f, "null");
748 break;
749 case JSOP_THIS:
750 Stream_write_string(f, "this");
751 break;
752 /* jsscan.h mentions `super' ??? */
753 default:
754 abort();
755 }
756 break;
757 case TOK_INSTANCEOF:
758 instrument_expression(node->pn_left, f);
759 Stream_write_string(f, " instanceof ");
760 instrument_expression(node->pn_right, f);
761 break;
762 case TOK_IN:
763 instrument_expression(node->pn_left, f);
764 Stream_write_string(f, " in ");
765 instrument_expression(node->pn_right, f);
766 break;
767 case TOK_LEXICALSCOPE:
768 assert(node->pn_arity == PN_NAME);
769 assert(node->pn_expr->pn_type == TOK_LET);
770 assert(node->pn_expr->pn_arity == PN_BINARY);
771 Stream_write_string(f, "let(");
772 assert(node->pn_expr->pn_left->pn_type == TOK_LP);
773 assert(node->pn_expr->pn_left->pn_arity == PN_LIST);
774 instrument_declarations(node->pn_expr->pn_left, f);
775 Stream_write_string(f, ") ");
776 instrument_expression(node->pn_expr->pn_right, f);
777 break;
778 case TOK_YIELD:
779 assert(node->pn_arity == PN_UNARY);
780 Stream_write_string(f, "yield");
781 if (node->pn_kid != NULL) {
782 Stream_write_char(f, ' ');
783 instrument_expression(node->pn_kid, f);
784 }
785 break;
786 case TOK_ARRAYCOMP:
787 assert(node->pn_arity == PN_LIST);
788 {
789 JSParseNode * block_node;
790 switch (node->pn_count) {
791 case 1:
792 block_node = node->pn_head;
793 break;
794 case 2:
795 block_node = node->pn_head->pn_next;
796 break;
797 default:
798 abort();
799 break;
800 }
801 Stream_write_char(f, '[');
802 output_array_comprehension_or_generator_expression(block_node, f);
803 Stream_write_char(f, ']');
804 }
805 break;
806 case TOK_VAR:
807 assert(node->pn_arity == PN_LIST);
808 Stream_write_string(f, "var ");
809 instrument_declarations(node, f);
810 break;
811 case TOK_LET:
812 assert(node->pn_arity == PN_LIST);
813 Stream_write_string(f, "let ");
814 instrument_declarations(node, f);
815 break;
816 default:
817 fatal("unsupported node type in file %s: %d", file_id, node->pn_type);
818 }
819 }
820
821 static void output_statement(JSParseNode * node, Stream * f, int indent, bool is_jscoverage_if) {
822 switch (node->pn_type) {
823 case TOK_FUNCTION:
824 instrument_function(node, f, indent, FUNCTION_NORMAL);
825 break;
826 case TOK_LC:
827 assert(node->pn_arity == PN_LIST);
828 /*
829 Stream_write_string(f, "{\n");
830 */
831 for (struct JSParseNode * p = node->pn_u.list.head; p != NULL; p = p->pn_next) {
832 instrument_statement(p, f, indent, false);
833 }
834 /*
835 Stream_printf(f, "%*s", indent, "");
836 Stream_write_string(f, "}\n");
837 */
838 break;
839 case TOK_IF:
840 {
841 assert(node->pn_arity == PN_TERNARY);
842
843 uint16_t line = node->pn_pos.begin.lineno;
844 if (! is_jscoverage_if) {
845 if (line > num_lines) {
846 fatal("%s: script contains more than 65,535 lines", file_id);
847 }
848 if (line >= 2 && exclusive_directives[line - 2]) {
849 is_jscoverage_if = true;
850 }
851 }
852
853 Stream_printf(f, "%*s", indent, "");
854 Stream_write_string(f, "if (");
855 instrument_expression(node->pn_kid1, f);
856 Stream_write_string(f, ") {\n");
857 if (is_jscoverage_if && node->pn_kid3) {
858 uint16_t else_start = node->pn_kid3->pn_pos.begin.lineno;
859 uint16_t else_end = node->pn_kid3->pn_pos.end.lineno + 1;
860 Stream_printf(f, "%*s", indent + 2, "");
861 Stream_printf(f, "_$jscoverage['%s'].conditionals[%d] = %d;\n", file_id, else_start, else_end);
862 }
863 instrument_statement(node->pn_kid2, f, indent + 2, false);
864 Stream_printf(f, "%*s", indent, "");
865 Stream_write_string(f, "}\n");
866
867 if (node->pn_kid3 || is_jscoverage_if) {
868 Stream_printf(f, "%*s", indent, "");
869 Stream_write_string(f, "else {\n");
870
871 if (is_jscoverage_if) {
872 uint16_t if_start = node->pn_kid2->pn_pos.begin.lineno + 1;
873 uint16_t if_end = node->pn_kid2->pn_pos.end.lineno + 1;
874 Stream_printf(f, "%*s", indent + 2, "");
875 Stream_printf(f, "_$jscoverage['%s'].conditionals[%d] = %d;\n", file_id, if_start, if_end);
876 }
877
878 if (node->pn_kid3) {
879 instrument_statement(node->pn_kid3, f, indent + 2, is_jscoverage_if);
880 }
881
882 Stream_printf(f, "%*s", indent, "");
883 Stream_write_string(f, "}\n");
884 }
885
886 break;
887 }
888 case TOK_SWITCH:
889 assert(node->pn_arity == PN_BINARY);
890 Stream_printf(f, "%*s", indent, "");
891 Stream_write_string(f, "switch (");
892 instrument_expression(node->pn_left, f);
893 Stream_write_string(f, ") {\n");
894 {
895 JSParseNode * list = node->pn_right;
896 if (list->pn_type == TOK_LEXICALSCOPE) {
897 list = list->pn_expr;
898 }
899 for (struct JSParseNode * p = list->pn_head; p != NULL; p = p->pn_next) {
900 Stream_printf(f, "%*s", indent, "");
901 switch (p->pn_type) {
902 case TOK_CASE:
903 Stream_write_string(f, "case ");
904 instrument_expression(p->pn_left, f);
905 Stream_write_string(f, ":\n");
906 break;
907 case TOK_DEFAULT:
908 Stream_write_string(f, "default:\n");
909 break;
910 default:
911 abort();
912 break;
913 }
914 instrument_statement(p->pn_right, f, indent + 2, false);
915 }
916 }
917 Stream_printf(f, "%*s", indent, "");
918 Stream_write_string(f, "}\n");
919 break;
920 case TOK_CASE:
921 case TOK_DEFAULT:
922 abort();
923 break;
924 case TOK_WHILE:
925 assert(node->pn_arity == PN_BINARY);
926 Stream_printf(f, "%*s", indent, "");
927 Stream_write_string(f, "while (");
928 instrument_expression(node->pn_left, f);
929 Stream_write_string(f, ") {\n");
930 instrument_statement(node->pn_right, f, indent + 2, false);
931 Stream_write_string(f, "}\n");
932 break;
933 case TOK_DO:
934 assert(node->pn_arity == PN_BINARY);
935 Stream_printf(f, "%*s", indent, "");
936 Stream_write_string(f, "do {\n");
937 instrument_statement(node->pn_left, f, indent + 2, false);
938 Stream_write_string(f, "}\n");
939 Stream_printf(f, "%*s", indent, "");
940 Stream_write_string(f, "while (");
941 instrument_expression(node->pn_right, f);
942 Stream_write_string(f, ");\n");
943 break;
944 case TOK_FOR:
945 assert(node->pn_arity == PN_BINARY);
946 Stream_printf(f, "%*s", indent, "");
947 switch (node->pn_left->pn_type) {
948 case TOK_IN:
949 /* for/in */
950 assert(node->pn_left->pn_arity == PN_BINARY);
951 output_for_in(node, f);
952 break;
953 case TOK_RESERVED:
954 /* for (;;) */
955 assert(node->pn_left->pn_arity == PN_TERNARY);
956 Stream_write_string(f, "for (");
957 if (node->pn_left->pn_kid1) {
958 instrument_expression(node->pn_left->pn_kid1, f);
959 }
960 Stream_write_string(f, ";");
961 if (node->pn_left->pn_kid2) {
962 Stream_write_char(f, ' ');
963 instrument_expression(node->pn_left->pn_kid2, f);
964 }
965 Stream_write_string(f, ";");
966 if (node->pn_left->pn_kid3) {
967 Stream_write_char(f, ' ');
968 instrument_expression(node->pn_left->pn_kid3, f);
969 }
970 Stream_write_char(f, ')');
971 break;
972 default:
973 abort();
974 break;
975 }
976 Stream_write_string(f, " {\n");
977 instrument_statement(node->pn_right, f, indent + 2, false);
978 Stream_write_string(f, "}\n");
979 break;
980 case TOK_THROW:
981 assert(node->pn_arity == PN_UNARY);
982 Stream_printf(f, "%*s", indent, "");
983 Stream_write_string(f, "throw ");
984 instrument_expression(node->pn_u.unary.kid, f);
985 Stream_write_string(f, ";\n");
986 break;
987 case TOK_TRY:
988 Stream_printf(f, "%*s", indent, "");
989 Stream_write_string(f, "try {\n");
990 instrument_statement(node->pn_kid1, f, indent + 2, false);
991 Stream_printf(f, "%*s", indent, "");
992 Stream_write_string(f, "}\n");
993 if (node->pn_kid2) {
994 assert(node->pn_kid2->pn_type == TOK_RESERVED);
995 for (JSParseNode * scope = node->pn_kid2->pn_head; scope != NULL; scope = scope->pn_next) {
996 assert(scope->pn_type == TOK_LEXICALSCOPE);
997 JSParseNode * catch = scope->pn_expr;
998 assert(catch->pn_type == TOK_CATCH);
999 Stream_printf(f, "%*s", indent, "");
1000 Stream_write_string(f, "catch (");
1001 /* this may not be a name - destructuring assignment */
1002 /*
1003 assert(catch->pn_kid1->pn_arity == PN_NAME);
1004 print_string_atom(catch->pn_kid1->pn_atom, f);
1005 */
1006 instrument_expression(catch->pn_kid1, f);
1007 if (catch->pn_kid2) {
1008 Stream_write_string(f, " if ");
1009 instrument_expression(catch->pn_kid2, f);
1010 }
1011 Stream_write_string(f, ") {\n");
1012 instrument_statement(catch->pn_kid3, f, indent + 2, false);
1013 Stream_printf(f, "%*s", indent, "");
1014 Stream_write_string(f, "}\n");
1015 }
1016 }
1017 if (node->pn_kid3) {
1018 Stream_printf(f, "%*s", indent, "");
1019 Stream_write_string(f, "finally {\n");
1020 instrument_statement(node->pn_kid3, f, indent + 2, false);
1021 Stream_printf(f, "%*s", indent, "");
1022 Stream_write_string(f, "}\n");
1023 }
1024 break;
1025 case TOK_CATCH:
1026 abort();
1027 break;
1028 case TOK_BREAK:
1029 case TOK_CONTINUE:
1030 assert(node->pn_arity == PN_NAME || node->pn_arity == PN_NULLARY);
1031 Stream_printf(f, "%*s", indent, "");
1032 Stream_write_string(f, node->pn_type == TOK_BREAK? "break": "continue");
1033 JSAtom * atom = node->pn_u.name.atom;
1034 if (atom != NULL) {
1035 Stream_write_char(f, ' ');
1036 print_string_atom(node->pn_atom, f);
1037 }
1038 Stream_write_string(f, ";\n");
1039 break;
1040 case TOK_WITH:
1041 assert(node->pn_arity == PN_BINARY);
1042 Stream_printf(f, "%*s", indent, "");
1043 Stream_write_string(f, "with (");
1044 instrument_expression(node->pn_left, f);
1045 Stream_write_string(f, ") {\n");
1046 instrument_statement(node->pn_right, f, indent + 2, false);
1047 Stream_printf(f, "%*s", indent, "");
1048 Stream_write_string(f, "}\n");
1049 break;
1050 case TOK_VAR:
1051 Stream_printf(f, "%*s", indent, "");
1052 instrument_expression(node, f);
1053 Stream_write_string(f, ";\n");
1054 break;
1055 case TOK_RETURN:
1056 assert(node->pn_arity == PN_UNARY);
1057 Stream_printf(f, "%*s", indent, "");
1058 Stream_write_string(f, "return");
1059 if (node->pn_kid != NULL) {
1060 Stream_write_char(f, ' ');
1061 instrument_expression(node->pn_kid, f);
1062 }
1063 Stream_write_string(f, ";\n");
1064 break;
1065 case TOK_SEMI:
1066 assert(node->pn_arity == PN_UNARY);
1067 Stream_printf(f, "%*s", indent, "");
1068 if (node->pn_kid != NULL) {
1069 instrument_expression(node->pn_kid, f);
1070 }
1071 Stream_write_string(f, ";\n");
1072 break;
1073 case TOK_COLON:
1074 assert(node->pn_arity == PN_NAME);
1075 /*
1076 This one is tricky: can't output instrumentation between the label and the
1077 statement it's supposed to label ...
1078 */
1079 Stream_printf(f, "%*s", indent < 2? 0: indent - 2, "");
1080 print_string_atom(node->pn_atom, f);
1081 Stream_write_string(f, ":\n");
1082 /*
1083 ... use output_statement instead of instrument_statement.
1084 */
1085 output_statement(node->pn_expr, f, indent, false);
1086 break;
1087 case TOK_LEXICALSCOPE:
1088 /* let statement */
1089 assert(node->pn_arity == PN_NAME);
1090 switch (node->pn_expr->pn_type) {
1091 case TOK_LET:
1092 /* let statement */
1093 assert(node->pn_expr->pn_arity == PN_BINARY);
1094 instrument_statement(node->pn_expr, f, indent, false);
1095 break;
1096 case TOK_LC:
1097 /* block */
1098 Stream_printf(f, "%*s", indent, "");
1099 Stream_write_string(f, "{\n");
1100 instrument_statement(node->pn_expr, f, indent + 2, false);
1101 Stream_printf(f, "%*s", indent, "");
1102 Stream_write_string(f, "}\n");
1103 break;
1104 case TOK_FOR:
1105 instrument_statement(node->pn_expr, f, indent, false);
1106 break;
1107 default:
1108 abort();
1109 break;
1110 }
1111 break;
1112 case TOK_LET:
1113 switch (node->pn_arity) {
1114 case PN_BINARY:
1115 /* let statement */
1116 Stream_printf(f, "%*s", indent, "");
1117 Stream_write_string(f, "let (");
1118 assert(node->pn_left->pn_type == TOK_LP);
1119 assert(node->pn_left->pn_arity == PN_LIST);
1120 instrument_declarations(node->pn_left, f);
1121 Stream_write_string(f, ") {\n");
1122 instrument_statement(node->pn_right, f, indent + 2, false);
1123 Stream_printf(f, "%*s", indent, "");
1124 Stream_write_string(f, "}\n");
1125 break;
1126 case PN_LIST:
1127 /* let definition */
1128 Stream_printf(f, "%*s", indent, "");
1129 instrument_expression(node, f);
1130 Stream_write_string(f, ";\n");
1131 break;
1132 default:
1133 abort();
1134 break;
1135 }
1136 break;
1137 case TOK_DEBUGGER:
1138 Stream_printf(f, "%*s", indent, "");
1139 Stream_write_string(f, "debugger;\n");
1140 break;
1141 default:
1142 fatal("unsupported node type in file %s: %d", file_id, node->pn_type);
1143 }
1144 }
1145
1146 /*
1147 See <Statements> in jsparse.h.
1148 TOK_FUNCTION is handled as a statement and as an expression.
1149 TOK_EXPORT, TOK_IMPORT are not handled.
1150 */
1151 static void instrument_statement(JSParseNode * node, Stream * f, int indent, bool is_jscoverage_if) {
1152 if (node->pn_type != TOK_LC && node->pn_type != TOK_LEXICALSCOPE) {
1153 uint16_t line = node->pn_pos.begin.lineno;
1154 if (line > num_lines) {
1155 fatal("%s: script contains more than 65,535 lines", file_id);
1156 }
1157
1158 /* the root node has line number 0 */
1159 if (line != 0) {
1160 Stream_printf(f, "%*s", indent, "");
1161 Stream_printf(f, "_$jscoverage['%s'][%d]++;\n", file_id, line);
1162 lines[line - 1] = 1;
1163 }
1164 }
1165 output_statement(node, f, indent, is_jscoverage_if);
1166 }
1167
1168 static bool characters_start_with(const jschar * characters, size_t line_start, size_t line_end, const char * prefix) {
1169 const jschar * characters_end = characters + line_end;
1170 const jschar * cp = characters + line_start;
1171 const char * bp = prefix;
1172 for (;;) {
1173 if (*bp == '\0') {
1174 return true;
1175 }
1176 else if (cp == characters_end) {
1177 return false;
1178 }
1179 else if (*cp != *bp) {
1180 return false;
1181 }
1182 bp++;
1183 cp++;
1184 }
1185 }
1186
1187 static bool characters_are_white_space(const jschar * characters, size_t line_start, size_t line_end) {
1188 /* XXX - other Unicode space */
1189 const jschar * end = characters + line_end;
1190 for (const jschar * p = characters + line_start; p < end; p++) {
1191 jschar c = *p;
1192 if (c == 0x9 || c == 0xB || c == 0xC || c == 0x20 || c == 0xA0) {
1193 continue;
1194 }
1195 else {
1196 return false;
1197 }
1198 }
1199 return true;
1200 }
1201
1202 static void error_reporter(JSContext * context, const char * message, JSErrorReport * report) {
1203 fprintf(stderr, "jscoverage: parse error: line %u: %s\n", report->lineno, message);
1204 }
1205
1206 void jscoverage_instrument_js(const char * id, const uint16_t * characters, size_t num_characters, Stream * output) {
1207 file_id = id;
1208
1209 /* parse the javascript */
1210 JSParseContext parse_context;
1211 if (! js_InitParseContext(context, &parse_context, NULL, NULL, characters, num_characters, NULL, NULL, 1)) {
1212 fatal("cannot create token stream from file: %s", file_id);
1213 }
1214 JSErrorReporter old_error_reporter = JS_SetErrorReporter(context, error_reporter);
1215 JSParseNode * node = js_ParseScript(context, global, &parse_context);
1216 if (node == NULL) {
1217 js_ReportUncaughtException(context);
1218 fatal("parse error in file: %s", file_id);
1219 }
1220 JS_SetErrorReporter(context, old_error_reporter);
1221 num_lines = node->pn_pos.end.lineno;
1222 lines = xmalloc(num_lines);
1223 for (unsigned int i = 0; i < num_lines; i++) {
1224 lines[i] = 0;
1225 }
1226
1227 /* search code for conditionals */
1228 exclusive_directives = xnew(bool, num_lines);
1229 for (unsigned int i = 0; i < num_lines; i++) {
1230 exclusive_directives[i] = false;
1231 }
1232
1233 bool has_conditionals = false;
1234 struct IfDirective * if_directives = NULL;
1235 size_t line_number = 0;
1236 size_t i = 0;
1237 while (i < num_characters) {
1238 if (line_number == UINT16_MAX) {
1239 fatal("%s: script has more than 65,535 lines", file_id);
1240 }
1241 line_number++;
1242 size_t line_start = i;
1243 jschar c;
1244 bool done = false;
1245 while (! done && i < num_characters) {
1246 c = characters[i];
1247 switch (c) {
1248 case '\r':
1249 case '\n':
1250 case 0x2028:
1251 case 0x2029:
1252 done = true;
1253 break;
1254 default:
1255 i++;
1256 }
1257 }
1258 size_t line_end = i;
1259 if (i < num_characters) {
1260 i++;
1261 if (c == '\r' && i < num_characters && characters[i] == '\n') {
1262 i++;
1263 }
1264 }
1265
1266 if (characters_start_with(characters, line_start, line_end, "//#JSCOVERAGE_IF")) {
1267 has_conditionals = true;
1268
1269 if (characters_are_white_space(characters, line_start + 16, line_end)) {
1270 exclusive_directives[line_number - 1] = true;
1271 }
1272 else {
1273 struct IfDirective * if_directive = xnew(struct IfDirective, 1);
1274 if_directive->condition_start = characters + line_start + 16;
1275 if_directive->condition_end = characters + line_end;
1276 if_directive->start_line = line_number;
1277 if_directive->end_line = 0;
1278 if_directive->next = if_directives;
1279 if_directives = if_directive;
1280 }
1281 }
1282 else if (characters_start_with(characters, line_start, line_end, "//#JSCOVERAGE_ENDIF")) {
1283 for (struct IfDirective * p = if_directives; p != NULL; p = p->next) {
1284 if (p->end_line == 0) {
1285 p->end_line = line_number;
1286 break;
1287 }
1288 }
1289 }
1290 }
1291
1292 /*
1293 An instrumented JavaScript file has 4 sections:
1294 1. initialization
1295 2. instrumented source code
1296 3. conditionals
1297 4. original source code
1298 */
1299
1300 Stream * instrumented = Stream_new(0);
1301 instrument_statement(node, instrumented, 0, false);
1302 js_FinishParseContext(context, &parse_context);
1303
1304 /* write line number info to the output */
1305 Stream_write_string(output, "/* automatically generated by JSCoverage - do not edit */\n");
1306 if (jscoverage_mozilla) {
1307 Stream_write_string(output, "try {\n");
1308 Stream_write_string(output, " Components.utils.import('resource://gre/modules/jscoverage.jsm');\n");
1309 Stream_printf(output, " dump('%s: successfully imported jscoverage module\\n');\n", id);
1310 Stream_write_string(output, "}\n");
1311 Stream_write_string(output, "catch (e) {\n");
1312 Stream_write_string(output, " _$jscoverage = {};\n");
1313 Stream_printf(output, " dump('%s: failed to import jscoverage module - coverage not available for this file\\n');\n", id);
1314 Stream_write_string(output, "}\n");
1315 }
1316 else {
1317 Stream_write_string(output, "if (! top._$jscoverage) {\n top._$jscoverage = {};\n}\n");
1318 Stream_write_string(output, "var _$jscoverage = top._$jscoverage;\n");
1319 }
1320 Stream_printf(output, "if (! _$jscoverage['%s']) {\n", file_id);
1321 Stream_printf(output, " _$jscoverage['%s'] = [];\n", file_id);
1322 for (int i = 0; i < num_lines; i++) {
1323 if (lines[i]) {
1324 Stream_printf(output, " _$jscoverage['%s'][%d] = 0;\n", file_id, i + 1);
1325 }
1326 }
1327 Stream_write_string(output, "}\n");
1328 free(lines);
1329 lines = NULL;
1330 free(exclusive_directives);
1331 exclusive_directives = NULL;
1332
1333 /* conditionals */
1334 if (has_conditionals) {
1335 Stream_printf(output, "_$jscoverage['%s'].conditionals = [];\n", file_id);
1336 }
1337
1338 /* copy the instrumented source code to the output */
1339 Stream_write(output, instrumented->data, instrumented->length);
1340
1341 /* conditionals */
1342 for (struct IfDirective * if_directive = if_directives; if_directive != NULL; if_directive = if_directive->next) {
1343 Stream_write_string(output, "if (!(");
1344 print_javascript(if_directive->condition_start, if_directive->condition_end - if_directive->condition_start, output);
1345 Stream_write_string(output, ")) {\n");
1346 Stream_printf(output, " _$jscoverage['%s'].conditionals[%d] = %d;\n", file_id, if_directive->start_line, if_directive->end_line);
1347 Stream_write_string(output, "}\n");
1348 }
1349
1350 /* free */
1351 while (if_directives != NULL) {
1352 struct IfDirective * if_directive = if_directives;
1353 if_directives = if_directives->next;
1354 free(if_directive);
1355 }
1356
1357 /* copy the original source to the output */
1358 Stream_printf(output, "_$jscoverage['%s'].source = ", file_id);
1359 jscoverage_write_source(id, characters, num_characters, output);
1360 Stream_printf(output, ";\n");
1361
1362 Stream_delete(instrumented);
1363
1364 file_id = NULL;
1365 }
1366
1367 void jscoverage_write_source(const char * id, const jschar * characters, size_t num_characters, Stream * output) {
1368 Stream_write_string(output, "[");
1369 if (jscoverage_highlight) {
1370 Stream * highlighted_stream = Stream_new(num_characters);
1371 jscoverage_highlight_js(context, id, characters, num_characters, highlighted_stream);
1372 size_t i = 0;
1373 while (i < highlighted_stream->length) {
1374 if (i > 0) {
1375 Stream_write_char(output, ',');
1376 }
1377
1378 Stream_write_char(output, '"');
1379 bool done = false;
1380 while (! done) {
1381 char c = highlighted_stream->data[i];
1382 switch (c) {
1383 case 0x8:
1384 /* backspace */
1385 Stream_write_string(output, "\\b");
1386 break;
1387 case 0x9:
1388 /* horizontal tab */
1389 Stream_write_string(output, "\\t");
1390 break;
1391 case 0xa:
1392 /* line feed (new line) */
1393 done = true;
1394 break;
1395 /* IE doesn't support this */
1396 /*
1397 case 0xb:
1398 Stream_write_string(output, "\\v");
1399 break;
1400 */
1401 case 0xc:
1402 /* form feed */
1403 Stream_write_string(output, "\\f");
1404 break;
1405 case 0xd:
1406 /* carriage return */
1407 done = true;
1408 if (i + 1 < highlighted_stream->length && highlighted_stream->data[i + 1] == '\n') {
1409 i++;
1410 }
1411 break;
1412 case '"':
1413 Stream_write_string(output, "\\\"");
1414 break;
1415 case '\\':
1416 Stream_write_string(output, "\\\\");
1417 break;
1418 default:
1419 Stream_write_char(output, c);
1420 break;
1421 }
1422 i++;
1423 if (i >= highlighted_stream->length) {
1424 done = true;
1425 }
1426 }
1427 Stream_write_char(output, '"');
1428 }
1429 Stream_delete(highlighted_stream);
1430 }
1431 else {
1432 size_t i = 0;
1433 while (i < num_characters) {
1434 if (i > 0) {
1435 Stream_write_char(output, ',');
1436 }
1437
1438 Stream_write_char(output, '"');
1439 bool done = false;
1440 while (! done) {
1441 jschar c = characters[i];
1442 switch (c) {
1443 case 0x8:
1444 /* backspace */
1445 Stream_write_string(output, "\\b");
1446 break;
1447 case 0x9:
1448 /* horizontal tab */
1449 Stream_write_string(output, "\\t");
1450 break;
1451 case 0xa:
1452 /* line feed (new line) */
1453 done = true;
1454 break;
1455 /* IE doesn't support this */
1456 /*
1457 case 0xb:
1458 Stream_write_string(output, "\\v");
1459 break;
1460 */
1461 case 0xc:
1462 /* form feed */
1463 Stream_write_string(output, "\\f");
1464 break;
1465 case 0xd:
1466 /* carriage return */
1467 done = true;
1468 if (i + 1 < num_characters && characters[i + 1] == '\n') {
1469 i++;
1470 }
1471 break;
1472 case '"':
1473 Stream_write_string(output, "\\\"");
1474 break;
1475 case '\\':
1476 Stream_write_string(output, "\\\\");
1477 break;
1478 case '&':
1479 Stream_write_string(output, "&amp;");
1480 break;
1481 case '<':
1482 Stream_write_string(output, "&lt;");
1483 break;
1484 case '>':
1485 Stream_write_string(output, "&gt;");
1486 break;
1487 case 0x2028:
1488 case 0x2029:
1489 done = true;
1490 break;
1491 default:
1492 if (32 <= c && c <= 126) {
1493 Stream_write_char(output, c);
1494 }
1495 else {
1496 Stream_printf(output, "&#%d;", c);
1497 }
1498 break;
1499 }
1500 i++;
1501 if (i >= num_characters) {
1502 done = true;
1503 }
1504 }
1505 Stream_write_char(output, '"');
1506 }
1507 }
1508 Stream_write_string(output, "]");
1509 }
1510
1511 void jscoverage_copy_resources(const char * destination_directory) {
1512 copy_resource("jscoverage.html", destination_directory);
1513 copy_resource("jscoverage.css", destination_directory);
1514 copy_resource("jscoverage.js", destination_directory);
1515 copy_resource("jscoverage-ie.css", destination_directory);
1516 copy_resource("jscoverage-throbber.gif", destination_directory);
1517 copy_resource("jscoverage-highlight.css", destination_directory);
1518 }
1519
1520 /*
1521 coverage reports
1522 */
1523
1524 struct FileCoverageList {
1525 FileCoverage * file_coverage;
1526 struct FileCoverageList * next;
1527 };
1528
1529 struct Coverage {
1530 JSHashTable * coverage_table;
1531 struct FileCoverageList * coverage_list;
1532 };
1533
1534 static int compare_strings(const void * p1, const void * p2) {
1535 return strcmp(p1, p2) == 0;
1536 }
1537
1538 Coverage * Coverage_new(void) {
1539 Coverage * result = xmalloc(sizeof(Coverage));
1540 result->coverage_table = JS_NewHashTable(1024, JS_HashString, compare_strings, NULL, NULL, NULL);
1541 if (result->coverage_table == NULL) {
1542 fatal("cannot create hash table");
1543 }
1544 result->coverage_list = NULL;
1545 return result;
1546 }
1547
1548 void Coverage_delete(Coverage * coverage) {
1549 JS_HashTableDestroy(coverage->coverage_table);
1550 struct FileCoverageList * p = coverage->coverage_list;
1551 while (p != NULL) {
1552 free(p->file_coverage->coverage_lines);
1553 if (p->file_coverage->source_lines != NULL) {
1554 for (uint32 i = 0; i < p->file_coverage->num_source_lines; i++) {
1555 free(p->file_coverage->source_lines[i]);
1556 }
1557 free(p->file_coverage->source_lines);
1558 }
1559 free(p->file_coverage->id);
1560 free(p->file_coverage);
1561 struct FileCoverageList * q = p;
1562 p = p->next;
1563 free(q);
1564 }
1565 free(coverage);
1566 }
1567
1568 struct EnumeratorArg {
1569 CoverageForeachFunction f;
1570 void * p;
1571 };
1572
1573 static intN enumerator(JSHashEntry * entry, intN i, void * arg) {
1574 struct EnumeratorArg * enumerator_arg = arg;
1575 enumerator_arg->f(entry->value, i, enumerator_arg->p);
1576 return 0;
1577 }
1578
1579 void Coverage_foreach_file(Coverage * coverage, CoverageForeachFunction f, void * p) {
1580 struct EnumeratorArg enumerator_arg;
1581 enumerator_arg.f = f;
1582 enumerator_arg.p = p;
1583 JS_HashTableEnumerateEntries(coverage->coverage_table, enumerator, &enumerator_arg);
1584 }
1585
1586 int jscoverage_parse_json(Coverage * coverage, const uint8_t * json, size_t length) {
1587 int result = 0;
1588
1589 jschar * base = js_InflateString(context, (char *) json, &length);
1590 if (base == NULL) {
1591 fatal("out of memory");
1592 }
1593
1594 jschar * parenthesized_json = xnew(jschar, addst(length, 2));
1595 parenthesized_json[0] = '(';
1596 memcpy(parenthesized_json + 1, base, mulst(length, sizeof(jschar)));
1597 parenthesized_json[length + 1] = ')';
1598
1599 JS_free(context, base);
1600
1601 JSParseContext parse_context;
1602 if (! js_InitParseContext(context, &parse_context, NULL, NULL, parenthesized_json, length + 2, NULL, NULL, 1)) {
1603 free(parenthesized_json);
1604 return -1;
1605 }
1606 JSParseNode * root = js_ParseScript(context, global, &parse_context);
1607 free(parenthesized_json);
1608 if (root == NULL) {
1609 result = -1;
1610 goto done;
1611 }
1612
1613 /* root node must be TOK_LC */
1614 if (root->pn_type != TOK_LC) {
1615 result = -1;
1616 goto done;
1617 }
1618 JSParseNode * semi = root->pn_u.list.head;
1619
1620 /* the list must be TOK_SEMI and it must contain only one element */
1621 if (semi->pn_type != TOK_SEMI || semi->pn_next != NULL) {
1622 result = -1;
1623 goto done;
1624 }
1625 JSParseNode * parenthesized = semi->pn_kid;
1626
1627 /* this must be a parenthesized expression */
1628 if (parenthesized->pn_type != TOK_RP) {
1629 result = -1;
1630 goto done;
1631 }
1632 JSParseNode * object = parenthesized->pn_kid;
1633
1634 /* this must be an object literal */
1635 if (object->pn_type != TOK_RC) {
1636 result = -1;
1637 goto done;
1638 }
1639
1640 for (JSParseNode * p = object->pn_head; p != NULL; p = p->pn_next) {
1641 /* every element of this list must be TOK_COLON */
1642 if (p->pn_type != TOK_COLON) {
1643 result = -1;
1644 goto done;
1645 }
1646
1647 /* the key must be a string representing the file */
1648 JSParseNode * key = p->pn_left;
1649 if (key->pn_type != TOK_STRING || ! ATOM_IS_STRING(key->pn_atom)) {
1650 result = -1;
1651 goto done;
1652 }
1653 char * id_bytes = JS_GetStringBytes(ATOM_TO_STRING(key->pn_atom));
1654
1655 /* the value must be an object literal OR an array */
1656 JSParseNode * value = p->pn_right;
1657 if (! (value->pn_type == TOK_RC || value->pn_type == TOK_RB)) {
1658 result = -1;
1659 goto done;
1660 }
1661
1662 JSParseNode * array = NULL;
1663 JSParseNode * source = NULL;
1664 if (value->pn_type == TOK_RB) {
1665 /* an array */
1666 array = value;
1667 }
1668 else if (value->pn_type == TOK_RC) {
1669 /* an object literal */
1670 if (value->pn_count != 2) {
1671 result = -1;
1672 goto done;
1673 }
1674 for (JSParseNode * element = value->pn_head; element != NULL; element = element->pn_next) {
1675 if (element->pn_type != TOK_COLON) {
1676 result = -1;
1677 goto done;
1678 }
1679 JSParseNode * left = element->pn_left;
1680 if (left->pn_type != TOK_STRING || ! ATOM_IS_STRING(left->pn_atom)) {
1681 result = -1;
1682 goto done;
1683 }
1684 const char * s = JS_GetStringBytes(ATOM_TO_STRING(left->pn_atom));
1685 if (strcmp(s, "coverage") == 0) {
1686 array = element->pn_right;
1687 if (array->pn_type != TOK_RB) {
1688 result = -1;
1689 goto done;
1690 }
1691 }
1692 else if (strcmp(s, "source") == 0) {
1693 source = element->pn_right;
1694 if (source->pn_type != TOK_RB) {
1695 result = -1;
1696 goto done;
1697 }
1698 }
1699 else {
1700 result = -1;
1701 goto done;
1702 }
1703 }
1704 }
1705 else {
1706 result = -1;
1707 goto done;
1708 }
1709
1710 if (array == NULL) {
1711 result = -1;
1712 goto done;
1713 }
1714
1715 /* look up the file in the coverage table */
1716 FileCoverage * file_coverage = JS_HashTableLookup(coverage->coverage_table, id_bytes);
1717 if (file_coverage == NULL) {
1718 /* not there: create a new one */
1719 char * id = xstrdup(id_bytes);
1720 file_coverage = xmalloc(sizeof(FileCoverage));
1721 file_coverage->id = id;
1722 file_coverage->num_coverage_lines = array->pn_count;
1723 file_coverage->coverage_lines = xnew(int, array->pn_count);
1724 file_coverage->source_lines = NULL;
1725
1726 /* set coverage for all lines */
1727 uint32 i = 0;
1728 for (JSParseNode * element = array->pn_head; element != NULL; element = element->pn_next, i++) {
1729 if (element->pn_type == TOK_NUMBER) {
1730 file_coverage->coverage_lines[i] = (int) element->pn_dval;
1731 }
1732 else if (element->pn_type == TOK_PRIMARY && element->pn_op == JSOP_NULL) {
1733 file_coverage->coverage_lines[i] = -1;
1734 }
1735 else {
1736 result = -1;
1737 goto done;
1738 }
1739 }
1740 assert(i == array->pn_count);
1741
1742 /* add to the hash table */
1743 JS_HashTableAdd(coverage->coverage_table, id, file_coverage);
1744 struct FileCoverageList * coverage_list = xmalloc(sizeof(struct FileCoverageList));
1745 coverage_list->file_coverage = file_coverage;
1746 coverage_list->next = coverage->coverage_list;
1747 coverage->coverage_list = coverage_list;
1748 }
1749 else {
1750 /* sanity check */
1751 assert(strcmp(file_coverage->id, id_bytes) == 0);
1752 if (file_coverage->num_coverage_lines != array->pn_count) {
1753 result = -2;
1754 goto done;
1755 }
1756
1757 /* merge the coverage */
1758 uint32 i = 0;
1759 for (JSParseNode * element = array->pn_head; element != NULL; element = element->pn_next, i++) {
1760 if (element->pn_type == TOK_NUMBER) {
1761 if (file_coverage->coverage_lines[i] == -1) {
1762 result = -2;
1763 goto done;
1764 }
1765 file_coverage->coverage_lines[i] += (int) element->pn_dval;
1766 }
1767 else if (element->pn_type == TOK_PRIMARY && element->pn_op == JSOP_NULL) {
1768 if (file_coverage->coverage_lines[i] != -1) {
1769 result = -2;
1770 goto done;
1771 }
1772 }
1773 else {
1774 result = -1;
1775 goto done;
1776 }
1777 }
1778 assert(i == array->pn_count);
1779 }
1780
1781 /* if this JSON file has source, use it */
1782 if (file_coverage->source_lines == NULL && source != NULL) {
1783 file_coverage->num_source_lines = source->pn_count;
1784 file_coverage->source_lines = xnew(char *, source->pn_count);
1785 uint32 i = 0;
1786 for (JSParseNode * element = source->pn_head; element != NULL; element = element->pn_next, i++) {
1787 if (element->pn_type != TOK_STRING) {
1788 result = -1;
1789 goto done;
1790 }
1791 file_coverage->source_lines[i] = xstrdup(JS_GetStringBytes(ATOM_TO_STRING(element->pn_atom)));
1792 }
1793 assert(i == source->pn_count);
1794 }
1795 }
1796
1797 done:
1798 js_FinishParseContext(context, &parse_context);
1799 return result;
1800 }

  ViewVC Help
Powered by ViewVC 1.1.24