Skip to main content

HHVM PHP Convert to ByteCode Building the Repo and Deployment Process


Step 1: Manually Building the Repo.

         Two type method of building the Repo. :-

Sub Step 1: Everything Under a Root 
To build a repo including all files recursively under /path/to/root, invoke HHVM like this:

$ sudo hhvm --hphp -t hhbc -v AllVolatile=true --input-dir /var/www/html

Sub Step 2: Manual List of Files
Instead of a directory, you can also pass it an explicit list of filenames to put in the repo or a master file that contains all of the files, one per line, that should be put in the repo. (Keep in mind that the commands below are generating two separate repos -- you can't add to or remove from a repo once it's been generated!)

$ sudo hhvm --hphp -t hhbc -v AllVolatile=true test.php

OR 

$ sudo hhvm --hphp -t hhbc -v AllVolatile=true --input-list test.txt

Example : The test.txt should look like this :

/var/www/html/index.php
/var/www/html/isrc/a.php
/var/www/html/isrc/b.php

/var/www/html/ilib/c.php

Step 2: Both Process Response
Output look like this  :

parsing inputs...
analyzeProgram...
analyzeProgram took 0'00" (837359 us) wall time
parsing inputs took 0'12" (12853383 us) wall time
pre-optimizing...
pre-optimizing took 0'01" (1232182 us) wall time
creating binary HHBC files...
creating binary HHBC files took 0'52" (52337765 us) wall time
all files saved in /tmp/hphp_tGw0TO ...

running hphp took 1'07" (67944928 us) wall time

Note : bytecode repo  /path/to/ = /tmp/hphp_tGw0TO

Step 3 : Permission to ByteCode folder

$ sudo chmod -R 777 /tmp/hphp_tGw0TO

Step 4: Manually Deploying the Repo
You can put the repo file anywhere as long as these two ini settings are set correctly in your server.ini (or equivalent) file

$ sudo hhvm.repo.authoritative=true
$ sudo hhvm.repo.central.path=/tmp/hphp_tGw0TO/hhvm.hhbc

Step 5: HHVM SERVER RESTART AND CHECK STATUS

$ sudo service hhvm restart

$ sudo service hhvm status

OUTPUT :


* hhvm is running


Comments

Post a Comment

Popular posts from this blog

Java Loops II print each element of our series as a single line of space-separated values.

We use the integers  ,  , and   to create the following series: You are given   queries in the form of  ,  , and  . For each query, print the series corresponding to the given  ,  , and   values as a single line of   space-separated integers. Input Format The first line contains an integer,  , denoting the number of queries.  Each line   of the   subsequent lines contains three space-separated integers describing the respective  ,  , and   values for that query. Constraints Output Format For each query, print the corresponding series on a new line. Each series must be printed in order as a single line of   space-separated integers. Sample Input 2 0 2 10 5 3 5 Sample Output 2 6 14 30 62 126 254 510 1022 2046 8 14 26 50 98 Explanation We have two queries: We use  ,  , and   to produce some series  : ... and so on. Once we hit  , we print the first ten terms as a single line of space-separate

Java Currency Formatter Solution

Given a  double-precision  number,  , denoting an amount of money, use the  NumberFormat  class'  getCurrencyInstance  method to convert   into the US, Indian, Chinese, and French currency formats. Then print the formatted values as follows: US: formattedPayment India: formattedPayment China: formattedPayment France: formattedPayment where   is   formatted according to the appropriate  Locale 's currency. Note:  India does not have a built-in Locale, so you must  construct one  where the language is  en  (i.e., English). Input Format A single double-precision number denoting  . Constraints Output Format On the first line, print  US: u  where   is   formatted for US currency.  On the second line, print  India: i  where   is   formatted for Indian currency.  On the third line, print  China: c  where   is   formatted for Chinese currency.  On the fourth line, print  France: f , where   is   formatted for French currency. Sample

Java Substring Comparisons

We define the following terms: Lexicographical Order , also known as  alphabetic  or  dictionary  order, orders characters as follows:  For example,  ball < cat ,  dog < dorm ,  Happy < happy ,  Zoo < ball . A  substring  of a string is a contiguous block of characters in the string. For example, the substrings of  abc  are  a ,  b ,  c ,  ab ,  bc , and  abc . Given a string,  , and an integer,  , complete the function so that it finds the lexicographically  smallest  and  largest substrings of length  . Input Format The first line contains a string denoting  . The second line contains an integer denoting  . Constraints  consists of English alphabetic letters only (i.e.,  [a-zA-Z] ). Output Format Return the respective lexicographically smallest and largest substrings as a single newline-separated string. Sample Input 0 welcometojava 3 Sample Output 0 ava wel Explanation 0 S