Sponsored Content
Operating Systems Solaris Bound, Unbound, Idle, Listening, Post 302711553 by cjashu on Sunday 7th of October 2012 02:15:05 AM
Old 10-07-2012
This is not a homework. I am doing self study at home using linuxcbt.com
Thanks very much.
 

8 More Discussions You Might Find Interesting

1. What is on Your Mind?

So... What are you listening to?

Hi guys, lets make this more interesting... I'm sure you listen to something when your working on a project or something... I know, I do, helps with concentration. Track: ±¯¸èÖ®Íõ (King of sad songs) Artist: -îǧ‹Ã Miriam Yeung Lovely forum BTW! :D (33 Replies)
Discussion started by: hype.it
33 Replies

2. What is on Your Mind?

What are you listening to right now?

This is has been posted many times before... It is not in this forum as of now, so I have decided to put it here :D I'm listening to The Outsiders (AKA Hell is for Heros Part I) by Modern Life is War.... what about ya'll? (4 Replies)
Discussion started by: Mars8082686
4 Replies

3. Solaris

List zones bound to a pool

How to get the list of zones which are bound to a pool say appPool. Rather then logging in each zone and then check from pool stat command. (3 Replies)
Discussion started by: fugitive
3 Replies

4. Programming

env not bound: BEDEWORK

I was trying to test dump data on bedework jxi console however I got the error below.I'm using debian as my OS and installed quickstart bedework on it. Pls advise what am I missing. thanks Caused by: javax.naming.NameNotFoundException: env not bound at... (1 Reply)
Discussion started by: lhareigh890
1 Replies

5. Linux

Memory bound error...

Hi all, Am getting the below error for a job that is run in our system. error code: 114, pc=0, call=1, seg=0 114 Attempt to access item beyond bounds of memory (Signal 11) This job uses a cobol program and as far as I know, the problem is related to this cobol program. What does this... (1 Reply)
Discussion started by: das.somik
1 Replies

6. High Performance Computing

I/O bound computing clusters

I want to build a computing cluster and have been looking into grid solutions. My understanding from grid solutions is that participating nodes have to actually sign up to participate in a computation and that an isolated piece of work is sent to the node through a request from that node (pull).... (4 Replies)
Discussion started by: figaro
4 Replies

7. Emergency UNIX and Linux Support

How to fix the CPU bound issues on AIX?

Hi All, Can you please answer my question. i see lot of CPU utilization on AIX LPARs. i am able to find the cause of the probelm. But i do not know how to mitigate or fix the problem. for instance, i found the process which is consuming most of CPU. i informed the responsible team. how... (7 Replies)
Discussion started by: System Admin 77
7 Replies

8. Shell Programming and Scripting

Awk: get upper and lower bound per group

Hi all, I've data as: 22 51018157 51018157 exonic CHKB nonsynonymous SNV 22 51018204 51018204 exonic CHKB nonsynonymous SNV 22 51018428 51018428 exonic CHKB nonsynonymous SNV 22 51018814 51018814 ... (4 Replies)
Discussion started by: genome
4 Replies
PCREPRECOMPILE(3)					     Library Functions Manual						 PCREPRECOMPILE(3)

NAME
PCRE - Perl-compatible regular expressions SAVING AND RE-USING PRECOMPILED PCRE PATTERNS If you are running an application that uses a large number of regular expression patterns, it may be useful to store them in a precompiled form instead of having to compile them every time the application is run. If you are not using any private character tables (see the pcre_maketables() documentation), this is relatively straightforward. If you are using private tables, it is a little bit more complicated. However, if you are using the just-in-time optimization feature, it is not possible to save and reload the JIT data. If you save compiled patterns to a file, you can copy them to a different host and run them there. If the two hosts have different endian- ness (byte order), you should run the pcre[16]_pattern_to_host_byte_order() function on the new host before trying to match the pattern. The matching functions return PCRE_ERROR_BADENDIANNESS if they detect a pattern with the wrong endianness. Compiling regular expressions with one version of PCRE for use with a different version is not guaranteed to work and may cause crashes, and saving and restoring a compiled pattern loses any JIT optimization data. SAVING A COMPILED PATTERN
The value returned by pcre[16]_compile() points to a single block of memory that holds the compiled pattern and associated data. You can find the length of this block in bytes by calling pcre[16]_fullinfo() with an argument of PCRE_INFO_SIZE. You can then save the data in any appropriate manner. Here is sample code for the 8-bit library that compiles a pattern and writes it to a file. It assumes that the variable fd refers to a file that is open for output: int erroroffset, rc, size; char *error; pcre *re; re = pcre_compile("my pattern", 0, &error, &erroroffset, NULL); if (re == NULL) { ... handle errors ... } rc = pcre_fullinfo(re, NULL, PCRE_INFO_SIZE, &size); if (rc < 0) { ... handle errors ... } rc = fwrite(re, 1, size, fd); if (rc != size) { ... handle errors ... } In this example, the bytes that comprise the compiled pattern are copied exactly. Note that this is binary data that may contain any of the 256 possible byte values. On systems that make a distinction between binary and non-binary data, be sure that the file is opened for binary output. If you want to write more than one pattern to a file, you will have to devise a way of separating them. For binary data, preceding each pattern with its length is probably the most straightforward approach. Another possibility is to write out the data in hexadecimal instead of binary, one pattern to a line. Saving compiled patterns in a file is only one possible way of storing them for later use. They could equally well be saved in a database, or in the memory of some daemon process that passes them via sockets to the processes that want them. If the pattern has been studied, it is also possible to save the normal study data in a similar way to the compiled pattern itself. How- ever, if the PCRE_STUDY_JIT_COMPILE was used, the just-in-time data that is created cannot be saved because it is too dependent on the cur- rent environment. When studying generates additional information, pcre[16]_study() returns a pointer to a pcre[16]_extra data block. Its format is defined in the section on matching a pattern in the pcreapi documentation. The study_data field points to the binary study data, and this is what you must save (not the pcre[16]_extra block itself). The length of the study data can be obtained by calling pcre[16]_fullinfo() with an argument of PCRE_INFO_STUDYSIZE. Remember to check that pcre[16]_study() did return a non-NULL value before trying to save the study data. RE-USING A PRECOMPILED PATTERN Re-using a precompiled pattern is straightforward. Having reloaded it into main memory, called pcre[16]_pattern_to_host_byte_order() if necessary, you pass its pointer to pcre[16]_exec() or pcre[16]_dfa_exec() in the usual way. However, if you passed a pointer to custom character tables when the pattern was compiled (the tableptr argument of pcre[16]_compile()), you must now pass a similar pointer to pcre[16]_exec() or pcre[16]_dfa_exec(), because the value saved with the compiled pattern will obvi- ously be nonsense. A field in a pcre[16]_extra() block is used to pass this data, as described in the section on matching a pattern in the pcreapi documentation. If you did not provide custom character tables when the pattern was compiled, the pointer in the compiled pattern is NULL, which causes the matching functions to use PCRE's internal tables. Thus, you do not need to take any special action at run time in this case. If you saved study data with the compiled pattern, you need to create your own pcre[16]_extra data block and set the study_data field to point to the reloaded study data. You must also set the PCRE_EXTRA_STUDY_DATA bit in the flags field to indicate that study data is present. Then pass the pcre[16]_extra block to the matching function in the usual way. If the pattern was studied for just-in-time opti- mization, that data cannot be saved, and so is lost by a save/restore cycle. COMPATIBILITY WITH DIFFERENT PCRE RELEASES
In general, it is safest to recompile all saved patterns when you update to a new PCRE release, though not all updates actually require this. AUTHOR
Philip Hazel University Computing Service Cambridge CB2 3QH, England. REVISION
Last updated: 10 January 2012 Copyright (c) 1997-2012 University of Cambridge. PCREPRECOMPILE(3)
All times are GMT -4. The time now is 10:43 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy